Changeset 81e8ab0 for doc/papers/general/evaluation/cpp-stack.hpp

Timestamp:

Mar 9, 2018, 9:30:47 AM (8 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, resolv-new, with_gc

Children:

8b001bd

Parents:

29db723

Message:

more updates

File:

• doc/papers/general/evaluation/cpp-stack.hpp (modified) (4 diffs)

doc/papers/general/evaluation/cpp-stack.hpp

@@ -2 +2 @@
 #include <utility>
 
-template<typename T> class stack {
+template<typename T> struct stack {
         struct node {
                 T value;
-                node* next;
+                node * next;
+                node( const T & v, node * n = nullptr ) : value( v ), next( n ) {}
+        };
+        node * head;
 
-                node( const T& v, node* n = nullptr ) : value(v), next(n) {}
-        };
-        node* head;
+        stack() : head( nullptr ) {}
+        stack( const stack<T> & o) { copy( o ); }
+        stack( stack<T> && o ) : head( o.head ) { o.head = nullptr; }
 
-        void copy(const stack<T>& o) {
-                node** crnt = &head;
-                for ( node* next = o.head; next; next = next->next ) {
+        void copy( const stack<T> & o ) {
+                node ** crnt = &head;
+                for ( node * next = o.head; next; next = next->next ) {
                         *crnt = new node{ next->value }; /***/
                         crnt = &(*crnt)->next;
@@ -19 +22 @@
                 *crnt = nullptr;
         }
-public:
+
         void clear() {
-            for ( node* next = head; next; ) {
-                        node* crnt = next;
+                for ( node * next = head; next; ) {
+                        node * crnt = next;
                         next = crnt->next;
                         delete crnt;
@@ -29 +32 @@
         }
 
-        stack() : 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) {
+        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;
@@ -50 +50 @@
         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;
+                node * n = head;
                 head = n->next;
-                T x = std::move(n->value);
+                T v = std::move( n->value );
                 delete n;
-                return x;
+                return v;
         }
 };