DS_Project1/MemberQueue.cpp at main · dbfanck/DS_Project1 · 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
#include "MemberQueue.h"

MemberQueue::MemberQueue()
{
    front_ptr=nullptr;
    rear_ptr=nullptr;
    cnt=0;
    capacity=0; //max queue nodes
}
MemberQueue::~MemberQueue()
{

}

bool MemberQueue::empty() //Is queue empty?
{
    if(cnt==0)
    {
        return true;
    }
    else
    {
        return false;
    }

}
bool MemberQueue::full() //Is queue full?
{
    if(cnt==capacity)
    {
        return true;
    }
    else
    {
        return false;
    }

}
void MemberQueue::push(MemberQueueNode* curNode)
{
	if(empty()==true)
    {
        curNode->setNext(nullptr);
        front_ptr=curNode;
        rear_ptr=curNode;
        cnt++; //count up
    }
    else if(full()==false)
    {
        curNode->setNext(nullptr);
        rear_ptr->setNext(curNode);
        rear_ptr=curNode;
        cnt++; //count up
    }
}
MemberQueueNode MemberQueue::pop()
{
    if(empty()==false)
    {
        MemberQueueNode* delNode=front_ptr;
        front_ptr=front_ptr->getNext(); //change front
        cnt--; //count down
        return *delNode;
    }
    else
    {
        exit(-1); //program end
    }
}
MemberQueueNode MemberQueue::front()
{
    return *front_ptr;
}