Class NavigableHashSet<K>

Type parameters

K

Hierarchy

NavigableHashSet

Implements

NavigableSet<K>

Index

Constructors

constructor

Methods

Constructors

constructor

new NavigableHashSet(iComparator: Comparator<K>, initialElements: ImmutableCollection<K>): NavigableHashSet

- Defined in NavigableHash.ts:1250
Parameters
- iComparator: Comparator<K>
- Optional initialElements: ImmutableCollection<K>
Returns NavigableHashSet

Methods

__@iterator

__@iterator(): Iterator<K>

Implementation of NavigableSet.__@iterator
- Defined in NavigableHash.ts:1470
Returns Iterator<K>

the TypeScript style iterator

add

add(element: K): boolean

Implementation of NavigableSet.add
- Defined in NavigableHash.ts:1270
Parameters
- element: K
Returns boolean

true if this set did not already contain the specified element

ceiling

ceiling(key: K): K

Implementation of NavigableSet.ceiling
- Defined in NavigableHash.ts:1325
Parameters
- key: K
Returns K

the least element greater than or equal to item, or null if there is no such element

clear

clear(): void

Implementation of NavigableSet.clear
- Defined in NavigableHash.ts:1411
Returns void

contains

contains(key: K): boolean

Implementation of NavigableSet.contains
- Defined in NavigableHash.ts:1299
Parameters
- key: K
Returns boolean

true if this set contains the specified element

first

first(): K

Implementation of NavigableSet.first
- Defined in NavigableHash.ts:1361
Returns K

the first (lowest) element currently in this set, undefined if there are no elements in this set

floor

floor(key: K): K

Implementation of NavigableSet.floor
- Defined in NavigableHash.ts:1312
Parameters
- key: K
Returns K

the greatest element less than or equal to e, or null if there is no such element

forEach

forEach(consumer: Consumer<K>): void

Implementation of NavigableSet.forEach
- Defined in NavigableHash.ts:1350
Parameters
- consumer: Consumer<K>
Returns void

getNextHigherKey

getNextHigherKey(key: K): K

- Defined in NavigableHash.ts:1450
Parameters
- key: K
Returns K

the least key greater than key, or null if there is no such key

higher

higher(key: K): K

Implementation of NavigableSet.higher
- Defined in NavigableHash.ts:1338
Parameters
- key: K
Returns K

the least element greater than the given element, or null if there is no such element

immutableCollection

immutableCollection(): ImmutableCollection<K>

Implementation of NavigableSet.immutableCollection
- Defined in NavigableHash.ts:1477
Returns ImmutableCollection<K>

immutableSet

immutableSet(): ImmutableSet<K>

Implementation of NavigableSet.immutableSet
- Defined in NavigableHash.ts:1484
Returns ImmutableSet<K>

isEmpty

isEmpty(): boolean

Implementation of NavigableSet.isEmpty
- Defined in NavigableHash.ts:1290
Returns boolean

true if this set contains no elements

iterator

iterator(): JIterator<K>

Implementation of NavigableSet.iterator
- Defined in NavigableHash.ts:1462
Returns JIterator<K>

the Java style iterator

last

last(): K

Implementation of NavigableSet.last
- Defined in NavigableHash.ts:1386
Returns K

the last (highest) element currently in this set, undefined if there are no elements in this set

lower

lower(key: K): K

Implementation of NavigableSet.lower
- Defined in NavigableHash.ts:1374
Parameters
- key: K
Returns K

the greatest element less than the given element, or null if there is no such element

pollFirst

pollFirst(): K

Implementation of NavigableSet.pollFirst
- Defined in NavigableHash.ts:1419
Returns K

the first (lowest) element, or null if this set is empty

pollLast

pollLast(): K

Implementation of NavigableSet.pollLast
- Defined in NavigableHash.ts:1434
Returns K

the last (highest) element, or null if this set is empty

remove

remove(element: K): boolean

Implementation of NavigableSet.remove
- Defined in NavigableHash.ts:1399
Parameters
- element: K
Returns boolean

true if the set contained the specified element

size

size(): number

Implementation of NavigableSet.size
- Defined in NavigableHash.ts:1282
Returns number

the number of elements in this set (its cardinality)

toJSON

toJSON(): Array<K>

- Defined in NavigableHash.ts:1491
Returns Array<K>

Generated using TypeDoc