plebeia

Functional storage using Merkle Patricia tree
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library plebeia
Module Plebeia . Gen

3 Test

type 'a t = Stdlib.Random.State.t -> 'a
include Monad.S1 with type 'a t := 'a t
val return : 'a -> 'a t
val bind : 'a t -> ( 'a -> 'b t ) -> 'b t
val map : ( 'a -> 'b ) -> 'a t -> 'b t
val mapM : ( 'a -> 'b t ) -> 'a list -> 'b list t
val mapM_ : ( 'a -> unit t ) -> 'a list -> unit t
val iterM : ( 'a -> unit t ) -> 'a list -> unit t

alias of mapM_

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 Infix : sig ... end
module Syntax : sig ... end
module RS = Stdlib.Random.State
val int : int -> int t

0..n-1

val int_range : (int * int) -> int t

Inclusive

val char : char t

Including non ASCIIs

val alpha_numeric : char t

0-9A-Za-z

val bool : bool t
val string : int t -> char t -> string t
val list : int t -> 'a t -> 'a list t
val elements : 'a list -> 'a t
val nelements : int -> 'a list -> 'a list t

nelemennts n xs chooses n random elements from xs. The order is preserved. It fails when n > List.length xs.

val one_of : 'a t list -> 'a t

Randomly choose one of the generators

val shuffle : 'a list -> 'a list t
val shuffle_inplace : 'a array -> unit t
val value : Value.t t

Random value up to 64 bytes

val side : Segment.side t
val segment : int t -> Segment.t t

segment n is a generator of segments upto length n

val index : Index.t t