#include <bits/concept_check.h>
#include <bits/stl_iterator_base_types.h>
#include <bits/stl_iterator_base_funcs.h>
Go to the source code of this file.
Namespaces | |
namespace | std |
Classes | |
struct | std::Deque_iterator< Type, Ref, Ptr > |
A deque::iterator. More... | |
class | std::deque< Type, Alloc > |
A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end. More... | |
Functions | |
template<typename Type, typename Alloc> | |
bool | std::operator== (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Deque equality comparison. | |
template<typename Type, typename Alloc> | |
bool | std::operator< (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Deque ordering relation. | |
template<typename Type, typename Alloc> | |
bool | std::operator!= (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Based on operator==. | |
template<typename Type, typename Alloc> | |
bool | std::operator> (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | std::operator<= (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | std::operator>= (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
void | std::swap (deque< Type, Alloc > &x, deque< Type, Alloc > &y) |
See std::deque::swap(). |
Definition in file stl_deque.h.