/openjdk7/jdk/src/share/classes/java/util/ |
H A D | JumboEnumSet.java | 113 long lastReturned = 0; field in class:JumboEnumSet.EnumSetIterator 116 * The index corresponding to lastReturned in the elements array. 133 lastReturned = unseen & -unseen; 135 unseen -= lastReturned; 137 + Long.numberOfTrailingZeros(lastReturned)]; 141 if (lastReturned == 0) 144 elements[lastReturnedIndex] &= ~lastReturned; 148 lastReturned = 0;
|
H A D | RegularEnumSet.java | 89 long lastReturned = 0; field in class:RegularEnumSet.EnumSetIterator 102 lastReturned = unseen & -unseen; 103 unseen -= lastReturned; 104 return (E) universe[Long.numberOfTrailingZeros(lastReturned)]; 108 if (lastReturned == 0) 110 elements &= ~lastReturned; 111 lastReturned = 0;
|
H A D | LinkedHashMap.java | 368 Entry<K,V> lastReturned = null; field in class:LinkedHashMap.LinkedHashIterator 382 if (lastReturned == null) 387 LinkedHashMap.this.remove(lastReturned.key); 388 lastReturned = null; 398 Entry<K,V> e = lastReturned = nextEntry;
|
H A D | Hashtable.java | 1108 Entry<K,V> lastReturned = null; field in class:Hashtable.Enumerator 1153 Entry<K,V> e = lastReturned = entry; 1174 if (lastReturned == null) 1181 int index = (lastReturned.hash & 0x7FFFFFFF) % tab.length; 1185 if (e == lastReturned) { 1193 lastReturned = null;
|
H A D | LinkedList.java | 870 private Node<E> lastReturned = null; field in class:LinkedList.ListItr 890 lastReturned = next; 893 return lastReturned.item; 905 lastReturned = next = (next == null) ? last : next.prev; 907 return lastReturned.item; 920 if (lastReturned == null) 923 Node<E> lastNext = lastReturned.next; 924 unlink(lastReturned); 925 if (next == lastReturned) 929 lastReturned [all...] |
H A D | WeakHashMap.java | 839 private Entry<K,V> lastReturned = null; field in class:WeakHashMap.HashIterator 886 lastReturned = entry; 890 return lastReturned; 894 if (lastReturned == null) 901 lastReturned = null;
|
H A D | TreeMap.java | 1097 Entry<K,V> lastReturned; field in class:TreeMap.PrivateEntryIterator 1102 lastReturned = null; 1117 lastReturned = e; 1128 lastReturned = e; 1133 if (lastReturned == null) 1138 if (lastReturned.left != null && lastReturned.right != null) 1139 next = lastReturned; 1140 deleteEntry(lastReturned); 1142 lastReturned 1572 TreeMap.Entry<K,V> lastReturned; field in class:TreeMap.NavigableSubMap.SubMapIterator [all...] |
/openjdk7/jdk/src/share/classes/sun/awt/util/ |
H A D | IdentityLinkedList.java | 653 private Entry<E> lastReturned = header; field in class:IdentityLinkedList.ListItr 682 lastReturned = next; 685 return lastReturned.element; 696 lastReturned = next = next.previous; 699 return lastReturned.element; 712 Entry<E> lastNext = lastReturned.next; 714 IdentityLinkedList.this.remove(lastReturned); 718 if (next==lastReturned) 722 lastReturned = header; 727 if (lastReturned [all...] |
/openjdk7/jdk/src/share/classes/com/sun/tools/jdi/ |
H A D | LinkedHashMap.java | 796 private Entry lastReturned = null; field in class:LinkedHashMap.HashIterator 821 Entry e = lastReturned = entry; 827 if (lastReturned == null) 833 int index = (lastReturned.hash & 0x7FFFFFFF) % tab.length; 837 if (e == lastReturned) { 846 lastReturned = null;
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentHashMap.java | 1322 HashEntry<K, V> lastReturned; field in class:ConcurrentHashMap.HashIterator 1355 lastReturned = e; // cannot assign until after null check 1365 if (lastReturned == null) 1367 ConcurrentHashMap.this.remove(lastReturned.key); 1368 lastReturned = null;
|
H A D | ConcurrentSkipListMap.java | 2197 Node<K,V> lastReturned; field in class:ConcurrentSkipListMap.Iter 2225 lastReturned = next; 2239 Node<K,V> l = lastReturned; 2245 lastReturned = null; 3002 Node<K,V> lastReturned; field in class:ConcurrentSkipListMap.SubMap.SubMapIter 3031 lastReturned = next; 3056 next = m.findNear(lastReturned.key, LT); 3071 Node<K,V> l = lastReturned; 3075 lastReturned = null;
|