Skip to content

Fix typo in RR Graph edge sorting #3351

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

Merged
merged 1 commit into from
Nov 20, 2025
+5 −5
Merged

Fix typo in RR Graph edge sorting #3351

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
10 changes: 5 additions & 5 deletions libs/librrgraph/src/base/rr_graph_storage.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -840,7 +840,7 @@ class t_rr_graph_storage {
// Generic lambda that allocates a 'vec'-sized new vector with all elements set to default value,
// then builds the new vector to have rearranged elements from 'vec' and finaly move the new vector
// to replace vec. Essentially does a permutation on vec based on edge_indices.
auto array_rearrage = [&edge_indices] (auto& vec, auto default_value) {
auto array_rearrange = [&edge_indices] (auto& vec, auto default_value) {

// Since vec could have any type, we need to figure out it's type to allocate new_vec.
// The scary std::remove_reference stuff does exactly that. This does nothing other than building a new 'vec' sized vector.
Expand All @@ -858,10 +858,10 @@ class t_rr_graph_storage {
vec = std::move(new_vec);
};

array_rearrage(edge_src_node_, RRNodeId::INVALID());
array_rearrage(edge_dest_node_, RRNodeId::INVALID());
array_rearrage(edge_switch_, LIBRRGRAPH_UNDEFINED_VAL);
array_rearrage(edge_remapped_, false);
array_rearrange(edge_src_node_, RRNodeId::INVALID());
array_rearrange(edge_dest_node_, RRNodeId::INVALID());
array_rearrange(edge_switch_, LIBRRGRAPH_UNDEFINED_VAL);
array_rearrange(edge_remapped_, false);
}

/******************
Expand Down