@@ -952,7 +952,6 @@ class ExtTSPImpl {
952
952
const double DL = ChainDensity[L];
953
953
const double DR = ChainDensity[R];
954
954
// Compare by density and break ties by chain identifiers.
955
- return (DL != DR) ? (DL > DR) : (L->Id < R->Id );
956
955
return std::make_tuple (-DL, L->Id ) <
957
956
std::make_tuple (-DR, R->Id );
958
957
});
@@ -1104,7 +1103,7 @@ class CDSortImpl {
1104
1103
1105
1104
// Insert the edges into the queue.
1106
1105
for (ChainT *ChainPred : HotChains) {
1107
- for (const auto &[Chain , Edge] : ChainPred->Edges ) {
1106
+ for (const auto &[_ , Edge] : ChainPred->Edges ) {
1108
1107
// Ignore self-edges.
1109
1108
if (Edge->isSelfEdge ())
1110
1109
continue ;
@@ -1137,9 +1136,9 @@ class CDSortImpl {
1137
1136
ChainT *BestDstChain = BestEdge->dstChain ();
1138
1137
1139
1138
// Remove outdated edges from the queue.
1140
- for (const auto &[Chain , ChainEdge] : BestSrcChain->Edges )
1139
+ for (const auto &[_ , ChainEdge] : BestSrcChain->Edges )
1141
1140
Queue.erase (ChainEdge);
1142
- for (const auto &[Chain , ChainEdge] : BestDstChain->Edges )
1141
+ for (const auto &[_ , ChainEdge] : BestDstChain->Edges )
1143
1142
Queue.erase (ChainEdge);
1144
1143
1145
1144
// Merge the best pair of chains.
@@ -1148,7 +1147,7 @@ class CDSortImpl {
1148
1147
BestGain.mergeType ());
1149
1148
1150
1149
// Insert newly created edges into the queue.
1151
- for (const auto &[Chain , Edge] : BestSrcChain->Edges ) {
1150
+ for (const auto &[_ , Edge] : BestSrcChain->Edges ) {
1152
1151
// Ignore loop edges.
1153
1152
if (Edge->isSelfEdge ())
1154
1153
continue ;
0 commit comments