- File:
-
- 1 edited
-
doc/papers/general/evaluation/cpp-stack.hpp (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
doc/papers/general/evaluation/cpp-stack.hpp
rac4dad2 r860f19f 14 14 15 15 void clear() { 16 for ( node * n x = head; nx; ) {17 node * cr = nx;18 n x = cr->next;19 delete cr ;16 for ( node * next = head; next; ) { 17 node * crnt = next; 18 next = crnt->next; 19 delete crnt; 20 20 } 21 21 head = nullptr; … … 23 23 24 24 void copy( const stack<T> & o ) { 25 node ** cr = &head;26 for ( node * n x = o.head; nx; nx = nx->next ) {27 *cr = new node{ nx->value }; /***/28 cr = &(*cr)->next;25 node ** crnt = &head; 26 for ( node * next = o.head; next; next = next->next ) { 27 *crnt = new node{ next->value }; /***/ 28 crnt = &(*crnt)->next; 29 29 } 30 *cr = nullptr;30 *crnt = nullptr; 31 31 } 32 32
Note:
See TracChangeset
for help on using the changeset viewer.