Overview - Nx

Nx

7 days30 days

Latest CI Pipeline Executions

In progress
master
52e29959 chore(repo): update nx to 22.2.0-beta.4 (#33722) Updating Nx from 22.2.0-beta.3 to 22.2.0-beta.4 --------- Co-authored-by: nx-cloud[bot] <71083854+nx-cloud[bot]@users.noreply.github.com> Co-authored-by: FrozenPandaz <FrozenPandaz@users.noreply.github.com>
57 minutes ago by FrozenPandaz
In progress
master
52e29959 chore(repo): update nx to 22.2.0-beta.4 (#33722) Updating Nx from 22.2.0-beta.3 to 22.2.0-beta.4 --------- Co-authored-by: nx-cloud[bot] <71083854+nx-cloud[bot]@users.noreply.github.com> Co-authored-by: FrozenPandaz <FrozenPandaz@users.noreply.github.com>
1 hour ago by FrozenPandaz
Failed
master
52e29959 chore(repo): update nx to 22.2.0-beta.4 (#33722) Updating Nx from 22.2.0-beta.3 to 22.2.0-beta.4 --------- Co-authored-by: nx-cloud[bot] <71083854+nx-cloud[bot]@users.noreply.github.com> Co-authored-by: FrozenPandaz <FrozenPandaz@users.noreply.github.com>
2 hours ago by FrozenPandaz
Failed
master
5d597ee5 fix(js): use Set for O(1) package.json root lookup (#33757) ## Current Behavior In `buildExplicitPackageJsonDependencies`, for every file in the project file map, we call `isPackageJsonAtProjectRoot` which uses `Array.find()`: ```typescript function isPackageJsonAtProjectRoot(nodes, fileName) { return ( fileName.endsWith('package.json') && nodes.find((projectNode) => // O(n) lookup per file! joinPathFragments(projectNode.root, 'package.json') === fileName ) ); } ``` This is O(files × projects) complexity. ## Expected Behavior Build a Set of valid package.json paths once, then use O(1) Set lookup: ```typescript const projectPackageJsonPaths = new Set( Object.values(ctx.projects).map((project) => joinPathFragments(project.root, 'package.json') ) ); // Later: O(1) lookup if (projectPackageJsonPaths.has(f.file)) { ... } ``` ## Performance Impact ``` Before (Array.find per file): After (Set.has): ┌─────────────────────────┐ ┌─────────────────────────┐ │ For each file: │ │ Build Set once: │ │ nodes.find(...) │ │ O(projects) │ │ O(projects) per file │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ ┌─────────────────────────┐ ┌─────────────────────────┐ │ For each file: │ │ Total: O(files×projects)│ │ Set.has(f.file) │ └─────────────────────────┘ │ O(1) per file │ └───────────┬─────────────┘ │ ▼ ┌─────────────────────────┐ │ Total: O(files+projects)│ └─────────────────────────┘ ``` **Example**: With 5,000 files and 200 projects: - Before: 5,000 × 200 = 1,000,000 comparisons (worst case) - After: 200 (build Set) + 5,000 (lookups) = 5,200 operations ## Additional Changes - Replaced `forEach` with `for...in/of` loops - Removed unused `isPackageJsonAtProjectRoot` function - Removed unused `ProjectConfiguration` import - Net reduction of 7 lines ## Why Accept This PR 1. **Significant complexity reduction**: O(n²) → O(n) 2. **Hot path**: Called during dependency graph construction for every file 3. **Cleaner code**: Removed unused function, fewer lines ## Related Issue(s) Contributes to #32265 ## Merge Dependencies This PR has no dependencies and can be merged independently. ---
2 hours ago by adwait1290
Failed
master
5d597ee5 fix(js): use Set for O(1) package.json root lookup (#33757) ## Current Behavior In `buildExplicitPackageJsonDependencies`, for every file in the project file map, we call `isPackageJsonAtProjectRoot` which uses `Array.find()`: ```typescript function isPackageJsonAtProjectRoot(nodes, fileName) { return ( fileName.endsWith('package.json') && nodes.find((projectNode) => // O(n) lookup per file! joinPathFragments(projectNode.root, 'package.json') === fileName ) ); } ``` This is O(files × projects) complexity. ## Expected Behavior Build a Set of valid package.json paths once, then use O(1) Set lookup: ```typescript const projectPackageJsonPaths = new Set( Object.values(ctx.projects).map((project) => joinPathFragments(project.root, 'package.json') ) ); // Later: O(1) lookup if (projectPackageJsonPaths.has(f.file)) { ... } ``` ## Performance Impact ``` Before (Array.find per file): After (Set.has): ┌─────────────────────────┐ ┌─────────────────────────┐ │ For each file: │ │ Build Set once: │ │ nodes.find(...) │ │ O(projects) │ │ O(projects) per file │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ ┌─────────────────────────┐ ┌─────────────────────────┐ │ For each file: │ │ Total: O(files×projects)│ │ Set.has(f.file) │ └─────────────────────────┘ │ O(1) per file │ └───────────┬─────────────┘ │ ▼ ┌─────────────────────────┐ │ Total: O(files+projects)│ └─────────────────────────┘ ``` **Example**: With 5,000 files and 200 projects: - Before: 5,000 × 200 = 1,000,000 comparisons (worst case) - After: 200 (build Set) + 5,000 (lookups) = 5,200 operations ## Additional Changes - Replaced `forEach` with `for...in/of` loops - Removed unused `isPackageJsonAtProjectRoot` function - Removed unused `ProjectConfiguration` import - Net reduction of 7 lines ## Why Accept This PR 1. **Significant complexity reduction**: O(n²) → O(n) 2. **Hot path**: Called during dependency graph construction for every file 3. **Cleaner code**: Removed unused function, fewer lines ## Related Issue(s) Contributes to #32265 ## Merge Dependencies This PR has no dependencies and can be merged independently. ---
2 hours ago by adwait1290
Succeeded
master
300493ec fix(core): use Set for O(1) visited node lookup in hasPath (#33754) ## Current Behavior The `hasPath` function in `graph.ts` uses an array with `indexOf()` for tracking visited nodes during recursive graph traversal: ```typescript function hasPath(graph, target, node, visited: string[]) { for (let d of graph.dependencies[node] || []) { if (visited.indexOf(d.target) > -1) continue; // O(n) lookup visited.push(d.target); // recursive call... } } ``` This results in O(n) lookups per node visited, making worst-case traversal O(n²). ## Expected Behavior Use `Set` for O(1) visited node tracking: ```typescript function hasPath(graph, target, node, visited: Set<string>) { for (const d of graph.dependencies[node] || []) { if (visited.has(d.target)) continue; // O(1) lookup visited.add(d.target); // recursive call... } } ``` ## Performance Impact ``` Before (Array + indexOf): After (Set + has): ┌─────────────────────────┐ ┌─────────────────────────┐ │ hasPath() called │ │ hasPath() called │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ ┌─────────────────────────┐ ┌─────────────────────────┐ │ visited.indexOf(target) │ │ visited.has(target) │ │ O(n) lookup │ │ O(1) lookup │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ ┌─────────────────────────┐ ┌─────────────────────────┐ │ visited.push(target) │ │ visited.add(target) │ │ O(1) │ │ O(1) │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ Complexity: O(n²) Complexity: O(n) for full traversal for full traversal ``` **Example with 500 nodes:** - Before: 500 nodes × avg 250 indexOf lookups = ~125,000 comparisons - After: 500 nodes × 1 Set lookup each = 500 operations ## Why Accept This PR 1. **Zero risk**: Same semantics, just faster data structure 2. **Standard pattern**: Set is the idiomatic choice for visited tracking in graph algorithms 3. **Measurable impact**: Graph filtering with `--focus` flag will be significantly faster on large monorepos ## Related Issue(s) Contributes to #32265 ## Merge Dependencies This PR has no dependencies and can be merged independently. ---
2 hours ago by adwait1290
Succeeded
master
e6a5a7ed fix(gradle): do not add gradle plugin to plugins block if using version catalogs (#33763)      ## Current Behavior  We would add the gradle project graph plugin to your build.gradle files if we did not already detect it. However, this did mechanism did not recognize aliases for the project graph plugin that came from version catalogs. ## Expected Behavior  When adding the project graph plugin to build.gradle.kts, we check if a version catalogue exists, and if it does we add the alias for the project graph plugin. ## Related Issue(s)  Fixes # --------- Co-authored-by: graphite-app[bot] <96075541+graphite-app[bot]@users.noreply.github.com>
3 hours ago by lourw
Succeeded
master
e6a5a7ed fix(gradle): do not add gradle plugin to plugins block if using version catalogs (#33763)      ## Current Behavior  We would add the gradle project graph plugin to your build.gradle files if we did not already detect it. However, this did mechanism did not recognize aliases for the project graph plugin that came from version catalogs. ## Expected Behavior  When adding the project graph plugin to build.gradle.kts, we check if a version catalogue exists, and if it does we add the alias for the project graph plugin. ## Related Issue(s)  Fixes # --------- Co-authored-by: graphite-app[bot] <96075541+graphite-app[bot]@users.noreply.github.com>
4 hours ago by lourw
Succeeded
master
e6a5a7ed fix(gradle): do not add gradle plugin to plugins block if using version catalogs (#33763)      ## Current Behavior  We would add the gradle project graph plugin to your build.gradle files if we did not already detect it. However, this did mechanism did not recognize aliases for the project graph plugin that came from version catalogs. ## Expected Behavior  When adding the project graph plugin to build.gradle.kts, we check if a version catalogue exists, and if it does we add the alias for the project graph plugin. ## Related Issue(s)  Fixes # --------- Co-authored-by: graphite-app[bot] <96075541+graphite-app[bot]@users.noreply.github.com>
4 hours ago by lourw
Succeeded
master
300493ec fix(core): use Set for O(1) visited node lookup in hasPath (#33754) ## Current Behavior The `hasPath` function in `graph.ts` uses an array with `indexOf()` for tracking visited nodes during recursive graph traversal: ```typescript function hasPath(graph, target, node, visited: string[]) { for (let d of graph.dependencies[node] || []) { if (visited.indexOf(d.target) > -1) continue; // O(n) lookup visited.push(d.target); // recursive call... } } ``` This results in O(n) lookups per node visited, making worst-case traversal O(n²). ## Expected Behavior Use `Set` for O(1) visited node tracking: ```typescript function hasPath(graph, target, node, visited: Set<string>) { for (const d of graph.dependencies[node] || []) { if (visited.has(d.target)) continue; // O(1) lookup visited.add(d.target); // recursive call... } } ``` ## Performance Impact ``` Before (Array + indexOf): After (Set + has): ┌─────────────────────────┐ ┌─────────────────────────┐ │ hasPath() called │ │ hasPath() called │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ ┌─────────────────────────┐ ┌─────────────────────────┐ │ visited.indexOf(target) │ │ visited.has(target) │ │ O(n) lookup │ │ O(1) lookup │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ ┌─────────────────────────┐ ┌─────────────────────────┐ │ visited.push(target) │ │ visited.add(target) │ │ O(1) │ │ O(1) │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ Complexity: O(n²) Complexity: O(n) for full traversal for full traversal ``` **Example with 500 nodes:** - Before: 500 nodes × avg 250 indexOf lookups = ~125,000 comparisons - After: 500 nodes × 1 Set lookup each = 500 operations ## Why Accept This PR 1. **Zero risk**: Same semantics, just faster data structure 2. **Standard pattern**: Set is the idiomatic choice for visited tracking in graph algorithms 3. **Measurable impact**: Graph filtering with `--focus` flag will be significantly faster on large monorepos ## Related Issue(s) Contributes to #32265 ## Merge Dependencies This PR has no dependencies and can be merged independently. ---
5 hours ago by AgentEnder
Failed
master
300493ec fix(core): use Set for O(1) visited node lookup in hasPath (#33754) ## Current Behavior The `hasPath` function in `graph.ts` uses an array with `indexOf()` for tracking visited nodes during recursive graph traversal: ```typescript function hasPath(graph, target, node, visited: string[]) { for (let d of graph.dependencies[node] || []) { if (visited.indexOf(d.target) > -1) continue; // O(n) lookup visited.push(d.target); // recursive call... } } ``` This results in O(n) lookups per node visited, making worst-case traversal O(n²). ## Expected Behavior Use `Set` for O(1) visited node tracking: ```typescript function hasPath(graph, target, node, visited: Set<string>) { for (const d of graph.dependencies[node] || []) { if (visited.has(d.target)) continue; // O(1) lookup visited.add(d.target); // recursive call... } } ``` ## Performance Impact ``` Before (Array + indexOf): After (Set + has): ┌─────────────────────────┐ ┌─────────────────────────┐ │ hasPath() called │ │ hasPath() called │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ ┌─────────────────────────┐ ┌─────────────────────────┐ │ visited.indexOf(target) │ │ visited.has(target) │ │ O(n) lookup │ │ O(1) lookup │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ ┌─────────────────────────┐ ┌─────────────────────────┐ │ visited.push(target) │ │ visited.add(target) │ │ O(1) │ │ O(1) │ └───────────┬─────────────┘ └───────────┬─────────────┘ │ │ ▼ ▼ Complexity: O(n²) Complexity: O(n) for full traversal for full traversal ``` **Example with 500 nodes:** - Before: 500 nodes × avg 250 indexOf lookups = ~125,000 comparisons - After: 500 nodes × 1 Set lookup each = 500 operations ## Why Accept This PR 1. **Zero risk**: Same semantics, just faster data structure 2. **Standard pattern**: Set is the idiomatic choice for visited tracking in graph algorithms 3. **Measurable impact**: Graph filtering with `--focus` flag will be significantly faster on large monorepos ## Related Issue(s) Contributes to #32265 ## Merge Dependencies This PR has no dependencies and can be merged independently. ---
5 hours ago by adwait1290
Succeeded
master
c6b2a261 docs(nx-dev): add december 2025 webinar (#33760)
6 hours ago by philipjful...
Succeeded
master
c6b2a261 docs(nx-dev): add december 2025 webinar (#33760)
7 hours ago by philipjful...
Succeeded
master
c6b2a261 docs(nx-dev): add december 2025 webinar (#33760)
7 hours ago by philipjful...
Succeeded
master
c6b2a261 docs(nx-dev): add december 2025 webinar (#33760)
7 hours ago by philipjful...
Succeeded
master
c6b2a261 docs(nx-dev): add december 2025 webinar (#33760)
8 hours ago by philipjful...
Succeeded
master
c6b2a261 docs(nx-dev): add december 2025 webinar (#33760)
9 hours ago by philipjful...
Succeeded
master
c6b2a261 docs(nx-dev): add december 2025 webinar (#33760)
9 hours ago by philipjful...
Failed
master
60d019e0 Revert "docs(nx-cloud): update resource usage minimum version to 22.2" (#33725) Reverts nrwl/nx#33723
19 hours ago by jaysoo
Failed
master
60d019e0 Revert "docs(nx-cloud): update resource usage minimum version to 22.2" (#33725) Reverts nrwl/nx#33723
2 days ago by jaysoo