plebeia

Functional storage using Merkle Patricia tree
package plebeia
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library plebeia.test_utils
Module Test_utils . Fs_simulation . WithSimulation

Parameters

Signature

module F : sig ... end
module S : sig ... end
module Path = F.Path
type name = Name.t
type cursor = F.cursor * S.cursor
type raw_cursor = cursor
type view = F.view * S.view
type hash = F.hash
val make : 'a -> 'b -> 'c
type 'a op_lwt = cursor -> ( cursor * 'a, Plebeia.Error.t ) Stdlib.result Lwt.t
type error = F.error =
| Is_file of string * Path.t
| Is_directory of string * Path.t
| No_such_file_or_directory of string * Path.t
| File_or_directory_exists of string * Path.t
| Path_decode_failure of Plebeia.Segment.t
| Other of string * string
type Plebeia.Error.t +=
| FS_error of error
val error_fs : error -> ( 'a, Plebeia.Error.t ) Stdlib.result
val handle_conflict : string -> (( 'a, Plebeia.Error.t ) Stdlib.result * ( 'b, Plebeia.Error.t ) Stdlib.result) -> ( 'c, Plebeia.Error.t ) Stdlib.result
module Op : sig ... end
module Op_lwt : sig ... end
val use_f : ( 'a -> ( 'b * 'c, 'd ) Stdlib.result ) -> ('e * 'f) -> ( ('g * 'h) * 'i, 'j ) Stdlib.result
val write_top_cursor : (F.cursor * 'a) -> ( (F.cursor * 'a) * (Plebeia.Index.t * Plebeia.Hash.Prefix.t), Plebeia.Error.t ) Stdlib.result
val compute_hash : (F.cursor * 'a) -> ( (F.cursor * 'a) * Plebeia.Hash.Prefix.t, 'b ) Stdlib.result
val may_forget : (F.cursor * 'a) -> ( (F.cursor * 'a) * unit, 'b ) Stdlib.result