database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-12-21 05:21:08 +03:00
Code Activity

Fix typos in comments and in one isolation test.

Browse Source 
Dagfinn Ilmari Mannsåker, reviewed by Shubham Khanna. Some subtractions
by me.

Discussion: http://postgr.es/m/87le9fmi01.fsf@wibble.ilmari.org
This commit is contained in:
Robert Haas
2024-01-02 11:56:02 -05:00
parent 5c430f9dc5
commit 0d9937d118
29 changed files with 45 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/backend/utils/adt/rangetypes.c
View File

@@ -2608,7 +2608,7 @@ range_contains_elem_internal(TypeCacheEntry *typcache, const RangeType *r, Datum
* values into a range object. They are modeled after heaptuple.c's
* heap_compute_data_size() and heap_fill_tuple(), but we need not handle
* null values here. TYPE_IS_PACKABLE must test the same conditions as
* heaptuple.c's ATT_IS_PACKABLE macro. See the comments thare for more
* heaptuple.c's ATT_IS_PACKABLE macro. See the comments there for more
* details.
*/

10
src/backend/utils/sort/tuplesortvariants.c
View File

@@ -93,7 +93,7 @@ static void readtup_datum(Tuplesortstate *state, SortTuple *stup,
static void freestate_cluster(Tuplesortstate *state);
/*
* Data struture pointed by "TuplesortPublic.arg" for the CLUSTER case. Set by
* Data structure pointed by "TuplesortPublic.arg" for the CLUSTER case. Set by
* the tuplesort_begin_cluster.
*/
typedef struct
@@ -105,7 +105,7 @@ typedef struct
} TuplesortClusterArg;
/*
* Data struture pointed by "TuplesortPublic.arg" for the IndexTuple case.
* Data structure pointed by "TuplesortPublic.arg" for the IndexTuple case.
* Set by tuplesort_begin_index_xxx and used only by the IndexTuple routines.
*/
typedef struct
@@ -115,7 +115,7 @@ typedef struct
} TuplesortIndexArg;
/*
* Data struture pointed by "TuplesortPublic.arg" for the index_btree subcase.
* Data structure pointed by "TuplesortPublic.arg" for the index_btree subcase.
*/
typedef struct
{
@@ -126,7 +126,7 @@ typedef struct
} TuplesortIndexBTreeArg;
/*
* Data struture pointed by "TuplesortPublic.arg" for the index_hash subcase.
* Data structure pointed by "TuplesortPublic.arg" for the index_hash subcase.
*/
typedef struct
{
@@ -138,7 +138,7 @@ typedef struct
} TuplesortIndexHashArg;
/*
* Data struture pointed by "TuplesortPublic.arg" for the Datum case.
* Data structure pointed by "TuplesortPublic.arg" for the Datum case.
* Set by tuplesort_begin_datum and used only by the DatumTuple routines.
*/
typedef struct

2
src/backend/utils/time/combocid.c
View File

@@ -4,7 +4,7 @@
* Combo command ID support routines
*
* Before version 8.3, HeapTupleHeaderData had separate fields for cmin
* and cmax. To reduce the header size, cmin and cmax are now overlayed
* and cmax. To reduce the header size, cmin and cmax are now overlaid
* in the same field in the header. That usually works because you rarely
* insert and delete a tuple in the same transaction, and we don't need
* either field to remain valid after the originating transaction exits.