dataStructures-algorithms/priority_queue.cpp at master · nowhh01/dataStructures-algorithms · 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
63
64
65
66
67
68
69
70
71
72
73
74
// problem is to allow relatively fast enqueuing and dequeuing
// adding: O(n)
// searching: O(n)

template<typename T>
struct Node
{
	T Data;
	Node* Next;
};

template<typename T, typename C>  // Type, Compare
class Queue
{
public:
	Queue();
	~Queue();

	int GetSize() const;
	bool IsEmpty() const;

	void Push(const T&);
	T& Top();
	T& Pop();

private:
	Node* mFront;
	int mSize;
};

template<typename T, typename C>
Queue<T, C>::Queue() : mFront{nullptr}, mSize{0}
{
	//decltype
}

template<typename T, typename C>
Queue<T, C>::~Queue()
{
}

template<typename T, typename C>
int Queue<T, C>::GetSize() const
{
	return mSize;
}

template<typename T, typename C>
bool Queue<T, C>::IsEmpty() const
{
	return mFront == nullptr;
}

template<typename T, typename C>
void Queue<T, C>::Push(const T& data)
{

}

template<typename T, typename C>
T& Queue<T, C>::Top()
{
	return;
}

template<typename T, typename C>
T& Queue<T, C>::Pop()
{
	return;
}

int main()
{
}