plebeia
Merkle Patricia tree implementation
1024" x-on:close-sidebar="sidebar=window.innerWidth > 1024 && true">
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library
Module
Module type
Parameter
Class
Class type
type 'a0 t = Random.State.t -> 'a
val return : 'a -> '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 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