operator==,!=,<,<=,>,>=(std::deque)

 

C++

Language

Standard library headers

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

 

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

std::deque

Member functions

deque::deque

deque::~deque

deque::operator=

deque::assign

deque::get_allocator

Element access

deque::front

deque::back

Iterators

deque::begindeque::cbegin (C++11)

deque::enddeque::cend (C++11)

deque::rbegindeque::crbegin (C++11)

deque::renddeque::crend (C++11)

Capacity

deque::empty

deque::size

deque::max_size

deque::shrink_to_fit

Modifiers

deque::clear

deque::insert

deque::emplace

deque::erase

deque::push_front

deque::emplace_front

deque::pop_front

deque::push_back

deque::emplace_back

deque::pop_back

deque::resize

deque::swap

 

template< class T, class Alloc > bool operator==( const deque<T,Alloc>& lhs,                  const deque<T,Alloc>& rhs );	(1)
template< class T, class Alloc > bool operator!=( const deque<T,Alloc>& lhs,                  const deque<T,Alloc>& rhs );	(2)
template< class T, class Alloc > bool operator<( const deque<T,Alloc>& lhs,                 const deque<T,Alloc>& rhs );	(3)
template< class T, class Alloc > bool operator<=( const deque<T,Alloc>& lhs,                  const deque<T,Alloc>& rhs );	(4)
template< class T, class Alloc > bool operator>( const deque<T,Alloc>& lhs,                 const deque<T,Alloc>& rhs );	(5)
template< class T, class Alloc > bool operator>=( const deque<T,Alloc>& lhs,                  const deque<T,Alloc>& rhs );	(6)

Compares the contents of two containers.

1-2) Checks if the contents of lhs and rhs are equal, that is, whether lhs.size() == rhs.size() and each element in lhs compares equal with the element in rhs at the same position.

3-6) Compares the contents of lhs and rhs lexicographically. The comparison is performed by a function equivalent to std::lexicographical_compare.

Parameters

lhs, rhs	-	containers whose contents to compare
- T must meet the requirements of EqualityComparable in order to use overloads (1-2).
- T must meet the requirements of LessThanComparable in order to use overloads (3-6). The ordering relation must establish total order.

Return value

1) true if the contents of the containers are equal, false otherwise

2) true if the contents of the containers are not equal, false otherwise

3) true if the contents of the lhs are lexicographically less than the contents of rhs, false otherwise

4) true if the contents of the lhs are lexicographically less than or equal the contents of rhs, false otherwise

5) true if the contents of the lhs are lexicographically greater than the contents of rhs, false otherwise

6) true if the contents of the lhs are lexicographically greater than or equal the contents of rhs, false otherwise

Complexity

Linear in the size of the container