mirrors/postgres
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix few typos and minor wordsmithing in tableam comments.

Browse Source 
Reported-by: Ashwin Agrawal
Author: Ashwin Agrawal
Reviewed-by: Amit Kapila
Backpatch-through: 12, where it was introduced
Discussion: https://postgr.es/m/CALfoeisgdZhYDrJOukaBzvXfJOK2FQ0szVMK7dzmcy6w93iDUA@mail.gmail.com
This commit is contained in:
Amit Kapila 2019-07-10 07:52:51 +05:30
parent f5825853e3
commit bd56cd75d2
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/include/access/tableam.h
View File

@ -434,8 +434,8 @@ typedef struct TableAmRoutine
* *
* Note that only the subset of the relcache filled by * Note that only the subset of the relcache filled by
* RelationBuildLocalRelation() can be relied upon and that the relation's * RelationBuildLocalRelation() can be relied upon and that the relation's
* catalog entries either will either not yet exist (new relation), or * catalog entries will either not yet exist (new relation), or will still
* will still reference the old relfilenode. * reference the old relfilenode.
* *
* As output *freezeXid, *minmulti must be set to the values appropriate * As output *freezeXid, *minmulti must be set to the values appropriate
* for pg_class.{relfrozenxid, relminmxid}. For AMs that don't need those * for pg_class.{relfrozenxid, relminmxid}. For AMs that don't need those
@ -591,7 +591,7 @@ typedef struct TableAmRoutine
* See table_relation_estimate_size(). * See table_relation_estimate_size().
* *
* While block oriented, it shouldn't be too hard for an AM that doesn't * While block oriented, it shouldn't be too hard for an AM that doesn't
* doesn't internally use blocks to convert into a usable representation. * internally use blocks to convert into a usable representation.
* *
* This differs from the relation_size callback by returning size * This differs from the relation_size callback by returning size
* estimates (both relation size and tuple count) for planning purposes, * estimates (both relation size and tuple count) for planning purposes,
@ -967,7 +967,7 @@ table_index_fetch_end(struct IndexFetchTableData *scan)
* *
* *all_dead, if all_dead is not NULL, will be set to true by * *all_dead, if all_dead is not NULL, will be set to true by
* table_index_fetch_tuple() iff it is guaranteed that no backend needs to see * table_index_fetch_tuple() iff it is guaranteed that no backend needs to see
* that tuple. Index AMs can use that do avoid returning that tid in future * that tuple. Index AMs can use that to avoid returning that tid in future
* searches. * searches.
* *
* The difference between this function and table_fetch_row_version is that * The difference between this function and table_fetch_row_version is that
@ -1014,8 +1014,8 @@ extern bool table_index_fetch_tuple_check(Relation rel,
* true, false otherwise. * true, false otherwise.
* *
* See table_index_fetch_tuple's comment about what the difference between * See table_index_fetch_tuple's comment about what the difference between
* these functions is. This function is the correct to use outside of * these functions is. It is correct to use this function outside of index
* index entry->table tuple lookups. * entry->table tuple lookups.
*/ */
static inline bool static inline bool
table_tuple_fetch_row_version(Relation rel, table_tuple_fetch_row_version(Relation rel,