database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-02 09:02:37 +03:00
Code Activity

pgindent run for 9.5

Browse Source
This commit is contained in:
Bruce Momjian
2015-05-23 21:35:49 -04:00
parent 225892552b
commit 807b9e0dff
414 changed files with 5810 additions and 5308 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
src/backend/lib/bipartite_match.c
View File

@ -51,14 +51,14 @@ BipartiteMatch(int u_size, int v_size, short **adjacency)
while (hk_breadth_search(state))
{
int u;
int u;
for (u = 1; u <= u_size; ++u)
if (state->pair_uv[u] == 0)
if (hk_depth_search(state, u, 1))
state->matching++;
CHECK_FOR_INTERRUPTS(); /* just in case */
CHECK_FOR_INTERRUPTS(); /* just in case */
}
return state;
@ -108,18 +108,18 @@ hk_breadth_search(BipartiteMatchState *state)
if (distance[u] < distance[0])
{
short *u_adj = state->adjacency[u];
int i = u_adj ? u_adj[0] : 0;
short *u_adj = state->adjacency[u];
int i = u_adj ? u_adj[0] : 0;
for (; i > 0; --i)
{
int u_next = state->pair_vu[u_adj[i]];
int u_next = state->pair_vu[u_adj[i]];
if (isinf(distance[u_next]))
{
distance[u_next] = 1 + distance[u];
queue[qhead++] = u_next;
Assert(qhead <= usize+2);
Assert(qhead <= usize + 2);
}
}
}
@ -145,11 +145,11 @@ hk_depth_search(BipartiteMatchState *state, int u, int depth)
for (; i > 0; --i)
{
int v = u_adj[i];
int v = u_adj[i];
if (distance[pair_vu[v]] == distance[u] + 1)
{
if (hk_depth_search(state, pair_vu[v], depth+1))
if (hk_depth_search(state, pair_vu[v], depth + 1))
{
pair_vu[v] = u;
pair_uv[u] = v;

6
src/backend/lib/hyperloglog.c
View File

@ -153,7 +153,7 @@ estimateHyperLogLog(hyperLogLogState *cState)
if (result <= (5.0 / 2.0) * cState->nRegisters)
{
/* Small range correction */
int zero_count = 0;
int zero_count = 0;
for (i = 0; i < cState->nRegisters; i++)
{
@ -183,7 +183,7 @@ estimateHyperLogLog(hyperLogLogState *cState)
void
mergeHyperLogLog(hyperLogLogState *cState, const hyperLogLogState *oState)
{
int r;
int r;
if (cState->nRegisters != oState->nRegisters)
elog(ERROR, "number of registers mismatch: %zu != %zu",
@ -216,7 +216,7 @@ mergeHyperLogLog(hyperLogLogState *cState, const hyperLogLogState *oState)
static inline uint8
rho(uint32 x, uint8 b)
{
uint8 j = 1;
uint8 j = 1;
while (j <= b && !(x & 0x80000000))
{

4
src/backend/lib/pairingheap.c
View File

@ -295,7 +295,7 @@ merge_children(pairingheap *heap, pairingheap_node *children)
static void
pairingheap_dump_recurse(StringInfo buf,
pairingheap_node *node,
void (*dumpfunc) (pairingheap_node *node, StringInfo buf, void *opaque),
void (*dumpfunc) (pairingheap_node *node, StringInfo buf, void *opaque),
void *opaque,
int depth,
pairingheap_node *prev_or_parent)
@ -316,7 +316,7 @@ pairingheap_dump_recurse(StringInfo buf,
char *
pairingheap_dump(pairingheap *heap,
void (*dumpfunc) (pairingheap_node *node, StringInfo buf, void *opaque),
void (*dumpfunc) (pairingheap_node *node, StringInfo buf, void *opaque),
void *opaque)
{
StringInfoData buf;