public K next () { if (!hasNext) throw new NoSuchElementException(); K key = map.keyTable[nextIndex]; currentIndex = nextIndex; advance(); return key; }
/** Returns a new array containing the remaining keys. */ public ArrayList<K> toArray () { ArrayList array = new ArrayList(map.size); while (hasNext) array.add(next()); return array; } }
/** Returns an iterator for the keys in the map. Remove is supported. */ public Keys<K> keys () { return new Keys(this); }
/** Returns a new array containing the remaining keys. */ public ArrayList<K> toArray () { ArrayList array = new ArrayList(map.size); while (hasNext) array.add(next()); return array; } }
/** Returns a new array containing the remaining keys. */ public ArrayList<K> toArray () { ArrayList array = new ArrayList(map.size); while (hasNext) array.add(next()); return array; } }
/** Returns an iterator for the keys in the map. Remove is supported. */ public Keys<K> keys () { return new Keys(this); }
/** Returns a new array containing the remaining keys. */ public ArrayList<K> toArray () { ArrayList array = new ArrayList(map.size); while (hasNext) array.add(next()); return array; } }
/** Returns an iterator for the keys in the map. Remove is supported. Note that the same iterator instance is returned each time * this method is called. Use the {@link Entries} constructor for nested or multithreaded iteration. */ public Keys<K> keys () { if (keys == null) keys = new Keys(this); else keys.reset(); return keys; }
/** Returns an iterator for the keys in the map. Remove is supported. */ public Keys<K> keys () { return new Keys(this); }
public K next () { K key = map.keyTable[nextIndex]; currentIndex = nextIndex; advance(); return key; }
public K next () { if (!hasNext) throw new NoSuchElementException(); K key = map.keyTable[nextIndex]; currentIndex = nextIndex; advance(); return key; }
public K next () { if (!hasNext) throw new NoSuchElementException(); K key = map.keyTable[nextIndex]; currentIndex = nextIndex; advance(); return key; }