Queue.java

package model;

public class Queue {
    private int[] array;
    private int front;
    private int rear;
    private int size;
    private int capacity;

    public Queue() {
        this.capacity = 10; // Initial capacity
        this.array = new int[capacity];
        this.front = 0;
        this.rear = -1;
        this.size = 0;
    }

    public void enqueue(int bookingId) {
        if (size == capacity) {
            resize();
        }
        rear = (rear + 1) % capacity;
        array[rear] = bookingId;
        size++;
        System.out.println("Enqueued booking ID: " + bookingId);
    }

    public Integer dequeue() {
        if (isEmpty()) {
            System.out.println("Queue is empty");
            return null;
        }
        int bookingId = array[front];
        front = (front + 1) % capacity;
        size--;
        System.out.println("Dequeued booking ID: " + bookingId);
        return bookingId;
    }

    public boolean isEmpty() {
        return size == 0;
    }

    public int size() {
        return size;
    }

    public int[] getQueue() {
        int[] result = new int[size];
        for (int i = 0; i < size; i++) {
            result[i] = array[(front + i) % capacity];
        }
        return result;
    }

    private void resize() {
        int newCapacity = capacity * 2;
        int[] newArray = new int[newCapacity];
        for (int i = 0; i < size; i++) {
            newArray[i] = array[(front + i) % capacity];
        }
        array = newArray;
        front = 0;
        rear = size - 1;
        capacity = newCapacity;
        System.out.println("Resized queue to capacity: " + capacity);
    }
}