| Modifier and Type | Method and Description |
|---|---|
static <K,V> KeyValue<K,V> |
X.KeyValue(K key,
V value) |
static <T,K,V> KeyValue<K,V> |
X.toKeyValue(T instance,
Function<? super T,KeyValue<K,V>> mapper) |
| Modifier and Type | Method and Description |
|---|---|
static <K,V> HashTable<K,V> |
X.Table(KeyValue<? extends K,? extends V>... elements) |
| Modifier and Type | Method and Description |
|---|---|
static <T,K,V> KeyValue<K,V> |
X.toKeyValue(T instance,
Function<? super T,KeyValue<K,V>> mapper) |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractChainKeyValueCollection<K,V,EN extends AbstractChainEntry<KeyValue<K,V>,K,V,EN>> |
class |
AbstractChainKeyValueStorage<K,V,EN extends AbstractChainEntry<KeyValue<K,V>,K,V,EN>> |
class |
ChainStrongStrongStorage<K,V,EN extends AbstractChainEntry<KeyValue<K,V>,K,V,EN>> |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractChainEntry<E,K,V,EN extends AbstractChainEntry<E,K,V,EN>> |
static class |
AbstractChainEntry.Head<E,K,V,EN extends AbstractChainEntry<E,K,V,EN>> |
class |
AbstractChainEntryLinked<E,K,V,EN extends AbstractChainEntryLinked<E,K,V,EN>> |
class |
AbstractChainEntryLinkedHashed<E,K,V,EN extends AbstractChainEntryLinkedHashed<E,K,V,EN>> |
class |
AbstractChainEntryLinkedKV<K,V,EN extends AbstractChainEntryLinkedKV<K,V,EN>> |
class |
AbstractChainEntryLinkedKVHashed<K,V,EN extends AbstractChainEntryLinkedKVHashed<K,V,EN>> |
class |
ChainEntryLinkedHashedStrong<E> |
class |
ChainEntryLinkedStrong<E> |
| Modifier and Type | Method and Description |
|---|---|
<T extends Consumer<? super KeyValue<K,V>>> |
HashTable.copySelection(T target,
long... indices) |
<T extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.copySelection(T target,
long... indices) |
<T extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.copySelection(T target,
long... indices) |
<T extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.copySelection(T target,
long... indices) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.copySelection(T target,
long... indices) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.copySelection(T target,
long... indices) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.copyTo(C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.copyTo(C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.copyTo(C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.copyTo(C target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.copyTo(T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.copyTo(T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.copyTo(T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.copyTo(T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.copyTo(T target) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.distinct(C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.distinct(C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.distinct(C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.distinct(C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.distinct(C target,
Equalator<? super KeyValue<K,V>> equalator) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.distinct(C target,
Equalator<? super KeyValue<K,V>> equalator) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.distinct(C target,
Equalator<? super KeyValue<K,V>> equalator) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.distinct(C target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.distinct(T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.distinct(T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.distinct(T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.distinct(T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.distinct(T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.filterTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.filterTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.filterTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.filterTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<P extends Consumer<? super KeyValue<K1,? extends XGettingMap<K2,V>>>> |
EqHash2DMap.iterate(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
HashTable.iterate(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.iterate(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.iterate(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.iterate(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.iterate(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
TableView.iterate(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
LockedMap.iterate(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
MapView.iterate(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.iterate(P procedure) |
<P extends IndexedAcceptor<? super KeyValue<K,V>>> |
HashTable.iterateIndexed(P procedure) |
<P extends IndexedAcceptor<? super KeyValue<K,V>>> |
EqHashTable.iterateIndexed(P procedure) |
<P extends IndexedAcceptor<? super KeyValue<K,V>>> |
EqConstHashTable.iterateIndexed(P procedure) |
<P extends IndexedAcceptor<? super KeyValue<K,V>>> |
ConstHashTable.iterateIndexed(P procedure) |
<P extends IndexedAcceptor<? super KeyValue<K,V>>> |
EmptyTable.iterateIndexed(P procedure) |
<P extends IndexedAcceptor<? super KeyValue<K,V>>> |
TableView.iterateIndexed(P procedure) |
<PIE extends Consumer<? super KeyValue<K2,V>>> |
EqHash2DMap.iterateInnerEntries(PIE procedure) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.moveSelection(C target,
long... indices) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.moveSelection(C target,
long... indices) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.moveTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.moveTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
LockedMap.moveTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<P extends Consumer<? super KeyValue<K,V>>> |
HashTable.process(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.process(P procedure) |
<P extends Consumer<? super KeyValue<K,V>>> |
LockedMap.process(P processor) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
| Modifier and Type | Method and Description |
|---|---|
KeyValue<K,V> |
HashTable.addGet(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.addGet(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.addGet(KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.addGet(K key,
V value) |
KeyValue<K,V> |
EqHashTable.addGet(K key,
V value) |
KeyValue<K,V> |
LockedMap.addGet(K key,
V value) |
KeyValue<K,V> |
HashTable.at(long index) |
KeyValue<K,V> |
EqHashTable.at(long index) |
KeyValue<K,V> |
EqConstHashTable.at(long index) |
KeyValue<K,V> |
ConstHashTable.at(long index) |
KeyValue<K,V> |
EmptyTable.at(long index) |
KeyValue<K,V> |
TableView.at(long index) |
KeyValue<K,V> |
HashTable.deduplicate(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.deduplicate(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.deduplicate(KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.fetch() |
KeyValue<K,V> |
EqHashTable.fetch() |
KeyValue<K,V> |
LockedMap.fetch() |
KeyValue<K,V> |
HashTable.first() |
KeyValue<K,V> |
EqHashTable.first() |
KeyValue<K,V> |
EqConstHashTable.first() |
KeyValue<K,V> |
ConstHashTable.first() |
KeyValue<K,V> |
EmptyTable.first() |
KeyValue<K,V> |
TableView.first() |
KeyValue<K,V> |
HashTable.get() |
KeyValue<K,V> |
EqHashTable.get() |
KeyValue<K,V> |
EqConstHashTable.get() |
KeyValue<K,V> |
ConstHashTable.get() |
KeyValue<K,V> |
EmptyTable.get() |
KeyValue<K,V> |
TableView.get() |
KeyValue<K,V> |
LockedMap.get() |
KeyValue<K,V> |
MapView.get() |
KeyValue<K,V> |
LockedGettingMap.get() |
KeyValue<K,V> |
HashTable.last() |
KeyValue<K,V> |
EqHashTable.last() |
KeyValue<K,V> |
EqConstHashTable.last() |
KeyValue<K,V> |
ConstHashTable.last() |
KeyValue<K,V> |
EmptyTable.last() |
KeyValue<K,V> |
TableView.last() |
KeyValue<K,V> |
HashTable.lookup(K key) |
KeyValue<K,V> |
EqHashTable.lookup(K key) |
KeyValue<K,V> |
EqConstHashTable.lookup(K key) |
KeyValue<K,V> |
ConstHashTable.lookup(K key) |
KeyValue<K,V> |
EmptyTable.lookup(K key) |
KeyValue<K,V> |
TableView.lookup(K key) |
KeyValue<K,V> |
LockedMap.lookup(K key) |
KeyValue<K,V> |
MapView.lookup(K key) |
KeyValue<K,V> |
LockedGettingMap.lookup(K key) |
KeyValue<K,V> |
HashTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EqHashTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EqConstHashTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
ConstHashTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EmptyTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
TableView.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
LockedMap.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
MapView.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
LockedGettingMap.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
HashTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EqHashTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EqConstHashTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
ConstHashTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EmptyTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
TableView.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
LockedMap.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
MapView.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
LockedGettingMap.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
HashTable.peek() |
KeyValue<K,V> |
EqHashTable.peek() |
KeyValue<K,V> |
EqConstHashTable.peek() |
KeyValue<K,V> |
ConstHashTable.peek() |
KeyValue<K,V> |
EmptyTable.peek() |
KeyValue<K,V> |
TableView.peek() |
KeyValue<K,V> |
HashTable.pick() |
KeyValue<K,V> |
EqHashTable.pick() |
KeyValue<K,V> |
HashTable.pinch() |
KeyValue<K,V> |
EqHashTable.pinch() |
KeyValue<K,V> |
LockedMap.pinch() |
KeyValue<K,V> |
HashTable.poll() |
KeyValue<K,V> |
EqHashTable.poll() |
KeyValue<K,V> |
EqConstHashTable.poll() |
KeyValue<K,V> |
ConstHashTable.poll() |
KeyValue<K,V> |
EmptyTable.poll() |
KeyValue<K,V> |
TableView.poll() |
KeyValue<K,V> |
HashTable.pop() |
KeyValue<K,V> |
EqHashTable.pop() |
KeyValue<K,V> |
HashTable.putGet(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.putGet(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.putGet(KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.putGet(K key,
V value) |
KeyValue<K,V> |
EqHashTable.putGet(K key,
V value) |
KeyValue<K,V> |
LockedMap.putGet(K key,
V value) |
KeyValue<K,V> |
HashTable.removeAt(long index) |
KeyValue<K,V> |
EqHashTable.removeAt(long index) |
KeyValue<K,V> |
HashTable.replace(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.replace(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.replace(KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.replace(K key,
V value) |
KeyValue<K,V> |
EqHashTable.replace(K key,
V value) |
KeyValue<K,V> |
LockedMap.replace(K key,
V value) |
KeyValue<K,V> |
HashTable.retrieve(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.retrieve(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.retrieve(KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.retrieveBy(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
EqHashTable.retrieveBy(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
LockedMap.retrieveBy(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
HashTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
EqHashTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
EqConstHashTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
ConstHashTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
EmptyTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
TableView.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
LockedMap.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
MapView.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
LockedGettingMap.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
HashTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
EqHashTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
EqConstHashTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
ConstHashTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
EmptyTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
TableView.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
LockedMap.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
MapView.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
LockedGettingMap.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
HashTable.setGet(K key,
V value) |
KeyValue<K,V> |
EqHashTable.setGet(K key,
V value) |
KeyValue<K,V> |
LockedMap.setGet(K key,
V value) |
KeyValue<K,V> |
HashTable.setGet(long index,
KeyValue<K,V> element) |
KeyValue<K,V> |
EqHashTable.setGet(long index,
KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.substitute(K key,
V value) |
KeyValue<K,V> |
EqHashTable.substitute(K key,
V value) |
KeyValue<K,V> |
LockedMap.substitute(K key,
V value) |
KeyValue<K,V>[] |
ConstMiniMap.toArray() |
KeyValue<K,V>[] |
MiniMap.toArray() |
KeyValue<K,V>[] |
HashTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
EqHashTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
EqConstHashTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
ConstHashTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
EmptyTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
TableView.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
LockedMap.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
MapView.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
LockedGettingMap.toArray(Class<KeyValue<K,V>> type) |
| Modifier and Type | Method and Description |
|---|---|
Aggregator<KeyValue<K,V>,? extends XCollection<KeyValue<K,V>>> |
LockedMap.collector() |
Aggregator<KeyValue<K,V>,? extends XCollection<KeyValue<K,V>>> |
LockedMap.collector() |
HashEqualator<KeyValue<K,V>> |
HashTable.equality() |
HashEqualator<KeyValue<K,V>> |
EqHashTable.equality() |
HashEqualator<KeyValue<K,V>> |
EqConstHashTable.equality() |
HashEqualator<KeyValue<K,V>> |
ConstHashTable.equality() |
Equalator<? super KeyValue<K,V>> |
EmptyTable.equality() |
Equalator<? super KeyValue<K,V>> |
TableView.equality() |
Equalator<? super KeyValue<K,V>> |
LockedMap.equality() |
Equalator<? super KeyValue<K,V>> |
MapView.equality() |
Equalator<? super KeyValue<K,V>> |
LockedGettingMap.equality() |
Iterator<KeyValue<K,V>> |
HashTable.iterator() |
Iterator<KeyValue<K,V>> |
EqHashTable.iterator() |
Iterator<KeyValue<K,V>> |
EqConstHashTable.iterator() |
Iterator<KeyValue<K,V>> |
ConstHashTable.iterator() |
Iterator<KeyValue<K,V>> |
EmptyTable.iterator() |
Iterator<KeyValue<K,V>> |
TableView.iterator() |
Iterator<KeyValue<K,V>> |
LockedMap.iterator() |
Iterator<KeyValue<K,V>> |
MapView.iterator() |
Iterator<KeyValue<K,V>> |
LockedGettingMap.iterator() |
Predicate<KeyValue<K,V>> |
HashTable.predicateContainsEntry() |
Predicate<KeyValue<K,V>> |
EqHashTable.predicateContainsEntry() |
Predicate<KeyValue<K,V>> |
EqConstHashTable.predicateContainsEntry() |
Predicate<KeyValue<K,V>> |
ConstHashTable.predicateContainsEntry() |
Consumer<KeyValue<K,V>> |
EqHashTable.procedureRemoveEntry() |
static <KI,VI,KO,VO> |
ConstHashTable.projector(ConstHashTable<KO,VO> target,
Function<KI,KO> keyProjector,
Function<VI,VO> valueProjector) |
XSet<KeyValue<K,V>> |
LockedMap.putAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XEnum<KeyValue<K,V>> |
HashTable.range(long lowIndex,
long highIndex) |
XEnum<KeyValue<K,V>> |
EqHashTable.range(long lowIndex,
long highIndex) |
XEnum<KeyValue<K,V>> |
EqConstHashTable.range(long lowIndex,
long highIndex) |
XEnum<KeyValue<K,V>> |
ConstHashTable.range(long lowIndex,
long highIndex) |
XGettingEnum<KeyValue<K,V>> |
EmptyTable.range(long lowIndex,
long highIndex) |
XGettingEnum<KeyValue<K,V>> |
TableView.range(long lowIndex,
long highIndex) |
Spliterator<KeyValue<K,V>> |
LockedMap.spliterator() |
Spliterator<KeyValue<K,V>> |
LockedGettingMap.spliterator() |
XImmutableEnum<KeyValue<K,V>> |
EmptyTable.toReversed() |
XGettingEnum<KeyValue<K,V>> |
TableView.toReversed() |
XGettingEnum<KeyValue<K,V>> |
HashTable.view(long lowIndex,
long highIndex) |
XGettingEnum<KeyValue<K,V>> |
EqHashTable.view(long lowIndex,
long highIndex) |
XGettingEnum<KeyValue<K,V>> |
EqConstHashTable.view(long lowIndex,
long highIndex) |
XGettingEnum<KeyValue<K,V>> |
ConstHashTable.view(long lowIndex,
long highIndex) |
XGettingEnum<KeyValue<K,V>> |
EmptyTable.view(long lowIndex,
long highIndex) |
XGettingEnum<KeyValue<K,V>> |
TableView.view(long lowIndex,
long highIndex) |
| Modifier and Type | Method and Description |
|---|---|
void |
HashTable.accept(KeyValue<K,V> entry) |
void |
EqHashTable.accept(KeyValue<K,V> entry) |
void |
LockedMap.accept(KeyValue<K,V> element) |
boolean |
HashTable.add(KeyValue<K,V> entry) |
boolean |
EqHashTable.add(KeyValue<K,V> entry) |
boolean |
LockedMap.add(KeyValue<K,V> element) |
HashTable<K,V> |
HashTable.addAll(KeyValue<K,V>... elements) |
EqHashTable<K,V> |
EqHashTable.addAll(KeyValue<K,V>... elements) |
XMap<K,V> |
LockedMap.addAll(KeyValue<K,V>... elements) |
HashTable<K,V> |
HashTable.addAll(KeyValue<K,V>[] elements,
int srcIndex,
int srcLength) |
EqHashTable<K,V> |
EqHashTable.addAll(KeyValue<K,V>[] elements,
int srcIndex,
int srcLength) |
XMap<K,V> |
LockedMap.addAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
KeyValue<K,V> |
HashTable.addGet(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.addGet(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.addGet(KeyValue<K,V> element) |
boolean |
HashTable.contains(KeyValue<K,V> entry) |
boolean |
EqHashTable.contains(KeyValue<K,V> entry) |
boolean |
EqConstHashTable.contains(KeyValue<K,V> entry) |
boolean |
ConstHashTable.contains(KeyValue<K,V> entry) |
boolean |
EmptyTable.contains(KeyValue<K,V> element) |
boolean |
TableView.contains(KeyValue<K,V> element) |
boolean |
LockedMap.contains(KeyValue<K,V> element) |
boolean |
MapView.contains(KeyValue<K,V> element) |
boolean |
LockedGettingMap.contains(KeyValue<K,V> element) |
boolean |
HashTable.containsId(KeyValue<K,V> entry) |
boolean |
EqHashTable.containsId(KeyValue<K,V> entry) |
boolean |
EqConstHashTable.containsId(KeyValue<K,V> entry) |
boolean |
ConstHashTable.containsId(KeyValue<K,V> entry) |
boolean |
EmptyTable.containsId(KeyValue<K,V> element) |
boolean |
TableView.containsId(KeyValue<K,V> element) |
boolean |
LockedMap.containsId(KeyValue<K,V> element) |
boolean |
MapView.containsId(KeyValue<K,V> element) |
boolean |
LockedGettingMap.containsId(KeyValue<K,V> element) |
long |
HashTable.count(KeyValue<K,V> entry) |
long |
EqHashTable.count(KeyValue<K,V> entry) |
long |
EqConstHashTable.count(KeyValue<K,V> entry) |
long |
ConstHashTable.count(KeyValue<K,V> entry) |
long |
EmptyTable.count(KeyValue<K,V> element) |
long |
TableView.count(KeyValue<K,V> element) |
long |
LockedMap.count(KeyValue<K,V> element) |
long |
MapView.count(KeyValue<K,V> element) |
long |
LockedGettingMap.count(KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.deduplicate(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.deduplicate(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.deduplicate(KeyValue<K,V> element) |
long |
HashTable.indexOf(KeyValue<K,V> entry) |
long |
EqHashTable.indexOf(KeyValue<K,V> entry) |
long |
EqConstHashTable.indexOf(KeyValue<K,V> entry) |
long |
ConstHashTable.indexOf(KeyValue<K,V> entry) |
long |
EmptyTable.indexOf(KeyValue<K,V> element) |
long |
TableView.indexOf(KeyValue<K,V> element) |
boolean |
HashTable.input(long index,
KeyValue<K,V> element) |
boolean |
EqHashTable.input(long index,
KeyValue<K,V> element) |
long |
HashTable.inputAll(long index,
KeyValue<K,V>... elements) |
long |
EqHashTable.inputAll(long index,
KeyValue<K,V>... elements) |
long |
HashTable.inputAll(long index,
KeyValue<K,V>[] elements,
int offset,
int length) |
long |
EqHashTable.inputAll(long index,
KeyValue<K,V>[] elements,
int offset,
int length) |
boolean |
HashTable.insert(long index,
KeyValue<K,V> element) |
boolean |
EqHashTable.insert(long index,
KeyValue<K,V> element) |
long |
HashTable.insertAll(long index,
KeyValue<K,V>... elements) |
long |
EqHashTable.insertAll(long index,
KeyValue<K,V>... elements) |
long |
HashTable.insertAll(long index,
KeyValue<K,V>[] elements,
int offset,
int length) |
long |
EqHashTable.insertAll(long index,
KeyValue<K,V>[] elements,
int offset,
int length) |
protected int |
HashTable.internalCountingAddAll(KeyValue<K,V>[] elements) |
protected int |
EqHashTable.internalCountingAddAll(KeyValue<K,V>[] elements) |
protected int |
EqConstHashTable.internalCountingAddAll(KeyValue<K,V>[] elements) |
protected int |
ConstHashTable.internalCountingAddAll(KeyValue<K,V>[] elements) |
protected int |
HashTable.internalCountingAddAll(KeyValue<K,V>[] elements,
int offset,
int length) |
protected int |
EqHashTable.internalCountingAddAll(KeyValue<K,V>[] elements,
int offset,
int length) |
protected int |
EqConstHashTable.internalCountingAddAll(KeyValue<K,V>[] elements,
int offset,
int length) |
protected int |
ConstHashTable.internalCountingAddAll(KeyValue<K,V>[] elements,
int offset,
int length) |
protected int |
HashTable.internalCountingPutAll(KeyValue<K,V>[] elements) |
protected int |
EqHashTable.internalCountingPutAll(KeyValue<K,V>[] elements) |
protected int |
EqConstHashTable.internalCountingPutAll(KeyValue<K,V>[] elements) |
protected int |
ConstHashTable.internalCountingPutAll(KeyValue<K,V>[] elements) |
protected int |
HashTable.internalCountingPutAll(KeyValue<K,V>[] elements,
int offset,
int length) |
protected int |
EqHashTable.internalCountingPutAll(KeyValue<K,V>[] elements,
int offset,
int length) |
protected int |
EqConstHashTable.internalCountingPutAll(KeyValue<K,V>[] elements,
int offset,
int length) |
protected int |
ConstHashTable.internalCountingPutAll(KeyValue<K,V>[] elements,
int offset,
int length) |
long |
HashTable.lastIndexOf(KeyValue<K,V> entry) |
long |
EqHashTable.lastIndexOf(KeyValue<K,V> entry) |
long |
EqConstHashTable.lastIndexOf(KeyValue<K,V> entry) |
long |
ConstHashTable.lastIndexOf(KeyValue<K,V> entry) |
long |
EmptyTable.lastIndexOf(KeyValue<K,V> element) |
long |
TableView.lastIndexOf(KeyValue<K,V> element) |
static <K,V> MiniMap<K,V> |
MiniMap.miniMap(KeyValue<? extends K,? extends V>... data) |
static <K,V> EqHashTable<K,V> |
EqHashTable.New(HashEqualator<? super K> hashEqualator,
KeyValue<? extends K,? extends V>... entries) |
static <K,V> EqConstHashTable<K,V> |
EqConstHashTable.New(HashEqualator<? super K> hashEqualator,
KeyValue<? extends K,? extends V>... entries) |
static <K,V> HashTable<K,V> |
HashTable.New(KeyValue<? extends K,? extends V>... entries) |
static <K,V> EqHashTable<K,V> |
EqHashTable.New(KeyValue<? extends K,? extends V>... entries) |
static <K,V> EqConstHashTable<K,V> |
EqConstHashTable.New(KeyValue<? extends K,? extends V>... entries) |
static <K,V> ConstHashTable<K,V> |
ConstHashTable.New(KeyValue<? extends K,? extends V>... entries) |
static <K,V> EqHashTable<K,V> |
EqHashTable.NewCustom(HashEqualator<? super K> hashEqualator,
int initialHashLength,
float hashDensity,
KeyValue<? extends K,? extends V>... entries) |
static <K,V> EqConstHashTable<K,V> |
EqConstHashTable.NewCustom(HashEqualator<? super K> hashEqualator,
int initialHashLength,
float hashDensity,
KeyValue<? extends K,? extends V>... entries) |
static <K,V> EqHashTable<K,V> |
EqHashTable.NewCustom(int initialHashLength,
float hashDensity,
KeyValue<? extends K,? extends V>... entries) |
static <K,V> EqConstHashTable<K,V> |
EqConstHashTable.NewCustom(int initialHashLength,
float hashDensity,
KeyValue<? extends K,? extends V>... entries) |
static <K,V> ConstHashTable<K,V> |
ConstHashTable.NewCustom(int initialHashLength,
float hashDensity,
KeyValue<? extends K,? extends V>... entries) |
static <K,V> HashTable<K,V> |
HashTable.NewCustom(long desiredCapacity,
float hashDensity,
KeyValue<? extends K,? extends V>... entries) |
boolean |
HashTable.prepend(KeyValue<K,V> element) |
boolean |
EqHashTable.prepend(KeyValue<K,V> element) |
HashTable<K,V> |
HashTable.prependAll(KeyValue<K,V>... elements) |
EqHashTable<K,V> |
EqHashTable.prependAll(KeyValue<K,V>... elements) |
HashTable<K,V> |
HashTable.prependAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
EqHashTable<K,V> |
EqHashTable.prependAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
boolean |
HashTable.preput(KeyValue<K,V> element) |
boolean |
EqHashTable.preput(KeyValue<K,V> element) |
HashTable<K,V> |
HashTable.preputAll(KeyValue<K,V>... elements) |
EqHashTable<K,V> |
EqHashTable.preputAll(KeyValue<K,V>... elements) |
HashTable<K,V> |
HashTable.preputAll(KeyValue<K,V>[] elements,
int offset,
int length) |
EqHashTable<K,V> |
EqHashTable.preputAll(KeyValue<K,V>[] elements,
int offset,
int length) |
boolean |
HashTable.put(KeyValue<K,V> entry) |
boolean |
EqHashTable.put(KeyValue<K,V> entry)
Adds the specified element to this collection if it is not already present (optional operation).
|
boolean |
LockedMap.put(KeyValue<K,V> element) |
HashTable<K,V> |
HashTable.putAll(KeyValue<K,V>... elements) |
EqHashTable<K,V> |
EqHashTable.putAll(KeyValue<K,V>... elements) |
XMap<K,V> |
LockedMap.putAll(KeyValue<K,V>... elements) |
MiniMap<K,V> |
MiniMap.putAll(KeyValue<K,V>... data) |
HashTable<K,V> |
HashTable.putAll(KeyValue<K,V>[] elements,
int srcIndex,
int srcLength) |
EqHashTable<K,V> |
EqHashTable.putAll(KeyValue<K,V>[] elements,
int srcIndex,
int srcLength) |
XMap<K,V> |
LockedMap.putAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
KeyValue<K,V> |
HashTable.putGet(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.putGet(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.putGet(KeyValue<K,V> element) |
long |
HashTable.remove(KeyValue<K,V> entry) |
long |
EqHashTable.remove(KeyValue<K,V> entry) |
long |
LockedMap.remove(KeyValue<K,V> element) |
boolean |
HashTable.removeOne(KeyValue<K,V> entry) |
boolean |
EqHashTable.removeOne(KeyValue<K,V> entry) |
boolean |
LockedMap.removeOne(KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.replace(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.replace(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.replace(KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.retrieve(KeyValue<K,V> entry) |
KeyValue<K,V> |
EqHashTable.retrieve(KeyValue<K,V> entry) |
KeyValue<K,V> |
LockedMap.retrieve(KeyValue<K,V> element) |
protected boolean |
ChainEntryLinkedHashedStrong.sameKV(KeyValue<E,E> other) |
protected boolean |
ChainEntryLinkedStrong.sameKV(KeyValue<E,E> other) |
protected abstract boolean |
AbstractChainEntry.sameKV(KeyValue<K,V> other) |
protected boolean |
AbstractChainEntry.Head.sameKV(KeyValue<K,V> other) |
KeyValue<K,V> |
HashTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
EqHashTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
EqConstHashTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
ConstHashTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
EmptyTable.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
TableView.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
LockedMap.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
MapView.seek(KeyValue<K,V> sample) |
KeyValue<K,V> |
LockedGettingMap.seek(KeyValue<K,V> sample) |
boolean |
HashTable.set(long index,
KeyValue<K,V> element) |
boolean |
EqHashTable.set(long index,
KeyValue<K,V> element) |
HashTable<K,V> |
HashTable.set(long index,
KeyValue<K,V>[] elements,
int offset,
int length) |
EqHashTable<K,V> |
EqHashTable.set(long index,
KeyValue<K,V>[] elements,
int offset,
int length) |
HashTable<K,V> |
HashTable.setAll(long index,
KeyValue<K,V>... elements) |
EqHashTable<K,V> |
EqHashTable.setAll(long index,
KeyValue<K,V>... elements) |
void |
HashTable.setFirst(KeyValue<K,V> element) |
void |
EqHashTable.setFirst(KeyValue<K,V> element) |
KeyValue<K,V> |
HashTable.setGet(long index,
KeyValue<K,V> element) |
KeyValue<K,V> |
EqHashTable.setGet(long index,
KeyValue<K,V> element) |
void |
HashTable.setLast(KeyValue<K,V> element) |
void |
EqHashTable.setLast(KeyValue<K,V> element) |
| Modifier and Type | Method and Description |
|---|---|
HashTable<K,V> |
HashTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
EqHashTable<K,V> |
EqHashTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XMap<K,V> |
LockedMap.addAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
HashTable.applies(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
EqHashTable.applies(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
EqConstHashTable.applies(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
ConstHashTable.applies(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
EmptyTable.applies(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
TableView.applies(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
LockedMap.applies(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
MapView.applies(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
LockedGettingMap.applies(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
HashTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
EqHashTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
EqConstHashTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
ConstHashTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
EmptyTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
TableView.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
LockedMap.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
MapView.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
LockedGettingMap.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
boolean |
HashTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
EqHashTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
EqConstHashTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
ConstHashTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
EmptyTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
TableView.containsSearched(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
LockedMap.containsSearched(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
MapView.containsSearched(Predicate<? super KeyValue<K,V>> predicate) |
boolean |
LockedGettingMap.containsSearched(Predicate<? super KeyValue<K,V>> predicate) |
long |
HashTable.countBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EqHashTable.countBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EqConstHashTable.countBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
ConstHashTable.countBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EmptyTable.countBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
TableView.countBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
LockedMap.countBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
MapView.countBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
LockedGettingMap.countBy(Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.distinct(C target,
Equalator<? super KeyValue<K,V>> equalator) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.distinct(C target,
Equalator<? super KeyValue<K,V>> equalator) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.distinct(C target,
Equalator<? super KeyValue<K,V>> equalator) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.distinct(C target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.distinct(T target,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
HashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
HashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EqHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EqHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EqConstHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EqConstHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
ConstHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
ConstHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EmptyTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EmptyTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
TableView.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
TableView.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
LockedMap.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
LockedMap.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
MapView.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
MapView.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
LockedGettingMap.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
LockedGettingMap.equals(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
HashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
HashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EqHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EqHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EqConstHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EqConstHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
ConstHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
ConstHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EmptyTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
EmptyTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
TableView.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
TableView.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
LockedMap.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
LockedMap.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
MapView.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
MapView.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
LockedGettingMap.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
boolean |
LockedGettingMap.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples,
Equalator<? super KeyValue<K,V>> equalator) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.except(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.filterTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.filterTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.filterTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.filterTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.filterTo(T target,
Predicate<? super KeyValue<K,V>> predicate) |
void |
LockedMap.forEach(Consumer<? super KeyValue<K,V>> action) |
void |
LockedGettingMap.forEach(Consumer<? super KeyValue<K,V>> action) |
long |
HashTable.indexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EqHashTable.indexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EqConstHashTable.indexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
ConstHashTable.indexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EmptyTable.indexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
TableView.indexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
HashTable.inputAll(long index,
XGettingCollection<? extends KeyValue<K,V>> elements) |
long |
EqHashTable.inputAll(long index,
XGettingCollection<? extends KeyValue<K,V>> elements) |
long |
HashTable.insertAll(long index,
XGettingCollection<? extends KeyValue<K,V>> elements) |
long |
EqHashTable.insertAll(long index,
XGettingCollection<? extends KeyValue<K,V>> elements) |
protected int |
HashTable.internalCountingAddAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
protected int |
EqHashTable.internalCountingAddAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
protected int |
EqConstHashTable.internalCountingAddAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
protected int |
ConstHashTable.internalCountingAddAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
protected int |
HashTable.internalCountingPutAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
protected int |
EqHashTable.internalCountingPutAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
protected int |
EqConstHashTable.internalCountingPutAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
protected int |
ConstHashTable.internalCountingPutAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
boolean |
HashTable.isSorted(Comparator<? super KeyValue<K,V>> comparator) |
boolean |
EqHashTable.isSorted(Comparator<? super KeyValue<K,V>> comparator) |
boolean |
EqConstHashTable.isSorted(Comparator<? super KeyValue<K,V>> comparator) |
boolean |
ConstHashTable.isSorted(Comparator<? super KeyValue<K,V>> comparator) |
boolean |
EmptyTable.isSorted(Comparator<? super KeyValue<K,V>> comparator) |
boolean |
TableView.isSorted(Comparator<? super KeyValue<K,V>> comparator) |
int |
HashMapIdObject.iterate(Consumer<? super KeyValue<Long,E>> procedure) |
<A> A |
HashTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner,
A aggregate) |
<A> A |
EqHashTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner,
A aggregate) |
<A> A |
EqConstHashTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner,
A aggregate) |
<A> A |
ConstHashTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner,
A aggregate) |
<A> A |
EmptyTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner,
A aggregate) |
<A> A |
TableView.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner,
A aggregate) |
<A> A |
LockedMap.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner,
A aggregate) |
<A> A |
MapView.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner,
A aggregate) |
<A> A |
LockedGettingMap.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner,
A aggregate) |
long |
HashTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EqHashTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EqConstHashTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
ConstHashTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EmptyTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
TableView.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
HashTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EqHashTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EqConstHashTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
ConstHashTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EmptyTable.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
TableView.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
LockedMap.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
MapView.max(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
LockedGettingMap.max(Comparator<? super KeyValue<K,V>> comparator) |
long |
HashTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
EqHashTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
EqConstHashTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
ConstHashTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
EmptyTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
TableView.maxIndex(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
HashTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EqHashTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EqConstHashTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
ConstHashTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
EmptyTable.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
TableView.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
LockedMap.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
MapView.min(Comparator<? super KeyValue<K,V>> comparator) |
KeyValue<K,V> |
LockedGettingMap.min(Comparator<? super KeyValue<K,V>> comparator) |
long |
HashTable.minIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
EqHashTable.minIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
EqConstHashTable.minIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
ConstHashTable.minIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
EmptyTable.minIndex(Comparator<? super KeyValue<K,V>> comparator) |
long |
TableView.minIndex(Comparator<? super KeyValue<K,V>> comparator) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.moveTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.moveTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
<C extends Consumer<? super KeyValue<K,V>>> |
LockedMap.moveTo(C target,
Predicate<? super KeyValue<K,V>> predicate) |
static <K,V> EqHashTable<K,V> |
EqHashTable.New(HashEqualator<? super K> hashEqualator,
XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> EqConstHashTable<K,V> |
EqConstHashTable.New(HashEqualator<? super K> hashEqualator,
XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> HashTable<K,V> |
HashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> EqHashTable<K,V> |
EqHashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> EqConstHashTable<K,V> |
EqConstHashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> ConstHashTable<K,V> |
ConstHashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <V0,K,V> EqConstHashTable<K,V> |
EqConstHashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V0>> entries,
Function<? super V0,V> mapper) |
static <K,V> EqHashTable<K,V> |
EqHashTable.NewCustom(HashEqualator<? super K> hashEqualator,
int initialHashLength,
float hashDensity,
XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> EqConstHashTable<K,V> |
EqConstHashTable.NewCustom(HashEqualator<? super K> hashEqualator,
int initialHashLength,
float hashDensity,
XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> HashTable<K,V> |
HashTable.NewCustom(int initialHashLength,
float hashDensity,
XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> EqHashTable<K,V> |
EqHashTable.NewCustom(int initialHashLength,
float hashDensity,
XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> EqConstHashTable<K,V> |
EqConstHashTable.NewCustom(int initialHashLength,
float hashDensity,
XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <K,V> ConstHashTable<K,V> |
ConstHashTable.NewCustom(int initialHashLength,
float hashDensity,
XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) |
static <KI,VI,KO,VO> |
HashTable.NewProjected(float hashDensity,
XGettingCollection<? extends KeyValue<KI,VI>> entries,
Function<? super KI,KO> keyProjector,
Function<? super VI,VO> valueProjector) |
static <KI,VI,KO,VO> |
ConstHashTable.NewProjected(float hashDensity,
XGettingCollection<? extends KeyValue<KI,VI>> entries,
Function<? super KI,KO> keyProjector,
Function<? super VI,VO> valueProjector) |
static <K,V,K1,V1> |
EqConstHashTable.NewProjected(float hashDensity,
XGettingCollection<? extends KeyValue<K,V>> entries,
Function<? super K,K1> keyProjector,
Function<? super V,V1> valueProjector) |
static <KO,VO,KI extends KO,VI extends VO> |
HashTable.NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries) |
static <KO,VO,KI extends KO,VI extends VO> |
ConstHashTable.NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries) |
static <KI,VI,KO,VO> |
HashTable.NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries,
Function<? super KI,KO> keyProjector,
Function<? super VI,VO> valueProjector) |
static <KI,VI,KO,VO> |
ConstHashTable.NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries,
Function<? super KI,KO> keyProjector,
Function<? super VI,VO> valueProjector) |
static <K,V,K1,V1> |
EqConstHashTable.NewProjected(XGettingCollection<? extends KeyValue<K,V>> entries,
Function<? super K,K1> keyProjector,
Function<? super V,V1> valueProjector) |
HashTable<K,V> |
HashTable.prependAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
EqHashTable<K,V> |
EqHashTable.prependAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
HashTable<K,V> |
HashTable.preputAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
EqHashTable<K,V> |
EqHashTable.preputAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
HashTable<K,V> |
HashTable.putAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
EqHashTable<K,V> |
EqHashTable.putAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XSet<KeyValue<K,V>> |
LockedMap.putAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
long |
HashTable.removeAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
long |
EqHashTable.removeAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
long |
LockedMap.removeAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
long |
HashTable.removeBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
EqHashTable.removeBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
LockedMap.removeBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
HashTable.removeDuplicates(Equalator<? super KeyValue<K,V>> equalator) |
long |
EqHashTable.removeDuplicates(Equalator<? super KeyValue<K,V>> equalator) |
long |
LockedMap.removeDuplicates(Equalator<? super KeyValue<K,V>> equalator) |
long |
HashTable.retainAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
long |
EqHashTable.retainAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
long |
LockedMap.retainAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
KeyValue<K,V> |
HashTable.retrieveBy(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
EqHashTable.retrieveBy(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
LockedMap.retrieveBy(Predicate<? super KeyValue<K,V>> predicate) |
long |
HashTable.scan(Predicate<? super KeyValue<K,V>> predicate) |
long |
EqHashTable.scan(Predicate<? super KeyValue<K,V>> predicate) |
long |
EqConstHashTable.scan(Predicate<? super KeyValue<K,V>> predicate) |
long |
ConstHashTable.scan(Predicate<? super KeyValue<K,V>> predicate) |
long |
EmptyTable.scan(Predicate<? super KeyValue<K,V>> predicate) |
long |
TableView.scan(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
HashTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
EqHashTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
EqConstHashTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
ConstHashTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
EmptyTable.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
TableView.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
LockedMap.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
MapView.search(Predicate<? super KeyValue<K,V>> predicate) |
KeyValue<K,V> |
LockedGettingMap.search(Predicate<? super KeyValue<K,V>> predicate) |
HashTable<K,V> |
HashTable.set(long index,
XGettingSequence<? extends KeyValue<K,V>> elements,
long offset,
long length) |
EqHashTable<K,V> |
EqHashTable.set(long index,
XGettingSequence<? extends KeyValue<K,V>> elements,
long offset,
long length) |
HashTable<K,V> |
HashTable.sort(Comparator<? super KeyValue<K,V>> comparator) |
EqHashTable<K,V> |
EqHashTable.sort(Comparator<? super KeyValue<K,V>> comparator) |
long |
HashTable.substitute(Function<? super KeyValue<K,V>,? extends KeyValue<K,V>> mapper) |
long |
HashTable.substitute(Function<? super KeyValue<K,V>,? extends KeyValue<K,V>> mapper) |
long |
EqHashTable.substitute(Function<? super KeyValue<K,V>,? extends KeyValue<K,V>> mapper) |
long |
EqHashTable.substitute(Function<? super KeyValue<K,V>,? extends KeyValue<K,V>> mapper) |
KeyValue<K,V>[] |
HashTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
EqHashTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
EqConstHashTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
ConstHashTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
EmptyTable.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
TableView.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
LockedMap.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
MapView.toArray(Class<KeyValue<K,V>> type) |
KeyValue<K,V>[] |
LockedGettingMap.toArray(Class<KeyValue<K,V>> type) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
HashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
EqConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<C extends Consumer<? super KeyValue<K,V>>> |
ConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
C target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
EmptyTable.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
TableView.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedMap.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
MapView.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
<T extends Consumer<? super KeyValue<K,V>>> |
LockedGettingMap.union(XGettingCollection<? extends KeyValue<K,V>> other,
Equalator<? super KeyValue<K,V>> equalator,
T target) |
| Constructor and Description |
|---|
ConstMiniMap(KeyValue<K,V>... data) |
MiniMap(int initialCapacity,
KeyValue<? extends K,? extends V>... data) |
| Constructor and Description |
|---|
AbstractChainKeyValueStorage(AbstractChainCollection<KeyValue<K,V>,K,V,EN> parent,
EN head) |
ChainStrongStrongStorage(AbstractChainCollection<KeyValue<K,V>,K,V,EN> parent,
EN head) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
ChainKeyValueStorage<K,V,EN extends AbstractChainEntry<KeyValue<K,V>,K,V,EN>> |
| Modifier and Type | Method and Description |
|---|---|
XGettingList<KeyValue<Integer,Integer>> |
HashCollection.Analysis.getChainLengthDistribution() |
| Constructor and Description |
|---|
Analysis(H subject,
int size,
float hashDensity,
int slotCount,
int shortestEntryChainLength,
int longestEntryChainLength,
int distributionRange,
XGettingList<KeyValue<Integer,Integer>> chainLengthDistribution) |
| Modifier and Type | Method and Description |
|---|---|
static <K,V> HashMap<K,V> |
OldCollections.OldHashMap(KeyValue<? extends K,? extends V>... keyValueTuples) |
| Modifier and Type | Method and Description |
|---|---|
XChart<K,V> |
XChart.addAll(KeyValue<K,V>... elements) |
XChart<K,V> |
XChart.addAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
XChart<K,V> |
XChart.putAll(KeyValue<K,V>... elements) |
XChart<K,V> |
XChart.putAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
| Modifier and Type | Method and Description |
|---|---|
XChart<K,V> |
XChart.addAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XChart<K,V> |
XChart.putAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
| Modifier and Type | Method and Description |
|---|---|
<PIE extends Consumer<? super KeyValue<K2,V>>> |
XGetting2DMap.iterateInnerEntries(PIE procedure) |
| Modifier and Type | Method and Description |
|---|---|
KeyValue<K,V> |
XAddGetMap.addGet(K key,
V value) |
KeyValue<K,V> |
XGettingMap.lookup(K key) |
KeyValue<K,V> |
XPutGetMap.putGet(K key,
V value)
Ensures the passed key and value to be contained as an entry in the map.
|
KeyValue<K,V> |
XMap.putGet(K key,
V value)
Ensures the passed key and value to be contained as an entry in the map.
|
KeyValue<K,V> |
XPutGetMap.replace(K key,
V value) |
KeyValue<K,V> |
XMap.setGet(K key,
V value)
Sets the passed key and value to an appropriate entry if one can be found.
|
KeyValue<K,V> |
XAddGetMap.substitute(K key,
V value) |
| Modifier and Type | Method and Description |
|---|---|
XAddingTable<K,V> |
XAddingTable.addAll(KeyValue<K,V>... elements) |
XTable<K,V> |
XTable.addAll(KeyValue<K,V>... elements) |
XMap<K,V> |
XMap.addAll(KeyValue<K,V>... elements) |
XBasicTable<K,V> |
XBasicTable.addAll(KeyValue<K,V>... elements) |
XAddingTable<K,V> |
XAddingTable.addAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
XTable<K,V> |
XTable.addAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
XMap<K,V> |
XMap.addAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
XBasicTable<K,V> |
XBasicTable.addAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
XTable<K,V> |
XTable.putAll(KeyValue<K,V>... elements) |
XMap<K,V> |
XMap.putAll(KeyValue<K,V>... elements)
Ensures the passed key-value-pairs to be contained as entries in the map.
|
XBasicTable<K,V> |
XBasicTable.putAll(KeyValue<K,V>... elements) |
XTable<K,V> |
XTable.putAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
XMap<K,V> |
XMap.putAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength)
Ensures the passed key-value-pairs to be contained as entries in the map.
|
XBasicTable<K,V> |
XBasicTable.putAll(KeyValue<K,V>[] elements,
int srcStartIndex,
int srcLength) |
| Modifier and Type | Method and Description |
|---|---|
XAddingTable<K,V> |
XAddingTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XTable<K,V> |
XTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XMap<K,V> |
XMap.addAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XBasicTable<K,V> |
XBasicTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XTable<K,V> |
XTable.putAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XBasicTable<K,V> |
XBasicTable.putAll(XGettingCollection<? extends KeyValue<K,V>> elements) |
XTable<K,V> |
XTable.sort(Comparator<? super KeyValue<K,V>> comparator) |
| Modifier and Type | Method and Description |
|---|---|
static <KV extends KeyValue<?,?>> |
XHashing.keyValueHashEqualityKeyIdentity() |
| Modifier and Type | Method and Description |
|---|---|
static <K,V> HashEqualator<KeyValue<K,V>> |
XHashing.wrapAsKeyValue(HashEqualator<? super K> hashEqualator)
Wrappers the passed
HashEqualator instance as a KeyValue HashEqualator instance, using
the KeyValue instance's key as the hash element. |
| Modifier and Type | Class and Description |
|---|---|
static class |
KeyValue.Default<K,V> |
| Modifier and Type | Method and Description |
|---|---|
static <K,V> KeyValue<K,V> |
KeyValue.New(K key,
V value) |
| Modifier and Type | Method and Description |
|---|---|
static <K,V> CqlResultor<KeyValue<K,V>,EqHashTable<K,V>> |
CQL.resultingEqHashTable() |
static <K,V> CqlResultor<KeyValue<K,V>,EqHashTable<K,V>> |
CQL.resultingEqHashTable(HashEqualator<? super K> hashEqualator) |
static <K,V> CqlResultor<KeyValue<K,V>,HashTable<K,V>> |
CQL.resultingHashTable() |
| Modifier and Type | Method and Description |
|---|---|
XGettingSequence<? extends KeyValue<String,StringTable>> |
XCsvContent.segments() |
XGettingSequence<? extends KeyValue<String,StringTable>> |
XCsvContent.Default.segments() |
| Modifier and Type | Method and Description |
|---|---|
static XCsvContent.Default |
XCsvContent.Default.New(String name,
XGettingSequence<? extends KeyValue<String,StringTable>> segments,
XCsvConfiguration configuration) |
Copyright © 2022 MicroStream Software. All rights reserved.