mirror of
https://github.com/postgres/postgres.git
synced 2025-12-06 00:02:13 +03:00
c7b8998ebb
Change pg_bsd_indent to follow upstream rules for placement of comments
to the right of code, and remove pgindent hack that caused comments
following #endif to not obey the general rule.
Commit e3860ffa4d wasn't actually using
the published version of pg_bsd_indent, but a hacked-up version that
tried to minimize the amount of movement of comments to the right of
code. The situation of interest is where such a comment has to be
moved to the right of its default placement at column 33 because there's
code there. BSD indent has always moved right in units of tab stops
in such cases --- but in the previous incarnation, indent was working
in 8-space tab stops, while now it knows we use 4-space tabs. So the
net result is that in about half the cases, such comments are placed
one tab stop left of before. This is better all around: it leaves
more room on the line for comment text, and it means that in such
cases the comment uniformly starts at the next 4-space tab stop after
the code, rather than sometimes one and sometimes two tabs after.
Also, ensure that comments following #endif are indented the same
as comments following other preprocessor commands such as #else.
That inconsistency turns out to have been self-inflicted damage
from a poorly-thought-through post-indent "fixup" in pgindent.
This patch is much less interesting than the first round of indent
changes, but also bulkier, so I thought it best to separate the effects.
Discussion: https://postgr.es/m/E1dAmxK-0006EE-1r@gemulon.postgresql.org
Discussion: https://postgr.es/m/30527.1495162840@sss.pgh.pa.us
133 lines
2.7 KiB
C
133 lines
2.7 KiB
C
/*------------------------------------------------------------------------
|
|
*
|
|
* geqo_misc.c
|
|
* misc. printout and debug stuff
|
|
*
|
|
* Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* src/backend/optimizer/geqo/geqo_misc.c
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
|
|
/* contributed by:
|
|
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
|
|
* Martin Utesch * Institute of Automatic Control *
|
|
= = University of Mining and Technology =
|
|
* utesch@aut.tu-freiberg.de * Freiberg, Germany *
|
|
=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
|
|
*/
|
|
|
|
#include "postgres.h"
|
|
|
|
#include "optimizer/geqo_misc.h"
|
|
|
|
|
|
#ifdef GEQO_DEBUG
|
|
|
|
|
|
/*
|
|
* avg_pool
|
|
*/
|
|
static double
|
|
avg_pool(Pool *pool)
|
|
{
|
|
int i;
|
|
double cumulative = 0.0;
|
|
|
|
if (pool->size <= 0)
|
|
elog(ERROR, "pool_size is zero");
|
|
|
|
/*
|
|
* Since the pool may contain multiple occurrences of DBL_MAX, divide by
|
|
* pool->size before summing, not after, to avoid overflow. This loses a
|
|
* little in speed and accuracy, but this routine is only used for debug
|
|
* printouts, so we don't care that much.
|
|
*/
|
|
for (i = 0; i < pool->size; i++)
|
|
cumulative += pool->data[i].worth / pool->size;
|
|
|
|
return cumulative;
|
|
}
|
|
|
|
/* print_pool
|
|
*/
|
|
void
|
|
print_pool(FILE *fp, Pool *pool, int start, int stop)
|
|
{
|
|
int i,
|
|
j;
|
|
|
|
/* be extra careful that start and stop are valid inputs */
|
|
|
|
if (start < 0)
|
|
start = 0;
|
|
if (stop > pool->size)
|
|
stop = pool->size;
|
|
|
|
if (start + stop > pool->size)
|
|
{
|
|
start = 0;
|
|
stop = pool->size;
|
|
}
|
|
|
|
for (i = start; i < stop; i++)
|
|
{
|
|
fprintf(fp, "%d)\t", i);
|
|
for (j = 0; j < pool->string_length; j++)
|
|
fprintf(fp, "%d ", pool->data[i].string[j]);
|
|
fprintf(fp, "%g\n", pool->data[i].worth);
|
|
}
|
|
|
|
fflush(fp);
|
|
}
|
|
|
|
/* print_gen
|
|
*
|
|
* printout for chromosome: best, worst, mean, average
|
|
*/
|
|
void
|
|
print_gen(FILE *fp, Pool *pool, int generation)
|
|
{
|
|
int lowest;
|
|
|
|
/* Get index to lowest ranking gene in poplulation. */
|
|
/* Use 2nd to last since last is buffer. */
|
|
lowest = pool->size > 1 ? pool->size - 2 : 0;
|
|
|
|
fprintf(fp,
|
|
"%5d | Best: %g Worst: %g Mean: %g Avg: %g\n",
|
|
generation,
|
|
pool->data[0].worth,
|
|
pool->data[lowest].worth,
|
|
pool->data[pool->size / 2].worth,
|
|
avg_pool(pool));
|
|
|
|
fflush(fp);
|
|
}
|
|
|
|
|
|
void
|
|
print_edge_table(FILE *fp, Edge *edge_table, int num_gene)
|
|
{
|
|
int i,
|
|
j;
|
|
|
|
fprintf(fp, "\nEDGE TABLE\n");
|
|
|
|
for (i = 1; i <= num_gene; i++)
|
|
{
|
|
fprintf(fp, "%d :", i);
|
|
for (j = 0; j < edge_table[i].unused_edges; j++)
|
|
fprintf(fp, " %d", edge_table[i].edge_list[j]);
|
|
fprintf(fp, "\n");
|
|
}
|
|
|
|
fprintf(fp, "\n");
|
|
|
|
fflush(fp);
|
|
}
|
|
|
|
#endif /* GEQO_DEBUG */
|