@@ -19,12 +19,12 @@ TEST_CASE("edge_groups_create_sets", "[vpr]") {
19
19
// Build chains from the given connected sets
20
20
int max_node_id = 0 ;
21
21
std::vector<std::pair<int , int >> edges;
22
- for (auto set : connected_sets) {
22
+ for (const auto & set : connected_sets) {
23
23
int last = *set.cbegin ();
24
24
std::for_each (std::next (set.cbegin ()),
25
25
set.cend (),
26
26
[&](int node) {
27
- edges.push_back ( std::make_pair ( last, node) );
27
+ edges.emplace_back ( last, node);
28
28
last = node;
29
29
max_node_id = std::max (max_node_id, node);
30
30
});
@@ -36,7 +36,7 @@ TEST_CASE("edge_groups_create_sets", "[vpr]") {
36
36
// Initialize nodes to [0, 1, ..., max_node_id]
37
37
std::iota (nodes.begin (), nodes.end (), 0 );
38
38
39
- // Create a Mersenne Twister psuedo -random number generator with seed 1
39
+ // Create a Mersenne Twister pseudo -random number generator with seed 1
40
40
std::mt19937 g (1 );
41
41
42
42
// Run the test many times, the PRNG will give differently shuffled inputs
@@ -66,12 +66,12 @@ TEST_CASE("edge_groups_create_sets", "[vpr]") {
66
66
t_non_configurable_rr_sets sets = groups.output_sets ();
67
67
68
68
// Check for the expected sets
69
- for (auto set : connected_sets) {
69
+ for (const auto & set : connected_sets) {
70
70
std::set<RRNodeId> random_set;
71
71
for (auto elem : set) {
72
72
random_set.insert (RRNodeId (random_nodes[elem]));
73
73
}
74
- REQUIRE (sets.node_sets .find ( random_set) != sets.node_sets .end ());
74
+ REQUIRE (std::find ( sets.node_sets .begin (), sets. node_sets . end (), random_set) != sets.node_sets .end ());
75
75
}
76
76
}
77
77
}
0 commit comments