Reference
C Library
IOstream Library
Strings library
STL Containers
STL Algorithms
Miscellaneous

STL Containers
bitset
deque
list
map
multimap
multiset
priority_queue
queue
set
stack
vector

deque
comparison operators
deque::deque
deque::~deque
member functions:
deque::assign
deque::at
deque::back
deque::begin
deque::clear
deque::empty
deque::end
deque::erase
deque::front
deque::get_allocator
deque::insert
deque::max_size
deque::operator=
deque::operator[]
deque::pop_back
deque::pop_front
deque::push_back
deque::push_front
deque::rbegin
deque::rend
deque::resize
deque::size
deque::swap

comparison operators

function

<deque>

template <class T, class Allocator>
  bool operator== ( const deque<T,Allocator>& x, const deque<T,Allocator>& y );
template <class T, class Allocator>
  bool operator< ( const deque<T,Allocator>& x, const deque<T,Allocator>& y );
template <class T, class Allocator>
  bool operator!= ( const deque<T,Allocator>& x, const deque<T,Allocator>& y );
template <class T, class Allocator>
  bool operator> ( const deque<T,Allocator>& x, const deque<T,Allocator>& y );
template <class T, class Allocator>
  bool operator>= ( const deque<T,Allocator>& x, const deque<T,Allocator>& y );
template <class T, class Allocator>
  bool operator<= ( const deque<T,Allocator>& x, const deque<T,Allocator>& y );

Global comparison operator functions

These overloaded global operator functions perform the appropriate comparison operation between deque containers x and y.

Operations == and != are performed by comparing the elements using algorithm equal.

Operations <, >, <= and >= are performed by using algorithm lexicographical_compare, which requires that the type of the elements (T) has the < operation (less-than) defined between two objects of that type.

These operators are overloaded in header <deque>.

Parameters

x, y: deque containers, having both the same template parameters (T and Allocator).

Return Value

true if the condition holds, and false otherwise.