diff options
Diffstat (limited to 'src/backend/utils/adt')
-rw-r--r-- | src/backend/utils/adt/jsonpath_exec.c | 4 | ||||
-rw-r--r-- | src/backend/utils/adt/multirangetypes.c | 2 | ||||
-rw-r--r-- | src/backend/utils/adt/selfuncs.c | 2 |
3 files changed, 4 insertions, 4 deletions
diff --git a/src/backend/utils/adt/jsonpath_exec.c b/src/backend/utils/adt/jsonpath_exec.c index 4daf1a68d9d..8a0a2dbc850 100644 --- a/src/backend/utils/adt/jsonpath_exec.c +++ b/src/backend/utils/adt/jsonpath_exec.c @@ -4221,7 +4221,7 @@ JsonTableSetDocument(TableFuncScanState *state, Datum value) } /* - * Evaluate a JsonTablePlan's jsonpath to get a new row pattren from + * Evaluate a JsonTablePlan's jsonpath to get a new row pattern from * the given context item */ static void @@ -4339,7 +4339,7 @@ JsonTablePlanScanNextRow(JsonTablePlanState *planstate) /* * Now fetch the nested plan's current row to be joined against the * parent row. Any further nested plans' paths will be re-evaluated - * reursively, level at a time, after setting each nested plan's + * recursively, level at a time, after setting each nested plan's * current row. */ (void) JsonTablePlanNextRow(planstate->nested); diff --git a/src/backend/utils/adt/multirangetypes.c b/src/backend/utils/adt/multirangetypes.c index 8f12c953cad..558c6c18c34 100644 --- a/src/backend/utils/adt/multirangetypes.c +++ b/src/backend/utils/adt/multirangetypes.c @@ -330,7 +330,7 @@ multirange_out(PG_FUNCTION_ARGS) } /* - * Binary representation: First a int32-sized count of ranges, followed by + * Binary representation: First an int32-sized count of ranges, followed by * ranges in their native binary representation. */ Datum diff --git a/src/backend/utils/adt/selfuncs.c b/src/backend/utils/adt/selfuncs.c index 35f8f306ee4..5f5d7959d8e 100644 --- a/src/backend/utils/adt/selfuncs.c +++ b/src/backend/utils/adt/selfuncs.c @@ -6968,7 +6968,7 @@ btcostestimate(PlannerInfo *root, IndexPath *path, double loop_count, * btree scans, making the top-level scan look like a continuous scan * (as opposed to num_sa_scans-many primitive index scans). After * all, btree scans mostly work like that at runtime. However, such a - * scheme would badly bias genericcostestimate's simplistic appraoch + * scheme would badly bias genericcostestimate's simplistic approach * to calculating numIndexPages through prorating. * * Stick with the approach taken by non-native SAOP scans for now. |