Overview - Nx

Nx

7 days30 days

Latest CI Pipeline Executions

Succeeded
33737
4f178bc8 Merge branch 'master' into perf/typescript-compiler-host-caching
13 hours ago by JamesHenry
Failed
33737
400d8336 perf(core): optimize task graph cycle detection and formatting Improve performance of task graph operations from O(n³) to O(n): 1. Task graph cycle detection (task-graph-utils.ts): - Replace Array.includes() with Set.has() for O(1) path lookup - Use mutable Set/Array pair to avoid creating new arrays per recursion - Collect cyclic deps before removal to avoid mutation during iteration - Affects: findCycle(), findCycles(), makeAcyclic() 2. Task formatting (formatting-utils.ts): - Convert projectNames and targets arrays to Sets upfront - Replace O(n) Array.includes() with O(1) Set.has() in forEach loop - Add type annotations to Sets for clarity Performance impact: - Cycle detection: O(n³) → O(n) where n = number of tasks - Formatting: O(n*m) → O(n+m) where n = tasks, m = projects - For 100+ task monorepos: 10-50x improvement in cycle detection
1 day ago by adwait1290
Failed
33737
400d8336 perf(core): optimize task graph cycle detection and formatting Improve performance of task graph operations from O(n³) to O(n): 1. Task graph cycle detection (task-graph-utils.ts): - Replace Array.includes() with Set.has() for O(1) path lookup - Use mutable Set/Array pair to avoid creating new arrays per recursion - Collect cyclic deps before removal to avoid mutation during iteration - Affects: findCycle(), findCycles(), makeAcyclic() 2. Task formatting (formatting-utils.ts): - Convert projectNames and targets arrays to Sets upfront - Replace O(n) Array.includes() with O(1) Set.has() in forEach loop - Add type annotations to Sets for clarity Performance impact: - Cycle detection: O(n³) → O(n) where n = number of tasks - Formatting: O(n*m) → O(n+m) where n = tasks, m = projects - For 100+ task monorepos: 10-50x improvement in cycle detection
2 days ago by adwait1290
Failed
33737
400d8336 perf(core): optimize task graph cycle detection and formatting Improve performance of task graph operations from O(n³) to O(n): 1. Task graph cycle detection (task-graph-utils.ts): - Replace Array.includes() with Set.has() for O(1) path lookup - Use mutable Set/Array pair to avoid creating new arrays per recursion - Collect cyclic deps before removal to avoid mutation during iteration - Affects: findCycle(), findCycles(), makeAcyclic() 2. Task formatting (formatting-utils.ts): - Convert projectNames and targets arrays to Sets upfront - Replace O(n) Array.includes() with O(1) Set.has() in forEach loop - Add type annotations to Sets for clarity Performance impact: - Cycle detection: O(n³) → O(n) where n = number of tasks - Formatting: O(n*m) → O(n+m) where n = tasks, m = projects - For 100+ task monorepos: 10-50x improvement in cycle detection
2 days ago by adwait1290
Failed
33737
400d8336 perf(core): optimize task graph cycle detection and formatting Improve performance of task graph operations from O(n³) to O(n): 1. Task graph cycle detection (task-graph-utils.ts): - Replace Array.includes() with Set.has() for O(1) path lookup - Use mutable Set/Array pair to avoid creating new arrays per recursion - Collect cyclic deps before removal to avoid mutation during iteration - Affects: findCycle(), findCycles(), makeAcyclic() 2. Task formatting (formatting-utils.ts): - Convert projectNames and targets arrays to Sets upfront - Replace O(n) Array.includes() with O(1) Set.has() in forEach loop - Add type annotations to Sets for clarity Performance impact: - Cycle detection: O(n³) → O(n) where n = number of tasks - Formatting: O(n*m) → O(n+m) where n = tasks, m = projects - For 100+ task monorepos: 10-50x improvement in cycle detection
2 days ago by adwait1290