plebeia

Functional storage using Merkle Patricia tree
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library plebeia
type ('acc, 'data) visitor
type dir = [
| `Bud
| `Extender
| `Side of Segment.side
]
val prepare : 'acc -> 'data -> Cursor.t -> ( 'acc -> 'data -> Cursor.t -> ( Cursor.t * ('acc * ('data * dir) list option), Error.t ) Stdlib.result ) -> ( 'acc, 'data ) visitor
val step : ( 'acc, 'data ) visitor -> ( [ `Continue of ( 'acc, 'data ) visitor | `Finished of Cursor.t * 'acc ], Error.t ) Stdlib.result
val fold : 'acc -> 'data -> Cursor.t -> ( 'acc -> 'data -> Cursor.t -> ( Cursor.t * ('acc * ('data * dir) list option), Error.t ) Stdlib.result ) -> ( Cursor.t * 'acc, Error.t ) Stdlib.result
val ls : Cursor.t -> ( Cursor.t * (Segment.t * Node_type.t * Cursor.t) list, Error.t ) Stdlib.result

Note: If c points to a bud, then it returns itself, rather than returning its contents.

Cursors in the list do not carry the whole scan of ls.

val ls_rec : Cursor.t -> ( Cursor.t * (Segment.t list * Node_type.t * Cursor.t) list, Error.t ) Stdlib.result

Note: If c points to a bud, then it returns itself, rather than returning its contents.

Cursors in the list do not carry the whole scan of ls.