source: doc/papers/general/evaluation/cfa-stack.h @ ac4dad2

aaron-thesisarm-ehcleanup-dtorsdeferred_resndemanglerjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerwith_gc
Last change on this file since ac4dad2 was ac4dad2, checked in by Peter A. Buhr <pabuhr@…>, 4 years ago

shorten experimental code

  • Property mode set to 100644
File size: 352 bytes
Line 
1#pragma once
2
3forall( otype T ) {
4        struct node;
5        struct stack {
6                node(T) * head;
7        };
8
9        void ?{}( stack(T) & s );
10        void ?{}( stack(T) & s, stack(T) t );
11        void ^?{}( stack(T) & s);
12        void clear( stack(T) & s );
13
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 TracBrowser for help on using the repository browser.