util/concurrent/ConcurrentSkipListMap.java

92  * asynchronous nature of these maps, determining the current number
286      * requirement for a map is slightly less than for the current
292      * than the current level adds a level to the head index by
461          * actually called in any current code checking for markers
482          * @param f the assumed current successor of this node
525          * Creates and returns a new SimpleImmutableEntry holding current
593          * @param succ the expected current successor
607          * @param succ the expected current successor
699      *       predecessor b's current successor, which means that
1003      * unless current thread stalls immediately before first CAS, in
1359         // Track the current rightmost node at each level. Uses an
1376             int rnd = ThreadLocalRandom.current().nextInt();
1481             int rnd = ThreadLocalRandom.current().nextInt();
1623      * asynchronous nature of these maps, determining the current
1682      * @return the current (existing or computed) value associated with
1701      * compute a new mapping given the key and its current mapped
1734      * current mapped value (or {@code null} if there is no current
3334         Node<K,V> current; // current traversal node; initialize at origin
3339             this.current = origin; this.fence = fence; this.est = est;
3356             if ((e = current) != null && (ek = e.key) != null) {
3363                         current = n;
3378             Node<K,V> e = current;
3379             current = null;
3393             Node<K,V> e = current;
3401                     current = e.next;
3406             current = e;
3444             if ((e = current) != null && (ek = e.key) != null) {
3451                         current = n;
3466             Node<K,V> e = current;
3467             current = null;
3483             Node<K,V> e = current;
3491                     current = e.next;
3497             current = e;
3531             if ((e = current) != null && (ek = e.key) != null) {
3538                         current = n;
3553             Node<K,V> e = current;
3554             current = null;
3571             Node<K,V> e = current;
3579                     current = e.next;
3586             current = e;