package alt-ergo-lib
The Alt-Ergo SMT prover library
Install
Dune Dependency
alt-ergo.ocamlpro.com
Readme
LicenseRef-OCamlPro-Non-Commercial-Purpose-License-Version-1 License
Edit opam file
Versions (15)
Authors
Maintainers
Sources
2.4.2.tar.gz
md5=c47327ae132c860890c820bfd5d49d51
sha512=61ae181ccd60a49f833ea79bbd5184a46f8eef24e7fe1169b15e905ed86584bdbe993ef86c203d5bfc3d79961024f96af0e4e623dc15479aa9538648291c9a75
doc/alt-ergo-lib/AltErgoLib/Iheap/index.html
Module AltErgoLib.Iheap
Integer heaps
This modules define priority heaps over integers.
Integer heaps
val init : int -> t
Create a heap with the given initial size.
val in_heap : t -> int -> bool
Heap membership function.
val decrease : (int -> int -> bool) -> t -> int -> unit
Decrease activity of the given integer. TODO: document the comparison function !
val increase : (int -> int -> bool) -> t -> int -> unit
Increase activity of the given integer. TODO: document the comparison function !
val size : t -> int
Returns the current size of the heap.
val is_empty : t -> bool
Is the heap empty ?
val insert : (int -> int -> bool) -> t -> int -> unit
Inset a new element in the heap. TODO: document comparison function.
val grow_to_by_double : t -> int -> unit
Grow the size of the heap by multiplying it by 2 until it is at least the size specified.
val remove_min : (int -> int -> bool) -> t -> int
Remove the minimum element from the heap and return it.
val filter : t -> (int -> bool) -> (int -> int -> bool) -> unit
Filter elements in the heap. TODO: document comparison function !
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page