Newer
Older
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#ifndef __LINKEDLIST_NODE__
#define __LINKEDLIST_NODE__
#include <iostream>
template <typename T>
class Node
{
private:
T value;
int count;
Node<T>* next;
Node<T>* prev;
public:
Node();
Node( T );
Node( T, Node*, Node* );
T getValue();
void setValue(T val);
Node* getNext();
void setNext(Node*);
Node* getPrevious();
void setPrevious(Node*);
int getCount();
void setCount(int);
};
template<typename T>
Node<T>::Node(void):
count(0), next(NULL), prev(NULL) {}
template<typename T>
Node<T>::Node(T val):
value(val), count(0), next(NULL), prev(NULL) {}
template<typename T>
Node<T>::Node(T val, Node* n, Node* p):
value(val), next(n), prev(p) {}
template<typename T>
T Node<T>::getValue(void)
{
return this->value;
}
template<typename T>
Node<T>* Node<T>::getNext(void)
{
return this->next;
}
template<typename T>
void Node<T>::setNext(Node<T>* n)
{
this->next = n;
}
template<typename T>
Node<T>* Node<T>::getPrevious(void)
{
return this->prev;
}
template<typename T>
void Node<T>::setPrevious(Node<T>* p)
{
this->prev = p;
}
template<typename T>
int Node<T>::getCount()
{
return this->count;
}
template<typename T>
void Node<T>::setCount(int c)
{
this->count = c;
}
#endif /* defined(__LinkedList__Node__) */