plebeia

Functional storage using Merkle Patricia tree
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library plebeia.test_utils
type 'a0 t = cursor -> ( cursor * 'a, Plebeia.Error.t ) Stdlib.result Lwt.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
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
val lift : 'a Op.t -> 'a t
val ls : F.Path.t -> (F.cursor * S.cursor) -> ( (F.cursor * S.cursor) * (F.Name.t * (F.cursor * S.cursor)) list, Plebeia.Error.t ) Stdlib.result Lwt.t
val fold : 'a -> F.Path.t -> (( 'b -> F.Path.t -> F.cursor -> ( [ `Continue | `Exit | `Up ] * 'b, Plebeia.Error.t ) Stdlib.result Lwt.t ) * ( 'c -> S.Path.t -> S.cursor -> ( [ `Continue | `Exit | `Up ] * 'c, Plebeia.Error.t ) Stdlib.result Lwt.t )) -> 'd op_lwt
val fold' : ?depth:[< `Eq of int | `Ge of int | `Gt of int | `Le of int | `Lt of int ] -> 'a -> F.Path.t -> (( 'b -> F.Path.t -> F.cursor -> ( 'b, Plebeia.Error.t ) Stdlib.result Lwt.t ) * ( S.Path.t -> S.cursor -> 'c -> ( 'c, Plebeia.Error.t ) Stdlib.result Lwt.t )) -> ('d * 'e) op_lwt