siaod_2/QueueNode.cpp at main · Luzinsan/siaod_2 · 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
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
#include "QueueNode.h"
#include <iostream>
namespace luzinsan
{
	//Указатель на начальный элемент очереди
	QueueNode* QueueNode::q_BeginQueueA{ nullptr };
	QueueNode* QueueNode::q_BeginQueueA_B{ nullptr };
	QueueNode* QueueNode::q_BeginQueueB{ nullptr };
	//Указатель на конечный элемент очереди
	QueueNode* QueueNode::q_EndQueueA{ nullptr };
	QueueNode* QueueNode::q_EndQueueA_B{ nullptr };
	QueueNode* QueueNode::q_EndQueueB{ nullptr };
	int QueueNode::q_A{ 5 }, QueueNode::q_B{ 10 };


	QueueNode::QueueNode() : q_info{ 0 }, q_next{nullptr}{}

	const QueueNode& QueueNode::SetA(int A) { q_A = A; return *this; }
	const QueueNode& QueueNode::SetB(int B) { q_B = B; return *this; }

	// Добавить элемент в очередь
	const QueueNode& QueueNode::EnQueue(int x)
	{
		QueueNode* p = new QueueNode;
		if (p)
		{
			p->q_info = x;
			p->q_next = nullptr;

			if (x < q_A)
			{
				if (q_BeginQueueA == nullptr)
					q_BeginQueueA = p;
				else
					q_EndQueueA->q_next = p;
				q_EndQueueA = p;
			}
			else if (x >= q_A && x < q_B)
			{
				if (q_BeginQueueA_B == nullptr)
					q_BeginQueueA_B = p;
				else
					q_EndQueueA_B->q_next = p;
				q_EndQueueA_B = p;
			}
			else
			{
				if (q_BeginQueueB == nullptr)
					q_BeginQueueB = p;
				else
					q_EndQueueB->q_next = p;
				q_EndQueueB = p;
			}
		}
		else exit(EOF);
		return *this;
	}


	// Возвратить первый элемент очереди
	int QueueNode::DeQueue()
	{
		int val;
		QueueNode* p = new QueueNode;
		if (p)
		{
			p = q_BeginQueueA;
			if (q_BeginQueueA == nullptr)
			{
				p = q_BeginQueueA_B;
				if (q_BeginQueueA_B == nullptr)
				{
					p = q_BeginQueueB;
					if (q_BeginQueueB == nullptr)
					{
						std::cout << "\nОчередь закончилась\n";
						return 0;
					}
					else
					{
						val = q_BeginQueueB->q_info;
						q_BeginQueueB = p->q_next;
						if (q_BeginQueueB == nullptr)
							q_EndQueueB = nullptr;
					}
				}
				else
				{
					val = q_BeginQueueA_B->q_info;
					q_BeginQueueA_B = p->q_next;
					if (q_BeginQueueA_B == nullptr)
						q_EndQueueA_B = nullptr;
				}
			}
			else
			{
				val = q_BeginQueueA->q_info;
				q_BeginQueueA = p->q_next;
				if (q_BeginQueueA == nullptr)
					q_EndQueueA = nullptr;
			}
			delete p;
		}
		else exit(EOF);
		return val;
	}
}