This file contains implementation of Queue class.
More...
#include "list.h"
#include <initializer_list>
#include <iostream>
#include <utility>
Go to the source code of this file.
|
| template<typename T> |
| auto | dsa::operator== (const Queue< T > &queue1, const Queue< T > &queue2) -> bool |
| | The relational operator compares two Queue objects.
|
| template<typename T> |
| auto | dsa::operator< (const Queue< T > &queue1, const Queue< T > &queue2) -> bool |
| | The relational operator compares two Queue objects.
|
| template<typename T> |
| auto | dsa::operator<< (std::ostream &out, const Queue< T > &queue) -> std::ostream & |
| | Overloads operator to print all elements of Queue.
|
| template<typename T> |
| auto | dsa::operator!= (const Queue< T > &queue1, const Queue< T > &queue2) -> bool |
| | The relational operator compares two Queue objects.
|
| template<typename T> |
| auto | dsa::operator> (const Queue< T > &queue1, const Queue< T > &queue2) -> bool |
| | The relational operator compares two Queue objects.
|
| template<typename T> |
| auto | dsa::operator<= (const Queue< T > &queue1, const Queue< T > &queue2) -> bool |
| | The relational operator compares two Queue objects.
|
| template<typename T> |
| auto | dsa::operator>= (const Queue< T > &queue1, const Queue< T > &queue2) -> bool |
| | The relational operator compares two Queue objects.
|
This file contains implementation of Queue class.
- Author
- Michal Zygmunt
- Copyright
- Copyright (c) 2025 Michal Zygmunt This project is distributed under the MIT License. See accompanying LICENSE.txt file or obtain copy at https://opensource.org/license/mit
Definition in file queue.h.
◆ operator!=()
template<typename T>
| auto dsa::operator!= |
( |
const Queue< T > & | queue1, |
|
|
const Queue< T > & | queue2 ) -> bool
|
The relational operator compares two Queue objects.
- Template Parameters
-
| T | type of data stored in Queue |
- Parameters
-
| [in] | queue1 | input container |
| [in] | queue2 | input container |
- Return values
-
| true | if containers are not equal |
| false | if containers are equal |
Definition at line 395 of file queue.h.
396 {
398 }
constexpr auto operator==(const Array< T, N > &lhs, const Array< T, N > &rhs) noexcept(noexcept(*lhs.begin()== *rhs.begin())) -> bool
The relational operator compares two Array objects.
◆ operator<()
template<typename T>
| auto dsa::operator< |
( |
const Queue< T > & | queue1, |
|
|
const Queue< T > & | queue2 ) -> bool |
The relational operator compares two Queue objects.
Forward friend declaration to access internal container comparison operator.
- Template Parameters
-
| T | type of data stored in Queue |
- Parameters
-
| [in] | queue1 | input container |
| [in] | queue2 | input container |
- Return values
-
| true | if the content of queue1 are lexicographically less than the content of queue2 |
| false | otherwise |
Definition at line 411 of file queue.h.
412 {
413 return queue1.container < queue2.container;
414 }
◆ operator<<()
template<typename T>
| auto dsa::operator<< |
( |
std::ostream & | out, |
|
|
const Queue< T > & | queue ) -> std::ostream&
|
Overloads operator to print all elements of Queue.
- Template Parameters
-
| T | type of initializer list elements |
- Parameters
-
| [in,out] | out | reference to output stream |
| [in] | queue | Queue to print |
- Returns
- std::ostream& reference to std::ostream
Definition at line 357 of file queue.h.
358 {
360
361 while (!temp.
empty())
362 {
363 out << temp.
front() <<
' ';
365 }
366
367 return out;
368 }
auto empty() const -> bool
Function checks if container has no elements.
void pop()
Function removes the first element of Queue.
auto front() -> reference
Function returns pointer to Queue first object.
◆ operator<=()
template<typename T>
| auto dsa::operator<= |
( |
const Queue< T > & | queue1, |
|
|
const Queue< T > & | queue2 ) -> bool
|
The relational operator compares two Queue objects.
- Template Parameters
-
| T | type of data stored in Queue |
- Parameters
-
| [in] | queue1 | input container |
| [in] | queue2 | input container |
- Return values
-
| true | if the content of queue1 are lexicographically less or equal than the content of queue2 |
| false | otherwise |
Definition at line 443 of file queue.h.
444 {
446 }
auto operator>(const List< T > &list1, const List< T > &list2) -> bool
The relational operator compares two List objects.
◆ operator==()
template<typename T>
| auto dsa::operator== |
( |
const Queue< T > & | queue1, |
|
|
const Queue< T > & | queue2 ) -> bool |
The relational operator compares two Queue objects.
Forward friend declaration to access internal container comparison operator.
- Template Parameters
-
| T | type of data stored in Queue |
- Parameters
-
| [in] | queue1 | input container |
| [in] | queue2 | input container |
- Return values
-
| true | if containers are equal |
| false | if containers are not equal |
Definition at line 380 of file queue.h.
381 {
382 return queue1.container == queue2.container;
383 }
◆ operator>()
template<typename T>
| auto dsa::operator> |
( |
const Queue< T > & | queue1, |
|
|
const Queue< T > & | queue2 ) -> bool
|
The relational operator compares two Queue objects.
- Template Parameters
-
| T | type of data stored in Queue |
- Parameters
-
| [in] | queue1 | input container |
| [in] | queue2 | input container |
- Return values
-
| true | if the content of queue1 are lexicographically greater than the content of queue2 |
| false | otherwise |
Definition at line 427 of file queue.h.
428 {
430 }
auto operator<(const List< T > &list1, const List< T > &list2) -> bool
The relational operator compares two List objects.
◆ operator>=()
template<typename T>
| auto dsa::operator>= |
( |
const Queue< T > & | queue1, |
|
|
const Queue< T > & | queue2 ) -> bool
|
The relational operator compares two Queue objects.
- Template Parameters
-
| T | type of data stored in Queue |
- Parameters
-
| [in] | queue1 | input container |
| [in] | queue2 | input container |
- Return values
-
| true | if the content of queue1 are lexicographically greater or equal than the content of queue2 |
| false | otherwise |
Definition at line 459 of file queue.h.