ZYM/STLite-ACM-2024
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

finish writing and prepare to fix bugs

Browse Source
This commit is contained in:
ZhuangYumin
2024-03-26 12:53:48 +00:00
parent 237d44c3da
commit 8f169ca426
3 changed files with 73 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
map/src/map.hpp
View File

@ -243,7 +243,7 @@ class map {
successor->color = color_of_node;
if (parent_of_successor == node) {
successor->left = left_of_node;
successor->right = right_of_node;
successor->right = node;
successor->SetChildrensParent();
successor->parent = parent_of_node;
path_of_node = successor;
@ -264,8 +264,8 @@ class map {
}
}
void DeleteFixUp(RedBlackTreeNodeType *&tree_root) {
assert(this->left == nullptr && this->right == nullptr);
assert(this->color == RedBlackTreeColorType::BLACK);
if (this == tree_root) return;
RedBlackTreeNodeType *sibling = GetSibling();
assert(sibling != nullptr);
if (sibling->color == RedBlackTreeColorType::RED) {
@ -294,8 +294,6 @@ class map {
(distant_nephew == nullptr ||
distant_nephew != nullptr && distant_nephew->color == RedBlackTreeColorType::BLACK)) {
// Case 2
assert(close_nephew == nullptr);
assert(distant_nephew == nullptr);
sibling->color = RedBlackTreeColorType::RED;
this->parent->color = RedBlackTreeColorType::BLACK;
return;
@ -305,8 +303,6 @@ class map {
(distant_nephew == nullptr ||
distant_nephew != nullptr && distant_nephew->color == RedBlackTreeColorType::BLACK)) {
// Case 3
assert(close_nephew == nullptr);
assert(distant_nephew == nullptr);
sibling->color = RedBlackTreeColorType::RED;
this->parent->DeleteFixUp(tree_root);
return;
@ -328,13 +324,11 @@ class map {
assert(distant_nephew != nullptr && distant_nephew->color == RedBlackTreeColorType::RED);
// Then it must be Case 5
if (this == parent->left) {
sibling->color = parent->color;
parent->color = RedBlackTreeColorType::BLACK;
std::swap(sibling->color, parent->color);
distant_nephew->color = RedBlackTreeColorType::BLACK;
parent->RotateLeft(tree_root);
} else {
sibling->color = parent->color;
parent->color = RedBlackTreeColorType::BLACK;
std::swap(sibling->color, parent->color);
distant_nephew->color = RedBlackTreeColorType::BLACK;
parent->RotateRight(tree_root);
}
@ -351,7 +345,7 @@ class map {
RedBlackTreeNodeType *successor = pos->right;
while (successor->left != nullptr) successor = successor->left;
SwapNodeWithItsSuccessor(pos, successor, tree_root);
DeleteNode(successor, tree_root);
DeleteNode(pos, tree_root);
return;
}
if (pos->left == nullptr && pos->right == nullptr) {