package irmin
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 ... end
module Make
(C : Tc.S0)
(N : Tc.S0)
(P : Path.S) :
S with type contents = C.t and type node = N.t and type step = P.step
Node
provides a simple node implementation, parameterized by the contents C
, node N
and paths P
.
module type STORE = sig ... end
STORE
specifies the signature for node stores.
module type GRAPH = sig ... end
Graph
specifies the signature for node graphs. A node graph is a deterministic DAG, labeled by steps.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>