Method entrySet

src/main/java/gate/util/RBTreeMap.java:658–705

Returns a set view of the mappings contained in this map. The set's iterator returns the mappings in ascending key order. Each element in the returned set is a Map.Entry . The set is backed by this map, so changes to this map are reflected in the set, and vice-versa. The set supports elem

()

    * @return a set view of the mappings contained in this map.
    */
  @Override
  public Set<Map.Entry<K,V>> entrySet() {
    if (entrySet == null) {
      entrySet = new AbstractSet<Map.Entry<K,V>>() {
        @Override
        public java.util.Iterator<Map.Entry<K,V>> iterator() {
          return new Iterator<Map.Entry<K,V>>(ENTRIES);
        }

        @Override
        public boolean contains(Object o) {
          if (!(o instanceof Map.Entry))
              return false;
          @SuppressWarnings("unchecked")
          Map.Entry<K,V> entry = (Map.Entry<K,V>)o;
          Object value = entry.getValue();
          Entry<K,V> p = getEntry(entry.getKey());
          return p != null && valEquals(p.getValue(), value);
        }

        @Override
        public boolean remove(Object o) {
          if (!(o instanceof Map.Entry))
              return false;
          @SuppressWarnings("unchecked")
          Map.Entry<K,V> entry = (Map.Entry<K,V>)o;
          Object value = entry.getValue();
          Entry<K,V> p = getEntry(entry.getKey());
          if (p != null && valEquals(p.getValue(), value)) {
              deleteEntry(p);
              return true;
          }
          return false;
        }

        @Override
        public int size() {
            return RBTreeMap.this.size();
        }

        @Override
        public void clear() {
            RBTreeMap.this.clear();
        }
      };
    }
    return entrySet;
  }

  /**
    * Returns a view of the portion of this map whose keys range from