Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
P
postgres-lambda-diff
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Jakob Huber
postgres-lambda-diff
Commits
7e94998c
Commit
7e94998c
authored
20 years ago
by
Tom Lane
Browse files
Options
Downloads
Patches
Plain Diff
Adjust out-of-date comment.
parent
2ef172a2
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/backend/utils/hash/dynahash.c
+5
-6
5 additions, 6 deletions
src/backend/utils/hash/dynahash.c
with
5 additions
and
6 deletions
src/backend/utils/hash/dynahash.c
+
5
−
6
View file @
7e94998c
...
...
@@ -9,7 +9,7 @@
*
*
* IDENTIFICATION
* $PostgreSQL: pgsql/src/backend/utils/hash/dynahash.c,v 1.
59
2005/05/
0
6 00:19:
1
4 tgl Exp $
* $PostgreSQL: pgsql/src/backend/utils/hash/dynahash.c,v 1.
60
2005/05/
1
6 00:19:
0
4 tgl Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -747,11 +747,10 @@ hash_seq_search(HASH_SEQ_STATUS *status)
segp
=
hashp
->
dir
[
segment_num
];
/*
* Pick up the first item in this bucket's chain. If chain is
* not empty we can go back around the outer loop to search it.
* Otherwise we have to advance to find the next nonempty bucket.
* We try to optimize that case since searching a near-empty
* hashtable has to iterate this loop a lot.
* Pick up the first item in this bucket's chain. If chain is not empty
* we can begin searching it. Otherwise we have to advance to find the
* next nonempty bucket. We try to optimize that case since searching a
* near-empty hashtable has to iterate this loop a lot.
*/
while
((
curElem
=
segp
[
segment_ndx
])
==
NULL
)
{
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment