Uses of Interface
one.microstream.collections.types.XDecreasingSequence
-
Packages that use XDecreasingSequence Package Description one.microstream.collections one.microstream.collections.sorting one.microstream.collections.types -
-
Uses of XDecreasingSequence in one.microstream.collections
Classes in one.microstream.collections that implement XDecreasingSequence Modifier and Type Class Description classArrayCollector<E>Full scale general purpose implementation of extended collection typeXList.classBulkList<E>Full scale general purpose implementation of extended collection typeXList.classEqBulkList<E>Full scale general purpose implementation of extended collection typeXList.classEqHashEnum<E>classEqHashTable<K,V>classEqHashTable.KeysclassEqHashTable.ValuesclassHashEnum<E>classHashTable<K,V>classHashTable.KeysclassHashTable.ValuesclassLimitList<E>Full scale general purpose implementation of extended collection typeXList.classLockedList<E>classSingle<E>classSubList<E>classSubListProcessor<E>classSynchList<E>Synchronization wrapper class that wraps anXListinstance in public synchronized delegate methods. -
Uses of XDecreasingSequence in one.microstream.collections.sorting
Subinterfaces of XDecreasingSequence in one.microstream.collections.sorting Modifier and Type Interface Description static interfaceXChart.Values<K,V> -
Uses of XDecreasingSequence in one.microstream.collections.types
Subinterfaces of XDecreasingSequence in one.microstream.collections.types Modifier and Type Interface Description static interfaceXBasicTable.Values<K,V>interfaceXDecreasingEnum<E>Intermediate list type that combines all list aspects except increasing (adding and inserting), effectively causing instances of this list type to maintain its size or shrink, but never grow.interfaceXDecreasingList<E>Intermediate list type that combines all list aspects except increasing (adding and inserting), effectively causing instances of this list type to maintain its size or shrink, but never grow.interfaceXEnum<E>interfaceXList<E>Extended List interface with a ton of badly needed list procedures like distinction between identity and equality element comparison, procedure range specification, higher order (functional) procedures, proper toArray() methods, etc.
AllXListimplementations have to haveRandomAccessbehavior.
Intelligent implementations make non-random-access implementations like simple linked lists obsolete.interfaceXTable<K,V>static interfaceXTable.Keys<K,V>static interfaceXTable.Values<K,V>Methods in one.microstream.collections.types that return XDecreasingSequence Modifier and Type Method Description XDecreasingSequence<E>XDecreasingSequence. copy()XDecreasingSequence<E>XDecreasingSequence.Creator. newInstance()XDecreasingSequence<E>XDecreasingSequence. range(long fromIndex, long toIndex)XDecreasingSequence<E>XDecreasingSequence. reverse()XDecreasingSequence<E>XDecreasingSequence. set(long index, E[] elements, int offset, int length)XDecreasingSequence<E>XDecreasingSequence. set(long index, XGettingSequence<? extends E> elements, long offset, long length)XDecreasingSequence<E>XDecreasingSequence. setAll(long index, E... elements)XDecreasingSequence<E>XDecreasingSequence. sort(Comparator<? super E> comparator)XDecreasingSequence<E>XDecreasingSequence. swap(long indexA, long indexB)XDecreasingSequence<E>XDecreasingSequence. swap(long indexA, long indexB, long length)XDecreasingSequence<E>XDecreasingSequence. toReversed()
-