plebeia

Functional storage using Merkle Patricia tree
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library plebeia
Module Plebeia . Fs_impl . Make . Vc
type t = Vc.t
val create : ?hashcons:Hashcons.config -> ?node_cache:Index.t Node_cache.t -> ?lock:bool -> ?bytes_per_cell:int -> ?hash_func:[ `Blake2B | `Blake3 ] -> ?bytes_per_hash:int -> ?resize_step_bytes:int -> ?auto_flush_seconds:int -> string -> ( Vc.t, Error.t ) Result_lwt.t
val open_ : mode:Storage.mode -> ?hashcons:Hashcons.config -> ?node_cache:Index.t Node_cache.t -> ?bytes_per_cell:int -> ?hash_func:[ `Blake2B | `Blake3 ] -> ?bytes_per_hash:int -> ?resize_step_bytes:int -> ?auto_flush_seconds:int -> string -> ( Vc.t, Error.t ) Result_lwt.t
val close : Vc.t -> ( unit, Error.t ) Stdlib.result Lwt.t
val commit_db : Vc.t -> Commit_db.t
val context : Vc.t -> Context.t
val empty : Vc.t -> cursor
val of_value : Vc.t -> bytes -> cursor
val checkout : Vc.t -> Commit_hash.t -> cursor option Lwt.t
val checkout' : Vc.t -> Commit_hash.t -> (Commit.t * cursor) option Lwt.t
val compute_commit_hash : Vc.t -> parent:Commit_hash.t option -> cursor -> cursor * Commit_hash.t
val commit : ?allow_missing_parent:bool -> Vc.t -> parent:Commit_hash.t option -> hash_override:Commit_hash.t option -> cursor -> ( cursor * (Hash.Prefix.t * Commit.t), Error.t ) Result.t Lwt.t
val flush : Vc.t -> unit Lwt.t
val mem : Vc.t -> Commit_hash.t -> bool Lwt.t