mirror of
https://github.com/postgres/postgres.git
synced 2025-11-12 05:01:15 +03:00
Fix typos in comments.
Thom Brown
This commit is contained in:
@@ -933,7 +933,7 @@ keyGetItem(GinState *ginstate, MemoryContext tempCtx, GinScanKey key,
|
||||
/*
|
||||
* Ok, we now know that there are no matches < minItem.
|
||||
*
|
||||
* If minItem is lossy, it means that there there were no exact items on
|
||||
* If minItem is lossy, it means that there were no exact items on
|
||||
* the page among requiredEntries, because lossy pointers sort after exact
|
||||
* items. However, there might be exact items for the same page among
|
||||
* additionalEntries, so we mustn't advance past them.
|
||||
|
||||
@@ -10,7 +10,7 @@
|
||||
* a GIN scan can apply various optimizations, if it can determine that an
|
||||
* item matches or doesn't match, even if it doesn't know if some of the keys
|
||||
* are present or not. Hence, it's useful to have a ternary-logic consistent
|
||||
* function, where where each key can be TRUE (present), FALSE (not present),
|
||||
* function, where each key can be TRUE (present), FALSE (not present),
|
||||
* or MAYBE (don't know if present). This file provides such a ternary-logic
|
||||
* consistent function, implemented by calling the regular boolean consistent
|
||||
* function many times, with all the MAYBE arguments set to all combinations
|
||||
|
||||
Reference in New Issue
Block a user