comparison src/parallel_execution/Stack.cbc @ 250:8a8963ce9858

fix generate_stub
author mir3636
date Wed, 25 Jan 2017 21:22:56 +0900
parents afa1e02e4386
children 3529c7e93c4f
comparison
equal deleted inserted replaced
249:afa1e02e4386 250:8a8963ce9858
1 typedef struct Stack<Impl>{ 1 typedef struct Stack<Impl>{
2 union Data* stack; 2 union Data* stack;
3 union Data* data; 3 union Data* data;
4 union Data* data1; 4 union Data* data1;
5 enum Code whenEmpty; 5 __code whenEmpty(...);
6 __code clear(Impl* stack,__code next(...)); 6 __code clear(Impl* stack,__code next(...));
7 enum Code push; 7 __code push(Impl* stack,union Data* data, __code next(...));
8 enum Code pop; 8 __code pop(Impl* stack, __code next(union Data*, ...));
9 enum Code pop2; 9 __code pop2(Impl* stack, union Data** data, union Data** data1, __code next(union Data**, union Data**, ...));
10 enum Code isEmpty; 10 __code isEmpty(Impl* stack, __code next(...), __code whenEmpty(...));
11 enum Code get; 11 __code get(Impl* stack, union Data** data, __code next(...));
12 enum Code get2; 12 __code get2(Impl* stack,..., __code next(...));
13 enum Code next; 13 __code next(...);
14 } Stack; 14 } Stack;
15 15
16 __code clear(Impl* stack,__code next(...)) {
17 }
18
19 __code pushSingleLinkedStack(struct SingleLinkedStack* stack,union Data* data, __code next(...)) {
20 }
21
22 __code popSingleLinkedStack(struct SingleLinkedStack* stack, __code next(..., union Data*)) {
23 }
24
25 __code pop2SingleLinkedStack(struct SingleLinkedStack* stack, union Data** data, union Data** data1, __code next(..., union Data**, union Data**)) {
26 }
27
28 __code getSingleLinkedStack(struct SingleLinkedStack* stack, union Data** data, __code next(...)) {
29 }
30
31 __code get2SingleLinkedStack(struct SingleLinkedStack* stack,..., __code next(...)) {
32 }
33
34 __code isEmptySingleLinkedStack(struct SingleLinkedStack* stack, __code next(...), __code whenEmpty(...)) {
35 }
36
37