plebeia
Merkle Patricia tree implementation
1024" x-on:close-sidebar="sidebar=window.innerWidth > 1024 && true">
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library
Module
Module type
Parameter
Class
Class type
Library plebeia
Obtain Graphviz dot file representation of the cursor
val validate_node :
Plebeia__Context.t ->
Plebeia__Node.node ->
( unit, string ) Result.t
Invariant checking of node
module Exn : sig ... end
module Format : sig ... end
module String : sig ... end
module Hashtbl : sig ... end
module List : sig ... end
module Open : sig ... end
Recommended to open this module to use the values without module paths
Recommended to open this module to use the values without module paths
val failwithf : ( 'a, unit, string, 'b ) format4 -> 'a
failwith with printf interface
val timed : ( unit -> 'a ) -> ( 'a, [> `Exn of exn ] ) result * float
module RS = Random.State
val random_string : RS.t -> int -> string
val random_short_segment : ?length:int -> Random.State.t -> Segment.segment
val random_segment : ?length:int -> Random.State.t -> Segment.segment
val random_choice : RS.t -> 'a list -> 'b
val shuffle : Random.State.t -> 'a list -> 'b list
val path_of_string : string -> Segment.segment
val must_fail : ( 'a, 'b ) result -> unit
val path : string -> Segment.segment
val value : string -> Value.t
val random_node : Random.State.t -> int -> Plebeia__Node.node
val all_children :
Plebeia__Context.t ->
Plebeia__Node.node ->
(Segment.segment * [> `Directory of Plebeia__Node.node | `File ]) list
val every_leaves :
Plebeia__Context.t ->
Plebeia__Node.node ->
Segment.t list list