Whole document tree
std Namespace Reference
Main Page Namespace List Class Hierarchy Alphabetical List Compound List File List Namespace Members Compound Members File Members
std Namespace Reference Everything defined by the ISO C++ Standard is within namespace std.
More...
Compounds
struct __allocator
class __allocator< void, _Alloc >
class __basic_file
struct __basic_file_base
struct __copy_backward_dispatch
struct __copy_backward_dispatch< _Tp *, _Tp *, __true_type >
struct __copy_backward_dispatch< const _Tp *, _Tp *, __true_type >
class __ctype_abstract_base
class __default_alloc_template
struct __is_arithmetic
struct __is_floating
struct __is_floating< double >
struct __is_floating< float >
struct __is_floating< long double >
struct __is_fundamental
struct __is_integer
struct __is_integer< bool >
struct __is_integer< char >
struct __is_integer< int >
struct __is_integer< long >
struct __is_integer< long long >
struct __is_integer< short >
struct __is_integer< signed char >
struct __is_integer< unsigned char >
struct __is_integer< unsigned int >
struct __is_integer< unsigned long >
struct __is_integer< unsigned long long >
struct __is_integer< unsigned short >
struct __is_pod
struct __is_void
struct __is_void< void >
class __malloc_alloc_template
class __normal_iterator
struct _Alloc_traits
struct _Alloc_traits< _Tp, __allocator< _Atype, _Pthread_alloc_template< _Max > > >
struct _Alloc_traits< _Tp, __allocator< _Tp1, __default_alloc_template< __thr, __inst > > >
struct _Alloc_traits< _Tp, __allocator< _Tp1, __malloc_alloc_template< __inst > > >
struct _Alloc_traits< _Tp, __allocator< _Tp1, debug_alloc< _Alloc > > >
struct _Alloc_traits< _Tp, __default_alloc_template< __threads, __inst > >
struct _Alloc_traits< _Tp, __malloc_alloc_template< __inst > >
struct _Alloc_traits< _Tp, _Pthread_alloc_template< _Max_size > >
struct _Alloc_traits< _Tp, allocator< _Tp1 > >
struct _Alloc_traits< _Tp, debug_alloc< _Alloc > >
struct _Alloc_traits< _Tp, pthread_allocator< _Atype > >
struct _Array
struct _Array_copier
struct _Array_copier< _Tp, true >
struct _Array_copy_ctor
struct _Array_copy_ctor< _Tp, true >
struct _Array_default_ctor
struct _Array_default_ctor< _Tp, true >
struct _Array_init_ctor
struct _Array_init_ctor< _Tp, true >
struct _Base_bitset
struct _Base_bitset< 1 >
class _BinBase
class _BinBase1
class _BinBase2
struct _BinClos< _Oper, _Constant, _Expr, typename _Dom::value_type, _Dom >
struct _BinClos< _Oper, _Constant, _ValArray, _Tp, _Tp >
struct _BinClos< _Oper, _Expr, _Constant, _Dom, typename _Dom::value_type >
struct _BinClos< _Oper, _Expr, _Expr, _Dom1, _Dom2 >
struct _BinClos< _Oper, _Expr, _ValArray, _Dom, typename _Dom::value_type >
struct _BinClos< _Oper, _ValArray, _Constant, _Tp, _Tp >
struct _BinClos< _Oper, _ValArray, _Expr, typename _Dom::value_type, _Dom >
struct _BinClos< _Oper, _ValArray, _ValArray, _Tp, _Tp >
class _BinFunBase
class _BinFunBase1
class _BinFunBase2
struct _BinFunClos< _Constant, _Expr, _Dom, typename _Dom::value_type >
struct _BinFunClos< _Constant, _ValArray, _Tp, _Tp >
struct _BinFunClos< _Expr, _Constant, _Dom, typename _Dom::value_type >
struct _BinFunClos< _Expr, _Expr, _Dom1, _Dom2 >
struct _BinFunClos< _Expr, _ValArray, _Dom, typename _Dom::value_type >
struct _BinFunClos< _ValArray, _Constant, _Tp, _Tp >
struct _BinFunClos< _ValArray, _Expr, typename _Dom::value_type, _Dom >
struct _BinFunClos< _ValArray, _ValArray, _Tp, _Tp >
struct _Bit_const_iterator
struct _Bit_count
struct _Bit_iterator
struct _Bit_iterator_base
struct _Bit_reference
struct _Bitwise_and
struct _Bitwise_not
struct _Bitwise_or
struct _Bitwise_xor
class _Bvector_alloc_base
class _Bvector_alloc_base< _Allocator, true >
class _Bvector_base
struct _Constant_binary_fun
struct _Constant_unary_fun
struct _Constant_void_fun
class _Deque_alloc_base
class _Deque_alloc_base< _Tp, _Alloc, true >
class _Deque_base
struct _Deque_iterator
class _Expr
struct _First_one
class _Format_cache
class _Lock
class _FunBase
class _GBase
class _GBase< _Array< _Tp > >
struct _GClos< _Expr, _Dom >
struct _GClos< _ValArray, _Tp >
struct _Hashtable_const_iterator
struct _Hashtable_iterator
struct _Hashtable_node
class _IBase
struct _IClos< _Expr, _Dom >
struct _IClos< _ValArray, _Tp >
struct _Identity
class _List_alloc_base
class _List_alloc_base< _Tp, _Allocator, true >
class _List_base
struct _List_iterator
struct _List_iterator_base
struct _List_node
struct _List_node_base
struct _Norm_helper
struct _Norm_helper< true >
union _Obj
struct _Project1st
struct _Project2nd
class _M_lock
union _Pthread_alloc_obj
struct _Pthread_alloc_per_thread_state
class _Pthread_alloc_template
class _Rb_tree
class _Rb_tree_alloc_base
class _Rb_tree_alloc_base< _Tp, _Alloc, true >
struct _Rb_tree_base
struct _Rb_tree_base_iterator
struct _Rb_tree_iterator
struct _Rb_tree_node
struct _Rb_tree_node_base
struct _Refcount_Base
struct _RefFunClos< _Expr, _Dom >
struct _RefFunClos< _ValArray, _Tp >
struct _Resetiosflags
class _Rope_alloc_base
class _Rope_alloc_base< _CharT, _Allocator, true >
struct _Rope_base
class _Rope_char_consumer
class _Rope_char_ptr_proxy
class _Rope_char_ref_proxy
struct _Rope_Concat_fn
class _Rope_const_iterator
class _Rope_find_char_char_consumer
class _Rope_flatten_char_consumer
class _Rope_insert_char_consumer
class _Rope_iterator
class _Rope_iterator_base
class _Rope_rep_alloc_base
class _Rope_rep_alloc_base< _CharT, _Allocator, true >
struct _Rope_rep_base
struct _Rope_RopeConcatenation
struct _Rope_RopeFunction
struct _Rope_RopeLeaf
struct _Rope_RopeRep
struct _Rope_RopeSubstring
struct _Rope_self_destruct_ptr
struct _Sanitize
struct _Sanitize< 0 >
class _SBase
class _SBase< _Array< _Tp > >
struct _SClos< _Expr, _Dom >
struct _SClos< _ValArray, _Tp >
struct _Select1st
struct _Select2nd
struct _Setbase
struct _Setfill
struct _Setiosflags
struct _Setprecision
struct _Setw
struct _Shift_left
struct _Shift_right
class _Slist_alloc_base
class _Slist_alloc_base< _Tp, _Allocator, true >
struct _Slist_base
struct _Slist_iterator
struct _Slist_iterator_base
struct _Slist_node
struct _Slist_node_base
struct _STL_auto_lock
struct _STL_mutex_lock
struct _STL_mutex_spin
class _Temporary_buffer
struct _Unary_plus
class _UnBase
struct _UnClos< _Oper, _Expr, _Dom >
struct _UnClos< _Oper, _ValArray, _Tp >
class _UnFunBase
struct _UnFunClos< _Expr, _Dom >
struct _UnFunClos< _ValArray, _Tp >
struct _ValFunClos< _Expr, _Dom >
struct _ValFunClos< _ValArray, _Tp >
class _Vector_alloc_base
class _Vector_alloc_base< _Tp, _Allocator, true >
struct _Vector_base
class allocator
class allocator< void >
class auto_ptr
struct auto_ptr_ref
class back_insert_iterator
class bad_alloc
class bad_cast
class bad_exception
class bad_typeid
class basic_filebuf
class basic_fstream
class basic_ifstream
class basic_iostream
class basic_istream
class basic_istringstream
class basic_ofstream
class basic_ostream
class basic_ostringstream
class basic_streambuf
class basic_stringbuf
class basic_stringstream
struct bidirectional_iterator
struct bidirectional_iterator_tag
class binary_compose
struct binary_function
class binary_negate
class binder1st
class binder2nd
class bitset
class char_producer
class complex
class complex< double >
class complex< float >
class complex< long double >
class const_mem_fun1_ref_t
class const_mem_fun1_ref_t< void, _Tp, _Arg >
class const_mem_fun1_t
class const_mem_fun1_t< void, _Tp, _Arg >
class const_mem_fun_ref_t
class const_mem_fun_ref_t< void, _Tp >
class const_mem_fun_t
class const_mem_fun_t< void, _Tp >
struct constant_binary_fun
struct constant_unary_fun
struct constant_void_fun
class debug_alloc
class deque
struct divides
class domain_error
struct equal_to
class exception
Base class for all library exceptions. More...
struct forward_iterator
struct forward_iterator_tag
class front_insert_iterator
struct greater
struct greater_equal
struct hash
struct hash< char * >
struct hash< char >
struct hash< const char * >
struct hash< crope >
struct hash< int >
struct hash< long >
struct hash< short >
struct hash< signed char >
struct hash< unsigned char >
struct hash< unsigned int >
struct hash< unsigned long >
struct hash< unsigned short >
struct hash< wrope >
class hash_map
class hash_multimap
class hash_multiset
class hash_set
class hashtable
struct identity
struct input_iterator
struct input_iterator_tag
class insert_iterator
class insert_iterator< hash_map< _Key, _Tp, _HashFn, _EqKey, _Alloc > >
class insert_iterator< hash_multimap< _Key, _Tp, _HashFn, _EqKey, _Alloc > >
class insert_iterator< hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc > >
class insert_iterator< hash_set< _Value, _HashFcn, _EqualKey, _Alloc > >
class insert_iterator< slist< _Tp, _Alloc > >
class invalid_argument
class istream_iterator
class istreambuf_iterator
struct iterator
struct iterator_traits
struct iterator_traits< _Tp * >
struct iterator_traits< const _Tp * >
class length_error
struct less
struct less_equal
class list
class id
class facet
class _Impl
struct _Monthnames< char, _Dummy >
class _Numeric_get
class _Numeric_put
struct _Weekdaynames< char, _Dummy >
class collate
class collate_byname
class ctype
class ctype< char >
class ctype_byname
class Init
struct _Words
struct _Callback_list
struct _Char_traits_match
class failure
struct _Indexer
struct _Alloc_hider
struct _Rep
class basic_ios
class basic_string
struct char_traits
21.1.2 Basis for explicit _Traits specialization NB: That for any given actual character type this definition is probably wrong. More...
struct char_traits< char >
21.1.4 char_traits specializations. More...
class fpos
class gslice
class gslice_array
class indirect_array
class ios_base
class locale
class logic_error
One of two subclasses of exception . More...
struct logical_and
struct logical_not
struct logical_or
class map
class mask_array
class mem_fun1_ref_t
class mem_fun1_ref_t< void, _Tp, _Arg >
class mem_fun1_t
class mem_fun1_t< void, _Tp, _Arg >
class mem_fun_ref_t
class mem_fun_ref_t< void, _Tp >
class mem_fun_t
class mem_fun_t< void, _Tp >
class messages
struct messages_base
class messages_byname
struct minus
struct modulus
struct money_base
class money_get
class money_put
class moneypunct
class moneypunct_byname
class multimap
struct multiplies
class multiset
struct negate
struct not_equal_to
struct nothrow_t
class num_get
class num_put
struct numeric_limits
Properties of fundamental types on a per-platform basis. More...
struct numeric_limits< bool >
struct numeric_limits< char >
struct numeric_limits< double >
struct numeric_limits< float >
struct numeric_limits< int >
struct numeric_limits< long >
struct numeric_limits< long double >
struct numeric_limits< long long >
struct numeric_limits< short >
struct numeric_limits< signed char >
struct numeric_limits< unsigned char >
struct numeric_limits< unsigned int >
struct numeric_limits< unsigned long >
struct numeric_limits< unsigned long long >
struct numeric_limits< unsigned short >
struct numeric_limits< wchar_t >
class numpunct
class numpunct_byname
struct pattern
class ostream_iterator
class ostreambuf_iterator
class out_of_range
struct output_iterator
struct output_iterator_tag
class overflow_error
struct pair
pair holds two objects of arbitrary type. More...
struct plus
class pointer_to_binary_function
class pointer_to_unary_function
class priority_queue
struct project1st
struct project2nd
class pthread_allocator
struct rebind
class pthread_allocator< void >
struct rebind
class reference
class sentry
class sentry
class queue
struct random_access_iterator
struct random_access_iterator_tag
class range_error
struct rebind
struct rebind
struct rebind
struct rebind
class raw_storage_iterator
struct rb_tree
class reverse_bidirectional_iterator
class reverse_iterator
class rope
class runtime_error
One of two subclasses of exception . More...
struct select1st
struct select2nd
class sequence_buffer
class set
class simple_alloc
class slice
class slice_array
class slist
class stack
class subtractive_rng
struct temporary_buffer
class time_base
class time_get
class time_get_byname
class time_put
class time_put_byname
class type_info
Used in RTTI. More...
class unary_compose
struct unary_function
class unary_negate
class underflow_error
class valarray
class value_compare
class value_compare
class vector
class vector< bool, _Alloc >
Typedefs
typedef fpos < mbstate_t > streampos
typedef _Pthread_alloc_template pthread_alloc
typedef basic_ios < char > ios
typedef basic_streambuf < char > streambuf
typedef basic_istream < char > istream
typedef basic_ostream < char > ostream
typedef basic_iostream < char > iostream
typedef basic_stringbuf < char > stringbuf
typedef basic_istringstream <
char > istringstream
typedef basic_ostringstream <
char > ostringstream
typedef basic_stringstream <
char > stringstream
typedef basic_filebuf < char > filebuf
typedef basic_ifstream < char > ifstream
typedef basic_ofstream < char > ofstream
typedef basic_fstream < char > fstream
typedef __malloc_alloc_template < 0 > malloc_alloc
typedef __default_alloc_template <
__NODE_ALLOCATOR_THREADS, 0 > alloc
typedef __default_alloc_template <
false, 0 > single_client_alloc
typedef vector < bool, alloc > bit_vector
typedef bool _Rb_tree_Color_type
typedef basic_string < char > string
typedef rope < char > crope
typedef rope < wchar_t > wrope
typedef char fake_istream[sizeof(istream ) __attribute__ )((aligned(__alignof__(istream ))))
typedef ostreambuf_iterator <
char, char_traits < char > > obuf_iterator
typedef istreambuf_iterator <
char, char_traits < char > > ibuf_iterator
typedef ostreambuf_iterator <
wchar_t, char_traits < wchar_t > > wobuf_iterator
typedef istreambuf_iterator <
wchar_t, char_traits < wchar_t > > wibuf_iterator
typedef vector < locale::facet * > vec_pfacet
typedef istreambuf_iterator <
char, char_traits < char > > istreambuf_iter
typedef ostreambuf_iterator <
char, char_traits < char > > ostreambuf_iter
typedef _Char_traits_match <
char, char_traits < char > > char_match
typedef basic_string < C > S
typedef void(* terminate_handler )()
If you write a replacement terminate handler, it must be of this type. More...
typedef void(* unexpected_handler )()
If you write a replacement unexpected handler, it must be of this type. More...
typedef void(* new_handler )()
Enumerations
enum _Ios_Fmtflags { _M_ios_fmtflags_end = 1L << 16
}
enum _Ios_Openmode { _M_ios_openmode_end = 1L << 16
}
enum _Ios_Iostate { _M_ios_iostate_end = 1L << 16
}
enum _Ios_Seekdir { _M_ios_seekdir_end = 1L << 16
}
enum float_round_style {
round_indeterminate = -1,
round_toward_zero = 0,
round_to_nearest = 1,
round_toward_infinity = 2,
round_toward_neg_infinity = 3
}
Rounding style determines the behavior of floating-point calculations. More...
enum float_denorm_style { denorm_indeterminate = -1,
denorm_absent = 0,
denorm_present = 1
}
This enum signals whether a type has denormalization. More...
enum float_round_style {
round_indeterminate = -1,
round_toward_zero = 0,
round_to_nearest = 1,
round_toward_infinity = 2,
round_toward_neg_infinity = 3
}
enum float_denorm_style { denorm_indeterminate = -1,
denorm_absent = 0,
denorm_present = 1
}
enum { __stl_num_primes = 28
}
Functions
template<typename _CharT, typename _Traits, typename _Alloc> basic_string < _CharT, _Traits,
_Alloc > operator+ (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> basic_string < _CharT, _Traits,
_Alloc > operator+ (const _CharT *__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> basic_string < _CharT, _Traits,
_Alloc > operator+ (_CharT __lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> basic_string < _CharT, _Traits,
_Alloc > operator+ (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const _CharT *__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> basic_string < _CharT, _Traits,
_Alloc > operator+ (const basic_string < _CharT, _Traits, _Alloc > &__lhs, _CharT __rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator== (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator== (const _CharT *__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator== (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const _CharT *__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator!= (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator!= (const _CharT *__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator!= (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const _CharT *__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator< (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator< (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const _CharT *__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator< (const _CharT *__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator> (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator> (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const _CharT *__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator> (const _CharT *__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator<= (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator<= (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const _CharT *__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator<= (const _CharT *__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator>= (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator>= (const basic_string < _CharT, _Traits, _Alloc > &__lhs, const _CharT *__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> bool operator>= (const _CharT *__lhs, const basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> void swap (basic_string < _CharT, _Traits, _Alloc > &__lhs, basic_string < _CharT, _Traits, _Alloc > &__rhs)
template<typename _CharT, typename _Traits, typename _Alloc> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__is, basic_string < _CharT, _Traits, _Alloc > &__str)
template<typename _CharT, typename _Traits, typename _Alloc> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__os, const basic_string < _CharT, _Traits, _Alloc > &__str)
template<typename _CharT, typename _Traits, typename _Alloc> basic_istream < _CharT, _Traits > & getline (basic_istream < _CharT, _Traits > &__is, basic_string < _CharT, _Traits, _Alloc > &__str, _CharT __delim)
template<typename _CharT, typename _Traits, typename _Alloc> basic_istream < _CharT, _Traits > & getline (basic_istream < _CharT, _Traits > &__is, basic_string < _CharT, _Traits, _Alloc > &__str)
template<class _CharT, class _Traits, class _Alloc> void _S_string_copy (const basic_string < _CharT, _Traits, _Alloc > &__str, _CharT *__buf, typename _Alloc::size_type __bufsiz)
void __throw_bad_exception (void)
void __throw_bad_alloc (void)
void __throw_bad_cast (void)
void __throw_bad_typeid (void)
void __throw_logic_error (const char *__s)
void __throw_domain_error (const char *__s)
void __throw_invalid_argument (const char *__s)
void __throw_length_error (const char *__s)
void __throw_out_of_range (const char *__s)
void __throw_runtime_error (const char *__s)
void __throw_range_error (const char *__s)
void __throw_overflow_error (const char *__s)
void __throw_underflow_error (const char *__s)
void __throw_ios_failure (const char *__s)
_Ios_Fmtflags operator & (_Ios_Fmtflags __a, _Ios_Fmtflags __b)
_Ios_Fmtflags operator| (_Ios_Fmtflags __a, _Ios_Fmtflags __b)
_Ios_Fmtflags operator^ (_Ios_Fmtflags __a, _Ios_Fmtflags __b)
_Ios_Fmtflags operator|= (_Ios_Fmtflags &__a, _Ios_Fmtflags __b)
_Ios_Fmtflags operator &= (_Ios_Fmtflags &__a, _Ios_Fmtflags __b)
_Ios_Fmtflags operator^= (_Ios_Fmtflags &__a, _Ios_Fmtflags __b)
_Ios_Fmtflags operator~ (_Ios_Fmtflags __a)
_Ios_Openmode operator & (_Ios_Openmode __a, _Ios_Openmode __b)
_Ios_Openmode operator| (_Ios_Openmode __a, _Ios_Openmode __b)
_Ios_Openmode operator^ (_Ios_Openmode __a, _Ios_Openmode __b)
_Ios_Openmode operator|= (_Ios_Openmode &__a, _Ios_Openmode __b)
_Ios_Openmode operator &= (_Ios_Openmode &__a, _Ios_Openmode __b)
_Ios_Openmode operator^= (_Ios_Openmode &__a, _Ios_Openmode __b)
_Ios_Openmode operator~ (_Ios_Openmode __a)
_Ios_Iostate operator & (_Ios_Iostate __a, _Ios_Iostate __b)
_Ios_Iostate operator| (_Ios_Iostate __a, _Ios_Iostate __b)
_Ios_Iostate operator^ (_Ios_Iostate __a, _Ios_Iostate __b)
_Ios_Iostate operator|= (_Ios_Iostate &__a, _Ios_Iostate __b)
_Ios_Iostate operator &= (_Ios_Iostate &__a, _Ios_Iostate __b)
_Ios_Iostate operator^= (_Ios_Iostate &__a, _Ios_Iostate __b)
_Ios_Iostate operator~ (_Ios_Iostate __a)
ios_base & boolalpha (ios_base &__base)
ios_base & noboolalpha (ios_base &__base)
ios_base & showbase (ios_base &__base)
ios_base & noshowbase (ios_base &__base)
ios_base & showpoint (ios_base &__base)
ios_base & noshowpoint (ios_base &__base)
ios_base & showpos (ios_base &__base)
ios_base & noshowpos (ios_base &__base)
ios_base & skipws (ios_base &__base)
ios_base & noskipws (ios_base &__base)
ios_base & uppercase (ios_base &__base)
ios_base & nouppercase (ios_base &__base)
ios_base & unitbuf (ios_base &__base)
ios_base & nounitbuf (ios_base &__base)
ios_base & internal (ios_base &__base)
ios_base & left (ios_base &__base)
ios_base & right (ios_base &__base)
ios_base & dec (ios_base &__base)
ios_base & hex (ios_base &__base)
ios_base & oct (ios_base &__base)
ios_base & fixed (ios_base &__base)
ios_base & scientific (ios_base &__base)
template<typename _CharT, typename _Traits> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__in, _CharT &__c)
template<typename _CharT, typename _Traits> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__in, _CharT *__s)
template<typename _CharT, typename _Traits> basic_istream < _CharT, _Traits > & ws (basic_istream < _CharT, _Traits > &__in)
template<typename _T> _T __limits_infinity ()
template<typename _T> _T __limits_quiet_NaN ()
template<typename _T> _T __limits_signaling_NaN ()
template<typename _T> _T __limits_denorm_min ()
template<> const ctype < char > & use_facet< ctype< char > > (const locale &__loc)
template<typename _CharT> bool isspace (_CharT __c, const locale &__loc)
template<typename _CharT> bool isprint (_CharT __c, const locale &__loc)
template<typename _CharT> bool iscntrl (_CharT __c, const locale &__loc)
template<typename _CharT> bool isupper (_CharT __c, const locale &__loc)
template<typename _CharT> bool islower (_CharT __c, const locale &__loc)
template<typename _CharT> bool isalpha (_CharT __c, const locale &__loc)
template<typename _CharT> bool isdigit (_CharT __c, const locale &__loc)
template<typename _CharT> bool ispunct (_CharT __c, const locale &__loc)
template<typename _CharT> bool isxdigit (_CharT __c, const locale &__loc)
template<typename _CharT> bool isalnum (_CharT __c, const locale &__loc)
template<typename _CharT> bool isgraph (_CharT __c, const locale &__loc)
template<typename _CharT> _CharT toupper (_CharT __c, const locale &__loc)
template<typename _CharT> _CharT tolower (_CharT __c, const locale &__loc)
template<typename _Facet> const _Facet & use_facet (const locale &__loc)
template<typename _Facet> bool has_facet (const locale &__loc) throw ()
template<typename _InIter, typename _CharT> _InIter __match_parallel (_InIter __s, _InIter __end, int __ntargs, const basic_string < _CharT > *__targets, int *__matches, int &__remain, bool &__eof)
template<typename _CharT, typename _OutIter> _OutIter __pad (_OutIter __s, _CharT __fill, int __padding)
template<typename _CharT, typename _RaIter> _RaIter __pad (_RaIter __s, _CharT __fill, int __padding, random_access_iterator_tag )
template<typename _CharT, typename _OutIter, typename _Tag> _OutIter __pad (_OutIter __s, _CharT __fill, int __padding, _Tag)
template<typename _CharT, typename _OutIter> _OutIter __pad_numeric (_OutIter __s, ios_base::fmtflags , _CharT, int, _CharT const *, _CharT const *, _CharT const *)
template<typename _CharT> ostreambuf_iterator < _CharT > __pad_numeric (ostreambuf_iterator < _CharT > __s, ios_base::fmtflags __flags, _CharT __fill, int __width, _CharT const *__first, _CharT const *__middle, _CharT const *__last)
template<typename _CharT> _CharT * __group_digits (_CharT *__s, _CharT __grsep, char const *__grouping, char const *__grend, _CharT const *__first, _CharT const *__last)
template<typename _CharT, typename _OutIter, typename _ValueT> _OutIter __output_integer (_OutIter __s, ios_base &__io, _CharT __fill, bool __neg, _ValueT __v)
template<typename _CharT, typename _Traits, typename _OutIter> _OutIter __output_float (_OutIter __s, ios_base &__io, _CharT __fill, const char *__sptr, size_t __slen)
template<typename _CharT, typename _Traits> ostreambuf_iterator < _CharT,
_Traits > __output_float (ostreambuf_iterator < _CharT, _Traits > __s, ios_base &__io, _CharT __fill, const char *__sptr, size_t __slen)
bool __build_float_format (ios_base &__io, char *__fptr, char __modifier, streamsize __prec)
template<size_t _Max_size> bool operator== (const _Pthread_alloc_template < _Max_size > &, const _Pthread_alloc_template < _Max_size > &)
template<class _T1, class _T2> bool operator== (const pthread_allocator < _T1 > &, const pthread_allocator < _T2 > &a2)
template<class _T1, class _T2> bool operator!= (const pthread_allocator < _T1 > &, const pthread_allocator < _T2 > &)
template<typename _CharT, typename _Traits> bool operator== (const istreambuf_iterator < _CharT, _Traits > &__a, const istreambuf_iterator < _CharT, _Traits > &__b)
template<typename _CharT, typename _Traits> bool operator!= (const istreambuf_iterator < _CharT, _Traits > &__a, const istreambuf_iterator < _CharT, _Traits > &__b)
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<size_t _Nb> bitset < _Nb > operator^ (const bitset < _Nb > &__x, const bitset < _Nb > &__y)
template<class _CharT, class _Traits, size_t _Nb> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__is, bitset < _Nb > &__x)
template<class _CharT, class _Traits, size_t _Nb> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__os, const bitset < _Nb > &__x)
template<typename _Tp> _Tp abs (const complex < _Tp > &)
template<typename _Tp> _Tp arg (const complex < _Tp > &)
template<typename _Tp> _Tp norm (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > conj (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > polar (const _Tp &, const _Tp &)
template<typename _Tp> complex < _Tp > cos (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > cosh (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > exp (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > log (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > log10 (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > pow (const complex < _Tp > &, int)
template<typename _Tp> complex < _Tp > pow (const complex < _Tp > &, const _Tp &)
template<typename _Tp> complex < _Tp > pow (const complex < _Tp > &, const complex < _Tp > &)
template<typename _Tp> complex < _Tp > pow (const _Tp &, const complex < _Tp > &)
template<typename _Tp> complex < _Tp > sin (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > sinh (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > sqrt (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > tan (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > tanh (const complex < _Tp > &)
template<typename _Tp> complex < _Tp > operator+ (const complex < _Tp > &__x, const complex < _Tp > &__y)
template<typename _Tp> complex < _Tp > operator+ (const complex < _Tp > &__x, const _Tp &__y)
template<typename _Tp> complex < _Tp > operator+ (const _Tp &__x, const complex < _Tp > &__y)
template<typename _Tp> complex < _Tp > operator- (const complex < _Tp > &__x, const complex < _Tp > &__y)
template<typename _Tp> complex < _Tp > operator- (const complex < _Tp > &__x, const _Tp &__y)
template<typename _Tp> complex < _Tp > operator- (const _Tp &__x, const complex < _Tp > &__y)
template<typename _Tp> complex < _Tp > operator * (const complex < _Tp > &__x, const complex < _Tp > &__y)
template<typename _Tp> complex < _Tp > operator * (const complex < _Tp > &__x, const _Tp &__y)
template<typename _Tp> complex < _Tp > operator * (const _Tp &__x, const complex < _Tp > &__y)
template<typename _Tp> complex < _Tp > operator/ (const complex < _Tp > &__x, const complex < _Tp > &__y)
template<typename _Tp> complex < _Tp > operator/ (const complex < _Tp > &__x, const _Tp &__y)
template<typename _Tp> complex < _Tp > operator/ (const _Tp &__x, const complex < _Tp > &__y)
template<typename _Tp> complex < _Tp > operator+ (const complex < _Tp > &__x)
template<typename _Tp> complex < _Tp > operator- (const complex < _Tp > &__x)
template<typename _Tp> bool operator== (const complex < _Tp > &__x, const complex < _Tp > &__y)
template<typename _Tp> bool operator== (const complex < _Tp > &__x, const _Tp &__y)
template<typename _Tp> bool operator== (const _Tp &__x, const complex < _Tp > &__y)
template<typename _Tp> bool operator!= (const complex < _Tp > &__x, const complex < _Tp > &__y)
template<typename _Tp> bool operator!= (const complex < _Tp > &__x, const _Tp &__y)
template<typename _Tp> bool operator!= (const _Tp &__x, const complex < _Tp > &__y)
template<typename _Tp, typename _CharT, class _Traits> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__is, complex < _Tp > &__x)
template<typename _Tp, typename _CharT, class _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__os, const complex < _Tp > &__x)
template<typename _Tp> _Tp real (const complex < _Tp > &__z)
template<typename _Tp> _Tp imag (const complex < _Tp > &__z)
_Resetiosflags resetiosflags (ios_base::fmtflags __mask)
template<class _CharT, class _Traits> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__is, _Resetiosflags __f)
template<class _CharT, class _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__os, _Resetiosflags __f)
_Setiosflags setiosflags (ios_base::fmtflags __mask)
template<class _CharT, class _Traits> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__is, _Setiosflags __f)
template<class _CharT, class _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__os, _Setiosflags __f)
_Setbase setbase (int __base)
template<class _CharT, class _Traits> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__is, _Setbase __f)
template<class _CharT, class _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__os, _Setbase __f)
template<class _CharT> _Setfill < _CharT > setfill (_CharT __c)
template<class _CharT, class _Traits> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__is, _Setfill < _CharT > __f)
template<class _CharT, class _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__os, _Setfill < _CharT > __f)
_Setprecision setprecision (int __n)
template<class _CharT, class _Traits> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__is, _Setprecision __f)
template<class _CharT, class _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__os, _Setprecision __f)
_Setw setw (int __n)
template<class _CharT, class _Traits> basic_istream < _CharT, _Traits > & operator>> (basic_istream < _CharT, _Traits > &__is, _Setw __f)
template<class _CharT, class _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__os, _Setw __f)
template<class _Traits> basic_istream < char, _Traits > & operator>> (basic_istream < char, _Traits > &__in, unsigned char &__c)
template<class _Traits> basic_istream < char, _Traits > & operator>> (basic_istream < char, _Traits > &__in, signed char &__c)
template<class _Traits> basic_istream < char, _Traits > & operator>> (basic_istream < char, _Traits > &__in, unsigned char *__s)
template<class _Traits> basic_istream < char, _Traits > & operator>> (basic_istream < char, _Traits > &__in, signed char *__s)
template<typename _CharT, typename _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__out, _CharT __c)
template<typename _CharT, typename _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__out, char __c)
template<class _Traits> basic_ostream < char, _Traits > & operator<< (basic_ostream < char, _Traits > &__out, char __c)
template<class _Traits> basic_ostream < char, _Traits > & operator<< (basic_ostream < char, _Traits > &__out, signed char __c)
template<class _Traits> basic_ostream < char, _Traits > & operator<< (basic_ostream < char, _Traits > &__out, unsigned char __c)
template<typename _CharT, typename _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__out, const _CharT *__s)
template<typename _CharT, typename _Traits> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__out, const char *__s)
template<class _Traits> basic_ostream < char, _Traits > & operator<< (basic_ostream < char, _Traits > &__out, const char *__s)
template<class _Traits> basic_ostream < char, _Traits > & operator<< (basic_ostream < char, _Traits > &__out, const signed char *__s)
template<class _Traits> basic_ostream < char, _Traits > & operator<< (basic_ostream < char, _Traits > &__out, const unsigned char *__s)
template<typename _CharT, typename _Traits> basic_ostream < _CharT, _Traits > & endl (basic_ostream < _CharT, _Traits > &__os)
template<typename _CharT, typename _Traits> basic_ostream < _CharT, _Traits > & ends (basic_ostream < _CharT, _Traits > &__os)
template<typename _CharT, typename _Traits> basic_ostream < _CharT, _Traits > & flush (basic_ostream < _CharT, _Traits > &__os)
template<typename _CharT, typename _Traits> streamsize __copy_streambufs (basic_ios < _CharT, _Traits > &_ios, basic_streambuf < _CharT, _Traits > *__sbin, basic_streambuf < _CharT, _Traits > *__sbout)
template<class _Tp> const _Tp & __median (const _Tp &__a, const _Tp &__b, const _Tp &__c)
template<class _Tp, class _Compare> const _Tp & __median (const _Tp &__a, const _Tp &__b, const _Tp &__c, _Compare __comp)
template<class _InputIter, class _Function> _Function for_each (_InputIter __first, _InputIter __last, _Function __f)
template<class _InputIter, class _Tp> _InputIter find (_InputIter __first, _InputIter __last, const _Tp &__val, input_iterator_tag )
template<class _InputIter, class _Predicate> _InputIter find_if (_InputIter __first, _InputIter __last, _Predicate __pred, input_iterator_tag )
template<class _RandomAccessIter, class _Tp> _RandomAccessIter find (_RandomAccessIter __first, _RandomAccessIter __last, const _Tp &__val, random_access_iterator_tag )
template<class _RandomAccessIter, class _Predicate> _RandomAccessIter find_if (_RandomAccessIter __first, _RandomAccessIter __last, _Predicate __pred, random_access_iterator_tag )
template<class _InputIter, class _Tp> _InputIter find (_InputIter __first, _InputIter __last, const _Tp &__val)
template<class _InputIter, class _Predicate> _InputIter find_if (_InputIter __first, _InputIter __last, _Predicate __pred)
template<class _ForwardIter> _ForwardIter adjacent_find (_ForwardIter __first, _ForwardIter __last)
template<class _ForwardIter, class _BinaryPredicate> _ForwardIter adjacent_find (_ForwardIter __first, _ForwardIter __last, _BinaryPredicate __binary_pred)
template<class _InputIter, class _Tp, class _Size> void count (_InputIter __first, _InputIter __last, const _Tp &__value, _Size &__n)
template<class _InputIter, class _Predicate, class _Size> void count_if (_InputIter __first, _InputIter __last, _Predicate __pred, _Size &__n)
template<class _InputIter, class _Tp> iterator_traits < _InputIter
>::difference_type count (_InputIter __first, _InputIter __last, const _Tp &__value)
template<class _InputIter, class _Predicate> iterator_traits < _InputIter
>::difference_type count_if (_InputIter __first, _InputIter __last, _Predicate __pred)
template<class _ForwardIter1, class _ForwardIter2> _ForwardIter1 search (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2)
template<class _ForwardIter1, class _ForwardIter2, class _BinaryPred> _ForwardIter1 search (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, _BinaryPred __predicate)
template<class _ForwardIter, class _Integer, class _Tp> _ForwardIter search_n (_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp &__val)
template<class _ForwardIter, class _Integer, class _Tp, class _BinaryPred> _ForwardIter search_n (_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp &__val, _BinaryPred __binary_pred)
template<class _ForwardIter1, class _ForwardIter2> _ForwardIter2 swap_ranges (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2)
template<class _InputIter, class _OutputIter, class _UnaryOperation> _OutputIter transform (_InputIter __first, _InputIter __last, _OutputIter __result, _UnaryOperation __unary_op)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _BinaryOperation> _OutputIter transform (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _OutputIter __result, _BinaryOperation __binary_op)
template<class _ForwardIter, class _Tp> void replace (_ForwardIter __first, _ForwardIter __last, const _Tp &__old_value, const _Tp &__new_value)
template<class _ForwardIter, class _Predicate, class _Tp> void replace_if (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, const _Tp &__new_value)
template<class _InputIter, class _OutputIter, class _Tp> _OutputIter replace_copy (_InputIter __first, _InputIter __last, _OutputIter __result, const _Tp &__old_value, const _Tp &__new_value)
template<class _InputIter, class _OutputIter, class _Predicate, class _Tp> _OutputIter replace_copy_if (_InputIter __first, _InputIter __last, _OutputIter __result, _Predicate __pred, const _Tp &__new_value)
template<class _ForwardIter, class _Generator> void generate (_ForwardIter __first, _ForwardIter __last, _Generator __gen)
template<class _OutputIter, class _Size, class _Generator> _OutputIter generate_n (_OutputIter __first, _Size __n, _Generator __gen)
template<class _InputIter, class _OutputIter, class _Tp> _OutputIter remove_copy (_InputIter __first, _InputIter __last, _OutputIter __result, const _Tp &__value)
template<class _InputIter, class _OutputIter, class _Predicate> _OutputIter remove_copy_if (_InputIter __first, _InputIter __last, _OutputIter __result, _Predicate __pred)
template<class _ForwardIter, class _Tp> _ForwardIter remove (_ForwardIter __first, _ForwardIter __last, const _Tp &__value)
template<class _ForwardIter, class _Predicate> _ForwardIter remove_if (_ForwardIter __first, _ForwardIter __last, _Predicate __pred)
template<class _InputIter, class _OutputIter, class _Tp> _OutputIter __unique_copy (_InputIter __first, _InputIter __last, _OutputIter __result, _Tp *)
template<class _InputIter, class _OutputIter> _OutputIter __unique_copy (_InputIter __first, _InputIter __last, _OutputIter __result, output_iterator_tag )
template<class _InputIter, class _ForwardIter> _ForwardIter __unique_copy (_InputIter __first, _InputIter __last, _ForwardIter __result, forward_iterator_tag )
template<class _InputIter, class _OutputIter> _OutputIter unique_copy (_InputIter __first, _InputIter __last, _OutputIter __result)
template<class _InputIter, class _OutputIter, class _BinaryPredicate, class _Tp> _OutputIter __unique_copy (_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred, _Tp *)
template<class _InputIter, class _OutputIter, class _BinaryPredicate> _OutputIter __unique_copy (_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred, output_iterator_tag )
template<class _InputIter, class _ForwardIter, class _BinaryPredicate> _ForwardIter __unique_copy (_InputIter __first, _InputIter __last, _ForwardIter __result, _BinaryPredicate __binary_pred, forward_iterator_tag )
template<class _InputIter, class _OutputIter, class _BinaryPredicate> _OutputIter unique_copy (_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred)
template<class _ForwardIter> _ForwardIter unique (_ForwardIter __first, _ForwardIter __last)
template<class _ForwardIter, class _BinaryPredicate> _ForwardIter unique (_ForwardIter __first, _ForwardIter __last, _BinaryPredicate __binary_pred)
template<class _BidirectionalIter> void __reverse (_BidirectionalIter __first, _BidirectionalIter __last, bidirectional_iterator_tag )
template<class _RandomAccessIter> void __reverse (_RandomAccessIter __first, _RandomAccessIter __last, random_access_iterator_tag )
template<class _BidirectionalIter> void reverse (_BidirectionalIter __first, _BidirectionalIter __last)
template<class _BidirectionalIter, class _OutputIter> _OutputIter reverse_copy (_BidirectionalIter __first, _BidirectionalIter __last, _OutputIter __result)
template<class _EuclideanRingElement> _EuclideanRingElement __gcd (_EuclideanRingElement __m, _EuclideanRingElement __n)
template<class _ForwardIter, class _Distance> _ForwardIter __rotate (_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last, _Distance *, forward_iterator_tag )
template<class _BidirectionalIter, class _Distance> _BidirectionalIter __rotate (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance *, bidirectional_iterator_tag )
template<class _RandomAccessIter, class _Distance, class _Tp> _RandomAccessIter __rotate (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Distance *, _Tp *)
template<class _ForwardIter> _ForwardIter rotate (_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last)
template<class _ForwardIter, class _OutputIter> _OutputIter rotate_copy (_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last, _OutputIter __result)
template<class _Distance> _Distance __random_number (_Distance __n)
template<class _RandomAccessIter> void random_shuffle (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter, class _RandomNumberGenerator> void random_shuffle (_RandomAccessIter __first, _RandomAccessIter __last, _RandomNumberGenerator &__rand)
template<class _ForwardIter, class _OutputIter, class _Distance> _OutputIter random_sample_n (_ForwardIter __first, _ForwardIter __last, _OutputIter __out, const _Distance __n)
template<class _ForwardIter, class _OutputIter, class _Distance, class _RandomNumberGenerator> _OutputIter random_sample_n (_ForwardIter __first, _ForwardIter __last, _OutputIter __out, const _Distance __n, _RandomNumberGenerator &__rand)
template<class _InputIter, class _RandomAccessIter, class _Distance> _RandomAccessIter __random_sample (_InputIter __first, _InputIter __last, _RandomAccessIter __out, const _Distance __n)
template<class _InputIter, class _RandomAccessIter, class _RandomNumberGenerator, class _Distance> _RandomAccessIter __random_sample (_InputIter __first, _InputIter __last, _RandomAccessIter __out, _RandomNumberGenerator &__rand, const _Distance __n)
template<class _InputIter, class _RandomAccessIter> _RandomAccessIter random_sample (_InputIter __first, _InputIter __last, _RandomAccessIter __out_first, _RandomAccessIter __out_last)
template<class _InputIter, class _RandomAccessIter, class _RandomNumberGenerator> _RandomAccessIter random_sample (_InputIter __first, _InputIter __last, _RandomAccessIter __out_first, _RandomAccessIter __out_last, _RandomNumberGenerator &__rand)
template<class _ForwardIter, class _Predicate> _ForwardIter __partition (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, forward_iterator_tag )
template<class _BidirectionalIter, class _Predicate> _BidirectionalIter __partition (_BidirectionalIter __first, _BidirectionalIter __last, _Predicate __pred, bidirectional_iterator_tag )
template<class _ForwardIter, class _Predicate> _ForwardIter partition (_ForwardIter __first, _ForwardIter __last, _Predicate __pred)
template<class _ForwardIter, class _Predicate, class _Distance> _ForwardIter __inplace_stable_partition (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len)
template<class _ForwardIter, class _Pointer, class _Predicate, class _Distance> _ForwardIter __stable_partition_adaptive (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size)
template<class _ForwardIter, class _Predicate, class _Tp, class _Distance> _ForwardIter __stable_partition_aux (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Tp *, _Distance *)
template<class _ForwardIter, class _Predicate> _ForwardIter stable_partition (_ForwardIter __first, _ForwardIter __last, _Predicate __pred)
template<class _RandomAccessIter, class _Tp> _RandomAccessIter __unguarded_partition (_RandomAccessIter __first, _RandomAccessIter __last, _Tp __pivot)
template<class _RandomAccessIter, class _Tp, class _Compare> _RandomAccessIter __unguarded_partition (_RandomAccessIter __first, _RandomAccessIter __last, _Tp __pivot, _Compare __comp)
template<class _RandomAccessIter, class _Tp> void __unguarded_linear_insert (_RandomAccessIter __last, _Tp __val)
template<class _RandomAccessIter, class _Tp, class _Compare> void __unguarded_linear_insert (_RandomAccessIter __last, _Tp __val, _Compare __comp)
template<class _RandomAccessIter, class _Tp> void __linear_insert (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *)
template<class _RandomAccessIter, class _Tp, class _Compare> void __linear_insert (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Compare __comp)
template<class _RandomAccessIter> void __insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter, class _Compare> void __insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter, class _Tp> void __unguarded_insertion_sort_aux (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *)
template<class _RandomAccessIter> void __unguarded_insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter, class _Tp, class _Compare> void __unguarded_insertion_sort_aux (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Compare __comp)
template<class _RandomAccessIter, class _Compare> void __unguarded_insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter> void __final_insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter, class _Compare> void __final_insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _Size> _Size __lg (_Size __n)
template<class _RandomAccessIter, class _Tp, class _Size> void __introsort_loop (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Size __depth_limit)
template<class _RandomAccessIter, class _Tp, class _Size, class _Compare> void __introsort_loop (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Size __depth_limit, _Compare __comp)
template<class _RandomAccessIter> void sort (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter, class _Compare> void sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter> void __inplace_stable_sort (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter, class _Compare> void __inplace_stable_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter1, class _RandomAccessIter2, class _Distance> void __merge_sort_loop (_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _Distance __step_size)
template<class _RandomAccessIter1, class _RandomAccessIter2, class _Distance, class _Compare> void __merge_sort_loop (_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _Distance __step_size, _Compare __comp)
template<class _RandomAccessIter, class _Distance> void __chunk_insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Distance __chunk_size)
template<class _RandomAccessIter, class _Distance, class _Compare> void __chunk_insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Distance __chunk_size, _Compare __comp)
template<class _RandomAccessIter, class _Pointer, class _Distance> void __merge_sort_with_buffer (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance *)
template<class _RandomAccessIter, class _Pointer, class _Distance, class _Compare> void __merge_sort_with_buffer (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance *, _Compare __comp)
template<class _RandomAccessIter, class _Pointer, class _Distance> void __stable_sort_adaptive (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance __buffer_size)
template<class _RandomAccessIter, class _Pointer, class _Distance, class _Compare> void __stable_sort_adaptive (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp)
template<class _RandomAccessIter, class _Tp, class _Distance> void __stable_sort_aux (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Distance *)
template<class _RandomAccessIter, class _Tp, class _Distance, class _Compare> void __stable_sort_aux (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Distance *, _Compare __comp)
template<class _RandomAccessIter> void stable_sort (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter, class _Compare> void stable_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter, class _Tp> void __partial_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Tp *)
template<class _RandomAccessIter> void partial_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last)
template<class _RandomAccessIter, class _Tp, class _Compare> void __partial_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Tp *, _Compare __comp)
template<class _RandomAccessIter, class _Compare> void partial_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Compare __comp)
template<class _InputIter, class _RandomAccessIter, class _Distance, class _Tp> _RandomAccessIter __partial_sort_copy (_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Distance *, _Tp *)
template<class _InputIter, class _RandomAccessIter> _RandomAccessIter partial_sort_copy (_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last)
template<class _InputIter, class _RandomAccessIter, class _Compare, class _Distance, class _Tp> _RandomAccessIter __partial_sort_copy (_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp, _Distance *, _Tp *)
template<class _InputIter, class _RandomAccessIter, class _Compare> _RandomAccessIter partial_sort_copy (_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp)
template<class _RandomAccessIter, class _Tp> void __nth_element (_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Tp *)
template<class _RandomAccessIter> void nth_element (_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last)
template<class _RandomAccessIter, class _Tp, class _Compare> void __nth_element (_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Tp *, _Compare __comp)
template<class _RandomAccessIter, class _Compare> void nth_element (_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Compare __comp)
template<class _ForwardIter, class _Tp, class _Distance> _ForwardIter __lower_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Distance *)
template<class _ForwardIter, class _Tp> _ForwardIter lower_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val)
template<class _ForwardIter, class _Tp, class _Compare, class _Distance> _ForwardIter __lower_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare __comp, _Distance *)
template<class _ForwardIter, class _Tp, class _Compare> _ForwardIter lower_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare __comp)
template<class _ForwardIter, class _Tp, class _Distance> _ForwardIter __upper_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Distance *)
template<class _ForwardIter, class _Tp> _ForwardIter upper_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val)
template<class _ForwardIter, class _Tp, class _Compare, class _Distance> _ForwardIter __upper_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare __comp, _Distance *)
template<class _ForwardIter, class _Tp, class _Compare> _ForwardIter upper_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare __comp)
template<class _ForwardIter, class _Tp, class _Distance> pair < _ForwardIter, _ForwardIter > __equal_range (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Distance *)
template<class _ForwardIter, class _Tp> pair < _ForwardIter, _ForwardIter > equal_range (_ForwardIter __first, _ForwardIter __last, const _Tp &__val)
template<class _ForwardIter, class _Tp, class _Compare, class _Distance> pair < _ForwardIter, _ForwardIter > __equal_range (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare __comp, _Distance *)
template<class _ForwardIter, class _Tp, class _Compare> pair < _ForwardIter, _ForwardIter > equal_range (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare __comp)
template<class _ForwardIter, class _Tp> bool binary_search (_ForwardIter __first, _ForwardIter __last, const _Tp &__val)
template<class _ForwardIter, class _Tp, class _Compare> bool binary_search (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare __comp)
template<class _InputIter1, class _InputIter2, class _OutputIter> _OutputIter merge (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare> _OutputIter merge (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _BidirectionalIter, class _Distance> void __merge_without_buffer (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2)
template<class _BidirectionalIter, class _Distance, class _Compare> void __merge_without_buffer (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Compare __comp)
template<class _BidirectionalIter1, class _BidirectionalIter2, class _Distance> _BidirectionalIter1 __rotate_adaptive (_BidirectionalIter1 __first, _BidirectionalIter1 __middle, _BidirectionalIter1 __last, _Distance __len1, _Distance __len2, _BidirectionalIter2 __buffer, _Distance __buffer_size)
template<class _BidirectionalIter1, class _BidirectionalIter2, class _BidirectionalIter3> _BidirectionalIter3 __merge_backward (_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result)
template<class _BidirectionalIter1, class _BidirectionalIter2, class _BidirectionalIter3, class _Compare> _BidirectionalIter3 __merge_backward (_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result, _Compare __comp)
template<class _BidirectionalIter, class _Distance, class _Pointer> void __merge_adaptive (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size)
template<class _BidirectionalIter, class _Distance, class _Pointer, class _Compare> void __merge_adaptive (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp)
template<class _BidirectionalIter, class _Tp, class _Distance> void __inplace_merge_aux (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Tp *, _Distance *)
template<class _BidirectionalIter, class _Tp, class _Distance, class _Compare> void __inplace_merge_aux (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Tp *, _Distance *, _Compare __comp)
template<class _BidirectionalIter> void inplace_merge (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last)
template<class _BidirectionalIter, class _Compare> void inplace_merge (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Compare __comp)
template<class _InputIter1, class _InputIter2> bool includes (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2)
template<class _InputIter1, class _InputIter2, class _Compare> bool includes (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp)
template<class _InputIter1, class _InputIter2, class _OutputIter> _OutputIter set_union (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare> _OutputIter set_union (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1, class _InputIter2, class _OutputIter> _OutputIter set_intersection (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare> _OutputIter set_intersection (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1, class _InputIter2, class _OutputIter> _OutputIter set_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare> _OutputIter set_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1, class _InputIter2, class _OutputIter> _OutputIter set_symmetric_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare> _OutputIter set_symmetric_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _ForwardIter> _ForwardIter max_element (_ForwardIter __first, _ForwardIter __last)
template<class _ForwardIter, class _Compare> _ForwardIter max_element (_ForwardIter __first, _ForwardIter __last, _Compare __comp)
template<class _ForwardIter> _ForwardIter min_element (_ForwardIter __first, _ForwardIter __last)
template<class _ForwardIter, class _Compare> _ForwardIter min_element (_ForwardIter __first, _ForwardIter __last, _Compare __comp)
template<class _BidirectionalIter> bool next_permutation (_BidirectionalIter __first, _BidirectionalIter __last)
template<class _BidirectionalIter, class _Compare> bool next_permutation (_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp)
template<class _BidirectionalIter> bool prev_permutation (_BidirectionalIter __first, _BidirectionalIter __last)
template<class _BidirectionalIter, class _Compare> bool prev_permutation (_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp)
template<class _InputIter, class _ForwardIter> _InputIter find_first_of (_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2)
template<class _InputIter, class _ForwardIter, class _BinaryPredicate> _InputIter find_first_of (_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp)
template<class _ForwardIter1, class _ForwardIter2> _ForwardIter1 __find_end (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, forward_iterator_tag , forward_iterator_tag )
template<class _ForwardIter1, class _ForwardIter2, class _BinaryPredicate> _ForwardIter1 __find_end (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, forward_iterator_tag , forward_iterator_tag , _BinaryPredicate __comp)
template<class _BidirectionalIter1, class _BidirectionalIter2> _BidirectionalIter1 __find_end (_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, bidirectional_iterator_tag , bidirectional_iterator_tag )
template<class _BidirectionalIter1, class _BidirectionalIter2, class _BinaryPredicate> _BidirectionalIter1 __find_end (_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, bidirectional_iterator_tag , bidirectional_iterator_tag , _BinaryPredicate __comp)
template<class _ForwardIter1, class _ForwardIter2> _ForwardIter1 find_end (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2)
template<class _ForwardIter1, class _ForwardIter2, class _BinaryPredicate> _ForwardIter1 find_end (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, _BinaryPredicate __comp)
template<class _RandomAccessIter, class _Distance> bool __is_heap (_RandomAccessIter __first, _Distance __n)
template<class _RandomAccessIter, class _Distance, class _StrictWeakOrdering> bool __is_heap (_RandomAccessIter __first, _StrictWeakOrdering __comp, _Distance __n)
template<class _RandomAccessIter> bool is_heap (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter, class _StrictWeakOrdering> bool is_heap (_RandomAccessIter __first, _RandomAccessIter __last, _StrictWeakOrdering __comp)
template<class _ForwardIter> bool is_sorted (_ForwardIter __first, _ForwardIter __last)
template<class _ForwardIter, class _StrictWeakOrdering> bool is_sorted (_ForwardIter __first, _ForwardIter __last, _StrictWeakOrdering __comp)
template<class _ForwardIter1, class _ForwardIter2, class _Tp> void __iter_swap (_ForwardIter1 __a, _ForwardIter2 __b, _Tp *)
template<class _ForwardIter1, class _ForwardIter2> void iter_swap (_ForwardIter1 __a, _ForwardIter2 __b)
template<class _Tp> void swap (_Tp &__a, _Tp &__b)
template<class _Tp> const _Tp & min (const _Tp &__a, const _Tp &__b)
template<class _Tp> const _Tp & max (const _Tp &__a, const _Tp &__b)
template<class _Tp, class _Compare> const _Tp & min (const _Tp &__a, const _Tp &__b, _Compare __comp)
template<class _Tp, class _Compare> const _Tp & max (const _Tp &__a, const _Tp &__b, _Compare __comp)
template<class _InputIter, class _OutputIter, class _Distance> _OutputIter __copy (_InputIter __first, _InputIter __last, _OutputIter __result, input_iterator_tag , _Distance *)
template<class _RandomAccessIter, class _OutputIter, class _Distance> _OutputIter __copy (_RandomAccessIter __first, _RandomAccessIter __last, _OutputIter __result, random_access_iterator_tag , _Distance *)
template<class _Tp> _Tp * __copy_trivial (const _Tp *__first, const _Tp *__last, _Tp *__result)
template<class _InputIter, class _OutputIter> _OutputIter __copy_aux2 (_InputIter __first, _InputIter __last, _OutputIter __result, __false_type )
template<class _Tp> _Tp * __copy_aux2 (_Tp *__first, _Tp *__last, _Tp *__result, __true_type )
template<class _Tp> _Tp * __copy_aux2 (const _Tp *__first, const _Tp *__last, _Tp *__result, __true_type )
template<class _InputIter, class _OutputIter, class _Tp> _OutputIter __copy_aux (_InputIter __first, _InputIter __last, _OutputIter __result, _Tp *)
template<typename _InputIter, typename _OutputIter> _OutputIter __copy_ni2 (_InputIter __first, _InputIter __last, _OutputIter __result, __true_type )
template<typename _InputIter, typename _OutputIter> _OutputIter __copy_ni1 (_InputIter __first, _InputIter __last, _OutputIter __result, __true_type )
template<class _InputIter, class _OutputIter> _OutputIter copy (_InputIter __first, _InputIter __last, _OutputIter __result)
template<class _BidirectionalIter1, class _BidirectionalIter2, class _Distance> _BidirectionalIter2 __copy_backward (_BidirectionalIter1 __first, _BidirectionalIter1 __last, _BidirectionalIter2 __result, bidirectional_iterator_tag , _Distance *)
template<class _RandomAccessIter, class _BidirectionalIter, class _Distance> _BidirectionalIter __copy_backward (_RandomAccessIter __first, _RandomAccessIter __last, _BidirectionalIter __result, random_access_iterator_tag , _Distance *)
template<class _BI1, class _BI2> _BI2 __copy_backward_aux (_BI1 __first, _BI1 __last, _BI2 __result)
template<typename _BI1, typename _BI2> _BI2 __copy_backward_output_normal_iterator (_BI1 __first, _BI1 __last, _BI2 __result, __true_type )
template<typename _BI1, typename _BI2> _BI2 __copy_backward_input_normal_iterator (_BI1 __first, _BI1 __last, _BI2 __result, __true_type )
template<typename _BI1, typename _BI2> _BI2 copy_backward (_BI1 __first, _BI1 __last, _BI2 __result)
template<class _InputIter, class _Size, class _OutputIter> pair < _InputIter, _OutputIter > __copy_n (_InputIter __first, _Size __count, _OutputIter __result, input_iterator_tag )
template<class _RAIter, class _Size, class _OutputIter> pair < _RAIter, _OutputIter > __copy_n (_RAIter __first, _Size __count, _OutputIter __result, random_access_iterator_tag )
template<class _InputIter, class _Size, class _OutputIter> pair < _InputIter, _OutputIter > __copy_n (_InputIter __first, _Size __count, _OutputIter __result)
template<class _InputIter, class _Size, class _OutputIter> pair < _InputIter, _OutputIter > copy_n (_InputIter __first, _Size __count, _OutputIter __result)
template<class _ForwardIter, class _Tp> void fill (_ForwardIter __first, _ForwardIter __last, const _Tp &__value)
template<class _OutputIter, class _Size, class _Tp> _OutputIter fill_n (_OutputIter __first, _Size __n, const _Tp &__value)
void fill (unsigned char *__first, unsigned char *__last, const unsigned char &__c)
void fill (signed char *__first, signed char *__last, const signed char &__c)
void fill (char *__first, char *__last, const char &__c)
template<class _Size> unsigned char * fill_n (unsigned char *__first, _Size __n, const unsigned char &__c)
template<class _Size> signed char * fill_n (char *__first, _Size __n, const signed char &__c)
template<class _Size> char * fill_n (char *__first, _Size __n, const char &__c)
template<class _InputIter1, class _InputIter2> pair < _InputIter1, _InputIter2 > mismatch (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2)
template<class _InputIter1, class _InputIter2, class _BinaryPredicate> pair < _InputIter1, _InputIter2 > mismatch (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _BinaryPredicate __binary_pred)
template<class _InputIter1, class _InputIter2> bool equal (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2)
template<class _InputIter1, class _InputIter2, class _BinaryPredicate> bool equal (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _BinaryPredicate __binary_pred)
template<class _InputIter1, class _InputIter2> bool lexicographical_compare (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2)
template<class _InputIter1, class _InputIter2, class _Compare> bool lexicographical_compare (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp)
bool lexicographical_compare (const unsigned char *__first1, const unsigned char *__last1, const unsigned char *__first2, const unsigned char *__last2)
bool lexicographical_compare (const char *__first1, const char *__last1, const char *__first2, const char *__last2)
template<class _InputIter1, class _InputIter2> int __lexicographical_compare_3way (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2)
int __lexicographical_compare_3way (const unsigned char *__first1, const unsigned char *__last1, const unsigned char *__first2, const unsigned char *__last2)
int __lexicographical_compare_3way (const char *__first1, const char *__last1, const char *__first2, const char *__last2)
template<class _InputIter1, class _InputIter2> int lexicographical_compare_3way (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2)
template<bool __threads, int __inst> bool operator== (const __default_alloc_template < __threads, __inst > &, const __default_alloc_template < __threads, __inst > &)
template<bool __threads, int __inst> bool operator!= (const __default_alloc_template < __threads, __inst > &, const __default_alloc_template < __threads, __inst > &)
template<class _T1, class _T2> bool operator== (const allocator < _T1 > &, const allocator < _T2 > &)
template<class _T1, class _T2> bool operator!= (const allocator < _T1 > &, const allocator < _T2 > &)
template<class _Tp, class _Alloc> bool operator== (const __allocator < _Tp, _Alloc > &__a1, const __allocator < _Tp, _Alloc > &__a2)
template<class _Tp, class _Alloc> bool operator!= (const __allocator < _Tp, _Alloc > &__a1, const __allocator < _Tp, _Alloc > &__a2)
template<int inst> bool operator== (const __malloc_alloc_template < inst > &, const __malloc_alloc_template < inst > &)
template<int __inst> bool operator!= (const __malloc_alloc_template < __inst > &, const __malloc_alloc_template < __inst > &)
template<class _Alloc> bool operator== (const debug_alloc < _Alloc > &, const debug_alloc < _Alloc > &)
template<class _Alloc> bool operator!= (const debug_alloc < _Alloc > &, const debug_alloc < _Alloc > &)
void swap (_Bit_reference __x, _Bit_reference __y)
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)
template<class _T1, class _T2> void _Construct (_T1 *__p, const _T2 &__value)
template<class _T1> void _Construct (_T1 *__p)
template<class _Tp> void _Destroy (_Tp *__pointer)
template<class _ForwardIterator> void __destroy_aux (_ForwardIterator __first, _ForwardIterator __last, __false_type )
template<class _ForwardIterator, class _Tp> void __destroy (_ForwardIterator __first, _ForwardIterator __last, _Tp *)
template<class _ForwardIterator> void _Destroy (_ForwardIterator __first, _ForwardIterator __last)
void _Destroy (char *, char *)
void _Destroy (int *, int *)
void _Destroy (long *, long *)
void _Destroy (float *, float *)
void _Destroy (double *, double *)
void _Destroy (wchar_t *, wchar_t *)
template<class _T1, class _T2> void construct (_T1 *__p, const _T2 &__value)
template<class _T1> void construct (_T1 *__p)
template<class _Tp> void destroy (_Tp *__pointer)
template<class _ForwardIterator> void destroy (_ForwardIterator __first, _ForwardIterator __last)
size_t __deque_buf_size (size_t __size)
template<class _Tp, class _Ref, class _Ptr> _Deque_iterator < _Tp, _Ref,
_Ptr > operator+ (ptrdiff_t __n, const _Deque_iterator < _Tp, _Ref, _Ptr > &__x)
template<class _Tp, class _Alloc> bool operator== (const deque < _Tp, _Alloc > &__x, const deque < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator< (const deque < _Tp, _Alloc > &__x, const deque < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator!= (const deque < _Tp, _Alloc > &__x, const deque < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator> (const deque < _Tp, _Alloc > &__x, const deque < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator<= (const deque < _Tp, _Alloc > &__x, const deque < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator>= (const deque < _Tp, _Alloc > &__x, const deque < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> void swap (deque < _Tp, _Alloc > &__x, deque < _Tp, _Alloc > &__y)
template<class _Tp> _Tp identity_element (plus < _Tp >)
template<class _Tp> _Tp identity_element (multiplies < _Tp >)
template<class _Predicate> unary_negate < _Predicate > not1 (const _Predicate &__pred)
template<class _Predicate> binary_negate < _Predicate > not2 (const _Predicate &__pred)
template<class _Operation, class _Tp> binder1st < _Operation > bind1st (const _Operation &__fn, const _Tp &__x)
template<class _Operation, class _Tp> binder2nd < _Operation > bind2nd (const _Operation &__fn, const _Tp &__x)
template<class _Operation1, class _Operation2> unary_compose < _Operation1,
_Operation2 > compose1 (const _Operation1 &__fn1, const _Operation2 &__fn2)
template<class _Operation1, class _Operation2, class _Operation3> binary_compose < _Operation1,
_Operation2, _Operation3 > compose2 (const _Operation1 &__fn1, const _Operation2 &__fn2, const _Operation3 &__fn3)
template<class _Arg, class _Result> pointer_to_unary_function <
_Arg, _Result > ptr_fun (_Result(*__x)(_Arg))
template<class _Arg1, class _Arg2, class _Result> pointer_to_binary_function <
_Arg1, _Arg2, _Result > ptr_fun (_Result(*__x)(_Arg1, _Arg2))
template<class _Result> constant_void_fun < _Result > constant0 (const _Result &__val)
template<class _Result> constant_unary_fun < _Result,
_Result > constant1 (const _Result &__val)
template<class _Result> constant_binary_fun < _Result,
_Result, _Result > constant2 (const _Result &__val)
template<class _Ret, class _Tp> mem_fun_t < _Ret, _Tp > mem_fun (_Ret(_Tp::*__f)())
template<class _Ret, class _Tp> mem_fun_ref_t < _Ret, _Tp > mem_fun_ref (_Ret(_Tp::*__f)())
template<class _Ret, class _Tp, class _Arg> mem_fun1_t < _Ret, _Tp, _Arg > mem_fun (_Ret(_Tp::*__f)(_Arg))
template<class _Ret, class _Tp, class _Arg> mem_fun1_ref_t < _Ret, _Tp,
_Arg > mem_fun_ref (_Ret(_Tp::*__f)(_Arg))
template<class _Ret, class _Tp, class _Arg> mem_fun1_t < _Ret, _Tp, _Arg > mem_fun1 (_Ret(_Tp::*__f)(_Arg))
template<class _Ret, class _Tp, class _Arg> mem_fun1_ref_t < _Ret, _Tp,
_Arg > mem_fun1_ref (_Ret(_Tp::*__f)(_Arg))
template<class _RandomAccessIterator, class _Distance, class _Tp> void __push_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value)
template<class _RandomAccessIterator, class _Distance, class _Tp> void __push_heap_aux (_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance *, _Tp *)
template<class _RandomAccessIterator> void push_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<class _RandomAccessIterator, class _Distance, class _Tp, class _Compare> void __push_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp)
template<class _RandomAccessIterator, class _Compare, class _Distance, class _Tp> void __push_heap_aux (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Distance *, _Tp *)
template<class _RandomAccessIterator, class _Compare> void push_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<class _RandomAccessIterator, class _Distance, class _Tp> void __adjust_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value)
template<class _RandomAccessIterator, class _Tp, class _Distance> void __pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Distance *)
template<class _RandomAccessIterator, class _Tp> void __pop_heap_aux (_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp *)
template<class _RandomAccessIterator> void pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<class _RandomAccessIterator, class _Distance, class _Tp, class _Compare> void __adjust_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp)
template<class _RandomAccessIterator, class _Tp, class _Compare, class _Distance> void __pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Compare __comp, _Distance *)
template<class _RandomAccessIterator, class _Tp, class _Compare> void __pop_heap_aux (_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp *, _Compare __comp)
template<class _RandomAccessIterator, class _Compare> void pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<class _RandomAccessIterator, class _Tp, class _Distance> void __make_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp *, _Distance *)
template<class _RandomAccessIterator> void make_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<class _RandomAccessIterator, class _Compare, class _Tp, class _Distance> void __make_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Tp *, _Distance *)
template<class _RandomAccessIterator, class _Compare> void make_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<class _RandomAccessIterator> void sort_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<class _RandomAccessIterator, class _Compare> void sort_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<class _Container> back_insert_iterator < _Container > back_inserter (_Container &__x)
template<class _Container> front_insert_iterator < _Container > front_inserter (_Container &__x)
template<class _Container, class _Iterator> insert_iterator < _Container > inserter (_Container &__x, _Iterator __i)
template<class _BiIter, class _Tp, class _Ref, class _Distance> bool operator== (const reverse_bidirectional_iterator < _BiIter, _Tp, _Ref, _Distance > &__x, const reverse_bidirectional_iterator < _BiIter, _Tp, _Ref, _Distance > &__y)
template<class _BiIter, class _Tp, class _Ref, class _Distance> bool operator!= (const reverse_bidirectional_iterator < _BiIter, _Tp, _Ref, _Distance > &__x, const reverse_bidirectional_iterator < _BiIter, _Tp, _Ref, _Distance > &__y)
template<class _Iterator> bool operator== (const reverse_iterator < _Iterator > &__x, const reverse_iterator < _Iterator > &__y)
template<class _Iterator> bool operator< (const reverse_iterator < _Iterator > &__x, const reverse_iterator < _Iterator > &__y)
template<class _Iterator> bool operator!= (const reverse_iterator < _Iterator > &__x, const reverse_iterator < _Iterator > &__y)
template<class _Iterator> bool operator> (const reverse_iterator < _Iterator > &__x, const reverse_iterator < _Iterator > &__y)
template<class _Iterator> bool operator<= (const reverse_iterator < _Iterator > &__x, const reverse_iterator < _Iterator > &__y)
template<class _Iterator> bool operator>= (const reverse_iterator < _Iterator > &__x, const reverse_iterator < _Iterator > &__y)
template<class _Iterator> reverse_iterator < _Iterator
>::difference_type operator- (const reverse_iterator < _Iterator > &__x, const reverse_iterator < _Iterator > &__y)
template<class _Iterator> reverse_iterator < _Iterator > operator+ (typename reverse_iterator < _Iterator >::difference_type __n, const reverse_iterator < _Iterator > &__x)
template<class _Tp, class _CharT, class _Traits, class _Dist> bool operator== (const istream_iterator < _Tp, _CharT, _Traits, _Dist > &__x, const istream_iterator < _Tp, _CharT, _Traits, _Dist > &__y)
template<class _Tp, class _CharT, class _Traits, class _Dist> bool operator!= (const istream_iterator < _Tp, _CharT, _Traits, _Dist > &__x, const istream_iterator < _Tp, _CharT, _Traits, _Dist > &__y)
template<typename _IteratorL, typename _IteratorR, typename _Container> bool operator== (const __normal_iterator < _IteratorL, _Container > &__lhs, const __normal_iterator < _IteratorR, _Container > &__rhs)
template<typename _IteratorL, typename _IteratorR, typename _Container> bool operator!= (const __normal_iterator < _IteratorL, _Container > &__lhs, const __normal_iterator < _IteratorR, _Container > &__rhs)
template<typename _IteratorL, typename _IteratorR, typename _Container> bool operator< (const __normal_iterator < _IteratorL, _Container > &__lhs, const __normal_iterator < _IteratorR, _Container > &__rhs)
template<typename _IteratorL, typename _IteratorR, typename _Container> bool operator> (const __normal_iterator < _IteratorL, _Container > &__lhs, const __normal_iterator < _IteratorR, _Container > &__rhs)
template<typename _IteratorL, typename _IteratorR, typename _Container> bool operator<= (const __normal_iterator < _IteratorL, _Container > &__lhs, const __normal_iterator < _IteratorR, _Container > &__rhs)
template<typename _IteratorL, typename _IteratorR, typename _Container> bool operator>= (const __normal_iterator < _IteratorL, _Container > &__lhs, const __normal_iterator < _IteratorR, _Container > &__rhs)
template<typename _Iterator, typename _Container> __normal_iterator < _Iterator,
_Container > operator+ (typename __normal_iterator < _Iterator, _Container >::difference_type __n, const __normal_iterator < _Iterator, _Container > &__i)
template<class _InputIterator, class _Distance> void __distance (_InputIterator __first, _InputIterator __last, _Distance &__n, input_iterator_tag )
template<class _RandomAccessIterator, class _Distance> void __distance (_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance &__n, random_access_iterator_tag )
template<class _InputIterator, class _Distance> void distance (_InputIterator __first, _InputIterator __last, _Distance &__n)
template<class _InputIterator> iterator_traits < _InputIterator
>::difference_type __distance (_InputIterator __first, _InputIterator __last, input_iterator_tag )
template<class _RandomAccessIterator> iterator_traits < _RandomAccessIterator
>::difference_type __distance (_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag )
template<class _InputIterator> iterator_traits < _InputIterator
>::difference_type distance (_InputIterator __first, _InputIterator __last)
template<class _InputIter, class _Distance> void __advance (_InputIter &__i, _Distance __n, input_iterator_tag )
template<class _BidirectionalIterator, class _Distance> void __advance (_BidirectionalIterator &__i, _Distance __n, bidirectional_iterator_tag )
template<class _RandomAccessIterator, class _Distance> void __advance (_RandomAccessIterator &__i, _Distance __n, random_access_iterator_tag )
template<class _InputIterator, class _Distance> void advance (_InputIterator &__i, _Distance __n)
template<class _Iter> iterator_traits < _Iter
>::iterator_category __iterator_category (const _Iter &)
template<class _Iter> iterator_traits < _Iter
>::difference_type * __distance_type (const _Iter &)
template<class _Iter> iterator_traits < _Iter
>::value_type * __value_type (const _Iter &)
template<class _Iter> iterator_traits < _Iter
>::iterator_category iterator_category (const _Iter &__i)
template<class _Iter> iterator_traits < _Iter
>::difference_type * distance_type (const _Iter &__i)
template<class _Iter> iterator_traits < _Iter
>::value_type * value_type (const _Iter &__i)
template<class _Tp, class _Alloc> bool operator== (const list < _Tp, _Alloc > &__x, const list < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator< (const list < _Tp, _Alloc > &__x, const list < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator!= (const list < _Tp, _Alloc > &__x, const list < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator> (const list < _Tp, _Alloc > &__x, const list < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator<= (const list < _Tp, _Alloc > &__x, const list < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator>= (const list < _Tp, _Alloc > &__x, const list < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> void swap (list < _Tp, _Alloc > &__x, list < _Tp, _Alloc > &__y)
void __List_base_reverse (_List_node_base *__p)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator== (const map < _Key, _Tp, _Compare, _Alloc > &__x, const map < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator< (const map < _Key, _Tp, _Compare, _Alloc > &__x, const map < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator!= (const map < _Key, _Tp, _Compare, _Alloc > &__x, const map < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator> (const map < _Key, _Tp, _Compare, _Alloc > &__x, const map < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator<= (const map < _Key, _Tp, _Compare, _Alloc > &__x, const map < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator>= (const map < _Key, _Tp, _Compare, _Alloc > &__x, const map < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> void swap (map < _Key, _Tp, _Compare, _Alloc > &__x, map < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator== (const multimap < _Key, _Tp, _Compare, _Alloc > &__x, const multimap < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator< (const multimap < _Key, _Tp, _Compare, _Alloc > &__x, const multimap < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator!= (const multimap < _Key, _Tp, _Compare, _Alloc > &__x, const multimap < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator> (const multimap < _Key, _Tp, _Compare, _Alloc > &__x, const multimap < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator<= (const multimap < _Key, _Tp, _Compare, _Alloc > &__x, const multimap < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> bool operator>= (const multimap < _Key, _Tp, _Compare, _Alloc > &__x, const multimap < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Tp, class _Compare, class _Alloc> void swap (multimap < _Key, _Tp, _Compare, _Alloc > &__x, multimap < _Key, _Tp, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator== (const multiset < _Key, _Compare, _Alloc > &__x, const multiset < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator< (const multiset < _Key, _Compare, _Alloc > &__x, const multiset < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator!= (const multiset < _Key, _Compare, _Alloc > &__x, const multiset < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator> (const multiset < _Key, _Compare, _Alloc > &__x, const multiset < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator<= (const multiset < _Key, _Compare, _Alloc > &__x, const multiset < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator>= (const multiset < _Key, _Compare, _Alloc > &__x, const multiset < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> void swap (multiset < _Key, _Compare, _Alloc > &__x, multiset < _Key, _Compare, _Alloc > &__y)
template<class _InputIterator, class _Tp> _Tp accumulate (_InputIterator __first, _InputIterator __last, _Tp __init)
template<class _InputIterator, class _Tp, class _BinaryOperation> _Tp accumulate (_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
template<class _InputIterator1, class _InputIterator2, class _Tp> _Tp inner_product (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init)
template<class _InputIterator1, class _InputIterator2, class _Tp, class _BinaryOperation1, class _BinaryOperation2> _Tp inner_product (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2)
template<class _InputIterator, class _OutputIterator, class _Tp> _OutputIterator __partial_sum (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp *)
template<class _InputIterator, class _OutputIterator> _OutputIterator partial_sum (_InputIterator __first, _InputIterator __last, _OutputIterator __result)
template<class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOperation> _OutputIterator __partial_sum (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp *, _BinaryOperation __binary_op)
template<class _InputIterator, class _OutputIterator, class _BinaryOperation> _OutputIterator partial_sum (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op)
template<class _InputIterator, class _OutputIterator, class _Tp> _OutputIterator __adjacent_difference (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp *)
template<class _InputIterator, class _OutputIterator> _OutputIterator adjacent_difference (_InputIterator __first, _InputIterator __last, _OutputIterator __result)
template<class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOperation> _OutputIterator __adjacent_difference (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp *, _BinaryOperation __binary_op)
template<class _InputIterator, class _OutputIterator, class _BinaryOperation> _OutputIterator adjacent_difference (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op)
template<class _Tp, class _Integer, class _MonoidOperation> _Tp __power (_Tp __x, _Integer __n, _MonoidOperation __monoid_op)
template<class _Tp, class _Integer> _Tp __power (_Tp __x, _Integer __n)
template<class _Tp, class _Integer, class _MonoidOperation> _Tp power (_Tp __x, _Integer __n, _MonoidOperation __monoid_op)
template<class _Tp, class _Integer> _Tp power (_Tp __x, _Integer __n)
template<class _ForwardIter, class _Tp> void iota (_ForwardIter __first, _ForwardIter __last, _Tp __value)
template<class _T1, class _T2> bool operator== (const pair < _T1, _T2 > &__x, const pair < _T1, _T2 > &__y)
Two pairs of the same type are equal iff their members are equal. More...
template<class _T1, class _T2> bool operator< (const pair < _T1, _T2 > &__x, const pair < _T1, _T2 > &__y)
...put link to onlinedocs here... More...
template<class _T1, class _T2> bool operator!= (const pair < _T1, _T2 > &__x, const pair < _T1, _T2 > &__y)
Uses operator
== to find the result. More...
template<class _T1, class _T2> bool operator> (const pair < _T1, _T2 > &__x, const pair < _T1, _T2 > &__y)
Uses operator<
to find the result. More...
template<class _T1, class _T2> bool operator<= (const pair < _T1, _T2 > &__x, const pair < _T1, _T2 > &__y)
Uses operator<
to find the result. More...
template<class _T1, class _T2> bool operator>= (const pair < _T1, _T2 > &__x, const pair < _T1, _T2 > &__y)
Uses operator<
to find the result. More...
template<class _T1, class _T2> pair < _T1, _T2 > make_pair (const _T1 &__x, const _T2 &__y)
A convenience wrapper for creating a pair from two objects. More...
template<class _Tp, class _Seq> bool operator== (const queue < _Tp, _Seq > &, const queue < _Tp, _Seq > &)
template<class _Tp, class _Seq> bool operator< (const queue < _Tp, _Seq > &, const queue < _Tp, _Seq > &)
template<class _Tp, class _Sequence> bool operator== (const queue < _Tp, _Sequence > &__x, const queue < _Tp, _Sequence > &__y)
template<class _Tp, class _Sequence> bool operator< (const queue < _Tp, _Sequence > &__x, const queue < _Tp, _Sequence > &__y)
template<class _Tp, class _Sequence> bool operator!= (const queue < _Tp, _Sequence > &__x, const queue < _Tp, _Sequence > &__y)
template<class _Tp, class _Sequence> bool operator> (const queue < _Tp, _Sequence > &__x, const queue < _Tp, _Sequence > &__y)
template<class _Tp, class _Sequence> bool operator<= (const queue < _Tp, _Sequence > &__x, const queue < _Tp, _Sequence > &__y)
template<class _Tp, class _Sequence> bool operator>= (const queue < _Tp, _Sequence > &__x, const queue < _Tp, _Sequence > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator== (const set < _Key, _Compare, _Alloc > &__x, const set < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator< (const set < _Key, _Compare, _Alloc > &__x, const set < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator!= (const set < _Key, _Compare, _Alloc > &__x, const set < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator> (const set < _Key, _Compare, _Alloc > &__x, const set < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator<= (const set < _Key, _Compare, _Alloc > &__x, const set < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> bool operator>= (const set < _Key, _Compare, _Alloc > &__x, const set < _Key, _Compare, _Alloc > &__y)
template<class _Key, class _Compare, class _Alloc> void swap (set < _Key, _Compare, _Alloc > &__x, set < _Key, _Compare, _Alloc > &__y)
template<class _Tp, class _Seq> bool operator== (const stack < _Tp, _Seq > &__x, const stack < _Tp, _Seq > &__y)
template<class _Tp, class _Seq> bool operator< (const stack < _Tp, _Seq > &__x, const stack < _Tp, _Seq > &__y)
template<class _Tp, class _Seq> bool operator!= (const stack < _Tp, _Seq > &__x, const stack < _Tp, _Seq > &__y)
template<class _Tp, class _Seq> bool operator> (const stack < _Tp, _Seq > &__x, const stack < _Tp, _Seq > &__y)
template<class _Tp, class _Seq> bool operator<= (const stack < _Tp, _Seq > &__x, const stack < _Tp, _Seq > &__y)
template<class _Tp, class _Seq> bool operator>= (const stack < _Tp, _Seq > &__x, const stack < _Tp, _Seq > &__y)
template<class _Tp> pair < _Tp *, ptrdiff_t > __get_temporary_buffer (ptrdiff_t __len, _Tp *)
template<class _Tp> pair < _Tp *, ptrdiff_t > get_temporary_buffer (ptrdiff_t __len)
template<class _Tp> pair < _Tp *, ptrdiff_t > get_temporary_buffer (ptrdiff_t __len, _Tp *)
template<class _Tp> void return_temporary_buffer (_Tp *__p)
unsigned long _Atomic_swap (unsigned long *__p, unsigned long __q)
template<class _Value, class _Ref, class _Ptr> bool operator== (const _Rb_tree_iterator < _Value, _Ref, _Ptr > &__x, const _Rb_tree_iterator < _Value, _Ref, _Ptr > &__y)
template<class _Value> bool operator== (const _Rb_tree_iterator < _Value, const _Value &, const _Value * > &__x, const _Rb_tree_iterator < _Value, _Value &, _Value * > &__y)
template<class _Value> bool operator== (const _Rb_tree_iterator < _Value, _Value &, _Value * > &__x, const _Rb_tree_iterator < _Value, const _Value &, const _Value * > &__y)
template<class _Value, class _Ref, class _Ptr> bool operator!= (const _Rb_tree_iterator < _Value, _Ref, _Ptr > &__x, const _Rb_tree_iterator < _Value, _Ref, _Ptr > &__y)
template<class _Value> bool operator!= (const _Rb_tree_iterator < _Value, const _Value &, const _Value * > &__x, const _Rb_tree_iterator < _Value, _Value &, _Value * > &__y)
template<class _Value> bool operator!= (const _Rb_tree_iterator < _Value, _Value &, _Value * > &__x, const _Rb_tree_iterator < _Value, const _Value &, const _Value * > &__y)
void _Rb_tree_rotate_left (_Rb_tree_node_base *__x, _Rb_tree_node_base *&__root)
void _Rb_tree_rotate_right (_Rb_tree_node_base *__x, _Rb_tree_node_base *&__root)
void _Rb_tree_rebalance (_Rb_tree_node_base *__x, _Rb_tree_node_base *&__root)
_Rb_tree_node_base * _Rb_tree_rebalance_for_erase (_Rb_tree_node_base *__z, _Rb_tree_node_base *&__root, _Rb_tree_node_base *&__leftmost, _Rb_tree_node_base *&__rightmost)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc> bool operator== (const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__y)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc> bool operator< (const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__y)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc> bool operator!= (const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__y)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc> bool operator> (const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__y)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc> bool operator<= (const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__y)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc> bool operator>= (const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__y)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc> void swap (_Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__x, _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__y)
int __black_count (_Rb_tree_node_base *__node, _Rb_tree_node_base *__root)
template<class _InputIter, class _ForwardIter> _ForwardIter __uninitialized_copy_aux (_InputIter __first, _InputIter __last, _ForwardIter __result, __true_type )
template<class _InputIter, class _ForwardIter, class _Tp> _ForwardIter __uninitialized_copy (_InputIter __first, _InputIter __last, _ForwardIter __result, _Tp *)
template<class _InputIter, class _ForwardIter> _ForwardIter uninitialized_copy (_InputIter __first, _InputIter __last, _ForwardIter __result)
char * uninitialized_copy (const char *__first, const char *__last, char *__result)
wchar_t * uninitialized_copy (const wchar_t *__first, const wchar_t *__last, wchar_t *__result)
template<class _InputIter, class _Size, class _ForwardIter> pair < _InputIter, _ForwardIter > __uninitialized_copy_n (_InputIter __first, _Size __count, _ForwardIter __result, input_iterator_tag )
template<class _RandomAccessIter, class _Size, class _ForwardIter> pair < _RandomAccessIter, _ForwardIter > __uninitialized_copy_n (_RandomAccessIter __first, _Size __count, _ForwardIter __result, random_access_iterator_tag )
template<class _InputIter, class _Size, class _ForwardIter> pair < _InputIter, _ForwardIter > __uninitialized_copy_n (_InputIter __first, _Size __count, _ForwardIter __result)
template<class _InputIter, class _Size, class _ForwardIter> pair < _InputIter, _ForwardIter > uninitialized_copy_n (_InputIter __first, _Size __count, _ForwardIter __result)
template<class _ForwardIter, class _Tp> void __uninitialized_fill_aux (_ForwardIter __first, _ForwardIter __last, const _Tp &__x, __true_type )
template<class _ForwardIter, class _Tp, class _Tp1> void __uninitialized_fill (_ForwardIter __first, _ForwardIter __last, const _Tp &__x, _Tp1 *)
template<class _ForwardIter, class _Tp> void uninitialized_fill (_ForwardIter __first, _ForwardIter __last, const _Tp &__x)
template<class _ForwardIter, class _Size, class _Tp> _ForwardIter __uninitialized_fill_n_aux (_ForwardIter __first, _Size __n, const _Tp &__x, __true_type )
template<class _ForwardIter, class _Size, class _Tp, class _Tp1> _ForwardIter __uninitialized_fill_n (_ForwardIter __first, _Size __n, const _Tp &__x, _Tp1 *)
template<class _ForwardIter, class _Size, class _Tp> _ForwardIter uninitialized_fill_n (_ForwardIter __first, _Size __n, const _Tp &__x)
template<class _InputIter1, class _InputIter2, class _ForwardIter> _ForwardIter __uninitialized_copy_copy (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _ForwardIter __result)
template<class _ForwardIter, class _Tp, class _InputIter> _ForwardIter __uninitialized_fill_copy (_ForwardIter __result, _ForwardIter __mid, const _Tp &__x, _InputIter __first, _InputIter __last)
template<class _InputIter, class _ForwardIter, class _Tp> void __uninitialized_copy_fill (_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2, const _Tp &__x)
template<class _Tp, class _Alloc> bool operator== (const vector < _Tp, _Alloc > &__x, const vector < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator< (const vector < _Tp, _Alloc > &__x, const vector < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> void swap (vector < _Tp, _Alloc > &__x, vector < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator!= (const vector < _Tp, _Alloc > &__x, const vector < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator> (const vector < _Tp, _Alloc > &__x, const vector < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator<= (const vector < _Tp, _Alloc > &__x, const vector < _Tp, _Alloc > &__y)
template<class _Tp, class _Alloc> bool operator>= (const vector < _Tp, _Alloc > &__x, const vector < _Tp, _Alloc > &__y)
void * __valarray_get_memory (size_t __n)
template<typename _Tp> _Tp *__restrict__ __valarray_get_storage (size_t __n)
void __valarray_release_memory (void *__p)
template<typename _Tp> void __valarray_default_construct (_Tp *__restrict__ __b, _Tp *__restrict__ __e)
template<typename _Tp> void __valarray_fill_construct (_Tp *__restrict__ __b, _Tp *__restrict__ __e, const _Tp __t)
template<typename _Tp> void __valarray_copy_construct (const _Tp *__restrict__ __b, const _Tp *__restrict__ __e, _Tp *__restrict__ __o)
template<typename _Tp> void __valarray_copy_construct (const _Tp *__restrict__ __a, size_t __n, size_t __s, _Tp *__restrict__ __o)
template<typename _Tp> void __valarray_copy_construct (const _Tp *__restrict__ __a, const size_t *__restrict__ __i, _Tp *__restrict__ __o, size_t __n)
template<typename _Tp> void __valarray_destroy_elements (_Tp *__restrict__ __b, _Tp *__restrict__ __e)
template<typename _Tp> void __valarray_fill (_Tp *__restrict__ __a, size_t __n, const _Tp &__t)
template<typename _Tp> void __valarray_fill (_Tp *__restrict__ __a, size_t __n, size_t __s, const _Tp &__t)
template<typename _Tp> void __valarray_fill (_Tp *__restrict__ __a, const size_t *__restrict__ __i, size_t __n, const _Tp &__t)
template<typename _Tp> void __valarray_copy (const _Tp *__restrict__ __a, size_t __n, _Tp *__restrict__ __b)
template<typename _Tp> void __valarray_copy (const _Tp *__restrict__ __a, size_t __n, size_t __s, _Tp *__restrict__ __b)
template<typename _Tp> void __valarray_copy (const _Tp *__restrict__ __a, _Tp *__restrict__ __b, size_t __n, size_t __s)
template<typename _Tp> void __valarray_copy (const _Tp *__restrict__ __a, const size_t *__restrict__ __i, _Tp *__restrict__ __b, size_t __n)
template<typename _Tp> void __valarray_copy (const _Tp *__restrict__ __a, size_t __n, _Tp *__restrict__ __b, const size_t *__restrict__ __i)
template<typename _Tp> _Tp __valarray_sum (const _Tp *__restrict__ __f, const _Tp *__restrict__ __l)
template<typename _Tp> _Tp __valarray_product (const _Tp *__restrict__ __f, const _Tp *__restrict__ __l)
template<typename _Ta> _Ta::value_type __valarray_min (const _Ta &__a)
template<typename _Ta> _Ta::value_type __valarray_max (const _Ta &__a)
template<typename _Tp> void __valarray_fill (_Array < _Tp > __a, size_t __n, const _Tp &__t)
template<typename _Tp> void __valarray_fill (_Array < _Tp > __a, size_t __n, size_t __s, const _Tp &__t)
template<typename _Tp> void __valarray_fill (_Array < _Tp > __a, _Array < size_t > __i, size_t __n, const _Tp &__t)
template<typename _Tp> void __valarray_copy (_Array < _Tp > __a, size_t __n, _Array < _Tp > __b)
template<typename _Tp> void __valarray_copy (_Array < _Tp > __a, size_t __n, size_t __s, _Array < _Tp > __b)
template<typename _Tp> void __valarray_copy (_Array < _Tp > __a, _Array < _Tp > __b, size_t __n, size_t __s)
template<typename _Tp> void __valarray_copy (_Array < _Tp > __a, _Array < size_t > __i, _Array < _Tp > __b, size_t __n)
template<typename _Tp> void __valarray_copy (_Array < _Tp > __a, size_t __n, _Array < _Tp > __b, _Array < size_t > __i)
template<typename _Tp> export void __valarray_fill (_Array < _Tp > __a, size_t __n, _Array < bool > __m, const _Tp &__t)
template<typename _Tp> export void __valarray_copy (_Array < _Tp > __a, _Array < bool > __m, _Array < _Tp > __b, size_t __n)
template<typename _Tp> export void __valarray_copy (_Array < _Tp > __a, size_t __n, _Array < _Tp > __b, _Array < bool > __m)
template<typename _Tp, class _Dom> export void __valarray_copy (const _Expr < _Dom, _Tp > &__e, size_t __n, _Array < _Tp > __a)
template<typename _Tp, class _Dom> export void __valarray_copy (const _Expr < _Dom, _Tp > &__e, size_t __n, _Array < _Tp > __a, size_t __s)
template<typename _Tp, class _Dom> export void __valarray_copy (const _Expr < _Dom, _Tp > &__e, size_t __n, _Array < _Tp > __a, _Array < size_t > __i)
template<typename _Tp, class _Dom> export void __valarray_copy (const _Expr < _Dom, _Tp > &__e, size_t __n, _Array < _Tp > __a, _Array < bool > __m)
template<typename _Tp, class _Dom> export void __valarray_copy_construct (const _Expr < _Dom, _Tp > &__e, size_t __n, _Array < _Tp > __a)
template<typename _Tp> export void __valarray_copy_construct (_Array < _Tp > __a, _Array < bool > __m, _Array < _Tp > __b, size_t __n)
template<typename _Tp> export _Tp __cmath_power (_Tp __x, unsigned int __n)
template<typename _Tp> _Tp __cmath_abs (_Tp __x)
float abs (float __x)
double abs (double __x)
long double abs (long double __x)
float acos (float __x)
long double acos (long double __x)
float asin (float __x)
long double asin (long double __x)
float atan (float __x)
long double atan (long double __x)
float atan2 (float __y, float __x)
long double atan2 (long double __y, long double __x)
float ceil (float __x)
long double ceil (long double __x)
float cos (float __x)
long double cos (long double __x)
float cosh (float __x)
long double cosh (long double __x)
float exp (float __x)
long double exp (long double __x)
float fabs (float __x)
long double fabs (long double __x)
float floor (float __x)
long double floor (long double __x)
float fmod (float __x, float __y)
long double fmod (long double __x, long double __y)
float frexp (float __x, int *__exp)
long double frexp (long double __x, int *__exp)
float ldexp (float __x, int __exp)
long double ldexp (long double __x, int __exp)
float log (float __x)
long double log (long double __x)
float log10 (float __x)
long double log10 (long double __x)
float modf (float __x, float *__iptr)
long double modf (long double __x, long double *__iptr)
template<typename _Tp> _Tp __pow_helper (_Tp __x, int __n)
float pow (float __x, float __y)
long double pow (long double __x, long double __y)
float pow (float __x, int __n)
double pow (double __x, int __i)
long double pow (long double __x, int __n)
float sin (float __x)
long double sin (long double __x)
float sinh (float __x)
long double sinh (long double __x)
float sqrt (float __x)
long double sqrt (long double __x)
float tan (float __x)
long double tan (long double __x)
float tanh (float __x)
long double tanh (long double __x)
ldiv_t div (long __i, long __j)
void * memchr (void *__p, int __c, size_t __n)
char * strchr (char *__s1, int __n)
char * strpbrk (char *__s1, const char *__s2)
char * strrchr (char *__s1, int __n)
char * strstr (char *__s1, const char *__s2)
template<class _CharT, class _Traits> void _Rope_fill (basic_ostream < _CharT, _Traits > &__o, size_t __n)
template<class _CharT> bool _Rope_is_simple (_CharT *)
bool _Rope_is_simple (char *)
bool _Rope_is_simple (wchar_t *)
template<class _CharT, class _Traits, class _Alloc> basic_ostream < _CharT, _Traits > & operator<< (basic_ostream < _CharT, _Traits > &__o, const rope < _CharT, _Alloc > &__r)
template<class _Rope_iterator> void _Rope_rotate (_Rope_iterator __first, _Rope_iterator __middle, _Rope_iterator __last)
void rotate (_Rope_iterator < char, __STL_DEFAULT_ALLOCATOR(char)> __first, _Rope_iterator < char, __STL_DEFAULT_ALLOCATOR(char)> __middle, _Rope_iterator < char, __STL_DEFAULT_ALLOCATOR(char)> __last)
size_t __stl_hash_string (const char *__s)
unsigned long __stl_next_prime (unsigned long __n)
template<class _Val, class _Key, class _HF, class _Ex, class _Eq, class _All> bool operator== (const hashtable < _Val, _Key, _HF, _Ex, _Eq, _All > &__ht1, const hashtable < _Val, _Key, _HF, _Ex, _Eq, _All > &__ht2)
template<class _Val, class _Key, class _HF, class _Ex, class _Eq, class _All> bool operator!= (const hashtable < _Val, _Key, _HF, _Ex, _Eq, _All > &__ht1, const hashtable < _Val, _Key, _HF, _Ex, _Eq, _All > &__ht2)
template<class _Val, class _Key, class _HF, class _Extract, class _EqKey, class _All> void swap (hashtable < _Val, _Key, _HF, _Extract, _EqKey, _All > &__ht1, hashtable < _Val, _Key, _HF, _Extract, _EqKey, _All > &__ht2)
template<class _CharT> _CharT _S_eos (_CharT *)
template<class _CharT> bool _S_is_basic_char_type (_CharT *)
template<class _CharT> bool _S_is_one_byte_char_type (_CharT *)
bool _S_is_basic_char_type (char *)
bool _S_is_one_byte_char_type (char *)
bool _S_is_basic_char_type (wchar_t *)
template<class _CharT> void _S_cond_store_eos (_CharT &)
void _S_cond_store_eos (char &__c)
void _S_cond_store_eos (wchar_t &__c)
template<class _CharT, class _Alloc> bool operator== (const _Rope_char_ptr_proxy < _CharT, _Alloc > &__x, const _Rope_char_ptr_proxy < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> _Rope_const_iterator < _CharT,
_Alloc > operator- (const _Rope_const_iterator < _CharT, _Alloc > &__x, ptrdiff_t __n)
template<class _CharT, class _Alloc> _Rope_const_iterator < _CharT,
_Alloc > operator+ (const _Rope_const_iterator < _CharT, _Alloc > &__x, ptrdiff_t __n)
template<class _CharT, class _Alloc> _Rope_const_iterator < _CharT,
_Alloc > operator+ (ptrdiff_t __n, const _Rope_const_iterator < _CharT, _Alloc > &__x)
template<class _CharT, class _Alloc> bool operator== (const _Rope_const_iterator < _CharT, _Alloc > &__x, const _Rope_const_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator< (const _Rope_const_iterator < _CharT, _Alloc > &__x, const _Rope_const_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> ptrdiff_t operator- (const _Rope_const_iterator < _CharT, _Alloc > &__x, const _Rope_const_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> _Rope_iterator < _CharT, _Alloc > operator- (const _Rope_iterator < _CharT, _Alloc > &__x, ptrdiff_t __n)
template<class _CharT, class _Alloc> _Rope_iterator < _CharT, _Alloc > operator+ (const _Rope_iterator < _CharT, _Alloc > &__x, ptrdiff_t __n)
template<class _CharT, class _Alloc> _Rope_iterator < _CharT, _Alloc > operator+ (ptrdiff_t __n, const _Rope_iterator < _CharT, _Alloc > &__x)
template<class _CharT, class _Alloc> bool operator== (const _Rope_iterator < _CharT, _Alloc > &__x, const _Rope_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator< (const _Rope_iterator < _CharT, _Alloc > &__x, const _Rope_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> ptrdiff_t operator- (const _Rope_iterator < _CharT, _Alloc > &__x, const _Rope_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> rope < _CharT, _Alloc > operator+ (const rope < _CharT, _Alloc > &__left, const rope < _CharT, _Alloc > &__right)
template<class _CharT, class _Alloc> rope < _CharT, _Alloc > operator+ (const rope < _CharT, _Alloc > &__left, const _CharT *__right)
template<class _CharT, class _Alloc> rope < _CharT, _Alloc > operator+ (const rope < _CharT, _Alloc > &__left, _CharT __right)
template<class _CharT, class _Alloc> rope < _CharT, _Alloc > identity_element (_Rope_Concat_fn < _CharT, _Alloc >)
template<class _CharT, class __Alloc> void swap (_Rope_char_ref_proxy < _CharT, __Alloc > __a, _Rope_char_ref_proxy < _CharT, __Alloc > __b)
template<class _CharT, class _Alloc> bool operator!= (const _Rope_const_iterator < _CharT, _Alloc > &__x, const _Rope_const_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator> (const _Rope_const_iterator < _CharT, _Alloc > &__x, const _Rope_const_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator<= (const _Rope_const_iterator < _CharT, _Alloc > &__x, const _Rope_const_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator>= (const _Rope_const_iterator < _CharT, _Alloc > &__x, const _Rope_const_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator!= (const _Rope_iterator < _CharT, _Alloc > &__x, const _Rope_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator> (const _Rope_iterator < _CharT, _Alloc > &__x, const _Rope_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator<= (const _Rope_iterator < _CharT, _Alloc > &__x, const _Rope_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator>= (const _Rope_iterator < _CharT, _Alloc > &__x, const _Rope_iterator < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> rope < _CharT, _Alloc > & operator+= (rope < _CharT, _Alloc > &__left, const rope < _CharT, _Alloc > &__right)
template<class _CharT, class _Alloc> rope < _CharT, _Alloc > & operator+= (rope < _CharT, _Alloc > &__left, const _CharT *__right)
template<class _CharT, class _Alloc> rope < _CharT, _Alloc > & operator+= (rope < _CharT, _Alloc > &__left, _CharT __right)
template<class _CharT, class _Alloc> bool operator< (const rope < _CharT, _Alloc > &__left, const rope < _CharT, _Alloc > &__right)
template<class _CharT, class _Alloc> bool operator== (const rope < _CharT, _Alloc > &__left, const rope < _CharT, _Alloc > &__right)
template<class _CharT, class _Alloc> bool operator!= (const rope < _CharT, _Alloc > &__x, const rope < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator> (const rope < _CharT, _Alloc > &__x, const rope < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator<= (const rope < _CharT, _Alloc > &__x, const rope < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator>= (const rope < _CharT, _Alloc > &__x, const rope < _CharT, _Alloc > &__y)
template<class _CharT, class _Alloc> bool operator!= (const _Rope_char_ptr_proxy < _CharT, _Alloc > &__x, const _Rope_char_ptr_proxy < _CharT, _Alloc > &__y)
crope::reference __mutable_reference_at (crope &__c, size_t __i)
wrope::reference __mutable_reference_at (wrope &__c, size_t __i)
template<class _CharT, class _Alloc> void swap (rope < _CharT, _Alloc > &__x, rope < _CharT, _Alloc > &__y)
template float __cmath_power< float > (float, unsigned int)
template double __cmath_power< double > (double, unsigned int)
template long double __cmath_power< long double > (long double, unsigned int)
template basic_istream < char,
char_traits < char > > & operator>> (basic_istream < char, char_traits < char > > &, complex < float > &)
template basic_ostream < char,
char_traits < char > > & operator<< (basic_ostream < char, char_traits < char > > &, const complex < float > &)
template basic_istream < char,
char_traits < char > > & operator>> (basic_istream < char, char_traits < char > > &, complex < double > &)
template basic_ostream < char,
char_traits < char > > & operator<< (basic_ostream < char, char_traits < char > > &, const complex < double > &)
template basic_istream < char,
char_traits < char > > & operator>> (basic_istream < char, char_traits < char > > &, complex < long double > &)
template basic_ostream < char,
char_traits < char > > & operator<< (basic_ostream < char, char_traits < char > > &, const complex < long double > &)
template const num_put < char,
obuf_iterator > & use_facet< num_put< char, obuf_iterator > > (const locale &)
template const num_get < char,
ibuf_iterator > & use_facet< num_get< char, ibuf_iterator > > (const locale &)
template const codecvt < char,
char, mbstate_t > & use_facet< codecvt< char, char, mbstate_t > > (const locale &)
template const numpunct < char > & use_facet< numpunct< char > > (const locale &)
template const collate < char > & use_facet< collate< char > > (const locale &)
template bool has_facet< numpunct< char > > (const locale &)
template bool has_facet< num_put< char > > (const locale &)
template bool has_facet< num_get< char > > (const locale &)
template bool has_facet< ctype< char > > (const locale &)
template istreambuf_iter __match_parallel< istreambuf_iter, char > (istreambuf_iter , istreambuf_iter , int, const string *, int *, int &, bool &)
template ostreambuf_iter __pad< char, ostreambuf_iter, output_iterator_tag > (ostreambuf_iter , char, int, output_iterator_tag )
template ostreambuf_iter __pad_numeric< char, ostreambuf_iter > (ostreambuf_iter , ios_base::fmtflags , char, int, char const *, char const *, char const *)
template char * __group_digits< char > (char *, char, char const *, char const *, char const *, char const *)
template ostreambuf_iter __output_integer< char, ostreambuf_iter, unsigned long > (ostreambuf_iter , ios_base &, char, bool, unsigned long)
template locale::facet ** fill_n< locale::facet **, size_t, locale::facet * > (locale::facet **, size_t, locale::facet *const &)
template __normal_iterator <
locale::facet **, vector <
locale::facet * > > fill_n (__normal_iterator < locale::facet **, vector < locale::facet * > >, size_t, locale::facet *const &)
template void fill (__normal_iterator < locale::facet **, vector < locale::facet * > >, __normal_iterator < locale::facet **, vector < locale::facet * > >, locale::facet *const &)
template istream & ws (istream &)
template istream & operator>> (istream &, char &)
template istream & operator>> (istream &, unsigned char &)
template istream & operator>> (istream &, signed char &)
template istream & operator>> (istream &, char *)
template istream & operator>> (istream &, unsigned char *)
template istream & operator>> (istream &, signed char *)
template ostream & endl (ostream &)
template ostream & ends (ostream &)
template ostream & flush (ostream &)
template ostream & operator<< (ostream &, char)
template ostream & operator<< (ostream &, unsigned char)
template ostream & operator<< (ostream &, signed char)
template ostream & operator<< (ostream &, const char *)
template ostream & operator<< (ostream &, const unsigned char *)
template ostream & operator<< (ostream &, const signed char *)
template basic_istream < char > & operator>> (basic_istream < char > &, string &)
template basic_ostream < char > & operator<< (basic_ostream < char > &, const string &)
template basic_istream < char > & getline (basic_istream < char > &, string &, char)
template basic_istream < char > & getline (basic_istream < char > &, string &)
template const char * find_if< const char *, char_match > (const char *, const char *, char_match , random_access_iterator_tag )
template string * __uninitialized_fill_n_aux< string *, size_t, string > (string *, size_t, string const &, _Bool < false >)
template void __pad_char (basic_ios < char > &, char *, const char *, const streamsize, const streamsize)
template ostreambuf_iterator <
char > __pad_numeric (ostreambuf_iterator < char >, _Ios_Fmtflags , char, int, const char *, const char *, const char *)
template ostreambuf_iterator <
char > __output_float (ostreambuf_iterator < char >, ios_base &, char, const char *, size_t)
template streamsize __copy_streambufs (basic_ios < char > &, basic_streambuf < char > *, basic_streambuf < char > *)
template S operator+ (const C *, const S &)
template S operator+ (C, const S &)
template bool operator== (const S::iterator &, const S::iterator &)
template bool operator== (const S::const_iterator &, const S::const_iterator &)
template void __destroy_aux< S * > (S *, S *, _Bool < false >)
template void __valarray_fill (size_t *__restrict__, size_t, const size_t &)
template void __valarray_copy (const size_t *__restrict__, size_t, size_t *__restrict__)
size_t __valarray_product (const valarray < size_t > &__a)
void __gslice_to_index (size_t __o, const valarray < size_t > &__l, const valarray < size_t > &__s, valarray < size_t > &__i)
terminate_handler set_terminate (terminate_handler ) throw ()
Takes a new handler function as an argument, returns the old function. More...
void terminate () __attribute__ ((__noreturn__))
unexpected_handler set_unexpected (unexpected_handler ) throw ()
Takes a new handler function as an argument, returns the old function. More...
void unexpected () __attribute__ ((__noreturn__))
bool uncaught_exception () throw ()
new_handler set_new_handler (new_handler )
Takes a replacement handler as the argument, returns the previous handler. More...
template<class _Key, class _Tp, class _HashFn, class _EqKey, class _Alloc> bool operator== (const hash_map < _Key, _Tp, _HashFn, _EqKey, _Alloc > &, const hash_map < _Key, _Tp, _HashFn, _EqKey, _Alloc > &)
template<class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc> bool operator== (const hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &__hm1, const hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &__hm2)
template<class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc> bool operator!= (const hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &__hm1, const hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &__hm2)
template<class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc> void swap (hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &__hm1, hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &__hm2)
template<class _Key, class _Tp, class _HF, class _EqKey, class _Alloc> bool operator== (const hash_multimap < _Key, _Tp, _HF, _EqKey, _Alloc > &__hm1, const hash_multimap < _Key, _Tp, _HF, _EqKey, _Alloc > &__hm2)
template<class _Key, class _Tp, class _HF, class _EqKey, class _Alloc> bool operator!= (const hash_multimap < _Key, _Tp, _HF, _EqKey, _Alloc > &__hm1, const hash_multimap < _Key, _Tp, _HF, _EqKey, _Alloc > &__hm2)
template<class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc> void swap (hash_multimap < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &__hm1, hash_multimap < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &__hm2)
template<class _Value, class _HashFcn, class _EqualKey, class _Alloc> bool operator== (const hash_set < _Value, _HashFcn, _EqualKey, _Alloc > &__hs1, const hash_set < _Value, _HashFcn, _EqualKey, _Alloc > &__hs2)
template<class _Value, class _HashFcn, class _EqualKey, class _Alloc> bool operator!= (const hash_set < _Value, _HashFcn, _EqualKey, _Alloc > &__hs1, const hash_set < _Value, _HashFcn, _EqualKey, _Alloc > &__hs2)
template<class _Val, class _HashFcn, class _EqualKey, class _Alloc> void swap (hash_set < _Val, _HashFcn, _EqualKey, _Alloc > &__hs1, hash_set < _Val, _HashFcn, _EqualKey, _Alloc > &__hs2)
template<class _Val, class _HashFcn, class _EqualKey, class _Alloc> bool operator== (const hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &__hs1, const hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &__hs2)
template<class _Val, class _HashFcn, class _EqualKey, class _Alloc> bool operator!= (const hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &__hs1, const hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &__hs2)
template<class _Val, class _HashFcn, class _EqualKey, class _Alloc> void swap (hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &__hs1, hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &__hs2)
_Slist_node_base * __slist_make_link (_Slist_node_base *__prev_node, _Slist_node_base *__new_node)
_Slist_node_base * __slist_previous (_Slist_node_base *__head, const _Slist_node_base *__node)
const _Slist_node_base * __slist_previous (const _Slist_node_base *__head, const _Slist_node_base *__node)
void __slist_splice_after (_Slist_node_base *__pos, _Slist_node_base *__before_first, _Slist_node_base *__before_last)
void __slist_splice_after (_Slist_node_base *__pos, _Slist_node_base *__head)
_Slist_node_base * __slist_reverse (_Slist_node_base *__node)
size_t __slist_size (_Slist_node_base *__node)
template<class _Tp, class _Alloc> bool operator== (const slist < _Tp, _Alloc > &_SL1, const slist < _Tp, _Alloc > &_SL2)
template<class _Tp, class _Alloc> bool operator< (const slist < _Tp, _Alloc > &_SL1, const slist < _Tp, _Alloc > &_SL2)
template<class _Tp, class _Alloc> bool operator!= (const slist < _Tp, _Alloc > &_SL1, const slist < _Tp, _Alloc > &_SL2)
template<class _Tp, class _Alloc> bool operator> (const slist < _Tp, _Alloc > &_SL1, const slist < _Tp, _Alloc > &_SL2)
template<class _Tp, class _Alloc> bool operator<= (const slist < _Tp, _Alloc > &_SL1, const slist < _Tp, _Alloc > &_SL2)
template<class _Tp, class _Alloc> bool operator>= (const slist < _Tp, _Alloc > &_SL1, const slist < _Tp, _Alloc > &_SL2)
template<class _Tp, class _Alloc> void swap (slist < _Tp, _Alloc > &__x, slist < _Tp, _Alloc > &__y)
Variables
const int _M_extract_buffer_length = 32
istream cin
ostream cout
ostream cerr
ostream clog
ios_base::Init __ioinit
const int __stl_threshold = 16
const int __stl_chunk_size = 7
void(* __malloc_alloc_template )()=0
const int __WORD_BIT = int(CHAR_BIT*sizeof(unsigned int))
const _Rb_tree_Color_type _S_rb_tree_red = false
const _Rb_tree_Color_type _S_rb_tree_black = true
const unsigned long __stl_prime_list [__stl_num_primes]
fake_filebuf buf_cout
fake_filebuf buf_cin
fake_filebuf buf_cerr
template class moneypunct< char, false >
template class moneypunct< char, true >
template class moneypunct_byname< char, false >
template class moneypunct_byname< char, true >
template class money_get< char, obuf_iterator >
template class money_put< char, obuf_iterator >
template class money_get< char, ibuf_iterator >
template class money_put< char, ibuf_iterator >
template class _Format_cache< char >
template class numpunct< char >
template class numpunct_byname< char >
template class num_get< char, ibuf_iterator >
template class num_put< char, obuf_iterator >
template class time_put< char, obuf_iterator >
template class time_put_byname< char, obuf_iterator >
template class time_get< char, ibuf_iterator >
template class time_get_byname< char, ibuf_iterator >
template class messages< char >
template class messages_byname< char >
template class __ctype_abstract_base< char >
template class ctype_byname< char >
template class __codecvt_abstract_base< char, char, mbstate_t >
template class __codecvt_abstract_base< wchar_t, char, mbstate_t >
template class codecvt_byname< char, char, mbstate_t >
template class collate< char >
template class collate_byname< char >
template class _Weekdaynames< char, int >
template class _Monthnames< char, int >
template class basic_streambuf< char >
template class basic_stringbuf< char >
template class basic_filebuf< char, char_traits< char > >
template class basic_ios< char >
template class basic_istream< char >
template class basic_ostream< char >
template class basic_iostream< char >
template class basic_ifstream< char >
template class basic_ofstream< char >
template class basic_istringstream< char >
template class basic_ostringstream< char >
template class __malloc_alloc_template< 0 >
template class __default_alloc_template< __NODE_ALLOCATOR_THREADS, 0 >
template class basic_string< C >
const nothrow_t nothrow = { }
Detailed Description
Everything defined by the ISO C++ Standard is within namespace std.Typedef Documentation
typedef char fake_filebuf [sizeof(filebuf ) std::__attribute__)((aligned(__alignof__(filebuf ))))
typedef bool std::_Rb_tree_Color_type
typedef rope <char> std::crope
typedef void(* std::new_handler)()
If you write your own error handler to be called by new
, it must be of this type.
Definition at line 60 of file new .
Referenced by operator new (), and set_new_handler ().
Definition at line 58 of file stringfwd.h .
Referenced by std::locale::_Impl::_Impl (), std::locale::_Impl::_M_replace_categories (), std::domain_error::domain_error (), std::invalid_argument::invalid_argument (), std::length_error::length_error (), std::logic_error::logic_error (), std::locale::name (), std::locale::operator== (), std::out_of_range::out_of_range (), std::overflow_error::overflow_error (), std::range_error::range_error (), std::runtime_error::runtime_error (), and std::underflow_error::underflow_error ().
typedef void(* std::terminate_handler)()
If you write a replacement terminate handler, it must be of this type.
Definition at line 69 of file exception .
typedef void(* std::unexpected_handler)()
If you write a replacement unexpected handler, it must be of this type.
Definition at line 71 of file exception .
typedef rope <wchar_t> std::wrope
Enumeration Type Documentation
enum std::float_denorm_style
Enumeration values:
denorm_indeterminate
denorm_absent
denorm_present
Definition at line 874 of file std_limits.h .
enum std::float_denorm_style
This enum signals whether a type has denormalization.
Enumeration values:
denorm_indeterminate
denorm_absent
denorm_present
Definition at line 67 of file limits_generic.h .
enum std::float_round_style
Enumeration values:
round_indeterminate
round_toward_zero
round_to_nearest
round_toward_infinity
round_toward_neg_infinity
Definition at line 865 of file std_limits.h .
enum std::float_round_style
Rounding style determines the behavior of floating-point calculations.
Enumeration values:
round_indeterminate
round_toward_zero
round_to_nearest
round_toward_infinity
round_toward_neg_infinity
Definition at line 58 of file limits_generic.h .
Function Documentation
template<class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOperation>
_OutputIterator __adjacent_difference
(
_InputIterator
__first ,
_InputIterator
__last ,
_OutputIterator
__result ,
_Tp *
,
_BinaryOperation
__binary_op
)
template<class _InputIterator, class _OutputIterator, class _Tp>
_OutputIterator __adjacent_difference
(
_InputIterator
__first ,
_InputIterator
__last ,
_OutputIterator
__result ,
_Tp *
)
template<class _RandomAccessIterator, class _Distance, class _Tp, class _Compare>
void __adjust_heap
(
_RandomAccessIterator
__first ,
_Distance
__holeIndex ,
_Distance
__len ,
_Tp
__value ,
_Compare
__comp
)
template<class _RandomAccessIterator, class _Distance, class _Tp>
void __adjust_heap
(
_RandomAccessIterator
__first ,
_Distance
__holeIndex ,
_Distance
__len ,
_Tp
__value
)
template<class _RandomAccessIterator, class _Distance>
void __advance
(
_RandomAccessIterator &
__i ,
_Distance
__n ,
random_access_iterator_tag
)
[inline]
template<class _BidirectionalIterator, class _Distance>
void __advance
(
_BidirectionalIterator &
__i ,
_Distance
__n ,
bidirectional_iterator_tag
)
[inline]
template<class _InputIter, class _Distance>
void __advance
(
_InputIter &
__i ,
_Distance
__n ,
input_iterator_tag
)
[inline]
bool std::__build_float_format
(
ios_base &
__io ,
char *
__fptr ,
char
__modifier ,
streamsize
__prec
)
template<class _RandomAccessIter, class _Distance, class _Compare>
void __chunk_insertion_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Distance
__chunk_size ,
_Compare
__comp
)
template<class _RandomAccessIter, class _Distance>
void __chunk_insertion_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Distance
__chunk_size
)
template<typename _Tp>
_Tp __cmath_abs
(
_Tp
__x
)
[inline]
template<typename _Tp>
_Tp std::__cmath_power
(
_Tp
__x ,
unsigned int
__n
)
template double __cmath_power< double >
(
double
,
unsigned
int
)
template float __cmath_power< float >
(
float
,
unsigned
int
)
template long double __cmath_power< long double >
(
long
double ,
unsigned
int
)
template<class _RandomAccessIter, class _OutputIter, class _Distance>
_OutputIter __copy
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_OutputIter
__result ,
random_access_iterator_tag
,
_Distance *
)
[inline]
template<class _InputIter, class _OutputIter, class _Distance>
_OutputIter __copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
input_iterator_tag
,
_Distance *
)
[inline]
template<class _InputIter, class _OutputIter, class _Tp>
_OutputIter __copy_aux
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
_Tp *
)
[inline]
template<class _Tp>
_Tp* __copy_aux2
(
const _Tp *
__first ,
const _Tp *
__last ,
_Tp *
__result ,
__true_type
)
[inline]
template<class _Tp>
_Tp* __copy_aux2
(
_Tp *
__first ,
_Tp *
__last ,
_Tp *
__result ,
__true_type
)
[inline]
template<class _InputIter, class _OutputIter>
_OutputIter std::__copy_aux2
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
__false_type
)
[inline]
template<class _RandomAccessIter, class _BidirectionalIter, class _Distance>
_BidirectionalIter __copy_backward
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_BidirectionalIter
__result ,
random_access_iterator_tag
,
_Distance *
)
[inline]
template<class _BidirectionalIter1, class _BidirectionalIter2, class _Distance>
_BidirectionalIter2 __copy_backward
(
_BidirectionalIter1
__first ,
_BidirectionalIter1
__last ,
_BidirectionalIter2
__result ,
bidirectional_iterator_tag
,
_Distance *
)
[inline]
template<class _BI1, class _BI2>
_BI2 __copy_backward_aux
(
_BI1
__first ,
_BI1
__last ,
_BI2
__result
)
[inline]
template<typename _BI1, typename _BI2>
_BI2 std::__copy_backward_input_normal_iterator
(
_BI1
__first ,
_BI1
__last ,
_BI2
__result ,
__true_type
)
[inline]
template<typename _BI1, typename _BI2>
_BI2 std::__copy_backward_output_normal_iterator
(
_BI1
__first ,
_BI1
__last ,
_BI2
__result ,
__true_type
)
[inline]
template<class _InputIter, class _Size, class _OutputIter>
pair <_InputIter, _OutputIter> __copy_n
(
_InputIter
__first ,
_Size
__count ,
_OutputIter
__result
)
[inline]
template<class _RAIter, class _Size, class _OutputIter>
pair <_RAIter, _OutputIter> __copy_n
(
_RAIter
__first ,
_Size
__count ,
_OutputIter
__result ,
random_access_iterator_tag
)
[inline]
template<class _InputIter, class _Size, class _OutputIter>
pair <_InputIter, _OutputIter> __copy_n
(
_InputIter
__first ,
_Size
__count ,
_OutputIter
__result ,
input_iterator_tag
)
template<typename _InputIter, typename _OutputIter>
_OutputIter std::__copy_ni1
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
__true_type
)
[inline]
template<typename _InputIter, typename _OutputIter>
_OutputIter std::__copy_ni2
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
__true_type
)
[inline]
template<typename _CharT, typename _Traits>
streamsize std::__copy_streambufs
(
basic_ios < _CharT, _Traits > &
_ios ,
basic_streambuf < _CharT, _Traits > *
__sbin ,
basic_streambuf < _CharT, _Traits > *
__sbout
)
Definition at line 191 of file streambuf.tcc .
References __throw_exception_again , std::basic_streambuf< _CharT, _Traits >::_M_in_cur_move (), std::basic_streambuf< _CharT, _Traits >::_M_mode , std::basic_ios< _CharT, _Traits >::exceptions (), std::basic_streambuf< _CharT, _Traits >::gptr (), std::basic_streambuf< _CharT, _Traits >::in_avail (), std::basic_streambuf< _CharT, _Traits >::sgetc (), and std::basic_streambuf< _CharT, _Traits >::sputn ().
Referenced by std::basic_istream< _CharT, _Traits >::operator>> ().
template<class _Tp>
_Tp* __copy_trivial
(
const _Tp *
__first ,
const _Tp *
__last ,
_Tp *
__result
)
[inline]
size_t __deque_buf_size
(
size_t
__size
)
[inline]
template<class _ForwardIterator, class _Tp>
void __destroy
(
_ForwardIterator
__first ,
_ForwardIterator
__last ,
_Tp *
)
[inline]
template<class _ForwardIterator>
void std::__destroy_aux
(
_ForwardIterator
__first ,
_ForwardIterator
__last ,
__false_type
)
[inline]
template void __destroy_aux< S * >
(
S *
,
S *
,
_Bool < false >
)
template<class _RandomAccessIterator>
iterator_traits <_RandomAccessIterator>::difference_type __distance
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
random_access_iterator_tag
)
[inline]
template<class _InputIterator>
iterator_traits <_InputIterator>::difference_type __distance
(
_InputIterator
__first ,
_InputIterator
__last ,
input_iterator_tag
)
[inline]
template<class _RandomAccessIterator, class _Distance>
void __distance
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Distance &
__n ,
random_access_iterator_tag
)
[inline]
template<class _InputIterator, class _Distance>
void __distance
(
_InputIterator
__first ,
_InputIterator
__last ,
_Distance &
__n ,
input_iterator_tag
)
[inline]
template<class _Iter>
iterator_traits <_Iter>::difference_type* __distance_type
(
const _Iter &
)
[inline]
Definition at line 182 of file stl_iterator_base_types.h .
Referenced by __copy_aux2 (), __partial_sort (), __pop_heap_aux (), distance_type (), equal_range (), inplace_merge (), lower_bound (), make_heap (), partial_sort_copy (), push_heap (), rotate (), stable_partition (), stable_sort (), and upper_bound ().
template<class _ForwardIter, class _Tp, class _Compare, class _Distance>
pair <_ForwardIter, _ForwardIter> __equal_range
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Compare
__comp ,
_Distance *
)
template<class _ForwardIter, class _Tp, class _Distance>
pair <_ForwardIter, _ForwardIter> __equal_range
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Distance *
)
template<class _RandomAccessIter, class _Compare>
void __final_insertion_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Compare
__comp
)
template<class _RandomAccessIter>
void __final_insertion_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last
)
template<class _BidirectionalIter1, class _BidirectionalIter2, class _BinaryPredicate>
_BidirectionalIter1 __find_end
(
_BidirectionalIter1
__first1 ,
_BidirectionalIter1
__last1 ,
_BidirectionalIter2
__first2 ,
_BidirectionalIter2
__last2 ,
bidirectional_iterator_tag
,
bidirectional_iterator_tag
,
_BinaryPredicate
__comp
)
template<class _BidirectionalIter1, class _BidirectionalIter2>
_BidirectionalIter1 __find_end
(
_BidirectionalIter1
__first1 ,
_BidirectionalIter1
__last1 ,
_BidirectionalIter2
__first2 ,
_BidirectionalIter2
__last2 ,
bidirectional_iterator_tag
,
bidirectional_iterator_tag
)
template<class _ForwardIter1, class _ForwardIter2, class _BinaryPredicate>
_ForwardIter1 __find_end
(
_ForwardIter1
__first1 ,
_ForwardIter1
__last1 ,
_ForwardIter2
__first2 ,
_ForwardIter2
__last2 ,
forward_iterator_tag
,
forward_iterator_tag
,
_BinaryPredicate
__comp
)
template<class _ForwardIter1, class _ForwardIter2>
_ForwardIter1 __find_end
(
_ForwardIter1
__first1 ,
_ForwardIter1
__last1 ,
_ForwardIter2
__first2 ,
_ForwardIter2
__last2 ,
forward_iterator_tag
,
forward_iterator_tag
)
template<class _EuclideanRingElement>
_EuclideanRingElement __gcd
(
_EuclideanRingElement
__m ,
_EuclideanRingElement
__n
)
template<class _Tp>
pair <_Tp*, ptrdiff_t> __get_temporary_buffer
(
ptrdiff_t
__len ,
_Tp *
)
template<typename _CharT>
_CharT* __group_digits
(
_CharT *
__s ,
_CharT
__grsep ,
char const *
__grouping ,
char const *
__grend ,
_CharT const *
__first ,
_CharT const *
__last
)
template char* __group_digits< char >
(
char *
,
char
,
char const *
,
char const *
,
char const *
,
char const *
)
void __gslice_to_index
(
size_t
__o ,
const valarray < size_t > &
__l ,
const valarray < size_t > &
__s ,
valarray < size_t > &
__i
)
template<class _BidirectionalIter, class _Tp, class _Distance, class _Compare>
void __inplace_merge_aux
(
_BidirectionalIter
__first ,
_BidirectionalIter
__middle ,
_BidirectionalIter
__last ,
_Tp *
,
_Distance *
,
_Compare
__comp
)
[inline]
template<class _BidirectionalIter, class _Tp, class _Distance>
void __inplace_merge_aux
(
_BidirectionalIter
__first ,
_BidirectionalIter
__middle ,
_BidirectionalIter
__last ,
_Tp *
,
_Distance *
)
[inline]
template<class _ForwardIter, class _Predicate, class _Distance>
_ForwardIter __inplace_stable_partition
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Predicate
__pred ,
_Distance
__len
)
template<class _RandomAccessIter, class _Compare>
void __inplace_stable_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Compare
__comp
)
template<class _RandomAccessIter>
void __inplace_stable_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last
)
template<class _RandomAccessIter, class _Compare>
void __insertion_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Compare
__comp
)
template<class _RandomAccessIter>
void __insertion_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last
)
template<class _RandomAccessIter, class _Tp, class _Size, class _Compare>
void __introsort_loop
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp *
,
_Size
__depth_limit ,
_Compare
__comp
)
template<class _RandomAccessIter, class _Tp, class _Size>
void __introsort_loop
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp *
,
_Size
__depth_limit
)
template<class _RandomAccessIter, class _Distance, class _StrictWeakOrdering>
bool __is_heap
(
_RandomAccessIter
__first ,
_StrictWeakOrdering
__comp ,
_Distance
__n
)
template<class _RandomAccessIter, class _Distance>
bool __is_heap
(
_RandomAccessIter
__first ,
_Distance
__n
)
template<class _ForwardIter1, class _ForwardIter2, class _Tp>
void __iter_swap
(
_ForwardIter1
__a ,
_ForwardIter2
__b ,
_Tp *
)
[inline]
template<class _Iter>
iterator_traits <_Iter>::iterator_category __iterator_category
(
const _Iter &
)
[inline]
Definition at line 174 of file stl_iterator_base_types.h .
Referenced by __copy_aux2 (), __copy_n (), __uninitialized_copy_n (), std::vector< _Node *, _Alloc >::_M_assign_dispatch (), std::deque< _Tp, _Alloc >::_M_assign_dispatch (), std::vector< bool, _Alloc >::_M_assign_dispatch (), std::vector< _Node *, _Alloc >::_M_initialize_aux (), std::deque< _Tp, _Alloc >::_M_initialize_dispatch (), std::vector< bool, _Alloc >::_M_initialize_dispatch (), std::vector< _Node *, _Alloc >::_M_insert_dispatch (), std::deque< _Tp, _Alloc >::_M_insert_dispatch (), std::vector< bool, _Alloc >::_M_insert_dispatch (), find (), find_end (), find_if (), std::hashtable< _Value, _Value, _HashFcn, _Identity< _Value >, _EqualKey, _Alloc >::insert_equal (), std::hashtable< _Value, _Value, _HashFcn, _Identity< _Value >, _EqualKey, _Alloc >::insert_unique (), iterator_category (), partition (), reverse (), rotate (), uninitialized_copy_n (), and unique_copy ().
int __lexicographical_compare_3way
(
const char *
__first1 ,
const char *
__last1 ,
const char *
__first2 ,
const char *
__last2
)
[inline]
int __lexicographical_compare_3way
(
const unsigned char *
__first1 ,
const unsigned char *
__last1 ,
const unsigned char *
__first2 ,
const unsigned char *
__last2
)
[inline]
template<class _InputIter1, class _InputIter2>
int __lexicographical_compare_3way
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2
)
template<class _Size>
_Size __lg
(
_Size
__n
)
[inline]
template<typename _T>
_T __limits_denorm_min
(
)
template<typename _T>
_T __limits_infinity
(
)
template<typename _T>
_T __limits_quiet_NaN
(
)
template<typename _T>
_T __limits_signaling_NaN
(
)
template<class _RandomAccessIter, class _Tp, class _Compare>
void __linear_insert
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp *
,
_Compare
__comp
)
[inline]
template<class _RandomAccessIter, class _Tp>
void __linear_insert
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp *
)
[inline]
template<class _ForwardIter, class _Tp, class _Compare, class _Distance>
_ForwardIter __lower_bound
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Compare
__comp ,
_Distance *
)
template<class _ForwardIter, class _Tp, class _Distance>
_ForwardIter __lower_bound
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Distance *
)
template<class _RandomAccessIterator, class _Compare, class _Tp, class _Distance>
void __make_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Compare
__comp ,
_Tp *
,
_Distance *
)
template<class _RandomAccessIterator, class _Tp, class _Distance>
void __make_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Tp *
,
_Distance *
)
template<typename _InIter, typename _CharT>
_InIter __match_parallel
(
_InIter
__s ,
_InIter
__end ,
int
__ntargs ,
const basic_string < _CharT > *
__targets ,
int *
__matches ,
int &
__remain ,
bool &
__eof
)
template<class _Tp, class _Compare>
const _Tp& __median
(
const _Tp &
__a ,
const _Tp &
__b ,
const _Tp &
__c ,
_Compare
__comp
)
[inline]
template<class _Tp>
const _Tp& __median
(
const _Tp &
__a ,
const _Tp &
__b ,
const _Tp &
__c
)
[inline]
template<class _BidirectionalIter, class _Distance, class _Pointer, class _Compare>
void __merge_adaptive
(
_BidirectionalIter
__first ,
_BidirectionalIter
__middle ,
_BidirectionalIter
__last ,
_Distance
__len1 ,
_Distance
__len2 ,
_Pointer
__buffer ,
_Distance
__buffer_size ,
_Compare
__comp
)
template<class _BidirectionalIter, class _Distance, class _Pointer>
void __merge_adaptive
(
_BidirectionalIter
__first ,
_BidirectionalIter
__middle ,
_BidirectionalIter
__last ,
_Distance
__len1 ,
_Distance
__len2 ,
_Pointer
__buffer ,
_Distance
__buffer_size
)
template<class _BidirectionalIter1, class _BidirectionalIter2, class _BidirectionalIter3, class _Compare>
_BidirectionalIter3 __merge_backward
(
_BidirectionalIter1
__first1 ,
_BidirectionalIter1
__last1 ,
_BidirectionalIter2
__first2 ,
_BidirectionalIter2
__last2 ,
_BidirectionalIter3
__result ,
_Compare
__comp
)
template<class _BidirectionalIter1, class _BidirectionalIter2, class _BidirectionalIter3>
_BidirectionalIter3 __merge_backward
(
_BidirectionalIter1
__first1 ,
_BidirectionalIter1
__last1 ,
_BidirectionalIter2
__first2 ,
_BidirectionalIter2
__last2 ,
_BidirectionalIter3
__result
)
template<class _RandomAccessIter1, class _RandomAccessIter2, class _Distance, class _Compare>
void __merge_sort_loop
(
_RandomAccessIter1
__first ,
_RandomAccessIter1
__last ,
_RandomAccessIter2
__result ,
_Distance
__step_size ,
_Compare
__comp
)
template<class _RandomAccessIter1, class _RandomAccessIter2, class _Distance>
void __merge_sort_loop
(
_RandomAccessIter1
__first ,
_RandomAccessIter1
__last ,
_RandomAccessIter2
__result ,
_Distance
__step_size
)
template<class _RandomAccessIter, class _Pointer, class _Distance, class _Compare>
void __merge_sort_with_buffer
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Pointer
__buffer ,
_Distance *
,
_Compare
__comp
)
template<class _RandomAccessIter, class _Pointer, class _Distance>
void __merge_sort_with_buffer
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Pointer
__buffer ,
_Distance *
)
template<class _BidirectionalIter, class _Distance, class _Compare>
void __merge_without_buffer
(
_BidirectionalIter
__first ,
_BidirectionalIter
__middle ,
_BidirectionalIter
__last ,
_Distance
__len1 ,
_Distance
__len2 ,
_Compare
__comp
)
template<class _BidirectionalIter, class _Distance>
void __merge_without_buffer
(
_BidirectionalIter
__first ,
_BidirectionalIter
__middle ,
_BidirectionalIter
__last ,
_Distance
__len1 ,
_Distance
__len2
)
wrope::reference __mutable_reference_at
(
wrope &
__c ,
size_t
__i
)
[inline]
crope::reference __mutable_reference_at
(
crope &
__c ,
size_t
__i
)
[inline]
template<class _RandomAccessIter, class _Tp, class _Compare>
void __nth_element
(
_RandomAccessIter
__first ,
_RandomAccessIter
__nth ,
_RandomAccessIter
__last ,
_Tp *
,
_Compare
__comp
)
template<class _RandomAccessIter, class _Tp>
void __nth_element
(
_RandomAccessIter
__first ,
_RandomAccessIter
__nth ,
_RandomAccessIter
__last ,
_Tp *
)
template<typename _CharT, typename _Traits, typename _OutIter>
_OutIter __output_float
(
_OutIter
__s ,
ios_base &
__io ,
_CharT
__fill ,
const char *
__sptr ,
size_t
__slen
)
template<typename _CharT, typename _OutIter, typename _ValueT>
_OutIter __output_integer
(
_OutIter
__s ,
ios_base &
__io ,
_CharT
__fill ,
bool
__neg ,
_ValueT
__v
)
Definition at line 852 of file locale_facets.tcc .
References __group_digits (), __pad_numeric (), std::_Format_cache< _CharT >::_M_grouping , std::_Format_cache< _CharT >::_M_thousands_sep , std::_Format_cache< _CharT >::_M_use_grouping , std::_Format_cache< _CharT >::_S_digits , std::_Format_cache< _CharT >::_S_literals , std::_Format_cache< _CharT >::_S_plus , std::_Format_cache< _CharT >::_S_x , std::ios_base::basefield , copy (), std::basic_string< char >::data (), std::ios_base::flags (), std::basic_string< char >::size (), and std::ios_base::width ().
Referenced by std::num_put< _CharT, _OutIter >::do_put ().
template<typename _CharT, typename _OutIter, typename _Tag>
_OutIter __pad
(
_OutIter
__s ,
_CharT
__fill ,
int
__padding ,
_Tag
)
template<typename _CharT, typename _RaIter>
_RaIter __pad
(
_RaIter
__s ,
_CharT
__fill ,
int
__padding ,
random_access_iterator_tag
)
template<typename _CharT, typename _OutIter>
_OutIter std::__pad
(
_OutIter
__s ,
_CharT
__fill ,
int
__padding
)
[inline]
template void __pad_char
(
basic_ios < char > &
,
char *
,
const char *
,
const
streamsize ,
const
streamsize
)
template<typename _CharT, typename _OutIter>
_OutIter __pad_numeric
(
_OutIter
__s ,
ios_base::fmtflags
,
_CharT
,
int
,
_CharT const *
,
_CharT const *
,
_CharT const *
)
template<class _RandomAccessIter, class _Tp, class _Compare>
void __partial_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__middle ,
_RandomAccessIter
__last ,
_Tp *
,
_Compare
__comp
)
template<class _RandomAccessIter, class _Tp>
void __partial_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__middle ,
_RandomAccessIter
__last ,
_Tp *
)
template<class _InputIter, class _RandomAccessIter, class _Compare, class _Distance, class _Tp>
_RandomAccessIter __partial_sort_copy
(
_InputIter
__first ,
_InputIter
__last ,
_RandomAccessIter
__result_first ,
_RandomAccessIter
__result_last ,
_Compare
__comp ,
_Distance *
,
_Tp *
)
template<class _InputIter, class _RandomAccessIter, class _Distance, class _Tp>
_RandomAccessIter __partial_sort_copy
(
_InputIter
__first ,
_InputIter
__last ,
_RandomAccessIter
__result_first ,
_RandomAccessIter
__result_last ,
_Distance *
,
_Tp *
)
template<class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOperation>
_OutputIterator __partial_sum
(
_InputIterator
__first ,
_InputIterator
__last ,
_OutputIterator
__result ,
_Tp *
,
_BinaryOperation
__binary_op
)
template<class _InputIterator, class _OutputIterator, class _Tp>
_OutputIterator __partial_sum
(
_InputIterator
__first ,
_InputIterator
__last ,
_OutputIterator
__result ,
_Tp *
)
template<class _BidirectionalIter, class _Predicate>
_BidirectionalIter __partition
(
_BidirectionalIter
__first ,
_BidirectionalIter
__last ,
_Predicate
__pred ,
bidirectional_iterator_tag
)
template<class _ForwardIter, class _Predicate>
_ForwardIter __partition
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Predicate
__pred ,
forward_iterator_tag
)
template<class _RandomAccessIterator, class _Tp, class _Compare, class _Distance>
void __pop_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_RandomAccessIterator
__result ,
_Tp
__value ,
_Compare
__comp ,
_Distance *
)
[inline]
template<class _RandomAccessIterator, class _Tp, class _Distance>
void __pop_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_RandomAccessIterator
__result ,
_Tp
__value ,
_Distance *
)
[inline]
template<class _RandomAccessIterator, class _Tp, class _Compare>
void __pop_heap_aux
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Tp *
,
_Compare
__comp
)
[inline]
template<class _RandomAccessIterator, class _Tp>
void __pop_heap_aux
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Tp *
)
[inline]
template<typename _Tp>
_Tp __pow_helper
(
_Tp
__x ,
int
__n
)
[inline]
template<class _Tp, class _Integer>
_Tp __power
(
_Tp
__x ,
_Integer
__n
)
[inline]
template<class _Tp, class _Integer, class _MonoidOperation>
_Tp __power
(
_Tp
__x ,
_Integer
__n ,
_MonoidOperation
__monoid_op
)
template<class _RandomAccessIterator, class _Distance, class _Tp, class _Compare>
void __push_heap
(
_RandomAccessIterator
__first ,
_Distance
__holeIndex ,
_Distance
__topIndex ,
_Tp
__value ,
_Compare
__comp
)
template<class _RandomAccessIterator, class _Distance, class _Tp>
void __push_heap
(
_RandomAccessIterator
__first ,
_Distance
__holeIndex ,
_Distance
__topIndex ,
_Tp
__value
)
template<class _RandomAccessIterator, class _Compare, class _Distance, class _Tp>
void __push_heap_aux
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Compare
__comp ,
_Distance *
,
_Tp *
)
[inline]
template<class _RandomAccessIterator, class _Distance, class _Tp>
void __push_heap_aux
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Distance *
,
_Tp *
)
[inline]
template<class _Distance>
_Distance __random_number
(
_Distance
__n
)
[inline]
template<class _InputIter, class _RandomAccessIter, class _RandomNumberGenerator, class _Distance>
_RandomAccessIter __random_sample
(
_InputIter
__first ,
_InputIter
__last ,
_RandomAccessIter
__out ,
_RandomNumberGenerator &
__rand ,
const _Distance
__n
)
template<class _InputIter, class _RandomAccessIter, class _Distance>
_RandomAccessIter __random_sample
(
_InputIter
__first ,
_InputIter
__last ,
_RandomAccessIter
__out ,
const _Distance
__n
)
template<class _RandomAccessIter>
void __reverse
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
random_access_iterator_tag
)
template<class _BidirectionalIter>
void __reverse
(
_BidirectionalIter
__first ,
_BidirectionalIter
__last ,
bidirectional_iterator_tag
)
template<class _RandomAccessIter, class _Distance, class _Tp>
_RandomAccessIter __rotate
(
_RandomAccessIter
__first ,
_RandomAccessIter
__middle ,
_RandomAccessIter
__last ,
_Distance *
,
_Tp *
)
template<class _BidirectionalIter, class _Distance>
_BidirectionalIter __rotate
(
_BidirectionalIter
__first ,
_BidirectionalIter
__middle ,
_BidirectionalIter
__last ,
_Distance *
,
bidirectional_iterator_tag
)
template<class _ForwardIter, class _Distance>
_ForwardIter __rotate
(
_ForwardIter
__first ,
_ForwardIter
__middle ,
_ForwardIter
__last ,
_Distance *
,
forward_iterator_tag
)
template<class _BidirectionalIter1, class _BidirectionalIter2, class _Distance>
_BidirectionalIter1 __rotate_adaptive
(
_BidirectionalIter1
__first ,
_BidirectionalIter1
__middle ,
_BidirectionalIter1
__last ,
_Distance
__len1 ,
_Distance
__len2 ,
_BidirectionalIter2
__buffer ,
_Distance
__buffer_size
)
template<class _ForwardIter, class _Pointer, class _Predicate, class _Distance>
_ForwardIter __stable_partition_adaptive
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Predicate
__pred ,
_Distance
__len ,
_Pointer
__buffer ,
_Distance
__buffer_size
)
template<class _ForwardIter, class _Predicate, class _Tp, class _Distance>
_ForwardIter __stable_partition_aux
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Predicate
__pred ,
_Tp *
,
_Distance *
)
[inline]
template<class _RandomAccessIter, class _Pointer, class _Distance, class _Compare>
void __stable_sort_adaptive
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Pointer
__buffer ,
_Distance
__buffer_size ,
_Compare
__comp
)
template<class _RandomAccessIter, class _Pointer, class _Distance>
void __stable_sort_adaptive
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Pointer
__buffer ,
_Distance
__buffer_size
)
template<class _RandomAccessIter, class _Tp, class _Distance, class _Compare>
void __stable_sort_aux
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp *
,
_Distance *
,
_Compare
__comp
)
[inline]
template<class _RandomAccessIter, class _Tp, class _Distance>
void __stable_sort_aux
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp *
,
_Distance *
)
[inline]
size_t __stl_hash_string
(
const char *
__s
)
[inline]
unsigned long __stl_next_prime
(
unsigned long
__n
)
[inline]
void std::__throw_bad_alloc
(
void
)
void std::__throw_bad_cast
(
void
)
void std::__throw_bad_exception
(
void
)
void std::__throw_bad_typeid
(
void
)
void std::__throw_domain_error
(
const char *
__s
)
void std::__throw_invalid_argument
(
const char *
__s
)
void std::__throw_ios_failure
(
const char *
__s
)
void std::__throw_length_error
(
const char *
__s
)
Definition at line 125 of file functexcept.cc .
References abort ().
Referenced by std::basic_string< _CharT, _Traits, _Alloc >::_M_replace (), std::basic_string< _CharT, _Traits, _Alloc >::_Rep::_S_create (), std::basic_string< _CharT, _Traits, _Alloc >::replace (), std::basic_string< _CharT, _Traits, _Alloc >::reserve (), and std::basic_string< _CharT, _Traits, _Alloc >::resize ().
void std::__throw_logic_error
(
const char *
__s
)
void std::__throw_out_of_range
(
const char *
__s
)
Definition at line 129 of file functexcept.cc .
References abort ().
Referenced by std::basic_string< char >::_M_check (), std::vector< _Node *, _Alloc >::_M_range_check (), std::basic_string< char >::at (), std::basic_string< _CharT, _Traits, _Alloc >::compare (), std::basic_string< _CharT, _Traits, _Alloc >::copy (), and std::basic_string< char >::substr ().
void std::__throw_overflow_error
(
const char *
__s
)
void std::__throw_range_error
(
const char *
__s
)
void std::__throw_runtime_error
(
const char *
__s
)
void std::__throw_underflow_error
(
const char *
__s
)
template<class _RandomAccessIter, class _Compare>
void __unguarded_insertion_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Compare
__comp
)
[inline]
template<class _RandomAccessIter>
void __unguarded_insertion_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last
)
[inline]
template<class _RandomAccessIter, class _Tp, class _Compare>
void __unguarded_insertion_sort_aux
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp *
,
_Compare
__comp
)
template<class _RandomAccessIter, class _Tp>
void __unguarded_insertion_sort_aux
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp *
)
template<class _RandomAccessIter, class _Tp, class _Compare>
void __unguarded_linear_insert
(
_RandomAccessIter
__last ,
_Tp
__val ,
_Compare
__comp
)
template<class _RandomAccessIter, class _Tp>
void __unguarded_linear_insert
(
_RandomAccessIter
__last ,
_Tp
__val
)
template<class _RandomAccessIter, class _Tp, class _Compare>
_RandomAccessIter __unguarded_partition
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp
__pivot ,
_Compare
__comp
)
template<class _RandomAccessIter, class _Tp>
_RandomAccessIter __unguarded_partition
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Tp
__pivot
)
template<class _InputIter, class _ForwardIter, class _Tp>
_ForwardIter __uninitialized_copy
(
_InputIter
__first ,
_InputIter
__last ,
_ForwardIter
__result ,
_Tp *
)
[inline]
template<class _InputIter, class _ForwardIter>
_ForwardIter std::__uninitialized_copy_aux
(
_InputIter
__first ,
_InputIter
__last ,
_ForwardIter
__result ,
__true_type
)
[inline]
template<class _InputIter1, class _InputIter2, class _ForwardIter>
_ForwardIter __uninitialized_copy_copy
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_ForwardIter
__result
)
[inline]
template<class _InputIter, class _ForwardIter, class _Tp>
void __uninitialized_copy_fill
(
_InputIter
__first1 ,
_InputIter
__last1 ,
_ForwardIter
__first2 ,
_ForwardIter
__last2 ,
const _Tp &
__x
)
[inline]
template<class _InputIter, class _Size, class _ForwardIter>
pair <_InputIter, _ForwardIter> __uninitialized_copy_n
(
_InputIter
__first ,
_Size
__count ,
_ForwardIter
__result
)
[inline]
template<class _RandomAccessIter, class _Size, class _ForwardIter>
pair <_RandomAccessIter, _ForwardIter> __uninitialized_copy_n
(
_RandomAccessIter
__first ,
_Size
__count ,
_ForwardIter
__result ,
random_access_iterator_tag
)
[inline]
template<class _InputIter, class _Size, class _ForwardIter>
pair <_InputIter, _ForwardIter> __uninitialized_copy_n
(
_InputIter
__first ,
_Size
__count ,
_ForwardIter
__result ,
input_iterator_tag
)
template<class _ForwardIter, class _Tp, class _Tp1>
void __uninitialized_fill
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__x ,
_Tp1 *
)
[inline]
template<class _ForwardIter, class _Tp>
void std::__uninitialized_fill_aux
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__x ,
__true_type
)
[inline]
template<class _ForwardIter, class _Tp, class _InputIter>
_ForwardIter __uninitialized_fill_copy
(
_ForwardIter
__result ,
_ForwardIter
__mid ,
const _Tp &
__x ,
_InputIter
__first ,
_InputIter
__last
)
[inline]
template<class _ForwardIter, class _Size, class _Tp, class _Tp1>
_ForwardIter __uninitialized_fill_n
(
_ForwardIter
__first ,
_Size
__n ,
const _Tp &
__x ,
_Tp1 *
)
[inline]
template<class _ForwardIter, class _Size, class _Tp>
_ForwardIter std::__uninitialized_fill_n_aux
(
_ForwardIter
__first ,
_Size
__n ,
const _Tp &
__x ,
__true_type
)
[inline]
template<class _InputIter, class _ForwardIter, class _BinaryPredicate>
_ForwardIter __unique_copy
(
_InputIter
__first ,
_InputIter
__last ,
_ForwardIter
__result ,
_BinaryPredicate
__binary_pred ,
forward_iterator_tag
)
template<class _InputIter, class _OutputIter, class _BinaryPredicate>
_OutputIter __unique_copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
_BinaryPredicate
__binary_pred ,
output_iterator_tag
)
[inline]
template<class _InputIter, class _OutputIter, class _BinaryPredicate, class _Tp>
_OutputIter __unique_copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
_BinaryPredicate
__binary_pred ,
_Tp *
)
template<class _InputIter, class _ForwardIter>
_ForwardIter __unique_copy
(
_InputIter
__first ,
_InputIter
__last ,
_ForwardIter
__result ,
forward_iterator_tag
)
template<class _InputIter, class _OutputIter>
_OutputIter __unique_copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
output_iterator_tag
)
[inline]
template<class _InputIter, class _OutputIter, class _Tp>
_OutputIter __unique_copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
_Tp *
)
template<class _ForwardIter, class _Tp, class _Compare, class _Distance>
_ForwardIter __upper_bound
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Compare
__comp ,
_Distance *
)
template<class _ForwardIter, class _Tp, class _Distance>
_ForwardIter __upper_bound
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Distance *
)
template void __valarray_copy
(
const size_t *
__restrict__ ,
size_t
,
size_t *
__restrict__
)
template<typename _Tp, class _Dom>
export void __valarray_copy
(
const _Expr < _Dom, _Tp > &
__e ,
size_t
__n ,
_Array < _Tp >
__a ,
_Array < bool >
__m
)
template<typename _Tp, class _Dom>
export void __valarray_copy
(
const _Expr < _Dom, _Tp > &
__e ,
size_t
__n ,
_Array < _Tp >
__a ,
_Array < size_t >
__i
)
template<typename _Tp, class _Dom>
export void __valarray_copy
(
const _Expr < _Dom, _Tp > &
__e ,
size_t
__n ,
_Array < _Tp >
__a ,
size_t
__s
)
template<typename _Tp, class _Dom>
export void __valarray_copy
(
const _Expr < _Dom, _Tp > &
__e ,
size_t
__n ,
_Array < _Tp >
__a
)
template<typename _Tp>
export void __valarray_copy
(
_Array < _Tp >
__a ,
size_t
__n ,
_Array < _Tp >
__b ,
_Array < bool >
__m
)
template<typename _Tp>
export void __valarray_copy
(
_Array < _Tp >
__a ,
_Array < bool >
__m ,
_Array < _Tp >
__b ,
size_t
__n
)
template<typename _Tp>
void __valarray_copy
(
_Array < _Tp >
__a ,
size_t
__n ,
_Array < _Tp >
__b ,
_Array < size_t >
__i
)
[inline]
template<typename _Tp>
void __valarray_copy
(
_Array < _Tp >
__a ,
_Array < size_t >
__i ,
_Array < _Tp >
__b ,
size_t
__n
)
[inline]
template<typename _Tp>
void __valarray_copy
(
_Array < _Tp >
__a ,
_Array < _Tp >
__b ,
size_t
__n ,
size_t
__s
)
[inline]
template<typename _Tp>
void __valarray_copy
(
_Array < _Tp >
__a ,
size_t
__n ,
size_t
__s ,
_Array < _Tp >
__b
)
[inline]
template<typename _Tp>
void __valarray_copy
(
_Array < _Tp >
__a ,
size_t
__n ,
_Array < _Tp >
__b
)
[inline]
template<typename _Tp>
void __valarray_copy
(
const _Tp *__restrict__
__a ,
size_t
__n ,
_Tp *__restrict__
__b ,
const size_t *__restrict__
__i
)
[inline]
template<typename _Tp>
void __valarray_copy
(
const _Tp *__restrict__
__a ,
const size_t *__restrict__
__i ,
_Tp *__restrict__
__b ,
size_t
__n
)
[inline]
template<typename _Tp>
void __valarray_copy
(
const _Tp *__restrict__
__a ,
_Tp *__restrict__
__b ,
size_t
__n ,
size_t
__s
)
[inline]
template<typename _Tp>
void __valarray_copy
(
const _Tp *__restrict__
__a ,
size_t
__n ,
size_t
__s ,
_Tp *__restrict__
__b
)
[inline]
template<typename _Tp>
void __valarray_copy
(
const _Tp *__restrict__
__a ,
size_t
__n ,
_Tp *__restrict__
__b
)
[inline]
template<typename _Tp>
export void __valarray_copy_construct
(
_Array < _Tp >
__a ,
_Array < bool >
__m ,
_Array < _Tp >
__b ,
size_t
__n
)
template<typename _Tp, class _Dom>
export void __valarray_copy_construct
(
const _Expr < _Dom, _Tp > &
__e ,
size_t
__n ,
_Array < _Tp >
__a
)
template<typename _Tp>
void __valarray_copy_construct
(
const _Tp *__restrict__
__a ,
const size_t *__restrict__
__i ,
_Tp *__restrict__
__o ,
size_t
__n
)
[inline]
template<typename _Tp>
void __valarray_copy_construct
(
const _Tp *__restrict__
__a ,
size_t
__n ,
size_t
__s ,
_Tp *__restrict__
__o
)
[inline]
template<typename _Tp>
void __valarray_copy_construct
(
const _Tp *__restrict__
__b ,
const _Tp *__restrict__
__e ,
_Tp *__restrict__
__o
)
[inline]
template<typename _Tp>
void __valarray_default_construct
(
_Tp *__restrict__
__b ,
_Tp *__restrict__
__e
)
[inline]
template<typename _Tp>
void __valarray_destroy_elements
(
_Tp *__restrict__
__b ,
_Tp *__restrict__
__e
)
[inline]
template void __valarray_fill
(
size_t *
__restrict__ ,
size_t
,
const size_t &
)
template<typename _Tp>
export void __valarray_fill
(
_Array < _Tp >
__a ,
size_t
__n ,
_Array < bool >
__m ,
const _Tp &
__t
)
template<typename _Tp>
void __valarray_fill
(
_Array < _Tp >
__a ,
_Array < size_t >
__i ,
size_t
__n ,
const _Tp &
__t
)
[inline]
template<typename _Tp>
void __valarray_fill
(
_Array < _Tp >
__a ,
size_t
__n ,
size_t
__s ,
const _Tp &
__t
)
[inline]
template<typename _Tp>
void __valarray_fill
(
_Array < _Tp >
__a ,
size_t
__n ,
const _Tp &
__t
)
[inline]
template<typename _Tp>
void __valarray_fill
(
_Tp *__restrict__
__a ,
const size_t *__restrict__
__i ,
size_t
__n ,
const _Tp &
__t
)
[inline]
template<typename _Tp>
void __valarray_fill
(
_Tp *__restrict__
__a ,
size_t
__n ,
size_t
__s ,
const _Tp &
__t
)
[inline]
template<typename _Tp>
void __valarray_fill
(
_Tp *__restrict__
__a ,
size_t
__n ,
const _Tp &
__t
)
template<typename _Tp>
void __valarray_fill_construct
(
_Tp *__restrict__
__b ,
_Tp *__restrict__
__e ,
const _Tp
__t
)
[inline]
void* __valarray_get_memory
(
size_t
__n
)
[inline]
template<typename _Tp>
_Tp* __restrict__ __valarray_get_storage
(
size_t
__n
)
[inline]
template<typename _Ta>
_Ta::value_type __valarray_max
(
const _Ta &
__a
)
[inline]
template<typename _Ta>
_Ta::value_type __valarray_min
(
const _Ta &
__a
)
[inline]
size_t __valarray_product
(
const valarray < size_t > &
__a
)
[inline]
template<typename _Tp>
_Tp __valarray_product
(
const _Tp *__restrict__
__f ,
const _Tp *__restrict__
__l
)
[inline]
void __valarray_release_memory
(
void *
__p
)
[inline]
template<typename _Tp>
_Tp __valarray_sum
(
const _Tp *__restrict__
__f ,
const _Tp *__restrict__
__l
)
[inline]
template<class _Iter>
iterator_traits <_Iter>::value_type* __value_type
(
const _Iter &
)
[inline]
Definition at line 189 of file stl_iterator_base_types.h .
Referenced by __copy_ni2 (), __insertion_sort (), __unguarded_insertion_sort (), __unique_copy (), _Destroy (), adjacent_difference (), inplace_merge (), iter_swap (), make_heap (), nth_element (), partial_sort (), partial_sort_copy (), partial_sum (), pop_heap (), push_heap (), sort (), stable_partition (), stable_sort (), uninitialized_copy (), uninitialized_fill (), uninitialized_fill_n (), and value_type ().
unsigned long _Atomic_swap
(
unsigned long *
__p ,
unsigned long
__q
)
[inline, static]
template<class _T1>
void _Construct
(
_T1 *
__p
)
[inline]
template<class _T1, class _T2>
void _Construct
(
_T1 *
__p ,
const _T2 &
__value
)
[inline]
void _Destroy
(
wchar_t *
,
wchar_t *
)
[inline]
void _Destroy
(
double *
,
double *
)
[inline]
void _Destroy
(
float *
,
float *
)
[inline]
void _Destroy
(
long *
,
long *
)
[inline]
void _Destroy
(
int *
,
int *
)
[inline]
void _Destroy
(
char *
,
char *
)
[inline]
template<class _ForwardIterator>
void _Destroy
(
_ForwardIterator
__first ,
_ForwardIterator
__last
)
[inline]
template<class _Tp>
void _Destroy
(
_Tp *
__pointer
)
[inline]
Definition at line 331 of file stl_tree.h .
References std::_Rb_tree_node_base::_M_color , std::_Rb_tree_node_base::_M_left , std::_Rb_tree_node_base::_M_parent , std::_Rb_tree_node_base::_M_right , _Rb_tree_rotate_left (), _Rb_tree_rotate_right (), _S_rb_tree_black , _S_rb_tree_red , and swap ().
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::erase ().
template<class _CharT, class _Traits>
void _Rope_fill
(
basic_ostream < _CharT, _Traits > &
__o ,
size_t
__n
)
[inline]
bool _Rope_is_simple
(
wchar_t *
)
[inline]
bool _Rope_is_simple
(
char *
)
[inline]
template<class _CharT>
bool _Rope_is_simple
(
_CharT *
)
[inline]
void _S_cond_store_eos
(
wchar_t &
__c
)
[inline]
void _S_cond_store_eos
(
char &
__c
)
[inline]
template<class _CharT>
void _S_cond_store_eos
(
_CharT &
)
[inline]
template<class _CharT>
_CharT _S_eos
(
_CharT *
)
[inline]
bool _S_is_basic_char_type
(
wchar_t *
)
[inline]
bool _S_is_basic_char_type
(
char *
)
[inline]
template<class _CharT>
bool _S_is_basic_char_type
(
_CharT *
)
[inline]
bool _S_is_one_byte_char_type
(
char *
)
[inline]
template<class _CharT>
bool _S_is_one_byte_char_type
(
_CharT *
)
[inline]
template<class _CharT, class _Traits, class _Alloc>
void _S_string_copy
(
const basic_string < _CharT, _Traits, _Alloc > &
__str ,
_CharT *
__buf ,
typename _Alloc::size_type
__bufsiz
)
long std::abs
(
long double
__x
)
[inline]
double abs
(
double
__x
)
[inline]
float abs
(
float
__x
)
[inline]
template<typename _Tp>
_Tp std::abs
(
const complex < _Tp > &
)
[inline]
template<class _InputIterator, class _Tp, class _BinaryOperation>
_Tp accumulate
(
_InputIterator
__first ,
_InputIterator
__last ,
_Tp
__init ,
_BinaryOperation
__binary_op
)
template<class _InputIterator, class _Tp>
_Tp accumulate
(
_InputIterator
__first ,
_InputIterator
__last ,
_Tp
__init
)
long double acos
(
long double
__x
)
[inline]
float acos
(
float
__x
)
[inline]
template<class _InputIterator, class _OutputIterator, class _BinaryOperation>
_OutputIterator adjacent_difference
(
_InputIterator
__first ,
_InputIterator
__last ,
_OutputIterator
__result ,
_BinaryOperation
__binary_op
)
template<class _InputIterator, class _OutputIterator>
_OutputIterator adjacent_difference
(
_InputIterator
__first ,
_InputIterator
__last ,
_OutputIterator
__result
)
template<class _ForwardIter, class _BinaryPredicate>
_ForwardIter adjacent_find
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_BinaryPredicate
__binary_pred
)
template<class _ForwardIter>
_ForwardIter adjacent_find
(
_ForwardIter
__first ,
_ForwardIter
__last
)
template<class _InputIterator, class _Distance>
void advance
(
_InputIterator &
__i ,
_Distance
__n
)
[inline]
template<typename _Tp>
_Tp std::arg
(
const complex < _Tp > &
)
[inline]
long double asin
(
long double
__x
)
[inline]
float asin
(
float
__x
)
[inline]
long double atan
(
long double
__x
)
[inline]
float atan
(
float
__x
)
[inline]
long double atan2
(
long double
__y ,
long double
__x
)
[inline]
float atan2
(
float
__y ,
float
__x
)
[inline]
template<class _Container>
back_insert_iterator <_Container> back_inserter
(
_Container &
__x
)
[inline]
template<class _ForwardIter, class _Tp, class _Compare>
bool binary_search
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Compare
__comp
)
template<class _ForwardIter, class _Tp>
bool binary_search
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val
)
template<class _Operation, class _Tp>
binder1st <_Operation> bind1st
(
const _Operation &
__fn ,
const _Tp &
__x
)
[inline]
template<class _Operation, class _Tp>
binder2nd <_Operation> bind2nd
(
const _Operation &
__fn ,
const _Tp &
__x
)
[inline]
long double ceil
(
long double
__x
)
[inline]
float ceil
(
float
__x
)
[inline]
template<class _Operation1, class _Operation2>
unary_compose <_Operation1,_Operation2> compose1
(
const _Operation1 &
__fn1 ,
const _Operation2 &
__fn2
)
[inline]
template<class _Operation1, class _Operation2, class _Operation3>
binary_compose <_Operation1, _Operation2, _Operation3> compose2
(
const _Operation1 &
__fn1 ,
const _Operation2 &
__fn2 ,
const _Operation3 &
__fn3
)
[inline]
template<typename _Tp>
complex < _Tp > std::conj
(
const complex < _Tp > &
)
[inline]
template<class _Result>
constant_void_fun <_Result> constant0
(
const _Result &
__val
)
[inline]
template<class _Result>
constant_unary_fun <_Result,_Result> constant1
(
const _Result &
__val
)
[inline]
template<class _Result>
constant_binary_fun <_Result,_Result,_Result> constant2
(
const _Result &
__val
)
[inline]
template<class _T1>
void construct
(
_T1 *
__p
)
[inline]
template<class _T1, class _T2>
void construct
(
_T1 *
__p ,
const _T2 &
__value
)
[inline]
Definition at line 127 of file stl_construct.h .
References _Construct ().
Referenced by std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_M_create_node (), std::slist< _Tp, _Alloc >::_M_create_node (), std::vector< _Tp, _Alloc >::_M_insert_aux (), std::hashtable< _Value, _Value, _HashFcn, _Identity< _Value >, _EqualKey, _Alloc >::_M_new_node (), std::deque< _Tp, _Alloc >::_M_push_back_aux (), std::deque< _Tp, _Alloc >::_M_push_front_aux (), std::vector< _Node *, _Alloc >::insert (), std::raw_storage_iterator< _ForwardIterator, _Tp >::operator= (), std::vector< _Node *, _Alloc >::push_back (), std::deque< _Tp, _Alloc >::push_back (), and std::rope< _CharT, _Alloc >::rope ().
template<class _InputIter, class _OutputIter>
_OutputIter copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result
)
[inline]
Definition at line 272 of file stl_algobase.h .
References __copy_ni1 (), and __glibcpp_function_requires .
Referenced by __copy_n (), __merge_adaptive (), __output_integer (), __pad_numeric (), __rotate_adaptive (), __stable_partition_adaptive (), __uninitialized_copy_aux (), __BVECTOR::__VECTOR (), std::vector< _Tp, _Alloc >::_M_assign_aux (), std::deque< _Tp, _Alloc >::_M_assign_aux (), std::vector< bool, _Alloc >::_M_assign_aux (), __BVECTOR::_M_fill_insert (), std::vector< bool, _Alloc >::_M_fill_insert (), std::vector< bool, _Alloc >::_M_initialize_range (), std::deque< _Tp, _Alloc >::_M_insert_aux (), __BVECTOR::_M_insert_aux (), std::vector< bool, _Alloc >::_M_insert_aux (), std::vector< bool, _Alloc >::_M_insert_range (), std::vector< _Tp, _Alloc >::_M_range_insert (), std::deque< _Tp, _Alloc >::_M_reallocate_map (), std::num_put< _CharT, _OutIter >::do_put (), std::vector< _Node *, _Alloc >::erase (), std::deque< _Tp, _Alloc >::erase (), __BVECTOR::erase (), std::vector< bool, _Alloc >::erase (), std::deque< _Tp, _Alloc >::insert (), __BVECTOR::insert (), merge (), std::vector< _Tp, _Alloc >::operator= (), std::sequence_buffer< _Sequence, _Buf_sz >::operator= (), __BVECTOR::operator= (), std::vector< bool, _Alloc >::operator= (), __BVECTOR::reserve (), std::vector< bool, _Alloc >::reserve (), rotate_copy (), std::sequence_buffer< _Sequence, _Buf_sz >::sequence_buffer (), set_difference (), set_symmetric_difference (), set_union (), and std::vector< bool, _Alloc >::vector ().
template<typename _BI1, typename _BI2>
_BI2 copy_backward
(
_BI1
__first ,
_BI1
__last ,
_BI2
__result
)
[inline]
Definition at line 391 of file stl_algobase.h .
References __copy_backward_input_normal_iterator (), and __glibcpp_function_requires .
Referenced by __linear_insert (), __merge_backward (), __rotate_adaptive (), std::vector< _Tp, _Alloc >::_M_fill_insert (), __BVECTOR::_M_fill_insert (), std::vector< bool, _Alloc >::_M_fill_insert (), std::vector< _Tp, _Alloc >::_M_insert_aux (), std::deque< _Tp, _Alloc >::_M_insert_aux (), __BVECTOR::_M_insert_aux (), std::vector< bool, _Alloc >::_M_insert_aux (), std::vector< bool, _Alloc >::_M_insert_range (), std::vector< _Tp, _Alloc >::_M_range_insert (), std::deque< _Tp, _Alloc >::_M_reallocate_map (), std::deque< _Tp, _Alloc >::erase (), and __BVECTOR::insert ().
template<class _InputIter, class _Size, class _OutputIter>
pair <_InputIter, _OutputIter> copy_n
(
_InputIter
__first ,
_Size
__count ,
_OutputIter
__result
)
[inline]
long double cos
(
long double
__x
)
[inline]
float cos
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::cos
(
const complex < _Tp > &
)
[inline]
long double cosh
(
long double
__x
)
[inline]
float cosh
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::cosh
(
const complex < _Tp > &
)
[inline]
template<class _InputIter, class _Tp>
iterator_traits <_InputIter>::difference_type count
(
_InputIter
__first ,
_InputIter
__last ,
const _Tp &
__value
)
template<class _InputIter, class _Tp, class _Size>
void count
(
_InputIter
__first ,
_InputIter
__last ,
const _Tp &
__value ,
_Size &
__n
)
template<class _InputIter, class _Predicate>
iterator_traits <_InputIter>::difference_type count_if
(
_InputIter
__first ,
_InputIter
__last ,
_Predicate
__pred
)
template<class _InputIter, class _Predicate, class _Size>
void count_if
(
_InputIter
__first ,
_InputIter
__last ,
_Predicate
__pred ,
_Size &
__n
)
template<class _ForwardIterator>
void destroy
(
_ForwardIterator
__first ,
_ForwardIterator
__last
)
[inline]
template<class _Tp>
void destroy
(
_Tp *
__pointer
)
[inline]
Definition at line 137 of file stl_construct.h .
References _Destroy ().
Referenced by __destroy_aux (), std::vector< _Tp, _Alloc >::_M_assign_aux (), std::hashtable< _Value, _Value, _HashFcn, _Identity< _Value >, _EqualKey, _Alloc >::_M_delete_node (), std::_Slist_base< _Tp, _Alloc >::_M_erase_after (), std::deque< _Tp, _Alloc >::_M_fill_initialize (), std::vector< _Tp, _Alloc >::_M_fill_insert (), std::_Rope_RopeRep< _CharT, _Alloc >::_M_free_c_string (), std::vector< _Tp, _Alloc >::_M_insert_aux (), std::deque< _Tp, _Alloc >::_M_pop_back_aux (), std::deque< _Tp, _Alloc >::_M_pop_front_aux (), std::deque< _Tp, _Alloc >::_M_range_initialize (), std::vector< _Tp, _Alloc >::_M_range_insert (), std::deque< _Tp, _Alloc >::clear (), std::rope< _CharT, _Alloc >::copy (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::destroy_node (), std::vector< _Node *, _Alloc >::erase (), std::deque< _Tp, _Alloc >::erase (), std::vector< _Tp, _Alloc >::operator= (), std::deque< _Tp, _Alloc >::operator= (), std::vector< _Node *, _Alloc >::pop_back (), std::deque< _Tp, _Alloc >::pop_back (), std::slist< _Tp, _Alloc >::pop_front (), std::vector< _Node *, _Alloc >::reserve (), std::_Temporary_buffer< _ForwardIterator, _Tp >::~_Temporary_buffer (), and std::vector< _Node *, _Alloc >::~vector ().
template<class _InputIterator>
iterator_traits <_InputIterator>::difference_type distance
(
_InputIterator
__first ,
_InputIterator
__last
)
[inline]
template<class _InputIterator, class _Distance>
void distance
(
_InputIterator
__first ,
_InputIterator
__last ,
_Distance &
__n
)
[inline]
template<class _Iter>
iterator_traits <_Iter>::difference_type* distance_type
(
const _Iter &
__i
)
[inline]
ldiv_t div
(
long
__i ,
long
__j
)
[inline]
template<class _InputIter1, class _InputIter2, class _BinaryPredicate>
bool equal
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_BinaryPredicate
__binary_pred
)
[inline]
template<class _InputIter1, class _InputIter2>
bool equal
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2
)
[inline]
template<class _ForwardIter, class _Tp, class _Compare>
pair <_ForwardIter, _ForwardIter> equal_range
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Compare
__comp
)
[inline]
template<class _ForwardIter, class _Tp>
pair <_ForwardIter, _ForwardIter> equal_range
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val
)
[inline]
long double exp
(
long double
__x
)
[inline]
float exp
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::exp
(
const complex < _Tp > &
)
[inline]
long double fabs
(
long double
__x
)
[inline]
float fabs
(
float
__x
)
[inline]
void fill
(
char *
__first ,
char *
__last ,
const char &
__c
)
[inline]
void fill
(
signed char *
__first ,
signed char *
__last ,
const signed char &
__c
)
[inline]
void fill
(
unsigned char *
__first ,
unsigned char *
__last ,
const unsigned char &
__c
)
[inline]
template<class _ForwardIter, class _Tp>
void fill
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__value
)
Definition at line 453 of file stl_algobase.h .
References __glibcpp_function_requires .
Referenced by __uninitialized_fill_aux (), std::_Base_bitset< _Nw >::_M_do_left_shift (), std::_Base_bitset< _Nw >::_M_do_right_shift (), std::deque< _Tp, _Alloc >::_M_fill_assign (), std::vector< bool, _Alloc >::_M_fill_assign (), std::vector< _Tp, _Alloc >::_M_fill_insert (), std::vector< bool, _Alloc >::_M_fill_insert (), std::vector< bool, _Alloc >::_M_initialize_dispatch (), std::deque< _Tp, _Alloc >::_M_insert_aux (), fill_n (), and std::vector< bool, _Alloc >::vector ().
template<class _Size>
char* fill_n
(
char *
__first ,
_Size
__n ,
const char &
__c
)
[inline]
template<class _Size>
signed char* fill_n
(
char *
__first ,
_Size
__n ,
const signed char &
__c
)
[inline]
template<class _Size>
unsigned char* fill_n
(
unsigned char *
__first ,
_Size
__n ,
const unsigned char &
__c
)
[inline]
template<class _OutputIter, class _Size, class _Tp>
_OutputIter fill_n
(
_OutputIter
__first ,
_Size
__n ,
const _Tp &
__value
)
template<class _InputIter, class _Tp>
_InputIter find
(
_InputIter
__first ,
_InputIter
__last ,
const _Tp &
__val
)
[inline]
template<class _RandomAccessIter, class _Tp>
_RandomAccessIter find
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
const _Tp &
__val ,
random_access_iterator_tag
)
template<class _InputIter, class _Tp>
_InputIter find
(
_InputIter
__first ,
_InputIter
__last ,
const _Tp &
__val ,
input_iterator_tag
)
[inline]
template<class _ForwardIter1, class _ForwardIter2, class _BinaryPredicate>
_ForwardIter1 find_end
(
_ForwardIter1
__first1 ,
_ForwardIter1
__last1 ,
_ForwardIter2
__first2 ,
_ForwardIter2
__last2 ,
_BinaryPredicate
__comp
)
[inline]
template<class _ForwardIter1, class _ForwardIter2>
_ForwardIter1 find_end
(
_ForwardIter1
__first1 ,
_ForwardIter1
__last1 ,
_ForwardIter2
__first2 ,
_ForwardIter2
__last2
)
[inline]
template<class _InputIter, class _ForwardIter, class _BinaryPredicate>
_InputIter find_first_of
(
_InputIter
__first1 ,
_InputIter
__last1 ,
_ForwardIter
__first2 ,
_ForwardIter
__last2 ,
_BinaryPredicate
__comp
)
template<class _InputIter, class _ForwardIter>
_InputIter find_first_of
(
_InputIter
__first1 ,
_InputIter
__last1 ,
_ForwardIter
__first2 ,
_ForwardIter
__last2
)
template<class _InputIter, class _Predicate>
_InputIter find_if
(
_InputIter
__first ,
_InputIter
__last ,
_Predicate
__pred
)
[inline]
template<class _RandomAccessIter, class _Predicate>
_RandomAccessIter find_if
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Predicate
__pred ,
random_access_iterator_tag
)
template<class _InputIter, class _Predicate>
_InputIter find_if
(
_InputIter
__first ,
_InputIter
__last ,
_Predicate
__pred ,
input_iterator_tag
)
[inline]
long double floor
(
long double
__x
)
[inline]
float floor
(
float
__x
)
[inline]
long double fmod
(
long double
__x ,
long double
__y
)
[inline]
float fmod
(
float
__x ,
float
__y
)
[inline]
template<class _InputIter, class _Function>
_Function for_each
(
_InputIter
__first ,
_InputIter
__last ,
_Function
__f
)
long double frexp
(
long double
__x ,
int *
__exp
)
[inline]
float frexp
(
float
__x ,
int *
__exp
)
[inline]
template<class _Container>
front_insert_iterator <_Container> front_inserter
(
_Container &
__x
)
[inline]
template<class _ForwardIter, class _Generator>
void generate
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Generator
__gen
)
template<class _OutputIter, class _Size, class _Generator>
_OutputIter generate_n
(
_OutputIter
__first ,
_Size
__n ,
_Generator
__gen
)
template<class _Tp>
pair <_Tp*, ptrdiff_t> get_temporary_buffer
(
ptrdiff_t
__len ,
_Tp *
)
[inline]
template<class _Tp>
pair <_Tp*, ptrdiff_t> get_temporary_buffer
(
ptrdiff_t
__len
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
basic_istream < _CharT, _Traits > & std::getline
(
basic_istream < _CharT, _Traits > &
__is ,
basic_string < _CharT, _Traits, _Alloc > &
__str
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
basic_istream < _CharT, _Traits > & std::getline
(
basic_istream < _CharT, _Traits > &
__is ,
basic_string < _CharT, _Traits, _Alloc > &
__str ,
_CharT
__delim
)
template<typename _Facet>
bool std::has_facet
(
const locale &
__loc
)
throw ()
template bool has_facet< ctype < char > >
(
const locale &
)
template<class _CharT, class _Alloc>
rope <_CharT,_Alloc> identity_element
(
_Rope_Concat_fn < _CharT, _Alloc >
)
[inline]
template<class _Tp>
_Tp identity_element
(
multiplies < _Tp >
)
[inline]
template<class _Tp>
_Tp identity_element
(
plus < _Tp >
)
[inline]
template<typename _Tp>
_Tp imag
(
const complex < _Tp > &
__z
)
[inline]
template<class _InputIter1, class _InputIter2, class _Compare>
bool includes
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_Compare
__comp
)
template<class _InputIter1, class _InputIter2>
bool includes
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2
)
template<class _InputIterator1, class _InputIterator2, class _Tp, class _BinaryOperation1, class _BinaryOperation2>
_Tp inner_product
(
_InputIterator1
__first1 ,
_InputIterator1
__last1 ,
_InputIterator2
__first2 ,
_Tp
__init ,
_BinaryOperation1
__binary_op1 ,
_BinaryOperation2
__binary_op2
)
template<class _InputIterator1, class _InputIterator2, class _Tp>
_Tp inner_product
(
_InputIterator1
__first1 ,
_InputIterator1
__last1 ,
_InputIterator2
__first2 ,
_Tp
__init
)
template<class _BidirectionalIter, class _Compare>
void inplace_merge
(
_BidirectionalIter
__first ,
_BidirectionalIter
__middle ,
_BidirectionalIter
__last ,
_Compare
__comp
)
[inline]
template<class _BidirectionalIter>
void inplace_merge
(
_BidirectionalIter
__first ,
_BidirectionalIter
__middle ,
_BidirectionalIter
__last
)
[inline]
template<class _Container, class _Iterator>
insert_iterator <_Container> inserter
(
_Container &
__x ,
_Iterator
__i
)
[inline]
template<class _ForwardIter, class _Tp>
void iota
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Tp
__value
)
template<class _RandomAccessIter, class _StrictWeakOrdering>
bool is_heap
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_StrictWeakOrdering
__comp
)
[inline]
template<class _RandomAccessIter>
bool is_heap
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last
)
[inline]
template<class _ForwardIter, class _StrictWeakOrdering>
bool is_sorted
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_StrictWeakOrdering
__comp
)
template<class _ForwardIter>
bool is_sorted
(
_ForwardIter
__first ,
_ForwardIter
__last
)
template<typename _CharT>
bool std::isalnum
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::isalpha
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::iscntrl
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::isdigit
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::isgraph
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::islower
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::isprint
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::ispunct
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::isspace
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::isupper
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
bool std::isxdigit
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<class _ForwardIter1, class _ForwardIter2>
void iter_swap
(
_ForwardIter1
__a ,
_ForwardIter2
__b
)
[inline]
template<class _Iter>
iterator_traits <_Iter>::iterator_category iterator_category
(
const _Iter &
__i
)
[inline]
long double ldexp
(
long double
__x ,
int
__exp
)
[inline]
float ldexp
(
float
__x ,
int
__exp
)
[inline]
bool lexicographical_compare
(
const char *
__first1 ,
const char *
__last1 ,
const char *
__first2 ,
const char *
__last2
)
[inline]
bool lexicographical_compare
(
const unsigned char *
__first1 ,
const unsigned char *
__last1 ,
const unsigned char *
__first2 ,
const unsigned char *
__last2
)
[inline]
template<class _InputIter1, class _InputIter2, class _Compare>
bool lexicographical_compare
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_Compare
__comp
)
template<class _InputIter1, class _InputIter2>
bool lexicographical_compare
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2
)
template<class _InputIter1, class _InputIter2>
int lexicographical_compare_3way
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2
)
long double log
(
long double
__x
)
[inline]
float log
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::log
(
const complex < _Tp > &
)
[inline]
long double log10
(
long double
__x
)
[inline]
float log10
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::log10
(
const complex < _Tp > &
)
[inline]
template<class _ForwardIter, class _Tp, class _Compare>
_ForwardIter lower_bound
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Compare
__comp
)
[inline]
template<class _ForwardIter, class _Tp>
_ForwardIter lower_bound
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val
)
[inline]
template<class _RandomAccessIterator, class _Compare>
void make_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Compare
__comp
)
[inline]
template<class _RandomAccessIterator>
void make_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last
)
[inline]
template<class _T1, class _T2>
pair <_T1, _T2> make_pair
(
const _T1 &
__x ,
const _T2 &
__y
)
[inline]
A convenience wrapper for creating a pair from two objects.
Parameters:
x
The first object.
y
The second object.
Returns:
A newly-constructed pair <> object of the appropriate type. The standard requires that the objects be passed by reference-to-const, but LWG issue #181 says they should be passed by const value.
Definition at line 144 of file stl_pair.h .
template<class _Tp, class _Compare>
const _Tp& max
(
const _Tp &
__a ,
const _Tp &
__b ,
_Compare
__comp
)
[inline]
template<class _Tp>
const _Tp& max
(
const _Tp &
__a ,
const _Tp &
__b
)
[inline]
Definition at line 138 of file stl_algobase.h .
References __glibcpp_function_requires .
Referenced by std::vector< _Tp, _Alloc >::_M_fill_insert (), std::vector< bool, _Alloc >::_M_fill_insert (), std::_Deque_base< _Tp, _Alloc >::_M_initialize_map (), std::vector< bool, _Alloc >::_M_insert_range (), std::vector< _Tp, _Alloc >::_M_range_insert (), std::deque< _Tp, _Alloc >::_M_reallocate_map (), std::rope< _CharT, _Alloc >::_S_apply_to_pieces (), abs (), std::basic_istream< _CharT, _Traits >::ignore (), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow (), std::basic_filebuf< _CharT, _Traits >::seekoff (), and std::basic_stringbuf< _CharT, _Traits, _Alloc >::str ().
template<class _ForwardIter, class _Compare>
_ForwardIter max_element
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Compare
__comp
)
template<class _ForwardIter>
_ForwardIter max_element
(
_ForwardIter
__first ,
_ForwardIter
__last
)
template<class _Ret, class _Tp, class _Arg>
const_mem_fun1_t < _Ret, _Tp, _Arg > std::mem_fun
(
_Ret(_Tp::*
__f )(_Arg)
)
[inline]
template<class _Ret, class _Tp>
const_mem_fun_t < _Ret, _Tp > std::mem_fun
(
_Ret(_Tp::*
__f )()
)
[inline]
template<class _Ret, class _Tp, class _Arg>
const_mem_fun1_t < _Ret, _Tp, _Arg > std::mem_fun1
(
_Ret(_Tp::*
__f )(_Arg)
)
[inline]
template<class _Ret, class _Tp, class _Arg>
const_mem_fun1_ref_t < _Ret, _Tp, _Arg > std::mem_fun1_ref
(
_Ret(_Tp::*
__f )(_Arg)
)
[inline]
template<class _Ret, class _Tp, class _Arg>
const_mem_fun1_ref_t < _Ret, _Tp, _Arg > std::mem_fun_ref
(
_Ret(_Tp::*
__f )(_Arg)
)
[inline]
template<class _Ret, class _Tp>
const_mem_fun_ref_t < _Ret, _Tp > std::mem_fun_ref
(
_Ret(_Tp::*
__f )()
)
[inline]
void* memchr
(
void *
__p ,
int
__c ,
size_t
__n
)
[inline]
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare>
_OutputIter merge
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result ,
_Compare
__comp
)
template<class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter merge
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result
)
template<class _Tp, class _Compare>
const _Tp& min
(
const _Tp &
__a ,
const _Tp &
__b ,
_Compare
__comp
)
[inline]
template<class _Tp>
const _Tp& min
(
const _Tp &
__a ,
const _Tp &
__b
)
[inline]
Definition at line 130 of file stl_algobase.h .
References __glibcpp_function_requires .
Referenced by __lexicographical_compare_3way (), __merge_sort_loop (), std::bitset< _Nb >::_M_copy_from_string (), std::basic_streambuf< char_type, traits_type >::_M_pback_create (), std::rope< _CharT, _Alloc >::_S_apply_to_pieces (), _S_string_copy (), std::basic_string< _CharT, _Traits, _Alloc >::append (), std::basic_string< _CharT, _Traits, _Alloc >::compare (), std::basic_string< char >::compare (), std::basic_istream< _CharT, _Traits >::ignore (), lexicographical_compare (), random_sample_n (), std::basic_istream< _CharT, _Traits >::readsome (), std::basic_string< _CharT, _Traits, _Alloc >::rfind (), std::basic_streambuf< _CharT, _Traits >::xsgetn (), and std::basic_streambuf< _CharT, _Traits >::xsputn ().
template<class _ForwardIter, class _Compare>
_ForwardIter min_element
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Compare
__comp
)
template<class _ForwardIter>
_ForwardIter min_element
(
_ForwardIter
__first ,
_ForwardIter
__last
)
template<class _InputIter1, class _InputIter2, class _BinaryPredicate>
pair <_InputIter1, _InputIter2> mismatch
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_BinaryPredicate
__binary_pred
)
template<class _InputIter1, class _InputIter2>
pair <_InputIter1, _InputIter2> mismatch
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2
)
long double modf
(
long double
__x ,
long double *
__iptr
)
[inline]
float modf
(
float
__x ,
float *
__iptr
)
[inline]
template<class _BidirectionalIter, class _Compare>
bool next_permutation
(
_BidirectionalIter
__first ,
_BidirectionalIter
__last ,
_Compare
__comp
)
template<class _BidirectionalIter>
bool next_permutation
(
_BidirectionalIter
__first ,
_BidirectionalIter
__last
)
template<typename _Tp>
_Tp std::norm
(
const complex < _Tp > &
)
[inline]
template<class _Predicate>
unary_negate <_Predicate> not1
(
const _Predicate &
__pred
)
[inline]
template<class _Predicate>
binary_negate <_Predicate> not2
(
const _Predicate &
__pred
)
[inline]
template<class _RandomAccessIter, class _Compare>
void nth_element
(
_RandomAccessIter
__first ,
_RandomAccessIter
__nth ,
_RandomAccessIter
__last ,
_Compare
__comp
)
[inline]
template<class _RandomAccessIter>
void nth_element
(
_RandomAccessIter
__first ,
_RandomAccessIter
__nth ,
_RandomAccessIter
__last
)
[inline]
template<size_t _Nb>
bitset <_Nb> operator &
(
const bitset < _Nb > &
__x ,
const bitset < _Nb > &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator *
(
const _Tp &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator *
(
const complex < _Tp > &
__x ,
const _Tp &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator *
(
const complex < _Tp > &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator!=
(
const slist < _Tp, _Alloc > &
_SL1 ,
const slist < _Tp, _Alloc > &
_SL2
)
[inline]
template<class _Val, class _HashFcn, class _EqualKey, class _Alloc>
bool operator!=
(
const hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &
__hs1 ,
const hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &
__hs2
)
[inline]
template<class _Value, class _HashFcn, class _EqualKey, class _Alloc>
bool operator!=
(
const hash_set < _Value, _HashFcn, _EqualKey, _Alloc > &
__hs1 ,
const hash_set < _Value, _HashFcn, _EqualKey, _Alloc > &
__hs2
)
[inline]
template<class _Key, class _Tp, class _HF, class _EqKey, class _Alloc>
bool operator!=
(
const hash_multimap < _Key, _Tp, _HF, _EqKey, _Alloc > &
__hm1 ,
const hash_multimap < _Key, _Tp, _HF, _EqKey, _Alloc > &
__hm2
)
[inline]
template<class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
bool operator!=
(
const hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &
__hm1 ,
const hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &
__hm2
)
[inline]
template<class _CharT, class _Alloc>
bool operator!=
(
const rope < _CharT, _Alloc > &
__x ,
const rope < _CharT, _Alloc > &
__y
)
[inline]
template<class _CharT, class _Alloc>
bool operator!=
(
const _Rope_iterator < _CharT, _Alloc > &
__x ,
const _Rope_iterator < _CharT, _Alloc > &
__y
)
[inline]
template<class _Val, class _Key, class _HF, class _Ex, class _Eq, class _All>
bool operator!=
(
const hashtable < _Val, _Key, _HF, _Ex, _Eq, _All > &
__ht1 ,
const hashtable < _Val, _Key, _HF, _Ex, _Eq, _All > &
__ht2
)
[inline]
template<class _Tp, class _Alloc>
bool operator!=
(
const vector < _Tp, _Alloc > &
__x ,
const vector < _Tp, _Alloc > &
__y
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
bool operator!=
(
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__x ,
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__y
)
[inline]
template<class _Value>
bool operator!=
(
const _Rb_tree_iterator < _Value, _Value &, _Value * > &
__x ,
const _Rb_tree_iterator < _Value, const _Value &, const _Value * > &
__y
)
[inline]
template<class _Value>
bool operator!=
(
const _Rb_tree_iterator < _Value, const _Value &, const _Value * > &
__x ,
const _Rb_tree_iterator < _Value, _Value &, _Value * > &
__y
)
[inline]
template<class _Value, class _Ref, class _Ptr>
bool operator!=
(
const _Rb_tree_iterator < _Value, _Ref, _Ptr > &
__x ,
const _Rb_tree_iterator < _Value, _Ref, _Ptr > &
__y
)
[inline]
template<class _Tp, class _Seq>
bool operator!=
(
const stack < _Tp, _Seq > &
__x ,
const stack < _Tp, _Seq > &
__y
)
template<class _Key, class _Compare, class _Alloc>
bool operator!=
(
const set < _Key, _Compare, _Alloc > &
__x ,
const set < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Sequence>
bool operator!=
(
const queue < _Tp, _Sequence > &
__x ,
const queue < _Tp, _Sequence > &
__y
)
template<class _T1, class _T2>
bool operator!=
(
const pair < _T1, _T2 > &
__x ,
const pair < _T1, _T2 > &
__y
)
[inline]
Uses operator
== to find the result.
Definition at line 108 of file stl_pair.h .
template<class _Key, class _Compare, class _Alloc>
bool operator!=
(
const multiset < _Key, _Compare, _Alloc > &
__x ,
const multiset < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator!=
(
const multimap < _Key, _Tp, _Compare, _Alloc > &
__x ,
const multimap < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator!=
(
const map < _Key, _Tp, _Compare, _Alloc > &
__x ,
const map < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator!=
(
const list < _Tp, _Alloc > &
__x ,
const list < _Tp, _Alloc > &
__y
)
[inline]
template<typename _IteratorL, typename _IteratorR, typename _Container>
bool operator!=
(
const __normal_iterator < _IteratorL, _Container > &
__lhs ,
const __normal_iterator < _IteratorR, _Container > &
__rhs
)
[inline]
template<class _Tp, class _CharT, class _Traits, class _Dist>
bool operator!=
(
const istream_iterator < _Tp, _CharT, _Traits, _Dist > &
__x ,
const istream_iterator < _Tp, _CharT, _Traits, _Dist > &
__y
)
[inline]
template<class _BiIter, class _Tp, class _Ref, class _Distance>
bool operator!=
(
const reverse_bidirectional_iterator < _BiIter, _Tp, _Ref, _Distance > &
__x ,
const reverse_bidirectional_iterator < _BiIter, _Tp, _Ref, _Distance > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator!=
(
const deque < _Tp, _Alloc > &
__x ,
const deque < _Tp, _Alloc > &
__y
)
[inline]
template<class _Alloc>
bool operator!=
(
const debug_alloc < _Alloc > &
,
const debug_alloc < _Alloc > &
)
[inline]
template<class _Tp, class _Alloc>
bool operator!=
(
const __allocator < _Tp, _Alloc > &
__a1 ,
const __allocator < _Tp, _Alloc > &
__a2
)
[inline]
template<class _T1, class _T2>
bool operator!=
(
const allocator < _T1 > &
,
const allocator < _T2 > &
)
[inline]
template<typename _Tp>
bool operator!=
(
const _Tp &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _Tp>
bool operator!=
(
const complex < _Tp > &
__x ,
const _Tp &
__y
)
[inline]
template<typename _Tp>
bool operator!=
(
const complex < _Tp > &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator!=
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const _CharT *
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator!=
(
const _CharT *
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator!=
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template S operator+
(
C
,
const S &
)
template S operator+
(
const C *
,
const S &
)
template<class _CharT, class _Alloc>
rope < _CharT, _Alloc > std::operator+
(
const rope < _CharT, _Alloc > &
__left ,
_CharT
__right
)
[inline]
template<class _CharT, class _Alloc>
rope < _CharT, _Alloc > std::operator+
(
const rope < _CharT, _Alloc > &
__left ,
const _CharT *
__right
)
[inline]
template<class _CharT, class _Alloc>
rope < _CharT, _Alloc > std::operator+
(
const rope < _CharT, _Alloc > &
__left ,
const rope < _CharT, _Alloc > &
__right
)
[inline]
template<class _CharT, class _Alloc>
_Rope_iterator < _CharT, _Alloc > std::operator+
(
ptrdiff_t
__n ,
const _Rope_iterator < _CharT, _Alloc > &
__x
)
[inline]
template<class _CharT, class _Alloc>
_Rope_iterator < _CharT, _Alloc > std::operator+
(
const _Rope_iterator < _CharT, _Alloc > &
__x ,
ptrdiff_t
__n
)
[inline]
template<class _Tp, class _Ref, class _Ptr>
_Deque_iterator <_Tp, _Ref, _Ptr> operator+
(
ptrdiff_t
__n ,
const _Deque_iterator < _Tp, _Ref, _Ptr > &
__x
)
[inline]
template<typename _Tp>
complex <_Tp> operator+
(
const complex < _Tp > &
__x
)
[inline]
template<typename _Tp>
complex <_Tp> operator+
(
const _Tp &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator+
(
const complex < _Tp > &
__x ,
const _Tp &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator+
(
const complex < _Tp > &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string <_CharT, _Traits, _Alloc> operator+
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
_CharT
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string <_CharT, _Traits, _Alloc> operator+
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const _CharT *
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string < _CharT, _Traits, _Alloc > std::operator+
(
_CharT
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string < _CharT, _Traits, _Alloc > std::operator+
(
const _CharT *
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string <_CharT, _Traits, _Alloc> operator+
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
template<class _CharT, class _Alloc>
rope <_CharT,_Alloc>& operator+=
(
rope < _CharT, _Alloc > &
__left ,
_CharT
__right
)
[inline]
template<class _CharT, class _Alloc>
rope <_CharT,_Alloc>& operator+=
(
rope < _CharT, _Alloc > &
__left ,
const _CharT *
__right
)
[inline]
template<class _CharT, class _Alloc>
rope <_CharT,_Alloc>& operator+=
(
rope < _CharT, _Alloc > &
__left ,
const rope < _CharT, _Alloc > &
__right
)
[inline]
template<class _CharT, class _Alloc>
ptrdiff_t std::operator-
(
const _Rope_iterator < _CharT, _Alloc > &
__x ,
const _Rope_iterator < _CharT, _Alloc > &
__y
)
[inline]
template<class _CharT, class _Alloc>
_Rope_iterator < _CharT, _Alloc > std::operator-
(
const _Rope_iterator < _CharT, _Alloc > &
__x ,
ptrdiff_t
__n
)
[inline]
template<typename _Tp>
complex <_Tp> operator-
(
const complex < _Tp > &
__x
)
[inline]
template<typename _Tp>
complex <_Tp> operator-
(
const _Tp &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator-
(
const complex < _Tp > &
__x ,
const _Tp &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator-
(
const complex < _Tp > &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator/
(
const _Tp &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator/
(
const complex < _Tp > &
__x ,
const _Tp &
__y
)
[inline]
template<typename _Tp>
complex <_Tp> operator/
(
const complex < _Tp > &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator<
(
const slist < _Tp, _Alloc > &
_SL1 ,
const slist < _Tp, _Alloc > &
_SL2
)
[inline]
template<class _CharT, class _Alloc>
bool operator<
(
const rope < _CharT, _Alloc > &
__left ,
const rope < _CharT, _Alloc > &
__right
)
template<class _CharT, class _Alloc>
bool std::operator<
(
const _Rope_iterator < _CharT, _Alloc > &
__x ,
const _Rope_iterator < _CharT, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator<
(
const vector < _Tp, _Alloc > &
__x ,
const vector < _Tp, _Alloc > &
__y
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
bool operator<
(
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__x ,
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Seq>
bool std::operator<
(
const stack < _Tp, _Seq > &
__x ,
const stack < _Tp, _Seq > &
__y
)
template<class _Key, class _Compare, class _Alloc>
bool std::operator<
(
const set < _Key, _Compare, _Alloc > &
__x ,
const set < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Sequence>
bool operator<
(
const queue < _Tp, _Sequence > &
__x ,
const queue < _Tp, _Sequence > &
__y
)
template<class _Tp, class _Seq>
bool operator<
(
const queue < _Tp, _Seq > &
,
const queue < _Tp, _Seq > &
)
[inline]
template<class _T1, class _T2>
bool operator<
(
const pair < _T1, _T2 > &
__x ,
const pair < _T1, _T2 > &
__y
)
[inline]
...put link to onlinedocs here...
Definition at line 100 of file stl_pair.h .
template<class _Key, class _Compare, class _Alloc>
bool std::operator<
(
const multiset < _Key, _Compare, _Alloc > &
__x ,
const multiset < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool std::operator<
(
const multimap < _Key, _Tp, _Compare, _Alloc > &
__x ,
const multimap < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator<
(
const map < _Key, _Tp, _Compare, _Alloc > &
__x ,
const map < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator<
(
const list < _Tp, _Alloc > &
__x ,
const list < _Tp, _Alloc > &
__y
)
[inline]
template<typename _IteratorL, typename _IteratorR, typename _Container>
bool operator<
(
const __normal_iterator < _IteratorL, _Container > &
__lhs ,
const __normal_iterator < _IteratorR, _Container > &
__rhs
)
[inline]
template<class _Tp, class _Alloc>
bool operator<
(
const deque < _Tp, _Alloc > &
__x ,
const deque < _Tp, _Alloc > &
__y
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator<
(
const _CharT *
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator<
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const _CharT *
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator<
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<class _CharT, class _Traits, class _Alloc>
basic_ostream < _CharT, _Traits > & std::operator<<
(
basic_ostream < _CharT, _Traits > &
__o ,
const rope < _CharT, _Alloc > &
__r
)
template<class _Traits>
basic_ostream <char, _Traits>& operator<<
(
basic_ostream < char, _Traits > &
__out ,
const unsigned char *
__s
)
template<class _Traits>
basic_ostream <char, _Traits>& operator<<
(
basic_ostream < char, _Traits > &
__out ,
const signed char *
__s
)
template<typename _CharT, typename _Traits>
basic_ostream <_CharT, _Traits>& operator<<
(
basic_ostream < _CharT, _Traits > &
__out ,
const char *
__s
)
template<typename _CharT, typename _Traits>
basic_ostream <_CharT, _Traits>& operator<<
(
basic_ostream < _CharT, _Traits > &
__out ,
const _CharT *
__s
)
template<typename _CharT, typename _Traits>
basic_ostream <_CharT, _Traits>& operator<<
(
basic_ostream < _CharT, _Traits > &
__out ,
char
__c
)
template<typename _CharT, typename _Traits>
basic_ostream <_CharT, _Traits>& operator<<
(
basic_ostream < _CharT, _Traits > &
__out ,
_CharT
__c
)
template<typename _Tp, typename _CharT, class _Traits>
basic_ostream <_CharT, _Traits>& operator<<
(
basic_ostream < _CharT, _Traits > &
__os ,
const complex < _Tp > &
__x
)
template<class _CharT, class _Traits, size_t _Nb>
basic_ostream <_CharT, _Traits>& operator<<
(
basic_ostream < _CharT, _Traits > &
__os ,
const bitset < _Nb > &
__x
)
template<typename _CharT, typename _Traits, typename _Alloc>
basic_ostream <_CharT, _Traits>& operator<<
(
basic_ostream < _CharT, _Traits > &
__os ,
const basic_string < _CharT, _Traits, _Alloc > &
__str
)
template<class _Tp, class _Alloc>
bool operator<=
(
const slist < _Tp, _Alloc > &
_SL1 ,
const slist < _Tp, _Alloc > &
_SL2
)
[inline]
template<class _CharT, class _Alloc>
bool operator<=
(
const rope < _CharT, _Alloc > &
__x ,
const rope < _CharT, _Alloc > &
__y
)
[inline]
template<class _CharT, class _Alloc>
bool operator<=
(
const _Rope_iterator < _CharT, _Alloc > &
__x ,
const _Rope_iterator < _CharT, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator<=
(
const vector < _Tp, _Alloc > &
__x ,
const vector < _Tp, _Alloc > &
__y
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
bool operator<=
(
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__x ,
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Seq>
bool operator<=
(
const stack < _Tp, _Seq > &
__x ,
const stack < _Tp, _Seq > &
__y
)
template<class _Key, class _Compare, class _Alloc>
bool operator<=
(
const set < _Key, _Compare, _Alloc > &
__x ,
const set < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Sequence>
bool operator<=
(
const queue < _Tp, _Sequence > &
__x ,
const queue < _Tp, _Sequence > &
__y
)
template<class _T1, class _T2>
bool operator<=
(
const pair < _T1, _T2 > &
__x ,
const pair < _T1, _T2 > &
__y
)
[inline]
Uses operator<
to find the result.
Definition at line 120 of file stl_pair.h .
template<class _Key, class _Compare, class _Alloc>
bool operator<=
(
const multiset < _Key, _Compare, _Alloc > &
__x ,
const multiset < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator<=
(
const multimap < _Key, _Tp, _Compare, _Alloc > &
__x ,
const multimap < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator<=
(
const map < _Key, _Tp, _Compare, _Alloc > &
__x ,
const map < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator<=
(
const list < _Tp, _Alloc > &
__x ,
const list < _Tp, _Alloc > &
__y
)
[inline]
template<typename _IteratorL, typename _IteratorR, typename _Container>
bool operator<=
(
const __normal_iterator < _IteratorL, _Container > &
__lhs ,
const __normal_iterator < _IteratorR, _Container > &
__rhs
)
[inline]
template<class _Tp, class _Alloc>
bool operator<=
(
const deque < _Tp, _Alloc > &
__x ,
const deque < _Tp, _Alloc > &
__y
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator<=
(
const _CharT *
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator<=
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const _CharT *
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator<=
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<class _Tp, class _Alloc>
bool operator==
(
const slist < _Tp, _Alloc > &
_SL1 ,
const slist < _Tp, _Alloc > &
_SL2
)
[inline]
template<class _Val, class _HashFcn, class _EqualKey, class _Alloc>
bool std::operator==
(
const hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &
__hs1 ,
const hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &
__hs2
)
[inline]
template<class _Value, class _HashFcn, class _EqualKey, class _Alloc>
bool std::operator==
(
const hash_set < _Value, _HashFcn, _EqualKey, _Alloc > &
__hs1 ,
const hash_set < _Value, _HashFcn, _EqualKey, _Alloc > &
__hs2
)
[inline]
template<class _Key, class _Tp, class _HF, class _EqKey, class _Alloc>
bool std::operator==
(
const hash_multimap < _Key, _Tp, _HF, _EqKey, _Alloc > &
__hm1 ,
const hash_multimap < _Key, _Tp, _HF, _EqKey, _Alloc > &
__hm2
)
[inline]
template<class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
bool operator==
(
const hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &
__hm1 ,
const hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &
__hm2
)
[inline]
template<class _Key, class _Tp, class _HashFn, class _EqKey, class _Alloc>
bool operator==
(
const hash_map < _Key, _Tp, _HashFn, _EqKey, _Alloc > &
,
const hash_map < _Key, _Tp, _HashFn, _EqKey, _Alloc > &
)
[inline]
template bool operator==
(
const S::const_iterator &
,
const S::const_iterator &
)
template bool operator==
(
const S::iterator &
,
const S::iterator &
)
template<class _CharT, class _Alloc>
bool operator==
(
const rope < _CharT, _Alloc > &
__left ,
const rope < _CharT, _Alloc > &
__right
)
template<class _CharT, class _Alloc>
bool std::operator==
(
const _Rope_iterator < _CharT, _Alloc > &
__x ,
const _Rope_iterator < _CharT, _Alloc > &
__y
)
[inline]
template<class _Val, class _Key, class _HF, class _Ex, class _Eq, class _All>
bool std::operator==
(
const hashtable < _Val, _Key, _HF, _Ex, _Eq, _All > &
__ht1 ,
const hashtable < _Val, _Key, _HF, _Ex, _Eq, _All > &
__ht2
)
template<class _Tp, class _Alloc>
bool operator==
(
const vector < _Tp, _Alloc > &
__x ,
const vector < _Tp, _Alloc > &
__y
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
bool operator==
(
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__x ,
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__y
)
[inline]
Definition at line 749 of file stl_tree.h .
References std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::begin (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::end (), equal (), and std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::size ().
template<class _Value>
bool operator==
(
const _Rb_tree_iterator < _Value, _Value &, _Value * > &
__x ,
const _Rb_tree_iterator < _Value, const _Value &, const _Value * > &
__y
)
[inline]
template<class _Value>
bool operator==
(
const _Rb_tree_iterator < _Value, const _Value &, const _Value * > &
__x ,
const _Rb_tree_iterator < _Value, _Value &, _Value * > &
__y
)
[inline]
template<class _Value, class _Ref, class _Ptr>
bool operator==
(
const _Rb_tree_iterator < _Value, _Ref, _Ptr > &
__x ,
const _Rb_tree_iterator < _Value, _Ref, _Ptr > &
__y
)
[inline]
template<class _Tp, class _Seq>
bool std::operator==
(
const stack < _Tp, _Seq > &
__x ,
const stack < _Tp, _Seq > &
__y
)
template<class _Key, class _Compare, class _Alloc>
bool std::operator==
(
const set < _Key, _Compare, _Alloc > &
__x ,
const set < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Sequence>
bool operator==
(
const queue < _Tp, _Sequence > &
__x ,
const queue < _Tp, _Sequence > &
__y
)
template<class _Tp, class _Seq>
bool operator==
(
const queue < _Tp, _Seq > &
,
const queue < _Tp, _Seq > &
)
[inline]
template<class _T1, class _T2>
bool operator==
(
const pair < _T1, _T2 > &
__x ,
const pair < _T1, _T2 > &
__y
)
[inline]
template<class _Key, class _Compare, class _Alloc>
bool std::operator==
(
const multiset < _Key, _Compare, _Alloc > &
__x ,
const multiset < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool std::operator==
(
const multimap < _Key, _Tp, _Compare, _Alloc > &
__x ,
const multimap < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator==
(
const map < _Key, _Tp, _Compare, _Alloc > &
__x ,
const map < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator==
(
const list < _Tp, _Alloc > &
__x ,
const list < _Tp, _Alloc > &
__y
)
[inline]
template<typename _IteratorL, typename _IteratorR, typename _Container>
bool operator==
(
const __normal_iterator < _IteratorL, _Container > &
__lhs ,
const __normal_iterator < _IteratorR, _Container > &
__rhs
)
[inline]
template<class _Tp, class _CharT, class _Traits, class _Dist>
bool operator==
(
const istream_iterator < _Tp, _CharT, _Traits, _Dist > &
__x ,
const istream_iterator < _Tp, _CharT, _Traits, _Dist > &
__y
)
[inline]
template<class _BiIter, class _Tp, class _Ref, class _Distance>
bool operator==
(
const reverse_bidirectional_iterator < _BiIter, _Tp, _Ref, _Distance > &
__x ,
const reverse_bidirectional_iterator < _BiIter, _Tp, _Ref, _Distance > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator==
(
const deque < _Tp, _Alloc > &
__x ,
const deque < _Tp, _Alloc > &
__y
)
[inline]
template<class _Alloc>
bool operator==
(
const debug_alloc < _Alloc > &
,
const debug_alloc < _Alloc > &
)
[inline]
template<class _Tp, class _Alloc>
bool operator==
(
const __allocator < _Tp, _Alloc > &
__a1 ,
const __allocator < _Tp, _Alloc > &
__a2
)
[inline]
template<class _T1, class _T2>
bool operator==
(
const allocator < _T1 > &
,
const allocator < _T2 > &
)
[inline]
template<typename _Tp>
bool operator==
(
const _Tp &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _Tp>
bool operator==
(
const complex < _Tp > &
__x ,
const _Tp &
__y
)
[inline]
template<typename _Tp>
bool operator==
(
const complex < _Tp > &
__x ,
const complex < _Tp > &
__y
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator==
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const _CharT *
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator==
(
const _CharT *
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator==
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<class _Tp, class _Alloc>
bool operator>
(
const slist < _Tp, _Alloc > &
_SL1 ,
const slist < _Tp, _Alloc > &
_SL2
)
[inline]
template<class _CharT, class _Alloc>
bool operator>
(
const rope < _CharT, _Alloc > &
__x ,
const rope < _CharT, _Alloc > &
__y
)
[inline]
template<class _CharT, class _Alloc>
bool operator>
(
const _Rope_iterator < _CharT, _Alloc > &
__x ,
const _Rope_iterator < _CharT, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator>
(
const vector < _Tp, _Alloc > &
__x ,
const vector < _Tp, _Alloc > &
__y
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
bool operator>
(
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__x ,
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Seq>
bool operator>
(
const stack < _Tp, _Seq > &
__x ,
const stack < _Tp, _Seq > &
__y
)
template<class _Key, class _Compare, class _Alloc>
bool operator>
(
const set < _Key, _Compare, _Alloc > &
__x ,
const set < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Sequence>
bool operator>
(
const queue < _Tp, _Sequence > &
__x ,
const queue < _Tp, _Sequence > &
__y
)
template<class _T1, class _T2>
bool operator>
(
const pair < _T1, _T2 > &
__x ,
const pair < _T1, _T2 > &
__y
)
[inline]
Uses operator<
to find the result.
Definition at line 114 of file stl_pair.h .
template<class _Key, class _Compare, class _Alloc>
bool operator>
(
const multiset < _Key, _Compare, _Alloc > &
__x ,
const multiset < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator>
(
const multimap < _Key, _Tp, _Compare, _Alloc > &
__x ,
const multimap < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator>
(
const map < _Key, _Tp, _Compare, _Alloc > &
__x ,
const map < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator>
(
const list < _Tp, _Alloc > &
__x ,
const list < _Tp, _Alloc > &
__y
)
[inline]
template<typename _IteratorL, typename _IteratorR, typename _Container>
bool operator>
(
const __normal_iterator < _IteratorL, _Container > &
__lhs ,
const __normal_iterator < _IteratorR, _Container > &
__rhs
)
[inline]
template<class _Tp, class _Alloc>
bool operator>
(
const deque < _Tp, _Alloc > &
__x ,
const deque < _Tp, _Alloc > &
__y
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator>
(
const _CharT *
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator>
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const _CharT *
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator>
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<class _Tp, class _Alloc>
bool operator>=
(
const slist < _Tp, _Alloc > &
_SL1 ,
const slist < _Tp, _Alloc > &
_SL2
)
[inline]
template<class _CharT, class _Alloc>
bool operator>=
(
const rope < _CharT, _Alloc > &
__x ,
const rope < _CharT, _Alloc > &
__y
)
[inline]
template<class _CharT, class _Alloc>
bool operator>=
(
const _Rope_iterator < _CharT, _Alloc > &
__x ,
const _Rope_iterator < _CharT, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator>=
(
const vector < _Tp, _Alloc > &
__x ,
const vector < _Tp, _Alloc > &
__y
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
bool operator>=
(
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__x ,
const _Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Seq>
bool operator>=
(
const stack < _Tp, _Seq > &
__x ,
const stack < _Tp, _Seq > &
__y
)
template<class _Key, class _Compare, class _Alloc>
bool operator>=
(
const set < _Key, _Compare, _Alloc > &
__x ,
const set < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Sequence>
bool operator>=
(
const queue < _Tp, _Sequence > &
__x ,
const queue < _Tp, _Sequence > &
__y
)
template<class _T1, class _T2>
bool operator>=
(
const pair < _T1, _T2 > &
__x ,
const pair < _T1, _T2 > &
__y
)
[inline]
Uses operator<
to find the result.
Definition at line 126 of file stl_pair.h .
template<class _Key, class _Compare, class _Alloc>
bool operator>=
(
const multiset < _Key, _Compare, _Alloc > &
__x ,
const multiset < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator>=
(
const multimap < _Key, _Tp, _Compare, _Alloc > &
__x ,
const multimap < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
bool operator>=
(
const map < _Key, _Tp, _Compare, _Alloc > &
__x ,
const map < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
bool operator>=
(
const list < _Tp, _Alloc > &
__x ,
const list < _Tp, _Alloc > &
__y
)
[inline]
template<typename _IteratorL, typename _IteratorR, typename _Container>
bool operator>=
(
const __normal_iterator < _IteratorL, _Container > &
__lhs ,
const __normal_iterator < _IteratorR, _Container > &
__rhs
)
[inline]
template<class _Tp, class _Alloc>
bool operator>=
(
const deque < _Tp, _Alloc > &
__x ,
const deque < _Tp, _Alloc > &
__y
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator>=
(
const _CharT *
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator>=
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const _CharT *
__rhs
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
bool operator>=
(
const basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
const basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
Definition at line 752 of file std_bitset.h .
References std::bitset< _Nb >::_M_copy_from_string (), std::basic_string< _CharT, _Traits, _Alloc >::empty (), std::basic_ios< _CharT, _Traits >::narrow (), std::basic_string< _CharT, _Traits, _Alloc >::push_back (), std::basic_ios< _CharT, _Traits >::rdbuf (), std::basic_string< _CharT, _Traits, _Alloc >::reserve (), std::basic_streambuf< _CharT, _Traits >::sbumpc (), std::basic_ios< _CharT, _Traits >::setstate (), and std::basic_streambuf< _CharT, _Traits >::sputbackc ().
template<typename _CharT, typename _Traits>
basic_istream < _CharT, _Traits > & std::operator>>
(
basic_istream < _CharT, _Traits > &
__in ,
_CharT *
__s
)
template<typename _CharT, typename _Traits>
basic_istream < _CharT, _Traits > & std::operator>>
(
basic_istream < _CharT, _Traits > &
__in ,
_CharT &
__c
)
template<typename _CharT, typename _Traits, typename _Alloc>
basic_istream < _CharT, _Traits > & std::operator>>
(
basic_istream < _CharT, _Traits > &
__is ,
basic_string < _CharT, _Traits, _Alloc > &
__str
)
Definition at line 1138 of file istream.tcc .
References std::basic_ios< _CharT, _Traits >::_M_get_fctype_ios (), std::basic_string< _CharT, _Traits, _Alloc >::erase (), std::basic_string< _CharT, _Traits, _Alloc >::max_size (), std::basic_ios< _CharT, _Traits >::rdbuf (), std::basic_ios< _CharT, _Traits >::setstate (), and std::ios_base::width ().
template<size_t _Nb>
bitset <_Nb> operator^
(
const bitset < _Nb > &
__x ,
const bitset < _Nb > &
__y
)
[inline]
template<size_t _Nb>
bitset <_Nb> operator|
(
const bitset < _Nb > &
__x ,
const bitset < _Nb > &
__y
)
[inline]
template<class _RandomAccessIter, class _Compare>
void partial_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__middle ,
_RandomAccessIter
__last ,
_Compare
__comp
)
[inline]
template<class _RandomAccessIter>
void partial_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__middle ,
_RandomAccessIter
__last
)
[inline]
template<class _InputIter, class _RandomAccessIter, class _Compare>
_RandomAccessIter partial_sort_copy
(
_InputIter
__first ,
_InputIter
__last ,
_RandomAccessIter
__result_first ,
_RandomAccessIter
__result_last ,
_Compare
__comp
)
[inline]
template<class _InputIter, class _RandomAccessIter>
_RandomAccessIter partial_sort_copy
(
_InputIter
__first ,
_InputIter
__last ,
_RandomAccessIter
__result_first ,
_RandomAccessIter
__result_last
)
[inline]
template<class _InputIterator, class _OutputIterator, class _BinaryOperation>
_OutputIterator partial_sum
(
_InputIterator
__first ,
_InputIterator
__last ,
_OutputIterator
__result ,
_BinaryOperation
__binary_op
)
template<class _InputIterator, class _OutputIterator>
_OutputIterator partial_sum
(
_InputIterator
__first ,
_InputIterator
__last ,
_OutputIterator
__result
)
template<class _ForwardIter, class _Predicate>
_ForwardIter partition
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Predicate
__pred
)
[inline]
template<typename _Tp>
complex < _Tp > std::polar
(
const _Tp &
,
const _Tp &
)
[inline]
template<class _RandomAccessIterator, class _Compare>
void pop_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Compare
__comp
)
[inline]
template<class _RandomAccessIterator>
void pop_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last
)
[inline]
long double pow
(
long double
__x ,
int
__n
)
[inline]
double pow
(
double
__x ,
int
__i
)
[inline]
float pow
(
float
__x ,
int
__n
)
[inline]
long double pow
(
long double
__x ,
long double
__y
)
[inline]
float pow
(
float
__x ,
float
__y
)
[inline]
template<typename _Tp>
complex < _Tp > std::pow
(
const _Tp &
,
const complex < _Tp > &
)
[inline]
template<typename _Tp>
complex < _Tp > std::pow
(
const complex < _Tp > &
,
const complex < _Tp > &
)
[inline]
template<typename _Tp>
complex < _Tp > std::pow
(
const complex < _Tp > &
,
const _Tp &
)
[inline]
template<typename _Tp>
complex < _Tp > std::pow
(
const complex < _Tp > &
,
int
)
[inline]
template<class _Tp, class _Integer>
_Tp power
(
_Tp
__x ,
_Integer
__n
)
[inline]
template<class _Tp, class _Integer, class _MonoidOperation>
_Tp power
(
_Tp
__x ,
_Integer
__n ,
_MonoidOperation
__monoid_op
)
[inline]
template<class _BidirectionalIter, class _Compare>
bool prev_permutation
(
_BidirectionalIter
__first ,
_BidirectionalIter
__last ,
_Compare
__comp
)
template<class _BidirectionalIter>
bool prev_permutation
(
_BidirectionalIter
__first ,
_BidirectionalIter
__last
)
template<class _Arg1, class _Arg2, class _Result>
pointer_to_binary_function <_Arg1,_Arg2,_Result> ptr_fun
(
_Result(*
__x )(_Arg1, _Arg2)
)
[inline]
template<class _RandomAccessIterator, class _Compare>
void push_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Compare
__comp
)
[inline]
template<class _RandomAccessIterator>
void push_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last
)
[inline]
template<class _InputIter, class _RandomAccessIter, class _RandomNumberGenerator>
_RandomAccessIter random_sample
(
_InputIter
__first ,
_InputIter
__last ,
_RandomAccessIter
__out_first ,
_RandomAccessIter
__out_last ,
_RandomNumberGenerator &
__rand
)
[inline]
template<class _InputIter, class _RandomAccessIter>
_RandomAccessIter random_sample
(
_InputIter
__first ,
_InputIter
__last ,
_RandomAccessIter
__out_first ,
_RandomAccessIter
__out_last
)
[inline]
template<class _ForwardIter, class _OutputIter, class _Distance, class _RandomNumberGenerator>
_OutputIter random_sample_n
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_OutputIter
__out ,
const _Distance
__n ,
_RandomNumberGenerator &
__rand
)
template<class _ForwardIter, class _OutputIter, class _Distance>
_OutputIter random_sample_n
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_OutputIter
__out ,
const _Distance
__n
)
template<class _RandomAccessIter, class _RandomNumberGenerator>
void random_shuffle
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_RandomNumberGenerator &
__rand
)
template<class _RandomAccessIter>
void random_shuffle
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last
)
[inline]
template<typename _Tp>
_Tp real
(
const complex < _Tp > &
__z
)
[inline]
template<class _ForwardIter, class _Tp>
_ForwardIter remove
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__value
)
template<class _InputIter, class _OutputIter, class _Tp>
_OutputIter remove_copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
const _Tp &
__value
)
template<class _InputIter, class _OutputIter, class _Predicate>
_OutputIter remove_copy_if
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
_Predicate
__pred
)
template<class _ForwardIter, class _Predicate>
_ForwardIter remove_if
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Predicate
__pred
)
template<class _ForwardIter, class _Tp>
void replace
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__old_value ,
const _Tp &
__new_value
)
template<class _InputIter, class _OutputIter, class _Tp>
_OutputIter replace_copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
const _Tp &
__old_value ,
const _Tp &
__new_value
)
template<class _InputIter, class _OutputIter, class _Predicate, class _Tp>
_OutputIter replace_copy_if
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
_Predicate
__pred ,
const _Tp &
__new_value
)
template<class _ForwardIter, class _Predicate, class _Tp>
void replace_if
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Predicate
__pred ,
const _Tp &
__new_value
)
template<class _Tp>
void return_temporary_buffer
(
_Tp *
__p
)
template<class _BidirectionalIter>
void reverse
(
_BidirectionalIter
__first ,
_BidirectionalIter
__last
)
[inline]
template<class _BidirectionalIter, class _OutputIter>
_OutputIter reverse_copy
(
_BidirectionalIter
__first ,
_BidirectionalIter
__last ,
_OutputIter
__result
)
template<class _ForwardIter>
_ForwardIter rotate
(
_ForwardIter
__first ,
_ForwardIter
__middle ,
_ForwardIter
__last
)
[inline]
template<class _ForwardIter, class _OutputIter>
_OutputIter rotate_copy
(
_ForwardIter
__first ,
_ForwardIter
__middle ,
_ForwardIter
__last ,
_OutputIter
__result
)
template<class _ForwardIter1, class _ForwardIter2, class _BinaryPred>
_ForwardIter1 search
(
_ForwardIter1
__first1 ,
_ForwardIter1
__last1 ,
_ForwardIter2
__first2 ,
_ForwardIter2
__last2 ,
_BinaryPred
__predicate
)
template<class _ForwardIter1, class _ForwardIter2>
_ForwardIter1 search
(
_ForwardIter1
__first1 ,
_ForwardIter1
__last1 ,
_ForwardIter2
__first2 ,
_ForwardIter2
__last2
)
template<class _ForwardIter, class _Integer, class _Tp, class _BinaryPred>
_ForwardIter search_n
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Integer
__count ,
const _Tp &
__val ,
_BinaryPred
__binary_pred
)
template<class _ForwardIter, class _Integer, class _Tp>
_ForwardIter search_n
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Integer
__count ,
const _Tp &
__val
)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare>
_OutputIter set_difference
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result ,
_Compare
__comp
)
template<class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter set_difference
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result
)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare>
_OutputIter set_intersection
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result ,
_Compare
__comp
)
template<class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter set_intersection
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result
)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare>
_OutputIter set_symmetric_difference
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result ,
_Compare
__comp
)
template<class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter set_symmetric_difference
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result
)
template<class _InputIter1, class _InputIter2, class _OutputIter, class _Compare>
_OutputIter set_union
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result ,
_Compare
__comp
)
template<class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter set_union
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_InputIter2
__last2 ,
_OutputIter
__result
)
_Setbase setbase
(
int
__base
)
[inline]
template<class _CharT>
_Setfill <_CharT> setfill
(
_CharT
__c
)
_Setw setw
(
int
__n
)
[inline]
long double sin
(
long double
__x
)
[inline]
float sin
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::sin
(
const complex < _Tp > &
)
[inline]
long double sinh
(
long double
__x
)
[inline]
float sinh
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::sinh
(
const complex < _Tp > &
)
[inline]
template<class _RandomAccessIter, class _Compare>
void sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Compare
__comp
)
[inline]
template<class _RandomAccessIter>
void sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last
)
[inline]
template<class _RandomAccessIterator, class _Compare>
void sort_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last ,
_Compare
__comp
)
template<class _RandomAccessIterator>
void sort_heap
(
_RandomAccessIterator
__first ,
_RandomAccessIterator
__last
)
long double sqrt
(
long double
__x
)
[inline]
float sqrt
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::sqrt
(
const complex < _Tp > &
)
template<class _ForwardIter, class _Predicate>
_ForwardIter stable_partition
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_Predicate
__pred
)
[inline]
template<class _RandomAccessIter, class _Compare>
void stable_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last ,
_Compare
__comp
)
[inline]
template<class _RandomAccessIter>
void stable_sort
(
_RandomAccessIter
__first ,
_RandomAccessIter
__last
)
[inline]
char* strchr
(
char *
__s1 ,
int
__n
)
[inline]
char* strpbrk
(
char *
__s1 ,
const char *
__s2
)
[inline]
char* strrchr
(
char *
__s1 ,
int
__n
)
[inline]
char* strstr
(
char *
__s1 ,
const char *
__s2
)
[inline]
template<class _Tp, class _Alloc>
void swap
(
slist < _Tp, _Alloc > &
__x ,
slist < _Tp, _Alloc > &
__y
)
[inline]
template<class _Val, class _HashFcn, class _EqualKey, class _Alloc>
void swap
(
hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &
__hs1 ,
hash_multiset < _Val, _HashFcn, _EqualKey, _Alloc > &
__hs2
)
[inline]
template<class _Val, class _HashFcn, class _EqualKey, class _Alloc>
void swap
(
hash_set < _Val, _HashFcn, _EqualKey, _Alloc > &
__hs1 ,
hash_set < _Val, _HashFcn, _EqualKey, _Alloc > &
__hs2
)
[inline]
template<class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
void swap
(
hash_multimap < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &
__hm1 ,
hash_multimap < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &
__hm2
)
[inline]
template<class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
void swap
(
hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &
__hm1 ,
hash_map < _Key, _Tp, _HashFcn, _EqlKey, _Alloc > &
__hm2
)
[inline]
template<class _CharT, class _Alloc>
void swap
(
rope < _CharT, _Alloc > &
__x ,
rope < _CharT, _Alloc > &
__y
)
[inline]
template<class _Val, class _Key, class _HF, class _Extract, class _EqKey, class _All>
void swap
(
hashtable < _Val, _Key, _HF, _Extract, _EqKey, _All > &
__ht1 ,
hashtable < _Val, _Key, _HF, _Extract, _EqKey, _All > &
__ht2
)
[inline]
template<class _Tp, class _Alloc>
void swap
(
vector < _Tp, _Alloc > &
__x ,
vector < _Tp, _Alloc > &
__y
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
void swap
(
_Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__x ,
_Rb_tree < _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Compare, class _Alloc>
void swap
(
set < _Key, _Compare, _Alloc > &
__x ,
set < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Compare, class _Alloc>
void swap
(
multiset < _Key, _Compare, _Alloc > &
__x ,
multiset < _Key, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
void swap
(
multimap < _Key, _Tp, _Compare, _Alloc > &
__x ,
multimap < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Key, class _Tp, class _Compare, class _Alloc>
void swap
(
map < _Key, _Tp, _Compare, _Alloc > &
__x ,
map < _Key, _Tp, _Compare, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
void swap
(
list < _Tp, _Alloc > &
__x ,
list < _Tp, _Alloc > &
__y
)
[inline]
template<class _Tp, class _Alloc>
void swap
(
deque < _Tp, _Alloc > &
__x ,
deque < _Tp, _Alloc > &
__y
)
[inline]
template<class _Tp>
void swap
(
_Tp &
__a ,
_Tp &
__b
)
[inline]
template<typename _CharT, typename _Traits, typename _Alloc>
void swap
(
basic_string < _CharT, _Traits, _Alloc > &
__lhs ,
basic_string < _CharT, _Traits, _Alloc > &
__rhs
)
[inline]
Definition at line 1020 of file basic_string.h .
References std::basic_string< _CharT, _Traits, _Alloc >::swap ().
Referenced by __List_base_reverse (), __partition (), __rotate (), _Rb_tree_rebalance_for_erase (), std::vector< _Node *, _Alloc >::swap (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::swap (), std::list< _Tp, _Alloc >::swap (), std::hashtable< _Value, _Value, _HashFcn, _Identity< _Value >, _EqualKey, _Alloc >::swap (), std::vector< bool, _Alloc >::swap (), and std::slist< _Tp, _Alloc >::swap ().
template<class _ForwardIter1, class _ForwardIter2>
_ForwardIter2 swap_ranges
(
_ForwardIter1
__first1 ,
_ForwardIter1
__last1 ,
_ForwardIter2
__first2
)
long double tan
(
long double
__x
)
[inline]
float tan
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::tan
(
const complex < _Tp > &
)
[inline]
long double tanh
(
long double
__x
)
[inline]
float tanh
(
float
__x
)
[inline]
template<typename _Tp>
complex < _Tp > std::tanh
(
const complex < _Tp > &
)
[inline]
template<typename _CharT>
_CharT std::tolower
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<typename _CharT>
_CharT std::toupper
(
_CharT
__c ,
const locale &
__loc
)
[inline]
template<class _InputIter1, class _InputIter2, class _OutputIter, class _BinaryOperation>
_OutputIter transform
(
_InputIter1
__first1 ,
_InputIter1
__last1 ,
_InputIter2
__first2 ,
_OutputIter
__result ,
_BinaryOperation
__binary_op
)
template<class _InputIter, class _OutputIter, class _UnaryOperation>
_OutputIter transform
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
_UnaryOperation
__unary_op
)
bool std::uncaught_exception
(
)
throw ()
wchar_t* uninitialized_copy
(
const wchar_t *
__first ,
const wchar_t *
__last ,
wchar_t *
__result
)
[inline]
char* uninitialized_copy
(
const char *
__first ,
const char *
__last ,
char *
__result
)
[inline]
template<class _InputIter, class _ForwardIter>
_ForwardIter uninitialized_copy
(
_InputIter
__first ,
_InputIter
__last ,
_ForwardIter
__result
)
[inline]
Definition at line 108 of file stl_uninitialized.h .
References __uninitialized_copy (), and __value_type ().
Referenced by __uninitialized_copy_copy (), __uninitialized_copy_fill (), __uninitialized_copy_n (), __uninitialized_fill_copy (), std::vector< _Node *, _Alloc >::_M_allocate_and_copy (), std::vector< _Tp, _Alloc >::_M_assign_aux (), std::vector< _Tp, _Alloc >::_M_fill_insert (), std::vector< _Tp, _Alloc >::_M_insert_aux (), std::deque< _Tp, _Alloc >::_M_insert_aux (), std::vector< _Node *, _Alloc >::_M_range_initialize (), std::deque< _Tp, _Alloc >::_M_range_initialize (), std::vector< _Tp, _Alloc >::_M_range_insert (), std::deque< _Tp, _Alloc >::deque (), std::deque< _Tp, _Alloc >::insert (), std::vector< _Tp, _Alloc >::operator= (), and std::vector< _Node *, _Alloc >::vector ().
template<class _InputIter, class _Size, class _ForwardIter>
pair <_InputIter, _ForwardIter> uninitialized_copy_n
(
_InputIter
__first ,
_Size
__count ,
_ForwardIter
__result
)
[inline]
template<class _ForwardIter, class _Tp>
void uninitialized_fill
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__x
)
[inline]
template<class _ForwardIter, class _Size, class _Tp>
_ForwardIter uninitialized_fill_n
(
_ForwardIter
__first ,
_Size
__n ,
const _Tp &
__x
)
[inline]
Definition at line 247 of file stl_uninitialized.h .
References __uninitialized_fill_n (), and __value_type ().
Referenced by std::vector< _Tp, _Alloc >::_M_fill_insert (), std::vector< _Node *, _Alloc >::_M_initialize_aux (), std::_Temporary_buffer< _ForwardIterator, _Tp >::_M_initialize_buffer (), std::rope< _CharT, _Alloc >::rope (), and std::vector< _Node *, _Alloc >::vector ().
template<class _ForwardIter, class _BinaryPredicate>
_ForwardIter unique
(
_ForwardIter
__first ,
_ForwardIter
__last ,
_BinaryPredicate
__binary_pred
)
template<class _ForwardIter>
_ForwardIter unique
(
_ForwardIter
__first ,
_ForwardIter
__last
)
template<class _InputIter, class _OutputIter, class _BinaryPredicate>
_OutputIter unique_copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result ,
_BinaryPredicate
__binary_pred
)
[inline]
template<class _InputIter, class _OutputIter>
_OutputIter unique_copy
(
_InputIter
__first ,
_InputIter
__last ,
_OutputIter
__result
)
[inline]
template<class _ForwardIter, class _Tp, class _Compare>
_ForwardIter upper_bound
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val ,
_Compare
__comp
)
[inline]
template<class _ForwardIter, class _Tp>
_ForwardIter upper_bound
(
_ForwardIter
__first ,
_ForwardIter
__last ,
const _Tp &
__val
)
[inline]
template<typename _Facet>
const _Facet & std::use_facet
(
const locale &
__loc
)
template<>
const ctype < char > & std::use_facet< ctype < char > >
(
const locale &
__loc
)
template<class _Iter>
iterator_traits <_Iter>::value_type* value_type
(
const _Iter &
__i
)
[inline]
template<typename _CharT, typename _Traits>
basic_istream < _CharT, _Traits > & std::ws
(
basic_istream < _CharT, _Traits > &
__is
)
Variable Documentation
template class std::__codecvt_abstract_base< char, char, mbstate_t >
template class std::__codecvt_abstract_base< wchar_t, char, mbstate_t >
void(* std::__malloc_alloc_template)() = 0
const int std::__stl_chunk_size = 7
const unsigned long std::__stl_prime_list[__stl_num_primes] [static]
Initial value:
{
53ul, 97ul, 193ul, 389ul, 769ul,
1543ul, 3079ul, 6151ul, 12289ul, 24593ul,
49157ul, 98317ul, 196613ul, 393241ul, 786433ul,
1572869ul, 3145739ul, 6291469ul, 12582917ul, 25165843ul,
50331653ul, 100663319ul, 201326611ul, 402653189ul, 805306457ul,
1610612741ul, 3221225473ul, 4294967291ul
}
Definition at line 176 of file stl_hashtable.h .
Referenced by __stl_next_prime (), and std::hashtable< _Value, _Value, _HashFcn, _Identity< _Value >, _EqualKey, _Alloc >::max_bucket_count ().
const int std::__stl_threshold = 16
const int std::__WORD_BIT = int(CHAR_BIT*sizeof(unsigned int)) [static]
Definition at line 66 of file bits/stl_bvector.h .
Referenced by std::_Bvector_alloc_base< _Allocator, true >::_M_bit_alloc (), std::_Bvector_alloc_base< _Alloc, _Alloc_traits< bool, _Alloc >::_S_instanceless >::_M_bit_alloc (), std::_Bit_iterator_base::_M_bump_down (), std::_Bit_iterator_base::_M_bump_up (), std::vector< bool, _Alloc >::_M_fill_insert (), std::_Bit_iterator_base::_M_incr (), std::vector< bool, _Alloc >::_M_initialize (), std::vector< bool, _Alloc >::_M_insert_aux (), std::vector< bool, _Alloc >::_M_insert_range (), operator- (), and std::vector< bool, _Alloc >::reserve ().
const int std::_M_extract_buffer_length = 32
template class std::_Monthnames< char, int >
Definition at line 94 of file stl_tree.h .
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify (), std::_Rb_tree_base_iterator::_M_decrement (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_M_empty_initialize (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_Rb_tree (), _Rb_tree_rebalance (), and _Rb_tree_rebalance_for_erase ().
template class std::_Weekdaynames< char, int >
template class std::codecvt_byname< char, char, mbstate_t >
Generated on Mon Apr 8 03:16:48 2002 for libstdc++-v3 Source by
1.2.15