diff options
author | Linus Groh <mail@linusgroh.de> | 2021-04-18 10:30:03 +0200 |
---|---|---|
committer | Linus Groh <mail@linusgroh.de> | 2021-04-18 10:30:03 +0200 |
commit | 2b0c361d04b519b20bfb70a34c07de579a93fafd (patch) | |
tree | f2a4d12d02801fe5bd0abf1ac2c068b540d75a45 /AK | |
parent | cebd3f740b6fd2fd0da30ed92310a968cf6df44a (diff) | |
download | serenity-2b0c361d04b519b20bfb70a34c07de579a93fafd.zip |
Everywhere: Fix a bunch of typos
Diffstat (limited to 'AK')
-rw-r--r-- | AK/RedBlackTree.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/AK/RedBlackTree.h b/AK/RedBlackTree.h index 71cb428856..98691540ce 100644 --- a/AK/RedBlackTree.h +++ b/AK/RedBlackTree.h @@ -233,7 +233,7 @@ protected: m_minimum = successor(node); // removal assumes the node has 0 or 1 child, so if we have 2, relink with the successor first (by definition the successor has no left child) - // FIXME: since we dont know how a value is represented in the node, we cant simply swap the values and keys, and instead we relink the nodes + // FIXME: since we dont know how a value is represented in the node, we can't simply swap the values and keys, and instead we relink the nodes // 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 @@ -352,7 +352,7 @@ protected: } parent = node->parent; } - node->color = Color::Black; // by this point node cant be null + node->color = Color::Black; // by this point node can't be null } static Node* successor(Node* node) |