| 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 |
EqHashTable.Values |
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 | Method and Description |
|---|---|
XDecreasingList<E> |
SubListProcessor.fill(long offset,
long length,
E element) |
XDecreasingList<E> |
SubListProcessor.reverse() |
XDecreasingList<E> |
SubListProcessor.set(long index,
E[] elements,
int offset,
int length) |
XDecreasingList<E> |
SubListProcessor.set(long index,
XGettingSequence<? extends E> elements,
long offset,
long length) |
XDecreasingList<E> |
SubListProcessor.setAll(long index,
E... elements) |
XDecreasingList<E> |
SubListProcessor.sort(Comparator<? super E> comparator) |
XDecreasingList<E> |
SubListProcessor.swap(long indexA,
long indexB) |
XDecreasingList<E> |
SubListProcessor.swap(long indexA,
long indexB,
long length) |
| 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 |
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. |
static interface |
XTable.Values<K,V> |
| Modifier and Type | Method and Description |
|---|---|
XDecreasingList<E> |
XDecreasingList.copy() |
XDecreasingList<E> |
XDecreasingList.fill(long offset,
long length,
E element) |
XDecreasingList<E> |
XDecreasingList.Creator.newInstance() |
XDecreasingList<E> |
XDecreasingList.range(long fromIndex,
long toIndex) |
XDecreasingList<E> |
XDecreasingList.reverse() |
XDecreasingList<E> |
XDecreasingList.set(long index,
E[] elements,
int offset,
int length) |
XDecreasingList<E> |
XDecreasingList.set(long index,
XGettingSequence<? extends E> elements,
long offset,
long length) |
XDecreasingList<E> |
XDecreasingList.setAll(long index,
E... elements) |
XDecreasingList<E> |
XDecreasingList.sort(Comparator<? super E> comparator) |
XDecreasingList<E> |
XDecreasingList.swap(long indexA,
long indexB) |
XDecreasingList<E> |
XDecreasingList.swap(long indexA,
long indexB,
long length) |
XDecreasingList<E> |
XDecreasingList.toReversed() |
Copyright © 2022 MicroStream Software. All rights reserved.