/** * Returns a key-value mapping associated with the greatest * key in this map, or <tt>null</tt> if the map is empty. * The returned entry does <em>not</em> support * the <tt>Entry.setValue</tt> method. */ public Map.Entry lastEntry() { for (;;) { Node n = findLast(); if (n == null) return null; AbstractMap.SimpleImmutableEntry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns SimpleImmutableEntry for results of findNear. * @param key the key * @param rel the relation -- OR'ed combination of EQ, LT, GT * @return Entry fitting relation, or null if no such */ AbstractMap.SimpleImmutableEntry getNear(Object key, int rel) { for (;;) { Node n = findNear(key, rel); if (n == null) return null; AbstractMap.SimpleImmutableEntry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns a key-value mapping associated with the greatest * key in this map, or <tt>null</tt> if the map is empty. * The returned entry does <em>not</em> support * the <tt>Entry.setValue</tt> method. */ public Map.Entry lastEntry() { for (;;) { Node n = findLast(); if (n == null) return null; AbstractMap.SimpleImmutableEntry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns a key-value mapping associated with the least * key in this map, or <tt>null</tt> if the map is empty. * The returned entry does <em>not</em> support * the <tt>Entry.setValue</tt> method. */ public Map.Entry firstEntry() { for (;;) { Node n = findFirst(); if (n == null) return null; AbstractMap.SimpleImmutableEntry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns SimpleImmutableEntry for results of findNear. * @param key the key * @param rel the relation -- OR'ed combination of EQ, LT, GT * @return Entry fitting relation, or null if no such */ AbstractMap.SimpleImmutableEntry getNear(Object key, int rel) { for (;;) { Node n = findNear(key, rel); if (n == null) return null; AbstractMap.SimpleImmutableEntry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns a key-value mapping associated with the greatest * key in this map, or <tt>null</tt> if the map is empty. * The returned entry does <em>not</em> support * the <tt>Entry.setValue</tt> method. */ public Map.Entry lastEntry() { for (;;) { Node n = findLast(); if (n == null) return null; AbstractMap.SimpleImmutableEntry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns a key-value mapping associated with the least * key in this map, or <tt>null</tt> if the map is empty. * The returned entry does <em>not</em> support * the <tt>Entry.setValue</tt> method. */ public Map.Entry firstEntry() { for (;;) { Node n = findFirst(); if (n == null) return null; AbstractMap.SimpleImmutableEntry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns a key-value mapping associated with the least * key in this map, or <tt>null</tt> if the map is empty. * The returned entry does <em>not</em> support * the <tt>Entry.setValue</tt> method. */ public Map.Entry firstEntry() { for (;;) { Node n = findFirst(); if (n == null) return null; AbstractMap.SimpleImmutableEntry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns SimpleImmutableEntry for results of findNear. * @param key the key * @param rel the relation -- OR'ed combination of EQ, LT, GT * @return Entry fitting relation, or null if no such */ AbstractMap.SimpleImmutableEntry getNear(Object key, int rel) { for (;;) { Node n = findNear(key, rel); if (n == null) return null; AbstractMap.SimpleImmutableEntry e = n.createSnapshot(); if (e != null) return e; } }
private Map.Entry lowestEntry() { for (;;) { ConcurrentSkipListMap.Node n = loNode(); if (!isBeforeEnd(n)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
private Map.Entry lowestEntry() { for (;;) { ConcurrentSkipListMap.Node n = loNode(); if (!isBeforeEnd(n)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
private Map.Entry lowestEntry() { for (;;) { ConcurrentSkipListMap.Node n = loNode(); if (!isBeforeEnd(n)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
private Map.Entry highestEntry() { for (;;) { ConcurrentSkipListMap.Node n = hiNode(); if (n == null || !inBounds(n.key)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
private Map.Entry highestEntry() { for (;;) { ConcurrentSkipListMap.Node n = hiNode(); if (n == null || !inBounds(n.key)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
private Map.Entry highestEntry() { for (;;) { ConcurrentSkipListMap.Node n = hiNode(); if (n == null || !inBounds(n.key)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }