RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-07-30 19:47:48 +00:00
Code Issues Activity Actions

Everywhere: Run spellcheck on all documentation

Browse source
This commit is contained in:
Ben Wiederhake 2023-05-06 16:28:34 +02:00 • committed by Jelle Raaijmakers
parent a7600caea1
commit ee47c0275e
15 changed files with 26 additions and 26 deletions
Download patch file Download diff file Expand all files Collapse all files

4
AK/HashTable.h
View file

@ -668,7 +668,7 @@ private:
// that we can still probe for buckets with collisions, and we automatically optimize the
// probe lengths. To do so, we shift the following buckets up until we reach a free bucket,
// or a bucket with a probe length of 0 (the ideal index for that bucket).
auto update_bucket_neighbours = [&](BucketType* bucket) {
auto update_bucket_neighbors = [&](BucketType* bucket) {
if constexpr (IsOrdered) {
if (bucket->previous)
bucket->previous->next = bucket;
@ -704,7 +704,7 @@ private:
shift_from_bucket->next = nullptr;
}
shift_to_bucket->state = bucket_state_for_probe_length(shift_from_probe_length - 1);
update_bucket_neighbours(shift_to_bucket);
update_bucket_neighbors(shift_to_bucket);
if (++shift_to_index == m_capacity) [[unlikely]]
shift_to_index = 0;

8
AK/RedBlackTree.h
View file

@ -243,9 +243,9 @@ protected:
// in place, this is quite a bit more expensive, as well as much less readable, is there a better way?
if (node->left_child && node->right_child) {
auto* successor_node = successor(node); // this is always non-null as all nodes besides the maximum node have a successor, and the maximum node has no right child
auto neighbour_swap = successor_node->parent == node;
auto neighbor_swap = successor_node->parent == node;
node->left_child->parent = successor_node;
if (!neighbour_swap)
if (!neighbor_swap)
node->right_child->parent = successor_node;
if (node->parent) {
if (node->parent->left_child == node) {
@ -258,7 +258,7 @@ protected:
}
if (successor_node->right_child)
successor_node->right_child->parent = node;
if (neighbour_swap) {
if (neighbor_swap) {
successor_node->parent = node->parent;
node->parent = successor_node;
} else {
@ -274,7 +274,7 @@ protected:
swap(node->parent, successor_node->parent);
}
swap(node->left_child, successor_node->left_child);
if (neighbour_swap) {
if (neighbor_swap) {
node->right_child = successor_node->right_child;
successor_node->right_child = node;
} else {