crinklywrappr.dependency
Bidirectional graphs of dependencies and dependent objects.
Bidirectional graphs of dependencies and dependent objects.
DependencyGraphclj/sprotocol
immediate-dependenciesclj/s
(immediate-dependencies graph node)Returns the set of immediate dependencies of node.
Returns the set of immediate dependencies of node.
immediate-dependentsclj/s
(immediate-dependents graph node)Returns the set of immediate dependents of node.
Returns the set of immediate dependents of node.
nodesclj/s
(nodes graph)Returns the set of all nodes in graph.
Returns the set of all nodes in graph.
transitive-dependenciesclj/s
(transitive-dependencies graph node)Returns the set of all things which node depends on, directly or transitively.
Returns the set of all things which node depends on, directly or transitively.
transitive-dependencies-setclj/s
(transitive-dependencies-set graph node-set)Returns the set of all things which any node in node-set depends on, directly or transitively.
Returns the set of all things which any node in node-set depends on, directly or transitively.
transitive-dependentsclj/s
(transitive-dependents graph node)Returns the set of all things which depend upon node, directly or transitively.
Returns the set of all things which depend upon node, directly or transitively.
transitive-dependents-setclj/s
(transitive-dependents-set graph node-set)Returns the set of all things which depend upon any node in node-set, directly or transitively.
Returns the set of all things which depend upon any node in node-set, directly or transitively.
DependencyGraphUpdateclj/sprotocol
dependclj/s
(depend graph node dep)Returns a new graph with a dependency from node to dep ("node depends on dep"). Forbids circular dependencies.
Returns a new graph with a dependency from node to dep ("node depends
on dep"). Forbids circular dependencies.remove-allclj/s
(remove-all graph node)Returns a new dependency graph with all references to node removed.
Returns a new dependency graph with all references to node removed.
remove-edgeclj/s
(remove-edge graph node dep)Returns a new graph with the dependency from node to dep removed.
Returns a new graph with the dependency from node to dep removed.
remove-nodeclj/s
(remove-node graph node)Removes the node from the dependency graph without removing it as a dependency of other nodes. That is, removes all outgoing edges from node.
Removes the node from the dependency graph without removing it as a dependency of other nodes. That is, removes all outgoing edges from node.
dependent?clj/s
(dependent? graph x y)True if y is a dependent of x.
True if y is a dependent of x.
depends?clj/s
(depends? graph x y)True if x is directly or transitively dependent on y.
True if x is directly or transitively dependent on y.
graphclj/s
(graph)Returns a new, empty, dependency graph.
Returns a new, empty, dependency graph.
MapDependencyGraphclj/s
set-conjclj/s
topo-comparatorclj/s
(topo-comparator graph)(topo-comparator comp graph)Returns a comparator fn which produces a topological sort based on the dependencies in graph. Nodes not present in the graph will sort after nodes in the graph. Takes an optional secondary comparator to provide secondary sorting when the order of nodes is ambiguous.
Returns a comparator fn which produces a topological sort based on the dependencies in graph. Nodes not present in the graph will sort after nodes in the graph. Takes an optional secondary comparator to provide secondary sorting when the order of nodes is ambiguous.
topo-sortclj/s
(topo-sort graph)(topo-sort comp graph)Returns a topologically-sorted list of nodes in graph. Takes an optional comparator to provide secondary sorting when the order of nodes is ambiguous.
Returns a topologically-sorted list of nodes in graph. Takes an optional comparator to provide secondary sorting when the order of nodes is ambiguous.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close