Changeset 12bbb367

Timestamp:

Mar 9, 2018, 10:56:32 AM (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:

f86c8e5

Parents:

e59f0bf

git-author:

Aaron Moss <a3moss@…> (03/09/18 10:55:43)

git-committer:

Aaron Moss <a3moss@…> (03/09/18 10:56:32)

Message:

Formatting fixes to C++ code listing

File:

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

doc/papers/general/Paper.tex

@@ -2904 +2904 @@
                 T value;
                 node * next;
-                node( const T & v, node * n = nullptr ) : value( v), next( n) {}
+                node( const T & v, node * n = nullptr ) : value( v ), next( n ) {}
         };
         node * head;
@@ -2915 +2915 @@
                 head = nullptr;
         }
-        void copy( const stack<T> & o) {
+        void copy( const stack<T> & o ) {
                 node ** crnt = &head;
-                for ( node * next = o.head;; next; next = next->next ) {
+                for ( node * next = o.head; next; next = next->next ) {
                         *crnt = new node{ next->value }; /***/
                         crnt = &(*crnt)->next;
@@ -2924 +2924 @@
         }
         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 ); }
+        stack( stack<T> && o ) : head( o.head) { o.head = nullptr; }
         ~stack() { clear(); }
         stack & operator= ( const stack<T> & o) {
                 if ( this == &o ) return *this;
                 clear();
-                copy( o);
+                copy( o );
                 return *this;
         }
-        stack & operator= ( stack<T> && o) {
+        stack & operator= ( stack<T> && o ) {
                 if ( this == &o ) return *this;
                 head = o.head;
@@ -2940 +2940 @@
         }
         bool empty() const { return head == nullptr; }
-        void push( const T & value) { head = new node{ value, head };  /***/ }
+        void push( const T & value ) { head = new node{ value, head };  /***/ }
         T pop() {
                 node * n = head;
                 head = n->next;
-                T x = std::move( n->value);
+                T x = std::move( n->value );
                 delete n;
                 return x;