data_structures::stack_using_queue::Stack Struct Reference

Stack Class implementation for basic methods of Stack Data Structure. More...

Collaboration diagram for data_structures::stack_using_queue::Stack:

Public Member Functions
int	top ()
void	push (int val)
	Inserts an element to the top of the stack.
void	pop ()
	Removes the topmost element from the stack.
int	size ()
	Utility function to return the current size of the stack.

Public Attributes
std::queue< int64_t >	main_q
	stores the current state of the stack
std::queue< int64_t >	auxiliary_q
uint32_t	current_size = 0
	stores the current size of the stack

Detailed Description

Stack Class implementation for basic methods of Stack Data Structure.

Definition at line 31 of file stack_using_queue.cpp.

Member Function Documentation

pop()

void data_structures::stack_using_queue::Stack::pop ( )

inline

Removes the topmost element from the stack.

Returns

void

Definition at line 62 of file stack_using_queue.cpp.

               {
        if (main_q.empty()) {
            return;
        }
        main_q.pop();
        current_size--;
    }

push()

void data_structures::stack_using_queue::Stack::push ( int val )

inline

Inserts an element to the top of the stack.

Parameters

val	the element that will be inserted into the stack

Returns

void

Definition at line 48 of file stack_using_queue.cpp.

                       {
        auxiliary_q.push(val);
        while (!main_q.empty()) {
            auxiliary_q.push(main_q.front());
            main_q.pop();
        }
        swap(main_q, auxiliary_q);
        current_size++;
    }

size()

int data_structures::stack_using_queue::Stack::size ( )

inline

Utility function to return the current size of the stack.

Returns

current size of stack

Definition at line 74 of file stack_using_queue.cpp.

{ return current_size; }

top()

int data_structures::stack_using_queue::Stack::top ( )

inline

Returns the top most element of the stack

Returns

top element of the queue

Definition at line 41 of file stack_using_queue.cpp.

{ return main_q.front(); }

Member Data Documentation

auxiliary_q

std::queue<int64_t> data_structures::stack_using_queue::Stack::auxiliary_q

used to carry out intermediate operations to implement stack

Definition at line 33 of file stack_using_queue.cpp.

current_size

uint32_t data_structures::stack_using_queue::Stack::current_size = 0

stores the current size of the stack

Definition at line 35 of file stack_using_queue.cpp.

main_q

std::queue<int64_t> data_structures::stack_using_queue::Stack::main_q

stores the current state of the stack

Definition at line 32 of file stack_using_queue.cpp.

---

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

• data_structures/stack_using_queue.cpp