mirror of
https://github.com/Kindelia/Kind2.git
synced 2024-10-26 16:20:40 +03:00
af91be062d
The priority queue is described in Okasaki Purely Functional Data structures it is based on leftist trees
3 lines
86 B
Plaintext
3 lines
86 B
Plaintext
type PriorityQueue<A: Type> {
|
|
new(priority: A -> Nat, tree: PriorityQueue.Tree<A>)
|
|
} |