summaryrefslogtreecommitdiff
path: root/absl/container/internal/raw_hash_set.h
diff options
context:
space:
mode:
authorGravatar Vertexwahn <julian.amann@tum.de>2023-04-24 20:13:05 +0200
committerGravatar Vertexwahn <julian.amann@tum.de>2023-04-24 21:25:50 +0200
commit421a74dce4c6f768bfcca94ba62b65ded1d50f7c (patch)
tree5eb2dcfa7d285ad9c8b9c67f33f8e20acf02ff7a /absl/container/internal/raw_hash_set.h
parent4ffaea74c1f5408e0757547a1ca0518ad43fa9f1 (diff)
Fix some spelling mistakes
Diffstat (limited to 'absl/container/internal/raw_hash_set.h')
-rw-r--r--absl/container/internal/raw_hash_set.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/absl/container/internal/raw_hash_set.h b/absl/container/internal/raw_hash_set.h
index f487e4d5..ada3f900 100644
--- a/absl/container/internal/raw_hash_set.h
+++ b/absl/container/internal/raw_hash_set.h
@@ -115,7 +115,7 @@
// starting with that index and extract potential candidates: occupied slots
// with a control byte equal to `H2(hash(x))`. If we find an empty slot in the
// group, we stop and return an error. Each candidate slot `y` is compared with
-// `x`; if `x == y`, we are done and return `&y`; otherwise we contine to the
+// `x`; if `x == y`, we are done and return `&y`; otherwise we continue to the
// next probe index. Tombstones effectively behave like full slots that never
// match the value we're looking for.
//
@@ -2456,7 +2456,7 @@ class raw_hash_set {
void rehash_and_grow_if_necessary() {
const size_t cap = capacity();
if (cap > Group::kWidth &&
- // Do these calcuations in 64-bit to avoid overflow.
+ // Do these calculations in 64-bit to avoid overflow.
size() * uint64_t{32} <= cap* uint64_t{25}) {
// Squash DELETED without growing if there is enough capacity.
//