plebeia

Merkle Patricia tree implementation
Library plebeia
Module Plebeia . Internal . Gen
type 'a0 t = Random.State.t -> 'a
val return : 'a -> 'a t
val bind : 'a t -> ( 'a -> 'b t ) -> 'b t
val (>>=) : 'a t -> ( 'a -> 'b t ) -> 'b t
val map : ( 'a -> 'b ) -> 'a t -> 'b t
val (>>|) : 'a t -> ( 'a -> 'b ) -> 'b t
val (>>) : unit t -> 'b t -> 'b t
val mapM : ( 'a -> 'b t ) -> 'a list -> 'b list t
val mapM_ : ( 'a -> unit t ) -> 'a list -> unit t
val fold_leftM : ( 'a -> 'b -> 'a t ) -> 'a -> 'b list -> 'a t
val parseM : ( 'a -> 'b list -> ('a * 'b list) t ) -> 'a -> 'b list -> 'a t
module Op : sig ... end
module RS = Random.State
val int : int -> int t
val string : ( Random.State.t -> int ) -> ( Random.State.t -> char ) -> string t
val list : ( Random.State.t -> int ) -> ( Random.State.t -> 'a ) -> 'a0 list t
val char : char t
val bool : bool t
val segment : ( Random.State.t -> int ) -> Segment.t t
val choice : 'a t list -> 'a t
val shuffle : 'a list -> 'a0 list t
val leaf : Plebeia__Node.node t
val bud_none : Plebeia__Node.node t
val bud_some : int -> Plebeia__Node.node t
val internal : int -> Plebeia__Node.node t
val extender : int -> Plebeia__Node.node t
val root : int -> Plebeia__Node.node t