Searched refs:findPredecessor (Results 1 - 1 of 1) sorted by relevance

/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentSkipListMap.java292 * broken into 2 parts. findPredecessor() searches index nodes
711 private Node<K,V> findPredecessor(Comparable<? super K> key) { method in class:ConcurrentSkipListMap
747 * from findPredecessor, processing base-level deletions as
767 * findPredecessor returned a deleted node. We can't unlink
769 * on another call to findPredecessor to notice and return
789 Node<K,V> b = findPredecessor(key);
850 Node<K,V> b = findPredecessor(key);
976 // Similar to findPredecessor, but adding index nodes along
1032 * Index nodes are cleared out simply by calling findPredecessor.
1049 Node<K,V> b = findPredecessor(ke
[all...]

Completed in 34 milliseconds