Answer architecture round 1: one inline load-and-bind, go generate for the index, sorted unloaded names, item 79 named in the decision, and the audit's other findings filed
This commit is contained in:
+2
-2
@@ -144,8 +144,8 @@ func paths(n node) []string {
|
||||
out = append(out, join(name, p))
|
||||
}
|
||||
}
|
||||
for name, e := range n.unloaded {
|
||||
for _, p := range e.paths {
|
||||
for _, name := range sortedEntries(n.unloaded) {
|
||||
for _, p := range n.unloaded[name].paths {
|
||||
out = append(out, join(name, p))
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user