Module Tree.Proof

type kinded_hash = [
  1. | `Contents of hash * metadata
  2. | `Node of hash
]
val kinded_hash_t : kinded_hash Irmin__.Type.t
type !'a inode = {
  1. length : int;
  2. proofs : (int * 'a) list;
}
val inode_t : 'a Irmin__.Type.t -> 'a inode Irmin__.Type.t
type !'a inode_extender = {
  1. length : int;
  2. segments : int list;
  3. proof : 'a;
}
val inode_extender_t : 'a Irmin__.Type.t -> 'a inode_extender Irmin__.Type.t
type tree =
  1. | Contents of contents * metadata
  2. | Blinded_contents of hash * metadata
  3. | Node of (step * tree) list
  4. | Blinded_node of hash
  5. | Inode of inode_tree inode
  6. | Extender of inode_tree inode_extender
and inode_tree =
  1. | Blinded_inode of hash
  2. | Inode_values of (step * tree) list
  3. | Inode_tree of inode_tree inode
  4. | Inode_extender of inode_tree inode_extender
val tree_t : tree Irmin__.Type.t
val inode_tree_t : inode_tree Irmin__.Type.t
type t
val t : t Irmin__.Type.t
val v : before:kinded_hash -> after:kinded_hash -> tree -> t
val before : t -> kinded_hash
val after : t -> kinded_hash
val state : t -> tree
val to_tree : t -> tree