Changeset 860f19f for doc/papers/general/Paper.tex

Timestamp:

Mar 9, 2018, 2:28:09 PM (7 years ago)

Author:

Aaron Moss <a3moss@…>

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, resolv-new, with_gc

Children:

200b2b5, e2c70ab

Parents:

e84382b

Message:

Clean up code edits

File:

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

doc/papers/general/Paper.tex

@@ -2637 +2637 @@
                                                                         & \CT{C}        & \CT{\CFA}     & \CT{\CC}      & \CT{\CCV}             \\ \hline
 maximum memory usage (MB)                       & 10,001        & 2,502         & 2,503         & 11,253                \\
-source code size (lines)                        & 197           & 186           & 125           & 293                   \\
+source code size (lines)                        & 196           & 186           & 125           & 290                   \\
 redundant type annotations (lines)      & 27            & 0                     & 2                     & 16                    \\
 binary size (KB)                                        & 14            & 257           & 14            & 37                    \\
@@ -2843 +2843 @@
 }
 _Bool stack_empty( const struct stack * s ) { return s->head == NULL; }
-void push_stack( struct stack * s, void * value ) {
+void push_stack( struct stack * s, void * v ) {
         struct stack_node * n = malloc( sizeof(struct stack_node) ); /***/
-        *n = (struct stack_node){ value, s->head }; /***/
+        *n = (struct stack_node){ v, s->head }; /***/
         s->head = n;
 }
@@ -2968 +2968 @@
         node * head;
         stack() : head( nullptr ) {}
-        stack( const stack<T> & o) { copy( o ); }
-        stack( stack<T> && o ) : head( o.head ) { o.head = nullptr; }
+        stack( const stack<T> & o ) { copy( o ); }
         void clear() {
                 for ( node * next = head; next; ) {