Mercurial > hg > Gears > Gears
changeset 1063:6ca9a8755fd5
...
author | matac42 <matac@cr.ie.u-ryukyu.ac.jp> |
---|---|
date | Sun, 04 Feb 2024 12:24:25 +0900 |
parents | af0eb01e6b11 |
children | 54130b333e86 |
files | src/parallel_execution/RedBlackTree.cbc |
diffstat | 1 files changed, 3 insertions(+), 4 deletions(-) [+] |
line wrap: on
line diff
--- a/src/parallel_execution/RedBlackTree.cbc Wed Jan 31 19:09:55 2024 +0900 +++ b/src/parallel_execution/RedBlackTree.cbc Sun Feb 04 12:24:25 2024 +0900 @@ -102,7 +102,7 @@ tree->copied = 0; struct Stack* toStack = tree->toStack; - struct Node* newNode = &ALLOCATE(context, Node)->Node; + struct Node* newNode = new Node(); newNode->key = tree->current->key; newNode->value = (union Data*)new Integer(); ((Integer*)newNode->value)->value = ((Integer*)tree->current->value)->value; @@ -116,7 +116,6 @@ // current->leftがある場合、コピーしてから降りる。 // ない場合はrightを見に行く(rightDown) // - __code leftDown(struct RedBlackTree* tree) { printf("leftDown\n"); struct Stack* toStack = tree->toStack; @@ -132,7 +131,7 @@ } struct Stack* toStack = tree->toStack; - struct Node* newNode = &ALLOCATE(context, Node)->Node; + struct Node* newNode = new Node(); struct Node* data = (Node*)(stack->data); newNode->key = tree->current->left->key; newNode->value = (union Data*)new Integer(); @@ -209,7 +208,7 @@ } struct Stack* toStack = tree->toStack; - struct Node* newNode = &ALLOCATE(context, Node)->Node; + struct Node* newNode = new Node(); struct Node* data = (Node*)(stack->data); newNode->key = tree->current->right->key; newNode->value = (union Data*)new Integer();