Method keySet

src/main/java/gate/util/RBTreeMap.java:556–588

Returns a Set view of the keys contained in this map. The set's iterator will return the keys in ascending order. The map is backed by this RBTreeMap instance, so changes to this map are reflected in the Set, and vice-versa. The Set supports element removal, which removes the correspondi

()

    * @return a set view of the keys contained in this RBTreeMap.
    */
  @Override
  public Set<K> keySet() {
    if (keySet == null) {
      keySet = new AbstractSet<K>() {

        @Override
        public java.util.Iterator<K> iterator() {
            return new Iterator<K>(KEYS);
        }

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

        @Override
        public boolean contains(Object o) {
          return containsKey(o);
        }

        @Override
        public boolean remove(Object o) {
          return RBTreeMap.this.remove(o) != null;
        }

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

  /**
    * Returns a collection view of the values contained in this map.  The