public Object next() { if (remaining <= 0) throw new NoSuchElementException(); remaining--; try { return new AbstractMap.SimpleImmutableEntry(ois.readObject(), ois.readObject()); } catch (java.io.IOException e) { throw new IteratorIOException(e); } catch (ClassNotFoundException e) { throw new IteratorNoClassException(e); } } public void remove() { throw new UnsupportedOperationException(); }
/** * @since 1.6 */ public Map.Entry lastEntry() { Entry e = getLastEntry(); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
/** * @since 1.6 */ public Map.Entry floorEntry(Object key) { Entry e = getFloorEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
public Object next() { Node n = next; Object v = nextValue; advance(); return new AbstractMap.SimpleImmutableEntry(n.key, v); } }
/** * Creates and returns a new SimpleImmutableEntry holding current * mapping if this node holds a valid value, else null. * @return new entry or null */ AbstractMap.SimpleImmutableEntry createSnapshot() { Object v = getValidValue(); if (v == null) return null; return new AbstractMap.SimpleImmutableEntry(key, v); } }
/** * @since 1.6 */ public Map.Entry firstEntry() { Entry e = getFirstEntry(); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
/** * @since 1.6 */ public Map.Entry floorEntry(Object key) { Entry e = getFloorEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
/** * @since 1.6 */ public Map.Entry lowerEntry(Object key) { Map.Entry e = getLowerEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
public Object next() { if (remaining <= 0) throw new NoSuchElementException(); remaining--; try { return new AbstractMap.SimpleImmutableEntry(ois.readObject(), ois.readObject()); } catch (java.io.IOException e) { throw new IteratorIOException(e); } catch (ClassNotFoundException e) { throw new IteratorNoClassException(e); } } public void remove() { throw new UnsupportedOperationException(); }
/** * @since 1.6 */ public Map.Entry pollLastEntry() { Entry e = getLastEntry(); if (e == null) return null; Map.Entry res = new AbstractMap.SimpleImmutableEntry(e); delete(e); return res; }
/** * @since 1.6 */ public Map.Entry ceilingEntry(Object key) { Entry e = getCeilingEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
/** * Creates and returns a new SimpleImmutableEntry holding current * mapping if this node holds a valid value, else null. * @return new entry or null */ AbstractMap.SimpleImmutableEntry createSnapshot() { Object v = getValidValue(); if (v == null) return null; return new AbstractMap.SimpleImmutableEntry(key, v); } }
public Object next() { Node n = next; Object v = nextValue; advance(); return new AbstractMap.SimpleImmutableEntry(n.key, v); } }
public Map.Entry pollFirstEntry() { TreeMap.Entry e = first(); if (e == null) return null; Map.Entry result = new SimpleImmutableEntry(e); delete(e); return result; }
/** * @since 1.6 */ public Map.Entry higherEntry(Object key) { Entry e = getHigherEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
public java.util.Map.Entry pollLastEntry() { TreeMap.Entry e = last(); if (e == null) return null; Map.Entry result = new SimpleImmutableEntry(e); delete(e); return result; }
public Map.Entry pollFirstEntry() { TreeMap.Entry e = first(); if (e == null) return null; Map.Entry result = new SimpleImmutableEntry(e); delete(e); return result; }
/** * @since 1.6 */ public Map.Entry higherEntry(Object key) { Entry e = getHigherEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
/** * @since 1.6 */ public Map.Entry lowerEntry(Object key) { Map.Entry e = getLowerEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
public Object next() { Node n = next; Object v = nextValue; advance(); return new AbstractMap.SimpleImmutableEntry(n.key, v); } }