plebeia

Merkle Patricia tree implementation
Library plebeia
val traverse : ('a * [< `Exit | `Right of 'c | `Up of Segment.Segs.t * 'd Right ] as 'b * Segment.Segs.t * Plebeia__Cursor.cursor) -> ( 'e -> Segment.Segs.t -> Plebeia__Cursor.cursor -> ( [< `Continue | `Exit | `Up ] * 'f, Error.t ) result ) -> ( 'g * [> `Exit | `Up of Segment.Segs.t * 'h ] * Segment.Segs.t * Plebeia__Cursor.cursor, Error.t ) Result.t
val fold : init:'a -> Segment.Segs.t -> Plebeia__Cursor.cursor -> ( 'b -> Segment.Segs.t -> Plebeia__Cursor.cursor -> ( [< `Continue | `Exit | `Up ] * 'c, Error.t ) result ) -> ( 'd * Plebeia__Cursor.cursor, Error.t ) Result.t
val ls : Plebeia__Cursor.cursor -> ( (Plebeia__Segment.segment * Plebeia__Node.view) list * Plebeia__Cursor.cursor, Error.t ) Result.t
val ls_rec : Plebeia__Cursor.cursor -> ( (Plebeia__Segment.segment list * Plebeia__Node.node) list * Plebeia__Cursor.cursor, Error.t ) Result.t
module GenTraverse : sig ... end