package libzipperposition
Library for Zipperposition
Install
Dune Dependency
Authors
Maintainers
Sources
2.1.tar.gz
md5=e72de75e9f0f87da9e6e8c0a4d4c89f9
sha512=81becfc9badd686ab3692cd9312172aa4c4e3581b110e81770bb01e0ffbc1eb8495d0dd6d43b98f3d06e6b8c8a338174c13ebafb4e9849a3ddf89f9a3a72c287
doc/libzipperposition.induction/Libzipperposition_induction/Make/argument-1-E/StmQ/index.html
Module E.StmQ
module Stm = Stm
module WeightFun : sig ... end
val length : t -> int
Number of elements
val is_empty : t -> bool
check whether the queue is empty
Attempts to take a clause out of the queue. Guarded recursion: can't loop forever
Takes clauses from the queue in a fair manner. Unguarded recursion, may loop forever
Attempts to take as many clauses from the queue as there are streams in the queue. Calls take_first to do so and stops if its guard is reached
Attempts to take as many clauses from the queue as there are streams in the queue. Extract as many clauses as possible from first stream before moving to a new stream to find more clauses if necessary
val name : t -> string
Name of the implementation/role of the queue
Available Queues
Creates a priority queue that uses weight
to sort streams.
val default : unit -> t
Obtain the default queue
IO
val pp : t CCFormat.printer
val to_string : t -> string
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page