| Method from java.util.IdentityHashMap$EntrySet Detail: |
public void clear() {
IdentityHashMap.this.clear();
}
|
public boolean contains(Object o) {
if (!(o instanceof Map.Entry))
return false;
Map.Entry entry = (Map.Entry)o;
return containsMapping(entry.getKey(), entry.getValue());
}
|
public Iterator iterator() {
return new EntryIterator();
}
|
public boolean remove(Object o) {
if (!(o instanceof Map.Entry))
return false;
Map.Entry entry = (Map.Entry)o;
return removeMapping(entry.getKey(), entry.getValue());
}
|
public boolean removeAll(Collection c) {
boolean modified = false;
for (Iterator< Map.Entry< K,V > > i = iterator(); i.hasNext(); ) {
if (c.contains(i.next())) {
i.remove();
modified = true;
}
}
return modified;
}
|
public int size() {
return size;
}
|
public Object[] toArray() {
int size = size();
Object[] result = new Object[size];
Iterator< Map.Entry< K,V > > it = iterator();
for (int i = 0; i < size; i++)
result[i] = new AbstractMap.SimpleEntry< K,V >(it.next());
return result;
}
|
public T[] toArray(T[] a) {
int size = size();
if (a.length < size)
a = (T[])java.lang.reflect.Array
.newInstance(a.getClass().getComponentType(), size);
Iterator< Map.Entry< K,V > > it = iterator();
for (int i = 0; i < size; i++)
a[i] = (T) new AbstractMap.SimpleEntry< K,V >(it.next());
if (a.length > size)
a[size] = null;
return a;
}
|