You can search for identifiers within the package.
in-package search v0.2.0
why3find
why3find.utils
Fibers.Queue
Iterable Queues.
This data structure is very similar to Queue from the standard library, but offers efficient filtering.
Queue
It is designed for internal use, although it might be usefull for other purposes.
type 'a t
val create : unit -> 'a t
val length : 'a t -> int
val pop : 'a t -> 'a
val push : 'a t -> 'a -> unit
val iter : ('a -> unit) -> 'a t -> unit
val flush : ('a -> unit) -> 'a t -> unit
val filter : ('a -> bool) -> 'a t -> unit
val elements : 'a t -> 'a list
val clear : 'a t -> unit