docs/Writerside/topics/hash_map.h.md

changeset 1424
563033aa998c
parent 1318
12fa1d37fe48
--- a/docs/Writerside/topics/hash_map.h.md	Sat Oct 11 15:42:48 2025 +0200
+++ b/docs/Writerside/topics/hash_map.h.md	Sun Oct 12 20:21:56 2025 +0200
@@ -1,6 +1,6 @@
 # Hash Map
 
-UCX provides a basic hash map implementation with a configurable amount of buckets.
+UCX provides a basic hash map implementation with a configurable number of buckets.
 If you do not specify the number of buckets, a default of 16 buckets will be used.
 
 You can always rehash the map with `cxMapRehash()` to change the number of buckets to something more efficient,
@@ -28,11 +28,11 @@
 pointers instead of actual items.
 
 If you pass zero for the number of `buckets`, or use `cxHashMapSimple()`,
-the map is initialized with a default of 16 buckets, otherwise the specified number of buckets is allocated.
+the map is initialized with a default of 16 buckets; otherwise the specified number of buckets is allocated.
 
 The function `cxMapRehash()` allocates a new array of buckets and re-distributes all elements,
 if the number of elements exceeds ¾ of the number of buckets.
-Otherwise, no action is performed and this function simply returns 0.
+Otherwise, no action is performed, and this function simply returns 0.
 After rehashing, the number of buckets is at least 2½ times the number of elements.
 
 > Advice if you want to create your own hash map structures:

mercurial