Classes | |
struct | _Bit_reference |
struct | _Bit_iterator_base |
struct | _Bit_iterator |
struct | _Bit_const_iterator |
class | _Bvector_base |
struct | _Bvector_base::_Bvector_impl |
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 |
struct | _Deque_base::_Deque_impl |
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 |
struct | _List_base::_List_impl |
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 | map::value_compare |
class | multimap |
A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. More... | |
class | multimap::value_compare |
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 |
struct | _Vector_base::_Vector_impl |
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... | |
class | bitset::reference |
[NOHEADER] | |
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) |
[NOHEADER] | |
template<class _CharT, class _Traits, size_t _Nb> basic_istream< _CharT, _Traits > & | operator>> (basic_istream< _CharT, _Traits > &__is, bitset< _Nb > &__x) |
Global I/O operators for bitsets. | |
template<class _CharT, class _Traits, size_t _Nb> basic_ostream< _CharT, _Traits > & | operator<< (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(). |
|
|
Definition at line 67 of file stl_bvector.h. |
|
|
Global bitwise operations on bitsets.
|
|
Based on operator==.
Definition at line 904 of file stl_vector.h. |
|
Returns !(x == y).
|
|
Returns !(x == y).
Definition at line 551 of file stl_multiset.h. |
|
Based on operator==.
Definition at line 644 of file stl_multimap.h. |
|
Based on operator==.
|
|
Based on operator==.
Definition at line 1226 of file stl_list.h. |
|
Definition at line 268 of file stl_list.h. References _GLIBCXX_STD::_List_const_iterator< _Tp >::_M_node, and _GLIBCXX_STD::_List_iterator< _Tp >::_M_node. |
|
Based on operator==.
Definition at line 1465 of file stl_deque.h. |
|
Definition at line 259 of file stl_deque.h. |
|
Definition at line 252 of file stl_deque.h. |
|
Definition at line 335 of file stl_deque.h. |
|
Definition at line 344 of file stl_bvector.h. |
|
Definition at line 261 of file stl_bvector.h. |
|
|
Definition at line 179 of file stl_bvector.h. References _GLIBCXX_STD::_Bit_iterator_base::_M_offset, _GLIBCXX_STD::_Bit_iterator_base::_M_p, and _S_word_bit. |
|
Vector ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 895 of file stl_vector.h. References std::lexicographical_compare(). |
|
Set ordering relation.
< .See std::lexicographical_compare() for how the determination is made. |
|
Multiset ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 544 of file stl_multiset.h. |
|
Multimap ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 637 of file stl_multimap.h. |
|
Map ordering relation.
< .See std::lexicographical_compare() for how the determination is made. |
|
List ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 1219 of file stl_list.h. References std::lexicographical_compare(). |
|
Deque ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 1457 of file stl_deque.h. |
|
Definition at line 273 of file stl_deque.h. |
|
Definition at line 265 of file stl_deque.h. |
|
|
|
Based on operator<.
Definition at line 916 of file stl_vector.h. |
|
Returns !(y < x).
|
|
Returns !(y < x).
Definition at line 565 of file stl_multiset.h. |
|
Based on operator<.
Definition at line 658 of file stl_multimap.h. |
|
Based on operator<.
|
|
Based on operator<.
Definition at line 1238 of file stl_list.h. |
|
Based on operator<.
Definition at line 1479 of file stl_deque.h. |
|
Definition at line 300 of file stl_deque.h. |
|
Definition at line 293 of file stl_deque.h. |
|
Vector equality comparison.
Definition at line 876 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(). |
|
Set equality comparison.
Definition at line 536 of file stl_set.h. References _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::_M_t. |
|
Multiset equality comparison.
Definition at line 527 of file stl_multiset.h. References _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::_M_t. |
|
Multimap equality comparison.
Definition at line 620 of file stl_multimap.h. References _GLIBCXX_STD::multimap< _Key, _Tp, _Compare, _Alloc >::_M_t. |
|
Map equality comparison.
Definition at line 638 of file stl_map.h. References _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::_M_t. |
|
List equality comparison.
Definition at line 1190 of file stl_list.h. References _GLIBCXX_STD::list< _Tp, _Alloc >::begin(), and _GLIBCXX_STD::list< _Tp, _Alloc >::end(). |
|
Definition at line 262 of file stl_list.h. References _GLIBCXX_STD::_List_const_iterator< _Tp >::_M_node, and _GLIBCXX_STD::_List_iterator< _Tp >::_M_node. |
|
Deque equality comparison.
Definition at line 1439 of file stl_deque.h. |
|
Definition at line 246 of file stl_deque.h. References _GLIBCXX_STD::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_cur. |
|
Definition at line 239 of file stl_deque.h. References _GLIBCXX_STD::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_cur. |
|
Based on operator<.
Definition at line 910 of file stl_vector.h. |
|
Returns y < x.
|
|
Returns y < x.
Definition at line 558 of file stl_multiset.h. |
|
Based on operator<.
Definition at line 651 of file stl_multimap.h. |
|
Based on operator<.
|
|
Based on operator<.
Definition at line 1232 of file stl_list.h. |
|
Based on operator<.
Definition at line 1472 of file stl_deque.h. |
|
Definition at line 287 of file stl_deque.h. |
|
Definition at line 280 of file stl_deque.h. |
|
Based on operator<.
Definition at line 922 of file stl_vector.h. |
|
Returns !(x < y).
|
|
Returns !(x < y).
Definition at line 572 of file stl_multiset.h. |
|
Based on operator<.
Definition at line 665 of file stl_multimap.h. |
|
Based on operator<.
|
|
Based on operator<.
Definition at line 1244 of file stl_list.h. |
|
Based on operator<.
Definition at line 1486 of file stl_deque.h. |
|
Definition at line 313 of file stl_deque.h. |
|
Definition at line 306 of file stl_deque.h. |
|
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 1155 of file bitset. References _GLIBCXX_STD::bitset< _Nb >::_M_copy_from_string(). |
|
|
|
|
|
See std::vector::swap().
Definition at line 928 of file stl_vector.h. References _GLIBCXX_STD::vector< _Tp, _Alloc >::swap(). |
|
See std::set::swap().
Definition at line 588 of file stl_set.h. References _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::swap(). |
|
See std::multiset::swap().
Definition at line 579 of file stl_multiset.h. References _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::swap(). |
|
See std::multimap::swap().
Definition at line 672 of file stl_multimap.h. References _GLIBCXX_STD::multimap< _Key, _Tp, _Compare, _Alloc >::swap(). |
|
See std::map::swap().
Definition at line 690 of file stl_map.h. References _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::swap(). |
|
See std::list::swap().
Definition at line 1250 of file stl_list.h. References _GLIBCXX_STD::list< _Tp, _Alloc >::swap(). |
|
See std::deque::swap().
Definition at line 1493 of file stl_deque.h. References _GLIBCXX_STD::deque< _Tp, _Alloc >::swap(). |