Options
All
  • Public
  • Public/Protected
  • All
Menu

Class TreeMultiMap<Key, T>

Multiple-key Map based on Tree.

author

Jeongho Nam - https://github.com/samchon

Type parameters

  • Key

  • T

Hierarchy

  • MultiTreeMap<Key, T, TreeMultiMap<Key, T>, TreeMultiMap.Iterator<Key, T>, TreeMultiMap.ReverseIterator<Key, T>>
    • TreeMultiMap

Implements

Index

Constructors

constructor

Methods

[Symbol.iterator]

  • [Symbol.iterator](): IterableIterator<Entry<Key, T>>

assign

  • assign<InputIterator>(first: InputIterator, last: InputIterator): void

begin

  • begin(): TreeMultiMap.Iterator<Key, T>

clear

  • clear(): void

count

  • count(key: Key): number

emplace

  • emplace(key: Key, val: T): TreeMultiMap.Iterator<Key, T>

emplace_hint

  • emplace_hint(hint: TreeMultiMap.Iterator<Key, T>, key: Key, val: T): TreeMultiMap.Iterator<Key, T>

empty

  • empty(): boolean

end

  • end(): TreeMultiMap.Iterator<Key, T>

equal_range

  • equal_range(key: Key): Pair<TreeMultiMap.Iterator<Key, T>, TreeMultiMap.Iterator<Key, T>>

erase

  • erase(key: Key): number
  • erase(it: TreeMultiMap.Iterator<Key, T>): TreeMultiMap.Iterator<Key, T>
  • erase(begin: TreeMultiMap.Iterator<Key, T>, end: TreeMultiMap.Iterator<Key, T>): TreeMultiMap.Iterator<Key, T>

find

  • find(key: Key): TreeMultiMap.Iterator<Key, T>

has

  • has(key: Key): boolean

insert

  • insert(pair: IPair<Key, T>): TreeMultiMap.Iterator<Key, T>
  • insert(hint: TreeMultiMap.Iterator<Key, T>, pair: IPair<Key, T>): TreeMultiMap.Iterator<Key, T>
  • insert<InputIterator>(first: InputIterator, last: InputIterator): void
  • Insert an element.

    Parameters

    • pair: IPair<Key, T>

      A tuple to be referenced for the insert.

    Returns TreeMultiMap.Iterator<Key, T>

    An iterator to the newly inserted element.

  • Insert an element with hint.

    Parameters

    • hint: TreeMultiMap.Iterator<Key, T>

      Hint for the position where the element can be inserted.

    • pair: IPair<Key, T>

      A tuple to be referenced for the insert.

    Returns TreeMultiMap.Iterator<Key, T>

    An iterator to the newly inserted element.

  • Insert range elements.

    Type parameters

    Parameters

    • first: InputIterator

      Input iterator of the first position.

    • last: InputIterator

      Input iteartor of the last position.

    Returns void

key_comp

  • key_comp(): Comparator<Key>

lower_bound

  • lower_bound(key: Key): TreeMultiMap.Iterator<Key, T>

merge

push

  • push(...items: IPair<Key, T>[]): number

rbegin

  • rbegin(): TreeMultiMap.ReverseIterator<Key, T>

rend

  • rend(): TreeMultiMap.ReverseIterator<Key, T>

size

  • size(): number

swap

toJSON

  • toJSON(): Array<Entry<Key, T>>

upper_bound

  • upper_bound(key: Key): TreeMultiMap.Iterator<Key, T>

value_comp

  • value_comp(): Comparator<IPair<Key, T>>

Generated using TypeDoc