Searched refs:lastReturned (Results 1 – 7 of 7) sorted by relevance
89 long lastReturned = 0; field in RegularEnumSet.EnumSetIterator103 lastReturned = unseen & -unseen; in next()104 unseen -= lastReturned; in next()105 return (E) universe[Long.numberOfTrailingZeros(lastReturned)]; in next()109 if (lastReturned == 0) in remove()111 elements &= ~lastReturned; in remove()112 lastReturned = 0; in remove()
113 long lastReturned = 0; field in JumboEnumSet.EnumSetIterator136 lastReturned = unseen & -unseen; in next()138 unseen -= lastReturned; in next()140 + Long.numberOfTrailingZeros(lastReturned)]; in next()145 if (lastReturned == 0) in remove()148 elements[lastReturnedIndex] &= ~lastReturned; in remove()152 lastReturned = 0; in remove()
872 private Node<E> lastReturned; field in LinkedList.ListItr892 lastReturned = next; in next()895 return lastReturned.item; in next()907 lastReturned = next = (next == null) ? last : next.prev; in previous()909 return lastReturned.item; in previous()922 if (lastReturned == null) in remove()925 Node<E> lastNext = lastReturned.next; in remove()926 unlink(lastReturned); in remove()927 if (next == lastReturned) in remove()931 lastReturned = null; in remove()[all …]
1194 TreeMapEntry<K,V> lastReturned; field in TreeMap.PrivateEntryIterator1199 lastReturned = null; in PrivateEntryIterator()1214 lastReturned = e; in nextEntry()1225 lastReturned = e; in prevEntry()1230 if (lastReturned == null) in remove()1235 if (lastReturned.left != null && lastReturned.right != null) in remove()1236 next = lastReturned; in remove()1237 deleteEntry(lastReturned); in remove()1239 lastReturned = null; in remove()1278 if (lastReturned == null) in remove()[all …]
1337 HashtableEntry<?,?> lastReturned; field in Hashtable.Enumerator1383 HashtableEntry<?,?> e = lastReturned = entry; in nextElement()1404 if (lastReturned == null) in remove()1411 int index = (lastReturned.hash & 0x7FFFFFFF) % tab.length; in remove()1416 if (e == lastReturned) { in remove()1424 lastReturned = null; in remove()
405 private java.util.LinkedList.Node<E> lastReturned; field in LinkedList.ListItr
2269 Node<K,V> lastReturned; field in ConcurrentSkipListMap.Iter2295 lastReturned = next; in advance()2307 Node<K,V> l = lastReturned; in remove()2313 lastReturned = null; in remove()3081 Node<K,V> lastReturned; field in ConcurrentSkipListMap.SubMap.SubMapIter3113 lastReturned = next; in advance()3142 next = m.findNear(lastReturned.key, LT, cmp); in descend()3159 Node<K,V> l = lastReturned; in remove()3163 lastReturned = null; in remove()