Giter VIP home page Giter VIP logo

mapper's Introduction

mapper's People

Contributors

agusakow avatar alexandrvb avatar alshan avatar anqidong avatar aprilfire avatar azlobinjb avatar cheatex avatar eviltosha avatar glebleonov avatar hsestupin avatar igro avatar katepol avatar kirelagin avatar kirillp avatar krestjaninoff avatar miob avatar solomatov avatar timzam avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

mapper's Issues

Tutorial

Is it possible to have a tutorial on usage?

Composing ValueProperties

I have a service that returns ValueProperty<A> and another service that returns ValueProperty<B>.

I want to create a service that returns ValueProperty<C> that takes as inputs ValueProperty<A> and ValueProperty<B>.

So the method signature looks like:

ValueProperty<C> blah(ValueProperty<A>a , ValueProperty<B> b);

Whats the best way to implement this such that events propagate from the sources a and b, and when disposing c all listeners are cleaned up.

Thanks!

ps.

also the simpler case of mapping an ValueProperty<A> to ValueProperty<C>, is there anything like a map function built in?

ValueProperty<C> c = a.map(theA -> aToC(theA))

Inefficient Usage of ArrayList and TreeMap

Hi,
We find that there are several ArrayList objects which are not manipulated by random access. Due to the memory reallocation triggered in the successive insertions, the time complexity of add method of ArrayList is amortized O(1). We notice that these objects are only used for traversal, the retrieval, and removal of the first or the last element.

This functionality can be implemented by LinkedList. Moreover, the insertion of LinkedList is strictly O(1) time complexity because no memory reallocation occurs.

Meanwhile, we also found several TreeMap objects which are not necessary to maintain the key order relation. To achieve the same functionality, HashHap is enough. The replacement can also reduce the time cost in the modification of the map objects.

We discovered the above inefficient usage of containers by our tool Ditto. The patch is submitted in #219. Could you please check and accept it? We have tested the patch on our PC. The patched program works well.

Bests

Ditto

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.