| 766 |
|
} |
| 767 |
|
|
| 768 |
|
/** |
| 769 |
< |
* Returns node holding key or null if no such, clearing out any |
| 769 |
> |
* Returns node holding key, or null if no such, clearing out any |
| 770 |
|
* deleted nodes seen along the way. Repeatedly traverses at |
| 771 |
|
* base-level looking for key starting at predecessor returned |
| 772 |
|
* from findPredecessor, processing base-level deletions as |
| 3049 |
|
/** |
| 3050 |
|
* Creates a new submap. |
| 3051 |
|
* @param least inclusive least value, or {@code null} if from start |
| 3052 |
< |
* @param fence exclusive upper bound or {@code null} if to end |
| 3052 |
> |
* @param fence exclusive upper bound, or {@code null} if to end |
| 3053 |
|
* @throws IllegalArgumentException if least and fence non-null |
| 3054 |
|
* and least greater than fence |
| 3055 |
|
*/ |
| 3104 |
|
|
| 3105 |
|
/** |
| 3106 |
|
* Returns least key. Needed by ConcurrentSkipListSet. |
| 3107 |
< |
* @return least key or {@code null} if from start |
| 3107 |
> |
* @return least key, or {@code null} if from start |
| 3108 |
|
*/ |
| 3109 |
|
K getLeast() { |
| 3110 |
|
return least; |
| 3112 |
|
|
| 3113 |
|
/** |
| 3114 |
|
* Returns fence key. Needed by ConcurrentSkipListSet. |
| 3115 |
< |
* @return fence key or {@code null} of to end |
| 3115 |
> |
* @return fence key, or {@code null} of to end |
| 3116 |
|
*/ |
| 3117 |
|
K getFence() { |
| 3118 |
|
return fence; |
