- File:
-
- 1 edited
-
doc/papers/general/evaluation/cfa-stack.h (modified) (1 diff)
Legend:
- Unmodified
- Added
- Removed
-
doc/papers/general/evaluation/cfa-stack.h
r29db723 r4c80a75 1 1 #pragma once 2 2 3 forall( otype T ) struct stack_node; 4 forall( otype T ) struct stack { 5 stack_node(T) * head; 6 }; 3 forall( otype T ) { 4 struct node; 5 struct stack { 6 node(T) * head; 7 }; 7 8 8 forall( otype T ) void ?{}( stack(T) & s);9 forall( otype T ) void ?{}( stack(T) & s, stack(T) t);10 forall( otype T ) stack(T) ?=?( stack(T) & s, stack(T) t);11 forall( otype T )void ^?{}( stack(T) & s);9 void ?{}( stack(T) & s, stack(T) t ); 10 void clear( stack(T) & s ); 11 void ?{}( stack(T) & s ); 12 void ^?{}( stack(T) & s); 12 13 13 forall( otype T ) _Bool empty( const stack(T) & s ); 14 forall( otype T ) void push( stack(T) & s, T value ); 15 forall( otype T ) T pop( stack(T) & s ); 16 forall( otype T ) void clear( stack(T) & s ); 14 stack(T) ?=?( stack(T) & s, stack(T) t ); 15 _Bool empty( const stack(T) & s ); 16 void push( stack(T) & s, T value ); 17 T pop( stack(T) & s ); 18 }
Note:
See TracChangeset
for help on using the changeset viewer.