E - type of elements stored in the listK - type of keypublic class Key1List<E,K> extends KeyListImpl<E>
| Modifier and Type | Class and Description |
|---|---|
static class |
Key1List.Builder<E,K>
Builder to construct Key1List instances.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.Map<K,E> |
asMap1()
Returns a map view to the key map.
|
boolean |
containsKey1(K key)
Checks whether an element with specified key exists.
|
Key1List<E,K> |
copy()
Returns a shallow copy of this list instance.
|
Key1List<E,K> |
crop()
Returns a copy this list but without elements.
|
IList<E> |
getAll(E elem)
Returns all elements in the list equal to the specified element.
|
GapList<E> |
getAllByKey1(K key)
Returns all elements with specified key.
|
GapList<K> |
getAllKeys1()
Returns list containing all keys in element order.
|
E |
getByKey1(K key)
Returns element with specified key.
|
int |
getCount(E elem)
Counts how many times the specified element is contained in the list.
|
int |
getCountByKey1(K key)
Returns the number of elements with specified key.
|
java.util.Set<E> |
getDistinct()
Returns distinct elements in the list.
|
java.util.Set<K> |
getDistinctKeys1()
Returns all distinct keys in the same order as in the key map.
|
IFunction<E,K> |
getKey1Mapper()
Returns mapper for key map.
|
int |
indexOfKey1(K key)
Returns index of first element in list with specified key.
|
void |
invalidateKey1(K oldKey,
K newKey,
E elem)
Invalidate key value of element.
|
E |
put(E elem)
Adds or replaces element.
|
E |
putByKey1(E elem)
Adds or replaces element by key.
|
IList<E> |
removeAll(E elem)
Removes all equal elements.
|
GapList<E> |
removeAllByKey1(K key)
Removes all elements with specified key.
|
E |
removeByKey1(K key)
Removes element with specified key.
|
Key1List<E,K> |
unmodifiableList()
Returns an unmodifiable view of this list.
|
add, add, addIf, asSet, binarySearch, capacity, clear, clone, contains, containsKey, ensureCapacity, get, getAllByKey, getByKey, getCountByKey, getDistinctKeys, getKeyMapper, indexOf, indexOfKey, indexOfKey, isSorted, set, size, sort, trimToSizeaddAll, addAll, addAll, addAll, addArray, addArray, addFirst, addIfAbsent, addLast, addMult, addMult, binarySearch, containsAll, containsAny, copy, descendingIterator, drag, element, equals, extract, extractWhere, fill, filter, getAll, getArray, getFirst, getLast, getWhere, hashCode, indexOf, initAll, initAll, initArray, initMult, isEmpty, iterator, lastIndexOf, lastIndexOf, listIterator, listIterator, mappedList, move, offer, offerFirst, offerLast, peek, peekFirst, peekLast, poll, pollFirst, pollLast, pop, push, put, putAll, putAll, putArray, putMult, remove, remove, remove, remove, removeAll, removeAll, removeFirst, removeFirstOccurrence, removeLast, removeLastOccurrence, removeWhere, replaceAll, replaceAll, replaceArray, replaceMult, resize, retainAll, retainAll, retainWhere, reverse, reverse, rotate, rotate, setAll, setAll, setArray, setMult, sort, swap, toArray, toArray, toArray, toString, transferCopy, transferMove, transferRemove, transferSwappublic Key1List<E,K> copy()
IListcopy in class KeyListImpl<E>IList.clone()public Key1List<E,K> crop()
KeyListImplcrop in class KeyListImpl<E>public IList<E> getAll(E elem)
IListgetAll in class KeyListImpl<E>elem - element to look forpublic int getCount(E elem)
IListgetCount in class KeyListImpl<E>elem - element to countpublic IList<E> removeAll(E elem)
IListremoveAll in class KeyListImpl<E>elem - elementpublic java.util.Set<E> getDistinct()
IListgetDistinct in class KeyListImpl<E>public E put(E elem)
KeyListImpl
if (contains(elem)) {
remove(elem);
}
add(elem);
However the method is atomic in the sense that all or none operations are executed.
So if there is already such an element, but adding the new one fails due to a constraint violation,
the old element remains in the list.elem - elementpublic IFunction<E,K> getKey1Mapper()
public java.util.Map<K,E> asMap1()
java.lang.IllegalArgumentException - if the key map cannot be viewed as Mappublic int indexOfKey1(K key)
key - keypublic boolean containsKey1(K key)
key - keypublic E getByKey1(K key)
key - keypublic GapList<E> getAllByKey1(K key)
key - keypublic int getCountByKey1(K key)
key - keypublic E removeByKey1(K key)
key - keypublic GapList<E> removeAllByKey1(K key)
key - keypublic GapList<K> getAllKeys1()
public java.util.Set<K> getDistinctKeys1()
public E putByKey1(E elem)
if (containsKey1(elem)) {
removeByKey1(elem);
}
add(elem);
However the method is atomic in the sense that all or none operations are executed.
So if there is already such an element, but adding the new one fails due to a constraint violation,
the old element remains in the list.elem - elementpublic void invalidateKey1(K oldKey, K newKey, E elem)
oldKey - old key valuenewKey - new key valueelem - element to invalidate (can be null if there are no duplicates with this key)public Key1List<E,K> unmodifiableList()
IListunmodifiableList in class IList<E>