Lab-Works/queue.cpp at master · PrajwolM/Lab-Works · 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
#include <iostream>
#include "queue.h"
//lab1
Queue :: Queue(){
  front = -1;
  rear = -1;
}

Queue :: ~Queue(){}

bool Queue :: isEmpty(){
  return front == rear;
}

bool Queue :: isFull(){
  return rear == MAX - 1;
}

void Queue :: enqueue(char data){
  if(!isFull()){
    rear = rear + 1;
    elements[rear] = data;
  }
  else{
    std::cout << "Queue Overflow" << "\n";
  }
}

char Queue :: dequeue(){
  if(!isEmpty()){
    front = front + 1;
    return elements[front];
  }
  else{
    std::cout <<"Queue Underflow" << "\n";
    return '-';
  }
}

char Queue :: peekFront(){
  if(!isEmpty()){
    return elements[front+1];
  }
  else{
    std::cout <<"Queue Underflow" << "\n";
    return '-';
  }
}

char Queue :: peekRear(){
  if(!isEmpty()){
    return elements[rear];
  }
  else{
    std::cout <<"Queue Underflow" << "\n";
    return '-';
  }
}


int main() {
  Queue Q;
  std::cout << Q.isEmpty() << '\n';
  std::cout << Q.isFull() << '\n';
  Q.enqueue('a');
  Q.enqueue('b');
  Q.enqueue('x');
  Q.enqueue('c');
  Q.enqueue('d');
  std::cout << Q.dequeue() << '\n';
  std::cout << Q.dequeue() << '\n';
  std::cout << Q.peekFront() << '\n';
  std::cout << Q.peekRear() << '\n';

  return 0;
}