-
Notifications
You must be signed in to change notification settings - Fork 0
/
Node.h
135 lines (107 loc) · 3.42 KB
/
Node.h
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
/*
* Node.h
*
* Created on: May 2, 2018
* Author: Yuun
*/
#ifndef SRC_NODE_H_
#define SRC_NODE_H_
#include <functional>
template<typename Priority, typename Data>
class Node{
public:
Node();
Node(Data data);
Node(Priority priority, Data data);
Node(Priority priority, Node<Priority, Data>* left, Node<Priority, Data>* right);
const Priority& priority() const;
Data& data();
Node<Priority, Data>*& left();
Node<Priority, Data>*& right();
bool operator<(Node<Priority, Data>& source);
bool operator<=(Node<Priority, Data>& source);
bool operator>(Node<Priority, Data>& source);
bool operator>=(Node<Priority, Data>& source);
bool operator==(Node<Priority, Data>& source);
bool operator!=(Node<Priority, Data>& source);
friend std::ostream& operator<<(std::ostream& output,
const Node<Priority, Data>& source) {
if (source.data_ != -1) {
output << source.data_ << "\t";
}
output << source.priority_;
return output;
}
private:
Priority priority_;
Data data_;
Node<Priority, Data>* left_;
Node<Priority, Data>* right_;
};
template<typename Priority, typename Data>
Node<Priority, Data>::Node() : priority_(), data_(-1), left_(NULL), right_(NULL) {
}
template<typename Priority, typename Data>
Node<Priority, Data>::Node(Data data) : priority_(), data_(data), left_(NULL), right_(NULL) {}
template<typename Priority, typename Data>
Node<Priority, Data>::Node(Priority priority, Data data) {
priority_ = priority;
data_ = data;
left_ = NULL;
right_ = NULL;
}
template<typename Priority, typename Data>
Node<Priority, Data>::Node(Priority priority, Node<Priority, Data>* left, Node<Priority, Data>* right) {
priority_ = priority;
left_ = left;
right_ = right;
}
template<typename Priority, typename Data>
const Priority& Node<Priority, Data>::priority() const {
return priority_;
}
template<typename Priority, typename Data>
Data& Node<Priority, Data>::data() {
return data_;
}
template<typename Priority, typename Data>
Node<Priority, Data>*& Node<Priority, Data>::left() {
return left_;
}
template<typename Priority, typename Data>
Node<Priority, Data>*& Node<Priority, Data>::right() {
return right_;
}
template<typename Priority, typename Data>
bool Node<Priority, Data>::operator<(Node<Priority, Data>& source) {
return priority_ < source->priority_;
}
template<typename Priority, typename Data>
bool Node<Priority, Data>::operator>(Node<Priority, Data>& source) {
return priority_ > source->priority_;
}
template<typename Priority, typename Data>
bool Node<Priority, Data>::operator>=(Node<Priority, Data>& source) {
return priority_ ==source->priority_ || priority_ > source->priority_;
}
template<typename Priority, typename Data>
bool Node<Priority, Data>::operator<=(Node<Priority, Data>& source) {
return priority_ ==source->priority_ || priority_ < source->priority_;
}
template<typename Priority, typename Data>
bool Node<Priority, Data>::operator!=(Node<Priority, Data>& source) {
return priority_ !=source->priority_;
}
template<typename Priority, typename Data>
bool Node<Priority, Data>::operator==(Node<Priority, Data>& source) {
return priority_ ==source->priority_;
}
template<typename Priority, typename Data>
struct CompareNode: public std::binary_function<Node<Priority, Data>*,
Node<Priority, Data>*, bool> {
bool operator()(const Node<Priority, Data>* lhs_Node,
const Node<Priority, Data>* rhs_Node) {
return lhs_Node->priority() < rhs_Node->priority();
}
};
#endif /* SRC_NODE_H_ */