class TreeBidiMap.InverseEntryView extends TreeBidiMap.View<java.util.Map.Entry<V,K>>
orderType| Constructor and Description |
|---|
InverseEntryView() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
contains(java.lang.Object obj) |
java.util.Iterator<java.util.Map.Entry<V,K>> |
iterator() |
boolean |
remove(java.lang.Object obj) |
clear, sizeadd, addAll, containsAll, isEmpty, retainAll, toArray, toArray, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitpublic boolean contains(java.lang.Object obj)
contains in interface java.util.Collection<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>contains in interface java.util.Set<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>contains in class java.util.AbstractCollection<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>public boolean remove(java.lang.Object obj)
remove in interface java.util.Collection<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>remove in interface java.util.Set<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>remove in class java.util.AbstractCollection<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>public java.util.Iterator<java.util.Map.Entry<V,K>> iterator()
iterator in interface java.lang.Iterable<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>iterator in interface java.util.Collection<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>iterator in interface java.util.Set<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>iterator in class java.util.AbstractCollection<java.util.Map.Entry<V extends java.lang.Comparable<V>,K extends java.lang.Comparable<K>>>