Method RBTreeMap

src/main/java/gate/util/RBTreeMap.java:77–78

Constructs a new, empty map, sorted according to the keys' natural order. All keys inserted into the map must implement the Comparable interface. Furthermore, all such keys must be mutually comparable : k1.compareTo(k2) must not throw a ClassCastException for any elements <

()

    * @see Comparable
    */
  public RBTreeMap() {
  }

  /**
    * Constructs a new, empty map, sorted according to the given comparator.