libstdc++
std Namespace Reference

Namespaces

Classes

Typedefs

Enumerations

Functions

Matching, Searching, and Replacing

Variables

Standard Stream Objects

The <iostream> header declares the eight standard stream objects. For other declarations, see http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt11ch24.html and the I/O forward declarations

They are required by default to cooperate with the global C library's FILE streams, and to be available during program startup and termination. For more information, see the HOWTO linked to above.


Detailed Description

ISO C++ entities toplevel namespace is std.


Typedef Documentation

typedef void(* std::new_handler)()

If you write your own error handler to be called by new, it must be of this type.

Definition at line 75 of file new.

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 96 of file postypes.h.

typedef fpos<mbstate_t> std::streampos

File position for char streams.

Definition at line 230 of file postypes.h.

typedef ptrdiff_t std::streamsize

Integral type for I/O operation counts and buffer sizes.

Definition at line 100 of file postypes.h.

typedef fpos<mbstate_t> std::u16streampos

File position for char16_t streams.

Definition at line 236 of file postypes.h.

typedef fpos<mbstate_t> std::u32streampos

File position for char32_t streams.

Definition at line 238 of file postypes.h.

typedef fpos<mbstate_t> std::wstreampos

File position for wchar_t streams.

Definition at line 232 of file postypes.h.


Enumeration Type Documentation

anonymous enum
Todo:
Needs documentation! See http://gcc.gnu.org/onlinedocs/libstdc++/manual/documentation_style.html This controls some aspect of the sort routines.

Definition at line 2184 of file stl_algo.h.

Describes the denormalization for floating-point types.

These values represent the presence or absence of a variable number of exponent bits. This type is used in the std::numeric_limits class.

Enumerator:
denorm_indeterminate 

Indeterminate at compile time whether denormalized values are allowed.

denorm_absent 

The type does not allow denormalized values.

denorm_present 

The type allows denormalized values.

Definition at line 172 of file limits.

Describes the rounding style for floating-point types.

This is used in the std::numeric_limits class.

Enumerator:
round_toward_zero 

Intermediate.

round_to_nearest 

To zero.

round_toward_infinity 

To the nearest representable value.

round_toward_neg_infinity 

To infinity.

Definition at line 157 of file limits.


Function Documentation

template<typename _RandomAccessIterator >
void std::__final_insertion_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
)

This is a helper function for the sort routine.

Definition at line 2189 of file stl_algo.h.

References __insertion_sort(), and __unguarded_insertion_sort().

Referenced by sort().

template<typename _RandomAccessIterator , typename _Compare >
void std::__final_insertion_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the sort routine.

Definition at line 2204 of file stl_algo.h.

References __insertion_sort(), and __unguarded_insertion_sort().

template<typename _InputIterator , typename _Tp >
_InputIterator std::__find ( _InputIterator  __first,
_InputIterator  __last,
const _Tp &  __val,
input_iterator_tag   
) [inline]

This is an overload used by find() for the Input Iterator case.

Definition at line 132 of file stl_algo.h.

Referenced by find().

template<typename _RandomAccessIterator , typename _Tp >
_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 154 of file stl_algo.h.

template<typename _InputIterator , typename _Predicate >
_InputIterator std::__find_if ( _InputIterator  __first,
_InputIterator  __last,
_Predicate  __pred,
input_iterator_tag   
) [inline]

This is an overload used by find_if() for the Input Iterator case.

Definition at line 143 of file stl_algo.h.

Referenced by find_if().

template<typename _RandomAccessIterator , typename _Predicate >
_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 202 of file stl_algo.h.

template<typename _InputIterator , typename _Predicate >
_InputIterator std::__find_if_not ( _InputIterator  __first,
_InputIterator  __last,
_Predicate  __pred,
input_iterator_tag   
) [inline]

This is an overload used by find_if_not() for the Input Iterator case.

Definition at line 251 of file stl_algo.h.

Referenced by find_if_not().

template<typename _RandomAccessIterator , typename _Predicate >
_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 262 of file stl_algo.h.

template<typename _EuclideanRingElement >
_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 1500 of file stl_algo.h.

template<typename _RandomAccessIterator >
void std::__heap_select ( _RandomAccessIterator  __first,
_RandomAccessIterator  __middle,
_RandomAccessIterator  __last 
)

This is a helper function for the sort routines.

Definition at line 1912 of file stl_algo.h.

References make_heap().

Referenced by partial_sort().

template<typename _RandomAccessIterator , typename _Compare >
void std::__heap_select ( _RandomAccessIterator  __first,
_RandomAccessIterator  __middle,
_RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the sort routines.

Definition at line 1925 of file stl_algo.h.

References make_heap().

template<typename _ForwardIterator , typename _Predicate , typename _Distance >
_ForwardIterator std::__inplace_stable_partition ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Predicate  __pred,
_Distance  __len 
)

This is a helper function...

Definition at line 1789 of file stl_algo.h.

References advance(), distance(), and rotate().

Referenced by stable_partition().

template<typename _RandomAccessIterator >
void std::__inplace_stable_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
)

This is a helper function for the stable sorting routines.

Definition at line 3468 of file stl_algo.h.

References __insertion_sort(), and __merge_without_buffer().

Referenced by __inplace_stable_sort(), and stable_sort().

template<typename _RandomAccessIterator , typename _Compare >
void std::__inplace_stable_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the stable sorting routines.

Definition at line 3487 of file stl_algo.h.

References __inplace_stable_sort(), __insertion_sort(), and __merge_without_buffer().

template<typename _RandomAccessIterator >
void std::__insertion_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
)

This is a helper function for the sort routine.

Definition at line 2112 of file stl_algo.h.

References __unguarded_linear_insert().

Referenced by __final_insertion_sort(), and __inplace_stable_sort().

template<typename _RandomAccessIterator , typename _Compare >
void std::__insertion_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the sort routine.

Definition at line 2135 of file stl_algo.h.

References __unguarded_linear_insert().

template<typename _RandomAccessIterator , typename _Size >
void std::__introsort_loop ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Size  __depth_limit 
)

This is a helper function for the sort routine.

Definition at line 2284 of file stl_algo.h.

References __unguarded_partition_pivot().

Referenced by __introsort_loop(), and sort().

template<typename _RandomAccessIterator , typename _Size , typename _Compare >
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 2306 of file stl_algo.h.

References __introsort_loop(), and __unguarded_partition_pivot().

template<typename _Size >
_Size std::__lg ( _Size  __n) [inline]

This is a helper function for the sort routines and for random.tcc.

Definition at line 973 of file stl_algobase.h.

Referenced by nth_element(), std::linear_congruential_engine< _UIntType, __a, __c, __m >::seed(), and sort().

template<typename _BidirectionalIterator , typename _Distance , typename _Pointer >
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 2916 of file stl_algo.h.

References __move_merge_adaptive(), __move_merge_adaptive_backward(), __rotate_adaptive(), advance(), distance(), lower_bound(), and upper_bound().

Referenced by __merge_adaptive(), and inplace_merge().

template<typename _BidirectionalIterator , typename _Distance , typename _Pointer , typename _Compare >
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 2972 of file stl_algo.h.

References __merge_adaptive(), __move_merge_adaptive(), __move_merge_adaptive_backward(), __rotate_adaptive(), advance(), distance(), lower_bound(), and upper_bound().

template<typename _BidirectionalIterator , typename _Distance >
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 3029 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().

template<typename _BidirectionalIterator , typename _Distance , typename _Compare >
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 3073 of file stl_algo.h.

References __merge_without_buffer(), advance(), distance(), iter_swap(), lower_bound(), rotate(), and upper_bound().

template<typename _Iterator >
void std::__move_median_first ( _Iterator  __a,
_Iterator  __b,
_Iterator  __c 
)

Swaps the median value of *__a, *__b and *__c to *__a.

Definition at line 80 of file stl_algo.h.

References iter_swap().

Referenced by __unguarded_partition_pivot().

template<typename _Iterator , typename _Compare >
void std::__move_median_first ( _Iterator  __a,
_Iterator  __b,
_Iterator  __c,
_Compare  __comp 
)

Swaps the median value of *__a, *__b and *__c under comp to *a.

Definition at line 104 of file stl_algo.h.

References iter_swap().

template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator >
_OutputIterator std::__move_merge ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_InputIterator2  __last2,
_OutputIterator  __result 
)

This is a helper function for the __merge_sort_loop routines.

Definition at line 3231 of file stl_algo.h.

template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator , typename _Compare >
_OutputIterator std::__move_merge ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_InputIterator2  __last2,
_OutputIterator  __result,
_Compare  __comp 
)

This is a helper function for the __merge_sort_loop routines.

Definition at line 3258 of file stl_algo.h.

template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator >
void std::__move_merge_adaptive ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_InputIterator2  __last2,
_OutputIterator  __result 
)

This is a helper function for the __merge_adaptive routines.

Definition at line 2737 of file stl_algo.h.

Referenced by __merge_adaptive().

template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator , typename _Compare >
void std::__move_merge_adaptive ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_InputIterator2  __last2,
_OutputIterator  __result,
_Compare  __comp 
)

This is a helper function for the __merge_adaptive routines.

Definition at line 2763 of file stl_algo.h.

template<typename _BidirectionalIterator1 , typename _BidirectionalIterator2 , typename _BidirectionalIterator3 >
void std::__move_merge_adaptive_backward ( _BidirectionalIterator1  __first1,
_BidirectionalIterator1  __last1,
_BidirectionalIterator2  __first2,
_BidirectionalIterator2  __last2,
_BidirectionalIterator3  __result 
)

This is a helper function for the __merge_adaptive routines.

Definition at line 2789 of file stl_algo.h.

Referenced by __merge_adaptive().

template<typename _BidirectionalIterator1 , typename _BidirectionalIterator2 , typename _BidirectionalIterator3 , typename _Compare >
void std::__move_merge_adaptive_backward ( _BidirectionalIterator1  __first1,
_BidirectionalIterator1  __last1,
_BidirectionalIterator2  __first2,
_BidirectionalIterator2  __last2,
_BidirectionalIterator3  __result,
_Compare  __comp 
)

This is a helper function for the __merge_adaptive routines.

Definition at line 2831 of file stl_algo.h.

template<typename _ForwardIterator , typename _Predicate >
_ForwardIterator std::__partition ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Predicate  __pred,
forward_iterator_tag   
)

This is a helper function...

Definition at line 1734 of file stl_algo.h.

References iter_swap().

Referenced by partition().

template<typename _BidirectionalIterator , typename _Predicate >
_BidirectionalIterator std::__partition ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last,
_Predicate  __pred,
bidirectional_iterator_tag   
)

This is a helper function...

Definition at line 1759 of file stl_algo.h.

References iter_swap().

template<typename _BidirectionalIterator >
void std::__reverse ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last,
bidirectional_iterator_tag   
)

This is an uglified reverse(_BidirectionalIterator, _BidirectionalIterator) overloaded for bidirectional iterators.

Definition at line 1400 of file stl_algo.h.

References iter_swap().

Referenced by __rotate(), and reverse().

template<typename _RandomAccessIterator >
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 1420 of file stl_algo.h.

References iter_swap().

template<typename _ForwardIterator >
void std::__rotate ( _ForwardIterator  __first,
_ForwardIterator  __middle,
_ForwardIterator  __last,
forward_iterator_tag   
)

This is a helper function for the rotate algorithm.

Definition at line 1514 of file stl_algo.h.

References iter_swap().

Referenced by __gnu_cxx::bitmap_allocator< _Tp >::_M_deallocate_single_object(), and rotate().

template<typename _BidirectionalIterator >
void std::__rotate ( _BidirectionalIterator  __first,
_BidirectionalIterator  __middle,
_BidirectionalIterator  __last,
bidirectional_iterator_tag   
)

This is a helper function for the rotate algorithm.

Definition at line 1550 of file stl_algo.h.

References __reverse(), and iter_swap().

template<typename _RandomAccessIterator >
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 1580 of file stl_algo.h.

References iter_swap(), and swap_ranges().

template<typename _BidirectionalIterator1 , typename _BidirectionalIterator2 , typename _Distance >
_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 2874 of file stl_algo.h.

References advance(), distance(), and rotate().

Referenced by __merge_adaptive().

template<typename _ForwardIterator , typename _Integer , typename _Tp >
_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 328 of file stl_algo.h.

Referenced by search_n().

template<typename _RandomAccessIter , typename _Integer , typename _Tp >
_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 360 of file stl_algo.h.

template<typename _ForwardIterator , typename _Integer , typename _Tp , typename _BinaryPredicate >
_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 414 of file stl_algo.h.

template<typename _RandomAccessIter , typename _Integer , typename _Tp , typename _BinaryPredicate >
_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 453 of file stl_algo.h.

template<typename _ForwardIterator , typename _Pointer , typename _Predicate , typename _Distance >
_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 1814 of file stl_algo.h.

References advance(), distance(), and rotate().

Referenced by stable_partition().

template<typename _RandomAccessIterator >
void std::__unguarded_insertion_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
) [inline]

This is a helper function for the sort routine.

Definition at line 2157 of file stl_algo.h.

References __unguarded_linear_insert().

Referenced by __final_insertion_sort().

template<typename _RandomAccessIterator , typename _Compare >
void std::__unguarded_insertion_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
) [inline]

This is a helper function for the sort routine.

Definition at line 2170 of file stl_algo.h.

References __unguarded_linear_insert().

template<typename _RandomAccessIterator >
void std::__unguarded_linear_insert ( _RandomAccessIterator  __last)

This is a helper function for the sort routine.

Definition at line 2075 of file stl_algo.h.

Referenced by __insertion_sort(), and __unguarded_insertion_sort().

template<typename _RandomAccessIterator , typename _Compare >
void std::__unguarded_linear_insert ( _RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the sort routine.

Definition at line 2093 of file stl_algo.h.

template<typename _RandomAccessIterator , typename _Tp >
_RandomAccessIterator std::__unguarded_partition ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
const _Tp &  __pivot 
)

This is a helper function...

Definition at line 2220 of file stl_algo.h.

References iter_swap().

Referenced by __unguarded_partition_pivot().

template<typename _RandomAccessIterator , typename _Tp , typename _Compare >
_RandomAccessIterator std::__unguarded_partition ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
const _Tp &  __pivot,
_Compare  __comp 
)

This is a helper function...

Definition at line 2240 of file stl_algo.h.

References iter_swap().

template<typename _RandomAccessIterator >
_RandomAccessIterator std::__unguarded_partition_pivot ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
) [inline]

This is a helper function...

Definition at line 2261 of file stl_algo.h.

References __move_median_first(), and __unguarded_partition().

Referenced by __introsort_loop().

template<typename _RandomAccessIterator , typename _Compare >
_RandomAccessIterator std::__unguarded_partition_pivot ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
) [inline]

This is a helper function...

Definition at line 2273 of file stl_algo.h.

References __move_median_first(), and __unguarded_partition().

template<typename _ForwardIterator , typename _OutputIterator >
_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 1252 of file stl_algo.h.

Referenced by unique_copy().

template<typename _InputIterator , typename _OutputIterator >
_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 1275 of file stl_algo.h.

template<typename _InputIterator , typename _ForwardIterator >
_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 1298 of file stl_algo.h.

template<typename _ForwardIterator , typename _OutputIterator , typename _BinaryPredicate >
_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 1319 of file stl_algo.h.

template<typename _InputIterator , typename _OutputIterator , typename _BinaryPredicate >
_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 1348 of file stl_algo.h.

template<typename _InputIterator , typename _ForwardIterator , typename _BinaryPredicate >
_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 1377 of file stl_algo.h.

template<typename _T1 , typename... _Args>
void std::_Construct ( _T1 *  __p,
_Args &&...  __args 
) [inline]

Constructs an object in existing memory by invoking an allocated object's constructor with an initializer.

Definition at line 76 of file stl_construct.h.

template<typename _ForwardIterator >
void std::_Destroy ( _ForwardIterator  __first,
_ForwardIterator  __last 
) [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 124 of file stl_construct.h.

template<typename _InputIterator , typename _Tp >
_Tp std::accumulate ( _InputIterator  __first,
_InputIterator  __last,
_Tp  __init 
) [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.

Parameters:
__firstStart of range.
__lastEnd of range.
__initStarting value to add other values to.
Returns:
The final sum.

Definition at line 121 of file stl_numeric.h.

Referenced by __gnu_parallel::__parallel_partial_sum_linear().

template<typename _InputIterator , typename _Tp , typename _BinaryOperation >
_Tp std::accumulate ( _InputIterator  __first,
_InputIterator  __last,
_Tp  __init,
_BinaryOperation  __binary_op 
) [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.

Parameters:
__firstStart of range.
__lastEnd of range.
__initStarting value to add other values to.
__binary_opFunction object to accumulate with.
Returns:
The final sum.

Definition at line 147 of file stl_numeric.h.

template<typename _Tp >
std::complex< _Tp > std::acos ( const std::complex< _Tp > &  __z) [inline]

acos(__z) [8.1.2].

Definition at line 1601 of file complex.

template<typename _Tp >
std::complex< _Tp > std::acosh ( const std::complex< _Tp > &  __z) [inline]

acosh(__z) [8.1.5].

Definition at line 1717 of file complex.

template<typename _InputIterator , typename _OutputIterator >
_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.

Parameters:
__firstStart of input range.
__lastEnd of input range.
__resultOutput sums.
Returns:
Iterator pointing just beyond the values written to result.

_GLIBCXX_RESOLVE_LIB_DEFECTS DR 539. partial_sum and adjacent_difference should mention requirements

Definition at line 318 of file stl_numeric.h.

template<typename _InputIterator , typename _OutputIterator , typename _BinaryOperation >
_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.

Parameters:
__firstStart of input range.
__lastEnd of input range.
__resultOutput sum.
__binary_opFunction object.
Returns:
Iterator pointing just beyond the values written to result.

_GLIBCXX_RESOLVE_LIB_DEFECTS DR 539. partial_sum and adjacent_difference should mention requirements

Definition at line 361 of file stl_numeric.h.

template<typename _InputIterator , typename _Distance >
void std::advance ( _InputIterator &  __i,
_Distance  __n 
) [inline]

A generalization of pointer arithmetic.

Parameters:
__iAn input iterator.
__nThe delta by which to change __i.
Returns:
Nothing.

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 172 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(), std::deque< _Tp, _Alloc >::_M_range_initialize(), equal_range(), __gnu_pbds::detail::pat_trie_base::_Node_citer< Node, Leaf, Head, Inode, _CIterator, Iterator, _Alloc >::get_child(), __gnu_pbds::detail::pat_trie_base::_Node_iter< Node, Leaf, Head, Inode, _CIterator, Iterator, _Alloc >::get_child(), is_permutation(), lower_bound(), partition_point(), std::list< _Tp, _Alloc >::resize(), and upper_bound().

bool std::all ( ) const

Tests whether all the bits are on.

Returns:
True if all the bits are set.

Definition at line 1319 of file bitset.

bool std::any ( ) const

Tests whether any of the bits are on.

Returns:
True if at least one bit is set.

Definition at line 1327 of file bitset.

template<typename _Tp >
__gnu_cxx::__promote<_Tp>::__type std::arg ( _Tp  __x) [inline]

Additional overloads [8.1.9].

Definition at line 1815 of file complex.

References arg().

template<typename _Tp >
std::complex< _Tp > std::asin ( const std::complex< _Tp > &  __z) [inline]

asin(__z) [8.1.3].

Definition at line 1637 of file complex.

template<typename _Tp >
std::complex< _Tp > std::asinh ( const std::complex< _Tp > &  __z) [inline]

asinh(__z) [8.1.6].

Definition at line 1756 of file complex.

template<typename _Tp >
std::complex< _Tp > std::atan ( const std::complex< _Tp > &  __z) [inline]

atan(__z) [8.1.4].

Definition at line 1681 of file complex.

template<typename _Tp >
std::complex< _Tp > std::atanh ( const std::complex< _Tp > &  __z) [inline]

atanh(__z) [8.1.7].

Definition at line 1800 of file complex.

template<class _Container >
auto std::begin ( _Container &  __cont) [inline]

Return an iterator pointing to the first element of the container.

Parameters:
__contContainer.

Definition at line 48 of file range_access.h.

template<class _Container >
auto std::begin ( const _Container &  __cont) [inline]

Return an iterator pointing to the first element of the const container.

Parameters:
__contContainer.

Definition at line 58 of file range_access.h.

template<class _Tp , size_t _Nm>
_Tp* std::begin ( _Tp(&)  __arr[_Nm]) [inline]

Return an iterator pointing to the first element of the array.

Parameters:
__arrArray.

Definition at line 87 of file range_access.h.

ios_base& std::boolalpha ( ios_base &  __base) [inline]

Calls base.setf(ios_base::boolalpha).

Definition at line 797 of file ios_base.h.

References __gnu_debug::__base(), and std::ios_base::boolalpha.

template<typename _Tp , typename _Tp1 , _Lock_policy _Lp>
__shared_ptr<_Tp, _Lp> std::const_pointer_cast ( const __shared_ptr< _Tp1, _Lp > &  __r) [inline]

const_pointer_cast

Definition at line 1203 of file shared_ptr_base.h.

size_t std::count ( ) const

Returns the number of bits which are set.

Definition at line 1279 of file bitset.

Referenced by is_permutation().

template<typename _Tp >
reference_wrapper<const _Tp> std::cref ( const _Tp &  __t) [inline]

Denotes a const reference should be taken to a variable.

Definition at line 482 of file functional.

Referenced by cref().

template<typename _Tp >
void std::cref ( const _Tp &&  )

Denotes a reference should be taken to a variable.

template<typename _Tp >
reference_wrapper<const _Tp> std::cref ( reference_wrapper< _Tp >  __t) [inline]

Partial specialization.

Definition at line 500 of file functional.

References cref().

ios_base& std::dec ( ios_base &  __base) [inline]

Calls base.setf(ios_base::dec, ios_base::basefield).

Definition at line 935 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::basefield, std::ios_base::dec, and std::ios_base::setf().

Referenced by operator>>().

template<typename _InputIterator >
iterator_traits<_InputIterator>::difference_type std::distance ( _InputIterator  __first,
_InputIterator  __last 
) [inline]

A generalization of pointer arithmetic.

Parameters:
__firstAn input iterator.
__lastAn input iterator.
Returns:
The distance between them.

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 114 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(), std::deque< _Tp, _Alloc >::_M_range_initialize(), equal_range(), inplace_merge(), is_heap_until(), is_permutation(), std::sub_match< _Bi_iter >::length(), lower_bound(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), __gnu_pbds::detail::pat_trie_base::_Node_citer< Node, Leaf, Head, Inode, _CIterator, Iterator, _Alloc >::num_children(), partition_point(), std::match_results< _FwdIterT, _Alloc >::position(), std::list< __inp, __rebind_inp >::size(), std::list< __inp, __rebind_inp >::splice(), and upper_bound().

template<typename _Tp , typename _Tp1 , _Lock_policy _Lp>
__shared_ptr<_Tp, _Lp> std::dynamic_pointer_cast ( const __shared_ptr< _Tp1, _Lp > &  __r) [inline]

dynamic_pointer_cast

Definition at line 1213 of file shared_ptr_base.h.

template<class _Container >
auto std::end ( _Container &  __cont) [inline]

Return an iterator pointing to one past the last element of the container.

Parameters:
__contContainer.

Definition at line 68 of file range_access.h.

template<class _Container >
auto std::end ( const _Container &  __cont) [inline]

Return an iterator pointing to one past the last element of the const container.

Parameters:
__contContainer.

Definition at line 78 of file range_access.h.

template<class _Tp , size_t _Nm>
_Tp* std::end ( _Tp(&)  __arr[_Nm]) [inline]

Return an iterator pointing to one past the last element of the array.

Parameters:
__arrArray.

Definition at line 97 of file range_access.h.

template<typename _CharT , typename _Traits >
basic_ostream<_CharT, _Traits>& std::endl ( basic_ostream< _CharT, _Traits > &  __os) [inline]

Write a newline and flush the stream.

This manipulator is often mistakenly used when a simple newline is desired, leading to poor buffering performance. See http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt11ch25s02.html for more on this subject.

Definition at line 562 of file ostream.

References flush(), std::basic_ostream< _CharT, _Traits >::put(), and std::basic_ios< _CharT, _Traits >::widen().

template<typename _CharT , typename _Traits >
basic_ostream<_CharT, _Traits>& std::ends ( basic_ostream< _CharT, _Traits > &  __os) [inline]

Write a null character into the output sequence.

Null character is CharT() by definition. For CharT of char, this correctly writes the ASCII NUL character string terminator.

Definition at line 574 of file ostream.

References std::basic_ostream< _CharT, _Traits >::put().

template<typename _Tp >
_Tp std::fabs ( const std::complex< _Tp > &  __z) [inline]

fabs(__z) [8.1.8].

Definition at line 1809 of file complex.

References abs().

ios_base& std::fixed ( ios_base &  __base) [inline]

Calls base.setf(ios_base::fixed, ios_base::floatfield).

Definition at line 960 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::fixed, std::ios_base::floatfield, and std::ios_base::setf().

bitset<_Nb>& std::flip ( )

Toggles every bit to its opposite value.

Definition at line 1106 of file bitset.

bitset<_Nb>& std::flip ( size_t  __position)

Toggles a given bit to its opposite value.

Parameters:
__positionThe index of the bit.
Exceptions:
std::out_of_rangeIf pos is bigger the size of the set.

Definition at line 1119 of file bitset.

References _Unchecked_flip().

template<typename _CharT , typename _Traits >
basic_ostream<_CharT, _Traits>& std::flush ( basic_ostream< _CharT, _Traits > &  __os) [inline]

Flushes the output stream.

This manipulator simply calls the stream's flush() member function.

Definition at line 584 of file ostream.

References std::basic_ostream< _CharT, _Traits >::flush().

Referenced by endl().

template<typename _MoneyT >
_Get_money<_MoneyT> std::get_money ( _MoneyT &  __mon,
bool  __intl = false 
) [inline]

Extended manipulator for extracting money.

Parameters:
__monEither long double or a specialization of basic_string.
__intlA bool indicating whether international format is to be used.

Sent to a stream object, this manipulator extracts __mon.

Definition at line 258 of file iomanip.

template<typename _Tp >
pair<_Tp*, ptrdiff_t> std::get_temporary_buffer ( ptrdiff_t  __len)

Allocates a temporary buffer.

Parameters:
__lenThe number of objects of type Tp.
Returns:
See full description.

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 87 of file stl_tempbuf.h.

Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer().

template<typename _CharT , typename _Traits , typename _Alloc , template< typename, typename, typename > class _Base>
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.

Parameters:
__isInput stream.
__strBuffer to store into.
__delimCharacter marking end of line.
Returns:
Reference to the input stream.

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.

Definition at line 627 of file vstring.tcc.

References __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::append(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::erase(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().

template<typename _CharT , typename _Traits , typename _Alloc , template< typename, typename, typename > class _Base>
basic_istream<_CharT, _Traits>& std::getline ( basic_istream< _CharT, _Traits > &  __is,
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &  __str 
) [inline]

Read a line from stream into a string.

Parameters:
__isInput stream.
__strBuffer to store into.
Returns:
Reference to the input stream.

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 2533 of file vstring.h.

References getline(), and std::basic_ios< _CharT, _Traits >::widen().

template<typename _CharT , typename _Traits , typename _Alloc >
basic_istream< _CharT, _Traits > & std::getline ( basic_istream< _CharT, _Traits > &  __is,
basic_string< _CharT, _Traits, _Alloc > &  __str,
_CharT  __delim 
)

Read a line from stream into a string.

Parameters:
__isInput stream.
__strBuffer to store into.
__delimCharacter marking end of line.
Returns:
Reference to the input stream.

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.

Definition at line 1070 of file basic_string.tcc.

References std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().

Referenced by getline().

template<typename _CharT , typename _Traits , typename _Alloc >
basic_istream<_CharT, _Traits>& std::getline ( basic_istream< _CharT, _Traits > &  __is,
basic_string< _CharT, _Traits, _Alloc > &  __str 
) [inline]

Read a line from stream into a string.

Parameters:
__isInput stream.
__strBuffer to store into.
Returns:
Reference to the input stream.

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 2792 of file basic_string.h.

References getline(), and std::basic_ios< _CharT, _Traits >::widen().

template<typename _Facet >
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.

Template Parameters:
_FacetThe facet type to test the presence of.
Parameters:
__locThe locale to test.
Returns:
true if __loc contains a facet of type _Facet, else false.

Definition at line 103 of file locale_classes.tcc.

ios_base& std::hex ( ios_base &  __base) [inline]

Calls base.setf(ios_base::hex, ios_base::basefield).

Definition at line 943 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::basefield, std::ios_base::hex, and std::ios_base::setf().

Referenced by std::regex_traits< _Ch_type >::value().

template<typename _InputIterator1 , typename _InputIterator2 , typename _Tp >
_Tp std::inner_product ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_Tp  __init 
) [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.

Parameters:
__first1Start of range 1.
__last1End of range 1.
__first2Start of range 2.
__initStarting value to add other values to.
Returns:
The final inner product.

Definition at line 175 of file stl_numeric.h.

template<typename _InputIterator1 , typename _InputIterator2 , typename _Tp , typename _BinaryOperation1 , typename _BinaryOperation2 >
_Tp std::inner_product ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_Tp  __init,
_BinaryOperation1  __binary_op1,
_BinaryOperation2  __binary_op2 
) [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.

Parameters:
__first1Start of range 1.
__last1End of range 1.
__first2Start of range 2.
__initStarting value to add other values to.
__binary_op1Function object to accumulate with.
__binary_op2Function object to apply to pairs of input values.
Returns:
The final inner product.

Definition at line 207 of file stl_numeric.h.

ios_base& std::internal ( ios_base &  __base) [inline]

Calls base.setf(ios_base::internal, ios_base::adjustfield).

Definition at line 910 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::adjustfield, and std::ios_base::internal.

template<typename _ForwardIterator , typename _Tp >
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.

Parameters:
__firstStart of range.
__lastEnd of range.
__valueStarting value.
Returns:
Nothing.

Definition at line 83 of file stl_numeric.h.

template<typename _CharT >
bool std::isalnum ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::alnum, __c).

Definition at line 2583 of file locale_facets.h.

template<typename _CharT >
bool std::isalpha ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::alpha, __c).

Definition at line 2559 of file locale_facets.h.

template<typename _CharT >
bool std::iscntrl ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::cntrl, __c).

Definition at line 2541 of file locale_facets.h.

template<typename _CharT >
bool std::isdigit ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::digit, __c).

Definition at line 2565 of file locale_facets.h.

template<typename _CharT >
bool std::isgraph ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::graph, __c).

Definition at line 2589 of file locale_facets.h.

template<typename _CharT >
bool std::islower ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::lower, __c).

Definition at line 2553 of file locale_facets.h.

template<typename _CharT >
bool std::isprint ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::print, __c).

Definition at line 2535 of file locale_facets.h.

template<typename _CharT >
bool std::ispunct ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::punct, __c).

Definition at line 2571 of file locale_facets.h.

template<typename _CharT >
bool std::isspace ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::space, __c).

Definition at line 2529 of file locale_facets.h.

template<typename _CharT >
bool std::isupper ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::upper, __c).

Definition at line 2547 of file locale_facets.h.

template<typename _CharT >
bool std::isxdigit ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::xdigit, __c).

Definition at line 2577 of file locale_facets.h.

ios_base& std::left ( ios_base &  __base) [inline]

Calls base.setf(ios_base::left, ios_base::adjustfield).

Definition at line 918 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::adjustfield, std::ios_base::left, and std::ios_base::setf().

Referenced by operator<<().

template<class _T1 , class _T2 >
constexpr pair<typename __decay_and_strip<_T1>::__type, typename __decay_and_strip<_T2>::__type> std::make_pair ( _T1 &&  __x,
_T2 &&  __y 
)
ios_base& std::noboolalpha ( ios_base &  __base) [inline]

Calls base.unsetf(ios_base::boolalpha).

Definition at line 805 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::boolalpha, and std::ios_base::unsetf().

bool std::none ( ) const

Tests whether any of the bits are on.

Returns:
True if none of the bits are set.

Definition at line 1335 of file bitset.

ios_base& std::noshowbase ( ios_base &  __base) [inline]

Calls base.unsetf(ios_base::showbase).

Definition at line 821 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::showbase, and std::ios_base::unsetf().

ios_base& std::noshowpoint ( ios_base &  __base) [inline]

Calls base.unsetf(ios_base::showpoint).

Definition at line 837 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::showpoint, and std::ios_base::unsetf().

ios_base& std::noshowpos ( ios_base &  __base) [inline]

Calls base.unsetf(ios_base::showpos).

Definition at line 853 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::showpos, and std::ios_base::unsetf().

ios_base& std::noskipws ( ios_base &  __base) [inline]

Calls base.unsetf(ios_base::skipws).

Definition at line 869 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::skipws, and std::ios_base::unsetf().

ios_base& std::nounitbuf ( ios_base &  __base) [inline]

Calls base.unsetf(ios_base::unitbuf).

Definition at line 901 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::unitbuf, and std::ios_base::unsetf().

ios_base& std::nouppercase ( ios_base &  __base) [inline]

Calls base.unsetf(ios_base::uppercase).

Definition at line 885 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::unsetf(), and std::ios_base::uppercase.

ios_base& std::oct ( ios_base &  __base) [inline]

Calls base.setf(ios_base::oct, ios_base::basefield).

Definition at line 951 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::basefield, std::ios_base::oct, and std::ios_base::setf().

Referenced by std::regex_traits< _Ch_type >::value().

template<class _T1 , class _T2 >
constexpr bool std::operator!= ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Uses operator== to find the result.

Definition at line 225 of file stl_pair.h.

template<typename _Tp , typename _Seq >
bool std::operator!= ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Based on operator==.

Definition at line 266 of file stl_stack.h.

template<typename _Tp >
bool std::operator!= ( const _Fwd_list_iterator< _Tp > &  __x,
const _Fwd_list_const_iterator< _Tp > &  __y 
) [inline]

Forward list iterator inequality comparison.

Definition at line 267 of file forward_list.h.

template<typename _Tp , typename _Seq >
bool std::operator!= ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Based on operator==.

Definition at line 291 of file stl_queue.h.

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

Returns !(x == y).

Definition at line 709 of file stl_multiset.h.

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

Returns !(x == y).

Definition at line 728 of file stl_set.h.

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

Based on operator==.

Definition at line 829 of file stl_multimap.h.

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

Based on operator==.

Definition at line 913 of file stl_map.h.

template<typename _Tp , typename _Alloc >
bool std::operator!= ( const forward_list< _Tp, _Alloc > &  __lx,
const forward_list< _Tp, _Alloc > &  __ly 
) [inline]

Based on operator==.

Definition at line 1275 of file forward_list.h.

bool std::operator!= ( const bitset< _Nb > &  __rhs) const

These comparisons for equality/inequality are, well, bitwise.

Definition at line 1294 of file bitset.

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

Based on operator==.

Definition at line 1379 of file stl_vector.h.

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

Based on operator==.

Definition at line 1666 of file stl_list.h.

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

Based on operator==.

Definition at line 1955 of file stl_deque.h.

template<typename _Res , typename... _Args>
bool std::operator!= ( const function< _Res(_Args...)> &  __f,
nullptr_t   
) [inline]

Compares a polymorphic function object wrapper against 0 (the NULL pointer).

Returns:
false if the wrapper has no target, true otherwise

This function will not throw an exception.

Definition at line 2395 of file functional.

template<typename _Res , typename... _Args>
bool std::operator!= ( nullptr_t  ,
const function< _Res(_Args...)> &  __f 
) [inline]

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Definition at line 2401 of file functional.

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator!= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test difference of two strings.

Parameters:
__lhsFirst string.
__rhsSecond string.
Returns:
True if __lhs.compare(__rhs) != 0. False otherwise.

Definition at line 2529 of file basic_string.h.

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator!= ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test difference of C string and string.

Parameters:
__lhsC string.
__rhsString.
Returns:
True if __rhs.compare(__lhs) != 0. False otherwise.

Definition at line 2541 of file basic_string.h.

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator!= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test difference of string and C string.

Parameters:
__lhsString.
__rhsC string.
Returns:
True if __lhs.compare(__rhs) != 0. False otherwise.

Definition at line 2553 of file basic_string.h.

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

Global bitwise operations on bitsets.

Parameters:
__xA bitset.
__yA bitset of the same size as __x.
Returns:
A new bitset.

These should be self-explanatory.

Definition at line 1418 of file bitset.

template<typename _CharT , typename _Traits , typename _Alloc >
basic_string<_CharT, _Traits, _Alloc> std::operator+ ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
)

Concatenate two strings.

Parameters:
__lhsFirst string.
__rhsLast string.
Returns:
New string with value of __lhs followed by __rhs.

Definition at line 2362 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::append().

template<typename _CharT , typename _Traits , typename _Alloc >
basic_string< _CharT, _Traits, _Alloc > std::operator+ ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
)

Concatenate C string and string.

Parameters:
__lhsFirst string.
__rhsLast string.
Returns:
New string with value of __lhs followed by __rhs.

Definition at line 694 of file basic_string.tcc.

References std::basic_string< _CharT, _Traits, _Alloc >::size().

template<typename _CharT , typename _Traits , typename _Alloc >
basic_string< _CharT, _Traits, _Alloc > std::operator+ ( _CharT  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
)

Concatenate character and string.

Parameters:
__lhsFirst string.
__rhsLast string.
Returns:
New string with __lhs followed by __rhs.

Definition at line 710 of file basic_string.tcc.

References std::basic_string< _CharT, _Traits, _Alloc >::size().

template<typename _CharT , typename _Traits , typename _Alloc >
basic_string<_CharT, _Traits, _Alloc> std::operator+ ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Concatenate string and C string.

Parameters:
__lhsFirst string.
__rhsLast string.
Returns:
New string with __lhs followed by __rhs.

Definition at line 2399 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::append().

template<typename _CharT , typename _Traits , typename _Alloc >
basic_string<_CharT, _Traits, _Alloc> std::operator+ ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
_CharT  __rhs 
) [inline]

Concatenate string and character.

Parameters:
__lhsFirst string.
__rhsLast string.
Returns:
New string with __lhs followed by __rhs.

Definition at line 2415 of file basic_string.h.

template<class _T1 , class _T2 >
constexpr bool std::operator< ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]
template<typename _Tp , typename _Seq >
bool std::operator< ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Stack ordering relation.

Parameters:
__xA stack.
__yA stack of the same type as x.
Returns:
True iff x is lexicographically less than __y.

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 260 of file stl_stack.h.

template<typename _Tp , typename _Seq >
bool std::operator< ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Queue ordering relation.

Parameters:
__xA queue.
__yA queue of the same type as x.
Returns:
True iff __x is lexicographically less than __y.

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 285 of file stl_queue.h.

References std::queue< _Tp, _Sequence >::c.

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

Multiset ordering relation.

Parameters:
__xA multiset.
__yA multiset of the same type as __x.
Returns:
True iff __x is lexicographically less than __y.

This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <.

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

Definition at line 702 of file stl_multiset.h.

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

Set ordering relation.

Parameters:
__xA set.
__yA set of the same type as x.
Returns:
True iff __x is lexicographically less than __y.

This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <.

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

Definition at line 721 of file stl_set.h.

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

Multimap ordering relation.

Parameters:
__xA multimap.
__yA multimap of the same type as __x.
Returns:
True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the multimaps. The elements must be comparable with <.

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

Definition at line 822 of file stl_multimap.h.

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

Map ordering relation.

Parameters:
__xA map.
__yA map of the same type as x.
Returns:
True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <.

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

Definition at line 906 of file stl_map.h.

template<typename _Tp , typename _Alloc >
bool std::operator< ( const forward_list< _Tp, _Alloc > &  __lx,
const forward_list< _Tp, _Alloc > &  __ly 
) [inline]

Forward list ordering relation.

Parameters:
__lxA forward_list.
__lyA forward_list of the same type as __lx.
Returns:
True iff __lx is lexicographically less than __ly.

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 1267 of file forward_list.h.

References lexicographical_compare().

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

Vector ordering relation.

Parameters:
__xA vector.
__yA vector of the same type as __x.
Returns:
True iff __x is lexicographically less than __y.

This is a total ordering relation. It is linear in the size of the vectors. The elements must be comparable with <.

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

Definition at line 1372 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin(), std::vector< _Tp, _Alloc >::end(), and lexicographical_compare().

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

List ordering relation.

Parameters:
__xA list.
__yA list of the same type as __x.
Returns:
True iff __x is lexicographically less than __y.

This is a total ordering relation. It is linear in the size of the lists. The elements must be comparable with <.

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

Definition at line 1659 of file stl_list.h.

References lexicographical_compare().

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

Deque ordering relation.

Parameters:
__xA deque.
__yA deque of the same type as __x.
Returns:
True iff x is lexicographically less than __y.

This is a total ordering relation. It is linear in the size of the deques. The elements must be comparable with <.

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

Definition at line 1947 of file stl_deque.h.

References lexicographical_compare().

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator< ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if string precedes string.

Parameters:
__lhsFirst string.
__rhsSecond string.
Returns:
True if __lhs precedes __rhs. False otherwise.

Definition at line 2566 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator< ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test if string precedes C string.

Parameters:
__lhsString.
__rhsC string.
Returns:
True if __lhs precedes __rhs. False otherwise.

Definition at line 2578 of file basic_string.h.

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator< ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if C string precedes string.

Parameters:
__lhsC string.
__rhsString.
Returns:
True if __lhs precedes __rhs. False otherwise.

Definition at line 2590 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits >
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &  __out,
_CharT  __c 
) [inline]

Character inserters.

Parameters:
__outAn output stream.
__cA character.
Returns:
out

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts a single character and any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

If __c is of type char and the character type of the stream is not char, the character is widened before insertion.

Definition at line 469 of file ostream.

template<typename _CharT , typename _Traits >
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &  __out,
char  __c 
) [inline]

Character inserters.

Parameters:
__outAn output stream.
__cA character.
Returns:
out

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts a single character and any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

If __c is of type char and the character type of the stream is not char, the character is widened before insertion.

Definition at line 474 of file ostream.

template<class _Traits >
basic_ostream<char, _Traits>& std::operator<< ( basic_ostream< char, _Traits > &  __out,
char  __c 
) [inline]

Character inserters.

Parameters:
__outAn output stream.
__cA character.
Returns:
out

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts a single character and any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

If __c is of type char and the character type of the stream is not char, the character is widened before insertion.

Definition at line 480 of file ostream.

template<class _Traits >
basic_ostream<char, _Traits>& std::operator<< ( basic_ostream< char, _Traits > &  __out,
signed char  __c 
) [inline]

Character inserters.

Parameters:
__outAn output stream.
__cA character.
Returns:
out

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts a single character and any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

If __c is of type char and the character type of the stream is not char, the character is widened before insertion.

Definition at line 486 of file ostream.

template<class _Traits >
basic_ostream<char, _Traits>& std::operator<< ( basic_ostream< char, _Traits > &  __out,
unsigned char  __c 
) [inline]

Character inserters.

Parameters:
__outAn output stream.
__cA character.
Returns:
out

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts a single character and any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

If __c is of type char and the character type of the stream is not char, the character is widened before insertion.

Definition at line 491 of file ostream.

template<typename _CharT , typename _Traits >
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &  __out,
const _CharT *  __s 
) [inline]

String inserters.

Parameters:
__outAn output stream.
__sA character string.
Returns:
out
Precondition:
__s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(__s) characters starting at __s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

Definition at line 511 of file ostream.

References std::ios_base::badbit.

template<typename _CharT , typename _Traits >
basic_ostream< _CharT, _Traits > & std::operator<< ( basic_ostream< _CharT, _Traits > &  __out,
const char *  __s 
)

String inserters.

Parameters:
__outAn output stream.
__sA character string.
Returns:
out
Precondition:
__s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(__s) characters starting at __s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

Definition at line 323 of file ostream.tcc.

References std::ios_base::badbit, and std::basic_ios< _CharT, _Traits >::setstate().

template<class _Traits >
basic_ostream<char, _Traits>& std::operator<< ( basic_ostream< char, _Traits > &  __out,
const char *  __s 
) [inline]

String inserters.

Parameters:
__outAn output stream.
__sA character string.
Returns:
out
Precondition:
__s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(__s) characters starting at __s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

Definition at line 528 of file ostream.

References std::ios_base::badbit.

template<class _Traits >
basic_ostream<char, _Traits>& std::operator<< ( basic_ostream< char, _Traits > &  __out,
const signed char *  __s 
) [inline]

String inserters.

Parameters:
__outAn output stream.
__sA character string.
Returns:
out
Precondition:
__s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(__s) characters starting at __s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

Definition at line 541 of file ostream.

template<class _Traits >
basic_ostream<char, _Traits>& std::operator<< ( basic_ostream< char, _Traits > &  __out,
const unsigned char *  __s 
) [inline]

String inserters.

Parameters:
__outAn output stream.
__sA character string.
Returns:
out
Precondition:
__s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(__s) characters starting at __s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). __out.width(0) is then called.

Definition at line 546 of file ostream.

template<typename _CharT , typename _Traits , typename _Tp >
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &&  __os,
const _Tp &  __x 
) [inline]

Generic inserter for rvalue stream.

Parameters:
__osAn input stream.
__xA reference to the object being inserted.
Returns:
os

This is just a forwarding function to allow insertion to rvalue streams since they won't bind to the inserter functions that take an lvalue reference.

Definition at line 600 of file ostream.

bitset<_Nb> std::operator<< ( size_t  __position) const

Self-explanatory.

Definition at line 1341 of file bitset.

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

Global I/O operators for bitsets.

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

Definition at line 1523 of file bitset.

References std::__ctype_abstract_base< _CharT >::widen().

template<typename _CharT , typename _Traits , typename _Alloc , template< typename, typename, typename > class _Base>
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &  __os,
const __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &  __str 
) [inline]

Write string to a stream.

Parameters:
__osOutput stream.
__strString to write out.
Returns:
Reference to the output stream.

Output characters of __str into os following the same rules as for writing a C string.

Definition at line 2487 of file vstring.h.

template<typename _CharT , typename _Traits , typename _Alloc >
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &  __os,
const basic_string< _CharT, _Traits, _Alloc > &  __str 
) [inline]

Write string to a stream.

Parameters:
__osOutput stream.
__strString to write out.
Returns:
Reference to the output stream.

Output characters of __str into os following the same rules as for writing a C string.

Definition at line 2750 of file basic_string.h.

bitset<_Nb>& std::operator<<= ( size_t  __position)

Operations on bitsets.

Parameters:
__positionThe number of places to shift.

These should be self-explanatory.

Definition at line 982 of file bitset.

template<class _T1 , class _T2 >
constexpr bool std::operator<= ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Uses operator< to find the result.

Definition at line 237 of file stl_pair.h.

template<typename _Tp , typename _Seq >
bool std::operator<= ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 278 of file stl_stack.h.

template<typename _Tp , typename _Seq >
bool std::operator<= ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 303 of file stl_queue.h.

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

Returns !(y < x)

Definition at line 723 of file stl_multiset.h.

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

Returns !(y < x)

Definition at line 742 of file stl_set.h.

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

Based on operator<.

Definition at line 843 of file stl_multimap.h.

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

Based on operator<.

Definition at line 927 of file stl_map.h.

template<typename _Tp , typename _Alloc >
bool std::operator<= ( const forward_list< _Tp, _Alloc > &  __lx,
const forward_list< _Tp, _Alloc > &  __ly 
) [inline]

Based on operator<.

Definition at line 1296 of file forward_list.h.

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

Based on operator<.

Definition at line 1391 of file stl_vector.h.

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

Based on operator<.

Definition at line 1678 of file stl_list.h.

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

Based on operator<.

Definition at line 1969 of file stl_deque.h.

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator<= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if string doesn't follow string.

Parameters:
__lhsFirst string.
__rhsSecond string.
Returns:
True if __lhs doesn't follow __rhs. False otherwise.

Definition at line 2640 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator<= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test if string doesn't follow C string.

Parameters:
__lhsString.
__rhsC string.
Returns:
True if __lhs doesn't follow __rhs. False otherwise.

Definition at line 2652 of file basic_string.h.

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator<= ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if C string doesn't follow string.

Parameters:
__lhsC string.
__rhsString.
Returns:
True if __lhs doesn't follow __rhs. False otherwise.

Definition at line 2664 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<class _T1 , class _T2 >
constexpr bool std::operator== ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Two pairs of the same type are equal iff their members are equal.

Definition at line 212 of file stl_pair.h.

References std::pair< _T1, _T2 >::first, and std::pair< _T1, _T2 >::second.

template<typename _StateT >
bool std::operator== ( const fpos< _StateT > &  __lhs,
const fpos< _StateT > &  __rhs 
) [inline]

Test if equivalent to another position.

Definition at line 218 of file postypes.h.

template<typename _Tp , typename _Seq >
bool std::operator== ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Stack equality comparison.

Parameters:
__xA stack.
__yA stack of the same type as __x.
Returns:
True iff the size and elements of the stacks are equal.

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 242 of file stl_stack.h.

template<typename _Tp >
bool std::operator== ( const _Fwd_list_iterator< _Tp > &  __x,
const _Fwd_list_const_iterator< _Tp > &  __y 
) [inline]

Forward list iterator equality comparison.

Definition at line 258 of file forward_list.h.

template<typename _Tp , typename _Seq >
bool std::operator== ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Queue equality comparison.

Parameters:
__xA queue.
__yA queue of the same type as __x.
Returns:
True iff the size and elements of the queues are equal.

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 267 of file stl_queue.h.

References std::queue< _Tp, _Sequence >::c.

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

Multiset equality comparison.

Parameters:
__xA multiset.
__yA multiset of the same type as __x.
Returns:
True iff the size and elements of the multisets are equal.

This is an equivalence relation. It is linear in the size of the multisets. Multisets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 685 of file stl_multiset.h.

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

Set equality comparison.

Parameters:
__xA set.
__yA set of the same type as x.
Returns:
True iff the size and elements of the sets are equal.

This is an equivalence relation. It is linear in the size of the sets. Sets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 704 of file stl_set.h.

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

Multimap equality comparison.

Parameters:
__xA multimap.
__yA multimap of the same type as __x.
Returns:
True iff the size and elements of the maps are equal.

This is an equivalence relation. It is linear in the size of the multimaps. Multimaps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 805 of file stl_multimap.h.

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

Map equality comparison.

Parameters:
__xA map.
__yA map of the same type as x.
Returns:
True iff the size and elements of the maps are equal.

This is an equivalence relation. It is linear in the size of the maps. Maps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 889 of file stl_map.h.

template<typename _Tp , typename _Alloc >
bool std::operator== ( const forward_list< _Tp, _Alloc > &  __lx,
const forward_list< _Tp, _Alloc > &  __ly 
)

Forward list equality comparison.

Parameters:
__lxA forward_list
__lyA forward_list of the same type as __lx.
Returns:
True iff the size and elements of the forward lists are equal.

This is an equivalence relation. It is linear in the size of the forward lists. Deques are considered equivalent if corresponding elements compare equal.

Definition at line 379 of file forward_list.tcc.

References std::forward_list< _Tp, _Alloc >::cbegin(), and std::forward_list< _Tp, _Alloc >::cend().

bool std::operator== ( const bitset< _Nb > &  __rhs) const

These comparisons for equality/inequality are, well, bitwise.

Definition at line 1290 of file bitset.

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

Vector equality comparison.

Parameters:
__xA vector.
__yA vector of the same type as __x.
Returns:
True iff the size and elements of the vectors are equal.

This is an equivalence relation. It is linear in the size of the vectors. Vectors are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 1355 of file stl_vector.h.

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

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

List equality comparison.

Parameters:
__xA list.
__yA list of the same type as __x.
Returns:
True iff the size and elements of the lists are equal.

This is an equivalence relation. It is linear in the size of the lists. Lists are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 1625 of file stl_list.h.

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

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

Deque equality comparison.

Parameters:
__xA deque.
__yA deque of the same type as __x.
Returns:
True iff the size and elements of the deques are equal.

This is an equivalence relation. It is linear in the size of the deques. Deques are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 1929 of file stl_deque.h.

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

template<typename _Res , typename... _Args>
bool std::operator== ( const function< _Res(_Args...)> &  __f,
nullptr_t   
) [inline]

Compares a polymorphic function object wrapper against 0 (the NULL pointer).

Returns:
true if the wrapper has no target, false otherwise

This function will not throw an exception.

Definition at line 2377 of file functional.

template<typename _Res , typename... _Args>
bool std::operator== ( nullptr_t  ,
const function< _Res(_Args...)> &  __f 
) [inline]

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Definition at line 2383 of file functional.

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator== ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test equivalence of two strings.

Parameters:
__lhsFirst string.
__rhsSecond string.
Returns:
True if __lhs.compare(__rhs) == 0. False otherwise.

Definition at line 2483 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator== ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test equivalence of C string and string.

Parameters:
__lhsC string.
__rhsString.
Returns:
True if __rhs.compare(__lhs) == 0. False otherwise.

Definition at line 2504 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator== ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test equivalence of string and C string.

Parameters:
__lhsString.
__rhsC string.
Returns:
True if __lhs.compare(__rhs) == 0. False otherwise.

Definition at line 2516 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<class _T1 , class _T2 >
constexpr bool std::operator> ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Uses operator< to find the result.

Definition at line 231 of file stl_pair.h.

template<typename _Tp , typename _Seq >
bool std::operator> ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 272 of file stl_stack.h.

template<typename _Tp , typename _Seq >
bool std::operator> ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 297 of file stl_queue.h.

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

Returns y < x.

Definition at line 716 of file stl_multiset.h.

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

Returns y < x.

Definition at line 735 of file stl_set.h.

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

Based on operator<.

Definition at line 836 of file stl_multimap.h.

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

Based on operator<.

Definition at line 920 of file stl_map.h.

template<typename _Tp , typename _Alloc >
bool std::operator> ( const forward_list< _Tp, _Alloc > &  __lx,
const forward_list< _Tp, _Alloc > &  __ly 
) [inline]

Based on operator<.

Definition at line 1282 of file forward_list.h.

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

Based on operator<.

Definition at line 1385 of file stl_vector.h.

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

Based on operator<.

Definition at line 1672 of file stl_list.h.

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

Based on operator<.

Definition at line 1962 of file stl_deque.h.

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator> ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if string follows string.

Parameters:
__lhsFirst string.
__rhsSecond string.
Returns:
True if __lhs follows __rhs. False otherwise.

Definition at line 2603 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator> ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test if string follows C string.

Parameters:
__lhsString.
__rhsC string.
Returns:
True if __lhs follows __rhs. False otherwise.

Definition at line 2615 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator> ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if C string follows string.

Parameters:
__lhsC string.
__rhsString.
Returns:
True if __lhs follows __rhs. False otherwise.

Definition at line 2627 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<class _T1 , class _T2 >
constexpr bool std::operator>= ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Uses operator< to find the result.

Definition at line 243 of file stl_pair.h.

template<typename _Tp , typename _Seq >
bool std::operator>= ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 284 of file stl_stack.h.

template<typename _Tp , typename _Seq >
bool std::operator>= ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 309 of file stl_queue.h.

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

Returns !(x < y)

Definition at line 730 of file stl_multiset.h.

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

Returns !(x < y)

Definition at line 749 of file stl_set.h.

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

Based on operator<.

Definition at line 850 of file stl_multimap.h.

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

Based on operator<.

Definition at line 934 of file stl_map.h.

template<typename _Tp , typename _Alloc >
bool std::operator>= ( const forward_list< _Tp, _Alloc > &  __lx,
const forward_list< _Tp, _Alloc > &  __ly 
) [inline]

Based on operator<.

Definition at line 1289 of file forward_list.h.

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

Based on operator<.

Definition at line 1397 of file stl_vector.h.

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

Based on operator<.

Definition at line 1684 of file stl_list.h.

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

Based on operator<.

Definition at line 1976 of file stl_deque.h.

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator>= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if string doesn't precede string.

Parameters:
__lhsFirst string.
__rhsSecond string.
Returns:
True if __lhs doesn't precede __rhs. False otherwise.

Definition at line 2677 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator>= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test if string doesn't precede C string.

Parameters:
__lhsString.
__rhsC string.
Returns:
True if __lhs doesn't precede __rhs. False otherwise.

Definition at line 2689 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits , typename _Alloc >
bool std::operator>= ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if C string doesn't precede string.

Parameters:
__lhsC string.
__rhsString.
Returns:
True if __lhs doesn't precede __rhs. False otherwise.

Definition at line 2701 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT , typename _Traits >
basic_istream< _CharT, _Traits > & std::operator>> ( basic_istream< _CharT, _Traits > &  __in,
_CharT &  __c 
)

Character extractors.

Parameters:
__inAn input stream.
__cA character reference.
Returns:
in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts a character (if one is available) and stores it in __c. Otherwise, sets failbit in the input stream.

Definition at line 925 of file istream.tcc.

References std::ios_base::badbit, std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().

template<class _Traits >
basic_istream<char, _Traits>& std::operator>> ( basic_istream< char, _Traits > &  __in,
unsigned char &  __c 
) [inline]

Character extractors.

Parameters:
__inAn input stream.
__cA character reference.
Returns:
in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts a character (if one is available) and stores it in __c. Otherwise, sets failbit in the input stream.

Definition at line 725 of file istream.

template<class _Traits >
basic_istream<char, _Traits>& std::operator>> ( basic_istream< char, _Traits > &  __in,
signed char &  __c 
) [inline]

Character extractors.

Parameters:
__inAn input stream.
__cA character reference.
Returns:
in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts a character (if one is available) and stores it in __c. Otherwise, sets failbit in the input stream.

Definition at line 730 of file istream.

template<typename _CharT , typename _Traits >
basic_istream< _CharT, _Traits > & std::operator>> ( basic_istream< _CharT, _Traits > &  __in,
_CharT *  __s 
)

Character string extractors.

Parameters:
__inAn input stream.
__sA pointer to a character array.
Returns:
__in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts up to n characters and stores them into the array starting at __s. n is defined as:

  • if width() is greater than zero, n is width() otherwise
    • n is the number of elements of the largest array of *
    • char_type that can store a terminating eos.
    • [27.6.1.2.3]/6

Characters are extracted and stored until one of the following happens:

  • n-1 characters are stored
  • EOF is reached
  • the next character is whitespace according to the current locale
  • the next character is a null byte (i.e., charT() )

width(0) is then called for the input stream.

If no characters are extracted, sets failbit.

Definition at line 957 of file istream.tcc.

References std::ios_base::badbit, std::basic_ios< _CharT, _Traits >::eof(), std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::getloc(), std::ios_base::goodbit, std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), and std::ios_base::width().

template<>
basic_istream<char>& std::operator>> ( basic_istream< char > &  __in,
char *  __s 
)

Character string extractors.

Parameters:
__inAn input stream.
__sA pointer to a character array.
Returns:
__in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts up to n characters and stores them into the array starting at __s. n is defined as:

  • if width() is greater than zero, n is width() otherwise
    • n is the number of elements of the largest array of *
    • char_type that can store a terminating eos.
    • [27.6.1.2.3]/6

Characters are extracted and stored until one of the following happens:

  • n-1 characters are stored
  • EOF is reached
  • the next character is whitespace according to the current locale
  • the next character is a null byte (i.e., charT() )

width(0) is then called for the input stream.

If no characters are extracted, sets failbit.

template<class _Traits >
basic_istream<char, _Traits>& std::operator>> ( basic_istream< char, _Traits > &  __in,
unsigned char *  __s 
) [inline]

Character string extractors.

Parameters:
__inAn input stream.
__sA pointer to a character array.
Returns:
__in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts up to n characters and stores them into the array starting at __s. n is defined as:

  • if width() is greater than zero, n is width() otherwise
    • n is the number of elements of the largest array of *
    • char_type that can store a terminating eos.
    • [27.6.1.2.3]/6

Characters are extracted and stored until one of the following happens:

  • n-1 characters are stored
  • EOF is reached
  • the next character is whitespace according to the current locale
  • the next character is a null byte (i.e., charT() )

width(0) is then called for the input stream.

If no characters are extracted, sets failbit.

Definition at line 772 of file istream.

template<class _Traits >
basic_istream<char, _Traits>& std::operator>> ( basic_istream< char, _Traits > &  __in,
signed char *  __s 
) [inline]

Character string extractors.

Parameters:
__inAn input stream.
__sA pointer to a character array.
Returns:
__in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts up to n characters and stores them into the array starting at __s. n is defined as:

  • if width() is greater than zero, n is width() otherwise
    • n is the number of elements of the largest array of *
    • char_type that can store a terminating eos.
    • [27.6.1.2.3]/6

Characters are extracted and stored until one of the following happens:

  • n-1 characters are stored
  • EOF is reached
  • the next character is whitespace according to the current locale
  • the next character is a null byte (i.e., charT() )

width(0) is then called for the input stream.

If no characters are extracted, sets failbit.

Definition at line 777 of file istream.

template<typename _CharT , typename _Traits , typename _Tp >
basic_istream<_CharT, _Traits>& std::operator>> ( basic_istream< _CharT, _Traits > &&  __is,
_Tp &  __x 
) [inline]

Generic extractor for rvalue stream.

Parameters:
__isAn input stream.
__xA reference to the extraction target.
Returns:
is

This is just a forwarding function to allow extraction from rvalue streams since they won't bind to the extractor functions that take an lvalue reference.

Definition at line 866 of file istream.

bitset<_Nb> std::operator>> ( size_t  __position) const

Self-explanatory.

Definition at line 1345 of file bitset.

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

Global I/O operators for bitsets.

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

Definition at line 1455 of file bitset.

References std::basic_string< _CharT, _Traits, _Alloc >::empty(), std::basic_string< _CharT, _Traits, _Alloc >::push_back(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_string< _CharT, _Traits, _Alloc >::reserve(), std::basic_ios< _CharT, _Traits >::setstate(), and std::basic_ios< _CharT, _Traits >::widen().

template<typename _CharT , typename _Traits , typename _Alloc , template< typename, typename, typename > class _Base>
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.

Parameters:
__isInput stream.
__strBuffer to store into.
Returns:
Reference to the input stream.

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.

Definition at line 552 of file vstring.tcc.

References std::ios_base::getloc(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), and std::ios_base::width().

template<typename _CharT , typename _Traits , typename _Alloc >
basic_istream< _CharT, _Traits > & std::operator>> ( basic_istream< _CharT, _Traits > &  __is,
basic_string< _CharT, _Traits, _Alloc > &  __str 
)

Read stream into a string.

Parameters:
__isInput stream.
__strBuffer to store into.
Returns:
Reference to the input stream.

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.

Definition at line 998 of file basic_string.tcc.

References std::basic_string< _CharT, _Traits, _Alloc >::append(), std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::ios_base::getloc(), std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), and std::ios_base::width().

bitset<_Nb>& std::operator>>= ( size_t  __position)

Operations on bitsets.

Parameters:
__positionThe number of places to shift.

These should be self-explanatory.

Definition at line 995 of file bitset.

constexpr bool std::operator[] ( size_t  __position)

Array-indexing support.

Parameters:
__positionIndex into the bitset.
Returns:
A bool for a const bitset. For non-const bitsets, an instance of the reference proxy class.
Note:
These operators do no range checking and throw no exceptions, as required by DR 11 to the standard.

_GLIBCXX_RESOLVE_LIB_DEFECTS Note that this implementation already resolves DR 11 (items 1 and 2), but does not do the range-checking required by that DR's resolution. -pme The DR has since been changed: range-checking is a precondition (users' responsibility), and these functions must not throw. -pme

Definition at line 1147 of file bitset.

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

Global bitwise operations on bitsets.

Parameters:
__xA bitset.
__yA bitset of the same size as __x.
Returns:
A new bitset.

These should be self-explanatory.

Definition at line 1436 of file bitset.

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

Global bitwise operations on bitsets.

Parameters:
__xA bitset.
__yA bitset of the same size as __x.
Returns:
A new bitset.

These should be self-explanatory.

Definition at line 1427 of file bitset.

bitset<_Nb> std::operator~ ( ) const

See the no-argument flip().

Definition at line 1128 of file bitset.

template<typename _InputIterator , typename _OutputIterator >
_OutputIterator std::partial_sum ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result 
)

Return list of partial sums.

Accumulates the values in the range [first,last) using the + 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.

Parameters:
__firstStart of input range.
__lastEnd of input range.
__resultOutput sum.
Returns:
Iterator pointing just beyond the values written to __result.

Definition at line 238 of file stl_numeric.h.

Referenced by __gnu_parallel::__parallel_random_shuffle_drs_pu(), and __gnu_parallel::__sequential_random_shuffle().

template<typename _InputIterator , typename _OutputIterator , typename _BinaryOperation >
_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 __binary_op. 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.

Parameters:
__firstStart of input range.
__lastEnd of input range.
__resultOutput sum.
__binary_opFunction object.
Returns:
Iterator pointing just beyond the values written to __result.

Definition at line 279 of file stl_numeric.h.

template<typename _MoneyT >
_Put_money<_MoneyT> std::put_money ( const _MoneyT &  __mon,
bool  __intl = false 
) [inline]

Extended manipulator for inserting money.

Parameters:
__monEither long double or a specialization of basic_string.
__intlA bool indicating whether international format is to be used.

Sent to a stream object, this manipulator inserts __mon.

Definition at line 305 of file iomanip.

template<typename _Tp >
reference_wrapper<_Tp> std::ref ( _Tp &  __t) [inline]

Denotes a reference should be taken to a variable.

Definition at line 476 of file functional.

Referenced by ref().

template<typename _Tp >
void std::ref ( const _Tp &&  )

Denotes a reference should be taken to a variable.

template<typename _Tp >
reference_wrapper<_Tp> std::ref ( reference_wrapper< _Tp >  __t) [inline]

Partial specialization.

Definition at line 494 of file functional.

References ref().

template<typename _InputIterator , typename _OutputIterator , typename _Tp >
_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.

Parameters:
__firstAn input iterator.
__lastAn input iterator.
__resultAn output iterator.
__old_valueThe value to be replaced.
__new_valueThe replacement value.
Returns:
The end of the output sequence, 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 3866 of file stl_algo.h.

bitset<_Nb>& std::reset ( )

Sets every bit to false.

Definition at line 1081 of file bitset.

bitset<_Nb>& std::reset ( size_t  __position)

Sets a given bit to false.

Parameters:
__positionThe index of the bit.
Exceptions:
std::out_of_rangeIf pos is bigger the size of the set.

Same as writing set(pos,false).

Definition at line 1095 of file bitset.

References _Unchecked_reset().

_Resetiosflags std::resetiosflags ( ios_base::fmtflags  __mask) [inline]

Manipulator for setf.

Parameters:
__maskA format flags mask.

Sent to a stream object, this manipulator resets the specified flags, via stream.setf(0,__mask).

Definition at line 65 of file iomanip.

template<typename _Tp >
void std::return_temporary_buffer ( _Tp *  __p) [inline]

The companion to get_temporary_buffer().

Parameters:
__pA buffer previously allocated by get_temporary_buffer.
Returns:
None.

Frees the memory pointed to by __p.

Definition at line 114 of file stl_tempbuf.h.

Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer().

ios_base& std::right ( ios_base &  __base) [inline]

Calls base.setf(ios_base::right, ios_base::adjustfield).

Definition at line 926 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::adjustfield, std::ios_base::right, and std::ios_base::setf().

ios_base& std::scientific ( ios_base &  __base) [inline]

Calls base.setf(ios_base::scientific, ios_base::floatfield).

Definition at line 968 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::floatfield, std::ios_base::scientific, and std::ios_base::setf().

Referenced by operator<<().

bitset<_Nb>& std::set ( )

Sets every bit to true.

Definition at line 1056 of file bitset.

bitset<_Nb>& std::set ( size_t  __position,
bool  __val = true 
)

Sets a given bit to a particular value.

Parameters:
__positionThe index of the bit.
__valEither true or false, defaults to true.
Exceptions:
std::out_of_rangeIf pos is bigger the size of the set.

Definition at line 1070 of file bitset.

References _Unchecked_set().

new_handler std::set_new_handler ( new_handler  ) throw ()

Takes a replacement handler as the argument, returns the previous handler.

_Setbase std::setbase ( int  __base) [inline]

Manipulator for setf.

Parameters:
__baseA numeric base.

Sent to a stream object, this manipulator changes the ios_base::basefield flags to oct, dec, or hex when base is 8, 10, or 16, accordingly, and to 0 if __base is any other value.

Definition at line 126 of file iomanip.

template<typename _CharT >
_Setfill<_CharT> std::setfill ( _CharT  __c) [inline]

Manipulator for fill.

Parameters:
__cThe new fill character.

Sent to a stream object, this manipulator calls fill(__c) for that object.

Definition at line 164 of file iomanip.

_Setiosflags std::setiosflags ( ios_base::fmtflags  __mask) [inline]

Manipulator for setf.

Parameters:
__maskA format flags mask.

Sent to a stream object, this manipulator sets the format flags to __mask.

Definition at line 95 of file iomanip.

_Setprecision std::setprecision ( int  __n) [inline]

Manipulator for precision.

Parameters:
__nThe new precision.

Sent to a stream object, this manipulator calls precision(__n) for that object.

Definition at line 194 of file iomanip.

_Setw std::setw ( int  __n) [inline]

Manipulator for width.

Parameters:
__nThe new width.

Sent to a stream object, this manipulator calls width(__n) for that object.

Definition at line 224 of file iomanip.

ios_base& std::showbase ( ios_base &  __base) [inline]

Calls base.setf(ios_base::showbase).

Definition at line 813 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::setf(), and std::ios_base::showbase.

ios_base& std::showpoint ( ios_base &  __base) [inline]

Calls base.setf(ios_base::showpoint).

Definition at line 829 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::setf(), and std::ios_base::showpoint.

ios_base& std::showpos ( ios_base &  __base) [inline]

Calls base.setf(ios_base::showpos).

Definition at line 845 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::setf(), and std::ios_base::showpos.

constexpr size_t std::size ( ) const

Returns the total number of bits.

Definition at line 1284 of file bitset.

Referenced by std::deque< _Tp, _Alloc >::_M_new_elements_at_back(), std::deque< _Tp, _Alloc >::_M_new_elements_at_front(), std::basic_string< _CharT, _Traits, _Alloc >::append(), std::basic_string< _CharT, _Traits, _Alloc >::assign(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::compare(), std::basic_string< _CharT, _Traits, _Alloc >::compare(), std::deque< _Tp, _Alloc >::erase(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find(), std::basic_string< _CharT, _Traits, _Alloc >::find(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_first_not_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_first_not_of(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_first_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_first_of(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_last_not_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_last_not_of(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_last_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_last_of(), std::vector< _Tp, _Alloc >::operator=(), std::deque< _Tp, _Alloc >::operator=(), std::vector< _Tp, _Alloc >::reserve(), std::basic_string< _CharT, _Traits, _Alloc >::reserve(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::resize(), std::basic_string< _CharT, _Traits, _Alloc >::resize(), std::list< _Tp, _Alloc >::resize(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::rfind(), and std::basic_string< _CharT, _Traits, _Alloc >::rfind().

ios_base& std::skipws ( ios_base &  __base) [inline]

Calls base.setf(ios_base::skipws).

Definition at line 861 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::setf(), and std::ios_base::skipws.

Referenced by operator>>().

template<typename _Tp , typename _Tp1 , _Lock_policy _Lp>
__shared_ptr<_Tp, _Lp> std::static_pointer_cast ( const __shared_ptr< _Tp1, _Lp > &  __r) [inline]

static_pointer_cast

Definition at line 1193 of file shared_ptr_base.h.

template<class _T1 , class _T2 >
void std::swap ( pair< _T1, _T2 > &  __x,
pair< _T1, _T2 > &  __y 
) [inline]

See std::pair::swap().

Definition at line 252 of file stl_pair.h.

template<typename _Key , typename _Compare , typename _Alloc >
void std::swap ( multiset< _Key, _Compare, _Alloc > &  __x,
multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]
template<typename _Key , typename _Compare , typename _Alloc >
void std::swap ( set< _Key, _Compare, _Alloc > &  __x,
set< _Key, _Compare, _Alloc > &  __y 
) [inline]

See std::set::swap().

Definition at line 756 of file stl_set.h.

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

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

See std::map::swap().

Definition at line 941 of file stl_map.h.

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

template<typename _Tp , typename _Alloc >
void std::swap ( forward_list< _Tp, _Alloc > &  __lx,
forward_list< _Tp, _Alloc > &  __ly 
) [inline]
template<typename _Tp , typename _Alloc >
void std::swap ( vector< _Tp, _Alloc > &  __x,
vector< _Tp, _Alloc > &  __y 
) [inline]

See std::vector::swap().

Definition at line 1403 of file stl_vector.h.

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

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

See std::list::swap().

Definition at line 1690 of file stl_list.h.

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

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

See std::deque::swap().

Definition at line 1983 of file stl_deque.h.

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

template<typename _Res , typename... _Args>
void std::swap ( function< _Res(_Args...)> &  __x,
function< _Res(_Args...)> &  __y 
) [inline]

Swap the targets of two polymorphic function object wrappers.

This function will not throw an exception.

Definition at line 2413 of file functional.

template<typename _CharT , typename _Traits , typename _Alloc >
void std::swap ( basic_string< _CharT, _Traits, _Alloc > &  __lhs,
basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Swap contents of two strings.

Parameters:
__lhsFirst string.
__rhsSecond string.

Exchanges the contents of __lhs and __rhs in constant time.

Definition at line 2714 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::swap().

bool std::test ( size_t  __position) const

Tests the value of a bit.

Parameters:
__positionThe index of a bit.
Returns:
The value at pos.
Exceptions:
std::out_of_rangeIf pos is bigger the size of the set.

Definition at line 1305 of file bitset.

References _Unchecked_test().

template<class _CharT , class _Traits , class _Alloc >
std::basic_string< char, std::char_traits< char >, std::allocator< char > > std::to_string ( ) const

Returns a character interpretation of the bitset.

Returns:
The string equivalent of the bits.

Note the ordering of the bits: decreasing character positions correspond to increasing bit positions (see the main class notes for an example).

Definition at line 1181 of file bitset.

unsigned long std::to_ulong ( ) const

Returns a numerical interpretation of the bitset.

Returns:
The integral equivalent of the bits.
Exceptions:
std::overflow_errorIf there are too many bits to be represented in an unsigned long.

Definition at line 1162 of file bitset.

template<typename _CharT >
_CharT std::tolower ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.tolower(__c).

Definition at line 2601 of file locale_facets.h.

Referenced by std::regex_traits< _Ch_type >::translate_nocase().

template<typename _CharT >
_CharT std::toupper ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.toupper(__c).

Definition at line 2595 of file locale_facets.h.

template<typename _InputIterator , typename _ForwardIterator >
_ForwardIterator std::uninitialized_copy ( _InputIterator  __first,
_InputIterator  __last,
_ForwardIterator  __result 
) [inline]

Copies the range [first,last) into result.

Parameters:
__firstAn input iterator.
__lastAn input iterator.
__resultAn output iterator.
Returns:
__result + (__first - __last)

Like copy(), but does not require an initialized output range.

Definition at line 109 of file stl_uninitialized.h.

Referenced by __gnu_parallel::parallel_sort_mwms_pu().

template<typename _InputIterator , typename _Size , typename _ForwardIterator >
_ForwardIterator std::uninitialized_copy_n ( _InputIterator  __first,
_Size  __n,
_ForwardIterator  __result 
) [inline]

Copies the range [first,first+n) into result.

Parameters:
__firstAn input iterator.
__nThe number of elements to copy.
__resultAn output iterator.
Returns:
__result + __n

Like copy_n(), but does not require an initialized output range.

Definition at line 649 of file stl_uninitialized.h.

References __iterator_category().

template<typename _ForwardIterator , typename _Tp >
void std::uninitialized_fill ( _ForwardIterator  __first,
_ForwardIterator  __last,
const _Tp &  __x 
) [inline]

Copies the value x into the range [first,last).

Parameters:
__firstAn input iterator.
__lastAn input iterator.
__xThe source value.
Returns:
Nothing.

Like fill(), but does not require an initialized output range.

Definition at line 166 of file stl_uninitialized.h.

template<typename _ForwardIterator , typename _Size , typename _Tp >
void std::uninitialized_fill_n ( _ForwardIterator  __first,
_Size  __n,
const _Tp &  __x 
) [inline]

Copies the value x into the range [first,first+n).

Parameters:
__firstAn input iterator.
__nThe number of copies to make.
__xThe source value.
Returns:
Nothing.

Like fill_n(), but does not require an initialized output range.

Definition at line 220 of file stl_uninitialized.h.

ios_base& std::unitbuf ( ios_base &  __base) [inline]

Calls base.setf(ios_base::unitbuf).

Definition at line 893 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::setf(), and std::ios_base::unitbuf.

ios_base& std::uppercase ( ios_base &  __base) [inline]

Calls base.setf(ios_base::uppercase).

Definition at line 877 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::setf(), and std::ios_base::uppercase.

template<typename _Facet >
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.

Template Parameters:
_FacetThe facet type to access.
Parameters:
__locThe locale to use.
Returns:
Reference to facet of type Facet.
Exceptions:
std::bad_castif __loc doesn't contain a facet of type _Facet.

Definition at line 130 of file locale_classes.tcc.

Referenced by std::regex_traits< _Ch_type >::isctype(), std::regex_traits< _Ch_type >::transform(), and std::regex_traits< _Ch_type >::translate_nocase().

template<typename _CharT , typename _Traits >
basic_istream< _CharT, _Traits > & std::ws ( basic_istream< _CharT, _Traits > &  __is)

Quick and easy way to eat whitespace.

This manipulator extracts whitespace characters, stopping when the next character is non-whitespace, or when the input sequence is empty. If the sequence is empty, eofbit is set in the stream, but not failbit.

The current locale is used to distinguish whitespace characters.

Example:

     MyClass   mc;

     std::cin >> std::ws >> mc;

will skip leading whitespace before calling operator>> on cin and your object. Note that the same effect can be achieved by creating a std::basic_istream::sentry inside your definition of operator>>.

Definition at line 1018 of file istream.tcc.

References std::basic_ios< _CharT, _Traits >::eof(), std::ios_base::eofbit, std::ios_base::getloc(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().


Variable Documentation

enable_if< (is_pointer< _Functor >::value &&is_function< typename remove_pointer< _Functor >::type >::value), typename result_of< _Functor(_Args &&...)>::type >::type std::__invoke [inline]

Invoke a function object, which may be either a member pointer or a function object. The first parameter will tell which.

Definition at line 233 of file functional.

ios_base::Init std::__ioinit [static]

Linked to standard error (buffered)

Definition at line 75 of file iostream.

Linked to standard output.

Linked to standard input.

Linked to standard error (unbuffered)

Linked to standard input.

piecewise_construct

Definition at line 76 of file stl_pair.h.

Linked to standard output.

Linked to standard error (buffered)

Linked to standard error (unbuffered)

Linked to standard input.