Options
All
  • Public
  • Public/Protected
  • All
Menu

Class MapElementList<Key, T, Unique, Source>

Doubly Linked List storing map elements.

author

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

Type parameters

  • Key

    Key type

  • T

    Mapped type

  • Unique: boolean

    Whether duplicated key is blocked or not

  • Source: MapContainer<Key, T, Unique, Source, Iterator<Key, T, Unique, Source>, ReverseIterator<Key, T, Unique, Source>>

    Source type

Hierarchy

Implements

Index

Constructors

Protected constructor

Methods

[Symbol.iterator]

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

assign

  • assign(n: number, val: Entry<Key, T>): void
  • assign<InputIterator>(first: InputIterator, last: InputIterator): void

begin

  • begin(): Iterator<Key, T, Unique, Source>

clear

  • clear(): void

empty

  • empty(): boolean

end

  • end(): Iterator<Key, T, Unique, Source>

erase

  • erase(position: Iterator<Key, T, Unique, Source>): Iterator<Key, T, Unique, Source>
  • erase(first: Iterator<Key, T, Unique, Source>, last: Iterator<Key, T, Unique, Source>): Iterator<Key, T, Unique, Source>

insert

  • insert(position: Iterator<Key, T, Unique, Source>, val: Entry<Key, T>): Iterator<Key, T, Unique, Source>
  • insert(position: Iterator<Key, T, Unique, Source>, size: number, val: Entry<Key, T>): Iterator<Key, T, Unique, Source>
  • insert<InputIterator>(position: Iterator<Key, T, Unique, Source>, begin: InputIterator, end: InputIterator): Iterator<Key, T, Unique, Source>

pop_back

  • pop_back(): void

pop_front

  • pop_front(): void

push

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

push_back

  • push_back(val: Entry<Key, T>): void

push_front

  • push_front(val: Entry<Key, T>): void

rbegin

rend

resize

  • resize(n: number): void

size

  • size(): number

swap

  • swap(obj: Source): void

toJSON

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

Generated using TypeDoc