Module Node.Val

type t = value
val t : t Irmin__.Type.t
type metadata = Metadata.t
val metadata_t : metadata Irmin__.Type.t
type contents_key = Contents.key
val contents_key_t : contents_key Irmin__.Type.t
type node_key = key
val node_key_t : node_key Irmin__.Type.t
type step = Path.step
val step_t : step Irmin__.Type.t
type value = [
  1. | `Contents of contents_key * metadata
  2. | `Node of node_key
]
val value_t : value Irmin__.Type.t
type hash = hash
val hash_t : hash Irmin__.Type.t
val of_list : (step * value) list -> t
val list : ?offset:int -> ?length:int -> ?cache:bool -> t -> (step * value) list
val of_seq : (step * value) Irmin__.Import.Seq.t -> t
val seq : ?offset:int -> ?length:int -> ?cache:bool -> t -> (step * value) Irmin__.Import.Seq.t
val empty : unit -> t
val is_empty : t -> bool
val length : t -> int
val hash_exn : ?force:bool -> t -> hash
val clear : t -> unit
val find : ?cache:bool -> t -> step -> value option
val add : t -> step -> value -> t
val remove : t -> step -> t
module Metadata : sig ... end
val with_handler : ((expected_depth:int -> node_key -> t option) -> expected_depth:int -> node_key -> t option) -> t -> t
val head : t -> [ `Inode of int * (int * hash) list | `Node of (step * value) list ]
val merge : contents:contents_key option Irmin__.Merge.t -> node:node_key option Irmin__.Merge.t -> t Irmin__.Merge.t
exception Dangling_hash of {
  1. context : string;
  2. hash : hash;
}