stl_deque.h File Reference

#include <bits/concept_check.h>
#include <bits/stl_iterator_base_types.h>
#include <bits/stl_iterator_base_funcs.h>

Include dependency graph for stl_deque.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	std
Functions
template<typename Type, typename Alloc>
bool	operator== (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y)
	Deque equality comparison.
template<typename Type, typename Alloc>
bool	operator< (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y)
	Deque ordering relation.
template<typename Type, typename Alloc>
bool	operator!= (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y)
	Based on operator==.
template<typename Type, typename Alloc>
bool	operator> (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y)
	Based on operator<.
template<typename Type, typename Alloc>
bool	operator<= (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y)
	Based on operator<.
template<typename Type, typename Alloc>
bool	operator>= (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y)
	Based on operator<.
template<typename Type, typename Alloc>
void	swap (deque< Type, Alloc > &x, deque< Type, Alloc > &y)
	See std::deque::swap().

---

Detailed Description

This is an internal header file, included by other library headers. You should not attempt to use it directly.

Definition in file stl_deque.h.

---

Function Documentation

template<typename Type, typename Alloc> bool std::operator!= (  const deque< Type, Alloc > &  x, const deque< Type, Alloc > &  y )  [inline]

Based on operator==. Definition at line 1465 of file stl_deque.h.

template<typename Type, typename Alloc> bool std::operator< (  const deque< Type, Alloc > &  x, const deque< Type, Alloc > &  y )  [inline]

Deque ordering relation. Parameters: x  A deque. y  A deque of the same type as x. Returns: True iff x is lexicographically less than y. This is a total ordering relation. It is linear in the size of the deques. The elements must be comparable with <. See std::lexicographical_compare() for how the determination is made. Definition at line 1457 of file stl_deque.h. References std::lexicographical_compare().

template<typename Type, typename Alloc> bool std::operator<= (  const deque< Type, Alloc > &  x, const deque< Type, Alloc > &  y )  [inline]

Based on operator<. Definition at line 1479 of file stl_deque.h.

template<typename Type, typename Alloc> bool std::operator== (  const deque< Type, Alloc > &  x, const deque< Type, Alloc > &  y )  [inline]

Deque equality comparison. Parameters: x  A deque. y  A deque of the same type as x. Returns: True iff the size and elements of the deques are equal. This is an equivalence relation. It is linear in the size of the deques. Deques are considered equivalent if their sizes are equal, and if corresponding elements compare equal. Definition at line 1439 of file stl_deque.h. References std::deque< Type, Alloc >::begin(), std::deque< Type, Alloc >::end(), std::equal(), and std::deque< Type, Alloc >::size().

template<typename Type, typename Alloc> bool std::operator> (  const deque< Type, Alloc > &  x, const deque< Type, Alloc > &  y )  [inline]

Based on operator<. Definition at line 1472 of file stl_deque.h.

template<typename Type, typename Alloc> bool std::operator>= (  const deque< Type, Alloc > &  x, const deque< Type, Alloc > &  y )  [inline]

Based on operator<. Definition at line 1486 of file stl_deque.h.

template<typename Type, typename Alloc> void std::swap (  deque< Type, Alloc > &  x, deque< Type, Alloc > &  y )  [inline]

See std::deque::swap(). Definition at line 1493 of file stl_deque.h. References std::deque< Type, Alloc >::swap().

---