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

Fix wording

Browse Source
This commit is contained in:
Peter Eisentraut 2021-08-06 20:55:59 +02:00
parent b406478b87
commit 05e60aece3
5 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
doc/src/sgml/rules.sgml
View File

@ -546,7 +546,7 @@ SELECT shoelace.sl_name, shoelace.sl_avail,
<para> <para>
Now we want to write a query that finds out for which shoes currently in the store Now we want to write a query that finds out for which shoes currently in the store
we have the matching shoelaces (color and length) and where the we have the matching shoelaces (color and length) and where the
total number of exactly matching pairs is greater or equal to two. total number of exactly matching pairs is greater than or equal to two.
<programlisting> <programlisting>
SELECT * FROM shoe_ready WHERE total_avail &gt;= 2; SELECT * FROM shoe_ready WHERE total_avail &gt;= 2;

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

@ -734,7 +734,7 @@ calc_hist_selectivity_scalar(TypeCacheEntry *typcache, const RangeBound *constbo
* *
* This function is used in scalar operator selectivity estimation. Another * This function is used in scalar operator selectivity estimation. Another
* goal of this function is to find a histogram bin where to stop * goal of this function is to find a histogram bin where to stop
* interpolation of portion of bounds which are less or equal to given bound. * interpolation of portion of bounds which are less than or equal to given bound.
*/ */
static int static int
rbound_bsearch(TypeCacheEntry *typcache, const RangeBound *value, const RangeBound *hist, rbound_bsearch(TypeCacheEntry *typcache, const RangeBound *value, const RangeBound *hist,

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

@ -622,7 +622,7 @@ calc_hist_selectivity_scalar(TypeCacheEntry *typcache, const RangeBound *constbo
* *
* This function is used in scalar operator selectivity estimation. Another * This function is used in scalar operator selectivity estimation. Another
* goal of this function is to find a histogram bin where to stop * goal of this function is to find a histogram bin where to stop
* interpolation of portion of bounds which are less or equal to given bound. * interpolation of portion of bounds which are less than or equal to given bound.
*/ */
static int static int
rbound_bsearch(TypeCacheEntry *typcache, const RangeBound *value, const RangeBound *hist, rbound_bsearch(TypeCacheEntry *typcache, const RangeBound *value, const RangeBound *hist,

6
src/backend/utils/adt/rangetypes_spgist.c
View File

@ -512,7 +512,7 @@ spg_range_quad_inner_consistent(PG_FUNCTION_ARGS)
/* /*
* Range A is overleft to range B if upper bound of A is * Range A is overleft to range B if upper bound of A is
* less or equal to upper bound of B. * less than or equal to upper bound of B.
*/ */
maxUpper = &upper; maxUpper = &upper;
break; break;
@ -531,7 +531,7 @@ spg_range_quad_inner_consistent(PG_FUNCTION_ARGS)
/* /*
* Range A is overright to range B if lower bound of A is * Range A is overright to range B if lower bound of A is
* greater or equal to lower bound of B. * greater than or equal to lower bound of B.
*/ */
minLower = &lower; minLower = &lower;
break; break;
@ -608,7 +608,7 @@ spg_range_quad_inner_consistent(PG_FUNCTION_ARGS)
/* /*
* Non-empty range A contains non-empty range B if lower * Non-empty range A contains non-empty range B if lower
* bound of A is lower or equal to lower bound of range B * bound of A is lower or equal to lower bound of range B
* and upper bound of range A is greater or equal to upper * and upper bound of range A is greater than or equal to upper
* bound of range A. * bound of range A.
* *
* All non-empty ranges contain an empty range. * All non-empty ranges contain an empty range.

4
src/bin/pg_resetwal/pg_resetwal.c
View File

@ -180,7 +180,7 @@ main(int argc, char *argv[])
} }
if (!TransactionIdIsNormal(set_oldest_xid)) if (!TransactionIdIsNormal(set_oldest_xid))
{ {
pg_log_error("oldest transaction ID (-u) must be greater or equal to %u", FirstNormalTransactionId); pg_log_error("oldest transaction ID (-u) must be greater than or equal to %u", FirstNormalTransactionId);
exit(1); exit(1);
} }
break; break;
@ -195,7 +195,7 @@ main(int argc, char *argv[])
} }
if (!TransactionIdIsNormal(set_xid)) if (!TransactionIdIsNormal(set_xid))
{ {
pg_log_error("transaction ID (-x) must be greater or equal to %u", FirstNormalTransactionId); pg_log_error("transaction ID (-x) must be greater than or equal to %u", FirstNormalTransactionId);
exit(1); exit(1);
} }
break; break;