database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-12-16 16:42:29 +03:00
Code Activity

Fix typos in comments.

Browse Source 
Backpatch to all supported versions, where applicable, to make backpatching
of future fixes go more smoothly.

Josh Soref

Discussion: https://www.postgresql.org/message-id/CACZqfqCf+5qRztLPgmmosr-B0Ye4srWzzw_mo4c_8_B_mtjmJQ@mail.gmail.com
This commit is contained in:
Heikki Linnakangas
2017-02-06 11:33:58 +02:00
parent 9863017b87
commit 181bdb90ba
137 changed files with 195 additions and 195 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/include/lib/simplehash.h
View File

@@ -345,7 +345,7 @@ SH_GROW(SH_TYPE *tb, uint32 newsize)
* we need. We neither want tb->members increased, nor do we need to do
* deal with deleted elements, nor do we need to compare keys. So a
* special-cased implementation is lot faster. As resizing can be time
* consuming and frequent, that's worthwile to optimize.
* consuming and frequent, that's worthwhile to optimize.
*
* To be able to simply move entries over, we have to start not at the
* first bucket (i.e olddata[0]), but find the first bucket that's either
@@ -620,7 +620,7 @@ SH_DELETE(SH_TYPE *tb, SH_KEY_TYPE key)
/*
* Backward shift following elements till either an empty element
* or an element at its optimal position is encounterered.
* or an element at its optimal position is encountered.
*
* While that sounds expensive, the average chain length is short,
* and deletions would otherwise require toombstones.