type key = Key.tval load : Store.t -> Store.address -> tval depth : t -> intval self_address : t -> Store.addressval overflow : t -> boolval will_overflow : t -> boolval underflow : t -> boolval find : t -> key -> Store.addresstype neighbour = {main : key * Store.address;neighbour : (key * Store.address) option;order : [ `Lower | `Higher ];}val add : t -> key -> Store.address -> unitval iter : t -> (key -> Store.address -> unit) -> unitval fold_left : ('a -> key -> Store.address -> 'a) -> 'a -> t -> 'aval length : t -> intlength t is the number of bindings in t
migrate kvs depth constructs the serialised representation of the node associated to kvs, the list of string representations for key,value bindings.
val reconstruct :
t ->
Btree__.Field_intf.kind ->
(key * Store.address) list ->
unitval pp : t Fmt.t