val list :
tree ->
?offset:int ->
?length:int ->
key ->
(string * tree) list Lwt.tval fold :
?depth:[ `Eq of int | `Ge of int | `Gt of int | `Le of int | `Lt of int ] ->
tree ->
key ->
init:'a ->
f:(key -> tree -> 'a -> 'a Lwt.t) ->
'a Lwt.tval is_empty : tree -> boolval kind : tree -> [ `Tree | `Value ]val clear : ?depth:int -> tree -> unit