| 3253 |
|
|
| 3254 |
|
public Map.Entry<K,V> ceilingEntry(K key) { |
| 3255 |
|
return (SnapshotEntry<K,V>) |
| 3256 |
< |
m.getNear(key, m.GT|m.EQ, least, fence, false); |
| 3256 |
> |
m.getNear(key, GT|EQ, least, fence, false); |
| 3257 |
|
} |
| 3258 |
|
|
| 3259 |
|
public K ceilingKey(K key) { |
| 3260 |
|
return (K) |
| 3261 |
< |
m.getNear(key, m.GT|m.EQ, least, fence, true); |
| 3261 |
> |
m.getNear(key, GT|EQ, least, fence, true); |
| 3262 |
|
} |
| 3263 |
|
|
| 3264 |
|
public Map.Entry<K,V> lowerEntry(K key) { |
| 3265 |
|
return (SnapshotEntry<K,V>) |
| 3266 |
< |
m.getNear(key, m.LT, least, fence, false); |
| 3266 |
> |
m.getNear(key, LT, least, fence, false); |
| 3267 |
|
} |
| 3268 |
|
|
| 3269 |
|
public K lowerKey(K key) { |
| 3270 |
|
return (K) |
| 3271 |
< |
m.getNear(key, m.LT, least, fence, true); |
| 3271 |
> |
m.getNear(key, LT, least, fence, true); |
| 3272 |
|
} |
| 3273 |
|
|
| 3274 |
|
public Map.Entry<K,V> floorEntry(K key) { |
| 3275 |
|
return (SnapshotEntry<K,V>) |
| 3276 |
< |
m.getNear(key, m.LT|m.EQ, least, fence, false); |
| 3276 |
> |
m.getNear(key, LT|EQ, least, fence, false); |
| 3277 |
|
} |
| 3278 |
|
|
| 3279 |
|
public K floorKey(K key) { |
| 3280 |
|
return (K) |
| 3281 |
< |
m.getNear(key, m.LT|m.EQ, least, fence, true); |
| 3281 |
> |
m.getNear(key, LT|EQ, least, fence, true); |
| 3282 |
|
} |
| 3283 |
|
|
| 3284 |
|
|
| 3285 |
|
public Map.Entry<K,V> higherEntry(K key) { |
| 3286 |
|
return (SnapshotEntry<K,V>) |
| 3287 |
< |
m.getNear(key, m.GT, least, fence, false); |
| 3287 |
> |
m.getNear(key, GT, least, fence, false); |
| 3288 |
|
} |
| 3289 |
|
|
| 3290 |
|
public K higherKey(K key) { |
| 3291 |
|
return (K) |
| 3292 |
< |
m.getNear(key, m.GT, least, fence, true); |
| 3292 |
> |
m.getNear(key, GT, least, fence, true); |
| 3293 |
|
} |
| 3294 |
|
|
| 3295 |
|
public Map.Entry<K,V> firstEntry() { |
