breeze.collection
Represents a beam, which is essentially a priority queue with a maximum size.
From Okasaki's Functional Data Structures.
From Okasaki's Functional Data Structures. Represents a functional heap
From Okasaki's Functional Data Structures. Represents a functional heap