Options
All
  • Public
  • Public/Protected
  • All
Menu

A collection of elements where each element has to be unique.

Internally, a hash set is just a tiny wrapper around a HashIndex where the key is equal to the element being added/removed.

Type parameters

  • T

Hierarchy

Index

Accessors

size

  • get size(): number

Methods

[Symbol.iterator]

  • [Symbol.iterator](): Generator<T, void, unknown>

add

clear

  • clear(): void

clone

delete

  • delete(el: T): boolean

deleteAll

  • deleteAll(element: T): number

deleteAt

deleteKey

  • deleteKey(key: T): number

equalKeys

  • equalKeys(key: T): Range<T>

findKey

has

  • has(element: T): boolean

hasKey

  • hasKey(key: T): boolean

toRange

  • toRange(): FullHashRange<T, T>

Legend

  • Property
  • Method
  • Accessor
  • Property
  • Method
  • Inherited property
  • Inherited method

Generated using TypeDoc