E - type of elements stored in the listK1 - type of first keyK2 - type of second keypublic class Key2Collection<E,K1,K2> extends KeyCollectionImpl<E>
Key1List,
Serialized Form| Modifier and Type | Class and Description |
|---|---|
static class |
Key2Collection.Builder<E,K1,K2>
Builder to construct Key2Collection instances.
|
KeyCollectionImpl.BuilderImpl<E>| Modifier and Type | Method and Description |
|---|---|
java.util.Map<K1,E> |
asMap1()
Returns a map view to the key map.
|
java.util.Map<K2,E> |
asMap2()
Returns a map view to the key map.
|
boolean |
containsKey1(K1 key)
Checks whether an element with specified key exists.
|
boolean |
containsKey2(K2 key)
Checks whether an element with specified key exists.
|
Key2Collection<E,K1,K2> |
copy()
Returns a copy of this collection with all its elements.
|
Key2Collection<E,K1,K2> |
crop()
Returns a copy of this collection but without elements.
|
GapList<E> |
getAll(E elem)
Returns all equal elements.
|
GapList<E> |
getAllByKey1(K1 key)
Returns all elements with specified key.
|
GapList<E> |
getAllByKey2(K2 key)
Returns all elements with specified key.
|
GapList<K1> |
getAllKeys1()
Returns list containing all keys in element order.
|
GapList<K2> |
getAllKeys2()
Returns list containing all keys in element order.
|
E |
getByKey1(K1 key)
Returns all elements with specified key.
|
E |
getByKey2(K2 key)
Returns element with specified key.
|
int |
getCount(E elem)
Returns the number of equal elements.
|
int |
getCountByKey1(K1 key)
Returns the number of elements with specified key.
|
int |
getCountByKey2(K2 key)
Returns the number of elements with specified key.
|
java.util.Set<E> |
getDistinct()
Returns all distinct elements in the same order as in the collection.
|
java.util.Set<K1> |
getDistinctKeys1()
Returns all distinct keys in the same order as in the key map.
|
java.util.Set<K2> |
getDistinctKeys2()
Returns all distinct keys in the same order as in the key map.
|
IFunction<E,K1> |
getKey1Mapper()
Returns mapper for key map.
|
IFunction<E,K2> |
getKey2Mapper()
Returns mapper for key map.
|
void |
invalidate(E elem)
Invalidate element, i.e. all keys of the element are extracted
again and stored in the key maps.
|
void |
invalidateKey1(K1 oldKey,
K1 newKey,
E elem)
Invalidate key value of element.
|
void |
invalidateKey2(K2 oldKey,
K2 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.
|
E |
putByKey2(E elem)
Adds or replaces element by key.
|
GapList<E> |
removeAll(E elem)
Removes all equal elements.
|
GapList<E> |
removeAllByKey1(K1 key)
Removes all elements with specified key.
|
GapList<E> |
removeAllByKey2(K2 key)
Removes all elements with specified key.
|
E |
removeByKey1(K1 key)
Removes element with specified key.
|
E |
removeByKey2(K2 key)
Removes element with specified key.
|
public Key2Collection<E,K1,K2> copy()
KeyCollectionImplcopy in class KeyCollectionImpl<E>public Key2Collection<E,K1,K2> crop()
KeyCollectionImplcrop in class KeyCollectionImpl<E>public GapList<E> getAll(E elem)
KeyCollectionImplelem - elementpublic int getCount(E elem)
KeyCollectionImplelem - elementpublic GapList<E> removeAll(E elem)
KeyCollectionImplelem - elementpublic java.util.Set<E> getDistinct()
KeyCollectionImplpublic E put(E elem)
KeyCollectionImpl
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 void invalidate(E elem)
KeyCollectionImplelem - element to invalidatepublic IFunction<E,K1> getKey1Mapper()
public java.util.Map<K1,E> asMap1()
java.lang.IllegalArgumentException - if the key map cannot be viewed as Mappublic boolean containsKey1(K1 key)
key - keypublic E getByKey1(K1 key)
key - keypublic GapList<E> getAllByKey1(K1 key)
key - keypublic int getCountByKey1(K1 key)
key - keypublic E removeByKey1(K1 key)
key - keypublic GapList<E> removeAllByKey1(K1 key)
key - keypublic GapList<K1> getAllKeys1()
public java.util.Set<K1> 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(K1 oldKey, K1 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 IFunction<E,K2> getKey2Mapper()
public java.util.Map<K2,E> asMap2()
java.lang.IllegalArgumentException - if the key map cannot be viewed as Mappublic boolean containsKey2(K2 key)
key - keypublic E getByKey2(K2 key)
key - keypublic GapList<E> getAllByKey2(K2 key)
key - keypublic int getCountByKey2(K2 key)
key - keypublic E removeByKey2(K2 key)
key - keypublic GapList<E> removeAllByKey2(K2 key)
key - keypublic GapList<K2> getAllKeys2()
public java.util.Set<K2> getDistinctKeys2()
public E putByKey2(E elem)
if (containsKey2(elem)) {
removeByKey2(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 invalidateKey2(K2 oldKey, K2 newKey, E elem)
oldKey - old key valuenewKey - new key valueelem - element to invalidate (can be null if there are no duplicates with this key)