Uses of Interface
one.microstream.collections.types.XRemovingList

Packages that use XRemovingList

Package	Description
one.microstream.collections
one.microstream.collections.sorting
one.microstream.collections.types

Uses of XRemovingList in one.microstream.collections

Classes in one.microstream.collections that implement XRemovingList

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	ListProcessor<E>
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.

Uses of XRemovingList in one.microstream.collections.sorting

Subinterfaces of XRemovingList in one.microstream.collections.sorting

Modifier and Type	Interface and Description
static interface	XChart.Values<K,V>
interface	XLadder<E>

Uses of XRemovingList in one.microstream.collections.types

Subinterfaces of XRemovingList in one.microstream.collections.types

Modifier and Type	Interface and Description
interface	XBasicList<E> Intermediate list type providing getting, adding, removing concerns to act as a common super type for XList and XLadder.
static interface	XBasicTable.Values<K,V>
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	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	XProcessingList<E>
static interface	XTable.Values<K,V>