Changeset 4c80a75 for doc/papers/general/Paper.tex

Timestamp:

May 1, 2018, 9:17:06 AM (7 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, with_gc

Children:

1518b39, 7f0001c, 94dea96

Parents:

8a5bdf0

Message:

update evaluation programs

File:

• doc/papers/general/Paper.tex (modified) (8 diffs)

doc/papers/general/Paper.tex

@@ -2875 +2875 @@
 }
 _Bool stack_empty( const stack * s ) {
-         return s->head == NULL;
+        return s->head == NULL;
 }
 void push_stack( stack * s, void * v ) {
-        node * n = malloc(sizeof(node)); /***/
+        node * n = malloc( sizeof(node) ); /***/
         *n = (node){ v, s->head }; /***/
         s->head = n;
@@ -2908 +2908 @@
         };
         struct stack { node(T) * head; };
-        void ?{}( stack(T) & s ) { (s.head){ 0 }; }
-        void ?{}( stack(T) & s, stack(T) t ) {
+        void ?{}( stack(T) & s, stack(T) t ) { // copy
                 node(T) ** cr = &s.head;
                 for ( node(T) * nx = t.head; nx; nx = nx->next ) {
@@ -2923 +2922 @@
                         nx = cr->next;
                         ^(*cr){};
-                        free(cr);
+                        free( cr );
                 }
                 head = 0;
         }
+
 \end{cfa}
 &
 \begin{cfa}[xleftmargin=0pt,aboveskip=0pt,belowskip=0pt]
+        void ?{}( stack(T) & s ) { (s.head){ 0 }; }
         void ^?{}( stack(T) & s) { clear( s ); }
         stack(T) ?=?( stack(T) & s, stack(T) t ) {
@@ -2954 +2955 @@
         }
 }
-
 \end{cfa}
 \end{tabular}
@@ -3003 +3003 @@
                 return *this;
         }
-        bool empty() const { return head == nullptr; }
+        bool empty() const {
+                return head == nullptr;
+        }
         void push( const T & value ) {
                 head = new node{ value, head };  /***/
@@ -3015 +3017 @@
         }
 };
-
-
 
 \end{cfa}
@@ -3066 +3066 @@
                 return *this;
         }
-        bool empty() const { return head == nullptr; }
+        bool empty() const {
+                return head == nullptr;
+        }
         void push( const object & value ) {
                 head = new node{ value, head }; /***/
@@ -3079 +3081 @@
 };
 
-
-
 \end{cfa}
 \end{tabular}