@layerzerolabs/dfs 0.0.20 → 0.0.21
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.turbo/turbo-build.log +6 -6
- package/.turbo/turbo-test.log +4 -4
- package/dist/index.cjs +1 -0
- package/dist/index.cjs.map +1 -1
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +1 -0
- package/dist/index.js.map +1 -1
- package/package.json +4 -4
- package/src/index.ts +1 -0
package/.turbo/turbo-build.log
CHANGED
|
@@ -10,9 +10,9 @@
|
|
|
10
10
|
[34mCLI[39m Cleaning output folder
|
|
11
11
|
[34mCJS[39m Build start
|
|
12
12
|
[34mESM[39m Build start
|
|
13
|
-
[32mCJS[39m [1mdist/index.cjs [22m[32m2.
|
|
14
|
-
[32mCJS[39m [1mdist/index.cjs.map [22m[32m8.
|
|
15
|
-
[32mCJS[39m ⚡️ Build success in
|
|
16
|
-
[32mESM[39m [1mdist/index.js [22m[32m2.
|
|
17
|
-
[32mESM[39m [1mdist/index.js.map [22m[32m8.
|
|
18
|
-
[32mESM[39m ⚡️ Build success in
|
|
13
|
+
[32mCJS[39m [1mdist/index.cjs [22m[32m2.78 KB[39m
|
|
14
|
+
[32mCJS[39m [1mdist/index.cjs.map [22m[32m8.97 KB[39m
|
|
15
|
+
[32mCJS[39m ⚡️ Build success in 86ms
|
|
16
|
+
[32mESM[39m [1mdist/index.js [22m[32m2.76 KB[39m
|
|
17
|
+
[32mESM[39m [1mdist/index.js.map [22m[32m8.96 KB[39m
|
|
18
|
+
[32mESM[39m ⚡️ Build success in 86ms
|
package/.turbo/turbo-test.log
CHANGED
|
@@ -5,11 +5,11 @@
|
|
|
5
5
|
|
|
6
6
|
[1m[46m RUN [49m[22m [36mv3.2.3 [39m[90m/home/runner/work/monorepo-internal/monorepo-internal/packages/framework/dfs[39m
|
|
7
7
|
|
|
8
|
-
[32m✓[39m test/dfs.test.ts [2m([22m[2m3 tests[22m[2m)[22m[33m
|
|
9
|
-
[33m[2m✓[22m[39m DI Depth-first-search[2m > [22mThe handlers for each of a node's dependencies should be completed before that node [33m
|
|
8
|
+
[32m✓[39m test/dfs.test.ts [2m([22m[2m3 tests[22m[2m)[22m[33m 306[2mms[22m[39m
|
|
9
|
+
[33m[2m✓[22m[39m DI Depth-first-search[2m > [22mThe handlers for each of a node's dependencies should be completed before that node [33m 302[2mms[22m[39m
|
|
10
10
|
|
|
11
11
|
[2m Test Files [22m [1m[32m1 passed[39m[22m[90m (1)[39m
|
|
12
12
|
[2m Tests [22m [1m[32m3 passed[39m[22m[90m (3)[39m
|
|
13
|
-
[2m Start at [22m
|
|
14
|
-
[2m Duration [22m
|
|
13
|
+
[2m Start at [22m 01:58:06
|
|
14
|
+
[2m Duration [22m 650ms[2m (transform 66ms, setup 0ms, collect 55ms, tests 306ms, environment 0ms, prepare 102ms)[22m
|
|
15
15
|
|
package/dist/index.cjs
CHANGED
|
@@ -32,6 +32,7 @@ var buildAncestorsByNodeName = /* @__PURE__ */ __name((node, prehandler) => {
|
|
|
32
32
|
dependentCountByNodeName.set(dependencyValue.name, inDegree - 1);
|
|
33
33
|
const childAncestry = ancestorsByNodeName.get(dependencyValue.name);
|
|
34
34
|
const nodeAncestry = ancestorsByNodeName.get(curNode.name);
|
|
35
|
+
childAncestry.add(curNode);
|
|
35
36
|
for (const ancestor of nodeAncestry) {
|
|
36
37
|
childAncestry.add(ancestor);
|
|
37
38
|
}
|
package/dist/index.cjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/index.ts"],"names":["buildAncestorsByNodeName","node","prehandler","ancestorsByNodeName","Map","dependentCountByNodeName","initializeMaps","set","name","Set","dependencyValue","Object","values","dependencies","inDegree","get","has","queue","length","curNode","shift","preHandledDependency","push","childAncestry","nodeAncestry","
|
|
1
|
+
{"version":3,"sources":["../src/index.ts"],"names":["buildAncestorsByNodeName","node","prehandler","ancestorsByNodeName","Map","dependentCountByNodeName","initializeMaps","set","name","Set","dependencyValue","Object","values","dependencies","inDegree","get","has","queue","length","curNode","shift","preHandledDependency","push","childAncestry","nodeAncestry","add","ancestor","dfs","handler","_returns","nodeResolverPromises","resolveNode","prehandledNode","childrenPromises","Promise","all","ancestry","regRes","key","value"],"mappings":";;;;;;AAgBA,IAAMA,wBAAAA,mBAA2B,MAAA,CAAA,CAACC,IAAAA,EAAsBC,UAAAA,KAAAA;AACpD,EAAA,MAAMC,mBAAAA,uBAA0BC,GAAAA,EAAAA;AAChC,EAAA,MAAMC,wBAAAA,uBAA+BD,GAAAA,EAAAA;AAKrC,EAAA,MAAME,cAAAA,2BAAkBL,KAAAA,KAAAA;AACpBE,IAAAA,mBAAAA,CAAoBI,IAAIN,KAAAA,CAAKO,IAAAA,sBAAUC,GAAAA,CAAI,EAAE,CAAA,CAAA;AAC7C,IAAA,KAAA,MAAWC,eAAAA,IAAmBC,MAAAA,CAAOC,MAAAA,CAAOX,KAAAA,CAAKY,YAAY,CAAA,EAAG;AAC5D,MAAA,MAAMC,QAAAA,GAAWT,wBAAAA,CAAyBU,GAAAA,CAAIL,eAAAA,CAAgBF,IAAI,CAAA,IAAK,CAAA;AACvEH,MAAAA,wBAAAA,CAAyBE,GAAAA,CAAIG,eAAAA,CAAgBF,IAAAA,EAAMM,QAAAA,GAAW,CAAA,CAAA;AAC9D,MAAA,IAAI,CAACX,mBAAAA,CAAoBa,GAAAA,CAAIN,eAAAA,CAAgBF,IAAI,CAAA,EAAG;AAChDF,QAAAA,cAAAA,CAAeI,eAAAA,CAAAA;AACnB,MAAA;AACJ,IAAA;EACJ,CAAA,EATuB,gBAAA,CAAA;AAUvBJ,EAAAA,cAAAA,CAAeL,IAAAA,CAAAA;AAMf,EAAA,IAAIgB,KAAAA,GAAQ;AAACf,IAAAA,UAAAA,CAAWD,IAAAA;;AACxB,EAAA,OAAOgB,KAAAA,CAAMC,SAAS,CAAA,EAAG;AACrB,IAAA,MAAMC,OAAAA,GAAUF,MAAMG,KAAAA,EAAK;AAG3B,IAAA,KAAA,MAAWV,eAAAA,IAAmBC,MAAAA,CAAOC,MAAAA,CAAOO,OAAAA,CAAQN,YAAY,CAAA,EAAG;AAC/D,MAAA,MAAMC,QAAAA,GAAWT,wBAAAA,CAAyBU,GAAAA,CAAIL,eAAAA,CAAgBF,IAAI,CAAA;AAElE,MAAA,IAAIM,aAAa,CAAA,EAAG;AAChB,QAAA,MAAMO,oBAAAA,GAAuBnB,WAAWQ,eAAAA,CAAAA;AACxCO,QAAAA,KAAAA,CAAMK,KAAKD,oBAAAA,CAAAA;AACf,MAAA;AAEAhB,MAAAA,wBAAAA,CAAyBE,GAAAA,CAAIG,eAAAA,CAAgBF,IAAAA,EAAMM,QAAAA,GAAW,CAAA,CAAA;AAG9D,MAAA,MAAMS,aAAAA,GAAgBpB,mBAAAA,CAAoBY,GAAAA,CAAIL,eAAAA,CAAgBF,IAAI,CAAA;AAClE,MAAA,MAAMgB,YAAAA,GAAerB,mBAAAA,CAAoBY,GAAAA,CAAII,OAAAA,CAAQX,IAAI,CAAA;AACzDe,MAAAA,aAAAA,CAAcE,IAAIN,OAAAA,CAAAA;AAClB,MAAA,KAAA,MAAWO,YAAYF,YAAAA,EAAc;AACjCD,QAAAA,aAAAA,CAAcE,IAAIC,QAAAA,CAAAA;AACtB,MAAA;AACJ,IAAA;AACJ,EAAA;AAEA,EAAA,OAAOvB,mBAAAA;AACX,CAAA,EAjDiC,0BAAA,CAAA;AAgE1B,IAAMwB,GAAAA,mBAAM,MAAA,CAAA,CACf1B,IAAAA,EACA2B,OAAAA,EACA1B,UAAAA,GAAqC,CAACD,KAAAA,KAASA,KAAAA,EAC/C4B,QAAAA,GAAwB,EAAC,KAAQ;AAEjC,EAAA,MAAM1B,mBAAAA,GAAsBH,wBAAAA,CAAyBC,IAAAA,EAAMC,UAAAA,CAAAA;AAG3D,EAAA,MAAM4B,oBAAAA,uBAA2B1B,GAAAA,EAAAA;AACjC,EAAA,MAAM2B,WAAAA,iCAAqB9B,KAAAA,KAAAA;AACvB,IAAA,MAAM+B,cAAAA,GAAiB9B,WAAWD,KAAAA,CAAAA;AAElC,IAAA,MAAMgC,mBAAmB,EAAA;AACzB,IAAA,KAAA,MAAWvB,eAAAA,IAAmBC,MAAAA,CAAOC,MAAAA,CAAOoB,cAAAA,CAAenB,YAAY,CAAA,EAAG;AAEtE,MAAA,IAAI,CAACiB,oBAAAA,CAAqBd,GAAAA,CAAIN,eAAAA,CAAgBF,IAAI,CAAA,EAAG;AACjDsB,QAAAA,oBAAAA,CAAqBvB,GAAAA,CAAIG,eAAAA,CAAgBF,IAAAA,EAAMuB,WAAAA,CAAYrB,eAAAA,CAAAA,CAAAA;AAC/D,MAAA;AACAuB,MAAAA,gBAAAA,CAAiBX,IAAAA,CAAKQ,oBAAAA,CAAqBf,GAAAA,CAAIL,eAAAA,CAAgBF,IAAI,CAAA,CAAA;AACvE,IAAA;AACA,IAAA,MAAM0B,OAAAA,CAAQC,IAAIF,gBAAAA,CAAAA;AAGlB,IAAA,MAAMG,QAAAA,GAAWjC,mBAAAA,CAAoBY,GAAAA,CAAIiB,cAAAA,CAAexB,IAAI,CAAA;AAC5D,IAAA,MAAM6B,MAAAA,GAAS,MAAMT,OAAAA,CAAQ3B,KAAAA,EAAM;AAAImC,MAAAA,GAAAA;AAAS,KAAA,CAAA;AAChD,IAAA,IAAIC,MAAAA,EAAQ;AACP,MAAA,CAACR,QAAAA,CAAiBQ,OAAOC,GAAG,CAAA,KAAM,EAAC,EAAGN,cAAAA,CAAexB,IAAI,CAAA,GAAI6B,MAAAA,CAAOE,KAAAA;AACzE,IAAA;EACJ,CAAA,EAnBoB,aAAA,CAAA;AAqBpB,EAAA,OAAO,YAAA;AACH,IAAA,MAAMR,YAAY9B,IAAAA,CAAAA;AAClB,IAAA,OAAO4B,QAAAA;AACX,EAAA,CAAA;AACJ,CAAA,EAnCmB,KAAA","file":"index.cjs","sourcesContent":["import type { DependencyNode } from '@layerzerolabs/dependency-graph';\n\n/**\n * A registrar is a simple interface for an object that provides the ability to traverse the dependency graph.\n * It is implicit in this definition that the registrar should also *register* values adhering to the schemata\n * of the graph.\n */\nexport interface Registrar<ReturnType> {\n traverseDependencies: (rootNode: DependencyNode) => Promise<ReturnType>;\n}\nexport type NodeHandlerFunction = (\n node: DependencyNode,\n ancestry: DependencyNode[],\n) => Promise<{ key: string; value: any }>;\nexport type NodePreHandlerFunction = (node: DependencyNode) => DependencyNode;\n\nconst buildAncestorsByNodeName = (node: DependencyNode, prehandler: NodePreHandlerFunction) => {\n const ancestorsByNodeName = new Map<string, Set<DependencyNode>>();\n const dependentCountByNodeName = new Map<string, number>();\n\n // If A depends on B and C, B depends on C, we initialize with:\n // ancestorsByNodeName: { A: Set([]), B: Set([]), C: Set([]) }\n // dependentsCountByNodeName: { B: 1, C: 2 }\n const initializeMaps = (node: DependencyNode) => {\n ancestorsByNodeName.set(node.name, new Set([]));\n for (const dependencyValue of Object.values(node.dependencies)) {\n const inDegree = dependentCountByNodeName.get(dependencyValue.name) || 0;\n dependentCountByNodeName.set(dependencyValue.name, inDegree + 1);\n if (!ancestorsByNodeName.has(dependencyValue.name)) {\n initializeMaps(dependencyValue);\n }\n }\n };\n initializeMaps(node);\n\n // topological sorted bfs exploration\n // induction by level, initial level has correct initial state, build level + 1\n // bfs is used to build ancestry correctly\n // this should actually be a queue, but its probably fine for now\n let queue = [prehandler(node)];\n while (queue.length > 0) {\n const curNode = queue.shift()!;\n\n // add the new processable dependencies to the queue, update their state.\n for (const dependencyValue of Object.values(curNode.dependencies)) {\n const inDegree = dependentCountByNodeName.get(dependencyValue.name)!;\n // We are the last edge missing in the graph for this dependency -> we can process it after us.\n if (inDegree === 1) {\n const preHandledDependency = prehandler(dependencyValue);\n queue.push(preHandledDependency);\n }\n // Reduce the in-degree of the dependency -> it basically means that this edge got removed from the graph.\n dependentCountByNodeName.set(dependencyValue.name, inDegree - 1);\n\n // add our ancestry to them, js sets maintain order of insertion, this means their ancestors are in distance order due to BFS properties.\n const childAncestry = ancestorsByNodeName.get(dependencyValue.name)!;\n const nodeAncestry = ancestorsByNodeName.get(curNode.name)!;\n childAncestry.add(curNode);\n for (const ancestor of nodeAncestry) {\n childAncestry.add(ancestor);\n }\n }\n }\n\n return ancestorsByNodeName;\n};\n\n/**\n * Performs a depth-first-search on a tree of dependency nodes, and returns a function\n * that will call the handler for each node in the tree, ordered s.t. the handler of N\n * will be called only after the handlers of dependencies(N) have been called.\n * The resolver function will only call the handler once for each unique definition node.\n * The resolver function returns an object whose keys are the keys defined\n * by each of the handlers, and whose values are objects whose keys are the names\n * of the nodes resolved and whose values are the values defined by the handlers.\n * @param node the root node of the tree\n * @param handler a function that accepts a node and registers it\n * @param prehandler a function that accepts a node and returns a node. will be use to pre-process the graph\n * @returns a resolver function\n */\nexport const dfs = <ReturnTypes>(\n node: DependencyNode,\n handler: NodeHandlerFunction,\n prehandler: NodePreHandlerFunction = (node) => node,\n _returns: ReturnTypes = {} as any,\n): (() => Promise<ReturnTypes>) => {\n const ancestorsByNodeName = buildAncestorsByNodeName(node, prehandler);\n\n // Maintains Map<node.name, Promise<void>> -> the promise to resolve the node, for all nodes.\n const nodeResolverPromises = new Map<string, Promise<void>>();\n const resolveNode = async (node: DependencyNode) => {\n const prehandledNode = prehandler(node);\n // first wait for all its children\n const childrenPromises = [];\n for (const dependencyValue of Object.values(prehandledNode.dependencies)) {\n // Grab the cached promise or create it, we want to have only 1 handler promise for each node.\n if (!nodeResolverPromises.has(dependencyValue.name)) {\n nodeResolverPromises.set(dependencyValue.name, resolveNode(dependencyValue));\n }\n childrenPromises.push(nodeResolverPromises.get(dependencyValue.name)!);\n }\n await Promise.all(childrenPromises);\n\n // Then, you can process yourself\n const ancestry = ancestorsByNodeName.get(prehandledNode.name)!;\n const regRes = await handler(node, [...ancestry]);\n if (regRes) {\n ((_returns as any)[regRes.key] ??= {})[prehandledNode.name] = regRes.value;\n }\n };\n\n return async () => {\n await resolveNode(node);\n return _returns;\n };\n};\n"]}
|
package/dist/index.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AAEtE;;;;GAIG;AACH,MAAM,WAAW,SAAS,CAAC,UAAU;IACjC,oBAAoB,EAAE,CAAC,QAAQ,EAAE,cAAc,KAAK,OAAO,CAAC,UAAU,CAAC,CAAC;CAC3E;AACD,MAAM,MAAM,mBAAmB,GAAG,CAC9B,IAAI,EAAE,cAAc,EACpB,QAAQ,EAAE,cAAc,EAAE,KACzB,OAAO,CAAC;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,GAAG,CAAA;CAAE,CAAC,CAAC;AAC1C,MAAM,MAAM,sBAAsB,GAAG,CAAC,IAAI,EAAE,cAAc,KAAK,cAAc,CAAC;
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AAEtE;;;;GAIG;AACH,MAAM,WAAW,SAAS,CAAC,UAAU;IACjC,oBAAoB,EAAE,CAAC,QAAQ,EAAE,cAAc,KAAK,OAAO,CAAC,UAAU,CAAC,CAAC;CAC3E;AACD,MAAM,MAAM,mBAAmB,GAAG,CAC9B,IAAI,EAAE,cAAc,EACpB,QAAQ,EAAE,cAAc,EAAE,KACzB,OAAO,CAAC;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,GAAG,CAAA;CAAE,CAAC,CAAC;AAC1C,MAAM,MAAM,sBAAsB,GAAG,CAAC,IAAI,EAAE,cAAc,KAAK,cAAc,CAAC;AAqD9E;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,GAAG,GAAI,WAAW,EAC3B,MAAM,cAAc,EACpB,SAAS,mBAAmB,EAC5B,aAAY,sBAAuC,EACnD,WAAU,WAAuB,KAClC,CAAC,MAAM,OAAO,CAAC,WAAW,CAAC,CA8B7B,CAAC"}
|
package/dist/index.js
CHANGED
|
@@ -30,6 +30,7 @@ var buildAncestorsByNodeName = /* @__PURE__ */ __name((node, prehandler) => {
|
|
|
30
30
|
dependentCountByNodeName.set(dependencyValue.name, inDegree - 1);
|
|
31
31
|
const childAncestry = ancestorsByNodeName.get(dependencyValue.name);
|
|
32
32
|
const nodeAncestry = ancestorsByNodeName.get(curNode.name);
|
|
33
|
+
childAncestry.add(curNode);
|
|
33
34
|
for (const ancestor of nodeAncestry) {
|
|
34
35
|
childAncestry.add(ancestor);
|
|
35
36
|
}
|
package/dist/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/index.ts"],"names":["buildAncestorsByNodeName","node","prehandler","ancestorsByNodeName","Map","dependentCountByNodeName","initializeMaps","set","name","Set","dependencyValue","Object","values","dependencies","inDegree","get","has","queue","length","curNode","shift","preHandledDependency","push","childAncestry","nodeAncestry","
|
|
1
|
+
{"version":3,"sources":["../src/index.ts"],"names":["buildAncestorsByNodeName","node","prehandler","ancestorsByNodeName","Map","dependentCountByNodeName","initializeMaps","set","name","Set","dependencyValue","Object","values","dependencies","inDegree","get","has","queue","length","curNode","shift","preHandledDependency","push","childAncestry","nodeAncestry","add","ancestor","dfs","handler","_returns","nodeResolverPromises","resolveNode","prehandledNode","childrenPromises","Promise","all","ancestry","regRes","key","value"],"mappings":";;;;AAgBA,IAAMA,wBAAAA,mBAA2B,MAAA,CAAA,CAACC,IAAAA,EAAsBC,UAAAA,KAAAA;AACpD,EAAA,MAAMC,mBAAAA,uBAA0BC,GAAAA,EAAAA;AAChC,EAAA,MAAMC,wBAAAA,uBAA+BD,GAAAA,EAAAA;AAKrC,EAAA,MAAME,cAAAA,2BAAkBL,KAAAA,KAAAA;AACpBE,IAAAA,mBAAAA,CAAoBI,IAAIN,KAAAA,CAAKO,IAAAA,sBAAUC,GAAAA,CAAI,EAAE,CAAA,CAAA;AAC7C,IAAA,KAAA,MAAWC,eAAAA,IAAmBC,MAAAA,CAAOC,MAAAA,CAAOX,KAAAA,CAAKY,YAAY,CAAA,EAAG;AAC5D,MAAA,MAAMC,QAAAA,GAAWT,wBAAAA,CAAyBU,GAAAA,CAAIL,eAAAA,CAAgBF,IAAI,CAAA,IAAK,CAAA;AACvEH,MAAAA,wBAAAA,CAAyBE,GAAAA,CAAIG,eAAAA,CAAgBF,IAAAA,EAAMM,QAAAA,GAAW,CAAA,CAAA;AAC9D,MAAA,IAAI,CAACX,mBAAAA,CAAoBa,GAAAA,CAAIN,eAAAA,CAAgBF,IAAI,CAAA,EAAG;AAChDF,QAAAA,cAAAA,CAAeI,eAAAA,CAAAA;AACnB,MAAA;AACJ,IAAA;EACJ,CAAA,EATuB,gBAAA,CAAA;AAUvBJ,EAAAA,cAAAA,CAAeL,IAAAA,CAAAA;AAMf,EAAA,IAAIgB,KAAAA,GAAQ;AAACf,IAAAA,UAAAA,CAAWD,IAAAA;;AACxB,EAAA,OAAOgB,KAAAA,CAAMC,SAAS,CAAA,EAAG;AACrB,IAAA,MAAMC,OAAAA,GAAUF,MAAMG,KAAAA,EAAK;AAG3B,IAAA,KAAA,MAAWV,eAAAA,IAAmBC,MAAAA,CAAOC,MAAAA,CAAOO,OAAAA,CAAQN,YAAY,CAAA,EAAG;AAC/D,MAAA,MAAMC,QAAAA,GAAWT,wBAAAA,CAAyBU,GAAAA,CAAIL,eAAAA,CAAgBF,IAAI,CAAA;AAElE,MAAA,IAAIM,aAAa,CAAA,EAAG;AAChB,QAAA,MAAMO,oBAAAA,GAAuBnB,WAAWQ,eAAAA,CAAAA;AACxCO,QAAAA,KAAAA,CAAMK,KAAKD,oBAAAA,CAAAA;AACf,MAAA;AAEAhB,MAAAA,wBAAAA,CAAyBE,GAAAA,CAAIG,eAAAA,CAAgBF,IAAAA,EAAMM,QAAAA,GAAW,CAAA,CAAA;AAG9D,MAAA,MAAMS,aAAAA,GAAgBpB,mBAAAA,CAAoBY,GAAAA,CAAIL,eAAAA,CAAgBF,IAAI,CAAA;AAClE,MAAA,MAAMgB,YAAAA,GAAerB,mBAAAA,CAAoBY,GAAAA,CAAII,OAAAA,CAAQX,IAAI,CAAA;AACzDe,MAAAA,aAAAA,CAAcE,IAAIN,OAAAA,CAAAA;AAClB,MAAA,KAAA,MAAWO,YAAYF,YAAAA,EAAc;AACjCD,QAAAA,aAAAA,CAAcE,IAAIC,QAAAA,CAAAA;AACtB,MAAA;AACJ,IAAA;AACJ,EAAA;AAEA,EAAA,OAAOvB,mBAAAA;AACX,CAAA,EAjDiC,0BAAA,CAAA;AAgE1B,IAAMwB,GAAAA,mBAAM,MAAA,CAAA,CACf1B,IAAAA,EACA2B,OAAAA,EACA1B,UAAAA,GAAqC,CAACD,KAAAA,KAASA,KAAAA,EAC/C4B,QAAAA,GAAwB,EAAC,KAAQ;AAEjC,EAAA,MAAM1B,mBAAAA,GAAsBH,wBAAAA,CAAyBC,IAAAA,EAAMC,UAAAA,CAAAA;AAG3D,EAAA,MAAM4B,oBAAAA,uBAA2B1B,GAAAA,EAAAA;AACjC,EAAA,MAAM2B,WAAAA,iCAAqB9B,KAAAA,KAAAA;AACvB,IAAA,MAAM+B,cAAAA,GAAiB9B,WAAWD,KAAAA,CAAAA;AAElC,IAAA,MAAMgC,mBAAmB,EAAA;AACzB,IAAA,KAAA,MAAWvB,eAAAA,IAAmBC,MAAAA,CAAOC,MAAAA,CAAOoB,cAAAA,CAAenB,YAAY,CAAA,EAAG;AAEtE,MAAA,IAAI,CAACiB,oBAAAA,CAAqBd,GAAAA,CAAIN,eAAAA,CAAgBF,IAAI,CAAA,EAAG;AACjDsB,QAAAA,oBAAAA,CAAqBvB,GAAAA,CAAIG,eAAAA,CAAgBF,IAAAA,EAAMuB,WAAAA,CAAYrB,eAAAA,CAAAA,CAAAA;AAC/D,MAAA;AACAuB,MAAAA,gBAAAA,CAAiBX,IAAAA,CAAKQ,oBAAAA,CAAqBf,GAAAA,CAAIL,eAAAA,CAAgBF,IAAI,CAAA,CAAA;AACvE,IAAA;AACA,IAAA,MAAM0B,OAAAA,CAAQC,IAAIF,gBAAAA,CAAAA;AAGlB,IAAA,MAAMG,QAAAA,GAAWjC,mBAAAA,CAAoBY,GAAAA,CAAIiB,cAAAA,CAAexB,IAAI,CAAA;AAC5D,IAAA,MAAM6B,MAAAA,GAAS,MAAMT,OAAAA,CAAQ3B,KAAAA,EAAM;AAAImC,MAAAA,GAAAA;AAAS,KAAA,CAAA;AAChD,IAAA,IAAIC,MAAAA,EAAQ;AACP,MAAA,CAACR,QAAAA,CAAiBQ,OAAOC,GAAG,CAAA,KAAM,EAAC,EAAGN,cAAAA,CAAexB,IAAI,CAAA,GAAI6B,MAAAA,CAAOE,KAAAA;AACzE,IAAA;EACJ,CAAA,EAnBoB,aAAA,CAAA;AAqBpB,EAAA,OAAO,YAAA;AACH,IAAA,MAAMR,YAAY9B,IAAAA,CAAAA;AAClB,IAAA,OAAO4B,QAAAA;AACX,EAAA,CAAA;AACJ,CAAA,EAnCmB,KAAA","file":"index.js","sourcesContent":["import type { DependencyNode } from '@layerzerolabs/dependency-graph';\n\n/**\n * A registrar is a simple interface for an object that provides the ability to traverse the dependency graph.\n * It is implicit in this definition that the registrar should also *register* values adhering to the schemata\n * of the graph.\n */\nexport interface Registrar<ReturnType> {\n traverseDependencies: (rootNode: DependencyNode) => Promise<ReturnType>;\n}\nexport type NodeHandlerFunction = (\n node: DependencyNode,\n ancestry: DependencyNode[],\n) => Promise<{ key: string; value: any }>;\nexport type NodePreHandlerFunction = (node: DependencyNode) => DependencyNode;\n\nconst buildAncestorsByNodeName = (node: DependencyNode, prehandler: NodePreHandlerFunction) => {\n const ancestorsByNodeName = new Map<string, Set<DependencyNode>>();\n const dependentCountByNodeName = new Map<string, number>();\n\n // If A depends on B and C, B depends on C, we initialize with:\n // ancestorsByNodeName: { A: Set([]), B: Set([]), C: Set([]) }\n // dependentsCountByNodeName: { B: 1, C: 2 }\n const initializeMaps = (node: DependencyNode) => {\n ancestorsByNodeName.set(node.name, new Set([]));\n for (const dependencyValue of Object.values(node.dependencies)) {\n const inDegree = dependentCountByNodeName.get(dependencyValue.name) || 0;\n dependentCountByNodeName.set(dependencyValue.name, inDegree + 1);\n if (!ancestorsByNodeName.has(dependencyValue.name)) {\n initializeMaps(dependencyValue);\n }\n }\n };\n initializeMaps(node);\n\n // topological sorted bfs exploration\n // induction by level, initial level has correct initial state, build level + 1\n // bfs is used to build ancestry correctly\n // this should actually be a queue, but its probably fine for now\n let queue = [prehandler(node)];\n while (queue.length > 0) {\n const curNode = queue.shift()!;\n\n // add the new processable dependencies to the queue, update their state.\n for (const dependencyValue of Object.values(curNode.dependencies)) {\n const inDegree = dependentCountByNodeName.get(dependencyValue.name)!;\n // We are the last edge missing in the graph for this dependency -> we can process it after us.\n if (inDegree === 1) {\n const preHandledDependency = prehandler(dependencyValue);\n queue.push(preHandledDependency);\n }\n // Reduce the in-degree of the dependency -> it basically means that this edge got removed from the graph.\n dependentCountByNodeName.set(dependencyValue.name, inDegree - 1);\n\n // add our ancestry to them, js sets maintain order of insertion, this means their ancestors are in distance order due to BFS properties.\n const childAncestry = ancestorsByNodeName.get(dependencyValue.name)!;\n const nodeAncestry = ancestorsByNodeName.get(curNode.name)!;\n childAncestry.add(curNode);\n for (const ancestor of nodeAncestry) {\n childAncestry.add(ancestor);\n }\n }\n }\n\n return ancestorsByNodeName;\n};\n\n/**\n * Performs a depth-first-search on a tree of dependency nodes, and returns a function\n * that will call the handler for each node in the tree, ordered s.t. the handler of N\n * will be called only after the handlers of dependencies(N) have been called.\n * The resolver function will only call the handler once for each unique definition node.\n * The resolver function returns an object whose keys are the keys defined\n * by each of the handlers, and whose values are objects whose keys are the names\n * of the nodes resolved and whose values are the values defined by the handlers.\n * @param node the root node of the tree\n * @param handler a function that accepts a node and registers it\n * @param prehandler a function that accepts a node and returns a node. will be use to pre-process the graph\n * @returns a resolver function\n */\nexport const dfs = <ReturnTypes>(\n node: DependencyNode,\n handler: NodeHandlerFunction,\n prehandler: NodePreHandlerFunction = (node) => node,\n _returns: ReturnTypes = {} as any,\n): (() => Promise<ReturnTypes>) => {\n const ancestorsByNodeName = buildAncestorsByNodeName(node, prehandler);\n\n // Maintains Map<node.name, Promise<void>> -> the promise to resolve the node, for all nodes.\n const nodeResolverPromises = new Map<string, Promise<void>>();\n const resolveNode = async (node: DependencyNode) => {\n const prehandledNode = prehandler(node);\n // first wait for all its children\n const childrenPromises = [];\n for (const dependencyValue of Object.values(prehandledNode.dependencies)) {\n // Grab the cached promise or create it, we want to have only 1 handler promise for each node.\n if (!nodeResolverPromises.has(dependencyValue.name)) {\n nodeResolverPromises.set(dependencyValue.name, resolveNode(dependencyValue));\n }\n childrenPromises.push(nodeResolverPromises.get(dependencyValue.name)!);\n }\n await Promise.all(childrenPromises);\n\n // Then, you can process yourself\n const ancestry = ancestorsByNodeName.get(prehandledNode.name)!;\n const regRes = await handler(node, [...ancestry]);\n if (regRes) {\n ((_returns as any)[regRes.key] ??= {})[prehandledNode.name] = regRes.value;\n }\n };\n\n return async () => {\n await resolveNode(node);\n return _returns;\n };\n};\n"]}
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@layerzerolabs/dfs",
|
|
3
|
-
"version": "0.0.
|
|
3
|
+
"version": "0.0.21",
|
|
4
4
|
"private": false,
|
|
5
5
|
"license": "MIT",
|
|
6
6
|
"type": "module",
|
|
@@ -14,13 +14,13 @@
|
|
|
14
14
|
"module": "./dist/index.js",
|
|
15
15
|
"types": "./dist/index.d.ts",
|
|
16
16
|
"dependencies": {
|
|
17
|
-
"@layerzerolabs/dependency-graph": "0.0.
|
|
17
|
+
"@layerzerolabs/dependency-graph": "0.0.21"
|
|
18
18
|
},
|
|
19
19
|
"devDependencies": {
|
|
20
20
|
"tsup": "^8.4.0",
|
|
21
21
|
"vitest": "^3.2.3",
|
|
22
|
-
"@layerzerolabs/
|
|
23
|
-
"@layerzerolabs/
|
|
22
|
+
"@layerzerolabs/tsup-configuration": "0.0.21",
|
|
23
|
+
"@layerzerolabs/typescript-configuration": "0.0.21"
|
|
24
24
|
},
|
|
25
25
|
"publishConfig": {
|
|
26
26
|
"access": "restricted",
|
package/src/index.ts
CHANGED
|
@@ -55,6 +55,7 @@ const buildAncestorsByNodeName = (node: DependencyNode, prehandler: NodePreHandl
|
|
|
55
55
|
// add our ancestry to them, js sets maintain order of insertion, this means their ancestors are in distance order due to BFS properties.
|
|
56
56
|
const childAncestry = ancestorsByNodeName.get(dependencyValue.name)!;
|
|
57
57
|
const nodeAncestry = ancestorsByNodeName.get(curNode.name)!;
|
|
58
|
+
childAncestry.add(curNode);
|
|
58
59
|
for (const ancestor of nodeAncestry) {
|
|
59
60
|
childAncestry.add(ancestor);
|
|
60
61
|
}
|