Options
All
  • Public
  • Public/Protected
  • All
Menu

Interface ITreeContainer<Key, T, SourceT, IteratorT, ReverseIteratorT, Elem>

Common interface for tree containers.

author

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

Type parameters

  • Key

  • T: Elem

  • SourceT: ITreeContainer<Key, T, SourceT, IteratorT, ReverseIteratorT, Elem>

  • IteratorT: Iterator<T, SourceT, IteratorT, ReverseIteratorT, Elem>

  • ReverseIteratorT: ReverseIterator<T, SourceT, IteratorT, ReverseIteratorT, Elem>

  • Elem

Hierarchy

Implemented by

Index

Methods

[Symbol.iterator]

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

assign

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

begin

  • begin(): IteratorT

clear

  • clear(): void

count

  • count(key: Key): number

empty

  • empty(): boolean

end

  • end(): IteratorT

equal_range

  • equal_range(key: Key): Pair<IteratorT, IteratorT>

erase

  • erase(key: Key): number
  • erase(pos: IteratorT): IteratorT
  • erase(first: IteratorT, last: IteratorT): IteratorT

find

  • find(key: Key): IteratorT

has

  • has(key: Key): boolean

key_comp

  • key_comp(): Comparator<Key>

lower_bound

  • lower_bound(key: Key): IteratorT

push

  • push(...items: Elem[]): number

rbegin

  • rbegin(): ReverseIteratorT

rend

  • rend(): ReverseIteratorT

size

  • size(): number

swap

  • swap(obj: SourceT): void

toJSON

  • toJSON(): Array<T>

upper_bound

  • upper_bound(key: Key): IteratorT

value_comp

  • value_comp(): Comparator<Elem>

Generated using TypeDoc