| 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 |
Collector<E> |
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 |
LockedAdder<E> |
class |
LockedCollection<E> |
class |
LockedList<E> |
class |
LockedMap<K,V> |
class |
MutexSet<E> |
class |
Single<E> |
class |
SubCollector<E> |
class |
SubList<E> |
class |
SynchAdder<E> |
class |
SynchCollection<E>
Synchronization wrapper class that wraps an
XCollection instance in public synchronized delegate methods. |
class |
SynchList<E>
Synchronization wrapper class that wraps an
XList instance in public synchronized delegate methods. |
class |
SynchSet<E>
Synchronization wrapper class that wraps an
XSet instance in public synchronized delegate methods. |
| Modifier and Type | Method and Description |
|---|---|
CapacityExtendable |
HashTable.ensureCapacity(long minimalCapacity) |
CapacityExtendable |
EqHashTable.ensureCapacity(long minimalCapacity) |
CapacityExtendable |
LockedMap.ensureCapacity(long minimalCapacity) |
CapacityExtendable |
EqHashEnum.ensureCapacity(long minimalCapacity) |
CapacityExtendable |
HashEnum.ensureCapacity(long minimalCapacity) |
CapacityExtendable |
HashTable.ensureFreeCapacity(long requiredFreeCapacity) |
CapacityExtendable |
EqHashTable.ensureFreeCapacity(long requiredFreeCapacity) |
CapacityExtendable |
LockedMap.ensureFreeCapacity(long minimalFreeCapacity) |
CapacityExtendable |
EqHashEnum.ensureFreeCapacity(long requiredFreeCapacity) |
CapacityExtendable |
HashEnum.ensureFreeCapacity(long requiredFreeCapacity) |
| Modifier and Type | Method and Description |
|---|---|
CapacityExtendable |
CapacityExtendable.ensureCapacity(long minimalCapacity) |
CapacityExtendable |
CapacityExtendable.ensureFreeCapacity(long minimalFreeCapacity)
Ensures that the next minimalFreeCapacity elements can be actually added in a fast way,
meaning for example no internal storage rebuild will be necessary.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
XAddingSortation<E> |
interface |
XChart<K,V> |
static interface |
XChart.Keys<K,V> |
interface |
XLadder<E> |
interface |
XPutGetSortation<E> |
interface |
XPuttingSortation<E> |
interface |
XRank<E> |
interface |
XSortation<E>
Actually being a "Collation" (a collection of elements to which a sortation is applied), this type has been named
"Sortation" nevertheless to avoid the mistakable similarity to the basic collection type "Collection" in reading,
writing, talking and IntelliSense filtering.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
XAddGetCollection<E> |
interface |
XAddGetMap<K,V> |
interface |
XAddGetSet<E> |
interface |
XAddingBag<E> |
interface |
XAddingCollection<E>
Adding aspect:
add all elements that do not logically conflict with already contained elements according to the collection's logic. |
interface |
XAddingEnum<E> |
interface |
XAddingList<E> |
interface |
XAddingMap<K,V> |
interface |
XAddingSequence<E> |
interface |
XAddingSet<E> |
interface |
XAddingTable<K,V> |
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 |
XBasicEnum<E>
|
interface |
XBasicList<E>
|
interface |
XBasicSequence<E>
Intermediate sequence type providing getting, adding, removing concerns to act as a common super type for
XSequence and XSortation. |
interface |
XBasicTable<K,V> |
static interface |
XBasicTable.Keys<K,V> |
interface |
XCollection<E>
A collection is the root type for all collections (level 0 collection type).
|
interface |
XEnum<E> |
interface |
XExpandingEnum<E> |
interface |
XExpandingList<E> |
interface |
XExpandingSequence<E> |
interface |
XExtendingEnum<E> |
interface |
XExtendingList<E> |
interface |
XExtendingSequence<E> |
interface |
XIncreasingEnum<E> |
interface |
XIncreasingList<E> |
interface |
XIncreasingSequence<E> |
interface |
XInputtingEnum<E> |
interface |
XInputtingList<E> |
interface |
XInputtingSequence<E> |
interface |
XInsertingEnum<E> |
interface |
XInsertingList<E> |
interface |
XInsertingSequence<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 |
XMap<K,V> |
static interface |
XMap.Keys<K,V> |
interface |
XPrependingEnum<E> |
interface |
XPrependingList<E> |
interface |
XPrependingSequence<E> |
interface |
XPreputtingEnum<E> |
interface |
XPreputtingList<E> |
interface |
XPreputtingSequence<E> |
interface |
XPutGetBag<E> |
interface |
XPutGetCollection<E> |
interface |
XPutGetEnum<E> |
interface |
XPutGetList<E> |
interface |
XPutGetMap<K,V> |
interface |
XPutGetSequence<E> |
interface |
XPutGetSet<E> |
interface |
XPuttingBag<E> |
interface |
XPuttingCollection<E>
Putting aspect:
Ensure that all putted elements are contained in the collection |
interface |
XPuttingEnum<E> |
interface |
XPuttingList<E> |
interface |
XPuttingMap<K,V> |
interface |
XPuttingSequence<E> |
interface |
XPuttingSet<E> |
interface |
XSequence<E>
Level 1 collection type defining the single demand for the collection's elements to be ordered.
|
interface |
XSet<E> |
interface |
XTable<K,V> |
static interface |
XTable.Keys<K,V> |
| Modifier and Type | Class and Description |
|---|---|
class |
OpenAdressingMiniSet<E>
Very primitive, but very fast open adressing hash
XSet implementation. |
| Modifier and Type | Method and Description |
|---|---|
CapacityExtendable |
OpenAdressingMiniSet.ensureCapacity(long minimalCapacity) |
CapacityExtendable |
OpenAdressingMiniSet.ensureFreeCapacity(long minimalFreeCapacity) |
Copyright © 2022 MicroStream Software. All rights reserved.