/** * Returns a {@link Set} view of the mappings contained in this map. * The set's iterator returns the entries in ascending key order. * The set is backed by the map, so changes to the map are * reflected in the set, and vice-versa. If the map is modified * while an iteration over the set is in progress (except through * the iterator's own {@code remove} operation, or through the * {@code setValue} operation on a map entry returned by the * iterator) the results of the iteration are undefined. The set * supports element removal, which removes the corresponding * mapping from the map, via the {@code Iterator.remove}, * {@code Set.remove}, {@code removeAll}, {@code retainAll} and * {@code clear} operations. It does not support the * {@code add} or {@code addAll} operations. */ public Set<Map.Entry<K,V>> entrySet() { EntrySet es = entrySet; return (es != null) ? es : (entrySet = new EntrySet()); }
/** * Returns a {@link Set} view of the mappings contained in this map. * The set's iterator returns the entries in ascending key order. * The set is backed by the map, so changes to the map are * reflected in the set, and vice-versa. If the map is modified * while an iteration over the set is in progress (except through * the iterator's own {@code remove} operation, or through the * {@code setValue} operation on a map entry returned by the * iterator) the results of the iteration are undefined. The set * supports element removal, which removes the corresponding * mapping from the map, via the {@code Iterator.remove}, * {@code Set.remove}, {@code removeAll}, {@code retainAll} and * {@code clear} operations. It does not support the * {@code add} or {@code addAll} operations. */ public Set<Map.Entry<K,V>> entrySet() { EntrySet es = entrySet; return (es != null) ? es : (entrySet = new EntrySet()); }
@Override public Set<Entry<K, V>> entrySet() { EntrySet result = entrySet; return result != null ? result : (entrySet = new EntrySet()); }
@Override public Set<Entry<K, V>> entrySet() { EntrySet result = entrySet; return result != null ? result : (entrySet = new EntrySet()); }
@Override public Set<Entry<K, V>> entrySet() { EntrySet result = entrySet; return result != null ? result : (entrySet = new EntrySet()); }
@Override public Set<Entry<K, V>> entrySet() { EntrySet result = entrySet; return result != null ? result : (entrySet = new EntrySet()); }
@Override public Set<Entry<K, V>> entrySet() { EntrySet result = entrySet; return result != null ? result : (entrySet = new EntrySet()); }
@Override public Set<Entry<K, V>> entrySet() { EntrySet result = entrySet; return result != null ? result : (entrySet = new EntrySet()); }
@Override public Set<Entry<K, V>> entrySet() { EntrySet result = entrySet; return result != null ? result : (entrySet = new EntrySet()); }
@Override public Set<Entry<K, V>> entrySet() { EntrySet result = entrySet; return result != null ? result : (entrySet = new EntrySet()); }