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.2.tar.gz
sha256=bb2af4d8b376b2d60fa996bd4d3b90d9f3559455672540f6d7c3598af81d483b
md5=f7bfa83013801b42fcdba607af2f012b
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