~/jendhub

def graph

bolt@1.27.0.0 · src/rules/laws/law.bend:101

import bolt@1.27.0.0/src/rules/laws/law.bend as Law
import Base
import bolt@1.27.0.0/src/rules/digest.bend as Digest
import bolt@1.27.0.0/src/rules/imports.bend as Imports

101# the graph: the empty key first, leading to what the laws name, then the
102# items
103def graph(+ds: List<&2, Digest.Digest>) -> List<&2, Imports.Edge>:
104  Imports.Edge{"", keys(named(ds))} <> graph.items(ds)

Uses (6)

Used by (1)