Searched defs:findPredecessor (Results 1 - 1 of 1) sorted by relevance
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentSkipListMap.java | 312 * broken into 2 parts. findPredecessor() searches index nodes
663 private Node<K,V> findPredecessor(Object key, Comparator<? super K> cmp) { method in class:ConcurrentSkipListMap
695 * from findPredecessor, processing base-level deletions as
715 * findPredecessor returned a deleted node. We can't unlink
717 * on another call to findPredecessor to notice and return
740 for (Node<K,V> b = findPredecessor(key, cmp), n = b.next;;) {
776 for (Node<K,V> b = findPredecessor(key, cmp), n = b.next;;) {
818 for (Node<K,V> b = findPredecessor(key, cmp), n = b.next;;) {
936 * Index nodes are cleared out simply by calling findPredecessor.
955 for (Node<K,V> b = findPredecessor(ke
[all...] |
Completed in 42 milliseconds