ITreeSet | tstl

Common interface for tree sets.

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

Type parameters

Key

Key type
Unique: boolean

Whether duplicated key is blocked or not
Source: ITreeSet<Key, Unique, Source, IteratorT, ReverseT>

Derived type extending this ITreeSet
IteratorT: Iterator<Key, Unique, Source, IteratorT, ReverseT>

Iterator type
ReverseT: ReverseIterator<Key, Unique, Source, IteratorT, ReverseT>

Reverse iterator type

Hierarchy

SetContainer<Key, Unique, Source, IteratorT, ReverseT>
ITreeContainer<Key, Key, Source, IteratorT, ReverseT, Key>
- ITreeSet

Implements

IContainer<Key, Source, IteratorT, ReverseT, Key>
IAssociativeContainer<Key, Key, Source, IteratorT, ReverseT, Key>

Index

Type aliases

Constructors

constructor

Methods

Type aliases

InsertRet

InsertRet<Key, Unique, Source, IteratorT, ReverseT>: Unique extends true ? Pair<IteratorT, boolean> : IteratorT

Return type of {@link SetContainer.insert}

Type parameters

Key
Unique: boolean
Source: SetContainer<Key, Unique, Source, IteratorT, ReverseT>
IteratorT: Iterator<Key, Unique, Source, IteratorT, ReverseT>
ReverseT: ReverseIterator<Key, Unique, Source, IteratorT, ReverseT>

Iterator

Iterator<Key, Unique, SourceT, IteratorT, ReverseT>: Readonly<Iterator<Key, SourceT, IteratorT, ReverseT, Key>>

Iterator of SetContainer

author: Jenogho Nam http://samchon.org

Type parameters

Key
Unique: boolean
SourceT: SetContainer<Key, Unique, SourceT, IteratorT, ReverseT>
IteratorT: Iterator<Key, Unique, SourceT, IteratorT, ReverseT>
ReverseT: ReverseIterator<Key, Unique, SourceT, IteratorT, ReverseT>

ReverseIterator

ReverseIterator<Key, Unique, SourceT, IteratorT, ReverseT>: Readonly<ReverseIterator<Key, SourceT, IteratorT, ReverseT, Key>>

Reverse iterator of SetContainer

author: Jenogho Nam http://samchon.org

Type parameters

Key
Unique: boolean
SourceT: SetContainer<Key, Unique, SourceT, IteratorT, ReverseT>
IteratorT: Iterator<Key, Unique, SourceT, IteratorT, ReverseT>
ReverseT: ReverseIterator<Key, Unique, SourceT, IteratorT, ReverseT>

Constructors

Protected constructor

new ITreeSet(factory: (thisArg: Source) => ILinearContainerBase<Key, Source, IteratorT, ReverseT>): ITreeSet

Inherited from SetContainer.constructor
- Defined in base/container/SetContainer.ts:37
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 ITreeSet

Methods

[Symbol.iterator]

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

Inherited from Container.[Symbol.iterator]

Overrides IContainer.[Symbol.iterator]
- Defined in base/container/Container.ts:96
inheritdoc

Returns IterableIterator<Key>

assign

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

Inherited from SetContainer.assign

Overrides Container.assign
- Defined in base/container/SetContainer.ts:54
inheritdoc

Type parameters
- InputIterator: Readonly<IForwardIterator<Key, InputIterator>>
Parameters
- first: InputIterator
- last: InputIterator
Returns void

begin

begin(): IteratorT

Inherited from SetContainer.begin

Overrides Container.begin
- Defined in base/container/SetContainer.ts:86
inheritdoc

Returns IteratorT

clear

clear(): void

Inherited from SetContainer.clear

Overrides Container.clear
- Defined in base/container/SetContainer.ts:65
inheritdoc

Returns void

Abstract count

count(key: Key): number

Inherited from SetContainer.count

Overrides IAssociativeContainer.count
- Defined in base/container/SetContainer.ts:113
inheritdoc

Parameters
- key: Key
Returns number

empty

empty(): boolean

Inherited from Container.empty

Overrides IContainer.empty
- Defined in base/container/Container.ts:59
inheritdoc

Returns boolean

end

end(): IteratorT

Inherited from SetContainer.end

Overrides Container.end
- Defined in base/container/SetContainer.ts:94
inheritdoc

Returns IteratorT

equal_range

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

Inherited from ITreeContainer.equal_range
- Defined in internal/container/associative/ITreeContainer.ts:62
Get range of equal elements.

Parameters
- key: Key
  
  Key to search for.
Returns Pair<IteratorT, IteratorT>

Pair of lower_bound and upper_bound.

erase

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

Inherited from SetContainer.erase

Overrides Container.erase
- Defined in base/container/SetContainer.ts:176
inheritdoc

Parameters
- key: Key
Returns number
Inherited from SetContainer.erase

Overrides Container.erase
- Defined in base/container/SetContainer.ts:181
inheritdoc

Parameters
- pos: IteratorT
Returns IteratorT
Inherited from SetContainer.erase

Overrides Container.erase
- Defined in base/container/SetContainer.ts:186
inheritdoc

Parameters
- first: IteratorT
- last: IteratorT
Returns IteratorT

Abstract find

find(key: Key): IteratorT

Inherited from SetContainer.find

Overrides IAssociativeContainer.find
- Defined in base/container/SetContainer.ts:81
inheritdoc

Parameters
- key: Key
Returns IteratorT

has

has(key: Key): boolean

Inherited from SetContainer.has

Overrides IAssociativeContainer.has
- Defined in base/container/SetContainer.ts:105
inheritdoc

Parameters
- key: Key
Returns boolean

key_comp

key_comp(): Comparator<Key>

Inherited from ITreeContainer.key_comp
- Defined in internal/container/associative/ITreeContainer.ts:31
Get key comparison function.

Returns Comparator<Key>

The key comparison function.

lower_bound

lower_bound(key: Key): IteratorT

Inherited from ITreeContainer.lower_bound
- Defined in internal/container/associative/ITreeContainer.ts:46
Get iterator to lower bound.

Parameters
- key: Key
  
  Key to search for.
Returns IteratorT

Iterator to the first element equal or after to the key.

Abstract merge

merge(source: Source): void

Inherited from SetContainer.merge
- Defined in base/container/SetContainer.ts:222
inheritdoc

Parameters
- source: Source
Returns void

push

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

Inherited from SetContainer.push

Overrides Container.push
- Defined in base/container/SetContainer.ts:135
inheritdoc

Parameters
- Rest ...items: Key[]
Returns number

rbegin

rbegin(): ReverseT

Inherited from Container.rbegin

Overrides IContainer.rbegin
- Defined in base/container/Container.ts:80
inheritdoc

Returns ReverseT

rend

rend(): ReverseT

Inherited from Container.rend

Overrides IContainer.rend
- Defined in base/container/Container.ts:88
inheritdoc

Returns ReverseT

size

size(): number

Inherited from SetContainer.size

Overrides Container.size
- Defined in base/container/SetContainer.ts:118
inheritdoc

Returns number

Abstract swap

swap(obj: Source): void

Inherited from SetContainer.swap

Overrides Container.swap
- Defined in base/container/SetContainer.ts:217
inheritdoc

Parameters
- obj: Source
Returns void

toJSON

toJSON(): Array<Key>

Inherited from Container.toJSON

Overrides IContainer.toJSON
- Defined in base/container/Container.ts:130
inheritdoc

Returns Array<Key>

upper_bound

upper_bound(key: Key): IteratorT

Inherited from ITreeContainer.upper_bound
- Defined in internal/container/associative/ITreeContainer.ts:54
Get iterator to upper bound.

Parameters
- key: Key
  
  Key to search for.
Returns IteratorT

Iterator to the first element after the key.

value_comp

value_comp(): Comparator<Key>

Inherited from ITreeContainer.value_comp
- Defined in internal/container/associative/ITreeContainer.ts:38
Get value comparison function.

Returns Comparator<Key>

The value comparison function.

Type parameters

Key

Unique: boolean

Source: ITreeSet<Key, Unique, Source, IteratorT, ReverseT>

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

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

Hierarchy

Implements

Index

Type aliases

Constructors

Methods

Type aliases

InsertRet

Type parameters

Key

Unique: boolean

Source: SetContainer<Key, Unique, Source, IteratorT, ReverseT>

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

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

Iterator

Type parameters

Key

Unique: boolean

SourceT: SetContainer<Key, Unique, SourceT, IteratorT, ReverseT>

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

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

ReverseIterator

Type parameters

Key

Unique: boolean

SourceT: SetContainer<Key, Unique, SourceT, IteratorT, ReverseT>

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

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

Constructors

Protected constructor

Parameters

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

Parameters

thisArg: Source

Returns ILinearContainerBase<Key, Source, IteratorT, ReverseT>

Returns ITreeSet

Methods

[Symbol.iterator]

Returns IterableIterator<Key>

assign

Type parameters

InputIterator: Readonly<IForwardIterator<Key, InputIterator>>

Parameters

first: InputIterator

last: InputIterator

Returns void

begin

Returns IteratorT

clear

Returns void

Abstract count

Parameters

key: Key

Returns number

empty

Returns boolean

end

Returns IteratorT

equal_range

Parameters

key: Key

Returns Pair<IteratorT, IteratorT>

erase

Parameters

key: Key

Returns number

Parameters

pos: IteratorT

Returns IteratorT

Parameters

first: IteratorT

last: IteratorT

Returns IteratorT

Abstract find