plebeia

Functional storage using Merkle Patricia tree
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library plebeia
val write_top_cursor : cursor -> ( cursor * Index.t * Hash.Prefix.t, Error.t ) Stdlib.result

Write the node pointed by the cursor to the storage, and returns the updated cursor with the index and the hash of the stored node.

Note that this function does not sync the storage nor write Commit.t. Use one of *.commit functions to make it persistent.

val read_fully : reset_index:bool -> cursor -> cursor

Recursively load the node pointed by the cursor.

if reset_index, all the indices are reset to Not_Indexed.

module Internal : sig ... end