queue/functions at master · Sara3/queue · 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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
//---------------------------------------------------------
// File--------main.cpp
// Programmer--Sabera Daqiq
//
// This program computes the average time a person waits in a queue
//---------------------------------------------------------
#include <iostream>
#include <string>
#include <queue>
#include <stdlib.h>
#include "myfunc.h"
using namespace std;
//-------------------------------------------------------------------------
//Queue::Queue()
//This is a constractor
// Input parameters:
//    None
// Output parameters:
//    None
// Return value:
//    None
//-------------------------------------------------------------------------

Queue::Queue(){
	front=NULL;
	back=NULL;
	size=0;
}
//-------------------------------------------------------------------------
//Queue::~Queue()
//This is a destractor
// Input parameters:
//    None
// Output parameters:
//    None
// Return value:
//    None
//-------------------------------------------------------------------------
Queue::~Queue(){
	Node*ptr;
	while(front!=NULL){
		ptr=front;
		front=front->link;
		delete ptr;
		}
	return;
}
//-------------------------------------------------------------------------
//bool Queue::isEmpty()
//This function checks if the queue is empty
// Input parameters:
//    None
// Output parameters:
//    None
// Return value:
//    true/false
//-------------------------------------------------------------------------
bool Queue::isEmpty(){
	if(front==NULL)
		return true;
		else
			return false;
}
//-------------------------------------------------------------------------
//int Queue::enqueue(int newdata, int time )
//This function insert ID and time into the queue
// Input parameters:
//    Newdata, time
// Output parameters:
//    None
// Return value:
//    none
//-------------------------------------------------------------------------
 int Queue::enqueue(int newdata, int time ){
	Node *newNode;
	newNode = new Node;
	newNode->id = newdata;
	newNode->time = time;
	if(isEmpty()){
      front = newNode;
      front->link = NULL;
      back = front;
	  }else{
      back->link = newNode;
      back = back->link;
      back->link = NULL;
    }
	size++;
	return 0;
 }
//-------------------------------------------------------------------------
//int Queue::dequeue (int &id, int &time)
//This function insert ID and time out of the queue
// refrence parameters:
//    Newdata, time
//
// Return value:
//    none
//-------------------------------------------------------------------------
int Queue::dequeue (int &id, int &time){
	time=0;
	Node*trash;
	trash=front;
	id=front->id;
	time=front->time;
	front=front->link;
	delete trash;
	size--;
	if(isEmpty()){
		cout<<"The queue is Empty";
		}
	return 0;
}
//-------------------------------------------------------------------------
//int Queue::getSize()
//This function gives the size  queue
// refrence parameters:
//    None
//
// Return value:
//    size
//-------------------------------------------------------------------------
int Queue::getSize(){
	return this->size;
}