Dlinklist/main.cpp at master · HerbertRHolder/Dlinklist · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <iostream>
using namespace std;


template <class T> struct Node {
  T value;
  Node<T> *next;
  Node<T> *previous;

};

template <class t>
class Dlinklist {

public: //for debugging keep public
  int count;
  Node<t> *head;
  Node<t> *tail;
  Node<t> *current;
  Node<t> *follow;

  Dlinklist();
//   ~Dlinklist();
  Dlinklist(t item);

  Node<t> *firstNode() const;
  Node<t> *lastNode() const;
  Node<t> *findNode(int pos) const;
  Node<t> *findItem(t val) const;
  void pop();
  void destroyNode(t &item);
  void destroylist();
  bool isEmpty() const;
  void insert(t val, int pos);
  int size() const;
  void print();

};

template <class t>
Dlinklist <t>::Dlinklist(){
    count = 0;
   head = NULL;
   tail = NULL;
   current = NULL;
   follow = NULL;
}

// ~Dlinklist(){} will write destructor later

template <class t>
Dlinklist <t>::Dlinklist(t val){
    Node <t> *n = new Node <t>;
    n->value = val;
    head = n;
    tail = head;
    count++;
}

int main() {

}