@@ -256,7 +256,7 @@ SH_PREV(SH_TYPE *tb, uint32 curelem, uint32 startelem)
256
256
return curelem ;
257
257
}
258
258
259
- /* return distance between bucket and it's optimal position */
259
+ /* return distance between bucket and its optimal position */
260
260
static inline uint32
261
261
SH_DISTANCE_FROM_OPTIMAL (SH_TYPE * tb , uint32 optimal , uint32 bucket )
262
262
{
@@ -349,7 +349,7 @@ SH_GROW(SH_TYPE *tb, uint32 newsize)
349
349
*
350
350
* To be able to simply move entries over, we have to start not at the
351
351
* first bucket (i.e olddata[0]), but find the first bucket that's either
352
- * empty, or is occupied by an entry at it's optimal position. Such a
352
+ * empty, or is occupied by an entry at its optimal position. Such a
353
353
* bucket has to exist in any table with a load factor under 1, as not all
354
354
* buckets are occupied, i.e. there always has to be an empty bucket. By
355
355
* starting at such a bucket we can move the entries to the larger table,
@@ -485,9 +485,9 @@ SH_INSERT(SH_TYPE *tb, SH_KEY_TYPE key, bool *found)
485
485
/*
486
486
* If the bucket is not empty, we either found a match (in which case
487
487
* we're done), or we have to decide whether to skip over or move the
488
- * colliding entry. When the the colliding elements distance to it's
488
+ * colliding entry. When the colliding element's distance to its
489
489
* optimal position is smaller than the to-be-inserted entry's, we
490
- * shift the colliding entry (and it's followers) forward by one.
490
+ * shift the colliding entry (and its followers) forward by one.
491
491
*/
492
492
493
493
if (SH_COMPARE_KEYS (tb , hash , key , entry ))
0 commit comments