Class TreeSet<T>

constructor

• new TreeSet<T = number>(comparator?: TreeSetComparator<T>): TreeSet<T>

  Type Parameters

  • T = number

  Parameters

  • Optionalcomparator: TreeSetComparator<T>

  Returns TreeSet<T>

elements

add

• add(element: T): void

  Parameters

  • element: T

  Returns void

binarySearch

• binarySearch(value: T): number

  Performs a binary search of value in array

  Parameters

  • value: T

    Value to search in array

  Returns number

  If value is found, returns its index in array. Otherwise, returns a negative number indicating where the value should be inserted: -(index + 1)

first

• first(): undefined | T

  Returns undefined | T

isEmpty

• isEmpty(): boolean

  Returns boolean

last

• last(): undefined | T

  Returns undefined | T

pollFirst

• pollFirst(): null | T[]

  Returns null | T[]

pollLast

• pollLast(): null | T[]

  Returns null | T[]

size

• size(): number

  Returns number