Class SortedTree<K, V>

A SortedTree is a map that holds key value pairs ordered by keys. Any primitive value (and objects that implement Comparable or Ordered interfaces) can be used as keys or values.

See

Template

V

Type Parameters

  • K

  • V

Hierarchy

Constructors

Accessors

Methods

  • Returns true if the key existed in the tree and was removed.

    Returns

    true if key was removed, otherwise false.

    Parameters

    • key: K

    Returns boolean

  • Returns true if the key exists in the tree.

    Returns

    true if key is found, otherwise false.

    Parameters

    • key: K

    Returns boolean

  • Returns a new iterator of [K, V] pairs in reverse order of keys.

    Returns

    Returns IterableIterator<[K, V]>

Generated using TypeDoc