libstdc++
|
Namespaces | |
__debug | |
__detail | |
__parallel | |
rel_ops | |
tr1 | |
Typedefs | |
typedef struct std::__atomic_flag_base | __atomic_flag_base |
typedef FILE | __c_file |
typedef __locale_t | __c_locale |
typedef __gthread_mutex_t | __c_lock |
typedef unsigned long | _Bit_type |
typedef atomic_short | atomic_int_fast16_t |
typedef atomic_int | atomic_int_fast32_t |
typedef atomic_llong | atomic_int_fast64_t |
typedef atomic_schar | atomic_int_fast8_t |
typedef atomic_short | atomic_int_least16_t |
typedef atomic_int | atomic_int_least32_t |
typedef atomic_llong | atomic_int_least64_t |
typedef atomic_schar | atomic_int_least8_t |
typedef atomic_llong | atomic_intmax_t |
typedef atomic_long | atomic_intptr_t |
typedef atomic_long | atomic_ptrdiff_t |
typedef atomic_ulong | atomic_size_t |
typedef atomic_long | atomic_ssize_t |
typedef atomic_ushort | atomic_uint_fast16_t |
typedef atomic_uint | atomic_uint_fast32_t |
typedef atomic_ullong | atomic_uint_fast64_t |
typedef atomic_uchar | atomic_uint_fast8_t |
typedef atomic_ushort | atomic_uint_least16_t |
typedef atomic_uint | atomic_uint_least32_t |
typedef atomic_ullong | atomic_uint_least64_t |
typedef atomic_uchar | atomic_uint_least8_t |
typedef atomic_ullong | atomic_uintmax_t |
typedef atomic_ulong | atomic_uintptr_t |
typedef enum std::memory_order | memory_order |
typedef long long | streamoff |
typedef fpos< mbstate_t > | streampos |
typedef ptrdiff_t | streamsize |
typedef basic_string< char > | string |
typedef fpos< mbstate_t > | u16streampos |
typedef basic_string< char16_t > | u16string |
typedef fpos< mbstate_t > | u32streampos |
typedef basic_string< char32_t > | u32string |
typedef fpos< mbstate_t > | wstreampos |
typedef basic_string< wchar_t > | wstring |
Enumerations | |
enum | { _S_threshold } |
enum | { _S_chunk_size } |
enum | { _S_word_bit } |
enum | _Ios_Fmtflags { _S_boolalpha, _S_dec, _S_fixed, _S_hex, _S_internal, _S_left, _S_oct, _S_right, _S_scientific, _S_showbase, _S_showpoint, _S_showpos, _S_skipws, _S_unitbuf, _S_uppercase, _S_adjustfield, _S_basefield, _S_floatfield, _S_ios_fmtflags_end } |
enum | _Ios_Iostate { _S_goodbit, _S_badbit, _S_eofbit, _S_failbit, _S_ios_iostate_end } |
enum | _Ios_Openmode { _S_app, _S_ate, _S_bin, _S_in, _S_out, _S_trunc, _S_ios_openmode_end } |
enum | _Ios_Seekdir { _S_beg, _S_cur, _S_end, _S_ios_seekdir_end } |
enum | _Rb_tree_color { _S_red, _S_black } |
enum | errc { address_family_not_supported, address_in_use, address_not_available, already_connected, argument_list_too_long, argument_out_of_domain, bad_address, bad_file_descriptor, broken_pipe, connection_aborted, connection_already_in_progress, connection_refused, connection_reset, cross_device_link, destination_address_required, device_or_resource_busy, directory_not_empty, executable_format_error, file_exists, file_too_large, filename_too_long, function_not_supported, host_unreachable, illegal_byte_sequence, inappropriate_io_control_operation, interrupted, invalid_argument, invalid_seek, io_error, is_a_directory, message_size, network_down, network_reset, network_unreachable, no_buffer_space, no_child_process, no_lock_available, no_message, no_protocol_option, no_space_on_device, no_such_device_or_address, no_such_device, no_such_file_or_directory, no_such_process, not_a_directory, not_a_socket, not_connected, not_enough_memory, operation_in_progress, operation_not_permitted, operation_not_supported, operation_would_block, permission_denied, protocol_not_supported, read_only_file_system, resource_deadlock_would_occur, resource_unavailable_try_again, result_out_of_range, timed_out, too_many_files_open_in_system, too_many_files_open, too_many_links, too_many_symbolic_link_levels, wrong_protocol_type } |
enum | memory_order { memory_order_relaxed, memory_order_consume, memory_order_acquire, memory_order_release, memory_order_acq_rel, memory_order_seq_cst } |
Functions | |
template<typename _CharT > | |
_CharT * | __add_grouping (_CharT *__s, _CharT __sep, const char *__gbeg, size_t __gsize, const _CharT *__first, const _CharT *__last) |
template<typename _RandomAccessIterator , typename _Distance , typename _Tp > | |
void | __adjust_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value) |
template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _Compare > | |
void | __adjust_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) |
template<typename _InputIterator , typename _Distance > | |
void | __advance (_InputIterator &__i, _Distance __n, input_iterator_tag) |
template<typename _BidirectionalIterator , typename _Distance > | |
void | __advance (_BidirectionalIterator &__i, _Distance __n, bidirectional_iterator_tag) |
template<typename _RandomAccessIterator , typename _Distance > | |
void | __advance (_RandomAccessIterator &__i, _Distance __n, random_access_iterator_tag) |
volatile __atomic_flag_base * | __atomic_flag_for_address (const volatile void *__z) __attribute__((const )) |
void | __atomic_flag_wait_explicit (volatile __atomic_flag_base *, memory_order) |
template<typename _Facet > | |
const _Facet & | __check_facet (const _Facet *__f) |
template<typename _RandomAccessIterator , typename _Distance > | |
void | __chunk_insertion_sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size) |
template<typename _RandomAccessIterator , typename _Distance , typename _Compare > | |
void | __chunk_insertion_sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size, _Compare __comp) |
int | __convert_from_v (const __c_locale &__cloc __attribute__((__unused__)), char *__out, const int __size __attribute__((__unused__)), const char *__fmt,...) |
template<typename _Tv > | |
void | __convert_to_v (const char *__in, _Tv &__out, ios_base::iostate &__err, const __c_locale &__cloc) |
template<> | |
void | __convert_to_v (const char *, float &, ios_base::iostate &, const __c_locale &) |
template<> | |
void | __convert_to_v (const char *, double &, ios_base::iostate &, const __c_locale &) |
template<> | |
void | __convert_to_v (const char *, long double &, ios_base::iostate &, const __c_locale &) |
template<bool _IsMove, typename _II , typename _OI > | |
_OI | __copy_move_a (_II __first, _II __last, _OI __result) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, ostreambuf_iterator< _CharT > >::__type | __copy_move_a2 (_CharT *__first, _CharT *__last, ostreambuf_iterator< _CharT > __result) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, ostreambuf_iterator< _CharT > >::__type | __copy_move_a2 (const _CharT *__first, const _CharT *__last, ostreambuf_iterator< _CharT > __result) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, _CharT * >::__type | __copy_move_a2 (istreambuf_iterator< _CharT > __first, istreambuf_iterator< _CharT > __last, _CharT *__result) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, ostreambuf_iterator< _CharT, char_traits< _CharT > > >::__type | __copy_move_a2 (_CharT *, _CharT *, ostreambuf_iterator< _CharT, char_traits< _CharT > >) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, ostreambuf_iterator< _CharT, char_traits< _CharT > > >::__type | __copy_move_a2 (const _CharT *, const _CharT *, ostreambuf_iterator< _CharT, char_traits< _CharT > >) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, _CharT * >::__type | __copy_move_a2 (istreambuf_iterator< _CharT, char_traits< _CharT > >, istreambuf_iterator< _CharT, char_traits< _CharT > >, _CharT *) |
template<bool _IsMove, typename _II , typename _OI > | |
_OI | __copy_move_a2 (_II __first, _II __last, _OI __result) |
template<bool _IsMove, typename _BI1 , typename _BI2 > | |
_BI2 | __copy_move_backward_a (_BI1 __first, _BI1 __last, _BI2 __result) |
template<bool _IsMove, typename _BI1 , typename _BI2 > | |
_BI2 | __copy_move_backward_a2 (_BI1 __first, _BI1 __last, _BI2 __result) |
template<typename _InputIterator , typename _Size , typename _OutputIterator > | |
_OutputIterator | __copy_n (_InputIterator __first, _Size __n, _OutputIterator __result, input_iterator_tag) |
template<typename _RandomAccessIterator , typename _Size , typename _OutputIterator > | |
_OutputIterator | __copy_n (_RandomAccessIterator __first, _Size __n, _OutputIterator __result, random_access_iterator_tag) |
size_t | __deque_buf_size (size_t __size) |
template<typename _InputIterator > | |
iterator_traits< _InputIterator >::difference_type | __distance (_InputIterator __first, _InputIterator __last, input_iterator_tag) |
template<typename _RandomAccessIterator > | |
iterator_traits< _RandomAccessIterator >::difference_type | __distance (_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) |
template<typename _II1 , typename _II2 > | |
bool | __equal_aux (_II1 __first1, _II1 __last1, _II2 __first2) |
template<typename _ForwardIterator , typename _Tp > | |
__gnu_cxx::__enable_if<!__is_scalar< _Tp >::__value, void >::__type | __fill_a (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__value) |
template<typename _ForwardIterator , typename _Tp > | |
__gnu_cxx::__enable_if< __is_scalar< _Tp >::__value, void >::__type | __fill_a (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__value) |
template<typename _Tp > | |
__gnu_cxx::__enable_if< __is_byte< _Tp >::__value, void >::__type | __fill_a (_Tp *__first, _Tp *__last, const _Tp &__c) |
void | __fill_bvector (_Bit_iterator __first, _Bit_iterator __last, bool __x) |
template<typename _OutputIterator , typename _Size , typename _Tp > | |
__gnu_cxx::__enable_if<!__is_scalar< _Tp >::__value, _OutputIterator >::__type | __fill_n_a (_OutputIterator __first, _Size __n, const _Tp &__value) |
template<typename _OutputIterator , typename _Size , typename _Tp > | |
__gnu_cxx::__enable_if< __is_scalar< _Tp >::__value, _OutputIterator >::__type | __fill_n_a (_OutputIterator __first, _Size __n, const _Tp &__value) |
template<typename _Size , typename _Tp > | |
__gnu_cxx::__enable_if< __is_byte< _Tp >::__value, _Tp * >::__type | __fill_n_a (_Tp *__first, _Size __n, const _Tp &__c) |
template<typename _RandomAccessIterator > | |
void | __final_insertion_sort (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | __final_insertion_sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _InputIterator , typename _Tp > | |
_InputIterator | __find (_InputIterator __first, _InputIterator __last, const _Tp &__val, input_iterator_tag) |
template<typename _RandomAccessIterator , typename _Tp > | |
_RandomAccessIterator | __find (_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp &__val, random_access_iterator_tag) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 > | |
_ForwardIterator1 | __find_end (_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 , typename _BinaryPredicate > | |
_ForwardIterator1 | __find_end (_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag, _BinaryPredicate __comp) |
template<typename _BidirectionalIterator1 , typename _BidirectionalIterator2 > | |
_BidirectionalIterator1 | __find_end (_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag) |
template<typename _BidirectionalIterator1 , typename _BidirectionalIterator2 , typename _BinaryPredicate > | |
_BidirectionalIterator1 | __find_end (_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag, _BinaryPredicate __comp) |
template<typename _InputIterator , typename _Predicate > | |
_InputIterator | __find_if (_InputIterator __first, _InputIterator __last, _Predicate __pred, input_iterator_tag) |
template<typename _RandomAccessIterator , typename _Predicate > | |
_RandomAccessIterator | __find_if (_RandomAccessIterator __first, _RandomAccessIterator __last, _Predicate __pred, random_access_iterator_tag) |
template<typename _InputIterator , typename _Predicate > | |
_InputIterator | __find_if_not (_InputIterator __first, _InputIterator __last, _Predicate __pred, input_iterator_tag) |
template<typename _RandomAccessIterator , typename _Predicate > | |
_RandomAccessIterator | __find_if_not (_RandomAccessIterator __first, _RandomAccessIterator __last, _Predicate __pred, random_access_iterator_tag) |
template<typename _EuclideanRingElement > | |
_EuclideanRingElement | __gcd (_EuclideanRingElement __m, _EuclideanRingElement __n) |
template<typename _RandomAccessIterator > | |
void | __heap_select (_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | __heap_select (_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) |
template<typename _Tp > | |
size_t | __iconv_adaptor (size_t(*__func)(iconv_t, _Tp, size_t *, char **, size_t *), iconv_t __cd, char **__inbuf, size_t *__inbytes, char **__outbuf, size_t *__outbytes) |
template<typename _ForwardIterator , typename _Predicate , typename _Distance > | |
_ForwardIterator | __inplace_stable_partition (_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len) |
template<typename _RandomAccessIterator > | |
void | __inplace_stable_sort (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | __inplace_stable_sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RandomAccessIterator > | |
void | __insertion_sort (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | __insertion_sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RandomAccessIterator , typename _Size > | |
void | __introselect (_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit) |
template<typename _RandomAccessIterator , typename _Size , typename _Compare > | |
void | __introselect (_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) |
template<typename _RandomAccessIterator , typename _Size > | |
void | __introsort_loop (_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit) |
template<typename _RandomAccessIterator , typename _Size , typename _Compare > | |
void | __introsort_loop (_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) |
template<typename _RandomAccessIterator , typename _Distance > | |
bool | __is_heap (_RandomAccessIterator __first, _Distance __n) |
template<typename _RandomAccessIterator , typename _Compare , typename _Distance > | |
bool | __is_heap (_RandomAccessIterator __first, _Compare __comp, _Distance __n) |
template<typename _RandomAccessIterator > | |
bool | __is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
bool | __is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RandomAccessIterator , typename _Distance > | |
_Distance | __is_heap_until (_RandomAccessIterator __first, _Distance __n) |
template<typename _RandomAccessIterator , typename _Distance , typename _Compare > | |
_Distance | __is_heap_until (_RandomAccessIterator __first, _Distance __n, _Compare __comp) |
template<typename _Iter > | |
iterator_traits< _Iter >::iterator_category | __iterator_category (const _Iter &) |
template<typename _II1 , typename _II2 > | |
bool | __lexicographical_compare_aux (_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) |
template<typename _Size > | |
_Size | __lg (_Size __n) |
int | __lg (int __n) |
long | __lg (long __n) |
long long | __lg (long long __n) |
template<typename _Tp > | |
const _Tp & | __median (const _Tp &__a, const _Tp &__b, const _Tp &__c) |
template<typename _Tp , typename _Compare > | |
const _Tp & | __median (const _Tp &__a, const _Tp &__b, const _Tp &__c, _Compare __comp) |
template<typename _BidirectionalIterator , typename _Distance , typename _Pointer > | |
void | __merge_adaptive (_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size) |
template<typename _BidirectionalIterator , typename _Distance , typename _Pointer , typename _Compare > | |
void | __merge_adaptive (_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) |
template<typename _BidirectionalIterator1 , typename _BidirectionalIterator2 , typename _BidirectionalIterator3 > | |
_BidirectionalIterator3 | __merge_backward (_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result) |
template<typename _BidirectionalIterator1 , typename _BidirectionalIterator2 , typename _BidirectionalIterator3 , typename _Compare > | |
_BidirectionalIterator3 | __merge_backward (_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result, _Compare __comp) |
template<typename _RandomAccessIterator1 , typename _RandomAccessIterator2 , typename _Distance > | |
void | __merge_sort_loop (_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size) |
template<typename _RandomAccessIterator1 , typename _RandomAccessIterator2 , typename _Distance , typename _Compare > | |
void | __merge_sort_loop (_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size, _Compare __comp) |
template<typename _RandomAccessIterator , typename _Pointer > | |
void | __merge_sort_with_buffer (_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer) |
template<typename _RandomAccessIterator , typename _Pointer , typename _Compare > | |
void | __merge_sort_with_buffer (_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Compare __comp) |
template<typename _BidirectionalIterator , typename _Distance > | |
void | __merge_without_buffer (_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2) |
template<typename _BidirectionalIterator , typename _Distance , typename _Compare > | |
void | __merge_without_buffer (_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) |
template<typename _CharT , typename _Traits > | |
void | __ostream_fill (basic_ostream< _CharT, _Traits > &__out, streamsize __n) |
template<typename _CharT , typename _Traits > | |
basic_ostream< _CharT, _Traits > & | __ostream_insert (basic_ostream< _CharT, _Traits > &__out, const _CharT *__s, streamsize __n) |
template<typename _CharT , typename _Traits > | |
void | __ostream_write (basic_ostream< _CharT, _Traits > &__out, const _CharT *__s, streamsize __n) |
template<typename _ForwardIterator , typename _Predicate > | |
_ForwardIterator | __partition (_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) |
template<typename _BidirectionalIterator , typename _Predicate > | |
_BidirectionalIterator | __partition (_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, bidirectional_iterator_tag) |
template<typename _RandomAccessIterator > | |
void | __pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | __pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Compare __comp) |
template<typename _RandomAccessIterator , typename _Distance , typename _Tp > | |
void | __push_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value) |
template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _Compare > | |
void | __push_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp) |
template<typename _BidirectionalIterator > | |
void | __reverse (_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) |
template<typename _RandomAccessIterator > | |
void | __reverse (_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) |
template<typename _ForwardIterator > | |
void | __rotate (_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag) |
template<typename _BidirectionalIterator > | |
void | __rotate (_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, bidirectional_iterator_tag) |
template<typename _RandomAccessIterator > | |
void | __rotate (_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, random_access_iterator_tag) |
template<typename _BidirectionalIterator1 , typename _BidirectionalIterator2 , typename _Distance > | |
_BidirectionalIterator1 | __rotate_adaptive (_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size) |
template<typename _ForwardIterator , typename _Integer , typename _Tp > | |
_ForwardIterator | __search_n (_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp &__val, std::forward_iterator_tag) |
template<typename _RandomAccessIter , typename _Integer , typename _Tp > | |
_RandomAccessIter | __search_n (_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, const _Tp &__val, std::random_access_iterator_tag) |
template<typename _ForwardIterator , typename _Integer , typename _Tp , typename _BinaryPredicate > | |
_ForwardIterator | __search_n (_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp &__val, _BinaryPredicate __binary_pred, std::forward_iterator_tag) |
template<typename _RandomAccessIter , typename _Integer , typename _Tp , typename _BinaryPredicate > | |
_RandomAccessIter | __search_n (_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, const _Tp &__val, _BinaryPredicate __binary_pred, std::random_access_iterator_tag) |
template<typename _ForwardIterator , typename _Pointer , typename _Predicate , typename _Distance > | |
_ForwardIterator | __stable_partition_adaptive (_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size) |
template<typename _RandomAccessIterator , typename _Pointer , typename _Distance > | |
void | __stable_sort_adaptive (_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size) |
template<typename _RandomAccessIterator , typename _Pointer , typename _Distance , typename _Compare > | |
void | __stable_sort_adaptive (_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) |
void | __throw_bad_alloc (void) __attribute__((__noreturn__)) |
void | __throw_bad_cast (void) __attribute__((__noreturn__)) |
void | __throw_bad_exception (void) __attribute__((__noreturn__)) |
void | __throw_bad_typeid (void) __attribute__((__noreturn__)) |
void | __throw_bad_weak_ptr () |
void | __throw_domain_error (const char *) __attribute__((__noreturn__)) |
void | __throw_invalid_argument (const char *) __attribute__((__noreturn__)) |
void | __throw_ios_failure (const char *) __attribute__((__noreturn__)) |
void | __throw_length_error (const char *) __attribute__((__noreturn__)) |
void | __throw_logic_error (const char *) __attribute__((__noreturn__)) |
void | __throw_out_of_range (const char *) __attribute__((__noreturn__)) |
void | __throw_overflow_error (const char *) __attribute__((__noreturn__)) |
void | __throw_range_error (const char *) __attribute__((__noreturn__)) |
void | __throw_runtime_error (const char *) __attribute__((__noreturn__)) |
void | __throw_system_error (int) __attribute__((__noreturn__)) |
void | __throw_underflow_error (const char *) __attribute__((__noreturn__)) |
template<typename _RandomAccessIterator > | |
void | __unguarded_insertion_sort (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | __unguarded_insertion_sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RandomAccessIterator , typename _Tp > | |
void | __unguarded_linear_insert (_RandomAccessIterator __last, _Tp __val) |
template<typename _RandomAccessIterator , typename _Tp , typename _Compare > | |
void | __unguarded_linear_insert (_RandomAccessIterator __last, _Tp __val, _Compare __comp) |
template<typename _RandomAccessIterator , typename _Tp > | |
_RandomAccessIterator | __unguarded_partition (_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp __pivot) |
template<typename _RandomAccessIterator , typename _Tp , typename _Compare > | |
_RandomAccessIterator | __unguarded_partition (_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp __pivot, _Compare __comp) |
template<typename _InputIterator , typename _ForwardIterator , typename _Allocator > | |
_ForwardIterator | __uninitialized_copy_a (_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator &__alloc) |
template<typename _InputIterator , typename _ForwardIterator , typename _Tp > | |
_ForwardIterator | __uninitialized_copy_a (_InputIterator __first, _InputIterator __last, _ForwardIterator __result, allocator< _Tp > &) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _ForwardIterator , typename _Allocator > | |
_ForwardIterator | __uninitialized_copy_move (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _ForwardIterator __result, _Allocator &__alloc) |
template<typename _InputIterator , typename _Size , typename _ForwardIterator > | |
_ForwardIterator | __uninitialized_copy_n (_InputIterator __first, _Size __n, _ForwardIterator __result, input_iterator_tag) |
template<typename _RandomAccessIterator , typename _Size , typename _ForwardIterator > | |
_ForwardIterator | __uninitialized_copy_n (_RandomAccessIterator __first, _Size __n, _ForwardIterator __result, random_access_iterator_tag) |
template<typename _ForwardIterator , typename _Tp , typename _Allocator > | |
void | __uninitialized_fill_a (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__x, _Allocator &__alloc) |
template<typename _ForwardIterator , typename _Tp , typename _Tp2 > | |
void | __uninitialized_fill_a (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__x, allocator< _Tp2 > &) |
template<typename _ForwardIterator , typename _Tp , typename _InputIterator , typename _Allocator > | |
_ForwardIterator | __uninitialized_fill_move (_ForwardIterator __result, _ForwardIterator __mid, const _Tp &__x, _InputIterator __first, _InputIterator __last, _Allocator &__alloc) |
template<typename _ForwardIterator , typename _Size , typename _Tp , typename _Allocator > | |
void | __uninitialized_fill_n_a (_ForwardIterator __first, _Size __n, const _Tp &__x, _Allocator &__alloc) |
template<typename _ForwardIterator , typename _Size , typename _Tp , typename _Tp2 > | |
void | __uninitialized_fill_n_a (_ForwardIterator __first, _Size __n, const _Tp &__x, allocator< _Tp2 > &) |
template<typename _InputIterator , typename _ForwardIterator , typename _Allocator > | |
_ForwardIterator | __uninitialized_move_a (_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator &__alloc) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _ForwardIterator , typename _Allocator > | |
_ForwardIterator | __uninitialized_move_copy (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _ForwardIterator __result, _Allocator &__alloc) |
template<typename _InputIterator , typename _ForwardIterator , typename _Tp , typename _Allocator > | |
void | __uninitialized_move_fill (_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, const _Tp &__x, _Allocator &__alloc) |
template<typename _ForwardIterator , typename _OutputIterator > | |
_OutputIterator | __unique_copy (_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, forward_iterator_tag, output_iterator_tag) |
template<typename _InputIterator , typename _OutputIterator > | |
_OutputIterator | __unique_copy (_InputIterator __first, _InputIterator __last, _OutputIterator __result, input_iterator_tag, output_iterator_tag) |
template<typename _InputIterator , typename _ForwardIterator > | |
_ForwardIterator | __unique_copy (_InputIterator __first, _InputIterator __last, _ForwardIterator __result, input_iterator_tag, forward_iterator_tag) |
template<typename _ForwardIterator , typename _OutputIterator , typename _BinaryPredicate > | |
_OutputIterator | __unique_copy (_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, forward_iterator_tag, output_iterator_tag) |
template<typename _InputIterator , typename _OutputIterator , typename _BinaryPredicate > | |
_OutputIterator | __unique_copy (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, output_iterator_tag) |
template<typename _InputIterator , typename _ForwardIterator , typename _BinaryPredicate > | |
_ForwardIterator | __unique_copy (_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, forward_iterator_tag) |
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__ __src, size_t __n, size_t __s1, _Tp *__restrict__ __dst, size_t __s2) |
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 > | |
void | __valarray_copy (const _Tp *__restrict__ __src, size_t __n, const size_t *__restrict__ __i, _Tp *__restrict__ __dst, const size_t *__restrict__ __j) |
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, size_t __n, size_t __s1, _Array< _Tp > __b, size_t __s2) |
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 > | |
void | __valarray_copy (_Array< _Tp > __src, size_t __n, _Array< size_t > __i, _Array< _Tp > __dst, _Array< size_t > __j) |
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_copy_construct (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | __valarray_copy_construct (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp > | |
void | __valarray_default_construct (_Tp *__restrict__ __b, _Tp *__restrict__ __e) |
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_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_fill_construct (_Tp *__restrict__ __b, _Tp *__restrict__ __e, const _Tp __t) |
void * | __valarray_get_memory (size_t __n) |
template<typename _Tp > | |
_Tp *__restrict__ | __valarray_get_storage (size_t __n) |
template<typename _Ta > | |
_Ta::value_type | __valarray_max (const _Ta &__a) |
template<typename _Ta > | |
_Ta::value_type | __valarray_min (const _Ta &__a) |
template<typename _Tp > | |
_Tp | __valarray_product (const _Tp *__restrict__ __f, const _Tp *__restrict__ __l) |
void | __valarray_release_memory (void *__p) |
template<typename _Tp > | |
_Tp | __valarray_sum (const _Tp *__restrict__ __f, const _Tp *__restrict__ __l) |
template<typename _CharT > | |
ostreambuf_iterator< _CharT > | __write (ostreambuf_iterator< _CharT > __s, const _CharT *__ws, int __len) |
template<typename _CharT , typename _OutIter > | |
_OutIter | __write (_OutIter __s, const _CharT *__ws, int __len) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_and (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_or (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp > | |
void | _Array_augmented___bitwise_xor (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___divides (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp > | |
void | _Array_augmented___divides (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___divides (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___divides (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp > | |
void | _Array_augmented___divides (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___divides (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___divides (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___divides (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___divides (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___divides (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___divides (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___divides (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___minus (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___minus (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp > | |
void | _Array_augmented___minus (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___minus (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___minus (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___minus (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___minus (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___minus (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp > | |
void | _Array_augmented___minus (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___minus (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___minus (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___minus (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___modulus (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___multiplies (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___plus (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp > | |
void | _Array_augmented___plus (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___plus (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___plus (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___plus (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___plus (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___plus (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___plus (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___plus (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___plus (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp > | |
void | _Array_augmented___plus (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___plus (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___shift_left (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, _Array< bool > __m, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, _Array< size_t > __i, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, _Array< _Tp > __b, size_t __n, size_t __s) |
template<typename _Tp > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, size_t __n, const _Tp &__t) |
template<typename _Tp > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, size_t __n, size_t __s, _Array< _Tp > __b) |
template<typename _Tp > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, _Array< size_t > __i, _Array< _Tp > __b, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< size_t > __i) |
template<typename _Tp , class _Dom > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, size_t __s, const _Expr< _Dom, _Tp > &__e, size_t __n) |
template<typename _Tp > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, size_t __n, _Array< _Tp > __b, _Array< bool > __m) |
template<typename _Tp > | |
void | _Array_augmented___shift_right (_Array< _Tp > __a, _Array< bool > __m, _Array< _Tp > __b, size_t __n) |
template<typename _T1 , typename _T2 > | |
void | _Construct (_T1 *__p, const _T2 &__value) |
template<typename _Tp > | |
void | _Destroy (_Tp *__pointer) |
template<typename _ForwardIterator > | |
void | _Destroy (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Allocator > | |
void | _Destroy (_ForwardIterator __first, _ForwardIterator __last, _Allocator &__alloc) |
template<typename _ForwardIterator , typename _Tp > | |
void | _Destroy (_ForwardIterator __first, _ForwardIterator __last, allocator< _Tp > &) |
unsigned int | _Rb_tree_black_count (const _Rb_tree_node_base *__node, const _Rb_tree_node_base *__root) |
_Rb_tree_node_base * | _Rb_tree_decrement (_Rb_tree_node_base *__x) |
const _Rb_tree_node_base * | _Rb_tree_decrement (const _Rb_tree_node_base *__x) |
_Rb_tree_node_base * | _Rb_tree_increment (_Rb_tree_node_base *__x) |
const _Rb_tree_node_base * | _Rb_tree_increment (const _Rb_tree_node_base *__x) |
void | _Rb_tree_insert_and_rebalance (const bool __insert_left, _Rb_tree_node_base *__x, _Rb_tree_node_base *__p, _Rb_tree_node_base &__header) |
_Rb_tree_node_base * | _Rb_tree_rebalance_for_erase (_Rb_tree_node_base *const __z, _Rb_tree_node_base &__header) |
template<class _Dom > | |
_Expr< _UnClos< __abs, _Expr, _Dom >, typename _Dom::value_type > | abs (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __abs, _ValArray, _Tp >, _Tp > | abs (const valarray< _Tp > &__v) |
template<typename _InputIterator , typename _Tp > | |
_Tp | accumulate (_InputIterator __first, _InputIterator __last, _Tp __init) |
template<typename _InputIterator , typename _Tp , typename _BinaryOperation > | |
_Tp | accumulate (_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op) |
template<class _Dom > | |
_Expr< _UnClos< __acos, _Expr, _Dom >, typename _Dom::value_type > | acos (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __acos, _ValArray, _Tp >, _Tp > | acos (const valarray< _Tp > &__v) |
template<typename _InputIterator , typename _OutputIterator > | |
_OutputIterator | adjacent_difference (_InputIterator __first, _InputIterator __last, _OutputIterator __result) |
template<typename _InputIterator , typename _OutputIterator , typename _BinaryOperation > | |
_OutputIterator | adjacent_difference (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) |
template<typename _FIter > | |
_FIter | adjacent_find (_FIter, _FIter) |
template<typename _FIter , typename _BinaryPredicate > | |
_FIter | adjacent_find (_FIter, _FIter, _BinaryPredicate) |
template<typename _ForwardIterator > | |
_ForwardIterator | adjacent_find (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _BinaryPredicate > | |
_ForwardIterator | adjacent_find (_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) |
template<typename _InputIterator , typename _Distance > | |
void | advance (_InputIterator &__i, _Distance __n) |
template<typename _IIter , typename _Predicate > | |
bool | all_of (_IIter, _IIter, _Predicate) |
template<typename _InputIterator , typename _Predicate > | |
bool | all_of (_InputIterator __first, _InputIterator __last, _Predicate __pred) |
template<typename _IIter , typename _Predicate > | |
bool | any_of (_IIter, _IIter, _Predicate) |
template<typename _InputIterator , typename _Predicate > | |
bool | any_of (_InputIterator __first, _InputIterator __last, _Predicate __pred) |
template<class _Dom > | |
_Expr< _UnClos< __asin, _Expr, _Dom >, typename _Dom::value_type > | asin (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __asin, _ValArray, _Tp >, _Tp > | asin (const valarray< _Tp > &__v) |
template<class _Dom > | |
_Expr< _UnClos< __atan, _Expr, _Dom >, typename _Dom::value_type > | atan (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __atan, _ValArray, _Tp >, _Tp > | atan (const valarray< _Tp > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __atan2, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename _Dom::value_type > | atan2 (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __atan2, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename _Dom::value_type > | atan2 (const valarray< typename _Dom::valarray > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __atan2, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename _Dom::value_type > | atan2 (const _Expr< _Dom, typename _Dom::value_type > &__e, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __atan2, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename _Dom::value_type > | atan2 (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _BinClos< __atan2, _ValArray, _ValArray, _Tp, _Tp >, _Tp > | atan2 (const valarray< _Tp > &__v, const valarray< _Tp > &__w) |
template<typename _Tp > | |
_Expr< _BinClos< __atan2, _ValArray, _Constant, _Tp, _Tp >, _Tp > | atan2 (const valarray< _Tp > &__v, const _Tp &__t) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __atan2, _Expr, _Expr, _Dom1, _Dom2 >, typename _Dom1::value_type > | atan2 (const _Expr< _Dom1, typename _Dom1::value_type > &__e1, const _Expr< _Dom2, typename _Dom2::value_type > &__e2) |
template<typename _Tp > | |
_Expr< _BinClos< __atan2, _Constant, _ValArray, _Tp, _Tp >, _Tp > | atan2 (const _Tp &__t, const valarray< _Tp > &__v) |
void | atomic_flag_clear (volatile __atomic_flag_base *__a) |
void | atomic_flag_clear_explicit (volatile __atomic_flag_base *, memory_order) |
bool | atomic_flag_test_and_set (volatile __atomic_flag_base *__a) |
bool | atomic_flag_test_and_set_explicit (volatile __atomic_flag_base *, memory_order) |
template<typename _Container > | |
back_insert_iterator< _Container > | back_inserter (_Container &__x) |
template<typename _FIter , typename _Tp > | |
bool | binary_search (_FIter, _FIter, const _Tp &) |
template<typename _FIter , typename _Tp , typename _Compare > | |
bool | binary_search (_FIter, _FIter, const _Tp &, _Compare) |
template<typename _ForwardIterator , typename _Tp > | |
bool | binary_search (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val) |
template<typename _ForwardIterator , typename _Tp , typename _Compare > | |
bool | binary_search (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val, _Compare __comp) |
template<typename _Operation , typename _Tp > | |
binder1st< _Operation > | bind1st (const _Operation &__fn, const _Tp &__x) |
template<typename _Operation , typename _Tp > | |
binder2nd< _Operation > | bind2nd (const _Operation &__fn, const _Tp &__x) |
ios_base & | boolalpha (ios_base &__base) |
template<typename _IIter , typename _OIter > | |
_OIter | copy (_IIter, _IIter, _OIter) |
template<typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, ostreambuf_iterator< _CharT > >::__type | copy (istreambuf_iterator< _CharT > __first, istreambuf_iterator< _CharT > __last, ostreambuf_iterator< _CharT > __result) |
template<typename _II , typename _OI > | |
_OI | copy (_II __first, _II __last, _OI __result) |
template<typename _BIter1 , typename _BIter2 > | |
_BIter2 | copy_backward (_BIter1, _BIter1, _BIter2) |
template<typename _BI1 , typename _BI2 > | |
_BI2 | copy_backward (_BI1 __first, _BI1 __last, _BI2 __result) |
template<typename _Ex > | |
exception_ptr | copy_exception (_Ex __ex) throw () |
template<typename _IIter , typename _OIter , typename _Predicate > | |
_OIter | copy_if (_IIter, _IIter, _OIter, _Predicate) |
template<typename _InputIterator , typename _OutputIterator , typename _Predicate > | |
_OutputIterator | copy_if (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) |
template<typename _IIter , typename _Size , typename _OIter > | |
_OIter | copy_n (_IIter, _Size, _OIter) |
template<typename _InputIterator , typename _Size , typename _OutputIterator > | |
_OutputIterator | copy_n (_InputIterator __first, _Size __n, _OutputIterator __result) |
template<class _Dom > | |
_Expr< _UnClos< __cos, _Expr, _Dom >, typename _Dom::value_type > | cos (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __cos, _ValArray, _Tp >, _Tp > | cos (const valarray< _Tp > &__v) |
template<class _Dom > | |
_Expr< _UnClos< __cosh, _Expr, _Dom >, typename _Dom::value_type > | cosh (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __cosh, _ValArray, _Tp >, _Tp > | cosh (const valarray< _Tp > &__v) |
template<typename _IIter , typename _Tp > | |
iterator_traits< _IIter >::difference_type | count (_IIter, _IIter, const _Tp &) |
template<typename _InputIterator , typename _Tp > | |
iterator_traits< _InputIterator >::difference_type | count (_InputIterator __first, _InputIterator __last, const _Tp &__value) |
template<typename _IIter , typename _Predicate > | |
iterator_traits< _IIter >::difference_type | count_if (_IIter, _IIter, _Predicate) |
template<typename _InputIterator , typename _Predicate > | |
iterator_traits< _InputIterator >::difference_type | count_if (_InputIterator __first, _InputIterator __last, _Predicate __pred) |
exception_ptr | current_exception () throw () |
ios_base & | dec (ios_base &__base) |
template<typename _InputIterator > | |
iterator_traits< _InputIterator >::difference_type | distance (_InputIterator __first, _InputIterator __last) |
template<typename _IIter1 , typename _IIter2 > | |
bool | equal (_IIter1, _IIter1, _IIter2) |
template<typename _IIter1 , typename _IIter2 , typename _BinaryPredicate > | |
bool | equal (_IIter1 __first1, _IIter1 __last1, _IIter2 __first2, _BinaryPredicate __binary_pred) |
template<typename _II1 , typename _II2 > | |
bool | equal (_II1 __first1, _II1 __last1, _II2 __first2) |
template<typename _FIter , typename _Tp > | |
pair< _FIter, _FIter > | equal_range (_FIter, _FIter, const _Tp &) |
template<typename _FIter , typename _Tp , typename _Compare > | |
pair< _FIter, _FIter > | equal_range (_FIter, _FIter, const _Tp &, _Compare) |
template<typename _ForwardIterator , typename _Tp > | |
pair< _ForwardIterator, _ForwardIterator > | equal_range (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val) |
template<typename _ForwardIterator , typename _Tp , typename _Compare > | |
pair< _ForwardIterator, _ForwardIterator > | equal_range (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val, _Compare __comp) |
template<class _Dom > | |
_Expr< _UnClos< __exp, _Expr, _Dom >, typename _Dom::value_type > | exp (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __exp, _ValArray, _Tp >, _Tp > | exp (const valarray< _Tp > &__v) |
template<typename _FIter , typename _Tp > | |
void | fill (_FIter, _FIter, const _Tp &) |
template<typename _Tp > | |
void | fill (const _Deque_iterator< _Tp, _Tp &, _Tp * > &__first, const _Deque_iterator< _Tp, _Tp &, _Tp * > &__last, const _Tp &__value) |
void | fill (_Bit_iterator __first, _Bit_iterator __last, const bool &__x) |
template<typename _ForwardIterator , typename _Tp > | |
void | fill (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__value) |
template<typename _OIter , typename _Size , typename _Tp > | |
_OIter | fill_n (_OIter, _Size, const _Tp &) |
template<typename _OI , typename _Size , typename _Tp > | |
_OI | fill_n (_OI __first, _Size __n, const _Tp &__value) |
template<typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, istreambuf_iterator< _CharT > >::__type | find (istreambuf_iterator< _CharT > __first, istreambuf_iterator< _CharT > __last, const _CharT &__val) |
template<typename _IIter , typename _Tp > | |
_IIter | find (_IIter, _IIter, const _Tp &) |
template<typename _InputIterator , typename _Tp > | |
_InputIterator | find (_InputIterator __first, _InputIterator __last, const _Tp &__val) |
template<typename _FIter1 , typename _FIter2 > | |
_FIter1 | find_end (_FIter1, _FIter1, _FIter2, _FIter2) |
template<typename _FIter1 , typename _FIter2 , typename _BinaryPredicate > | |
_FIter1 | find_end (_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 > | |
_ForwardIterator1 | find_end (_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 , typename _BinaryPredicate > | |
_ForwardIterator1 | find_end (_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __comp) |
template<typename _FIter1 , typename _FIter2 > | |
_FIter1 | find_first_of (_FIter1, _FIter1, _FIter2, _FIter2) |
template<typename _FIter1 , typename _FIter2 , typename _BinaryPredicate > | |
_FIter1 | find_first_of (_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate) |
template<typename _InputIterator , typename _ForwardIterator > | |
_InputIterator | find_first_of (_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2) |
template<typename _InputIterator , typename _ForwardIterator , typename _BinaryPredicate > | |
_InputIterator | find_first_of (_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, _BinaryPredicate __comp) |
template<typename _IIter , typename _Predicate > | |
_IIter | find_if (_IIter, _IIter, _Predicate) |
template<typename _InputIterator , typename _Predicate > | |
_InputIterator | find_if (_InputIterator __first, _InputIterator __last, _Predicate __pred) |
template<typename _IIter , typename _Predicate > | |
_IIter | find_if_not (_IIter, _IIter, _Predicate) |
template<typename _InputIterator , typename _Predicate > | |
_InputIterator | find_if_not (_InputIterator __first, _InputIterator __last, _Predicate __pred) |
ios_base & | fixed (ios_base &__base) |
template<typename _IIter , typename _Funct > | |
_Funct | for_each (_IIter, _IIter, _Funct) |
template<typename _InputIterator , typename _Function > | |
_Function | for_each (_InputIterator __first, _InputIterator __last, _Function __f) |
template<typename _Tp > | |
_Tp && | forward (typename std::identity< _Tp >::type &&__t) |
template<typename _Container > | |
front_insert_iterator< _Container > | front_inserter (_Container &__x) |
template<typename _FIter , typename _Generator > | |
void | generate (_FIter, _FIter, _Generator) |
template<typename _ForwardIterator , typename _Generator > | |
void | generate (_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) |
template<typename _OIter , typename _Size , typename _Generator > | |
_OIter | generate_n (_OIter, _Size, _Generator) |
template<typename _OutputIterator , typename _Size , typename _Generator > | |
_OutputIterator | generate_n (_OutputIterator __first, _Size __n, _Generator __gen) |
template<typename _Tp > | |
pair< _Tp *, ptrdiff_t > | get_temporary_buffer (ptrdiff_t __len) |
template<typename _CharT , typename _Traits , typename _Alloc , template< typename, typename, typename > class _Base> | |
basic_istream< _CharT, _Traits > & | getline (basic_istream< _CharT, _Traits > &__is, __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &__str, _CharT __delim) |
template<typename _CharT , typename _Traits , typename _Alloc , template< typename, typename, typename > class _Base> | |
basic_istream< _CharT, _Traits > & | getline (basic_istream< _CharT, _Traits > &__is, __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &__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<> | |
basic_istream< char > & | getline (basic_istream< char > &__in, basic_string< char > &__str, char __delim) |
template<> | |
basic_istream< wchar_t > & | getline (basic_istream< wchar_t > &__in, basic_string< wchar_t > &__str, wchar_t __delim) |
template<typename _Facet > | |
bool | has_facet (const locale &__loc) throw () |
ios_base & | hex (ios_base &__base) |
template<typename _IIter1 , typename _IIter2 > | |
bool | includes (_IIter1, _IIter1, _IIter2, _IIter2) |
template<typename _IIter1 , typename _IIter2 , typename _Compare > | |
bool | includes (_IIter1, _IIter1, _IIter2, _IIter2, _Compare) |
template<typename _InputIterator1 , typename _InputIterator2 > | |
bool | includes (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _Compare > | |
bool | includes (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _Tp > | |
_Tp | inner_product (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _Tp , typename _BinaryOperation1 , typename _BinaryOperation2 > | |
_Tp | inner_product (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2) |
template<typename _BIter > | |
void | inplace_merge (_BIter, _BIter, _BIter) |
template<typename _BIter , typename _Compare > | |
void | inplace_merge (_BIter, _BIter, _BIter, _Compare) |
template<typename _BidirectionalIterator > | |
void | inplace_merge (_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) |
template<typename _BidirectionalIterator , typename _Compare > | |
void | inplace_merge (_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) |
template<typename _Container , typename _Iterator > | |
insert_iterator< _Container > | inserter (_Container &__x, _Iterator __i) |
ios_base & | internal (ios_base &__base) |
template<typename _ForwardIterator , typename _Tp > | |
void | iota (_ForwardIterator __first, _ForwardIterator __last, _Tp __value) |
template<typename _RAIter > | |
bool | is_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
bool | is_heap (_RAIter, _RAIter, _Compare) |
template<typename _RandomAccessIterator > | |
bool | is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
bool | is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RAIter > | |
_RAIter | is_heap_until (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
_RAIter | is_heap_until (_RAIter, _RAIter, _Compare) |
template<typename _RandomAccessIterator > | |
_RandomAccessIterator | is_heap_until (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
_RandomAccessIterator | is_heap_until (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _IIter , typename _Predicate > | |
bool | is_partitioned (_IIter, _IIter, _Predicate) |
template<typename _InputIterator , typename _Predicate > | |
bool | is_partitioned (_InputIterator __first, _InputIterator __last, _Predicate __pred) |
template<typename _FIter > | |
bool | is_sorted (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
bool | is_sorted (_FIter, _FIter, _Compare) |
template<typename _ForwardIterator > | |
bool | is_sorted (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
bool | is_sorted (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _FIter > | |
_FIter | is_sorted_until (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
_FIter | is_sorted_until (_FIter, _FIter, _Compare) |
template<typename _ForwardIterator > | |
_ForwardIterator | is_sorted_until (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
_ForwardIterator | is_sorted_until (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _CharT > | |
bool | isalnum (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | isalpha (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | iscntrl (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | isdigit (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | isgraph (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | islower (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | isprint (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | ispunct (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | isspace (_CharT, const locale &) |
template<typename _CharT > | |
_GLIBCXX_END_LDBL_NAMESPACE bool | isspace (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | isupper (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
bool | isxdigit (_CharT __c, const locale &__loc) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 > | |
void | iter_swap (_ForwardIterator1 __a, _ForwardIterator2 __b) |
template<typename _FIter1 , typename _FIter2 > | |
void | iter_swap (_FIter1, _FIter2) |
ios_base & | left (ios_base &__base) |
template<typename _IIter1 , typename _IIter2 > | |
bool | lexicographical_compare (_IIter1, _IIter1, _IIter2, _IIter2) |
template<typename _IIter1 , typename _IIter2 , typename _Compare > | |
bool | lexicographical_compare (_IIter1, _IIter1, _IIter2, _IIter2, _Compare) |
template<typename _II1 , typename _II2 > | |
bool | lexicographical_compare (_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) |
template<typename _II1 , typename _II2 , typename _Compare > | |
bool | lexicographical_compare (_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2, _Compare __comp) |
template<class _Dom > | |
_Expr< _UnClos< __log, _Expr, _Dom >, typename _Dom::value_type > | log (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __log, _ValArray, _Tp >, _Tp > | log (const valarray< _Tp > &__v) |
template<class _Dom > | |
_Expr< _UnClos< __log10, _Expr, _Dom >, typename _Dom::value_type > | log10 (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __log10, _ValArray, _Tp >, _Tp > | log10 (const valarray< _Tp > &__v) |
template<typename _FIter , typename _Tp > | |
_FIter | lower_bound (_FIter, _FIter, const _Tp &) |
template<typename _FIter , typename _Tp , typename _Compare > | |
_FIter | lower_bound (_FIter, _FIter, const _Tp &, _Compare) |
template<typename _ForwardIterator , typename _Tp > | |
_ForwardIterator | lower_bound (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val) |
template<typename _ForwardIterator , typename _Tp , typename _Compare > | |
_ForwardIterator | lower_bound (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val, _Compare __comp) |
template<typename _RAIter > | |
void | make_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | make_heap (_RAIter, _RAIter, _Compare) |
template<typename _RandomAccessIterator > | |
void | make_heap (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | make_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _Iterator > | |
move_iterator< _Iterator > | make_move_iterator (const _Iterator &__i) |
template<class _T1 , class _T2 > | |
pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > | make_pair (_T1 &&__x, _T2 &&__y) |
template<typename _Tp > | |
const _Tp & | max (const _Tp &__a, const _Tp &__b) |
template<typename _Tp , typename _Compare > | |
const _Tp & | max (const _Tp &__a, const _Tp &__b, _Compare __comp) |
template<typename _Tp > | |
_Tp | max (initializer_list< _Tp >) |
template<typename _Tp , typename _Compare > | |
_Tp | max (initializer_list< _Tp >, _Compare) |
template<typename _FIter > | |
_FIter | max_element (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
_FIter | max_element (_FIter, _FIter, _Compare) |
template<typename _ForwardIterator > | |
_ForwardIterator | max_element (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
_ForwardIterator | max_element (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _Ret , typename _Tp > | |
mem_fun_t< _Ret, _Tp > | mem_fun (_Ret(_Tp::*__f)()) |
template<typename _Ret , typename _Tp > | |
const_mem_fun_t< _Ret, _Tp > | mem_fun (_Ret(_Tp::*__f)() const) |
template<typename _Ret , typename _Tp , typename _Arg > | |
mem_fun1_t< _Ret, _Tp, _Arg > | mem_fun (_Ret(_Tp::*__f)(_Arg)) |
template<typename _Ret , typename _Tp , typename _Arg > | |
const_mem_fun1_t< _Ret, _Tp, _Arg > | mem_fun (_Ret(_Tp::*__f)(_Arg) const) |
template<typename _Ret , typename _Tp > | |
mem_fun_ref_t< _Ret, _Tp > | mem_fun_ref (_Ret(_Tp::*__f)()) |
template<typename _Ret , typename _Tp > | |
const_mem_fun_ref_t< _Ret, _Tp > | mem_fun_ref (_Ret(_Tp::*__f)() const) |
template<typename _Ret , typename _Tp , typename _Arg > | |
mem_fun1_ref_t< _Ret, _Tp, _Arg > | mem_fun_ref (_Ret(_Tp::*__f)(_Arg)) |
template<typename _Ret , typename _Tp , typename _Arg > | |
const_mem_fun1_ref_t< _Ret, _Tp, _Arg > | mem_fun_ref (_Ret(_Tp::*__f)(_Arg) const) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | merge (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | merge (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator > | |
_OutputIterator | merge (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator , typename _Compare > | |
_OutputIterator | merge (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) |
template<typename _Tp > | |
const _Tp & | min (const _Tp &__a, const _Tp &__b) |
template<typename _Tp , typename _Compare > | |
const _Tp & | min (const _Tp &__a, const _Tp &__b, _Compare __comp) |
template<typename _Tp > | |
_Tp | min (initializer_list< _Tp >) |
template<typename _Tp , typename _Compare > | |
_Tp | min (initializer_list< _Tp >, _Compare) |
template<typename _FIter > | |
_FIter | min_element (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
_FIter | min_element (_FIter, _FIter, _Compare) |
template<typename _ForwardIterator > | |
_ForwardIterator | min_element (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
_ForwardIterator | min_element (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _Tp > | |
pair< const _Tp &, const _Tp & > | minmax (const _Tp &__a, const _Tp &__b) |
template<typename _Tp , typename _Compare > | |
pair< const _Tp &, const _Tp & > | minmax (const _Tp &__a, const _Tp &__b, _Compare __comp) |
template<typename _Tp > | |
pair< _Tp, _Tp > | minmax (initializer_list< _Tp >) |
template<typename _Tp , typename _Compare > | |
pair< _Tp, _Tp > | minmax (initializer_list< _Tp >, _Compare) |
template<typename _FIter > | |
pair< _FIter, _FIter > | minmax_element (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
pair< _FIter, _FIter > | minmax_element (_FIter, _FIter, _Compare) |
template<typename _ForwardIterator > | |
pair< _ForwardIterator, _ForwardIterator > | minmax_element (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
pair< _ForwardIterator, _ForwardIterator > | minmax_element (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _IIter1 , typename _IIter2 > | |
pair< _IIter1, _IIter2 > | mismatch (_IIter1, _IIter1, _IIter2) |
template<typename _IIter1 , typename _IIter2 , typename _BinaryPredicate > | |
pair< _IIter1, _IIter2 > | mismatch (_IIter1, _IIter1, _IIter2, _BinaryPredicate) |
template<typename _InputIterator1 , typename _InputIterator2 > | |
pair< _InputIterator1, _InputIterator2 > | mismatch (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _BinaryPredicate > | |
pair< _InputIterator1, _InputIterator2 > | mismatch (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __binary_pred) |
template<typename _Tp > | |
std::remove_reference< _Tp >::type && | move (_Tp &&__t) |
template<typename _II , typename _OI > | |
_OI | move (_II __first, _II __last, _OI __result) |
template<typename _BI1 , typename _BI2 > | |
_BI2 | move_backward (_BI1 __first, _BI1 __last, _BI2 __result) |
template<typename _InputIterator > | |
_InputIterator | next (_InputIterator __x, typename iterator_traits< _InputIterator >::difference_type __n=1) |
template<typename _BIter > | |
bool | next_permutation (_BIter, _BIter) |
template<typename _BIter , typename _Compare > | |
bool | next_permutation (_BIter, _BIter, _Compare) |
template<typename _BidirectionalIterator > | |
bool | next_permutation (_BidirectionalIterator __first, _BidirectionalIterator __last) |
template<typename _BidirectionalIterator , typename _Compare > | |
bool | next_permutation (_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) |
ios_base & | noboolalpha (ios_base &__base) |
template<typename _IIter , typename _Predicate > | |
bool | none_of (_IIter, _IIter, _Predicate) |
template<typename _InputIterator , typename _Predicate > | |
bool | none_of (_InputIterator __first, _InputIterator __last, _Predicate __pred) |
ios_base & | noshowbase (ios_base &__base) |
ios_base & | noshowpoint (ios_base &__base) |
ios_base & | noshowpos (ios_base &__base) |
ios_base & | noskipws (ios_base &__base) |
template<typename _Predicate > | |
unary_negate< _Predicate > | not1 (const _Predicate &__pred) |
template<typename _Predicate > | |
binary_negate< _Predicate > | not2 (const _Predicate &__pred) |
ios_base & | nounitbuf (ios_base &__base) |
ios_base & | nouppercase (ios_base &__base) |
template<typename _RAIter > | |
void | nth_element (_RAIter, _RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | nth_element (_RAIter, _RAIter, _RAIter, _Compare) |
template<typename _RandomAccessIterator > | |
void | nth_element (_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | nth_element (_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) |
ios_base & | oct (ios_base &__base) |
template<typename _T1 , typename _T2 > | |
bool | operator!= (const allocator< _T1 > &, const allocator< _T2 > &) |
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 _Tp > | |
bool | operator!= (const allocator< _Tp > &, const allocator< _Tp > &) |
template<class _T1 , class _T2 > | |
bool | operator!= (const pair< _T1, _T2 > &__x, const pair< _T1, _T2 > &__y) |
template<typename _CharT , typename _Traits > | |
bool | operator!= (const istreambuf_iterator< _CharT, _Traits > &__a, const istreambuf_iterator< _CharT, _Traits > &__b) |
template<typename _StateT > | |
bool | operator!= (const fpos< _StateT > &__lhs, const fpos< _StateT > &__rhs) |
template<typename _Tp , typename _Ref , typename _Ptr > | |
bool | operator!= (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator!= (const _Fwd_list_iterator< _Tp, _Alloc > &__x, const _Fwd_list_const_iterator< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _RefL , typename _PtrL , typename _RefR , typename _PtrR > | |
bool | operator!= (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator!= (const stack< _Tp, _Seq > &__x, const stack< _Tp, _Seq > &__y) |
template<typename _Val > | |
bool | operator!= (const _List_iterator< _Val > &__x, const _List_const_iterator< _Val > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator!= (const queue< _Tp, _Seq > &__x, const queue< _Tp, _Seq > &__y) |
template<typename _Val > | |
bool | operator!= (const _Rb_tree_iterator< _Val > &__x, const _Rb_tree_const_iterator< _Val > &__y) |
template<typename _Tp , typename _Tp_Deleter , typename _Up , typename _Up_Deleter > | |
bool | operator!= (const unique_ptr< _Tp, _Tp_Deleter > &__x, const unique_ptr< _Up, _Up_Deleter > &__y) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __not_equal_to, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __not_equal_to, typename _Dom1::value_type >::result_type > | operator!= (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __not_equal_to, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __not_equal_to, typename _Dom::value_type >::result_type > | operator!= (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __not_equal_to, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __not_equal_to, typename _Dom::value_type >::result_type > | operator!= (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __not_equal_to, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __not_equal_to, typename _Dom::value_type >::result_type > | operator!= (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __not_equal_to, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __not_equal_to, typename _Dom::value_type >::result_type > | operator!= (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator!= (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator!= (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator!= (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | operator!= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator!= (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator!= (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator!= (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator!= (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly) |
template<typename _Tp , typename _Alloc > | |
bool | operator!= (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator!= (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y) |
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<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __modulus, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __modulus, typename _Dom1::value_type >::result_type > | operator% (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __modulus, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __modulus, typename _Dom::value_type >::result_type > | operator% (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __modulus, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __modulus, typename _Dom::value_type >::result_type > | operator% (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __modulus, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __modulus, typename _Dom::value_type >::result_type > | operator% (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __modulus, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __modulus, typename _Dom::value_type >::result_type > | operator% (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
_Ios_Fmtflags | operator& (_Ios_Fmtflags __a, _Ios_Fmtflags __b) |
_Ios_Openmode | operator& (_Ios_Openmode __a, _Ios_Openmode __b) |
_Ios_Iostate | operator& (_Ios_Iostate __a, _Ios_Iostate __b) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_and, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __bitwise_and, typename _Dom::value_type >::result_type > | operator& (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __bitwise_and, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __bitwise_and, typename _Dom1::value_type >::result_type > | operator& (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_and, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __bitwise_and, typename _Dom::value_type >::result_type > | operator& (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_and, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __bitwise_and, typename _Dom::value_type >::result_type > | operator& (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_and, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __bitwise_and, typename _Dom::value_type >::result_type > | operator& (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __logical_and, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __logical_and, typename _Dom1::value_type >::result_type > | operator&& (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __logical_and, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __logical_and, typename _Dom::value_type >::result_type > | operator&& (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __logical_and, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __logical_and, typename _Dom::value_type >::result_type > | operator&& (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __logical_and, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __logical_and, typename _Dom::value_type >::result_type > | operator&& (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __logical_and, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __logical_and, typename _Dom::value_type >::result_type > | operator&& (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
_Ios_Fmtflags & | operator&= (_Ios_Fmtflags &__a, _Ios_Fmtflags __b) |
_Ios_Openmode & | operator&= (_Ios_Openmode &__a, _Ios_Openmode __b) |
_Ios_Iostate & | operator&= (_Ios_Iostate &__a, _Ios_Iostate __b) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __multiplies, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __multiplies, typename _Dom1::value_type >::result_type > | operator* (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __multiplies, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __multiplies, typename _Dom::value_type >::result_type > | operator* (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __multiplies, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __multiplies, typename _Dom::value_type >::result_type > | operator* (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __multiplies, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __multiplies, typename _Dom::value_type >::result_type > | operator* (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __multiplies, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __multiplies, typename _Dom::value_type >::result_type > | operator* (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
_Bit_iterator | operator+ (ptrdiff_t __n, const _Bit_iterator &__x) |
template<typename _Tp , typename _Ref , typename _Ptr > | |
_Deque_iterator< _Tp, _Ref, _Ptr > | operator+ (ptrdiff_t __n, const _Deque_iterator< _Tp, _Ref, _Ptr > &__x) |
_Bit_const_iterator | operator+ (ptrdiff_t __n, const _Bit_const_iterator &__x) |
template<class _Dom > | |
_Expr< _BinClos< __plus, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __plus, typename _Dom::value_type >::result_type > | operator+ (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __plus, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __plus, typename _Dom1::value_type >::result_type > | operator+ (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __plus, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __plus, typename _Dom::value_type >::result_type > | operator+ (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __plus, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __plus, typename _Dom::value_type >::result_type > | operator+ (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __plus, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __plus, typename _Dom::value_type >::result_type > | operator+ (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Iterator > | |
move_iterator< _Iterator > | operator+ (typename move_iterator< _Iterator >::difference_type __n, const move_iterator< _Iterator > &__x) |
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) |
ptrdiff_t | operator- (const _Bit_iterator_base &__x, const _Bit_iterator_base &__y) |
template<typename _Tp , typename _Ref , typename _Ptr > | |
_Deque_iterator< _Tp, _Ref, _Ptr >::difference_type | operator- (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y) |
template<typename _Tp , typename _RefL , typename _PtrL , typename _RefR , typename _PtrR > | |
_Deque_iterator< _Tp, _RefL, _PtrL >::difference_type | operator- (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) |
template<class _Dom > | |
_Expr< _BinClos< __minus, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __minus, typename _Dom::value_type >::result_type > | operator- (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __minus, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __minus, typename _Dom::value_type >::result_type > | operator- (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __minus, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __minus, typename _Dom::value_type >::result_type > | operator- (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __minus, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __minus, typename _Dom1::value_type >::result_type > | operator- (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __minus, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __minus, typename _Dom::value_type >::result_type > | operator- (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<typename _IteratorL , typename _IteratorR > | |
auto | operator- (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) -> decltype(__x.base()-__y.base()) |
template<class _Dom > | |
_Expr< _BinClos< __divides, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __divides, typename _Dom::value_type >::result_type > | operator/ (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __divides, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __divides, typename _Dom::value_type >::result_type > | operator/ (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __divides, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __divides, typename _Dom1::value_type >::result_type > | operator/ (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __divides, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __divides, typename _Dom::value_type >::result_type > | operator/ (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __divides, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __divides, typename _Dom::value_type >::result_type > | operator/ (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _T1 , class _T2 > | |
bool | operator< (const pair< _T1, _T2 > &__x, const pair< _T1, _T2 > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator< (const stack< _Tp, _Seq > &__x, const stack< _Tp, _Seq > &__y) |
template<typename _Tp , typename _Ref , typename _Ptr > | |
bool | operator< (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y) |
template<typename _Tp , typename _RefL , typename _PtrL , typename _RefR , typename _PtrR > | |
bool | operator< (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator< (const queue< _Tp, _Seq > &__x, const queue< _Tp, _Seq > &__y) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __less, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __less, typename _Dom1::value_type >::result_type > | operator< (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __less, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __less, typename _Dom::value_type >::result_type > | operator< (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __less, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __less, typename _Dom::value_type >::result_type > | operator< (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __less, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __less, typename _Dom::value_type >::result_type > | operator< (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __less, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __less, typename _Dom::value_type >::result_type > | operator< (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp , typename _Tp_Deleter , typename _Up , typename _Up_Deleter > | |
bool | operator< (const unique_ptr< _Tp, _Tp_Deleter > &__x, const unique_ptr< _Up, _Up_Deleter > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator< (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator< (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator< (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | operator< (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator< (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator< (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator< (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator< (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly) |
template<typename _Tp , typename _Alloc > | |
bool | operator< (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator< (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y) |
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<class _Dom > | |
_Expr< _BinClos< __shift_left, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __shift_left, typename _Dom::value_type >::result_type > | operator<< (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __shift_left, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __shift_left, typename _Dom::value_type >::result_type > | operator<< (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __shift_left, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __shift_left, typename _Dom::value_type >::result_type > | operator<< (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __shift_left, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __shift_left, typename _Dom::value_type >::result_type > | operator<< (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __shift_left, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __shift_left, typename _Dom1::value_type >::result_type > | operator<< (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<typename _CharT , typename _Traits , typename _Alloc , template< typename, typename, typename > class _Base> | |
basic_ostream< _CharT, _Traits > & | operator<< (basic_ostream< _CharT, _Traits > &__os, const __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &__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<class _T1 , class _T2 > | |
bool | operator<= (const pair< _T1, _T2 > &__x, const pair< _T1, _T2 > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator<= (const stack< _Tp, _Seq > &__x, const stack< _Tp, _Seq > &__y) |
template<typename _Tp , typename _Ref , typename _Ptr > | |
bool | operator<= (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y) |
template<typename _Tp , typename _RefL , typename _PtrL , typename _RefR , typename _PtrR > | |
bool | operator<= (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator<= (const queue< _Tp, _Seq > &__x, const queue< _Tp, _Seq > &__y) |
template<class _Dom > | |
_Expr< _BinClos< __less_equal, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __less_equal, typename _Dom::value_type >::result_type > | operator<= (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __less_equal, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __less_equal, typename _Dom::value_type >::result_type > | operator<= (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __less_equal, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __less_equal, typename _Dom::value_type >::result_type > | operator<= (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __less_equal, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __less_equal, typename _Dom1::value_type >::result_type > | operator<= (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __less_equal, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __less_equal, typename _Dom::value_type >::result_type > | operator<= (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<typename _Tp , typename _Tp_Deleter , typename _Up , typename _Up_Deleter > | |
bool | operator<= (const unique_ptr< _Tp, _Tp_Deleter > &__x, const unique_ptr< _Up, _Up_Deleter > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator<= (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator<= (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator<= (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | operator<= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator<= (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator<= (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator<= (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator<= (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly) |
template<typename _Tp , typename _Alloc > | |
bool | operator<= (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator<= (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y) |
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 _T1 , typename _T2 > | |
bool | operator== (const allocator< _T1 > &, const allocator< _T2 > &) |
template<typename _Tp > | |
bool | operator== (const allocator< _Tp > &, const allocator< _Tp > &) |
template<typename _Tp , typename _CharT , typename _Traits , typename _Dist > | |
bool | operator== (const istream_iterator< _Tp, _CharT, _Traits, _Dist > &__x, const istream_iterator< _Tp, _CharT, _Traits, _Dist > &__y) |
template<class _T1 , class _T2 > | |
bool | operator== (const pair< _T1, _T2 > &__x, const pair< _T1, _T2 > &__y) |
template<typename _CharT , typename _Traits > | |
bool | operator== (const istreambuf_iterator< _CharT, _Traits > &__a, const istreambuf_iterator< _CharT, _Traits > &__b) |
template<typename _StateT > | |
bool | operator== (const fpos< _StateT > &__lhs, const fpos< _StateT > &__rhs) |
template<typename _Tp , typename _Seq > | |
bool | operator== (const stack< _Tp, _Seq > &__x, const stack< _Tp, _Seq > &__y) |
template<typename _Tp , typename _Ref , typename _Ptr > | |
bool | operator== (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y) |
template<typename _Tp , typename _RefL , typename _PtrL , typename _RefR , typename _PtrR > | |
bool | operator== (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator== (const _Fwd_list_iterator< _Tp, _Alloc > &__x, const _Fwd_list_const_iterator< _Tp, _Alloc > &__y) |
template<typename _Val > | |
bool | operator== (const _List_iterator< _Val > &__x, const _List_const_iterator< _Val > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator== (const queue< _Tp, _Seq > &__x, const queue< _Tp, _Seq > &__y) |
template<typename _Val > | |
bool | operator== (const _Rb_tree_iterator< _Val > &__x, const _Rb_tree_const_iterator< _Val > &__y) |
template<typename _Tp , typename _Tp_Deleter , typename _Up , typename _Up_Deleter > | |
bool | operator== (const unique_ptr< _Tp, _Tp_Deleter > &__x, const unique_ptr< _Up, _Up_Deleter > &__y) |
template<class _Dom > | |
_Expr< _BinClos< __equal_to, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __equal_to, typename _Dom::value_type >::result_type > | operator== (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __equal_to, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __equal_to, typename _Dom::value_type >::result_type > | operator== (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __equal_to, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __equal_to, typename _Dom1::value_type >::result_type > | operator== (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __equal_to, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __equal_to, typename _Dom::value_type >::result_type > | operator== (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __equal_to, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __equal_to, typename _Dom::value_type >::result_type > | operator== (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator== (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator== (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator== (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | operator== (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator== (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator== (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator== (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator== (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly) |
template<typename _Tp , typename _Alloc > | |
bool | operator== (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator== (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y) |
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 > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, bool >::__type | operator== (const basic_string< _CharT > &__lhs, const basic_string< _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 _CharT *__rhs) |
template<class _T1 , class _T2 > | |
bool | operator> (const pair< _T1, _T2 > &__x, const pair< _T1, _T2 > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator> (const stack< _Tp, _Seq > &__x, const stack< _Tp, _Seq > &__y) |
template<typename _Tp , typename _Ref , typename _Ptr > | |
bool | operator> (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y) |
template<typename _Tp , typename _RefL , typename _PtrL , typename _RefR , typename _PtrR > | |
bool | operator> (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator> (const queue< _Tp, _Seq > &__x, const queue< _Tp, _Seq > &__y) |
template<class _Dom > | |
_Expr< _BinClos< __greater, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __greater, typename _Dom::value_type >::result_type > | operator> (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __greater, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __greater, typename _Dom::value_type >::result_type > | operator> (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __greater, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __greater, typename _Dom::value_type >::result_type > | operator> (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __greater, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __greater, typename _Dom1::value_type >::result_type > | operator> (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __greater, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __greater, typename _Dom::value_type >::result_type > | operator> (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<typename _Tp , typename _Tp_Deleter , typename _Up , typename _Up_Deleter > | |
bool | operator> (const unique_ptr< _Tp, _Tp_Deleter > &__x, const unique_ptr< _Up, _Up_Deleter > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator> (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator> (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator> (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | operator> (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator> (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator> (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator> (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator> (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly) |
template<typename _Tp , typename _Alloc > | |
bool | operator> (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator> (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y) |
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<class _T1 , class _T2 > | |
bool | operator>= (const pair< _T1, _T2 > &__x, const pair< _T1, _T2 > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator>= (const stack< _Tp, _Seq > &__x, const stack< _Tp, _Seq > &__y) |
template<typename _Tp , typename _Ref , typename _Ptr > | |
bool | operator>= (const _Deque_iterator< _Tp, _Ref, _Ptr > &__x, const _Deque_iterator< _Tp, _Ref, _Ptr > &__y) |
template<typename _Tp , typename _RefL , typename _PtrL , typename _RefR , typename _PtrR > | |
bool | operator>= (const _Deque_iterator< _Tp, _RefL, _PtrL > &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) |
template<typename _Tp , typename _Seq > | |
bool | operator>= (const queue< _Tp, _Seq > &__x, const queue< _Tp, _Seq > &__y) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __greater_equal, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __greater_equal, typename _Dom1::value_type >::result_type > | operator>= (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __greater_equal, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __greater_equal, typename _Dom::value_type >::result_type > | operator>= (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __greater_equal, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __greater_equal, typename _Dom::value_type >::result_type > | operator>= (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __greater_equal, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __greater_equal, typename _Dom::value_type >::result_type > | operator>= (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __greater_equal, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __greater_equal, typename _Dom::value_type >::result_type > | operator>= (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<typename _Tp , typename _Tp_Deleter , typename _Up , typename _Up_Deleter > | |
bool | operator>= (const unique_ptr< _Tp, _Tp_Deleter > &__x, const unique_ptr< _Up, _Up_Deleter > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator>= (const multiset< _Key, _Compare, _Alloc > &__x, const multiset< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
bool | operator>= (const set< _Key, _Compare, _Alloc > &__x, const set< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator>= (const multimap< _Key, _Tp, _Compare, _Alloc > &__x, const multimap< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
bool | operator>= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
bool | operator>= (const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator>= (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator>= (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator>= (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly) |
template<typename _Tp , typename _Alloc > | |
bool | operator>= (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
bool | operator>= (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y) |
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<class _Dom > | |
_Expr< _BinClos< __shift_right, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __shift_right, typename _Dom::value_type >::result_type > | operator>> (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __shift_right, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __shift_right, typename _Dom1::value_type >::result_type > | operator>> (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __shift_right, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __shift_right, typename _Dom::value_type >::result_type > | operator>> (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __shift_right, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __shift_right, typename _Dom::value_type >::result_type > | operator>> (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __shift_right, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __shift_right, typename _Dom::value_type >::result_type > | operator>> (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<typename _CharT , typename _Traits , typename _Alloc , template< typename, typename, typename > class _Base> | |
basic_istream< _CharT, _Traits > & | operator>> (basic_istream< _CharT, _Traits > &__is, __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &__str) |
template<typename _CharT , typename _Traits , typename _Alloc > | |
basic_istream< _CharT, _Traits > & | operator>> (basic_istream< _CharT, _Traits > &__is, basic_string< _CharT, _Traits, _Alloc > &__str) |
template<> | |
basic_istream< char > & | operator>> (basic_istream< char > &__is, basic_string< char > &__str) |
_Ios_Fmtflags | operator^ (_Ios_Fmtflags __a, _Ios_Fmtflags __b) |
_Ios_Openmode | operator^ (_Ios_Openmode __a, _Ios_Openmode __b) |
_Ios_Iostate | operator^ (_Ios_Iostate __a, _Ios_Iostate __b) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_xor, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __bitwise_xor, typename _Dom::value_type >::result_type > | operator^ (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_xor, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __bitwise_xor, typename _Dom::value_type >::result_type > | operator^ (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_xor, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __bitwise_xor, typename _Dom::value_type >::result_type > | operator^ (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __bitwise_xor, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __bitwise_xor, typename _Dom1::value_type >::result_type > | operator^ (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_xor, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __bitwise_xor, typename _Dom::value_type >::result_type > | operator^ (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
_Ios_Fmtflags & | operator^= (_Ios_Fmtflags &__a, _Ios_Fmtflags __b) |
_Ios_Openmode & | operator^= (_Ios_Openmode &__a, _Ios_Openmode __b) |
_Ios_Iostate & | operator^= (_Ios_Iostate &__a, _Ios_Iostate __b) |
_Ios_Fmtflags | operator| (_Ios_Fmtflags __a, _Ios_Fmtflags __b) |
_Ios_Openmode | operator| (_Ios_Openmode __a, _Ios_Openmode __b) |
_Ios_Iostate | operator| (_Ios_Iostate __a, _Ios_Iostate __b) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_or, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __bitwise_or, typename _Dom::value_type >::result_type > | operator| (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_or, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __bitwise_or, typename _Dom::value_type >::result_type > | operator| (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_or, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __bitwise_or, typename _Dom::value_type >::result_type > | operator| (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __bitwise_or, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __bitwise_or, typename _Dom::value_type >::result_type > | operator| (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __bitwise_or, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __bitwise_or, typename _Dom1::value_type >::result_type > | operator| (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
_Ios_Fmtflags & | operator|= (_Ios_Fmtflags &__a, _Ios_Fmtflags __b) |
_Ios_Openmode & | operator|= (_Ios_Openmode &__a, _Ios_Openmode __b) |
_Ios_Iostate & | operator|= (_Ios_Iostate &__a, _Ios_Iostate __b) |
template<class _Dom > | |
_Expr< _BinClos< __logical_or, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename __fun< __logical_or, typename _Dom::value_type >::result_type > | operator|| (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __logical_or, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __logical_or, typename _Dom::value_type >::result_type > | operator|| (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__v) |
template<class _Dom > | |
_Expr< _BinClos< __logical_or, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename __fun< __logical_or, typename _Dom::value_type >::result_type > | operator|| (const valarray< typename _Dom::value_type > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<class _Dom > | |
_Expr< _BinClos< __logical_or, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename __fun< __logical_or, typename _Dom::value_type >::result_type > | operator|| (const _Expr< _Dom, typename _Dom::value_type > &__v, const typename _Dom::value_type &__t) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __logical_or, _Expr, _Expr, _Dom1, _Dom2 >, typename __fun< __logical_or, typename _Dom1::value_type >::result_type > | operator|| (const _Expr< _Dom1, typename _Dom1::value_type > &__v, const _Expr< _Dom2, typename _Dom2::value_type > &__w) |
_Ios_Fmtflags | operator~ (_Ios_Fmtflags __a) |
_Ios_Openmode | operator~ (_Ios_Openmode __a) |
_Ios_Iostate | operator~ (_Ios_Iostate __a) |
template<typename _RAIter > | |
void | partial_sort (_RAIter, _RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | partial_sort (_RAIter, _RAIter, _RAIter, _Compare) |
template<typename _RandomAccessIterator > | |
void | partial_sort (_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | partial_sort (_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) |
template<typename _IIter , typename _RAIter > | |
_RAIter | partial_sort_copy (_IIter, _IIter, _RAIter, _RAIter) |
template<typename _IIter , typename _RAIter , typename _Compare > | |
_RAIter | partial_sort_copy (_IIter, _IIter, _RAIter, _RAIter, _Compare) |
template<typename _InputIterator , typename _RandomAccessIterator > | |
_RandomAccessIterator | partial_sort_copy (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) |
template<typename _InputIterator , typename _RandomAccessIterator , typename _Compare > | |
_RandomAccessIterator | partial_sort_copy (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) |
template<typename _InputIterator , typename _OutputIterator > | |
_OutputIterator | partial_sum (_InputIterator __first, _InputIterator __last, _OutputIterator __result) |
template<typename _InputIterator , typename _OutputIterator , typename _BinaryOperation > | |
_OutputIterator | partial_sum (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) |
template<typename _BIter , typename _Predicate > | |
_BIter | partition (_BIter, _BIter, _Predicate) |
template<typename _ForwardIterator , typename _Predicate > | |
_ForwardIterator | partition (_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) |
template<typename _IIter , typename _OIter1 , typename _OIter2 , typename _Predicate > | |
pair< _OIter1, _OIter2 > | partition_copy (_IIter, _IIter, _OIter1, _OIter2, _Predicate) |
template<typename _InputIterator , typename _OutputIterator1 , typename _OutputIterator2 , typename _Predicate > | |
pair< _OutputIterator1, _OutputIterator2 > | partition_copy (_InputIterator __first, _InputIterator __last, _OutputIterator1 __out_true, _OutputIterator2 __out_false, _Predicate __pred) |
template<typename _FIter , typename _Predicate > | |
_FIter | partition_point (_FIter, _FIter, _Predicate) |
template<typename _ForwardIterator , typename _Predicate > | |
_ForwardIterator | partition_point (_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) |
template<typename _RandomAccessIterator > | |
void | pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RAIter > | |
void | pop_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | pop_heap (_RAIter, _RAIter, _Compare) |
template<class _Dom1 , class _Dom2 > | |
_Expr< _BinClos< __pow, _Expr, _Expr, _Dom1, _Dom2 >, typename _Dom1::value_type > | pow (const _Expr< _Dom1, typename _Dom1::value_type > &__e1, const _Expr< _Dom2, typename _Dom2::value_type > &__e2) |
template<class _Dom > | |
_Expr< _BinClos< __pow, _ValArray, _Expr, typename _Dom::value_type, _Dom >, typename _Dom::value_type > | pow (const valarray< typename _Dom::valarray > &__v, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _BinClos< __pow, _ValArray, _ValArray, _Tp, _Tp >, _Tp > | pow (const valarray< _Tp > &__v, const valarray< _Tp > &__w) |
template<class _Dom > | |
_Expr< _BinClos< __pow, _Constant, _Expr, typename _Dom::value_type, _Dom >, typename _Dom::value_type > | pow (const typename _Dom::value_type &__t, const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _BinClos< __pow, _Constant, _ValArray, _Tp, _Tp >, _Tp > | pow (const _Tp &__t, const valarray< _Tp > &__v) |
template<typename _Tp > | |
_Expr< _BinClos< __pow, _ValArray, _Constant, _Tp, _Tp >, _Tp > | pow (const valarray< _Tp > &__v, const _Tp &__t) |
template<class _Dom > | |
_Expr< _BinClos< __pow, _Expr, _Constant, _Dom, typename _Dom::value_type >, typename _Dom::value_type > | pow (const _Expr< _Dom, typename _Dom::value_type > &__e, const typename _Dom::value_type &__t) |
template<class _Dom > | |
_Expr< _BinClos< __pow, _Expr, _ValArray, _Dom, typename _Dom::value_type >, typename _Dom::value_type > | pow (const _Expr< _Dom, typename _Dom::value_type > &__e, const valarray< typename _Dom::value_type > &__v) |
template<typename _BidirectionalIterator > | |
_BidirectionalIterator | prev (_BidirectionalIterator __x, typename iterator_traits< _BidirectionalIterator >::difference_type __n=1) |
template<typename _BIter > | |
bool | prev_permutation (_BIter, _BIter) |
template<typename _BIter , typename _Compare > | |
bool | prev_permutation (_BIter, _BIter, _Compare) |
template<typename _BidirectionalIterator > | |
bool | prev_permutation (_BidirectionalIterator __first, _BidirectionalIterator __last) |
template<typename _BidirectionalIterator , typename _Compare > | |
bool | prev_permutation (_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) |
template<typename _Arg , typename _Result > | |
pointer_to_unary_function< _Arg, _Result > | ptr_fun (_Result(*__x)(_Arg)) |
template<typename _Arg1 , typename _Arg2 , typename _Result > | |
pointer_to_binary_function< _Arg1, _Arg2, _Result > | ptr_fun (_Result(*__x)(_Arg1, _Arg2)) |
template<typename _RandomAccessIterator > | |
void | push_heap (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | push_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RAIter > | |
void | push_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | push_heap (_RAIter, _RAIter, _Compare) |
template<typename _RAIter > | |
void | random_shuffle (_RAIter, _RAIter) |
template<typename _RAIter , typename _Generator > | |
void | random_shuffle (_RAIter, _RAIter, _Generator &) |
template<typename _RandomAccessIterator > | |
void | random_shuffle (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _RandomNumberGenerator > | |
void | random_shuffle (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomNumberGenerator &__rand) |
template<typename _FIter , typename _Tp > | |
_FIter | remove (_FIter, _FIter, const _Tp &) |
template<typename _ForwardIterator , typename _Tp > | |
_ForwardIterator | remove (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__value) |
template<typename _IIter , typename _OIter , typename _Tp > | |
_OIter | remove_copy (_IIter, _IIter, _OIter, const _Tp &) |
template<typename _InputIterator , typename _OutputIterator , typename _Tp > | |
_OutputIterator | remove_copy (_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp &__value) |
template<typename _IIter , typename _OIter , typename _Predicate > | |
_OIter | remove_copy_if (_IIter, _IIter, _OIter, _Predicate) |
template<typename _InputIterator , typename _OutputIterator , typename _Predicate > | |
_OutputIterator | remove_copy_if (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) |
template<typename _FIter , typename _Predicate > | |
_FIter | remove_if (_FIter, _FIter, _Predicate) |
template<typename _ForwardIterator , typename _Predicate > | |
_ForwardIterator | remove_if (_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) |
template<typename _FIter , typename _Tp > | |
void | replace (_FIter, _FIter, const _Tp &, const _Tp &) |
template<typename _ForwardIterator , typename _Tp > | |
void | replace (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__old_value, const _Tp &__new_value) |
template<typename _IIter , typename _OIter , typename _Tp > | |
_OIter | replace_copy (_IIter, _IIter, _OIter, const _Tp &, const _Tp &) |
template<typename _InputIterator , typename _OutputIterator , typename _Tp > | |
_OutputIterator | replace_copy (_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp &__old_value, const _Tp &__new_value) |
template<typename _Iter , typename _OIter , typename _Predicate , typename _Tp > | |
_OIter | replace_copy_if (_Iter, _Iter, _OIter, _Predicate, const _Tp &) |
template<typename _InputIterator , typename _OutputIterator , typename _Predicate , typename _Tp > | |
_OutputIterator | replace_copy_if (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred, const _Tp &__new_value) |
template<typename _FIter , typename _Predicate , typename _Tp > | |
void | replace_if (_FIter, _FIter, _Predicate, const _Tp &) |
template<typename _ForwardIterator , typename _Predicate , typename _Tp > | |
void | replace_if (_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp &__new_value) |
void | rethrow_exception (exception_ptr) __attribute__((__noreturn__)) |
template<typename _Tp > | |
void | return_temporary_buffer (_Tp *__p) |
template<typename _BIter > | |
void | reverse (_BIter, _BIter) |
template<typename _BidirectionalIterator > | |
void | reverse (_BidirectionalIterator __first, _BidirectionalIterator __last) |
template<typename _BIter , typename _OIter > | |
_OIter | reverse_copy (_BIter, _BIter, _OIter) |
template<typename _BidirectionalIterator , typename _OutputIterator > | |
_OutputIterator | reverse_copy (_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) |
ios_base & | right (ios_base &__base) |
template<typename _FIter > | |
void | rotate (_FIter, _FIter, _FIter) |
template<typename _ForwardIterator > | |
void | rotate (_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) |
template<typename _FIter , typename _OIter > | |
_OIter | rotate_copy (_FIter, _FIter, _FIter, _OIter) |
template<typename _ForwardIterator , typename _OutputIterator > | |
_OutputIterator | rotate_copy (_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) |
ios_base & | scientific (ios_base &__base) |
template<typename _FIter1 , typename _FIter2 > | |
_FIter1 | search (_FIter1, _FIter1, _FIter2, _FIter2) |
template<typename _FIter1 , typename _FIter2 , typename _BinaryPredicate > | |
_FIter1 | search (_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 > | |
_ForwardIterator1 | search (_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 , typename _BinaryPredicate > | |
_ForwardIterator1 | search (_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate) |
template<typename _FIter , typename _Size , typename _Tp > | |
_FIter | search_n (_FIter, _FIter, _Size, const _Tp &) |
template<typename _FIter , typename _Size , typename _Tp , typename _BinaryPredicate > | |
_FIter | search_n (_FIter, _FIter, _Size, const _Tp &, _BinaryPredicate) |
template<typename _ForwardIterator , typename _Integer , typename _Tp > | |
_ForwardIterator | search_n (_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp &__val) |
template<typename _ForwardIterator , typename _Integer , typename _Tp , typename _BinaryPredicate > | |
_ForwardIterator | search_n (_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp &__val, _BinaryPredicate __binary_pred) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | set_difference (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | set_difference (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator > | |
_OutputIterator | set_difference (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator , typename _Compare > | |
_OutputIterator | set_difference (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | set_intersection (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | set_intersection (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator > | |
_OutputIterator | set_intersection (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator , typename _Compare > | |
_OutputIterator | set_intersection (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | set_symmetric_difference (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | set_symmetric_difference (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator > | |
_OutputIterator | set_symmetric_difference (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator , typename _Compare > | |
_OutputIterator | set_symmetric_difference (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | set_union (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | set_union (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator > | |
_OutputIterator | set_union (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator , typename _Compare > | |
_OutputIterator | set_union (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) |
ios_base & | showbase (ios_base &__base) |
ios_base & | showpoint (ios_base &__base) |
ios_base & | showpos (ios_base &__base) |
template<class _Dom > | |
_Expr< _UnClos< __sin, _Expr, _Dom >, typename _Dom::value_type > | sin (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __sin, _ValArray, _Tp >, _Tp > | sin (const valarray< _Tp > &__v) |
template<typename _Tp > | |
_Expr< _UnClos< __sinh, _ValArray, _Tp >, _Tp > | sinh (const valarray< _Tp > &__v) |
template<class _Dom > | |
_Expr< _UnClos< __sinh, _Expr, _Dom >, typename _Dom::value_type > | sinh (const _Expr< _Dom, typename _Dom::value_type > &__e) |
ios_base & | skipws (ios_base &__base) |
template<typename _RAIter > | |
void | sort (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | sort (_RAIter, _RAIter, _Compare) |
template<typename _RandomAccessIterator > | |
void | sort (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RandomAccessIterator > | |
void | sort_heap (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | sort_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RAIter > | |
void | sort_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | sort_heap (_RAIter, _RAIter, _Compare) |
template<typename _Tp > | |
_Expr< _UnClos< __sqrt, _ValArray, _Tp >, _Tp > | sqrt (const valarray< _Tp > &__v) |
template<class _Dom > | |
_Expr< _UnClos< __sqrt, _Expr, _Dom >, typename _Dom::value_type > | sqrt (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _BIter , typename _Predicate > | |
_BIter | stable_partition (_BIter, _BIter, _Predicate) |
template<typename _ForwardIterator , typename _Predicate > | |
_ForwardIterator | stable_partition (_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) |
template<typename _RAIter > | |
void | stable_sort (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | stable_sort (_RAIter, _RAIter, _Compare) |
template<typename _RandomAccessIterator > | |
void | stable_sort (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | stable_sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<class _T1 , class _T2 > | |
void | swap (pair< _T1, _T2 > &__x, pair< _T1, _T2 > &__y) |
template<class _T1 , class _T2 > | |
void | swap (pair< _T1, _T2 > &&__x, pair< _T1, _T2 > &__y) |
template<class _T1 , class _T2 > | |
void | swap (pair< _T1, _T2 > &__x, pair< _T1, _T2 > &&__y) |
template<typename _Tp , typename _Seq > | |
void | swap (stack< _Tp, _Seq > &__x, stack< _Tp, _Seq > &__y) |
template<typename _Tp , typename _Seq > | |
void | swap (stack< _Tp, _Seq > &&__x, stack< _Tp, _Seq > &__y) |
template<typename _Tp , typename _Seq > | |
void | swap (stack< _Tp, _Seq > &__x, stack< _Tp, _Seq > &&__y) |
template<typename _Tp , typename _Seq > | |
void | swap (queue< _Tp, _Seq > &__x, queue< _Tp, _Seq > &__y) |
template<typename _Tp , typename _Seq > | |
void | swap (queue< _Tp, _Seq > &&__x, queue< _Tp, _Seq > &__y) |
template<typename _Tp , typename _Seq > | |
void | swap (queue< _Tp, _Seq > &__x, queue< _Tp, _Seq > &&__y) |
template<typename _Tp , typename _Tp_Deleter > | |
void | swap (unique_ptr< _Tp, _Tp_Deleter > &__x, unique_ptr< _Tp, _Tp_Deleter > &__y) |
template<typename _Tp , typename _Tp_Deleter > | |
void | swap (unique_ptr< _Tp, _Tp_Deleter > &&__x, unique_ptr< _Tp, _Tp_Deleter > &__y) |
template<typename _Tp , typename _Tp_Deleter > | |
void | swap (unique_ptr< _Tp, _Tp_Deleter > &__x, unique_ptr< _Tp, _Tp_Deleter > &&__y) |
template<typename _Tp > | |
void | swap (_Tp &__a, _Tp &__b) |
template<typename _Tp , size_t _Nm> | |
void | swap (_Tp(&)[_Nm], _Tp(&)[_Nm]) |
template<typename _Tp , typename _Sequence , typename _Compare > | |
void | swap (priority_queue< _Tp, _Sequence, _Compare > &__x, priority_queue< _Tp, _Sequence, _Compare > &__y) |
template<typename _Tp , typename _Sequence , typename _Compare > | |
void | swap (priority_queue< _Tp, _Sequence, _Compare > &&__x, priority_queue< _Tp, _Sequence, _Compare > &__y) |
template<typename _Tp , typename _Sequence , typename _Compare > | |
void | swap (priority_queue< _Tp, _Sequence, _Compare > &__x, priority_queue< _Tp, _Sequence, _Compare > &&__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
void | swap (multiset< _Key, _Compare, _Alloc > &__x, multiset< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
void | swap (multiset< _Key, _Compare, _Alloc > &&__x, multiset< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
void | swap (multiset< _Key, _Compare, _Alloc > &__x, multiset< _Key, _Compare, _Alloc > &&__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
void | swap (set< _Key, _Compare, _Alloc > &__x, set< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
void | swap (set< _Key, _Compare, _Alloc > &&__x, set< _Key, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Compare , typename _Alloc > | |
void | swap (set< _Key, _Compare, _Alloc > &__x, set< _Key, _Compare, _Alloc > &&__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
void | swap (multimap< _Key, _Tp, _Compare, _Alloc > &__x, multimap< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
void | swap (multimap< _Key, _Tp, _Compare, _Alloc > &&__x, multimap< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
void | swap (multimap< _Key, _Tp, _Compare, _Alloc > &__x, multimap< _Key, _Tp, _Compare, _Alloc > &&__y) |
template<typename _Key , typename _Val , typename _KeyOfValue , typename _Compare , typename _Alloc > | |
void | swap (_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
void | swap (map< _Key, _Tp, _Compare, _Alloc > &__x, map< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
void | swap (map< _Key, _Tp, _Compare, _Alloc > &&__x, map< _Key, _Tp, _Compare, _Alloc > &__y) |
template<typename _Key , typename _Tp , typename _Compare , typename _Alloc > | |
void | swap (map< _Key, _Tp, _Compare, _Alloc > &__x, map< _Key, _Tp, _Compare, _Alloc > &&__y) |
template<typename _Tp , typename _Alloc > | |
void | swap (vector< _Tp, _Alloc > &__x, vector< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
void | swap (vector< _Tp, _Alloc > &&__x, vector< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
void | swap (vector< _Tp, _Alloc > &__x, vector< _Tp, _Alloc > &&__y) |
template<typename _Tp , typename _Alloc > | |
void | swap (forward_list< _Tp, _Alloc > &__lx, forward_list< _Tp, _Alloc > &__ly) |
template<typename _Tp , typename _Alloc > | |
void | swap (forward_list< _Tp, _Alloc > &&__lx, forward_list< _Tp, _Alloc > &__ly) |
template<typename _Tp , typename _Alloc > | |
void | swap (forward_list< _Tp, _Alloc > &__lx, forward_list< _Tp, _Alloc > &&__ly) |
template<typename _Tp , typename _Alloc > | |
void | swap (list< _Tp, _Alloc > &__x, list< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
void | swap (list< _Tp, _Alloc > &&__x, list< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
void | swap (list< _Tp, _Alloc > &__x, list< _Tp, _Alloc > &&__y) |
template<typename _Tp , typename _Alloc > | |
void | swap (deque< _Tp, _Alloc > &__x, deque< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
void | swap (deque< _Tp, _Alloc > &&__x, deque< _Tp, _Alloc > &__y) |
template<typename _Tp , typename _Alloc > | |
void | swap (deque< _Tp, _Alloc > &__x, deque< _Tp, _Alloc > &&__y) |
template<typename _CharT , typename _Traits , typename _Alloc > | |
void | swap (basic_string< _CharT, _Traits, _Alloc > &__lhs, basic_string< _CharT, _Traits, _Alloc > &__rhs) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 > | |
_ForwardIterator2 | swap_ranges (_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) |
template<typename _FIter1 , typename _FIter2 > | |
_FIter2 | swap_ranges (_FIter1, _FIter1, _FIter2) |
template<class _Dom > | |
_Expr< _UnClos< __tan, _Expr, _Dom >, typename _Dom::value_type > | tan (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _Tp > | |
_Expr< _UnClos< __tan, _ValArray, _Tp >, _Tp > | tan (const valarray< _Tp > &__v) |
template<typename _Tp > | |
_Expr< _UnClos< __tanh, _ValArray, _Tp >, _Tp > | tanh (const valarray< _Tp > &__v) |
template<class _Dom > | |
_Expr< _UnClos< __tanh, _Expr, _Dom >, typename _Dom::value_type > | tanh (const _Expr< _Dom, typename _Dom::value_type > &__e) |
template<typename _CharT > | |
_CharT | tolower (_CharT __c, const locale &__loc) |
template<typename _CharT > | |
_CharT | toupper (_CharT __c, const locale &__loc) |
template<typename _IIter , typename _OIter , typename _UnaryOperation > | |
_OIter | transform (_IIter, _IIter, _OIter, _UnaryOperation) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _BinaryOperation > | |
_OIter | transform (_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation) |
template<typename _InputIterator , typename _OutputIterator , typename _UnaryOperation > | |
_OutputIterator | transform (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __unary_op) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator , typename _BinaryOperation > | |
_OutputIterator | transform (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _OutputIterator __result, _BinaryOperation __binary_op) |
template<typename _InputIterator , typename _ForwardIterator > | |
_ForwardIterator | uninitialized_copy (_InputIterator __first, _InputIterator __last, _ForwardIterator __result) |
template<typename _InputIterator , typename _Size , typename _ForwardIterator > | |
_ForwardIterator | uninitialized_copy_n (_InputIterator __first, _Size __n, _ForwardIterator __result) |
template<typename _ForwardIterator , typename _Tp > | |
void | uninitialized_fill (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__x) |
template<typename _ForwardIterator , typename _Size , typename _Tp > | |
void | uninitialized_fill_n (_ForwardIterator __first, _Size __n, const _Tp &__x) |
template<typename _FIter > | |
_FIter | unique (_FIter, _FIter) |
template<typename _FIter , typename _BinaryPredicate > | |
_FIter | unique (_FIter, _FIter, _BinaryPredicate) |
template<typename _ForwardIterator > | |
_ForwardIterator | unique (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _BinaryPredicate > | |
_ForwardIterator | unique (_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) |
template<typename _IIter , typename _OIter > | |
_OIter | unique_copy (_IIter, _IIter, _OIter) |
template<typename _IIter , typename _OIter , typename _BinaryPredicate > | |
_OIter | unique_copy (_IIter, _IIter, _OIter, _BinaryPredicate) |
template<typename _InputIterator , typename _OutputIterator > | |
_OutputIterator | unique_copy (_InputIterator __first, _InputIterator __last, _OutputIterator __result) |
template<typename _InputIterator , typename _OutputIterator , typename _BinaryPredicate > | |
_OutputIterator | unique_copy (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred) |
ios_base & | unitbuf (ios_base &__base) |
template<typename _FIter , typename _Tp > | |
_FIter | upper_bound (_FIter, _FIter, const _Tp &) |
template<typename _FIter , typename _Tp , typename _Compare > | |
_FIter | upper_bound (_FIter, _FIter, const _Tp &, _Compare) |
template<typename _ForwardIterator , typename _Tp > | |
_ForwardIterator | upper_bound (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val) |
template<typename _ForwardIterator , typename _Tp , typename _Compare > | |
_ForwardIterator | upper_bound (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val, _Compare __comp) |
ios_base & | uppercase (ios_base &__base) |
template<typename _Facet > | |
const _Facet & | use_facet (const locale &__loc) |
template<typename _Iterator > | |
bool | operator== (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
bool | operator< (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
bool | operator!= (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
bool | operator> (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
bool | operator<= (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
bool | operator>= (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
reverse_iterator< _Iterator >::difference_type | operator- (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
reverse_iterator< _Iterator > | operator+ (typename reverse_iterator< _Iterator >::difference_type __n, const reverse_iterator< _Iterator > &__x) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator== (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator< (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator!= (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator> (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator<= (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | operator>= (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
auto | operator- (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) -> decltype(__y.base()-__x.base()) |
Variables | |
struct std::auto_ptr_ref | _GLIBCXX_DEPRECATED_ATTR |
ISO C++ entities toplevel namespace is std.
typedef long long std::streamoff |
Type used by fpos, char_traits<char>, and char_traits<wchar_t>.
In clauses 21.1.3.1 and 27.4.1 streamoff is described as an implementation defined type. Note: In versions of GCC up to and including GCC 3.3, streamoff was typedef long.
Definition at line 94 of file postypes.h.
typedef fpos<mbstate_t> std::streampos |
File position for char streams.
Definition at line 228 of file postypes.h.
typedef ptrdiff_t std::streamsize |
Integral type for I/O operation counts and buffer sizes.
Definition at line 98 of file postypes.h.
typedef fpos<mbstate_t> std::u16streampos |
File position for char16_t streams.
Definition at line 234 of file postypes.h.
typedef fpos<mbstate_t> std::u32streampos |
File position for char32_t streams.
Definition at line 236 of file postypes.h.
typedef fpos<mbstate_t> std::wstreampos |
File position for wchar_t streams.
Definition at line 230 of file postypes.h.
anonymous enum |
Definition at line 2168 of file stl_algo.h.
|
inline |
This function controls the size of memory nodes.
size | The size of an element. |
This function started off as a compiler kludge from SGI, but seems to be a useful wrapper around a repeated constant expression. The '512' is tunable (and no other code needs to change), but no investigation has been done since inheriting the SGI code.
Definition at line 78 of file stl_deque.h.
Referenced by std::_Deque_base< _Tp, _Alloc >::_M_initialize_map().
void std::__final_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
This is a helper function for the sort routine.
Definition at line 2173 of file stl_algo.h.
References __insertion_sort(), and __unguarded_insertion_sort().
Referenced by sort().
void std::__final_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2188 of file stl_algo.h.
References __insertion_sort(), and __unguarded_insertion_sort().
|
inline |
This is an overload used by find() for the Input Iterator case.
Definition at line 144 of file stl_algo.h.
Referenced by find().
_RandomAccessIterator std::__find | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
const _Tp & | __val, | ||
random_access_iterator_tag | |||
) |
This is an overload used by find() for the RAI case.
Definition at line 166 of file stl_algo.h.
|
inline |
This is an overload used by find_if() for the Input Iterator case.
Definition at line 155 of file stl_algo.h.
Referenced by find_if().
_RandomAccessIterator std::__find_if | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Predicate | __pred, | ||
random_access_iterator_tag | |||
) |
This is an overload used by find_if() for the RAI case.
Definition at line 214 of file stl_algo.h.
|
inline |
This is an overload used by find_if_not() for the Input Iterator case.
Definition at line 263 of file stl_algo.h.
Referenced by find_if_not().
_RandomAccessIterator std::__find_if_not | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Predicate | __pred, | ||
random_access_iterator_tag | |||
) |
This is an overload used by find_if_not() for the RAI case.
Definition at line 274 of file stl_algo.h.
_EuclideanRingElement std::__gcd | ( | _EuclideanRingElement | __m, |
_EuclideanRingElement | __n | ||
) |
This is a helper function for the rotate algorithm specialized on RAIs. It returns the greatest common divisor of two integer values.
Definition at line 1503 of file stl_algo.h.
Referenced by __rotate().
void std::__heap_select | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __middle, | ||
_RandomAccessIterator | __last | ||
) |
This is a helper function for the sort routines.
Definition at line 1900 of file stl_algo.h.
References make_heap().
Referenced by partial_sort().
void std::__heap_select | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __middle, | ||
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routines.
Definition at line 1913 of file stl_algo.h.
References make_heap().
_ForwardIterator std::__inplace_stable_partition | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Predicate | __pred, | ||
_Distance | __len | ||
) |
This is a helper function...
Definition at line 1777 of file stl_algo.h.
References advance(), distance(), and rotate().
Referenced by stable_partition().
void std::__inplace_stable_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
This is a helper function for the stable sorting routines.
Definition at line 3409 of file stl_algo.h.
References __insertion_sort(), and __merge_without_buffer().
Referenced by __inplace_stable_sort(), and stable_sort().
void std::__inplace_stable_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the stable sorting routines.
Definition at line 3428 of file stl_algo.h.
References __inplace_stable_sort(), __insertion_sort(), and __merge_without_buffer().
void std::__insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
This is a helper function for the sort routine.
Definition at line 2096 of file stl_algo.h.
References __unguarded_linear_insert(), and copy_backward().
Referenced by __final_insertion_sort(), and __inplace_stable_sort().
void std::__insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2119 of file stl_algo.h.
References __unguarded_linear_insert(), and copy_backward().
void std::__introsort_loop | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Size | __depth_limit | ||
) |
This is a helper function for the sort routine.
Definition at line 2245 of file stl_algo.h.
References __median(), __unguarded_partition(), and partial_sort().
Referenced by __introsort_loop(), and sort().
void std::__introsort_loop | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Size | __depth_limit, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2277 of file stl_algo.h.
References __introsort_loop(), __median(), __unguarded_partition(), and partial_sort().
|
inline |
This is a helper function for the sort routines. Precondition: __n > 0.
Definition at line 2310 of file stl_algo.h.
References __lg().
Referenced by __lg(), nth_element(), and sort().
void std::__merge_adaptive | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_Pointer | __buffer, | ||
_Distance | __buffer_size | ||
) |
This is a helper function for the merge routines.
Definition at line 2910 of file stl_algo.h.
References __merge_backward(), __rotate_adaptive(), advance(), distance(), lower_bound(), merge(), and upper_bound().
Referenced by __merge_adaptive(), and inplace_merge().
void std::__merge_adaptive | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_Pointer | __buffer, | ||
_Distance | __buffer_size, | ||
_Compare | __comp | ||
) |
This is a helper function for the merge routines.
Definition at line 2966 of file stl_algo.h.
References __merge_adaptive(), __merge_backward(), __rotate_adaptive(), advance(), distance(), lower_bound(), merge(), and upper_bound().
_BidirectionalIterator3 std::__merge_backward | ( | _BidirectionalIterator1 | __first1, |
_BidirectionalIterator1 | __last1, | ||
_BidirectionalIterator2 | __first2, | ||
_BidirectionalIterator2 | __last2, | ||
_BidirectionalIterator3 | __result | ||
) |
This is a helper function for the merge routines.
Definition at line 2807 of file stl_algo.h.
References copy_backward().
Referenced by __merge_adaptive().
_BidirectionalIterator3 std::__merge_backward | ( | _BidirectionalIterator1 | __first1, |
_BidirectionalIterator1 | __last1, | ||
_BidirectionalIterator2 | __first2, | ||
_BidirectionalIterator2 | __last2, | ||
_BidirectionalIterator3 | __result, | ||
_Compare | __comp | ||
) |
This is a helper function for the merge routines.
Definition at line 2842 of file stl_algo.h.
References copy_backward().
void std::__merge_without_buffer | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2 | ||
) |
This is a helper function for the merge routines.
Definition at line 3023 of file stl_algo.h.
References advance(), distance(), iter_swap(), lower_bound(), rotate(), and upper_bound().
Referenced by __inplace_stable_sort(), __merge_without_buffer(), and inplace_merge().
void std::__merge_without_buffer | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_Compare | __comp | ||
) |
This is a helper function for the merge routines.
Definition at line 3067 of file stl_algo.h.
References __merge_without_buffer(), advance(), distance(), iter_swap(), lower_bound(), rotate(), and upper_bound().
_ForwardIterator std::__partition | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Predicate | __pred, | ||
forward_iterator_tag | |||
) |
This is a helper function...
Definition at line 1722 of file stl_algo.h.
References iter_swap().
Referenced by partition().
_BidirectionalIterator std::__partition | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last, | ||
_Predicate | __pred, | ||
bidirectional_iterator_tag | |||
) |
void std::__reverse | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last, | ||
bidirectional_iterator_tag | |||
) |
This is an uglified reverse(_BidirectionalIterator, _BidirectionalIterator) overloaded for bidirectional iterators.
Definition at line 1403 of file stl_algo.h.
References iter_swap().
Referenced by __rotate(), and reverse().
void std::__reverse | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
random_access_iterator_tag | |||
) |
This is an uglified reverse(_BidirectionalIterator, _BidirectionalIterator) overloaded for random access iterators.
Definition at line 1423 of file stl_algo.h.
References iter_swap().
void std::__rotate | ( | _ForwardIterator | __first, |
_ForwardIterator | __middle, | ||
_ForwardIterator | __last, | ||
forward_iterator_tag | |||
) |
This is a helper function for the rotate algorithm.
Definition at line 1517 of file stl_algo.h.
References iter_swap().
Referenced by __gnu_cxx::bitmap_allocator< _Tp >::_M_deallocate_single_object(), and rotate().
void std::__rotate | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
bidirectional_iterator_tag | |||
) |
This is a helper function for the rotate algorithm.
Definition at line 1553 of file stl_algo.h.
References __reverse(), and iter_swap().
void std::__rotate | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __middle, | ||
_RandomAccessIterator | __last, | ||
random_access_iterator_tag | |||
) |
This is a helper function for the rotate algorithm.
Definition at line 1583 of file stl_algo.h.
References __gcd(), and swap_ranges().
_BidirectionalIterator1 std::__rotate_adaptive | ( | _BidirectionalIterator1 | __first, |
_BidirectionalIterator1 | __middle, | ||
_BidirectionalIterator1 | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_BidirectionalIterator2 | __buffer, | ||
_Distance | __buffer_size | ||
) |
This is a helper function for the merge routines.
Definition at line 2878 of file stl_algo.h.
References advance(), copy_backward(), distance(), and rotate().
Referenced by __merge_adaptive().
_ForwardIterator std::__search_n | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
std::forward_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) overloaded for forward iterators.
Definition at line 340 of file stl_algo.h.
References find().
Referenced by search_n().
_RandomAccessIter std::__search_n | ( | _RandomAccessIter | __first, |
_RandomAccessIter | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
std::random_access_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) overloaded for random access iterators.
Definition at line 372 of file stl_algo.h.
_ForwardIterator std::__search_n | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
_BinaryPredicate | __binary_pred, | ||
std::forward_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, _BinaryPredicate) overloaded for forward iterators.
Definition at line 426 of file stl_algo.h.
_RandomAccessIter std::__search_n | ( | _RandomAccessIter | __first, |
_RandomAccessIter | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
_BinaryPredicate | __binary_pred, | ||
std::random_access_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, _BinaryPredicate) overloaded for random access iterators.
Definition at line 465 of file stl_algo.h.
_ForwardIterator std::__stable_partition_adaptive | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Predicate | __pred, | ||
_Distance | __len, | ||
_Pointer | __buffer, | ||
_Distance | __buffer_size | ||
) |
This is a helper function...
Definition at line 1802 of file stl_algo.h.
References advance(), distance(), and rotate().
Referenced by stable_partition().
|
inline |
This is a helper function for the sort routine.
Definition at line 2141 of file stl_algo.h.
References __unguarded_linear_insert().
Referenced by __final_insertion_sort().
|
inline |
This is a helper function for the sort routine.
Definition at line 2154 of file stl_algo.h.
References __unguarded_linear_insert().
void std::__unguarded_linear_insert | ( | _RandomAccessIterator | __last, |
_Tp | __val | ||
) |
This is a helper function for the sort routine.
Definition at line 2063 of file stl_algo.h.
Referenced by __insertion_sort(), and __unguarded_insertion_sort().
void std::__unguarded_linear_insert | ( | _RandomAccessIterator | __last, |
_Tp | __val, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2079 of file stl_algo.h.
_RandomAccessIterator std::__unguarded_partition | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Tp | __pivot | ||
) |
This is a helper function...
Definition at line 2204 of file stl_algo.h.
References iter_swap().
Referenced by __introsort_loop().
_RandomAccessIterator std::__unguarded_partition | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Tp | __pivot, | ||
_Compare | __comp | ||
) |
_OutputIterator std::__unique_copy | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_OutputIterator | __result, | ||
forward_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for forward iterators and output iterator as result.
Definition at line 1255 of file stl_algo.h.
Referenced by unique_copy().
_OutputIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
input_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for input iterators and output iterator as result.
Definition at line 1278 of file stl_algo.h.
_ForwardIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_ForwardIterator | __result, | ||
input_iterator_tag | , | ||
forward_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for input iterators and forward iterator as result.
Definition at line 1301 of file stl_algo.h.
_OutputIterator std::__unique_copy | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryPredicate | __binary_pred, | ||
forward_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for forward iterators and output iterator as result.
Definition at line 1322 of file stl_algo.h.
_OutputIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryPredicate | __binary_pred, | ||
input_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for input iterators and output iterator as result.
Definition at line 1351 of file stl_algo.h.
_ForwardIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_ForwardIterator | __result, | ||
_BinaryPredicate | __binary_pred, | ||
input_iterator_tag | , | ||
forward_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for input iterators and forward iterator as result.
Definition at line 1380 of file stl_algo.h.
|
inline |
Constructs an object in existing memory by invoking an allocated object's constructor with an initializer.
Definition at line 70 of file stl_construct.h.
|
inline |
Destroy the object pointed to by a pointer type.
Definition at line 82 of file stl_construct.h.
References _Destroy().
Referenced by _Destroy(), and std::vector< _Node *, _Nodeptr_Alloc >::~vector().
|
inline |
Destroy a range of objects. If the value_type of the object has a trivial destructor, the compiler should optimize all of this away, otherwise the objects' destructors must be invoked.
Definition at line 112 of file stl_construct.h.
References _Destroy().
|
inline |
Accumulate values in a range.
Accumulates the values in the range [first,last) using operator+(). The initial value is init. The values are processed in order.
first | Start of range. |
last | End of range. |
init | Starting value to add other values to. |
Definition at line 115 of file stl_numeric.h.
Referenced by __gnu_parallel::parallel_partial_sum_linear().
|
inline |
Accumulate values in a range with operation.
Accumulates the values in the range [first,last) using the function object binary_op. The initial value is init. The values are processed in order.
first | Start of range. |
last | End of range. |
init | Starting value to add other values to. |
binary_op | Function object to accumulate with. |
Definition at line 141 of file stl_numeric.h.
_OutputIterator std::adjacent_difference | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result | ||
) |
Return differences between adjacent values.
Computes the difference between adjacent values in the range [first,last) using operator-() and writes the result to result.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 308 of file stl_numeric.h.
_OutputIterator std::adjacent_difference | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryOperation | __binary_op | ||
) |
Return differences between adjacent values.
Computes the difference between adjacent values in the range [first,last) using the function object binary_op and writes the result to result.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 347 of file stl_numeric.h.
|
inline |
A generalization of pointer arithmetic.
i | An input iterator. |
n | The "delta" by which to change i . |
This increments i
by n
. For bidirectional and random access iterators, n
may be negative, in which case i
is decremented.
For random access iterators, this uses their +
and -
operations and are constant time. For other iterator classes they are linear time.
Definition at line 168 of file stl_iterator_base_funcs.h.
References __iterator_category().
Referenced by __inplace_stable_partition(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), equal_range(), lower_bound(), partition_point(), and upper_bound().
|
inline |
x | A container of arbitrary type. |
x
.This wrapper function helps in creating back_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.
Definition at line 459 of file stl_iterator.h.
Calls base.setf(ios_base::boolalpha).
Definition at line 799 of file ios_base.h.
References std::ios_base::setf().
Referenced by noboolalpha().
Calls base.setf(ios_base::dec, ios_base::basefield).
Definition at line 937 of file ios_base.h.
References std::ios_base::setf().
|
inline |
A generalization of pointer arithmetic.
first | An input iterator. |
last | An input iterator. |
Returns n
such that first + n == last. This requires that last
must be reachable from first
. Note that n
may be negative.
For random access iterators, this uses their +
and -
operations and are constant time. For other iterator classes they are linear time.
Definition at line 110 of file stl_iterator_base_funcs.h.
References __iterator_category().
Referenced by __inplace_stable_partition(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), equal_range(), inplace_merge(), is_heap_until(), lower_bound(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), partition_point(), std::list< _Tp, _Alloc >::size(), and upper_bound().
Calls base.setf(ios_base::fixed, ios_base::floatfield).
Definition at line 962 of file ios_base.h.
References std::ios_base::setf().
|
inline |
x | A container of arbitrary type. |
x
.This wrapper function helps in creating front_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.
Definition at line 542 of file stl_iterator.h.
pair<_Tp*, ptrdiff_t> std::get_temporary_buffer | ( | ptrdiff_t | __len | ) |
Allocates a temporary buffer.
len | The number of objects of type Tp. |
Reinventing the wheel, but this time with prettier spokes!
This function tries to obtain storage for len
adjacent Tp objects. The objects themselves are not constructed, of course. A pair<> is returned containing "the buffer s address and capacity (in the units of sizeof(Tp)), or a pair of 0 values if no storage can be obtained." Note that the capacity obtained may be less than that requested if the memory is unavailable; you should compare len with the .second return value.
Provides the nothrow exception guarantee.
Definition at line 85 of file stl_tempbuf.h.
Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer().
basic_istream<_CharT, _Traits>& std::getline | ( | basic_istream< _CharT, _Traits > & | __is, |
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > & | __str, | ||
_CharT | __delim | ||
) |
Read a line from stream into a string.
__is | Input stream. |
__str | Buffer to store into. |
__delim | Character marking end of line. |
Stores characters from __is into __str until __delim is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into __str. Any previous contents of __str are erased. If delim was encountered, it is extracted but not stored into __str.
|
inline |
Read a line from stream into a string.
__is | Input stream. |
__str | Buffer to store into. |
Stores characters from is into __str until '
' is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into __str. Any previous contents of __str are erased. If end of line was encountered, it is extracted but not stored into __str.
basic_istream<_CharT, _Traits>& std::getline | ( | basic_istream< _CharT, _Traits > & | __is, |
basic_string< _CharT, _Traits, _Alloc > & | __str, | ||
_CharT | __delim | ||
) |
Read a line from stream into a string.
is | Input stream. |
str | Buffer to store into. |
delim | Character marking end of line. |
Stores characters from is into str until delim is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If delim was encountered, it is extracted but not stored into str.
Referenced by getline().
|
inline |
Read a line from stream into a string.
is | Input stream. |
str | Buffer to store into. |
Stores characters from is into str until '
' is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If end of line was encountered, it is extracted but not stored into str.
Definition at line 2538 of file basic_string.h.
References getline().
bool std::has_facet | ( | const locale & | __loc | ) | |
throw | ( | ||||
) |
Test for the presence of a facet.
has_facet tests the locale argument for the presence of the facet type provided as the template parameter. Facets derived from the facet parameter will also return true.
Facet | The facet type to test the presence of. |
locale | The locale to test. |
Calls base.setf(ios_base::hex, ios_base::basefield).
Definition at line 945 of file ios_base.h.
References std::ios_base::setf().
|
inline |
Compute inner product of two ranges.
Starting with an initial value of init, multiplies successive elements from the two ranges and adds each product into the accumulated value using operator+(). The values in the ranges are processed in order.
first1 | Start of range 1. |
last1 | End of range 1. |
first2 | Start of range 2. |
init | Starting value to add other values to. |
Definition at line 169 of file stl_numeric.h.
|
inline |
Compute inner product of two ranges.
Starting with an initial value of init, applies binary_op2 to successive elements from the two ranges and accumulates each result into the accumulated value using binary_op1. The values in the ranges are processed in order.
first1 | Start of range 1. |
last1 | End of range 1. |
first2 | Start of range 2. |
init | Starting value to add other values to. |
binary_op1 | Function object to accumulate with. |
binary_op2 | Function object to apply to pairs of input values. |
Definition at line 201 of file stl_numeric.h.
|
inline |
x | A container of arbitrary type. |
x
.This wrapper function helps in creating insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.
Definition at line 648 of file stl_iterator.h.
Calls base.setf(ios_base::internal, ios_base::adjustfield).
Definition at line 912 of file ios_base.h.
References std::ios_base::setf().
void std::iota | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Tp | __value | ||
) |
Create a range of sequentially increasing values.
For each element in the range [first,last) assigns
value
and increments value
as if by ++value
.
first | Start of range. |
last | End of range. |
value | Starting value. |
Definition at line 80 of file stl_numeric.h.
|
inline |
Convenience interface to ctype.is(ctype_base::alnum, __c).
Definition at line 2575 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::alpha, __c).
Definition at line 2551 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::cntrl, __c).
Definition at line 2533 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::digit, __c).
Definition at line 2557 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::graph, __c).
Definition at line 2581 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::lower, __c).
Definition at line 2545 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::print, __c).
Definition at line 2527 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::punct, __c).
Definition at line 2563 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::space, __c).
Definition at line 2521 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::space, __c).
Definition at line 2521 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::upper, __c).
Definition at line 2539 of file locale_facets.h.
|
inline |
Convenience interface to ctype.is(ctype_base::xdigit, __c).
Definition at line 2569 of file locale_facets.h.
Calls base.setf(ios_base::left, ios_base::adjustfield).
Definition at line 920 of file ios_base.h.
References std::ios_base::setf().
Referenced by __gnu_parallel::LoserTree< false, T, Comparator >::init_winner(), and __gnu_parallel::parallel_partition().
Calls base.unsetf(ios_base::boolalpha).
Definition at line 807 of file ios_base.h.
References boolalpha(), and std::ios_base::unsetf().
Calls base.unsetf(ios_base::showbase).
Definition at line 823 of file ios_base.h.
References showbase(), and std::ios_base::unsetf().
Calls base.unsetf(ios_base::showpoint).
Definition at line 839 of file ios_base.h.
References showpoint(), and std::ios_base::unsetf().
Calls base.unsetf(ios_base::showpos).
Definition at line 855 of file ios_base.h.
References showpos(), and std::ios_base::unsetf().
Calls base.unsetf(ios_base::skipws).
Definition at line 871 of file ios_base.h.
References skipws(), and std::ios_base::unsetf().
Calls base.unsetf(ios_base::unitbuf).
Definition at line 903 of file ios_base.h.
References unitbuf(), and std::ios_base::unsetf().
Calls base.unsetf(ios_base::uppercase).
Definition at line 887 of file ios_base.h.
References std::ios_base::unsetf(), and uppercase().
Calls base.setf(ios_base::oct, ios_base::basefield).
Definition at line 953 of file ios_base.h.
References std::ios_base::setf().
|
inline |
Return false if x and y are both end or not end, or x and y are the same.
Definition at line 130 of file stream_iterator.h.
|
inline |
Uses operator==
to find the result.
Definition at line 159 of file stl_pair.h.
|
inline |
Forward list iterator inequality comparison.
Definition at line 254 of file forward_list.h.
|
inline |
Based on operator==.
Definition at line 259 of file stl_stack.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 290 of file stl_iterator.h.
|
inline |
Based on operator==.
Definition at line 294 of file stl_queue.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 340 of file stl_iterator.h.
|
inline |
Returns !(x == y).
Definition at line 649 of file stl_multiset.h.
|
inline |
Based on operator==.
Definition at line 752 of file stl_multimap.h.
|
inline |
Based on operator==.
Definition at line 1192 of file stl_vector.h.
|
inline |
Based on operator==.
Definition at line 1256 of file forward_list.h.
|
inline |
Based on operator==.
Definition at line 1492 of file stl_list.h.
|
inline |
Based on operator==.
Definition at line 1774 of file stl_deque.h.
|
inline |
Test difference of two strings.
lhs | First string. |
rhs | Second string. |
Definition at line 2278 of file basic_string.h.
|
inline |
Test difference of C string and string.
lhs | C string. |
rhs | String. |
Definition at line 2290 of file basic_string.h.
|
inline |
Test difference of string and C string.
lhs | String. |
rhs | C string. |
Definition at line 2302 of file basic_string.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 320 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base(), and operator+().
basic_string<_CharT, _Traits, _Alloc> std::operator+ | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) |
Concatenate two strings.
lhs | First string. |
rhs | Last string. |
Definition at line 2161 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::append().
Referenced by operator+().
basic_string<_CharT,_Traits,_Alloc> std::operator+ | ( | const _CharT * | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) |
Concatenate C string and string.
lhs | First string. |
rhs | Last string. |
basic_string<_CharT,_Traits,_Alloc> std::operator+ | ( | _CharT | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) |
Concatenate character and string.
lhs | First string. |
rhs | Last string. |
|
inline |
Concatenate string and C string.
lhs | First string. |
rhs | Last string. |
Definition at line 2198 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::append().
|
inline |
Concatenate string and character.
lhs | First string. |
rhs | Last string. |
Definition at line 2214 of file basic_string.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 314 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 366 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
|
inline |
http://gcc.gnu.org/onlinedocs/libstdc++/manual/utilities.html
Definition at line 152 of file stl_pair.h.
References std::pair< _T1, _T2 >::first.
|
inline |
Stack ordering relation.
x | A stack. |
y | A stack of the same type as x. |
This is an total ordering relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, the elements must be comparable with <
, and std::lexicographical_compare() is usually used to make the determination.
Definition at line 253 of file stl_stack.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 284 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
|
inline |
Queue ordering relation.
x | A queue. |
y | A queue of the same type as x. |
This is an total ordering relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, the elements must be comparable with <
, and std::lexicographical_compare() is usually used to make the determination.
Definition at line 288 of file stl_queue.h.
References std::queue< _Tp, _Sequence >::c.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 334 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
|
inline |
Multiset ordering relation.
x | A multiset. |
y | A multiset of the same type as x. |
This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 642 of file stl_multiset.h.
|
inline |
Set ordering relation.
x | A set. |
y | A set of the same type as x. |
This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
|
inline |
Multimap ordering relation.
x | A multimap. |
y | A multimap of the same type as x. |
This is a total ordering relation. It is linear in the size of the multimaps. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 745 of file stl_multimap.h.
|
inline |
Map ordering relation.
x | A map. |
y | A map of the same type as x. |
This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
|
inline |
Vector ordering relation.
x | A vector. |
y | A vector of the same type as x. |
This is a total ordering relation. It is linear in the size of the vectors. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 1185 of file stl_vector.h.
References lexicographical_compare().
|
inline |
Forward list ordering relation.
lx | A forward_list. |
ly | A forward_list of the same type as lx. |
This is a total ordering relation. It is linear in the size of the forward lists. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 1248 of file forward_list.h.
References lexicographical_compare().
|
inline |
List ordering relation.
x | A list. |
y | A list of the same type as x. |
This is a total ordering relation. It is linear in the size of the lists. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 1485 of file stl_list.h.
References lexicographical_compare().
|
inline |
Deque ordering relation.
x | A deque. |
y | A deque of the same type as x. |
This is a total ordering relation. It is linear in the size of the deques. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 1766 of file stl_deque.h.
References lexicographical_compare().
|
inline |
Test if string precedes string.
lhs | First string. |
rhs | Second string. |
Definition at line 2315 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
Test if string precedes C string.
lhs | String. |
rhs | C string. |
Definition at line 2327 of file basic_string.h.
|
inline |
Test if C string precedes string.
lhs | C string. |
rhs | String. |
Definition at line 2339 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
|
inline |
Write string to a stream.
os | Output stream. |
str | String to write out. |
Output characters of str into os following the same rules as for writing a C string.
Definition at line 2498 of file basic_string.h.
|
inline |
Uses operator<
to find the result.
Definition at line 171 of file stl_pair.h.
|
inline |
Based on operator<.
Definition at line 271 of file stl_stack.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 302 of file stl_iterator.h.
|
inline |
Based on operator<.
Definition at line 306 of file stl_queue.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 352 of file stl_iterator.h.
|
inline |
Returns !(y < x)
Definition at line 663 of file stl_multiset.h.
|
inline |
Based on operator<.
Definition at line 766 of file stl_multimap.h.
|
inline |
Based on operator<.
Definition at line 1204 of file stl_vector.h.
|
inline |
Based on operator<.
Definition at line 1277 of file forward_list.h.
|
inline |
Based on operator<.
Definition at line 1504 of file stl_list.h.
|
inline |
Based on operator<.
Definition at line 1788 of file stl_deque.h.
|
inline |
Test if string doesn't follow string.
lhs | First string. |
rhs | Second string. |
Definition at line 2389 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
Test if string doesn't follow C string.
lhs | String. |
rhs | C string. |
Definition at line 2401 of file basic_string.h.
|
inline |
Test if C string doesn't follow string.
lhs | C string. |
rhs | String. |
Definition at line 2413 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
Return true if x and y are both end or not end, or x and y are the same.
Definition at line 123 of file stream_iterator.h.
|
inline |
Two pairs of the same type are equal iff their members are equal.
Definition at line 146 of file stl_pair.h.
References std::pair< _T1, _T2 >::first, and std::pair< _T1, _T2 >::second.
|
inline |
Test if equivalent to another position.
Definition at line 216 of file postypes.h.
|
inline |
Stack equality comparison.
x | A stack. |
y | A stack of the same type as x. |
This is an equivalence relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, and stacks are considered equivalent if their sequences compare equal.
Definition at line 235 of file stl_stack.h.
|
inline |
Forward list iterator equality comparison.
Definition at line 245 of file forward_list.h.
|
inline |
Queue equality comparison.
x | A queue. |
y | A queue of the same type as x. |
This is an equivalence relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, and queues are considered equivalent if their sequences compare equal.
Definition at line 270 of file stl_queue.h.
References std::queue< _Tp, _Sequence >::c.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 278 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 328 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
|
inline |
Multiset equality comparison.
x | A multiset. |
y | A multiset of the same type as x. |
This is an equivalence relation. It is linear in the size of the multisets. Multisets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 625 of file stl_multiset.h.
|
inline |
Set equality comparison.
x | A set. |
y | A set of the same type as x. |
This is an equivalence relation. It is linear in the size of the sets. Sets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
|
inline |
Multimap equality comparison.
x | A multimap. |
y | A multimap of the same type as x. |
This is an equivalence relation. It is linear in the size of the multimaps. Multimaps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 728 of file stl_multimap.h.
|
inline |
Map equality comparison.
x | A map. |
y | A map of the same type as x. |
This is an equivalence relation. It is linear in the size of the maps. Maps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
|
inline |
Vector equality comparison.
x | A vector. |
y | A vector of the same type as x. |
This is an equivalence relation. It is linear in the size of the vectors. Vectors are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 1168 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin(), std::vector< _Tp, _Alloc >::end(), equal(), and std::vector< _Tp, _Alloc >::size().
bool std::operator== | ( | const forward_list< _Tp, _Alloc > & | __lx, |
const forward_list< _Tp, _Alloc > & | __ly | ||
) |
Forward list equality comparison.
lx | A forward_list |
ly | A forward_list of the same type as lx. |
This is an equivalence relation. It is linear in the size of the forward lists. Deques are considered equivalent if corresponding elements compare equal.
|
inline |
List equality comparison.
x | A list. |
y | A list of the same type as x. |
This is an equivalence relation. It is linear in the size of the lists. Lists are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 1456 of file stl_list.h.
References std::list< _Tp, _Alloc >::begin(), and std::list< _Tp, _Alloc >::end().
|
inline |
Deque equality comparison.
x | A deque. |
y | A deque of the same type as x. |
This is an equivalence relation. It is linear in the size of the deques. Deques are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 1748 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::begin(), std::deque< _Tp, _Alloc >::end(), equal(), and std::deque< _Tp, _Alloc >::size().
|
inline |
Test equivalence of two strings.
lhs | First string. |
rhs | Second string. |
Definition at line 2232 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
Test equivalence of C string and string.
lhs | C string. |
rhs | String. |
Definition at line 2253 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
Test equivalence of string and C string.
lhs | String. |
rhs | C string. |
Definition at line 2265 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
Uses operator<
to find the result.
Definition at line 165 of file stl_pair.h.
|
inline |
Based on operator<.
Definition at line 265 of file stl_stack.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 296 of file stl_iterator.h.
References operator>().
|
inline |
Based on operator<.
Definition at line 300 of file stl_queue.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 346 of file stl_iterator.h.
References operator>().
|
inline |
Returns y < x.
Definition at line 656 of file stl_multiset.h.
|
inline |
Based on operator<.
Definition at line 759 of file stl_multimap.h.
|
inline |
Based on operator<.
Definition at line 1198 of file stl_vector.h.
|
inline |
Based on operator<.
Definition at line 1263 of file forward_list.h.
|
inline |
Based on operator<.
Definition at line 1498 of file stl_list.h.
|
inline |
Based on operator<.
Definition at line 1781 of file stl_deque.h.
|
inline |
Test if string follows string.
lhs | First string. |
rhs | Second string. |
Definition at line 2352 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
Referenced by operator>().
|
inline |
Test if string follows C string.
lhs | String. |
rhs | C string. |
Definition at line 2364 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
Test if C string follows string.
lhs | C string. |
rhs | String. |
Definition at line 2376 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
Uses operator<
to find the result.
Definition at line 177 of file stl_pair.h.
|
inline |
Based on operator<.
Definition at line 277 of file stl_stack.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 308 of file stl_iterator.h.
References operator>=().
|
inline |
Based on operator<.
Definition at line 312 of file stl_queue.h.
|
inline |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 358 of file stl_iterator.h.
References operator>=().
|
inline |
Returns !(x < y)
Definition at line 670 of file stl_multiset.h.
|
inline |
Based on operator<.
Definition at line 773 of file stl_multimap.h.
|
inline |
Based on operator<.
Definition at line 1210 of file stl_vector.h.
|
inline |
Based on operator<.
Definition at line 1270 of file forward_list.h.
|
inline |
Based on operator<.
Definition at line 1510 of file stl_list.h.
|
inline |
Based on operator<.
Definition at line 1795 of file stl_deque.h.
|
inline |
Test if string doesn't precede string.
lhs | First string. |
rhs | Second string. |
Definition at line 2426 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
Referenced by operator>=().
|
inline |
Test if string doesn't precede C string.
lhs | String. |
rhs | C string. |
Definition at line 2438 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
|
inline |
Test if C string doesn't precede string.
lhs | C string. |
rhs | String. |
Definition at line 2450 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
basic_istream<_CharT, _Traits>& std::operator>> | ( | basic_istream< _CharT, _Traits > & | __is, |
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > & | __str | ||
) |
Read stream into a string.
__is | Input stream. |
__str | Buffer to store into. |
Stores characters from __is into __str until whitespace is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into __str. Any previous contents of __str are erased.
basic_istream<_CharT, _Traits>& std::operator>> | ( | basic_istream< _CharT, _Traits > & | __is, |
basic_string< _CharT, _Traits, _Alloc > & | __str | ||
) |
Read stream into a string.
is | Input stream. |
str | Buffer to store into. |
Stores characters from is into str until whitespace is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased.
_OutputIterator std::partial_sum | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result | ||
) |
Return list of partial sums.
Accumulates the values in the range [first,last) using operator+(). As each successive input value is added into the total, that partial sum is written to result. Therefore, the first value in result is the first value of the input, the second value in result is the sum of the first and second input values, and so on.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 232 of file stl_numeric.h.
Referenced by __gnu_parallel::parallel_random_shuffle_drs_pu(), and __gnu_parallel::sequential_random_shuffle().
_OutputIterator std::partial_sum | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryOperation | __binary_op | ||
) |
Return list of partial sums.
Accumulates the values in the range [first,last) using operator+(). As each successive input value is added into the total, that partial sum is written to result. Therefore, the first value in result is the first value of the input, the second value in result is the sum of the first and second input values, and so on.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 272 of file stl_numeric.h.
_OutputIterator std::replace_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
const _Tp & | __old_value, | ||
const _Tp & | __new_value | ||
) |
Copy a sequence, replacing each element of one value with another value.
first | An input iterator. |
last | An input iterator. |
result | An output iterator. |
old_value | The value to be replaced. |
new_value | The replacement value. |
result+
(last-first).Copies each element in the input range [first,last) to the output range
[result,result+(last-first)) replacing elements equal to
old_value
with new_value
.
Definition at line 3804 of file stl_algo.h.
|
inline |
The companion to get_temporary_buffer().
p | A buffer previously allocated by get_temporary_buffer. |
Frees the memory pointed to by p.
Definition at line 112 of file stl_tempbuf.h.
Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer().
Calls base.setf(ios_base::right, ios_base::adjustfield).
Definition at line 928 of file ios_base.h.
References std::ios_base::setf().
Referenced by __gnu_parallel::LoserTree< false, T, Comparator >::init_winner(), and __gnu_parallel::parallel_partition().
Calls base.setf(ios_base::scientific, ios_base::floatfield).
Definition at line 970 of file ios_base.h.
References std::ios_base::setf().
Calls base.setf(ios_base::showbase).
Definition at line 815 of file ios_base.h.
References std::ios_base::setf().
Referenced by noshowbase().
Calls base.setf(ios_base::showpoint).
Definition at line 831 of file ios_base.h.
References std::ios_base::setf().
Referenced by noshowpoint().
Calls base.setf(ios_base::showpos).
Definition at line 847 of file ios_base.h.
References std::ios_base::setf().
Referenced by noshowpos().
Calls base.setf(ios_base::skipws).
Definition at line 863 of file ios_base.h.
References std::ios_base::setf().
Referenced by noskipws().
|
inline |
See std::pair::swap().
Definition at line 186 of file stl_pair.h.
|
inline |
Swaps two values.
a | A thing of arbitrary type. |
b | Another thing of arbitrary type. |
Definition at line 76 of file move.h.
Referenced by __gnu_parallel::LoserTree< stable, T, Comparator >::delete_min_insert(), __gnu_parallel::LoserTree< false, T, Comparator >::delete_min_insert(), __gnu_parallel::parallel_nth_element(), __gnu_parallel::parallel_partition(), __gnu_parallel::qsb_divide(), __gnu_parallel::qsb_local_sort_with_helping(), std::vector< _Node *, _Nodeptr_Alloc >::swap(), and std::deque< _Tp, _Alloc >::swap().
|
inline |
Definition at line 677 of file stl_multiset.h.
References std::multiset< _Key, _Compare, _Alloc >::swap().
|
inline |
See std::set::swap().
Definition at line 691 of file stl_set.h.
References std::set< _Key, _Compare, _Alloc >::swap().
|
inline |
Definition at line 780 of file stl_multimap.h.
References std::multimap< _Key, _Tp, _Compare, _Alloc >::swap().
|
inline |
See std::map::swap().
Definition at line 851 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::swap().
|
inline |
See std::vector::swap().
Definition at line 1216 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::swap().
|
inline |
See std::forward_list::swap().
Definition at line 1284 of file forward_list.h.
References std::forward_list< _Tp, _Alloc >::swap().
|
inline |
See std::forward_list::swap().
Definition at line 1291 of file forward_list.h.
|
inline |
See std::forward_list::swap().
Definition at line 1298 of file forward_list.h.
References std::forward_list< _Tp, _Alloc >::swap().
Referenced by std::forward_list< _Tp, _Alloc >::operator=(), and std::forward_list< _Tp, _Alloc >::swap().
|
inline |
See std::list::swap().
Definition at line 1516 of file stl_list.h.
References std::list< _Tp, _Alloc >::swap().
|
inline |
See std::deque::swap().
Definition at line 1802 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::swap().
|
inline |
Swap contents of two strings.
lhs | First string. |
rhs | Second string. |
Exchanges the contents of lhs and rhs in constant time.
Definition at line 2463 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::swap().
|
inline |
Convenience interface to ctype.tolower(__c).
Definition at line 2593 of file locale_facets.h.
|
inline |
Convenience interface to ctype.toupper(__c).
Definition at line 2587 of file locale_facets.h.
|
inline |
Copies the range [first,last) into result.
first | An input iterator. |
last | An input iterator. |
result | An output iterator. |
Like copy(), but does not require an initialized output range.
Definition at line 107 of file stl_uninitialized.h.
Referenced by __gnu_parallel::parallel_sort_mwms_pu().
|
inline |
Copies the range [first,first+n) into result.
first | An input iterator. |
n | The number of elements to copy. |
result | An output iterator. |
Like copy_n(), but does not require an initialized output range.
Definition at line 470 of file stl_uninitialized.h.
References __iterator_category().
|
inline |
Copies the value x into the range [first,last).
first | An input iterator. |
last | An input iterator. |
x | The source value. |
Like fill(), but does not require an initialized output range.
Definition at line 164 of file stl_uninitialized.h.
|
inline |
Copies the value x into the range [first,first+n).
first | An input iterator. |
n | The number of copies to make. |
x | The source value. |
Like fill_n(), but does not require an initialized output range.
Definition at line 218 of file stl_uninitialized.h.
Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer().
Calls base.setf(ios_base::unitbuf).
Definition at line 895 of file ios_base.h.
References std::ios_base::setf().
Referenced by nounitbuf().
Calls base.setf(ios_base::uppercase).
Definition at line 879 of file ios_base.h.
References std::ios_base::setf().
Referenced by nouppercase().
const _Facet & std::use_facet | ( | const locale & | __loc | ) |
Return a facet.
use_facet looks for and returns a reference to a facet of type Facet where Facet is the template parameter. If has_facet(locale) is true, there is a suitable facet to return. It throws std::bad_cast if the locale doesn't contain a facet of type Facet.
Facet | The facet type to access. |
locale | The locale to use. |
std::bad_cast | if locale doesn't contain a facet of type Facet. |