data_structures::queue_using_array::Queue_Array Class Reference

Queue_Array class containing the main data and also index of head and tail of the array. More...

Collaboration diagram for data_structures::queue_using_array::Queue_Array:

Public Member Functions
void	enqueue (const int16_t &)
	Add element to the first of the queue.
int	dequeue ()
	Delete element from back of the queue.
void	display () const
	Show all saved data.

Private Attributes
int8_t	front {-1}
	Index of head of the array.
int8_t	rear {-1}
	Index of tail of the array.
std::array< int16_t, max_size >	arr {}
	All stored data.

Detailed Description

Queue_Array class containing the main data and also index of head and tail of the array.

Definition at line 44 of file queue_using_array.cpp.

Member Function Documentation

dequeue()

int data_structures::queue_using_array::Queue_Array::dequeue

(

)

Delete element from back of the queue.

Remove element that is located at the first of the queue.

Returns

data that is deleted if queue is not empty

Definition at line 76 of file queue_using_array.cpp.

                         {
    int8_t d{0};
    if (front == -1) {
        std::cout << "\nstack is empty ";
        return 0;
    } else if (front == rear) {
        d = arr.at(front);
        front = rear = -1;
    } else {
        d = arr.at(front++);
    }
 
    return d;
}

display()

void data_structures::queue_using_array::Queue_Array::display

(

)

const

Show all saved data.

Utility function to show all elements in the queue.

Definition at line 94 of file queue_using_array.cpp.

                                {
    if (front == -1) {
        std::cout << "\nStack is empty";
    } else {
        for (int16_t i{front}; i <= rear; ++i) std::cout << arr.at(i) << " ";
    }
}

enqueue()

void data_structures::queue_using_array::Queue_Array::enqueue

(

const int16_t &

ele

)

Add element to the first of the queue.

Adds new element to the end of the queue.

Parameters

ele	to be added to the end of the queue

Definition at line 59 of file queue_using_array.cpp.

                                            {
    if (rear == arr.size() - 1) {
        std::cout << "\nStack is full";
    } else if (front == -1 && rear == -1) {
        front = 0;
        rear = 0;
        arr[rear] = ele;
    } else if (rear < arr.size()) {
        ++rear;
        arr[rear] = ele;
    }
}

Member Data Documentation

arr

std::array<int16_t, max_size> data_structures::queue_using_array::Queue_Array::arr {}

private

All stored data.

Definition at line 52 of file queue_using_array.cpp.

{};  

front

int8_t data_structures::queue_using_array::Queue_Array::front {-1}

private

Index of head of the array.

Definition at line 50 of file queue_using_array.cpp.

{-1};                     

rear

int8_t data_structures::queue_using_array::Queue_Array::rear {-1}

private

Index of tail of the array.

Definition at line 51 of file queue_using_array.cpp.

{-1};                      

---

The documentation for this class was generated from the following file:

• data_structures/queue_using_array.cpp