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 |
|
*/ |
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); |
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; |