_GLIBCXX_STD Namespace Reference


Classes

struct  _Bit_reference
struct  _Bit_iterator_base
struct  _Bit_iterator
struct  _Bit_const_iterator
class  _Bvector_base
class  vector< bool, _Alloc >
 A specialization of vector for booleans which offers fixed time access to individual elements in any order. More...
struct  _Deque_iterator
 A deque::iterator. More...
class  _Deque_base
class  deque
 A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end. More...
struct  _List_node_base
struct  _List_node
struct  _List_iterator
 A list::iterator. More...
struct  _List_const_iterator
 A list::const_iterator. More...
class  _List_base
class  list
 A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence. More...
class  map
 A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. More...
class  multimap
 A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. More...
class  multiset
 A standard container made up of elements, which can be retrieved in logarithmic time. More...
class  set
 A standard container made up of unique keys, which can be retrieved in logarithmic time. More...
struct  _Vector_base
class  vector
 A standard container which offers fixed time access to individual elements in any order. More...
struct  _Base_bitset
struct  _Base_bitset< 1 >
struct  _Base_bitset< 0 >
struct  _Sanitize
struct  _Sanitize< 0 >
class  bitset
 The bitset class represents a fixed-size sequence of bits. More...
template<size_t _Nb>
bitset< _Nb > operator & (const bitset< _Nb > &__x, const bitset< _Nb > &__y)
 Global bitwise operations on bitsets.
template<size_t _Nb>
bitset< _Nb > operator| (const bitset< _Nb > &__x, const bitset< _Nb > &__y)
template<size_t _Nb>
bitset< _Nb > operator^ (const bitset< _Nb > &__x, const bitset< _Nb > &__y)
template<class _CharT, class _Traits, size_t _Nb>
std::basic_istream< _CharT,
_Traits > & 		operator>> (std::basic_istream< _CharT, _Traits > &__is, bitset< _Nb > &__x)
 Global I/O operators for bitsets.
template<class _CharT, class _Traits, size_t _Nb>
std::basic_ostream< _CharT,
_Traits > & 		operator<< (std::basic_ostream< _CharT, _Traits > &__os, const bitset< _Nb > &__x)

Typedefs

typedef unsigned long _Bit_type

Enumerations

enum  { _S_word_bit = int(CHAR_BIT * sizeof(_Bit_type)) }

Functions

ptrdiff_t operator- (const _Bit_iterator_base &__x, const _Bit_iterator_base &__y)
_Bit_iterator operator+ (ptrdiff_t __n, const _Bit_iterator &__x)
_Bit_const_iterator operator+ (ptrdiff_t __n, const _Bit_const_iterator &__x)
size_t __deque_buf_size (size_t __size)
template<typename _Tp, typename _Ref, typename _Ptr>
bool operator== (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y)
template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool operator== (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y)
template<typename _Tp, typename _Ref, typename _Ptr>
bool operator!= (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y)
template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool operator!= (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y)
template<typename _Tp, typename _Ref, typename _Ptr>
bool operator< (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y)
template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool operator< (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y)
template<typename _Tp, typename _Ref, typename _Ptr>
bool operator> (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y)
template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool operator> (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y)
template<typename _Tp, typename _Ref, typename _Ptr>
bool operator<= (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y)
template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool operator<= (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y)
template<typename _Tp, typename _Ref, typename _Ptr>
bool operator>= (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y)
template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool operator>= (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y)
template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
_Deque_iterator< _Tp, _RefL,
_PtrL >::difference_type 		operator- (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y)
template<typename _Tp, typename _Ref, typename _Ptr>
_Deque_iterator< _Tp, _Ref,
_Ptr > 		operator+ (ptrdiff_t __n, const _Deque_iterator< _Tp, _Ref, _Ptr > &__x)
template<typename _Tp, typename _Alloc>
bool operator== (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y)
 Deque equality comparison.
template<typename _Tp, typename _Alloc>
bool operator< (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y)
 Deque ordering relation.
template<typename _Tp, typename _Alloc>
bool operator!= (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y)
 Based on operator==.
template<typename _Tp, typename _Alloc>
bool operator> (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y)
 Based on operator<.
template<typename _Tp, typename _Alloc>
bool operator<= (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y)
 Based on operator<.
template<typename _Tp, typename _Alloc>
bool operator>= (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y)
 Based on operator<.
template<typename _Tp, typename _Alloc>
void swap (deque< _Tp, _Alloc > &__x, deque< _Tp, _Alloc > &__y)
 See std::deque::swap().
template<typename _Val>
bool operator== (const _List_iterator< _Val > &__x, const _List_const_iterator< _Val > &__y)
template<typename _Val>
bool operator!= (const _List_iterator< _Val > &__x, const _List_const_iterator< _Val > &__y)
template<typename _Tp, typename _Alloc>
bool operator== (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y)
 List equality comparison.
template<typename _Tp, typename _Alloc>
bool operator< (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y)
 List ordering relation.
template<typename _Tp, typename _Alloc>
bool operator!= (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y)
 Based on operator==.
template<typename _Tp, typename _Alloc>
bool operator> (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y)
 Based on operator<.
template<typename _Tp, typename _Alloc>
bool operator<= (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y)
 Based on operator<.
template<typename _Tp, typename _Alloc>
bool operator>= (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y)
 Based on operator<.
template<typename _Tp, typename _Alloc>
void swap (list< _Tp, _Alloc > &__x, list< _Tp, _Alloc > &__y)
 See std::list::swap().
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator== (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)
 Map equality comparison.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator< (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)
 Map ordering relation.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator!= (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)
 Based on operator==.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator> (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)
 Based on operator<.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator<= (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)
 Based on operator<.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator>= (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)
 Based on operator<.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
void swap (map< _Key, _Tp, _Compare, _Alloc > &__x, map< _Key, _Tp, _Compare, _Alloc > &__y)
 See std::map::swap().
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator== (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y)
 Multimap equality comparison.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator< (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y)
 Multimap ordering relation.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator!= (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y)
 Based on operator==.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator> (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y)
 Based on operator<.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator<= (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y)
 Based on operator<.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool operator>= (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y)
 Based on operator<.
template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
void swap (multimap< _Key, _Tp, _Compare, _Alloc > &__x, multimap< _Key, _Tp, _Compare, _Alloc > &__y)
 See std::multimap::swap().
template<class _Key, class _Compare, class _Alloc>
bool operator== (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y)
 Multiset equality comparison.
template<class _Key, class _Compare, class _Alloc>
bool operator< (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y)
 Multiset ordering relation.
template<class _Key, class _Compare, class _Alloc>
bool operator!= (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y)
 Returns !(x == y).
template<class _Key, class _Compare, class _Alloc>
bool operator> (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y)
 Returns y < x.
template<class _Key, class _Compare, class _Alloc>
bool operator<= (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y)
 Returns !(y < x).
template<class _Key, class _Compare, class _Alloc>
bool operator>= (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y)
 Returns !(x < y).
template<class _Key, class _Compare, class _Alloc>
void swap (multiset< _Key, _Compare, _Alloc > &__x, multiset< _Key, _Compare, _Alloc > &__y)
 See std::multiset::swap().
template<class _Key, class _Compare, class _Alloc>
bool operator== (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y)
 Set equality comparison.
template<class _Key, class _Compare, class _Alloc>
bool operator< (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y)
 Set ordering relation.
template<class _Key, class _Compare, class _Alloc>
bool operator!= (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y)
 Returns !(x == y).
template<class _Key, class _Compare, class _Alloc>
bool operator> (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y)
 Returns y < x.
template<class _Key, class _Compare, class _Alloc>
bool operator<= (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y)
 Returns !(y < x).
template<class _Key, class _Compare, class _Alloc>
bool operator>= (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y)
 Returns !(x < y).
template<class _Key, class _Compare, class _Alloc>
void swap (set< _Key, _Compare, _Alloc > &__x, set< _Key, _Compare, _Alloc > &__y)
 See std::set::swap().
template<typename _Tp, typename _Alloc>
bool operator== (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y)
 Vector equality comparison.
template<typename _Tp, typename _Alloc>
bool operator< (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y)
 Vector ordering relation.
template<typename _Tp, typename _Alloc>
bool operator!= (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y)
 Based on operator==.
template<typename _Tp, typename _Alloc>
bool operator> (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y)
 Based on operator<.
template<typename _Tp, typename _Alloc>
bool operator<= (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y)
 Based on operator<.
template<typename _Tp, typename _Alloc>
bool operator>= (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y)
 Based on operator<.
template<typename _Tp, typename _Alloc>
void swap (vector< _Tp, _Alloc > &__x, vector< _Tp, _Alloc > &__y)
 See std::vector::swap().

Typedef Documentation

typedef unsigned long _GLIBCXX_STD::_Bit_type

Definition at line 66 of file stl_bvector.h.

Enumeration Type Documentation

anonymous enum

Enumerator:
_S_word_bit 

Definition at line 67 of file stl_bvector.h.

Function Documentation

ptrdiff_t _GLIBCXX_STD::operator- ( const _Bit_iterator_base &  __x,
const _Bit_iterator_base &  __y 
) [inline]

Definition at line 182 of file stl_bvector.h.

References _GLIBCXX_STD::_Bit_iterator_base::_M_offset, _GLIBCXX_STD::_Bit_iterator_base::_M_p, and _S_word_bit.

_Bit_iterator _GLIBCXX_STD::operator+ ( ptrdiff_t  __n,
const _Bit_iterator &  __x 
) [inline]

Definition at line 267 of file stl_bvector.h.

_Bit_const_iterator _GLIBCXX_STD::operator+ ( ptrdiff_t  __n,
const _Bit_const_iterator &  __x 
) [inline]

Definition at line 353 of file stl_bvector.h.

size_t _GLIBCXX_STD::__deque_buf_size ( size_t  __size  )  [inline]

Definition at line 83 of file stl_deque.h.

Referenced by _GLIBCXX_STD::_Deque_base< _Tp, _Allocator >::_M_allocate_node(), _GLIBCXX_STD::_Deque_base< _Tp, _Allocator >::_M_deallocate_node(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), _GLIBCXX_STD::deque< _Tp, _Allocator >::_S_buffer_size(), and _GLIBCXX_STD::_Deque_iterator< _Tp, _Ref, _Ptr >::_S_buffer_size().

template<typename _Tp, typename _Ref, typename _Ptr>
bool _GLIBCXX_STD::operator== ( const _Deque_iterator< _Tp, _Ref, _Ptr > &  __x,
const _Deque_iterator< _Tp, _Ref, _Ptr > &  __y 
) [inline]

Definition at line 242 of file stl_deque.h.

References _GLIBCXX_STD::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_cur.

template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool _GLIBCXX_STD::operator== ( const _Deque_iterator< _Tp, _RefL, _PtrL > &  __x,
const _Deque_iterator< _Tp, _RefR, _PtrR > &  __y 
) [inline]

Definition at line 249 of file stl_deque.h.

References _GLIBCXX_STD::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_cur.

template<typename _Tp, typename _Ref, typename _Ptr>
bool _GLIBCXX_STD::operator!= ( const _Deque_iterator< _Tp, _Ref, _Ptr > &  __x,
const _Deque_iterator< _Tp, _Ref, _Ptr > &  __y 
) [inline]

Definition at line 255 of file stl_deque.h.

template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool _GLIBCXX_STD::operator!= ( const _Deque_iterator< _Tp, _RefL, _PtrL > &  __x,
const _Deque_iterator< _Tp, _RefR, _PtrR > &  __y 
) [inline]

Definition at line 262 of file stl_deque.h.

template<typename _Tp, typename _Ref, typename _Ptr>
bool _GLIBCXX_STD::operator< ( const _Deque_iterator< _Tp, _Ref, _Ptr > &  __x,
const _Deque_iterator< _Tp, _Ref, _Ptr > &  __y 
) [inline]

Definition at line 268 of file stl_deque.h.

template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool _GLIBCXX_STD::operator< ( const _Deque_iterator< _Tp, _RefL, _PtrL > &  __x,
const _Deque_iterator< _Tp, _RefR, _PtrR > &  __y 
) [inline]

Definition at line 276 of file stl_deque.h.

template<typename _Tp, typename _Ref, typename _Ptr>
bool _GLIBCXX_STD::operator> ( const _Deque_iterator< _Tp, _Ref, _Ptr > &  __x,
const _Deque_iterator< _Tp, _Ref, _Ptr > &  __y 
) [inline]

Definition at line 283 of file stl_deque.h.

template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool _GLIBCXX_STD::operator> ( const _Deque_iterator< _Tp, _RefL, _PtrL > &  __x,
const _Deque_iterator< _Tp, _RefR, _PtrR > &  __y 
) [inline]

Definition at line 290 of file stl_deque.h.

template<typename _Tp, typename _Ref, typename _Ptr>
bool _GLIBCXX_STD::operator<= ( const _Deque_iterator< _Tp, _Ref, _Ptr > &  __x,
const _Deque_iterator< _Tp, _Ref, _Ptr > &  __y 
) [inline]

Definition at line 296 of file stl_deque.h.

template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool _GLIBCXX_STD::operator<= ( const _Deque_iterator< _Tp, _RefL, _PtrL > &  __x,
const _Deque_iterator< _Tp, _RefR, _PtrR > &  __y 
) [inline]

Definition at line 303 of file stl_deque.h.

template<typename _Tp, typename _Ref, typename _Ptr>
bool _GLIBCXX_STD::operator>= ( const _Deque_iterator< _Tp, _Ref, _Ptr > &  __x,
const _Deque_iterator< _Tp, _Ref, _Ptr > &  __y 
) [inline]

Definition at line 309 of file stl_deque.h.

template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
bool _GLIBCXX_STD::operator>= ( const _Deque_iterator< _Tp, _RefL, _PtrL > &  __x,
const _Deque_iterator< _Tp, _RefR, _PtrR > &  __y 
) [inline]

Definition at line 316 of file stl_deque.h.

template<typename _Tp, typename _RefL, typename _PtrL, typename _RefR, typename _PtrR>
_Deque_iterator<_Tp, _RefL, _PtrL>::difference_type _GLIBCXX_STD::operator- ( const _Deque_iterator< _Tp, _RefL, _PtrL > &  __x,
const _Deque_iterator< _Tp, _RefR, _PtrR > &  __y 
) [inline]

Definition at line 327 of file stl_deque.h.

References _GLIBCXX_STD::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_cur, _GLIBCXX_STD::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_first, _GLIBCXX_STD::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_last, and _GLIBCXX_STD::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_node.

template<typename _Tp, typename _Ref, typename _Ptr>
_Deque_iterator<_Tp, _Ref, _Ptr> _GLIBCXX_STD::operator+ ( ptrdiff_t  __n,
const _Deque_iterator< _Tp, _Ref, _Ptr > &  __x 
) [inline]

Definition at line 338 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator== ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _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 1473 of file stl_deque.h.

References _GLIBCXX_STD::deque< _Tp, _Alloc >::begin(), _GLIBCXX_STD::deque< _Tp, _Alloc >::end(), std::equal(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::size().

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator< ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _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 1491 of file stl_deque.h.

References std::lexicographical_compare().

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator!= ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 1499 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator> ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1506 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator<= ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1513 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator>= ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1520 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::swap ( deque< _Tp, _Alloc > &  __x,
deque< _Tp, _Alloc > &  __y 
) [inline]

See std::deque::swap().

Definition at line 1527 of file stl_deque.h.

References _GLIBCXX_STD::deque< _Tp, _Alloc >::swap().

template<typename _Val>
bool _GLIBCXX_STD::operator== ( const _List_iterator< _Val > &  __x,
const _List_const_iterator< _Val > &  __y 
) [inline]

Definition at line 264 of file stl_list.h.

References _GLIBCXX_STD::_List_const_iterator< _Tp >::_M_node, and _GLIBCXX_STD::_List_iterator< _Tp >::_M_node.

template<typename _Val>
bool _GLIBCXX_STD::operator!= ( const _List_iterator< _Val > &  __x,
const _List_const_iterator< _Val > &  __y 
) [inline]

Definition at line 270 of file stl_list.h.

References _GLIBCXX_STD::_List_const_iterator< _Tp >::_M_node, and _GLIBCXX_STD::_List_iterator< _Tp >::_M_node.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator== ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

List equality comparison.

Parameters:
x A list.
y A list of the same type as x.
Returns:
True iff the size and elements of the lists are equal.
This is an equivalence relation. It is linear in the size of the lists. Lists are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 1166 of file stl_list.h.

References _GLIBCXX_STD::list< _Tp, _Alloc >::begin(), and _GLIBCXX_STD::list< _Tp, _Alloc >::end().

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator< ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

List ordering relation.

Parameters:
x A list.
y A list 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 lists. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 1195 of file stl_list.h.

References std::lexicographical_compare().

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator!= ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 1202 of file stl_list.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator> ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1208 of file stl_list.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator<= ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1214 of file stl_list.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator>= ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1220 of file stl_list.h.

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::swap ( list< _Tp, _Alloc > &  __x,
list< _Tp, _Alloc > &  __y 
) [inline]

See std::list::swap().

Definition at line 1226 of file stl_list.h.

References _GLIBCXX_STD::list< _Tp, _Alloc >::swap().

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator== ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Map equality comparison.

Parameters:
x A map.
y A map of the same type as x.
Returns:
True iff the size and elements of the maps are equal.
This is an equivalence relation. It is linear in the size of the maps. Maps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 674 of file stl_map.h.

References _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::_M_t.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator< ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Map ordering relation.

Parameters:
x A map.
y A map 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 maps. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 691 of file stl_map.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator!= ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 698 of file stl_map.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator> ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 705 of file stl_map.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator<= ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 712 of file stl_map.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator>= ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 719 of file stl_map.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
void _GLIBCXX_STD::swap ( map< _Key, _Tp, _Compare, _Alloc > &  __x,
map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

See std::map::swap().

Definition at line 726 of file stl_map.h.

References _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::swap().

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator== ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Multimap equality comparison.

Parameters:
x A multimap.
y A multimap of the same type as x.
Returns:
True iff the size and elements of the maps are equal.
This is an equivalence relation. It is linear in the size of the multimaps. Multimaps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 627 of file stl_multimap.h.

References _GLIBCXX_STD::multimap< _Key, _Tp, _Compare, _Alloc >::_M_t.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator< ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Multimap ordering relation.

Parameters:
x A multimap.
y A multimap 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 multimaps. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 644 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator!= ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 651 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator> ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 658 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator<= ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 665 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool _GLIBCXX_STD::operator>= ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 672 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
void _GLIBCXX_STD::swap ( multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

See std::multimap::swap().

Definition at line 679 of file stl_multimap.h.

References _GLIBCXX_STD::multimap< _Key, _Tp, _Compare, _Alloc >::swap().

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator== ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Multiset equality comparison.

Parameters:
x A multiset.
y A multiset of the same type as x.
Returns:
True iff the size and elements of the multisets are equal.
This is an equivalence relation. It is linear in the size of the multisets. Multisets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 522 of file stl_multiset.h.

References _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::_M_t.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator< ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Multiset ordering relation.

Parameters:
x A multiset.
y A multiset 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 maps. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 539 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator!= ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(x == y).

Definition at line 546 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator> ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns y < x.

Definition at line 553 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator<= ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(y < x).

Definition at line 560 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator>= ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(x < y).

Definition at line 567 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
void _GLIBCXX_STD::swap ( multiset< _Key, _Compare, _Alloc > &  __x,
multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

See std::multiset::swap().

Definition at line 574 of file stl_multiset.h.

References _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::swap().

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator== ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Set equality comparison.

Parameters:
x A set.
y A set of the same type as x.
Returns:
True iff the size and elements of the sets are equal.
This is an equivalence relation. It is linear in the size of the sets. Sets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 535 of file stl_set.h.

References _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::_M_t.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator< ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Set ordering relation.

Parameters:
x A set.
y A set 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 maps. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 552 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator!= ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(x == y).

Definition at line 559 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator> ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns y < x.

Definition at line 566 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator<= ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(y < x).

Definition at line 573 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::operator>= ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(x < y).

Definition at line 580 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>
void _GLIBCXX_STD::swap ( set< _Key, _Compare, _Alloc > &  __x,
set< _Key, _Compare, _Alloc > &  __y 
) [inline]

See std::set::swap().

Definition at line 587 of file stl_set.h.

References _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::swap().

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator== ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Vector equality comparison.

Parameters:
x A vector.
y A vector of the same type as x.
Returns:
True iff the size and elements of the vectors are equal.
This is an equivalence relation. It is linear in the size of the vectors. Vectors are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 932 of file stl_vector.h.

References _GLIBCXX_STD::vector< _Tp, _Alloc >::begin(), _GLIBCXX_STD::vector< _Tp, _Alloc >::end(), std::equal(), and _GLIBCXX_STD::vector< _Tp, _Alloc >::size().

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator< ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Vector ordering relation.

Parameters:
x A vector.
y A vector 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 vectors. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 949 of file stl_vector.h.

References std::lexicographical_compare().

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator!= ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 956 of file stl_vector.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator> ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 962 of file stl_vector.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator<= ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 968 of file stl_vector.h.

template<typename _Tp, typename _Alloc>
bool _GLIBCXX_STD::operator>= ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 974 of file stl_vector.h.

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::swap ( vector< _Tp, _Alloc > &  __x,
vector< _Tp, _Alloc > &  __y 
) [inline]

See std::vector::swap().

Definition at line 980 of file stl_vector.h.

References _GLIBCXX_STD::vector< _Tp, _Alloc >::swap().

template<size_t _Nb>
bitset<_Nb> _GLIBCXX_STD::operator & ( const bitset< _Nb > &  __x,
const bitset< _Nb > &  __y 
) [inline]

Global bitwise operations on bitsets.

Parameters:
x A bitset.
y A bitset of the same size as x.
Returns:
A new bitset.
These should be self-explanatory.

Definition at line 1191 of file bitset.

template<size_t _Nb>
bitset<_Nb> _GLIBCXX_STD::operator| ( const bitset< _Nb > &  __x,
const bitset< _Nb > &  __y 
) [inline]

Definition at line 1200 of file bitset.

template<size_t _Nb>
bitset<_Nb> _GLIBCXX_STD::operator^ ( const bitset< _Nb > &  __x,
const bitset< _Nb > &  __y 
) [inline]

Definition at line 1209 of file bitset.

template<class _CharT, class _Traits, size_t _Nb>
std::basic_istream<_CharT, _Traits>& _GLIBCXX_STD::operator>> ( std::basic_istream< _CharT, _Traits > &  __is,
bitset< _Nb > &  __x 
)

Global I/O operators for bitsets.

Direct I/O between streams and bitsets is supported. Output is straightforward. Input will skip whitespace, only accept '0' and '1' characters, and will only extract as many digits as the bitset will hold.

Definition at line 1228 of file bitset.

References _GLIBCXX_STD::bitset< _Nb >::_M_copy_from_string(), std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::basic_string< _CharT, _Traits, _Alloc >::empty(), std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_string< _CharT, _Traits, _Alloc >::push_back(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_string< _CharT, _Traits, _Alloc >::reserve(), std::basic_ios< _CharT, _Traits >::setstate(), and std::basic_ios< _CharT, _Traits >::widen().

template<class _CharT, class _Traits, size_t _Nb>
std::basic_ostream<_CharT, _Traits>& _GLIBCXX_STD::operator<< ( std::basic_ostream< _CharT, _Traits > &  __os,
const bitset< _Nb > &  __x 
)

Definition at line 1286 of file bitset.

Generated on Tue Feb 2 16:58:19 2010 for GNU C++ STL by  doxygen 1.4.7