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.1.tar.gz
sha256=6e6f59fc6a2c590b1b377e40f2120a548e6f09e61e7eb12ffa45cf2d517316b8
md5=533153cd4a9fe8093d3b98afc1073bc8
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