AbstractDualBidiMap.EntrySet
, AbstractDualBidiMap.KeySet
, AbstractDualBidiMap.Values
protected abstract static class AbstractDualBidiMap.View<K,V,E> extends AbstractCollectionDecorator<E>
Modifier and Type | Field | Description |
---|---|---|
protected AbstractDualBidiMap<K,V> |
parent |
The parent map
|
Modifier | Constructor | Description |
---|---|---|
protected |
View(java.util.Collection<E> coll,
AbstractDualBidiMap<K,V> parent) |
Constructs a new view of the BidiMap.
|
Modifier and Type | Method | Description |
---|---|---|
void |
clear() |
|
boolean |
equals(java.lang.Object object) |
|
int |
hashCode() |
|
boolean |
removeAll(java.util.Collection<?> coll) |
|
boolean |
retainAll(java.util.Collection<?> coll) |
add, addAll, contains, containsAll, decorated, isEmpty, iterator, remove, setCollection, size, toArray, toArray, toString
protected final AbstractDualBidiMap<K,V> parent
protected View(java.util.Collection<E> coll, AbstractDualBidiMap<K,V> parent)
coll
- the collection view being decoratedparent
- the parent BidiMappublic boolean equals(java.lang.Object object)
equals
in class java.lang.Object
public int hashCode()
hashCode
in class java.lang.Object
public boolean removeAll(java.util.Collection<?> coll)
removeAll
in class AbstractCollectionDecorator<E>
public boolean retainAll(java.util.Collection<?> coll)
This implementation iterates over the elements of this bidi map, checking each element in
turn to see if it's contained in coll
. If it's not contained, it's removed
from this bidi map. As a consequence, it is advised to use a collection type for
coll
that provides a fast (e.g. O(1)) implementation of
Collection.contains(Object)
.
retainAll
in class AbstractCollectionDecorator<E>
public void clear()
clear
in class AbstractCollectionDecorator<E>
Copyright © 2001-2019 - Apache Software Foundation