# HG changeset patch
# User anatofuz <anatofuz@cr.ie.u-ryukyu.ac.jp>
# Date 1579153443 -32400
# Node ID 78e10562b2105597e59952c8e8de9d12e74b5463
# Parent  35b99bd037080e76843f3ccafa93dbb1e6ed08c4
tweak

diff -r 35b99bd03708 -r 78e10562b210 src/parallel_execution/SingleLinkedQueue.cbc
--- a/src/parallel_execution/SingleLinkedQueue.cbc	Thu Jan 16 14:43:44 2020 +0900
+++ b/src/parallel_execution/SingleLinkedQueue.cbc	Thu Jan 16 14:44:03 2020 +0900
@@ -2,6 +2,7 @@
 #include <stdio.h>
 #interface "Queue.h"
 // use "Node.h"
+// use "Element.h"
 
 Queue* createSingleLinkedQueue(struct Context* context) {
     struct Queue* queue = new Queue();
diff -r 35b99bd03708 -r 78e10562b210 src/parallel_execution/plautogen/impl/RedBlackTree.h
--- a/src/parallel_execution/plautogen/impl/RedBlackTree.h	Thu Jan 16 14:43:44 2020 +0900
+++ b/src/parallel_execution/plautogen/impl/RedBlackTree.h	Thu Jan 16 14:44:03 2020 +0900
@@ -1,8 +1,8 @@
 typedef struct RedBlackTree <Type, Isa> impl Tree {
   struct Node* root;
-  struct Node* current // reading node of original tree;
-  struct Node* previous // parent of reading node of original tree;
-  struct Node* newNode // writing node of new tree;
+  struct Node* current; // reading node of original tree;
+  struct Node* previous; // parent of reading node of original tree;
+  struct Node* newNode; // writing node of new tree;
   struct Node* parent;
   struct Node* grandparent;
   struct Stack* nodeStack;
diff -r 35b99bd03708 -r 78e10562b210 src/parallel_execution/test/stack_test.cbc
--- a/src/parallel_execution/test/stack_test.cbc	Thu Jan 16 14:43:44 2020 +0900
+++ b/src/parallel_execution/test/stack_test.cbc	Thu Jan 16 14:44:03 2020 +0900
@@ -1,6 +1,7 @@
 #include "../../context.h"
 #interface "Stack.h"
 #include <assert.h>
+// use "TaskManager.h"
 
 __code stackTest1(struct Stack* stack) {
     Node* node = new Node();