Changeset c9b3a41 for doc/papers/general/evaluation/cfastack.c
 Timestamp:
 Mar 2, 2018, 6:52:37 AM (4 years ago)
 Branches:
 aaronthesis, armeh, cleanupdtors, deferred_resn, demangler, enum, forallpointerdecay, jacob/cs343translation, jenkinssandbox, master, newast, newastuniqueexpr, newenv, no_list, persistentindexer, pthreademulation, resolvnew, with_gc
 Children:
 000ff2c
 Parents:
 ab3251e
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/papers/general/evaluation/cfastack.c
rab3251e rc9b3a41 4 4 forall(otype T) struct stack_node { 5 5 T value; 6 stack_node(T) * next;6 stack_node(T) * next; 7 7 }; 8 forall(otype T) void ?{}( stack_node(T) & node, T value, stack_node(T) * next ) { 9 node.value = value; 10 node.next = next; 11 } 8 12 9 forall(otype T) void ?{}( stack(T)* s) { (&s>head){ 0 }; }13 forall(otype T) void ?{}( stack(T) & s ) { (s.head){ 0 }; } 10 14 11 forall(otype T) void ?{}( stack(T)* s, stack(T) t) {12 stack_node(T) ** crnt = &s>head;13 for ( stack_node(T) * next = t.head; next; next = next>next ) {14 *crnt = ((stack_node(T)*)malloc()){ next>value }; /***/15 stack_node(T) * acrnt = *crnt;15 forall(otype T) void ?{}( stack(T) & s, stack(T) t ) { 16 stack_node(T) ** crnt = &s.head; 17 for ( stack_node(T) * next = t.head; next; next = next>next ) { 18 *crnt = new( next>value, 0 ); 19 stack_node(T) * acrnt = *crnt; 16 20 crnt = &acrnt>next; 17 21 } … … 19 23 } 20 24 21 forall(otype T) stack(T) ?=?( stack(T)* s, stack(T) t) {22 if ( s >head == t.head ) return *s;23 clear( s);25 forall(otype T) stack(T) ?=?( stack(T) & s, stack(T) t ) { 26 if ( s.head == t.head ) return s; 27 clear( s ); 24 28 s{ t }; 25 return *s;29 return s; 26 30 } 27 31 28 forall(otype T) void ^?{}( stack(T)* s) { clear(s); }32 forall(otype T) void ^?{}( stack(T) & s) { clear( s ); } 29 33 30 forall(otype T) _Bool empty( const stack(T)* s) { return s>head == 0; }34 forall(otype T) _Bool empty( const stack(T) & s ) { return s.head == 0; } 31 35 32 forall(otype T) void push( stack(T)* s, T value) {33 s>head = ((stack_node(T)*)malloc()){ value, s>head }; /***/ 36 forall(otype T) void push( stack(T) & s, T value ) { 37 s.head = new( value, s.head ); 34 38 } 35 39 36 forall(otype T) T pop( stack(T)* s) {37 stack_node(T) * n = s>head;38 s >head = n>next;39 T x= n>value;40 ^n{};41 free( n);42 return x;40 forall(otype T) T pop( stack(T) & s ) { 41 stack_node(T) * n = s.head; 42 s.head = n>next; 43 T v = n>value; 44 // ^n{}; 45 free( n ); 46 return v; 43 47 } 44 48 45 forall(otype T) void clear( stack(T)* s) {46 for ( stack_node(T)* next = s>head; next; ) {47 stack_node(T) * crnt = next;49 forall(otype T) void clear( stack(T) & s ) { 50 for ( stack_node(T) * next = s.head; next; ) { 51 stack_node(T) * crnt = next; 48 52 next = crnt>next; 49 delete( crnt);53 delete( crnt ); 50 54 } 51 s >head = 0;55 s.head = 0; 52 56 }
Note: See TracChangeset
for help on using the changeset viewer.