@rushstack/operation-graph 0.2.37 → 0.2.39
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/CHANGELOG.json +27 -0
- package/CHANGELOG.md +11 -1
- package/dist/tsdoc-metadata.json +1 -1
- package/lib/IOperationRunner.d.ts +0 -1
- package/lib/IOperationRunner.d.ts.map +1 -1
- package/lib/OperationExecutionManager.d.ts +0 -1
- package/lib/OperationExecutionManager.d.ts.map +1 -1
- package/lib/WatchLoop.d.ts +0 -1
- package/lib/WatchLoop.d.ts.map +1 -1
- package/lib/WorkQueue.d.ts +0 -1
- package/lib/WorkQueue.d.ts.map +1 -1
- package/lib/calculateCriticalPath.js +3 -4
- package/lib/calculateCriticalPath.js.map +1 -1
- package/lib/index.d.ts +1 -0
- package/lib/index.d.ts.map +1 -1
- package/lib/index.js.map +1 -1
- package/lib/protocol.types.d.ts +0 -2
- package/lib/protocol.types.d.ts.map +1 -1
- package/package.json +6 -6
package/CHANGELOG.json
CHANGED
|
@@ -1,6 +1,33 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@rushstack/operation-graph",
|
|
3
3
|
"entries": [
|
|
4
|
+
{
|
|
5
|
+
"version": "0.2.39",
|
|
6
|
+
"tag": "@rushstack/operation-graph_v0.2.39",
|
|
7
|
+
"date": "Tue, 11 Mar 2025 02:12:33 GMT",
|
|
8
|
+
"comments": {
|
|
9
|
+
"dependency": [
|
|
10
|
+
{
|
|
11
|
+
"comment": "Updating dependency \"@rushstack/node-core-library\" to `5.12.0`"
|
|
12
|
+
},
|
|
13
|
+
{
|
|
14
|
+
"comment": "Updating dependency \"@rushstack/terminal\" to `0.15.1`"
|
|
15
|
+
}
|
|
16
|
+
]
|
|
17
|
+
}
|
|
18
|
+
},
|
|
19
|
+
{
|
|
20
|
+
"version": "0.2.38",
|
|
21
|
+
"tag": "@rushstack/operation-graph_v0.2.38",
|
|
22
|
+
"date": "Wed, 12 Feb 2025 01:10:52 GMT",
|
|
23
|
+
"comments": {
|
|
24
|
+
"dependency": [
|
|
25
|
+
{
|
|
26
|
+
"comment": "Updating dependency \"@rushstack/terminal\" to `0.15.0`"
|
|
27
|
+
}
|
|
28
|
+
]
|
|
29
|
+
}
|
|
30
|
+
},
|
|
4
31
|
{
|
|
5
32
|
"version": "0.2.37",
|
|
6
33
|
"tag": "@rushstack/operation-graph_v0.2.37",
|
package/CHANGELOG.md
CHANGED
|
@@ -1,6 +1,16 @@
|
|
|
1
1
|
# Change Log - @rushstack/operation-graph
|
|
2
2
|
|
|
3
|
-
This log was last generated on
|
|
3
|
+
This log was last generated on Tue, 11 Mar 2025 02:12:33 GMT and should not be manually modified.
|
|
4
|
+
|
|
5
|
+
## 0.2.39
|
|
6
|
+
Tue, 11 Mar 2025 02:12:33 GMT
|
|
7
|
+
|
|
8
|
+
_Version update only_
|
|
9
|
+
|
|
10
|
+
## 0.2.38
|
|
11
|
+
Wed, 12 Feb 2025 01:10:52 GMT
|
|
12
|
+
|
|
13
|
+
_Version update only_
|
|
4
14
|
|
|
5
15
|
## 0.2.37
|
|
6
16
|
Thu, 30 Jan 2025 01:11:42 GMT
|
package/dist/tsdoc-metadata.json
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"IOperationRunner.d.ts","sourceRoot":"","sources":["../src/IOperationRunner.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"IOperationRunner.d.ts","sourceRoot":"","sources":["../src/IOperationRunner.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAEvD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE7C;;;;GAIG;AACH,MAAM,WAAW,uBAAuB;IACtC;;;OAGG;IACH,WAAW,EAAE,WAAW,CAAC;IAEzB;;OAEG;IACH,UAAU,EAAE,OAAO,CAAC;IAEpB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,IAAI,CAAC;CACzB;AAED;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B;;OAEG;IACH,MAAM,EAAE,eAAe,CAAC;IACxB;;OAEG;IACH,UAAU,EAAE,OAAO,CAAC;IACpB;;OAEG;IACH,KAAK,EAAE,cAAc,GAAG,SAAS,CAAC;IAClC;;OAEG;IACH,SAAS,EAAE,SAAS,CAAC;CACtB;AAED;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,eAAe,CAAC,GAAG,SAAS,CAAC;IACtD;;OAEG;IACH,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,eAAe,CAAC,GAAG,SAAS,CAAC;CAC3D;AAED;;;;;;GAMG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;OAEG;IACH,MAAM,EAAE,OAAO,CAAC;IAEhB;;OAEG;IACH,YAAY,CAAC,OAAO,EAAE,uBAAuB,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;CAC1E"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"OperationExecutionManager.d.ts","sourceRoot":"","sources":["../src/OperationExecutionManager.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"OperationExecutionManager.d.ts","sourceRoot":"","sources":["../src/OperationExecutionManager.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAGrD,OAAO,KAAK,EAA4B,SAAS,EAAE,MAAM,aAAa,CAAC;AAEvE,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAIpD;;;;GAIG;AACH,MAAM,WAAW,0BAA0B;IACzC,WAAW,EAAE,WAAW,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,SAAS,CAAC;IAEpB,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;CAC3C;AAED;;;;;;;GAOG;AACH,qBAAa,yBAAyB;IACpC;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAc;IAC1C;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAoC;IACvE;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,sBAAsB,CAAS;gBAE7B,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC;IAqCrD;;;OAGG;IACU,YAAY,CAAC,gBAAgB,EAAE,0BAA0B,GAAG,OAAO,CAAC,eAAe,CAAC;CAqHlG"}
|
package/lib/WatchLoop.d.ts
CHANGED
package/lib/WatchLoop.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"WatchLoop.d.ts","sourceRoot":"","sources":["../src/WatchLoop.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"WatchLoop.d.ts","sourceRoot":"","sources":["../src/WatchLoop.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,KAAK,EAEV,OAAO,EAIR,MAAM,kBAAkB,CAAC;AAE1B;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC;;OAEG;IACH,YAAY,EAAE,CAAC,KAAK,EAAE,eAAe,KAAK,OAAO,CAAC,eAAe,CAAC,CAAC;IACnE;;OAEG;IACH,eAAe,EAAE,MAAM,IAAI,CAAC;IAC5B;;OAEG;IACH,YAAY,EAAE,CAAC,SAAS,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IAC3C;;OAEG;IACH,OAAO,EAAE,MAAM,IAAI,CAAC;CACrB;AAED;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,IAAI,WAAW,IAAI,WAAW,CAAC;IAC/B,UAAU,EAAE,CAAC,SAAS,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;CAC1C;AAED;;;;GAIG;AACH,qBAAa,SAAU,YAAW,eAAe;IAC/C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA8B;IAEvD,OAAO,CAAC,gBAAgB,CAAkB;IAC1C,OAAO,CAAC,UAAU,CAAU;IAC5B,OAAO,CAAC,aAAa,CAAU;IAC/B,OAAO,CAAC,kBAAkB,CAA8B;IACxD,OAAO,CAAC,kBAAkB,CAAgC;gBAEvC,OAAO,EAAE,iBAAiB;IAY7C;;OAEG;IACU,mBAAmB,CAAC,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,eAAe,CAAC;IA0BpF;;OAEG;IACU,oBAAoB,CAAC,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAgBjG;;;OAGG;IACU,WAAW,CAAC,IAAI,GAAE,OAAiB,GAAG,OAAO,CAAC,IAAI,CAAC;IAgGhE;;OAEG;IACI,UAAU,EAAE,CAAC,SAAS,CAAC,EAAE,MAAM,KAAK,IAAI,CAU7C;IAEF;;OAEG;IACH,IAAW,WAAW,IAAI,WAAW,CAEpC;IAED;;OAEG;IACH,OAAO,CAAC,aAAa,CAEnB;IAEF;;OAEG;IACH,OAAO,CAAC,MAAM;IAad;;;OAGG;YACW,kBAAkB;CAiBjC"}
|
package/lib/WorkQueue.d.ts
CHANGED
package/lib/WorkQueue.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"WorkQueue.d.ts","sourceRoot":"","sources":["../src/WorkQueue.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"WorkQueue.d.ts","sourceRoot":"","sources":["../src/WorkQueue.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAOpD,qBAAa,SAAS;IACpB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA0B;IACjD,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAc;IAC3C,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAgB;IAE9C,OAAO,CAAC,YAAY,CAAgB;IACpC,OAAO,CAAC,YAAY,CAAa;IACjC,OAAO,CAAC,mBAAmB,CAA6B;gBAErC,WAAW,EAAE,WAAW;IAgB7B,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,qBAAqB,CAAC,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;IAW3E,SAAS,CAAC,IAAI,EAAE,MAAM,OAAO,CAAC,eAAe,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;IAelG,OAAO,CAAC,qBAAqB;CAY9B"}
|
|
@@ -2,7 +2,9 @@
|
|
|
2
2
|
// Copyright (c) Microsoft Corporation. All rights reserved. Licensed under the MIT license.
|
|
3
3
|
// See LICENSE in the project root for license information.
|
|
4
4
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
5
|
-
exports.
|
|
5
|
+
exports.calculateCriticalPathLengths = calculateCriticalPathLengths;
|
|
6
|
+
exports.calculateShortestPath = calculateShortestPath;
|
|
7
|
+
exports.calculateCriticalPathLength = calculateCriticalPathLength;
|
|
6
8
|
/**
|
|
7
9
|
* For every operation in the input, computes the length of the longest chain of operations that depend on it.
|
|
8
10
|
* This value is stored as `operation.criticalPathLength`.
|
|
@@ -17,7 +19,6 @@ function calculateCriticalPathLengths(operations) {
|
|
|
17
19
|
}
|
|
18
20
|
return queue;
|
|
19
21
|
}
|
|
20
|
-
exports.calculateCriticalPathLengths = calculateCriticalPathLengths;
|
|
21
22
|
/**
|
|
22
23
|
* Calculates the shortest path from `startOperation` to `endOperation`.
|
|
23
24
|
* Used when printing out circular dependencies.
|
|
@@ -52,7 +53,6 @@ function calculateShortestPath(startOperation, endOperation) {
|
|
|
52
53
|
}
|
|
53
54
|
return path;
|
|
54
55
|
}
|
|
55
|
-
exports.calculateShortestPath = calculateShortestPath;
|
|
56
56
|
/**
|
|
57
57
|
* Perform a depth-first search to find critical path length to the provided operation.
|
|
58
58
|
* Cycle detection comes at minimal additional cost.
|
|
@@ -85,5 +85,4 @@ function calculateCriticalPathLength(operation, dependencyChain) {
|
|
|
85
85
|
// However, we want a bit more fine-tuning of the output than just the raw topology
|
|
86
86
|
return criticalPathLength;
|
|
87
87
|
}
|
|
88
|
-
exports.calculateCriticalPathLength = calculateCriticalPathLength;
|
|
89
88
|
//# sourceMappingURL=calculateCriticalPath.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"calculateCriticalPath.js","sourceRoot":"","sources":["../src/calculateCriticalPath.ts"],"names":[],"mappings":";AAAA,4FAA4F;AAC5F,2DAA2D;;;
|
|
1
|
+
{"version":3,"file":"calculateCriticalPath.js","sourceRoot":"","sources":["../src/calculateCriticalPath.ts"],"names":[],"mappings":";AAAA,4FAA4F;AAC5F,2DAA2D;;AAa3D,oEAWC;AAMD,sDAoCC;AAMD,kEA0CC;AAzGD;;;GAGG;AACH,SAAgB,4BAA4B,CAAkC,UAAuB;IACnG,mEAAmE;IACnE,MAAM,KAAK,GAAQ,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAE1C,kDAAkD;IAClD,MAAM,kBAAkB,GAAW,IAAI,GAAG,EAAE,CAAC;IAC7C,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE,CAAC;QAC9B,2BAA2B,CAAC,SAAS,EAAE,kBAAkB,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAgB,qBAAqB,CACnC,cAAiB,EACjB,YAAe;IAEf,mDAAmD;IACnD,MAAM,OAAO,GAA0B,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IAC5E,IAAI,WAA0B,CAAC;IAE/B,4FAA4F;IAC5F,KAAK,EAAE,KAAK,MAAM,CAAC,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;QACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;YAC3C,sFAAsF;YACtF,oFAAoF;YACpF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YACnC,CAAC;YAED,IAAI,QAAQ,KAAK,cAAc,EAAE,CAAC;gBAChC,WAAW,GAAG,SAAS,CAAC;gBACxB,MAAM,KAAK,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,+BAA+B,cAAc,CAAC,IAAI,SAAS,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC;IACnG,CAAC;IAED,sEAAsE;IACtE,IAAI,gBAAgB,GAAM,WAAW,CAAC;IACtC,MAAM,IAAI,GAAQ,CAAC,cAAc,CAAC,CAAC;IACnC,OAAO,gBAAgB,KAAK,SAAS,EAAE,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC5B,gBAAgB,GAAG,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAE,CAAC;IACpD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,2BAA2B,CACzC,SAAY,EACZ,eAAuB;IAEvB,IAAI,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QACnC,gDAAgD;QAChD,MAAM,YAAY,GAAQ,qBAAqB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAEtE,MAAM,IAAI,KAAK,CACb,0CAA0C;YACxC,YAAY,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CACtE,CAAC;IACJ,CAAC;IAED,IAAI,EAAE,kBAAkB,EAAE,GAAG,SAAS,CAAC;IAEvC,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;QACrC,gCAAgC;QAChC,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAED,kBAAkB,GAAG,CAAC,CAAC;IACvB,IAAI,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QAC7B,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC/B,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;YAC3C,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAC3B,kBAAkB,EAClB,2BAA2B,CAAC,QAAQ,EAAE,eAAe,CAAC,CACvD,CAAC;QACJ,CAAC;QACD,eAAe,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IACD,sDAAsD;IACtD,kBAAkB,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,CAAC;IAE5C,gBAAgB;IAChB,SAAS,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;IAElD,gGAAgG;IAChG,mFAAmF;IAEnF,OAAO,kBAAkB,CAAC;AAC5B,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation. All rights reserved. Licensed under the MIT license.\n// See LICENSE in the project root for license information.\n\nexport interface ISortableOperation<T extends ISortableOperation<T>> {\n name: string | undefined;\n criticalPathLength?: number | undefined;\n weight: number;\n consumers: Set<T>;\n}\n\n/**\n * For every operation in the input, computes the length of the longest chain of operations that depend on it.\n * This value is stored as `operation.criticalPathLength`.\n */\nexport function calculateCriticalPathLengths<T extends ISortableOperation<T>>(operations: Iterable<T>): T[] {\n // Clone the set of operations as an array, so that we can sort it.\n const queue: T[] = Array.from(operations);\n\n // Create a collection for detecting visited nodes\n const cycleDetectorStack: Set<T> = new Set();\n for (const operation of queue) {\n calculateCriticalPathLength(operation, cycleDetectorStack);\n }\n\n return queue;\n}\n\n/**\n * Calculates the shortest path from `startOperation` to `endOperation`.\n * Used when printing out circular dependencies.\n */\nexport function calculateShortestPath<T extends ISortableOperation<T>>(\n startOperation: T,\n endOperation: T\n): T[] {\n // Map of each operation to the most optimal parent\n const parents: Map<T, T | undefined> = new Map([[endOperation, undefined]]);\n let finalParent: T | undefined;\n\n // Run a breadth-first search to find the shortest path between the start and end operations\n outer: for (const [operation] of parents) {\n for (const consumer of operation.consumers) {\n // Since this is a breadth-first traversal, the first encountered path to a given node\n // will be tied for shortest, so only the first encountered path needs to be tracked\n if (!parents.has(consumer)) {\n parents.set(consumer, operation);\n }\n\n if (consumer === startOperation) {\n finalParent = operation;\n break outer;\n }\n }\n }\n\n if (!finalParent) {\n throw new Error(`Could not find a path from \"${startOperation.name}\" to \"${endOperation.name}\"`);\n }\n\n // Walk back up the path from the end operation to the start operation\n let currentOperation: T = finalParent;\n const path: T[] = [startOperation];\n while (currentOperation !== undefined) {\n path.push(currentOperation);\n currentOperation = parents.get(currentOperation)!;\n }\n return path;\n}\n\n/**\n * Perform a depth-first search to find critical path length to the provided operation.\n * Cycle detection comes at minimal additional cost.\n */\nexport function calculateCriticalPathLength<T extends ISortableOperation<T>>(\n operation: T,\n dependencyChain: Set<T>\n): number {\n if (dependencyChain.has(operation)) {\n // Ensure we have the shortest path to the cycle\n const shortestPath: T[] = calculateShortestPath(operation, operation);\n\n throw new Error(\n 'A cyclic dependency was encountered:\\n ' +\n shortestPath.map((visitedTask) => visitedTask.name).join('\\n -> ')\n );\n }\n\n let { criticalPathLength } = operation;\n\n if (criticalPathLength !== undefined) {\n // This has been visited already\n return criticalPathLength;\n }\n\n criticalPathLength = 0;\n if (operation.consumers.size) {\n dependencyChain.add(operation);\n for (const consumer of operation.consumers) {\n criticalPathLength = Math.max(\n criticalPathLength,\n calculateCriticalPathLength(consumer, dependencyChain)\n );\n }\n dependencyChain.delete(operation);\n }\n // Include the contribution from the current operation\n criticalPathLength += operation.weight ?? 1;\n\n // Record result\n operation.criticalPathLength = criticalPathLength;\n\n // Directly writing operations to an output collection here would yield a topological sorted set\n // However, we want a bit more fine-tuning of the output than just the raw topology\n\n return criticalPathLength;\n}\n"]}
|
package/lib/index.d.ts
CHANGED
|
@@ -1,3 +1,4 @@
|
|
|
1
|
+
/// <reference types="node" preserve="true" />
|
|
1
2
|
export type { IOperationRunner, IOperationRunnerContext, IOperationState, IOperationStates } from './IOperationRunner';
|
|
2
3
|
export type { IAfterExecuteEventMessage, ISyncEventMessage, IRequestRunEventMessage, EventMessageFromClient, ICancelCommandMessage, IExitCommandMessage, IRunCommandMessage, ISyncCommandMessage, CommandMessageFromHost, IPCHost } from './protocol.types';
|
|
3
4
|
export { type IExecuteOperationContext, type IOperationOptions, Operation } from './Operation';
|
package/lib/index.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAKA,YAAY,EACV,gBAAgB,EAChB,uBAAuB,EACvB,eAAe,EACf,gBAAgB,EACjB,MAAM,oBAAoB,CAAC;AAE5B,YAAY,EACV,yBAAyB,EACzB,iBAAiB,EACjB,uBAAuB,EACvB,sBAAsB,EACtB,qBAAqB,EACrB,mBAAmB,EACnB,kBAAkB,EAClB,mBAAmB,EACnB,sBAAsB,EACtB,OAAO,EACR,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,KAAK,wBAAwB,EAAE,KAAK,iBAAiB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE/F,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAAE,KAAK,0BAA0B,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AAEzG,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAE9D,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC,OAAO,EAAE,KAAK,iBAAiB,EAAE,KAAK,eAAe,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC"}
|
package/lib/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAAA,4FAA4F;AAC5F,2DAA2D;;;
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAAA,4FAA4F;AAC5F,2DAA2D;;;AAwB3D,yCAA+F;AAA/B,sGAAA,SAAS,OAAA;AAEzE,mDAAkD;AAAzC,gHAAA,cAAc,OAAA;AAEvB,yEAAyG;AAA/D,sIAAA,yBAAyB,OAAA;AAEnE,+DAA8D;AAArD,4HAAA,oBAAoB,OAAA;AAE7B,qDAAoD;AAA3C,kHAAA,eAAe,OAAA;AAExB,yCAAwC;AAA/B,sGAAA,SAAS,OAAA;AAElB,yCAAsF;AAA/B,sGAAA,SAAS,OAAA","sourcesContent":["// Copyright (c) Microsoft Corporation. All rights reserved. Licensed under the MIT license.\n// See LICENSE in the project root for license information.\n\n/// <reference types=\"node\" preserve=\"true\" />\n\nexport type {\n IOperationRunner,\n IOperationRunnerContext,\n IOperationState,\n IOperationStates\n} from './IOperationRunner';\n\nexport type {\n IAfterExecuteEventMessage,\n ISyncEventMessage,\n IRequestRunEventMessage,\n EventMessageFromClient,\n ICancelCommandMessage,\n IExitCommandMessage,\n IRunCommandMessage,\n ISyncCommandMessage,\n CommandMessageFromHost,\n IPCHost\n} from './protocol.types';\n\nexport { type IExecuteOperationContext, type IOperationOptions, Operation } from './Operation';\n\nexport { OperationError } from './OperationError';\n\nexport { type IOperationExecutionOptions, OperationExecutionManager } from './OperationExecutionManager';\n\nexport { OperationGroupRecord } from './OperationGroupRecord';\n\nexport { OperationStatus } from './OperationStatus';\n\nexport { Stopwatch } from './Stopwatch';\n\nexport { type IWatchLoopOptions, type IWatchLoopState, WatchLoop } from './WatchLoop';\n"]}
|
package/lib/protocol.types.d.ts
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"protocol.types.d.ts","sourceRoot":"","sources":["../src/protocol.types.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"protocol.types.d.ts","sourceRoot":"","sources":["../src/protocol.types.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEzD;;;;GAIG;AACH,MAAM,WAAW,uBAAuB;IACtC,KAAK,EAAE,YAAY,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;GAIG;AACH,MAAM,WAAW,yBAAyB;IACxC,KAAK,EAAE,eAAe,CAAC;IACvB,MAAM,EAAE,eAAe,CAAC;CACzB;AAED;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,eAAe,CAAC;CACzB;AAED;;;;GAIG;AACH,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,QAAQ,CAAC;CACnB;AAED;;;;GAIG;AACH,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,KAAK,CAAC;CAChB;AAED;;;;GAIG;AACH,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;;GAGG;AACH,MAAM,MAAM,sBAAsB,GAC9B,qBAAqB,GACrB,mBAAmB,GACnB,kBAAkB,GAClB,mBAAmB,CAAC;AAExB;;;GAGG;AACH,MAAM,MAAM,sBAAsB,GAAG,uBAAuB,GAAG,yBAAyB,GAAG,iBAAiB,CAAC;AAE7G;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,OAAO,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC"}
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@rushstack/operation-graph",
|
|
3
|
-
"version": "0.2.
|
|
3
|
+
"version": "0.2.39",
|
|
4
4
|
"description": "Library for managing and executing operations in a directed acyclic graph.",
|
|
5
5
|
"main": "lib/index.js",
|
|
6
6
|
"typings": "dist/operation-graph.d.ts",
|
|
@@ -11,14 +11,14 @@
|
|
|
11
11
|
"directory": "libraries/operation-graph"
|
|
12
12
|
},
|
|
13
13
|
"dependencies": {
|
|
14
|
-
"@rushstack/node-core-library": "5.
|
|
15
|
-
"@rushstack/terminal": "0.
|
|
14
|
+
"@rushstack/node-core-library": "5.12.0",
|
|
15
|
+
"@rushstack/terminal": "0.15.1"
|
|
16
16
|
},
|
|
17
17
|
"devDependencies": {
|
|
18
|
-
"@rushstack/heft": "0.
|
|
19
|
-
"@rushstack/heft-node-rig": "2.
|
|
18
|
+
"@rushstack/heft": "0.69.2",
|
|
19
|
+
"@rushstack/heft-node-rig": "2.7.0",
|
|
20
20
|
"@types/heft-jest": "1.0.1",
|
|
21
|
-
"@types/node": "
|
|
21
|
+
"@types/node": "20.17.19",
|
|
22
22
|
"local-eslint-config": "1.0.0"
|
|
23
23
|
},
|
|
24
24
|
"peerDependencies": {
|