Options
All
  • Public
  • Public/Protected
  • All
Menu

Class MultiTreeSet<Key, Source, IteratorT, ReverseT>

Basic tree set allowing duplicated keys.

template

Mapped type

author

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

Type parameters

  • Key

    Key type

  • Source: MultiTreeSet<Key, Source, IteratorT, ReverseT>

    Derived type extending this MultiTreeSet

  • IteratorT: Iterator<Key, Source, IteratorT, ReverseT>

    Iterator type

  • ReverseT: ReverseIterator<Key, Source, IteratorT, ReverseT>

    Reverse iterator type

Hierarchy

Implements

Index

Type aliases

Static Iterator

Iterator<Key, SourceT, IteratorT, ReverseT>: Iterator<Key, false, SourceT, IteratorT, ReverseT>

Iterator of MultiSet

author

Jenogho Nam http://samchon.org

Type parameters

  • Key

  • SourceT: MultiSet<Key, SourceT, IteratorT, ReverseT>

  • IteratorT: Iterator<Key, SourceT, IteratorT, ReverseT>

  • ReverseT: ReverseIterator<Key, SourceT, IteratorT, ReverseT>

Static ReverseIterator

ReverseIterator<Key, SourceT, IteratorT, ReverseT>: ReverseIterator<Key, false, SourceT, IteratorT, ReverseT>

Reverse iterator of MultiSet

author

Jenogho Nam http://samchon.org

Type parameters

  • Key

  • SourceT: MultiSet<Key, SourceT, IteratorT, ReverseT>

  • IteratorT: Iterator<Key, SourceT, IteratorT, ReverseT>

  • ReverseT: ReverseIterator<Key, SourceT, IteratorT, ReverseT>

Constructors

Protected constructor

  • new MultiTreeSet(factory: (thisArg: Source) => ILinearContainerBase<Key, Source, IteratorT, ReverseT>): MultiTreeSet
  • Default Constructor.

    Parameters

    • factory: (thisArg: Source) => ILinearContainerBase<Key, Source, IteratorT, ReverseT>
        • (thisArg: Source): ILinearContainerBase<Key, Source, IteratorT, ReverseT>
        • Parameters

          • thisArg: Source

          Returns ILinearContainerBase<Key, Source, IteratorT, ReverseT>

    Returns MultiTreeSet

Methods

[Symbol.iterator]

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

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

insert

  • insert(key: Key): IteratorT
  • insert(hint: IteratorT, key: Key): IteratorT
  • insert<InputIterator>(begin: InputIterator, end: InputIterator): void

Abstract key_comp

  • key_comp(): Comparator<Key>

Abstract lower_bound

  • lower_bound(key: Key): IteratorT

merge

  • merge(source: Source): void

push

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

rbegin

  • rbegin(): ReverseT

rend

  • rend(): ReverseT

size

  • size(): number

Abstract swap

  • swap(obj: Source): void

toJSON

  • toJSON(): Array<Key>

Abstract upper_bound

  • upper_bound(key: Key): IteratorT

value_comp

  • value_comp(): Comparator<Key>

Generated using TypeDoc