| 212 |
|
* highly contended cases. |
| 213 |
|
* |
| 214 |
|
* Unlike most skip-list implementations, index insertion and |
| 215 |
< |
* deletion here require a separate traversal pass occuring after |
| 215 |
> |
* deletion here require a separate traversal pass occurring after |
| 216 |
|
* the base-level action, to add or remove index nodes. This adds |
| 217 |
|
* to single-threaded overhead, but improves contended |
| 218 |
|
* multithreaded performance by narrowing interference windows, |
| 468 |
|
* Returns value if this node contains a valid key-value pair, |
| 469 |
|
* else null. |
| 470 |
|
* @return this node's value if it isn't a marker or header or |
| 471 |
< |
* is deleted, else null. |
| 471 |
> |
* is deleted, else null |
| 472 |
|
*/ |
| 473 |
|
V getValidValue() { |
| 474 |
|
Object v = value; |
| 507 |
|
volatile Index<K,V> right; |
| 508 |
|
|
| 509 |
|
/** |
| 510 |
< |
* Creates index node with given values |
| 510 |
> |
* Creates index node with given values. |
| 511 |
|
*/ |
| 512 |
|
Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) { |
| 513 |
|
this.node = node; |
| 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 |
| 917 |
|
* Main insertion method. Adds element if not present, or |
| 918 |
|
* replaces value if present and onlyIfAbsent is false. |
| 919 |
|
* @param kkey the key |
| 920 |
< |
* @param value the value that must be associated with key |
| 920 |
> |
* @param value the value that must be associated with key |
| 921 |
|
* @param onlyIfAbsent if should not insert if already present |
| 922 |
|
* @return the old value, or null if newly inserted |
| 923 |
|
*/ |
| 1270 |
|
} |
| 1271 |
|
} |
| 1272 |
|
|
| 1273 |
< |
/** |
| 1273 |
> |
/** |
| 1274 |
|
* Removes first entry; return key or null if empty. |
| 1275 |
|
*/ |
| 1276 |
|
K pollFirstKey() { |
| 1601 |
|
* Constructs a new map containing the same mappings as the given |
| 1602 |
|
* {@code SortedMap}, sorted according to the same ordering. |
| 1603 |
|
* @param m the sorted map whose mappings are to be placed in this |
| 1604 |
< |
* map, and whose comparator is to be used to sort this map. |
| 1604 |
> |
* map, and whose comparator is to be used to sort this map |
| 1605 |
|
* @throws NullPointerException if the specified sorted map is |
| 1606 |
< |
* {@code null}. |
| 1606 |
> |
* {@code null} |
| 1607 |
|
*/ |
| 1608 |
|
public ConcurrentSkipListMap(SortedMap<K, ? extends V> m) { |
| 1609 |
|
this.comparator = m.comparator(); |
| 1728 |
|
* distinct because readObject calls can't be nicely adapted |
| 1729 |
|
* as the kind of iterator needed by buildFromSorted. (They |
| 1730 |
|
* can be, but doing so requires type cheats and/or creation |
| 1731 |
< |
* of adaptor classes.) It is simpler to just adapt the code. |
| 1731 |
> |
* of adapter classes.) It is simpler to just adapt the code. |
| 1732 |
|
*/ |
| 1733 |
|
|
| 1734 |
|
HeadIndex<K,V> h = head; |
| 2212 |
|
* if this map uses its keys' natural order. |
| 2213 |
|
* |
| 2214 |
|
* @return the comparator associated with this map, or |
| 2215 |
< |
* {@code null} if it uses its keys' natural sort method. |
| 2215 |
> |
* {@code null} if it uses its keys' natural sort method |
| 2216 |
|
*/ |
| 2217 |
|
public Comparator<? super K> comparator() { |
| 2218 |
|
return comparator; |
| 2842 |
|
} |
| 2843 |
|
|
| 2844 |
|
final class DescendingEntryIterator extends EntryIter |
| 2845 |
< |
implements Iterator<Map.Entry<K,V>> { |
| 2845 |
> |
implements Iterator<Map.Entry<K,V>> { |
| 2846 |
|
DescendingEntryIterator() { |
| 2847 |
|
initDescending(); |
| 2848 |
|
} |
| 2854 |
|
} |
| 2855 |
|
|
| 2856 |
|
final class DescendingSubMapEntryIterator extends EntryIter |
| 2857 |
< |
implements Iterator<Map.Entry<K,V>> { |
| 2857 |
> |
implements Iterator<Map.Entry<K,V>> { |
| 2858 |
|
final K least; |
| 2859 |
|
DescendingSubMapEntryIterator(K least, K fence) { |
| 2860 |
|
initDescending(least, fence); |
| 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} if to end |
| 3116 |
|
*/ |
| 3117 |
|
K getFence() { |
| 3118 |
|
return fence; |
