-
Classes in one.microstream.collections that implement XIncreasingSequence
Modifier and Type |
Class |
Description |
class |
ArrayCollector<E> |
Full scale general purpose implementation of extended collection type XList .
|
class |
BulkList<E> |
Collection that is ordered and allows duplicates.
|
class |
EqBulkList<E> |
Full scale general purpose implementation of extended collection type XList .
|
class |
EqHashEnum<E> |
Collection that is ordered and does not allow duplicates.
|
class |
EqHashTable<K,V> |
Collection of key-value-pairs that is ordered and does not allow duplicate keys.
|
class |
EqHashTable.Keys |
|
class |
HashEnum<E> |
Collection that is ordered and does not allow duplicates.
|
class |
HashTable<K,V> |
Collection of key-value-pairs that is ordered and does not allow duplicate keys.
|
class |
HashTable.Keys |
|
class |
LimitList<E> |
Full scale general purpose implementation of extended collection type XList .
|
class |
LockedList<E> |
|
class |
Single<E> |
|
class |
SubList<E> |
|
class |
SynchList<E> |
Synchronization wrapper class that wraps an XList instance in public synchronized delegate methods.
|
-
Subinterfaces of XIncreasingSequence in one.microstream.collections.types
Modifier and Type |
Interface |
Description |
interface |
XEnum<E> |
|
interface |
XIncreasingEnum<E> |
|
interface |
XIncreasingList<E> |
|
interface |
XList<E> |
Extended List interface with additional list procedures like distinction between identity and equality
element comparison, procedure range specification, higher order (functional) procedures, proper toArray() methods,
etc.
All XList implementations have to have RandomAccess behavior.
Intelligent implementations make non-random-access implementations like simple linked lists obsolete.
|
interface |
XTable<K,V> |
|
static interface |
XTable.Keys<K,V> |
|
Methods in one.microstream.collections.types that return XIncreasingSequence
Modifier and Type |
Method |
Description |
XIncreasingSequence<E> |
XIncreasingSequence.addAll(E... elements) |
|
XIncreasingSequence<E> |
XIncreasingSequence.addAll(E[] elements,
int offset,
int length) |
|
XIncreasingSequence<E> |
XIncreasingSequence.addAll(XGettingCollection<? extends E> elements) |
|
XIncreasingSequence<E> |
XIncreasingSequence.copy() |
|
XIncreasingSequence<E> |
XIncreasingSequence.Creator.newInstance() |
|
XIncreasingSequence<E> |
XIncreasingSequence.prependAll(E... elements) |
|
XIncreasingSequence<E> |
XIncreasingSequence.prependAll(E[] elements,
int offset,
int length) |
|
XIncreasingSequence<E> |
XIncreasingSequence.prependAll(XGettingCollection<? extends E> elements) |
|
XIncreasingSequence<E> |
XIncreasingSequence.preputAll(E... elements) |
|
XIncreasingSequence<E> |
XIncreasingSequence.preputAll(E[] elements,
int offset,
int length) |
|
XIncreasingSequence<E> |
XIncreasingSequence.preputAll(XGettingCollection<? extends E> elements) |
|
XIncreasingSequence<E> |
XIncreasingSequence.putAll(E... elements) |
|
XIncreasingSequence<E> |
XIncreasingSequence.putAll(E[] elements,
int offset,
int length) |
|
XIncreasingSequence<E> |
XIncreasingSequence.putAll(XGettingCollection<? extends E> elements) |
|
XIncreasingSequence<E> |
XIncreasingSequence.range(long fromIndex,
long toIndex) |
|
XIncreasingSequence<E> |
XIncreasingSequence.reverse() |
|
XIncreasingSequence<E> |
XIncreasingSequence.sort(Comparator<? super E> comparator) |
|
XIncreasingSequence<E> |
XIncreasingSequence.swap(long indexA,
long indexB) |
|
XIncreasingSequence<E> |
XIncreasingSequence.swap(long indexA,
long indexB,
long length) |
|
XIncreasingSequence<E> |
XIncreasingSequence.toReversed() |
|