@@ -214,12 +214,12 @@ SH_COMPUTE_PARAMETERS(SH_TYPE * tb, uint32 newsize)
214214/* supporting zero sized hashes would complicate matters */
215215size = Max (newsize ,2 );
216216
217- /* round up size to the next power of 2, that'sthe bucketing works
217+ /* round up size to the next power of 2, that'show bucketing works */
218218size = sh_pow2 (size );
219219Assert (size <=SH_MAX_SIZE );
220220
221221/*
222- * Verify allocation of ->data is possible on platform, without
222+ * Verifythat allocation of ->data is possible on this platform, without
223223 * overflowing Size.
224224 */
225225if ((((uint64 )sizeof (SH_ELEMENT_TYPE ))* size ) >=MaxAllocHugeSize )
@@ -234,8 +234,8 @@ SH_COMPUTE_PARAMETERS(SH_TYPE * tb, uint32 newsize)
234234tb -> sizemask = tb -> size - 1 ;
235235
236236/*
237- * Computegrowth thresholdhere and after growing the table, to make
238- *computations during insert cheaper .
237+ * Computethe next thresholdat which we need to grow the hash table
238+ *again .
239239 */
240240if (tb -> size == SH_MAX_SIZE )
241241tb -> grow_threshold = ((double )tb -> size )* SH_MAX_FILLFACTOR ;
@@ -696,7 +696,7 @@ SH_DELETE(SH_TYPE * tb, SH_KEY_TYPE key)
696696 * or an element at its optimal position is encountered.
697697 *
698698 * While that sounds expensive, the average chain length is short,
699- * and deletions would otherwise requiretoombstones .
699+ * and deletions would otherwise requiretombstones .
700700 */
701701while (true)
702702{