mirror of
https://github.com/postgres/postgres.git
synced 2025-08-27 07:42:10 +03:00
Remove extraneous blank lines before block-closing braces
These are useless and distracting. We wouldn't have written the code with them to begin with, so there's no reason to keep them. Author: Justin Pryzby <pryzby@telsasoft.com> Discussion: https://postgr.es/m/20220411020336.GB26620@telsasoft.com Discussion: https://postgr.es/m/attachment/133167/0016-Extraneous-blank-lines.patch
This commit is contained in:
@@ -115,7 +115,6 @@ cx(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring,
|
||||
for (i = 0; i < num_gene; i++)
|
||||
if (tour1[i] != offspring[i])
|
||||
num_diffs++;
|
||||
|
||||
}
|
||||
|
||||
return num_diffs;
|
||||
|
@@ -222,11 +222,9 @@ gimme_tour(PlannerInfo *root, Edge *edge_table, Gene *new_gene, int num_gene)
|
||||
|
||||
/* mark this node as incorporated */
|
||||
edge_table[(int) new_gene[i - 1]].unused_edges = -1;
|
||||
|
||||
} /* for (i=1; i<num_gene; i++) */
|
||||
|
||||
return edge_failures;
|
||||
|
||||
}
|
||||
|
||||
/* remove_gene
|
||||
@@ -337,7 +335,6 @@ gimme_gene(PlannerInfo *root, Edge edge, Edge *edge_table)
|
||||
elog(ERROR, "minimum_count not set");
|
||||
else if (edge_table[(int) friend].unused_edges == minimum_edges)
|
||||
minimum_count++;
|
||||
|
||||
} /* for (i=0; i<edge.unused_edges; i++) */
|
||||
|
||||
|
||||
|
@@ -89,7 +89,6 @@ ox1(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene,
|
||||
}
|
||||
p = (p + 1) % num_gene; /* increment tour2-index */
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
#endif /* defined(OX1) */
|
||||
|
@@ -106,7 +106,6 @@ ox2(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene,
|
||||
/* city isn't used yet, so inherit from tour2 */
|
||||
offspring[k] = tour2[k];
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
#endif /* defined(OX2) */
|
||||
|
@@ -131,7 +131,6 @@ pmx(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene)
|
||||
|
||||
j++;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
if (!(found))
|
||||
@@ -140,7 +139,6 @@ pmx(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene)
|
||||
indx[mx_fail] = k;
|
||||
mx_fail++;
|
||||
}
|
||||
|
||||
} /* ... for */
|
||||
|
||||
|
||||
@@ -172,9 +170,7 @@ pmx(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene)
|
||||
|
||||
j++;
|
||||
}
|
||||
|
||||
} /* ... for */
|
||||
|
||||
} /* ... if */
|
||||
|
||||
|
||||
@@ -206,12 +202,10 @@ pmx(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene)
|
||||
|
||||
j++;
|
||||
}
|
||||
|
||||
} /* ... if */
|
||||
|
||||
i++;
|
||||
} /* end while */
|
||||
|
||||
}
|
||||
} /* ... for */
|
||||
|
||||
|
@@ -96,15 +96,12 @@ px(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene,
|
||||
{ /* next city in tour2 has been used */
|
||||
tour2_index++;
|
||||
}
|
||||
|
||||
}
|
||||
else
|
||||
{ /* next position in offspring is filled */
|
||||
offspring_index++;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
#endif /* defined(PX) */
|
||||
|
@@ -6848,7 +6848,6 @@ create_partial_grouping_paths(PlannerInfo *root,
|
||||
dNumPartialGroups));
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
if (can_sort && cheapest_partial_path != NULL)
|
||||
|
Reference in New Issue
Block a user