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

Packages that use XRemovingBag

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

Uses of XRemovingBag in one.microstream.collections

Classes in one.microstream.collections that implement XRemovingBag

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	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 XRemovingBag in one.microstream.collections.sorting

Subinterfaces of XRemovingBag in one.microstream.collections.sorting

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

Uses of XRemovingBag in one.microstream.collections.types

Subinterfaces of XRemovingBag in one.microstream.collections.types

Modifier and Type	Interface	Description
interface	XBag<E>	Bag type collections make the single demand (thus being a level 1 collection type) that duplicate elements have to be allowed, effectively being the opposite to set type collections.
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.
static interface	XMap.Values<K,V>
interface	XProcessingBag<E>
interface	XProcessingList<E>
static interface	XProcessingMap.Values<K,V>
interface	XRemovingList<E>
static interface	XTable.Values<K,V>

Methods in one.microstream.collections.types that return XRemovingBag

Modifier and Type	Method	Description
XRemovingBag<E>	XRemovingBag.Factory.newInstance()