Node provides functions to describe the graph-like structured values.
The node blocks form a labeled directed acyclic graph, labeled by steps: a list of steps defines a unique path from one node to an other.
Each node can point to user-defined contents values.
module type S = sig ... endmodule Make
(K : Type.S)
(P : sig ... end)
(M : sig ... end) :
S with type hash = K.t and type step = P.step and type metadata = M.tMake provides a simple node implementation, parameterized by the contents and notes keys K, paths P and metadata M.
module type STORE = sig ... endSTORE specifies the signature for node stores.
module Store
(C : Contents.STORE)
(P : Path.S)
(M : sig ... end)
(N : sig ... end) :
STORE
with type 'a t = 'a C.t * 'a N.t
and type key = N.key
and type value = N.value
and module Path = P
and module Metadata = M
and type Key.t = N.key
and module Val = N.ValStore creates node stores.
module type GRAPH = sig ... endGraph specifies the signature for node graphs. A node graph is a deterministic DAG, labeled by steps.
module No_metadata : sig ... end