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
(C : Contents.S0)
(N : Contents.S0)
(P : Path.S)
(M : Metadata.S) :
S
with type contents = C.t
and type node = N.t
and type step = P.step
and type metadata = M.tNode provides a simple node implementation, parameterized by the contents C, node N, 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 : Metadata.S)
(S : sig ... end) :
STORE
with type t = C.t * S.t
and type key = S.key
and type value = S.value
and module Path = P
and module Metadata = M
and module Key = S.Key
and module Val = S.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.