Options
All
  • Public
  • Public/Protected
  • All
Menu

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

Basic set container.

template

Derived type extending this SetContainer

author

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

Type parameters

  • Key

    Key type

  • Unique: boolean

    Whether duplicated key is blocked or not

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

  • IteratorT: SetContainer.Iterator<Key, Unique, SourceT, IteratorT, ReverseT>

    Iterator type

  • ReverseT: SetContainer.ReverseIterator<Key, Unique, SourceT, IteratorT, ReverseT>

    Reverse iterator type

Hierarchy

Implements

Index

Constructors

Protected constructor

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

    Parameters

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

          • thisArg: SourceT

          Returns ILinearContainerBase<Key, SourceT, IteratorT, ReverseT>

    Returns SetContainer

Methods

[Symbol.iterator]

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

assign

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

begin

  • begin(): IteratorT

clear

  • clear(): void

Abstract count

  • count(key: Key): number

empty

  • empty(): boolean

end

  • end(): IteratorT

erase

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

Abstract find

  • find(key: Key): IteratorT

has

  • has(key: Key): boolean

Abstract merge

  • merge(source: SourceT): void

push

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

rbegin

  • rbegin(): ReverseT

rend

  • rend(): ReverseT

size

  • size(): number

Abstract swap

  • swap(obj: SourceT): void

toJSON

  • toJSON(): Array<Key>

Generated using TypeDoc