DuplicatePriorityQueue<'a, 'k>
implements a queue with "uncomparable" duplicates. This is helpful since regular heap implementation cannot deal with a large number of duplicated keys efficiently. Note: the duplicated values will be returned in the order they were enqueued
Constructors
| Constructor | Description |
new(extract)
Signature: (extract:('a -> 'k)) -> DuplicatePriorityQueue<'a,'k>
|
|
Instance members
| Instance member | Description |
Count
Signature: int
|
returns the number of elements currently contained in the queue |
Dequeue(key)
Signature: key:byref<'k> -> 'a
|
dequeues the current minimal value (and its key) |
Enqueue(v)
Signature: v:'a -> unit
|
enqueues a new element |
