Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix(js): filter project dependencies when calculating topological ordering #26491

Merged
merged 3 commits into from
Jun 11, 2024
Merged

fix(js): filter project dependencies when calculating topological ordering #26491

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
1cab740
fix(js): filter project dependencies when calculating topological ord…
mpsanchis Jun 10, 2024
d48cb41
chore(js): Enhance unit test of topological sorting of project nodes
mpsanchis Jun 11, 2024
18df41b
chore(js): less churn in existing tests
JamesHenry Jun 11, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 10 additions & 8 deletions packages/js/src/generators/release-version/utils/sort-projects-topologically.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -39,14 +39,16 @@ export function sortProjectsTopologically(
sortedProjects.push(node);

// Process each project that depends on the current node
filteredDependencies.forEach((dep) => {
const dependentNode = projectGraph.nodes[dep.source];
const count = edges.get(dependentNode) - 1;
edges.set(dependentNode, count);
if (count === 0) {
processQueue.push(dependentNode);
}
});
filteredDependencies
.filter((dep) => dep.target === node.name)
.forEach((dep) => {
const dependentNode = projectGraph.nodes[dep.source];
const count = edges.get(dependentNode) - 1;
edges.set(dependentNode, count);
if (count === 0) {
processQueue.push(dependentNode);
}
});
}

/**
Expand Down