Queue Implementation Gaming Project in C++

Projects Inventory

3 months ago

#include <iostream>
#include <vector>

class Queue {
private:
    std::vector<int> data;
    int frontIndex;
    int rearIndex;

public:
    // Constructor to initialize the queue
    Queue() : frontIndex(0), rearIndex(0) {}

    // Method to add an element to the queue
    void enqueue(int value) {
        data.push_back(value);
        rearIndex++;
    }

    // Method to remove and return the front element from the queue
    int dequeue() {
        if (isEmpty()) {
            throw std::out_of_range("Queue is empty");
        }
        int value = data[frontIndex];
        frontIndex++;
        return value;
    }

    // Method to get the front element without removing it
    int front() const {
        if (isEmpty()) {
            throw std::out_of_range("Queue is empty");
        }
        return data[frontIndex];
    }

    // Method to check if the queue is empty
    bool isEmpty() const {
        return frontIndex == rearIndex;
    }

    // Method to get the size of the queue
    int size() const {
        return rearIndex - frontIndex;
    }
};

int main() {
    Queue q;

    // Enqueue elements into the queue
    q.enqueue(10);
    q.enqueue(20);
    q.enqueue(30);
    q.enqueue(40);

    std::cout << "Front element: " << q.front() << std::endl;

    // Dequeue elements from the queue
    std::cout << "Dequeued: " << q.dequeue() << std::endl;
    std::cout << "Dequeued: " << q.dequeue() << std::endl;

    std::cout << "Front element after dequeuing: " << q.front() << std::endl;

    std::cout << "Queue size: " << q.size() << std::endl;

    return 0;
}

#include <iostream>

#include <vector>

class Queue {

private:

std::vector<int> data;

int frontIndex;

int rearIndex;

public:

// Constructor to initialize the queue

Queue() : frontIndex(0), rearIndex(0) {}

// Method to add an element to the queue

void enqueue(int value) {

data.push_back(value);

rearIndex++;

}

// Method to remove and return the front element from the queue

int dequeue() {

if (isEmpty()) {

throw std::out_of_range("Queue is empty");

}

int value = data[frontIndex];

frontIndex++;

return value;

}

// Method to get the front element without removing it

int front() const {

if (isEmpty()) {

throw std::out_of_range("Queue is empty");

}

return data[frontIndex];

}

// Method to check if the queue is empty

bool isEmpty() const {

return frontIndex == rearIndex;

}

// Method to get the size of the queue

int size() const {

return rearIndex - frontIndex;

}

};

int main() {

Queue q;

// Enqueue elements into the queue

q.enqueue(10);

q.enqueue(20);

q.enqueue(30);

q.enqueue(40);

std::cout << "Front element: " << q.front() << std::endl;

// Dequeue elements from the queue

std::cout << "Dequeued: " << q.dequeue() << std::endl;

std::cout << "Front element after dequeuing: " << q.front() << std::endl;

std::cout << "Queue size: " << q.size() << std::endl;

return 0;

}

Explanation

Queue Class:
- The Queue class is implemented using a std::vector<int> to store the elements.
- It maintains two indices: frontIndex and rearIndex, which represent the positions of the front and rear elements in the queue.
Enqueue Operation:
- The enqueue(int value)
  
  Advertisement
  
  method adds an element to the rear of the queue by pushing it to the back of the vector and increments rearIndex.
Dequeue Operation:
- The dequeue() method removes and returns the element at the front of the queue by accessing the element at frontIndex and then increments frontIndex. If the queue is empty, it throws an exception.
Front Operation:
- The front() method returns the element at the front of the queue without removing it. If the queue is empty, it throws an exception.
isEmpty Operation:
- The isEmpty() method checks if the queue is empty by comparing frontIndex and rearIndex.
Size Operation:
- The size() method returns the current size of the queue by calculating the difference between rearIndex and frontIndex.

Explanation

Related Posts: