Module Cf_sbheap

Functional skew-binomial heaps.

Overview

This module implements functional heaps and priority queues based on skew-binomial heaps. The underlying algorithm can be found in Chris Okasaki's Ph.D. thesis. These data structures have O(1) cost in space and time for most operations, including merge.

Interfaces
module Heap : sig ... end

Interfaces to persistent functional heap data structures.

module PQueue : sig ... end

Interfaces to persistent functional priority queue data structures.