Bidirectional graphs of dependencies and dependent objects.
Bidirectional graphs of dependencies and dependent objects.
(depend graph x)
(depend graph x dep)
(depend graph x dep & more)
Adds to the dependency graph that x depends on deps. Forbids circular and self-referential dependencies.
Adds to the dependency graph that x depends on deps. Forbids circular and self-referential dependencies.
(dependencies graph x)
Returns the set of all things x depends on, directly or transitively.
Returns the set of all things x depends on, directly or transitively.
(dependent graph x y)
True if y is a dependent of x.
True if y is a dependent of x.
(dependents graph x)
Returns the set of all things which depend upon x, directly or transitively.
Returns the set of all things which depend upon x, directly or transitively.
(depends? graph x y)
True if x is directly or transitively dependent on y.
True if x is directly or transitively dependent on y.
(graph)
Returns a new, empty, dependency graph.
Returns a new, empty, dependency graph.
(remove-all graph)
(remove-all graph x)
(remove-all graph x & more)
Removes all references to x in the dependency graph.
Removes all references to x in the dependency graph.
(remove-key graph)
(remove-key graph x)
(remove-key graph x & more)
Removes the key x from the dependency graph without removing x as a depedency of other keys.
Removes the key x from the dependency graph without removing x as a depedency of other keys.
(seq-union)
(seq-union s1)
(seq-union s1 s2)
(seq-union s1 s2 & sets)
A union that preserves order.
A union that preserves order.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close