diff options
| author | Peter Geoghegan <pg@bowt.ie> | 2019-03-29 12:29:05 -0700 |
|---|---|---|
| committer | Peter Geoghegan <pg@bowt.ie> | 2019-03-29 12:29:05 -0700 |
| commit | 9c7fb7e6d8d0fdcabbdc32daad2159812e538bd5 (patch) | |
| tree | 55ac5476b8ef9640ee4b319c2b704b6426862993 /src/include | |
| parent | d85e0f366a347633f255b8d1031ab34733c5e147 (diff) | |
| download | postgresql-9c7fb7e6d8d0fdcabbdc32daad2159812e538bd5.tar.gz postgresql-9c7fb7e6d8d0fdcabbdc32daad2159812e538bd5.zip | |
Tweak some nbtree-related code comments.
Diffstat (limited to 'src/include')
| -rw-r--r-- | src/include/access/nbtree.h | 11 |
1 files changed, 5 insertions, 6 deletions
diff --git a/src/include/access/nbtree.h b/src/include/access/nbtree.h index 473c6f29185..a1ffa983365 100644 --- a/src/include/access/nbtree.h +++ b/src/include/access/nbtree.h @@ -219,7 +219,6 @@ typedef struct BTMetaPageData #define P_FIRSTDATAKEY(opaque) (P_RIGHTMOST(opaque) ? P_HIKEY : P_FIRSTKEY) /* - * * Notes on B-Tree tuple format, and key and non-key attributes: * * INCLUDE B-Tree indexes have non-key attributes. These are extra @@ -321,7 +320,7 @@ typedef struct BTMetaPageData /* * Get/set number of attributes within B-tree index tuple. * - * Note that this does not include an implicit tiebreaker heap-TID + * Note that this does not include an implicit tiebreaker heap TID * attribute, if any. Note also that the number of key attributes must be * explicitly represented in all heapkeyspace pivot tuples. */ @@ -424,10 +423,10 @@ typedef struct BTStackData typedef BTStackData *BTStack; /* - * BTScanInsert is the btree-private state needed to find an initial position - * for an indexscan, or to insert new tuples -- an "insertion scankey" (not to - * be confused with a search scankey). It's used to descend a B-Tree using - * _bt_search. + * BTScanInsertData is the btree-private state needed to find an initial + * position for an indexscan, or to insert new tuples -- an "insertion + * scankey" (not to be confused with a search scankey). It's used to descend + * a B-Tree using _bt_search. * * heapkeyspace indicates if we expect all keys in the index to be physically * unique because heap TID is used as a tiebreaker attribute, and if index may |