mirror of
https://github.com/postgres/postgres.git
synced 2025-06-13 07:41:39 +03:00
pgindent run for 9.4
This includes removing tabs after periods in C comments, which was applied to back branches, so this change should not effect backpatching.
This commit is contained in:
@ -126,7 +126,7 @@ ExecHashJoin(HashJoinState *node)
|
||||
* check this when the outer relation's startup cost is less
|
||||
* than the projected cost of building the hash table.
|
||||
* Otherwise it's best to build the hash table first and see
|
||||
* if the inner relation is empty. (When it's a left join, we
|
||||
* if the inner relation is empty. (When it's a left join, we
|
||||
* should always make this check, since we aren't going to be
|
||||
* able to skip the join on the strength of an empty inner
|
||||
* relation anyway.)
|
||||
@ -530,7 +530,7 @@ ExecInitHashJoin(HashJoin *node, EState *estate, int eflags)
|
||||
* tuple slot of the Hash node (which is our inner plan). we can do this
|
||||
* because Hash nodes don't return tuples via ExecProcNode() -- instead
|
||||
* the hash join node uses ExecScanHashBucket() to get at the contents of
|
||||
* the hash table. -cim 6/9/91
|
||||
* the hash table. -cim 6/9/91
|
||||
*/
|
||||
{
|
||||
HashState *hashstate = (HashState *) innerPlanState(hjstate);
|
||||
@ -896,7 +896,7 @@ ExecHashJoinSaveTuple(MinimalTuple tuple, uint32 hashvalue,
|
||||
|
||||
/*
|
||||
* ExecHashJoinGetSavedTuple
|
||||
* read the next tuple from a batch file. Return NULL if no more.
|
||||
* read the next tuple from a batch file. Return NULL if no more.
|
||||
*
|
||||
* On success, *hashvalue is set to the tuple's hash value, and the tuple
|
||||
* itself is stored in the given slot.
|
||||
|
Reference in New Issue
Block a user