Class NavigableHashImpl<K, V>

Type parameters

K
V

Hierarchy

NavigableHashImpl

Index

Constructors

constructor

Methods

Constructors

constructor

new NavigableHashImpl(iComparator: Comparator<K>, initialElements?: ImmutableMap<K, V>, iInitialCapacity?: number, iLoadFactor?: number): NavigableHashImpl

- Defined in NavigableHash.ts:37
Parameters
- iComparator: Comparator<K>
- Default value initialElements: ImmutableMap<K, V> = null
- Default value iInitialCapacity: number = 20
- Default value iLoadFactor: number = 0.75
Returns NavigableHashImpl

Methods

ceilingEntry

ceilingEntry(key: K): NavigableHashNode<K, V>

- Defined in NavigableHash.ts:382
Parameters
- key: K
Returns NavigableHashNode<K, V>

an entry with the least key greater than or equal to key, or null if there is no such key

clear

clear(): void

- Defined in NavigableHash.ts:238
Returns void

comparator

comparator(): Comparator<K>

- Defined in NavigableHash.ts:250
Returns Comparator<K>

the comparator used to order the keys in this map

firstEntry

firstEntry(): NavigableHashNode<K, V>

- Defined in NavigableHash.ts:370
Returns NavigableHashNode<K, V>

an entry with the least key, or null if this map is empty

floorEntry

floorEntry(key: K): NavigableHashNode<K, V>

- Defined in NavigableHash.ts:505
Parameters
- key: K
Returns NavigableHashNode<K, V>

an entry with the greatest key less than or equal to key, or null if there is no such key

getEntry

getEntry(key: K): NavigableHashNode<K, V>

- Defined in NavigableHash.ts:605
Parameters
- key: K
Returns NavigableHashNode<K, V>

an entry with the key, or null if there is no such key

getNavigableHashNodeCollectable

getNavigableHashNodeCollectable(): Collectable<NavigableHashNode<K, V>>

- Defined in NavigableHash.ts:55
Returns Collectable<NavigableHashNode<K, V>>

getNavigableHashNodeComparator

getNavigableHashNodeComparator(): Comparator<NavigableHashNode<K, V>>

- Defined in NavigableHash.ts:54
Returns Comparator<NavigableHashNode<K, V>>

higherEntry

higherEntry(key: K): NavigableHashNode<K, V>

- Defined in NavigableHash.ts:405
Parameters
- key: K
Returns NavigableHashNode<K, V>

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

isEmpty

isEmpty(): boolean

- Defined in NavigableHash.ts:266
Returns boolean

true if this map contains no key-value mappings

lastEntry

lastEntry(): NavigableHashNode<K, V>

- Defined in NavigableHash.ts:571
Returns NavigableHashNode<K, V>

an entry with the greatest key, or null if this map is empty

lowerEntry

lowerEntry(key: K): NavigableHashNode<K, V>

- Defined in NavigableHash.ts:450
Parameters
- key: K
Returns NavigableHashNode<K, V>

an entry with the highest key lower than key, or null if there is no such key

nextHigherNode

nextHigherNode(node: NavigableHashNode<K, V>): NavigableHashNode<K, V>

- Defined in NavigableHash.ts:424
Parameters
- node: NavigableHashNode<K, V>
Returns NavigableHashNode<K, V>

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

put

put(key: K, value: V): V

- Defined in NavigableHash.ts:290
Parameters
- key: K
- value: V
Returns V

the previous value associated with key, or undefined if there was no mapping for key. (An undefined return can also indicate that the map previously associated undefined with key.)

remove

remove(key: K): V

- Defined in NavigableHash.ts:200
Parameters
- key: K
Returns V

the previous value associated with key, or null if there was no mapping for key. (A null return can also indicate that the map previously associated null with key.)

removeElement

removeElement(node: NavigableHashNode<K, V>): void

- Defined in NavigableHash.ts:213
Parameters
- node: NavigableHashNode<K, V>
Returns void

size

size(): number

- Defined in NavigableHash.ts:258
Returns number

the number of key-value mappings in this map

Generated using TypeDoc