Module Context_binary.Tree

val mem : tree -> key -> bool Lwt.t
val mem_tree : tree -> key -> bool Lwt.t
val find : tree -> key -> value option Lwt.t
val find_tree : tree -> key -> tree option Lwt.t
val list : tree -> ?offset:int -> ?length:int -> key -> (string * tree) list Lwt.t
val length : tree -> key -> int Lwt.t
val add : tree -> key -> value -> tree Lwt.t
val add_tree : tree -> key -> tree -> tree Lwt.t
val remove : tree -> key -> tree Lwt.t
val fold : ?depth:[ `Eq of int | `Le of int | `Lt of int | `Ge of int | `Gt of int ] -> tree -> key -> order:[ `Sorted | `Undefined ] -> init:'a -> f:(key -> tree -> 'a -> 'a Lwt.t) -> 'a Lwt.t
val empty : t -> tree
val is_empty : tree -> bool
val kind : tree -> [ `Value | `Tree ]
val to_value : tree -> value option Lwt.t
val of_value : t -> value -> tree Lwt.t
val equal : tree -> tree -> bool
val clear : ?depth:int -> tree -> unit
val pp : Stdlib.Format.formatter -> tree -> unit
type raw = [
  1. | `Tree of raw Mavryk_base.TzPervasives.String.Map.t
  2. | `Value of bytes
]
val raw_encoding : raw Mavryk_base.TzPervasives.Data_encoding.t
val to_raw : tree -> raw Lwt.t
val of_raw : raw -> tree
val unshallow : tree -> tree Lwt.t
type repo
val make_repo : unit -> repo Lwt.t
val is_shallow : tree -> bool
val kinded_key : tree -> kinded_key option