Rodex_

linked_list_shared_ptr

Jun 18th, 2017
294
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.48 KB | None | 0 0
  1. #include <iostream>
  2. #include <memory>
  3.  
  4. using namespace std;
  5.  
  6. int node_counter = 0;
  7.  
  8. template<typename T> class LinkedList;
  9.  
  10. template<typename T>
  11. class Node
  12. {
  13. friend class LinkedList<T>;
  14.  
  15. private:
  16.     T _val;
  17.     shared_ptr<Node<T>> _prev;
  18.     shared_ptr<Node<T>> _next;
  19.  
  20. public:
  21.     Node(T v) : _val(v) { cout << "    " << "Constructing Node " << v << endl; node_counter++; }
  22.     virtual ~Node() { cout << "    " << "Destructing Node " << _val << endl; node_counter--; }
  23.  
  24.     T getVal() { return _val; }
  25.     shared_ptr<Node<T>> getPrev() { return _prev; }
  26.     shared_ptr<Node<T>> getNext() { return _next; }
  27. };
  28.  
  29. template<typename T>
  30. class LinkedList
  31. {
  32. private:
  33.     shared_ptr<Node<T>> _head;
  34.     shared_ptr<Node<T>> _tail;
  35.  
  36. public:
  37.     shared_ptr<Node<T>> getHead() { return _head; }
  38.     shared_ptr<Node<T>> getTail() { return _tail; }
  39.  
  40.     void add(T element)
  41.     {
  42.         auto new_node = make_shared<Node<T>>(element);
  43.         //Wenn erstes Element dann füge es in das headelement ein
  44.         if(_tail == nullptr){
  45.             _head = new_node;
  46.             _tail = new_node;
  47.         }else{
  48.             _tail->_next = new_node;
  49.             new_node->_prev = _tail;
  50.             new_node->_next = nullptr;
  51.             _tail = new_node;
  52.         }
  53.     }
  54.  
  55.     void clear()
  56.     {
  57.         auto temp = _head;  
  58.         while(temp != nullptr){
  59.             temp = _head->_next;
  60.             _head->_next.reset();
  61.             _head.reset();
  62.         }
  63.     }
  64. };
Advertisement
Add Comment
Please, Sign In to add comment