Class PriorityQueue<K>

Type parameters

K

Hierarchy

PriorityQueue

Implements

Queue<K>

Index

Constructors

constructor

Methods

Constructors

constructor

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

- Defined in PriorityQueue.ts:31
Parameters
- iComparator: Comparator<K>
- Optional initialElements: ImmutableCollection<K>
Returns PriorityQueue

Methods

__@iterator

__@iterator(): Iterator<K>

Implementation of Queue.__@iterator
- Defined in PriorityQueue.ts:143
Returns Iterator<K>

the TypeScript style iterator

add

add(k: K): boolean

Implementation of Queue.add
- Defined in PriorityQueue.ts:48
Parameters
- k: K
Returns boolean

clear

clear(): void

Implementation of Queue.clear
- Defined in PriorityQueue.ts:94
Returns void

contains

contains(k: K): boolean

Implementation of Queue.contains
- Defined in PriorityQueue.ts:152
Parameters
- k: K
Returns boolean

true if this collection contains the specified element

element

element(): K

Implementation of Queue.element
- Defined in PriorityQueue.ts:86
Returns K

forEach

forEach(consumer: Consumer<K>): void

Implementation of Queue.forEach
- Defined in PriorityQueue.ts:160
Parameters
- consumer: Consumer<K>
Returns void

immutableCollection

immutableCollection(): ImmutableCollection<K>

Implementation of Queue.immutableCollection
- Defined in PriorityQueue.ts:111
Returns ImmutableCollection<K>

isEmpty

isEmpty(): boolean

Implementation of Queue.isEmpty
- Defined in PriorityQueue.ts:127
Returns boolean

true if this collection contains no elements

iterator

iterator(): JIterator<K>

Implementation of Queue.iterator
- Defined in PriorityQueue.ts:135
Returns JIterator<K>

the Java style iterator

offer

offer(k: K): boolean

Implementation of Queue.offer
- Defined in PriorityQueue.ts:55
Parameters
- k: K
Returns boolean

peek

peek(): K

Implementation of Queue.peek
- Defined in PriorityQueue.ts:78
Returns K

poll

poll(): K

Implementation of Queue.poll
- Defined in PriorityQueue.ts:62
Returns K

remove

remove(k: K): boolean

Implementation of Queue.remove
- Defined in PriorityQueue.ts:104
Parameters
- k: K
Returns boolean

true if this collection contained the specified element

removeQueue

removeQueue(): K

Implementation of Queue.removeQueue
- Defined in PriorityQueue.ts:70
Returns K

size

size(): number

Implementation of Queue.size
- Defined in PriorityQueue.ts:119
Returns number

the number of elements in this collection

toJSON

toJSON(): Array<K>

- Defined in PriorityQueue.ts:170
Returns Array<K>

Generated using TypeDoc