package orsetto
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
A library of assorted structured data interchange languages
Install
dune-project
Dependency
Authors
Maintainers
Sources
r1.0.1.tar.gz
sha256=f64814687276bad56483b2b8dfaaf70d0d6485f67fe5d44bff34bfa47af1896e
md5=3a15a377800cf988a310b4082406c685
doc/orsetto.cf/Cf_sbheap/index.html
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 ... endInterfaces to persistent functional heap data structures.
module PQueue : sig ... endInterfaces to persistent functional priority queue data structures.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page