bap-primus-greedy-scheduler

Evaluates all machines in the DFS order
Library primus_greedy_scheduler_plugin
Parameter #1 Primus_greedy_main . Greedy . Machine . Collection . Delay . T
include Monads.Std.Monad.Collection.Basic
type 'a t

x t a container that hold values of type x

val return : 'a -> 'a t

return x creates a singleton container holding x

include Monads.Std.Monad.Plus.S with type 'a t := 'a t
val zero : unit -> 'a t

zero () constructs a zero element

val plus : 'a t -> 'a t -> 'a t

plus x y an associative operation.

val fold : 'a t -> init:'s -> f:( 's -> 'a -> ( 's -> 'r ) -> 'r ) -> ( 's -> 'r ) -> 'r

fold xs ~init:s ~f a delayed fold implementation. It is the same as a regular fold except that function f accepts an extra continuation argument, and the fold expression returns a continuation.