| Package | Description |
|---|---|
| one.microstream.collections | |
| one.microstream.collections.sorting | |
| one.microstream.collections.types |
| Modifier and Type | Class and 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 |
EqHashTable.Values |
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 |
HashTable.Values |
class |
LimitList<E>
Full scale general purpose implementation of extended collection type
XList. |
class |
LockedList<E> |
class |
Single<E> |
class |
SubList<E> |
class |
SubListProcessor<E> |
class |
SynchList<E>
Synchronization wrapper class that wraps an
XList instance in public synchronized delegate methods. |
| Modifier and Type | Interface and Description |
|---|---|
static interface |
XChart.Values<K,V> |
| Modifier and Type | Interface and Description |
|---|---|
static interface |
XBasicTable.Values<K,V> |
interface |
XDecreasingEnum<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.
|
interface |
XDecreasingList<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.
|
interface |
XEnum<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> |
static interface |
XTable.Values<K,V> |
| Modifier and Type | Method and 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() |
Copyright © 2022 MicroStream Software. All rights reserved.