pl.touk.nussknacker.engine.flink.util.orderedmap
This implementation is based on java's mutable HashMap.
This implementation is based on java's mutable HashMap. It has good O(1) characteristics for updates but worse than TreeMap for range filtering O(n). It uses Flink's serialization which is more efficient than Kryo
This implementation is based on scala's immutable SortedMap (TreeMap).
This implementation is based on scala's immutable SortedMap (TreeMap). It has good O(lgN) characteristics for range filtering which can be important for some usages. In the other hand it uses Kryo for serialization which is inefficient
(Since version ) see corresponding Javadoc for more information.