Skip to content

Commit 2d62517

Browse files
committed
Plural of modulus is moduli
1 parent e5dcbb8 commit 2d62517

File tree

2 files changed

+4
-4
lines changed

2 files changed

+4
-4
lines changed

src/backend/partitioning/partbounds.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -130,7 +130,7 @@ partition_bounds_equal(int partnatts, int16 *parttyplen, bool *parttypbyval,
130130
return false;
131131

132132
/*
133-
* We arrange the partitions in the ascending order of their modulus
133+
* We arrange the partitions in the ascending order of their moduli
134134
* and remainders. Also every modulus is factor of next larger
135135
* modulus. Therefore we can safely store index of a given partition
136136
* in indexes array at remainder of that partition. Also entries at
@@ -744,7 +744,7 @@ check_default_allows_bound(Relation parent, Relation default_rel,
744744
*
745745
* Returns the greatest modulus of the hash partition bound. The greatest
746746
* modulus will be at the end of the datums array because hash partitions are
747-
* arranged in the ascending order of their modulus and remainders.
747+
* arranged in the ascending order of their moduli and remainders.
748748
*/
749749
int
750750
get_hash_partition_greatest_modulus(PartitionBoundInfo bound)
@@ -912,7 +912,7 @@ partition_rbound_datum_cmp(FmgrInfo *partsupfunc, Oid *partcollation,
912912
/*
913913
* partition_hbound_cmp
914914
*
915-
* Compares modulus first, then remainder if modulus are equal.
915+
* Compares modulus first, then remainder if modulus is equal.
916916
*/
917917
int32
918918
partition_hbound_cmp(int modulus1, int remainder1, int modulus2, int remainder2)

src/backend/utils/cache/partcache.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -612,7 +612,7 @@ RelationBuildPartitionDesc(Relation rel)
612612
{
613613
case PARTITION_STRATEGY_HASH:
614614
{
615-
/* Modulus are stored in ascending order */
615+
/* Moduli are stored in ascending order */
616616
int greatest_modulus = hbounds[ndatums - 1]->modulus;
617617

618618
boundinfo->indexes = (int *) palloc(greatest_modulus *

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy