package coq

  1. Overview
  2. Docs
package coq
Legend:
Library
Module
Module type
Parameter
Class
Class type
type t

Type of functional heaps

type elt

Type of elements

val empty : t

The empty heap

val add : elt -> t -> t

add x h returns a new heap containing the elements of h, plus x; complexity $ O(log(n)) $

val maximum : t -> elt

maximum h returns the maximum element of h; raises EmptyHeap when h is empty; complexity $ O(1) $

val remove : t -> t

remove h returns a new heap containing the elements of h, except the maximum of h; raises EmptyHeap when h is empty; complexity $ O(log(n)) $

val iter : (elt -> unit) -> t -> unit

usual iterators and combinators; elements are presented in arbitrary order

val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct