Mercurial > hg > Gears > GearsAgda
annotate src/parallel_execution/rb_tree.c @ 189:39d87ba6039d
fix
| author | mir3636 |
|---|---|
| date | Fri, 16 Dec 2016 16:38:31 +0900 |
| parents | f9ed0b8f7132 |
| children | 119c035e0e36 |
| rev | line source |
|---|---|
| 86 | 1 #include <stdio.h> |
| 2 | |
| 3 #include "context.h" | |
| 4 #include "origin_cs.h" | |
| 5 | |
|
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
6 extern enum Relational compare(struct Node* node1, struct Node* node2); |
| 86 | 7 |
| 160 | 8 union Data* createRedBlackTree(struct Context* context) { |
| 9 struct Tree* tree = &ALLOCATE(context, Tree)->Tree; | |
| 10 struct RedBlackTree* redBlackTree = &ALLOCATE(context, RedBlackTree)->RedBlackTree; | |
| 11 tree->tree = (union Data*)redBlackTree; | |
| 12 redBlackTree->root = NULL; | |
| 13 tree->put = C_putRedBlackTree; | |
| 14 tree->get = C_getRedBlackTree; | |
| 189 | 15 // tree->remove = C_removeRedBlackTree; |
| 16 // tree->clear = C_clearRedBlackTree; | |
| 160 | 17 return (union Data*)(tree); |
| 18 } | |
| 19 | |
| 126 | 20 void printTree1(union Data* data) { |
| 132 | 21 struct Node* node = &data->node; |
| 126 | 22 if (node == NULL) { |
| 23 printf("NULL"); | |
| 24 } else { | |
| 25 printf("key = %d (", node->key); | |
| 133 | 26 printTree1((union Data*)(node->right)); |
| 126 | 27 printf("), ("); |
| 133 | 28 printTree1((union Data*)(node->left)); |
| 126 | 29 printf(")"); |
| 30 } | |
| 31 } | |
| 32 | |
| 33 void printTree(union Data* data) { | |
| 34 printTree1(data); | |
| 35 printf("\n"); | |
| 36 } | |
| 86 | 37 |
| 172 | 38 __code putRedBlackTree(struct Context* context, struct Stack* nodeStack, struct RedBlackTree* traverse, struct Node* node, struct Node* root, struct Node* newNode) { |
| 39 printTree((union Data*)(traverse->root)); | |
| 122 | 40 traverse->newNode = newNode; |
| 172 | 41 traverse->root = newNode; // this should done at stackClear |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
42 traverse->parent = NULL; |
| 86 | 43 if (root) { |
| 91 | 44 traverse->current = root; |
|
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
45 traverse->result = compare(traverse->current, node); |
| 144 | 46 goto meta(context, C_replaceNode); |
| 86 | 47 } |
| 48 | |
| 144 | 49 goto meta(context, C_insertNode); |
| 86 | 50 } |
| 51 | |
| 160 | 52 __code putRedBlackTree_stub(struct Context* context) { |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
53 struct Node* newNode = &ALLOCATE(context, Node)->node; |
| 172 | 54 goto putRedBlackTree(context, |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
55 &context->data[D_Stack]->stack, |
| 172 | 56 &context->data[D_RedBlackTree]->RedBlackTree, |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
57 &context->data[D_Node]->node, |
| 172 | 58 context->data[D_RedBlackTree]->RedBlackTree.root, |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
59 newNode |
| 124 | 60 ); |
| 121 | 61 } |
| 62 | |
| 172 | 63 __code replaceNode(struct Context* context, struct RedBlackTree* traverse, struct Node* oldNode, struct Node* newNode, struct Stack* nodeStack) { |
| 138 | 64 traverse->previous = newNode; |
| 121 | 65 *newNode = *oldNode; |
| 138 | 66 nodeStack->stack = (union Data*)traverse->nodeStack; |
| 133 | 67 nodeStack->data = (union Data*)(newNode); |
| 144 | 68 nodeStack->next = C_replaceNode1; |
| 138 | 69 goto meta(context, traverse->nodeStack->push); |
| 86 | 70 } |
| 71 | |
| 121 | 72 __code replaceNode_stub(struct Context* context) { |
| 73 goto replaceNode(context, | |
| 172 | 74 &context->data[D_RedBlackTree]->RedBlackTree, |
| 75 context->data[D_RedBlackTree]->RedBlackTree.current, | |
| 76 //context->data[D_RedBlackTree]->RedBlackTree.newNode, | |
| 77 Gearef(context, RedBlackTree)->newNode, | |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
78 &context->data[D_Stack]->stack); |
| 121 | 79 } |
| 80 | |
| 174 | 81 __code replaceNode1(struct Context* context, struct RedBlackTree* traverse, struct Node* node, struct Node* oldNode, struct Node* newNode, struct Node* newnewNode, int result, enum Code next) { |
| 86 | 82 if (result == EQ) { |
| 121 | 83 newNode->value = node->value; |
| 117 | 84 // go to stack clear |
| 174 | 85 goto meta(context, next); |
| 86 | 86 } else if (result == GT) { |
| 91 | 87 traverse->current = oldNode->right; |
| 121 | 88 newNode->right = newnewNode; |
| 86 | 89 } else { |
| 91 | 90 traverse->current = oldNode->left; |
| 121 | 91 newNode->left = newnewNode; |
| 86 | 92 } |
| 122 | 93 traverse->newNode = newnewNode; |
| 91 | 94 if (traverse->current) { |
|
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
95 traverse->result = compare(traverse->current, node); |
| 144 | 96 goto meta(context, C_replaceNode); |
| 86 | 97 } |
| 144 | 98 goto meta(context, C_insertNode); |
| 121 | 99 |
| 86 | 100 } |
| 101 | |
| 121 | 102 __code replaceNode1_stub(struct Context* context) { |
| 132 | 103 struct Node* newnewNode = &ALLOCATE(context, Node)->node; |
| 121 | 104 goto replaceNode1(context, |
| 172 | 105 &context->data[D_RedBlackTree]->RedBlackTree, |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
106 &context->data[D_Node]->node, |
| 172 | 107 context->data[D_RedBlackTree]->RedBlackTree.current, |
| 108 context->data[D_RedBlackTree]->RedBlackTree.previous, | |
| 124 | 109 newnewNode, |
| 174 | 110 context->data[D_RedBlackTree]->RedBlackTree.result, |
| 111 Gearef(context, Tree)->next); | |
| 86 | 112 } |
| 113 | |
| 172 | 114 __code insertNode(struct Context* context, struct RedBlackTree* traverse, struct Stack *nodeStack, struct Node* node, struct Node* newNode) { |
| 86 | 115 *newNode = *node; |
| 122 | 116 newNode->color = Red; |
| 91 | 117 traverse->current = newNode; |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
118 nodeStack->stack = (union Data*)traverse->nodeStack; |
| 144 | 119 nodeStack->next = C_insertCase1; |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
120 goto meta(context, traverse->nodeStack->get2); |
| 86 | 121 } |
| 122 | |
| 123 __code insertNode_stub(struct Context* context) { | |
| 91 | 124 goto insertNode(context, |
| 172 | 125 &context->data[D_RedBlackTree]->RedBlackTree, |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
126 &context->data[D_Stack]->stack, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
127 &context->data[D_Node]->node, |
| 172 | 128 context->data[D_RedBlackTree]->RedBlackTree.newNode); |
| 86 | 129 } |
| 130 | |
| 173 | 131 __code insertCase1(struct Context* context, struct RedBlackTree* traverse, struct Node *parent, struct Node *grandparent) { |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
132 if (parent != NULL) { |
|
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
133 traverse->parent = parent; |
|
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
134 traverse->grandparent = grandparent; |
| 144 | 135 goto meta(context,C_insertCase2); |
| 122 | 136 } |
| 173 | 137 traverse->root->color = Black; |
| 144 | 138 goto meta(context, C_stackClear); |
| 86 | 139 } |
| 140 | |
| 144 | 141 __code insertCase1_stub(struct Context* context) { |
| 127 | 142 goto insertCase1(context, |
| 172 | 143 &context->data[D_RedBlackTree]->RedBlackTree, |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
144 &context->data[D_Stack]->stack.data->node, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
145 &context->data[D_Stack]->stack.data1->node); |
| 86 | 146 } |
| 147 | |
| 172 | 148 __code insertCase2(struct Context* context, struct RedBlackTree* traverse) { |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
149 if (traverse->parent->color == Black) { |
| 144 | 150 goto meta(context, C_stackClear); |
| 86 | 151 } |
| 144 | 152 goto meta(context,C_insertCase3); |
| 86 | 153 } |
| 154 | |
| 144 | 155 __code insertCase2_stub(struct Context* context) { |
| 172 | 156 goto insertCase2(context, &context->data[D_RedBlackTree]->RedBlackTree); |
| 86 | 157 } |
| 158 | |
| 172 | 159 __code insertCase3(struct Context* context, struct RedBlackTree* traverse, struct Stack* nodeStack) { |
| 86 | 160 struct Node* uncle; |
| 161 | |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
162 if (traverse->grandparent->left == traverse->parent) |
|
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
163 uncle = traverse->grandparent->right; |
| 86 | 164 else |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
165 uncle = traverse->grandparent->left; |
| 86 | 166 |
| 167 if (uncle && (uncle->color == Red)) { | |
| 117 | 168 // do insertcase1 on grandparent, stack must be pop by two |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
169 traverse->parent->color = Black; |
| 86 | 170 uncle->color = Black; |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
171 traverse->grandparent->color = Red; |
|
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
172 traverse->current = traverse->grandparent; |
| 138 | 173 nodeStack->stack = (union Data*)traverse->nodeStack; |
| 144 | 174 nodeStack->next = C_insertCase1; |
| 138 | 175 goto meta(context, traverse->nodeStack->pop2); |
| 86 | 176 } |
| 144 | 177 goto meta(context, C_insertCase4); |
| 86 | 178 } |
| 179 | |
| 144 | 180 __code insertCase3_stub(struct Context* context) { |
| 172 | 181 goto insertCase3(context, &context->data[D_RedBlackTree]->RedBlackTree, |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
182 &context->data[D_Stack]->stack |
| 122 | 183 ); |
| 86 | 184 } |
| 185 | |
| 172 | 186 __code insertCase4(struct Context* context, struct RedBlackTree* traverse, struct RotateTree* rotateTree) { |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
187 struct Stack* nodeStack = traverse->nodeStack; |
| 86 | 188 |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
189 if ((traverse->current == traverse->parent->right) && (traverse->parent == traverse->grandparent->left)) { |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
190 traverse->current = traverse->current->left; |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
191 traverse->parent = traverse->grandparent; |
| 147 | 192 |
| 193 rotateTree->traverse = traverse; | |
| 194 rotateTree->next = C_insertCase5; | |
| 195 | |
| 138 | 196 nodeStack->stack = (union Data*)traverse->nodeStack; |
| 144 | 197 nodeStack->next = C_rotateLeft; |
| 139 | 198 goto meta(context, nodeStack->pop); |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
199 } else if ((traverse->current == traverse->parent->left) && (traverse->parent == traverse->grandparent->right)) { |
| 147 | 200 traverse->parent = traverse->grandparent; |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
201 traverse->current = traverse->current->right; |
| 147 | 202 |
| 203 rotateTree->traverse = traverse; | |
| 204 rotateTree->next = C_insertCase5; | |
| 205 | |
| 138 | 206 nodeStack->stack = (union Data*)traverse->nodeStack; |
| 144 | 207 nodeStack->next = C_rotateRight; |
| 139 | 208 goto meta(context, nodeStack->pop); |
| 86 | 209 } |
| 210 | |
| 144 | 211 goto meta(context, C_insertCase5); |
| 86 | 212 } |
| 213 | |
| 144 | 214 __code insertCase4_stub(struct Context* context) { |
| 172 | 215 goto insertCase4(context, &context->data[D_RedBlackTree]->RedBlackTree, &context->data[D_RotateTree]->rotateTree); |
| 86 | 216 } |
| 217 | |
| 172 | 218 __code insertCase5(struct Context* context, struct RedBlackTree* traverse,struct Stack *nodeStack) { |
| 138 | 219 nodeStack->stack = (union Data*)traverse->nodeStack; |
| 144 | 220 nodeStack->next = C_insertCase51; |
|
141
4f6a660c14a1
stack interface worked
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
140
diff
changeset
|
221 goto meta(context, traverse->nodeStack->pop2); |
| 122 | 222 } |
| 223 | |
| 144 | 224 __code insertCase5_stub(struct Context* context) { |
| 172 | 225 goto insertCase5(context, &context->data[D_RedBlackTree]->RedBlackTree, &context->data[D_Stack]->stack); |
| 86 | 226 } |
| 227 | |
| 172 | 228 __code insertCase51(struct Context* context, struct RedBlackTree* traverse, struct RotateTree *rotateTree, struct Node* current, struct Node* parent, struct Node* grandparent) { |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
229 traverse->parent = parent; |
|
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
230 traverse->grandparent = grandparent; |
|
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
141
diff
changeset
|
231 |
| 86 | 232 parent->color = Black; |
| 233 grandparent->color = Red; | |
| 234 | |
| 91 | 235 traverse->current = grandparent; |
| 147 | 236 |
| 237 rotateTree->traverse = traverse; | |
| 238 rotateTree->next = C_stackClear; | |
| 239 | |
| 86 | 240 if ((current == parent->left) && (parent == grandparent->left)) |
| 144 | 241 goto meta(context, C_rotateRight); |
| 86 | 242 else |
| 144 | 243 goto meta(context, C_rotateLeft); |
| 86 | 244 } |
| 245 | |
| 144 | 246 __code insertCase51_stub(struct Context* context) { |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
247 struct Node* parent = &context->data[D_Stack]->stack.data->node; |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
248 struct Node* grandparent = &context->data[D_Stack]->stack.data1->node; |
| 172 | 249 goto insertCase51(context, &context->data[D_RedBlackTree]->RedBlackTree,&context->data[D_RotateTree]->rotateTree, context->data[D_RedBlackTree]->RedBlackTree.current, parent, grandparent); |
| 86 | 250 } |
| 251 | |
| 172 | 252 __code rotateLeft(struct Context* context, struct RedBlackTree* traverse,struct Stack* nodeStack) { |
| 138 | 253 nodeStack->stack = (union Data*)traverse->nodeStack; |
| 144 | 254 nodeStack->next = C_rotateLeft1; |
| 140 | 255 goto meta(context, traverse->nodeStack->get); |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
256 } |
|
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
257 |
|
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
258 __code rotateLeft_stub(struct Context* context) { |
| 172 | 259 struct RedBlackTree* traverse = context->data[D_RotateTree]->rotateTree.traverse; |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
260 goto rotateLeft(context, traverse, &context->data[D_Stack]->stack); |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
261 } |
|
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
262 |
| 172 | 263 __code rotateLeft1(struct Context* context, struct Node* node, struct RedBlackTree* traverse, struct Node *parent,struct RotateTree *rotateTree) { |
| 86 | 264 struct Node* tmp = node->right; |
| 123 | 265 |
| 266 if (parent) { | |
| 146 | 267 if (node == parent->left) |
| 123 | 268 parent->left = tmp; |
| 269 else | |
| 270 parent->right = tmp; | |
| 271 } else { | |
| 172 | 272 traverse->root = tmp; |
| 123 | 273 } |
| 117 | 274 |
| 123 | 275 node->right = tmp->left; |
| 276 tmp->left = node; | |
| 277 traverse->current = tmp; | |
| 278 | |
| 147 | 279 goto meta(context, rotateTree->next); |
| 123 | 280 } |
| 281 | |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
282 __code rotateLeft1_stub(struct Context* context) { |
| 172 | 283 struct RedBlackTree* traverse = context->data[D_RotateTree]->rotateTree.traverse; |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
284 struct Node* parent = &context->data[D_Stack]->stack.data->node; |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
285 goto rotateLeft1(context, |
| 147 | 286 traverse->current, |
| 287 traverse, | |
| 288 parent, | |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
289 &context->data[D_RotateTree]->rotateTree); |
| 123 | 290 } |
| 86 | 291 |
| 172 | 292 __code rotateRight(struct Context* context, struct RedBlackTree* traverse,struct Stack *nodeStack) { |
| 140 | 293 nodeStack->stack = (union Data*)traverse->nodeStack; |
| 144 | 294 nodeStack->next = C_rotateRight1; |
| 140 | 295 goto meta(context, traverse->nodeStack->get); |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
296 } |
|
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
297 |
|
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
298 __code rotateRight_stub(struct Context* context) { |
| 172 | 299 struct RedBlackTree* traverse = context->data[D_RotateTree]->rotateTree.traverse; |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
300 goto rotateLeft(context, traverse, &context->data[D_Stack]->stack); |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
301 } |
|
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
302 |
| 172 | 303 __code rotateRight1(struct Context* context, struct Node* node, struct RedBlackTree* traverse,struct Node *parent,struct RotateTree *rotateTree) { |
| 123 | 304 struct Node* tmp = node->left; |
| 305 | |
| 86 | 306 if (parent) { |
| 146 | 307 if (node == parent->left) |
| 86 | 308 parent->left = tmp; |
| 309 else | |
| 310 parent->right = tmp; | |
| 311 } else { | |
| 172 | 312 traverse->root = tmp; |
| 86 | 313 } |
| 314 | |
| 315 node->left = tmp->right; | |
| 316 tmp->right = node; | |
| 91 | 317 traverse->current = tmp; |
| 86 | 318 |
| 147 | 319 goto meta(context, rotateTree->next); |
| 86 | 320 } |
| 321 | |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
322 __code rotateRight1_stub(struct Context* context) { |
| 172 | 323 struct RedBlackTree* traverse = context->data[D_RotateTree]->rotateTree.traverse; |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
324 struct Node* parent = &context->data[D_Stack]->stack.data->node; |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
325 goto rotateRight1(context, |
| 147 | 326 traverse->current, |
| 327 traverse, | |
| 328 parent, | |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
329 &context->data[D_RotateTree]->rotateTree); |
| 86 | 330 } |
| 331 | |
| 174 | 332 __code stackClear(struct Context* context, struct RedBlackTree* traverse,struct Stack *nodeStack, enum Code next) { |
| 91 | 333 traverse->current = 0; |
|
145
cc071cf1ba85
add stack clear interface
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
144
diff
changeset
|
334 nodeStack->stack = (union Data*)traverse->nodeStack; |
| 174 | 335 nodeStack->next = next; |
|
145
cc071cf1ba85
add stack clear interface
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
144
diff
changeset
|
336 goto meta(context, traverse->nodeStack->clear); |
| 86 | 337 } |
| 338 | |
| 339 __code stackClear_stub(struct Context* context) { | |
| 174 | 340 goto stackClear(context, &context->data[D_RedBlackTree]->RedBlackTree,&context->data[D_Stack]->stack, |
| 341 Gearef(context, Tree)->next); | |
| 86 | 342 } |
| 343 | |
| 344 | |
| 174 | 345 __code getRedBlackTree(struct Context* context, struct RedBlackTree* traverse, enum Code next) { |
| 173 | 346 if (traverse->root) { |
| 347 traverse->current = traverse->root; | |
| 86 | 348 |
| 144 | 349 goto meta(context, C_search); |
| 92 | 350 } |
| 86 | 351 |
| 174 | 352 goto meta(context, next); |
| 92 | 353 } |
| 86 | 354 |
| 160 | 355 __code getRedBlackTree_stub(struct Context* context) { |
| 174 | 356 goto getRedBlackTree(context, &context->data[D_RedBlackTree]->RedBlackTree, Gearef(context, Tree)->next); |
| 92 | 357 } |
| 86 | 358 |
| 174 | 359 __code search(struct Context* context, struct RedBlackTree* traverse, struct Node* node, enum Code next) { |
|
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
360 // compare(context, traverse, traverse->current->key, node->key); |
|
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
361 traverse->result = compare(traverse->current, node); |
| 91 | 362 if (traverse->result == EQ) { |
| 363 *node = *traverse->current; | |
| 86 | 364 |
| 174 | 365 goto meta(context, next); |
| 91 | 366 } else if (traverse->result == GT) { |
| 367 traverse->current = traverse->current->right; | |
| 368 } else { | |
| 369 traverse->current = traverse->current->left; | |
| 370 } | |
| 86 | 371 |
| 91 | 372 if (traverse->current) |
| 144 | 373 goto meta(context, C_search); |
| 86 | 374 |
| 174 | 375 goto meta(context, next); |
| 91 | 376 } |
| 86 | 377 |
| 91 | 378 __code search_stub(struct Context* context) { |
| 174 | 379 goto search(context, &context->data[D_RedBlackTree]->RedBlackTree, &context->data[D_Node]->node, Gearef(context, Tree)->next); |
| 91 | 380 } |
| 86 | 381 |
| 382 /* /\* __code delete(struct Context* context, struct Tree* tree) { *\/ */ | |
| 383 /* /\* if (tree->root) { *\/ */ | |
| 384 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
| 385 /* /\* context->next = Delete1; *\/ */ | |
| 386 /* /\* goto meta(context, Get); *\/ */ | |
| 387 /* /\* } *\/ */ | |
| 388 | |
| 389 /* /\* goto meta(context, context->next); *\/ */ | |
| 390 /* /\* } *\/ */ | |
| 391 | |
| 392 /* /\* __code delete_stub(struct Context* context) { *\/ */ | |
| 393 /* /\* goto delete(context, &context->data[Tree]->tree); *\/ */ | |
| 394 /* /\* } *\/ */ | |
| 395 | |
| 396 /* /\* __code delete1(struct Context* context, struct Tree* tree, struct Allocate* allocate) { *\/ */ | |
| 397 /* /\* allocate->size = sizeof(struct Node); *\/ */ | |
| 398 /* /\* allocator(context); *\/ */ | |
| 399 | |
| 400 /* /\* struct Node* root = tree->root; *\/ */ | |
| 401 | |
| 402 /* /\* tree->root = &context->data[context->dataNum]->node; *\/ */ | |
| 403 /* /\* tree->current = root; *\/ */ | |
| 404 | |
| 405 /* /\* compare(context, tree, tree->current->key, context->data[Node]->node.key); *\/ */ | |
| 406 | |
| 407 /* /\* goto meta(context, Replace_d1); *\/ */ | |
| 408 /* /\* } *\/ */ | |
| 409 | |
| 410 /* /\* __code delete1_stub(struct Context* context) { *\/ */ | |
| 411 /* /\* goto delete1(context, &context->data[Tree]->tree, &context->data[Allocate]->allocate); *\/ */ | |
| 412 /* /\* } *\/ */ | |
| 413 | |
| 414 /* /\* __code delete2(struct Context* context, struct Node* current) { *\/ */ | |
| 415 /* /\* if (current->color == Black) { *\/ */ | |
| 416 /* /\* struct Node* child = current->right == NULL ? current->left : current->right; *\/ */ | |
| 417 /* /\* current->color = child == NULL ? Black : child->color; *\/ */ | |
| 418 | |
| 419 /* /\* goto meta(context, DeleteCase1); *\/ */ | |
| 420 /* /\* } *\/ */ | |
| 421 | |
| 422 /* /\* goto meta(context, Delete3); *\/ */ | |
| 423 /* /\* } *\/ */ | |
| 424 | |
| 425 /* /\* __code delete2_stub(struct Context* context) { *\/ */ | |
| 426 /* /\* goto delete2(context, context->data[Tree]->tree.current); *\/ */ | |
| 427 /* /\* } *\/ */ | |
| 428 | |
| 429 /* /\* __code delete3(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
| 430 /* /\* struct Node* tmp = current->right == NULL ? current->left : current->right; *\/ */ | |
| 431 | |
| 432 /* /\* if (current->parent) { *\/ */ | |
| 433 /* /\* if (current == current->parent->left) *\/ */ | |
| 434 /* /\* current->parent->left = tmp; *\/ */ | |
| 435 /* /\* else *\/ */ | |
| 436 /* /\* current->parent->right = tmp; *\/ */ | |
| 437 /* /\* } else { *\/ */ | |
| 438 /* /\* tree->root = tmp; *\/ */ | |
| 439 /* /\* } *\/ */ | |
| 440 | |
| 441 /* /\* if (tmp) *\/ */ | |
| 442 /* /\* tmp->parent = current->parent; *\/ */ | |
| 443 | |
| 444 /* /\* if (current->parent == NULL && tmp) *\/ */ | |
| 445 /* /\* tmp->color = Black; *\/ */ | |
| 446 | |
| 447 /* /\* current == current->parent->left ? (current->parent->left = NULL) : (current->parent->right = NULL); *\/ */ | |
| 448 | |
| 449 /* /\* stack_pop(context->code_stack, &context->next); *\/ */ | |
| 450 /* /\* goto meta(context, context->next); *\/ */ | |
| 451 /* /\* } *\/ */ | |
| 452 | |
| 453 /* /\* __code delete3_stub(struct Context* context) { *\/ */ | |
| 454 /* /\* goto delete3(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
| 455 /* /\* } *\/ */ | |
| 456 | |
| 457 /* /\* __code replaceNodeForDelete1(struct Context* context, struct Tree* tree, struct Node* oldNode, struct Node* newNode, int result) { *\/ */ | |
| 458 /* /\* *newNode = *oldNode; *\/ */ | |
| 459 | |
| 460 /* /\* if (result == EQ) *\/ */ | |
| 461 /* /\* goto meta(context, Replace_d2); *\/ */ | |
| 462 /* /\* else if (result == GT) *\/ */ | |
| 463 /* /\* tree->current = newNode->right; *\/ */ | |
| 464 /* /\* else *\/ */ | |
| 465 /* /\* tree->current = newNode->left; *\/ */ | |
| 466 | |
| 467 /* /\* tree->current->parent = newNode; *\/ */ | |
| 468 | |
| 469 /* /\* if (tree->current->left == NULL && tree->current->right == NULL) *\/ */ | |
| 470 /* /\* goto meta(context, Delete2); *\/ */ | |
| 471 | |
| 472 /* /\* if (result == GT) *\/ */ | |
| 473 /* /\* newNode->right = context->heap; *\/ */ | |
| 474 /* /\* else if (result == LT) *\/ */ | |
| 475 /* /\* newNode->left = context->heap; *\/ */ | |
| 476 | |
| 477 /* /\* allocator(context); *\/ */ | |
| 478 | |
| 479 /* /\* compare(context, tree, tree->current->key, context->data[Node]->node.key); *\/ */ | |
| 480 | |
| 481 /* /\* goto meta(context, Replace_d1); *\/ */ | |
| 482 /* /\* } *\/ */ | |
| 483 | |
| 484 /* /\* __code replaceNodeForDelete1_stub(struct Context* context) { *\/ */ | |
| 485 /* /\* goto replaceNodeForDelete1(context, &context->data[Tree]->tree, context->data[Tree]->tree.current, &context->data[context->dataNum]->node, context->data[Tree]->tree.result); *\/ */ | |
| 486 /* /\* } *\/ */ | |
| 487 | |
| 488 /* /\* __code replaceNodeForDelete2(struct Context* context, struct Tree* tree, struct Node* newNode) { *\/ */ | |
| 489 /* /\* if (tree->current->left && tree->current->right) { *\/ */ | |
| 490 /* /\* newNode->left->parent = newNode; *\/ */ | |
| 491 /* /\* tree->current = newNode->left; *\/ */ | |
| 492 /* /\* newNode->left = context->heap; *\/ */ | |
| 493 /* /\* tree->deleted = newNode; *\/ */ | |
| 494 | |
| 495 /* /\* allocator(context); *\/ */ | |
| 496 /* /\* tree->current->parent = newNode; *\/ */ | |
| 497 | |
| 498 /* /\* goto meta(context, FindMax1); *\/ */ | |
| 499 /* /\* } *\/ */ | |
| 500 | |
| 501 /* /\* goto meta(context, Delete2); *\/ */ | |
| 502 /* /\* } *\/ */ | |
| 503 | |
| 504 /* /\* __code replaceNodeForDelete2_stub(struct Context* context) { *\/ */ | |
| 505 /* /\* goto replaceNodeForDelete2(context, &context->data[Tree]->tree, &context->data[context->dataNum]->node); *\/ */ | |
| 506 /* /\* } *\/ */ | |
| 507 | |
| 508 /* /\* __code findMax1(struct Context* context, struct Tree* tree, struct Node* oldNode, struct Node* newNode) { *\/ */ | |
| 509 /* /\* *newNode = *oldNode; *\/ */ | |
| 510 | |
| 511 /* /\* if (newNode->right) *\/ */ | |
| 512 /* /\* goto meta(context, FindMax2); *\/ */ | |
| 513 | |
| 514 /* /\* tree->deleted->key = newNode->key; *\/ */ | |
| 515 /* /\* tree->deleted->value = newNode->value; *\/ */ | |
| 516 | |
| 517 /* /\* tree->current = newNode; *\/ */ | |
| 518 | |
| 519 /* /\* goto meta(context, Delete2); *\/ */ | |
| 520 /* /\* } *\/ */ | |
| 521 | |
| 522 /* /\* __code findMax1_stub(struct Context* context) { *\/ */ | |
| 523 /* /\* goto findMax1(context, &context->data[Tree]->tree, context->data[Tree]->tree.current, &context->data[context->dataNum]->node); *\/ */ | |
| 524 /* /\* } *\/ */ | |
| 525 | |
| 526 | |
| 527 /* /\* __code findMax2(struct Context* context, struct Tree* tree, struct Node* oldNode, struct Node* newNode) { *\/ */ | |
| 528 /* /\* *newNode = *oldNode; *\/ */ | |
| 529 | |
| 530 /* /\* if (newNode->right->right) { *\/ */ | |
| 531 /* /\* tree->current = newNode->right; *\/ */ | |
| 532 /* /\* newNode->right = context->heap; *\/ */ | |
| 533 | |
| 534 /* /\* allocator(context); *\/ */ | |
| 535 /* /\* tree->current->parent = newNode; *\/ */ | |
| 536 | |
| 537 /* /\* goto meta(context, FindMax2); *\/ */ | |
| 538 /* /\* } *\/ */ | |
| 539 | |
| 540 /* /\* tree->deleted->key = newNode->right->key; *\/ */ | |
| 541 /* /\* tree->deleted->value = newNode->right->value; *\/ */ | |
| 542 | |
| 543 /* /\* tree->current = newNode; *\/ */ | |
| 544 | |
| 545 /* /\* goto meta(context, Delete2); *\/ */ | |
| 546 /* /\* } *\/ */ | |
| 547 | |
| 548 /* /\* __code findMax2_stub(struct Context* context) { *\/ */ | |
| 549 /* /\* goto findMax2(context, &context->data[Tree]->tree, context->data[Tree]->tree.current, &context->data[context->dataNum]->node); *\/ */ | |
| 550 /* /\* } *\/ */ | |
| 551 | |
| 552 /* /\* __code deleteCase1(struct Context* context, struct Node* current) { *\/ */ | |
| 553 /* /\* if (current->parent) *\/ */ | |
| 554 /* /\* goto meta(context, DeleteCase2); *\/ */ | |
| 555 | |
| 556 /* /\* goto meta(context, Delete3); *\/ */ | |
| 557 /* /\* } *\/ */ | |
| 558 | |
| 559 /* /\* __code deleteCase1_stub(struct Context* context) { *\/ */ | |
| 560 /* /\* goto deleteCase1(context, context->data[Tree]->tree.current); *\/ */ | |
| 561 /* /\* } *\/ */ | |
| 562 | |
| 563 /* /\* __code deleteCase2(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
| 564 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
| 565 | |
| 566 /* /\* if ((sibling == NULL ? Black : sibling->color) == Red) { *\/ */ | |
| 567 /* /\* current->parent->color = Red; *\/ */ | |
| 568 /* /\* sibling->color = Black; *\/ */ | |
| 569 | |
| 570 /* /\* current == current->parent->left ? (current->parent->left = context->heap) : (current->parent->right = context->heap); *\/ */ | |
| 571 /* /\* allocator(context); *\/ */ | |
| 572 /* /\* context->data[context->dataNum]->node = *sibling; *\/ */ | |
| 573 | |
| 574 /* /\* tree->current = current->parent; *\/ */ | |
| 575 | |
| 576 /* /\* context->next = DeleteCase3; *\/ */ | |
| 577 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
| 578 | |
| 579 /* /\* if (current == current->parent->left) *\/ */ | |
| 580 /* /\* goto meta(context, RotateL); *\/ */ | |
| 581 /* /\* else *\/ */ | |
| 582 /* /\* goto meta(context, RotateR); *\/ */ | |
| 583 /* /\* } *\/ */ | |
| 584 | |
| 585 /* /\* goto meta(context, DeleteCase3); *\/ */ | |
| 586 /* /\* } *\/ */ | |
| 587 | |
| 588 /* /\* __code deleteCase2_stub(struct Context* context) { *\/ */ | |
| 589 /* /\* goto deleteCase2(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
| 590 /* /\* } *\/ */ | |
| 591 | |
| 592 /* /\* __code deleteCase3(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
| 593 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
| 594 | |
| 595 /* /\* if (current->parent->color == Black && *\/ */ | |
| 596 /* /\* (sibling == NULL ? Black : sibling->color) == Black && *\/ */ | |
| 597 /* /\* (sibling->left == NULL ? Black : sibling->left->color) == Black && *\/ */ | |
| 598 /* /\* (sibling->right == NULL ? Black : sibling->right->color) == Black) { *\/ */ | |
| 599 /* /\* sibling->color = Red; *\/ */ | |
| 600 | |
| 601 /* /\* tree->current = current->parent; *\/ */ | |
| 602 /* /\* goto meta(context, DeleteCase1); *\/ */ | |
| 603 /* /\* } *\/ */ | |
| 604 | |
| 605 /* /\* goto meta(context, DeleteCase4); *\/ */ | |
| 606 /* /\* } *\/ */ | |
| 607 | |
| 608 /* /\* __code deleteCase3_stub(struct Context* context) { *\/ */ | |
| 609 /* /\* goto deleteCase3(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
| 610 /* /\* } *\/ */ | |
| 611 | |
| 612 /* /\* __code deleteCase4(struct Context* context, struct Node* current) { *\/ */ | |
| 613 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
| 614 | |
| 615 /* /\* if (current->parent->color == Red && *\/ */ | |
| 616 /* /\* (sibling == NULL ? Black : sibling->color) == Black && *\/ */ | |
| 617 /* /\* (sibling->left == NULL ? Black : sibling->left->color) == Black && *\/ */ | |
| 618 /* /\* (sibling->right == NULL ? Black : sibling->right->color) == Black) { *\/ */ | |
| 619 /* /\* sibling->color = Red; *\/ */ | |
| 620 /* /\* current->parent->color = Black; *\/ */ | |
| 621 | |
| 622 /* /\* goto meta(context, Delete3); *\/ */ | |
| 623 /* /\* } *\/ */ | |
| 624 | |
| 625 /* /\* goto meta(context, DeleteCase5); *\/ */ | |
| 626 /* /\* } *\/ */ | |
| 627 | |
| 628 /* /\* __code deleteCase4_stub(struct Context* context) { *\/ */ | |
| 629 /* /\* goto deleteCase4(context, context->data[Tree]->tree.current); *\/ */ | |
| 630 /* /\* } *\/ */ | |
| 631 | |
| 632 /* /\* __code deleteCase5(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
| 633 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
| 634 /* /\* sibling->parent = current->parent; *\/ */ | |
| 635 | |
| 636 /* /\* if (current == current->parent->left && *\/ */ | |
| 637 /* /\* (sibling == NULL ? Black : sibling->color) == Black && *\/ */ | |
| 638 /* /\* (sibling->left == NULL ? Black : sibling->left->color) == Red && *\/ */ | |
| 639 /* /\* (sibling->right == NULL ? Black : sibling->right->color) == Black) { *\/ */ | |
| 640 /* /\* sibling->color = Red; *\/ */ | |
| 641 /* /\* sibling->left->color = Black; *\/ */ | |
| 642 | |
| 643 /* /\* sibling == sibling->parent->left ? (sibling->parent->left = context->heap) : (sibling->parent->right = context->heap); *\/ */ | |
| 644 /* /\* allocator(context); *\/ */ | |
| 645 /* /\* struct Node* tmp = &context->data[context->dataNum]->node; *\/ */ | |
| 646 /* /\* *tmp = *sibling; *\/ */ | |
| 647 /* /\* tmp->parent = current; *\/ */ | |
| 648 | |
| 649 /* /\* tmp->left = context->heap; *\/ */ | |
| 650 /* /\* allocator(context); *\/ */ | |
| 651 /* /\* context->data[context->dataNum]->node = *sibling->left; *\/ */ | |
| 652 /* /\* context->data[context->dataNum]->node.parent = tmp; *\/ */ | |
| 653 | |
| 654 /* /\* tree->current = tmp; *\/ */ | |
| 655 | |
| 656 /* /\* context->next = DeleteCase6; *\/ */ | |
| 657 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
| 658 | |
| 659 /* /\* goto meta(context, RotateR); *\/ */ | |
| 660 /* /\* } else if (current == current->parent->right && *\/ */ | |
| 661 /* /\* (sibling == NULL ? Black : sibling->color) == Black && *\/ */ | |
| 662 /* /\* (sibling->left == NULL ? Black : sibling->left->color) == Black && *\/ */ | |
| 663 /* /\* (sibling->right == NULL ? Black : sibling->right->color) == Red) { *\/ */ | |
| 664 /* /\* sibling->color = Red; *\/ */ | |
| 665 /* /\* sibling->right->color = Black; *\/ */ | |
| 666 | |
| 667 /* /\* sibling == sibling->parent->left ? (sibling->parent->left = context->heap) : (sibling->parent->right = context->heap); *\/ */ | |
| 668 /* /\* allocator(context); *\/ */ | |
| 669 /* /\* struct Node* tmp = &context->data[context->dataNum]->node; *\/ */ | |
| 670 /* /\* *tmp = *sibling; *\/ */ | |
| 671 /* /\* tmp->parent = current; *\/ */ | |
| 672 | |
| 673 /* /\* tmp->right = context->heap; *\/ */ | |
| 674 /* /\* allocator(context); *\/ */ | |
| 675 /* /\* context->data[context->dataNum]->node = *sibling->right; *\/ */ | |
| 676 /* /\* context->data[context->dataNum]->node.parent = tmp; *\/ */ | |
| 677 | |
| 678 /* /\* tree->current = tmp; *\/ */ | |
| 679 | |
| 680 /* /\* context->next = DeleteCase6; *\/ */ | |
| 681 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
| 682 /* /\* goto meta(context, RotateL); *\/ */ | |
| 683 /* /\* } *\/ */ | |
| 684 | |
| 685 /* /\* goto meta(context, DeleteCase6); *\/ */ | |
| 686 /* /\* } *\/ */ | |
| 687 | |
| 688 /* /\* __code deleteCase5_stub(struct Context* context) { *\/ */ | |
| 689 /* /\* goto deleteCase5(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
| 690 /* /\* } *\/ */ | |
| 691 | |
| 692 /* /\* __code deleteCase6(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
| 693 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
| 694 | |
| 695 /* /\* sibling == sibling->parent->left ? (sibling->parent->left = context->heap) : (sibling->parent->right = context->heap); *\/ */ | |
| 696 /* /\* allocator(context); *\/ */ | |
| 697 /* /\* struct Node* tmp = &context->data[context->dataNum]->node; *\/ */ | |
| 698 /* /\* *tmp = *sibling; *\/ */ | |
| 699 /* /\* tmp->parent = current; *\/ */ | |
| 700 | |
| 701 /* /\* tmp->color = current->parent->color; *\/ */ | |
| 702 /* /\* current->parent->color = Black; *\/ */ | |
| 703 | |
| 704 /* /\* context->next = Delete3; *\/ */ | |
| 705 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
| 706 | |
| 707 /* /\* if (current == current->parent->left) { *\/ */ | |
| 708 /* /\* tmp->right->color = Black; *\/ */ | |
| 709 /* /\* tree->current = current->parent; *\/ */ | |
| 710 | |
| 711 /* /\* goto meta(context, RotateL); *\/ */ | |
| 712 /* /\* } else { *\/ */ | |
| 713 /* /\* tmp->left->color = Black; *\/ */ | |
| 714 /* /\* tree->current = current->parent; *\/ */ | |
| 715 | |
| 716 /* /\* goto meta(context, RotateR); *\/ */ | |
| 717 /* /\* } *\/ */ | |
| 718 /* /\* } *\/ */ | |
| 719 | |
| 720 /* /\* __code deleteCase6_stub(struct Context* context) { *\/ */ | |
| 721 /* /\* goto deleteCase6(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
| 722 /* /\* } *\/ */ |