fabrikk.build-graph.core — org.clojars.joe-douglas/fabrikk 0.0.53

add-link clj/s

(add-link {:keys [primary] :as build-graph} link {:keys [uuid] :as entity})

assert-node clj/s

(assert-node {:keys [codex] :as _bg} {:keys [uuid] :as _entity})

associate clj/s

(associate {:keys [primary] :as build-graph}
           link
           {associated-primary :primary :as associated-build-graph})

ensure-node clj/s

(ensure-node {:keys [codex] :as build-graph} {:keys [uuid] :as entity})

entities-in-build-order clj/s

(entities-in-build-order {:keys [codex primary] :as build-graph})

entity clj/s

(entity build-graph id)

in-edges-with-links clj/s

(in-edges-with-links {:keys [labels] :as _bg} node)

init clj/s

(init)

(init entity)

link-entities clj/s

(link-entities build-graph
               entity-id
               [_label _associate :as link]
               other-entity-id)

merge-builds clj/s

(merge-builds {:keys [labels codex] :as primary} to-merge)

not-self-loop? clj/s

path clj/s

(path {:keys [codex labels primary] :as _build-graph} path)

Given a build graph and a path comprised of a sequence of labels. Starting at the primary node, traverse edges with each label in turn, and return the node at the end of the path, if it exists. Or nil otherwise

primary clj/s

(primary {:keys [primary] :as build-graph})

self-loop? clj/s

(self-loop? [src dest :as edge])

set-primary! clj/s

(set-primary! build-graph {:keys [uuid] :as entity})

update-entity clj/s

(update-entity build-graph id f args)

update-entity-value clj/s

(update-entity-value build-graph id f args)

update-primary clj/s

(update-primary {:keys [primary] :as build-graph} f args)

update-primary-value clj/s

(update-primary-value {:keys [primary] :as build-graph} f args)