Module Context.Tree

val mem : Tezedge.tree -> string list -> bool Lwt.t
val mem_tree : Tezedge.tree -> string list -> bool Lwt.t
val find : Tezedge.tree -> string list -> bytes option Lwt.t
val find_tree : Tezedge.tree -> string list -> Tezedge.tree option Lwt.t
val list : Tezedge.tree -> ?offset:int -> ?length:int -> string list -> (string * Tezedge.tree) list Lwt.t
val length : Tezedge.tree -> string list -> int Lwt.t
val add : Tezedge.tree -> string list -> 'a -> Tezedge.tree Lwt.t
val add_tree : Tezedge.tree -> string list -> Tezedge.tree -> Tezedge.tree Lwt.t
val remove : Tezedge.tree -> string list -> Tezedge.tree Lwt.t
val fold : ?depth:[< `Eq of int | `Ge of int | `Gt of int | `Le of int | `Lt of int ] -> Tezedge.tree -> string list -> order:[< `Sorted | `Undefined ] -> init:'a -> f:(string list -> Tezedge.tree -> 'a -> 'a Lwt.t) -> 'a Lwt.t
val config : 'a -> 'b
val empty : t -> Tezedge.tree
val is_empty : Tezedge.tree -> bool
val kind : Tezedge.tree -> [> `Tree | `Value ]
val to_value : Tezedge.tree -> bytes option Lwt.t
val of_value : t -> bytes -> Tezedge.tree Lwt.t
val equal : Tezedge.tree -> Tezedge.tree -> bool
val clear : ?depth:'a -> 'b -> 'c
val pp : 'a -> 'b -> 'c