libstdc++
|
unary_function
, as appropriate. More...binary_function
, as appropriate. More...mem_fn
for const member function pointers. More...mem_fn
for const volatile member function pointers. More...mem_fn
for volatile member function pointers. More...mem_fn
for member function pointers. More...dynamic_cast
expression, an instance of this class (or something derived from this class) is thrown. More...typeid
expression is used. More...shared_ptr
. More...FILE
streams. More...sb
. More...sb
. More...std::cout.foo(bar)
;) are consolidated in this class. More...sb
. More...sb
. More...sb
. More...std::basic_string
. (Paraphrased from [27.7.1]/1.) More...sb
. More...__w
. More...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.
ISO C++ entities toplevel namespace is std.
typedef void(* std::new_handler)() |
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.
anonymous enum |
Definition at line 2171 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.
Describes the rounding style for floating-point types.
This is used in the std::numeric_limits class.
void std::__final_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
This is a helper function for the sort routine.
Definition at line 2176 of file stl_algo.h.
References __insertion_sort(), and __unguarded_insertion_sort().
Referenced by sort().
void std::__final_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2191 of file stl_algo.h.
References __insertion_sort(), and __unguarded_insertion_sort().
_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().
_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.
_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().
_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.
_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().
_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.
_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 1491 of file stl_algo.h.
void std::__heap_select | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __middle, | ||
_RandomAccessIterator | __last | ||
) |
This is a helper function for the sort routines.
Definition at line 1899 of file stl_algo.h.
References make_heap().
Referenced by partial_sort().
void std::__heap_select | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __middle, | ||
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routines.
Definition at line 1912 of file stl_algo.h.
References make_heap().
_ForwardIterator std::__inplace_stable_partition | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Predicate | __pred, | ||
_Distance | __len | ||
) |
This is a helper function...
Definition at line 1776 of file stl_algo.h.
References advance(), rotate(), and distance().
Referenced by stable_partition().
void std::__inplace_stable_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
This is a helper function for the stable sorting routines.
Definition at line 3454 of file stl_algo.h.
References __insertion_sort(), and __merge_without_buffer().
Referenced by __inplace_stable_sort(), and stable_sort().
void std::__inplace_stable_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the stable sorting routines.
Definition at line 3473 of file stl_algo.h.
References __insertion_sort(), __inplace_stable_sort(), and __merge_without_buffer().
void std::__insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
This is a helper function for the sort routine.
Definition at line 2099 of file stl_algo.h.
References __unguarded_linear_insert().
Referenced by __final_insertion_sort(), and __inplace_stable_sort().
void std::__insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2122 of file stl_algo.h.
References __unguarded_linear_insert().
void std::__introsort_loop | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Size | __depth_limit | ||
) |
This is a helper function for the sort routine.
Definition at line 2271 of file stl_algo.h.
References __unguarded_partition_pivot().
Referenced by __introsort_loop(), and sort().
void std::__introsort_loop | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Size | __depth_limit, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2293 of file stl_algo.h.
References __unguarded_partition_pivot(), and __introsort_loop().
_Size std::__lg | ( | _Size | __n | ) | [inline] |
This is a helper function for the sort routines and for random.tcc.
Definition at line 972 of file stl_algobase.h.
Referenced by std::linear_congruential_engine::seed(), nth_element(), and sort().
void std::__merge_adaptive | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_Pointer | __buffer, | ||
_Distance | __buffer_size | ||
) |
This is a helper function for the merge routines.
Definition at line 2902 of file stl_algo.h.
References __move_merge_adaptive(), __move_merge_adaptive_backward(), advance(), lower_bound(), distance(), upper_bound(), and __rotate_adaptive().
Referenced by __merge_adaptive(), and inplace_merge().
void std::__merge_adaptive | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_Pointer | __buffer, | ||
_Distance | __buffer_size, | ||
_Compare | __comp | ||
) |
This is a helper function for the merge routines.
Definition at line 2958 of file stl_algo.h.
References __move_merge_adaptive(), __move_merge_adaptive_backward(), advance(), lower_bound(), distance(), upper_bound(), __rotate_adaptive(), and __merge_adaptive().
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 3015 of file stl_algo.h.
References iter_swap(), advance(), lower_bound(), distance(), upper_bound(), and rotate().
Referenced by __merge_without_buffer(), inplace_merge(), and __inplace_stable_sort().
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 3059 of file stl_algo.h.
References iter_swap(), advance(), lower_bound(), distance(), upper_bound(), rotate(), and __merge_without_buffer().
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().
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().
_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 3217 of file stl_algo.h.
_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 3244 of file stl_algo.h.
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 2723 of file stl_algo.h.
Referenced by __merge_adaptive().
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 2749 of file stl_algo.h.
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 2775 of file stl_algo.h.
Referenced by __merge_adaptive().
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 2817 of file stl_algo.h.
_ForwardIterator std::__partition | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Predicate | __pred, | ||
forward_iterator_tag | |||
) |
This is a helper function...
Definition at line 1721 of file stl_algo.h.
References iter_swap().
Referenced by partition().
_BidirectionalIterator std::__partition | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last, | ||
_Predicate | __pred, | ||
bidirectional_iterator_tag | |||
) |
void std::__reverse | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last, | ||
bidirectional_iterator_tag | |||
) |
This is an uglified reverse(_BidirectionalIterator, _BidirectionalIterator) overloaded for bidirectional iterators.
Definition at line 1391 of file stl_algo.h.
References iter_swap().
Referenced by reverse(), and __rotate().
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 1411 of file stl_algo.h.
References iter_swap().
void std::__rotate | ( | _ForwardIterator | __first, |
_ForwardIterator | __middle, | ||
_ForwardIterator | __last, | ||
forward_iterator_tag | |||
) |
This is a helper function for the rotate algorithm.
Definition at line 1505 of file stl_algo.h.
References iter_swap().
Referenced by __gnu_cxx::bitmap_allocator::_M_deallocate_single_object(), and rotate().
void std::__rotate | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
bidirectional_iterator_tag | |||
) |
This is a helper function for the rotate algorithm.
Definition at line 1541 of file stl_algo.h.
References __reverse(), and iter_swap().
void std::__rotate | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __middle, | ||
_RandomAccessIterator | __last, | ||
random_access_iterator_tag | |||
) |
This is a helper function for the rotate algorithm.
Definition at line 1571 of file stl_algo.h.
References swap_ranges(), and iter_swap().
_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 2860 of file stl_algo.h.
References rotate(), advance(), and distance().
Referenced by __merge_adaptive().
_ForwardIterator std::__search_n | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
std::forward_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) overloaded for forward iterators.
Definition at line 328 of file stl_algo.h.
Referenced by search_n().
_RandomAccessIter std::__search_n | ( | _RandomAccessIter | __first, |
_RandomAccessIter | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
std::random_access_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) overloaded for random access iterators.
Definition at line 360 of file stl_algo.h.
_ForwardIterator std::__search_n | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
_BinaryPredicate | __binary_pred, | ||
std::forward_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, _BinaryPredicate) overloaded for forward iterators.
Definition at line 414 of file stl_algo.h.
_RandomAccessIter std::__search_n | ( | _RandomAccessIter | __first, |
_RandomAccessIter | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
_BinaryPredicate | __binary_pred, | ||
std::random_access_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, _BinaryPredicate) overloaded for random access iterators.
Definition at line 453 of file stl_algo.h.
_ForwardIterator std::__stable_partition_adaptive | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Predicate | __pred, | ||
_Distance | __len, | ||
_Pointer | __buffer, | ||
_Distance | __buffer_size | ||
) |
This is a helper function...
Definition at line 1801 of file stl_algo.h.
References advance(), rotate(), and distance().
Referenced by stable_partition().
void std::__unguarded_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) | [inline] |
This is a helper function for the sort routine.
Definition at line 2144 of file stl_algo.h.
References __unguarded_linear_insert().
Referenced by __final_insertion_sort().
void std::__unguarded_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) | [inline] |
This is a helper function for the sort routine.
Definition at line 2157 of file stl_algo.h.
References __unguarded_linear_insert().
void std::__unguarded_linear_insert | ( | _RandomAccessIterator | __last | ) |
This is a helper function for the sort routine.
Definition at line 2062 of file stl_algo.h.
Referenced by __insertion_sort(), and __unguarded_insertion_sort().
void std::__unguarded_linear_insert | ( | _RandomAccessIterator | __last, |
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2080 of file stl_algo.h.
_RandomAccessIterator std::__unguarded_partition | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
const _Tp & | __pivot | ||
) |
This is a helper function...
Definition at line 2207 of file stl_algo.h.
References iter_swap().
Referenced by __unguarded_partition_pivot().
_RandomAccessIterator std::__unguarded_partition | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
const _Tp & | __pivot, | ||
_Compare | __comp | ||
) |
_RandomAccessIterator std::__unguarded_partition_pivot | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) | [inline] |
This is a helper function...
Definition at line 2248 of file stl_algo.h.
References __move_median_first(), and __unguarded_partition().
Referenced by __introsort_loop().
_RandomAccessIterator std::__unguarded_partition_pivot | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) | [inline] |
This is a helper function...
Definition at line 2260 of file stl_algo.h.
References __move_median_first(), and __unguarded_partition().
_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 1243 of file stl_algo.h.
Referenced by unique_copy().
_OutputIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
input_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for input iterators and output iterator as result.
Definition at line 1266 of file stl_algo.h.
_ForwardIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_ForwardIterator | __result, | ||
input_iterator_tag | , | ||
forward_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for input iterators and forward iterator as result.
Definition at line 1289 of file stl_algo.h.
_OutputIterator std::__unique_copy | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryPredicate | __binary_pred, | ||
forward_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for forward iterators and output iterator as result.
Definition at line 1310 of file stl_algo.h.
_OutputIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryPredicate | __binary_pred, | ||
input_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for input iterators and output iterator as result.
Definition at line 1339 of file stl_algo.h.
_ForwardIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_ForwardIterator | __result, | ||
_BinaryPredicate | __binary_pred, | ||
input_iterator_tag | , | ||
forward_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for input iterators and forward iterator as result.
Definition at line 1368 of file stl_algo.h.
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 75 of file stl_construct.h.
void std::_Destroy | ( | _Tp * | __pointer | ) | [inline] |
Destroy the object pointed to by a pointer type.
Definition at line 93 of file stl_construct.h.
Referenced by std::deque::_M_fill_initialize(), std::deque::_M_range_initialize(), std::vector< _State >::~vector(), and std::vector::reserve().
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 123 of file stl_construct.h.
_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.
first | Start of range. |
last | End of range. |
init | Starting value to add other values to. |
Definition at line 121 of file stl_numeric.h.
_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.
first | Start of range. |
last | End of range. |
init | Starting value to add other values to. |
binary_op | Function object to accumulate with. |
Definition at line 147 of file stl_numeric.h.
std::complex< _Tp > std::acos | ( | const std::complex< _Tp > & | __z | ) | [inline] |
std::complex< _Tp > std::acosh | ( | const std::complex< _Tp > & | __z | ) | [inline] |
_Tp* std::addressof | ( | _Tp & | __r | ) | [inline] |
_OutputIterator std::adjacent_difference | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result | ||
) |
Return differences between adjacent values.
Computes the difference between adjacent values in the range [first,last) using operator-() and writes the result to result.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
_GLIBCXX_RESOLVE_LIB_DEFECTS DR 539. partial_sum and adjacent_difference should mention requirements
Definition at line 317 of file stl_numeric.h.
_OutputIterator std::adjacent_difference | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryOperation | __binary_op | ||
) |
Return differences between adjacent values.
Computes the difference between adjacent values in the range [first,last) using the function object binary_op and writes the result to result.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
_GLIBCXX_RESOLVE_LIB_DEFECTS DR 539. partial_sum and adjacent_difference should mention requirements
Definition at line 359 of file stl_numeric.h.
void std::advance | ( | _InputIterator & | __i, |
_Distance | __n | ||
) | [inline] |
A generalization of pointer arithmetic.
i | An input iterator. |
n | The delta by which to change i . |
This increments i
by n
. For bidirectional and random access iterators, n
may be negative, in which case i
is decremented.
For random access iterators, this uses their +
and -
operations and are constant time. For other iterator classes they are linear time.
Definition at line 171 of file stl_iterator_base_funcs.h.
References __iterator_category().
Referenced by std::deque::_M_range_initialize(), partition_point(), __inplace_stable_partition(), __stable_partition_adaptive(), lower_bound(), upper_bound(), equal_range(), __rotate_adaptive(), __merge_adaptive(), __merge_without_buffer(), and is_permutation().
bool std::all | ( | ) | const |
bool std::any | ( | ) | const |
__gnu_cxx::__promote<_Tp>::__type std::arg | ( | _Tp | __x | ) | [inline] |
std::complex< _Tp > std::asin | ( | const std::complex< _Tp > & | __z | ) | [inline] |
std::complex< _Tp > std::asinh | ( | const std::complex< _Tp > & | __z | ) | [inline] |
std::complex< _Tp > std::atan | ( | const std::complex< _Tp > & | __z | ) | [inline] |
std::complex< _Tp > std::atanh | ( | const std::complex< _Tp > & | __z | ) | [inline] |
auto std::begin | ( | _Container & | __cont | ) | [inline] |
Return an iterator pointing to the first element of the container.
cont | Container. |
Definition at line 48 of file range_access.h.
auto std::begin | ( | const _Container & | __cont | ) | [inline] |
Return an iterator pointing to the first element of the const container.
cont | Container. |
Definition at line 58 of file range_access.h.
constexpr const _Tp* std::begin | ( | initializer_list< _Tp > | __ils | ) |
Return an iterator pointing to the first element of the initilizer_list.
il | Initializer list. |
Definition at line 86 of file initializer_list.
Referenced by std::deque::erase(), std::forward_list::operator=(), std::forward_list::unique(), std::list::resize(), std::list::operator=(), std::list::remove(), std::list::unique(), std::list::merge(), std::list::sort(), std::list::remove_if(), std::deque::~deque(), std::deque::front(), std::deque::clear(), std::list::rend(), std::list::crend(), std::list::size(), std::list::front(), std::list::push_front(), std::list::pop_front(), std::vector::insert(), and std::vector::emplace().
_Tp* std::begin | ( | _Tp(&) | __arr[_Nm] | ) | [inline] |
Return an iterator pointing to the first element of the array.
arr | Array. |
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 std::ios_base::boolalpha, and __gnu_debug::__base().
Referenced by std::num_get::do_get().
__shared_ptr<_Tp, _Lp> std::const_pointer_cast | ( | const __shared_ptr< _Tp1, _Lp > & | __r | ) | [inline] |
const_pointer_cast
Definition at line 1130 of file shared_ptr_base.h.
size_t std::count | ( | ) | const |
Returns the number of bits which are set.
Definition at line 1270 of file bitset.
Referenced by is_permutation().
reference_wrapper<const _Tp> std::cref | ( | const _Tp & | __t | ) | [inline] |
Denotes a const reference should be taken to a variable.
Definition at line 476 of file functional.
Referenced by cref().
void std::cref | ( | const _Tp && | ) |
Denotes a reference should be taken to a variable.
reference_wrapper<const _Tp> std::cref | ( | reference_wrapper< _Tp > | __t | ) | [inline] |
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 std::ios_base::dec, std::ios_base::basefield, and __gnu_debug::__base().
Referenced by operator>>().
iterator_traits<_InputIterator>::difference_type std::distance | ( | _InputIterator | __first, |
_InputIterator | __last | ||
) | [inline] |
A generalization of pointer arithmetic.
first | An input iterator. |
last | An input iterator. |
Returns n
such that first + n == last. This requires that last
must be reachable from first
. Note that n
may be negative.
For random access iterators, this uses their +
and -
operations and are constant time. For other iterator classes they are linear time.
Definition at line 113 of file stl_iterator_base_funcs.h.
References __iterator_category().
Referenced by std::deque::_M_range_initialize(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), std::sub_match< _Bi_iter >::length(), std::match_results< _FwdIterT, _Alloc >::position(), partition_point(), __inplace_stable_partition(), __stable_partition_adaptive(), lower_bound(), upper_bound(), equal_range(), __rotate_adaptive(), __merge_adaptive(), __merge_without_buffer(), inplace_merge(), is_permutation(), is_heap_until(), and std::list::size().
__shared_ptr<_Tp, _Lp> std::dynamic_pointer_cast | ( | const __shared_ptr< _Tp1, _Lp > & | __r | ) | [inline] |
dynamic_pointer_cast
Definition at line 1140 of file shared_ptr_base.h.
auto std::end | ( | _Container & | __cont | ) | [inline] |
Return an iterator pointing to one past the last element of the container.
cont | Container. |
Definition at line 68 of file range_access.h.
auto std::end | ( | const _Container & | __cont | ) | [inline] |
Return an iterator pointing to one past the last element of the const container.
cont | Container. |
Definition at line 78 of file range_access.h.
constexpr const _Tp* std::end | ( | initializer_list< _Tp > | __ils | ) |
Return an iterator pointing to one past the last element of the initilizer_list.
il | Initializer list. |
Definition at line 96 of file initializer_list.
Referenced by std::deque::erase(), std::forward_list::operator=(), std::forward_list::resize(), std::forward_list::unique(), std::basic_filebuf::open(), std::list::resize(), std::list::operator=(), std::list::remove(), std::list::unique(), std::list::merge(), std::list::remove_if(), std::basic_stringbuf::seekoff(), std::deque::~deque(), std::deque::back(), std::list::rbegin(), std::list::crbegin(), std::list::size(), std::list::back(), std::list::push_back(), std::vector::insert(), std::vector::erase(), and std::vector::emplace().
_Tp* std::end | ( | _Tp(&) | __arr[_Nm] | ) | [inline] |
Return an iterator pointing to one past the last element of the array.
arr | Array. |
Definition at line 97 of file range_access.h.
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 543 of file ostream.
References flush(), and std::basic_ostream::put().
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 554 of file ostream.
References std::basic_ostream::put().
_Tp std::fabs | ( | const std::complex< _Tp > & | __z | ) | [inline] |
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 std::ios_base::fixed, std::ios_base::floatfield, and __gnu_debug::__base().
bitset<_Nb>& std::flip | ( | ) |
bitset<_Nb>& std::flip | ( | size_t | __position | ) |
Toggles a given bit to its opposite value.
position | The index of the bit. |
std::out_of_range | If pos is bigger the size of the set. |
Definition at line 1110 of file bitset.
References _Unchecked_flip().
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 564 of file ostream.
References std::basic_ostream::flush().
Referenced by endl().
_Tp&& std::forward | ( | typename std::remove_reference< _Tp >::type & | __t | ) | [inline] |
_Get_money<_MoneyT> std::get_money | ( | _MoneyT & | __mon, |
bool | __intl = false |
||
) | [inline] |
Extended manipulator for extracting money.
mon | Either long double or a specialization of basic_string . |
intl | A bool indicating whether international format is to be used. |
Sent to a stream object, this manipulator extracts mon.
pair<_Tp*, ptrdiff_t> std::get_temporary_buffer | ( | ptrdiff_t | __len | ) |
Allocates a temporary buffer.
len | The number of objects of type Tp. |
Reinventing the wheel, but this time with prettier spokes!
This function tries to obtain storage for len
adjacent Tp objects. The objects themselves are not constructed, of course. A pair<> is returned containing the buffer s address and capacity (in the units of sizeof(Tp)), or a pair of 0 values if no storage can be obtained. Note that the capacity obtained may be less than that requested if the memory is unavailable; you should compare len with the .second return value.
Provides the nothrow exception guarantee.
Definition at line 86 of file stl_tempbuf.h.
Referenced by std::_Temporary_buffer::_Temporary_buffer().
basic_istream< _CharT, _Traits > & std::getline | ( | basic_istream< _CharT, _Traits > & | __is, |
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > & | __str, | ||
_CharT | __delim | ||
) |
Read a line from stream into a string.
__is | Input stream. |
__str | Buffer to store into. |
__delim | Character marking end of line. |
Stores characters from __is into __str until __delim is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into __str. Any previous contents of __str are erased. If delim was encountered, it is extracted but not stored into __str.
Definition at line 627 of file vstring.tcc.
References __gnu_cxx::__versa_string::max_size(), __gnu_cxx::__versa_string::erase(), and __gnu_cxx::__versa_string::append().
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.
__is | Input stream. |
__str | Buffer to store into. |
Stores characters from is into __str until '
' is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into __str. Any previous contents of __str are erased. If end of line was encountered, it is extracted but not stored into __str.
Definition at line 2509 of file vstring.h.
References getline().
basic_istream< _CharT, _Traits > & std::getline | ( | basic_istream< _CharT, _Traits > & | __is, |
basic_string< _CharT, _Traits, _Alloc > & | __str, | ||
_CharT | __delim | ||
) |
Read a line from stream into a string.
is | Input stream. |
str | Buffer to store into. |
delim | Character marking end of line. |
Stores characters from is into str until delim is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If delim was encountered, it is extracted but not stored into str.
Definition at line 1070 of file basic_string.tcc.
References std::basic_string::max_size(), and std::basic_string::erase().
Referenced by getline().
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.
is | Input stream. |
str | Buffer to store into. |
Stores characters from is into str until '
' is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If end of line was encountered, it is extracted but not stored into str.
Definition at line 2734 of file basic_string.h.
References getline().
bool std::has_facet | ( | const locale & | __loc | ) | throw () |
Test for the presence of a facet.
has_facet tests the locale argument for the presence of the facet type provided as the template parameter. Facets derived from the facet parameter will also return true.
Facet | The facet type to test the presence of. |
locale | The locale to test. |
Definition at line 93 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 std::ios_base::hex, std::ios_base::basefield, and __gnu_debug::__base().
Referenced by std::regex_traits::value().
_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.
first1 | Start of range 1. |
last1 | End of range 1. |
first2 | Start of range 2. |
init | Starting value to add other values to. |
Definition at line 175 of file stl_numeric.h.
_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.
first1 | Start of range 1. |
last1 | End of range 1. |
first2 | Start of range 2. |
init | Starting value to add other values to. |
binary_op1 | Function object to accumulate with. |
binary_op2 | Function object to apply to pairs of input values. |
Definition at line 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::internal, and std::ios_base::adjustfield.
void std::iota | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Tp | __value | ||
) |
Create a range of sequentially increasing values.
For each element in the range [first,last) assigns
value
and increments value
as if by ++value
.
first | Start of range. |
last | End of range. |
value | Starting value. |
Definition at line 83 of file stl_numeric.h.
bool std::isalnum | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::alnum, __c).
Definition at line 2584 of file locale_facets.h.
bool std::isalpha | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::alpha, __c).
Definition at line 2560 of file locale_facets.h.
bool std::iscntrl | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::cntrl, __c).
Definition at line 2542 of file locale_facets.h.
bool std::isdigit | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::digit, __c).
Definition at line 2566 of file locale_facets.h.
bool std::isgraph | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::graph, __c).
Definition at line 2590 of file locale_facets.h.
bool std::islower | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::lower, __c).
Definition at line 2554 of file locale_facets.h.
bool std::isprint | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::print, __c).
Definition at line 2536 of file locale_facets.h.
bool std::ispunct | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::punct, __c).
Definition at line 2572 of file locale_facets.h.
bool std::isspace | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::space, __c).
Definition at line 2530 of file locale_facets.h.
bool std::isupper | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::upper, __c).
Definition at line 2548 of file locale_facets.h.
bool std::isxdigit | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::xdigit, __c).
Definition at line 2578 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 std::ios_base::left, std::ios_base::adjustfield, and __gnu_debug::__base().
Referenced by operator<<().
pair<typename __decay_and_strip<_T1>::__type, typename __decay_and_strip<_T2>::__type> std::make_pair | ( | _T1 && | __x, |
_T2 && | __y | ||
) | [inline] |
A convenience wrapper for creating a pair from two objects.
x | The first object. |
y | The second object. |
The standard requires that the objects be passed by reference-to-const, but LWG issue #181 says they should be passed by const value. We follow the LWG by default.
Definition at line 262 of file stl_pair.h.
Referenced by __gnu_parallel::__qsb_local_sort_with_helping(), __gnu_parallel::__parallel_sort_qsb(), __gnu_parallel::__find_template(), __gnu_parallel::__find_if_selector::_M_sequential_algorithm(), __gnu_parallel::__adjacent_find_selector::_M_sequential_algorithm(), __gnu_parallel::__find_first_of_selector::_M_sequential_algorithm(), __gnu_parallel::__parallel_merge_advance(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), __gnu_parallel::parallel_multiway_merge(), __gnu_parallel::parallel_sort_mwms_pu(), and minmax_element().
ios_base& std::noboolalpha | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::boolalpha).
Definition at line 805 of file ios_base.h.
References std::ios_base::boolalpha, and __gnu_debug::__base().
bool std::none | ( | ) | const |
ios_base& std::noshowbase | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::showbase).
Definition at line 821 of file ios_base.h.
References std::ios_base::showbase, and __gnu_debug::__base().
ios_base& std::noshowpoint | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::showpoint).
Definition at line 837 of file ios_base.h.
References std::ios_base::showpoint, and __gnu_debug::__base().
ios_base& std::noshowpos | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::showpos).
Definition at line 853 of file ios_base.h.
References std::ios_base::showpos, and __gnu_debug::__base().
ios_base& std::noskipws | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::skipws).
Definition at line 869 of file ios_base.h.
References std::ios_base::skipws, and __gnu_debug::__base().
ios_base& std::nounitbuf | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::unitbuf).
Definition at line 901 of file ios_base.h.
References std::ios_base::unitbuf, and __gnu_debug::__base().
ios_base& std::nouppercase | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::uppercase).
Definition at line 885 of file ios_base.h.
References std::ios_base::uppercase, and __gnu_debug::__base().
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 std::ios_base::oct, std::ios_base::basefield, and __gnu_debug::__base().
Referenced by std::regex_traits::value().
constexpr bool std::operator!= | ( | const pair< _T1, _T2 > & | __x, |
const pair< _T1, _T2 > & | __y | ||
) | [inline] |
Uses operator==
to find the result.
Definition at line 214 of file stl_pair.h.
bool std::operator!= | ( | const stack< _Tp, _Seq > & | __x, |
const stack< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 265 of file stl_stack.h.
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 265 of file forward_list.h.
bool std::operator!= | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 290 of file stl_queue.h.
bool std::operator!= | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Returns !(x == y).
Definition at line 703 of file stl_multiset.h.
bool std::operator!= | ( | const set< _Key, _Compare, _Alloc > & | __x, |
const set< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
bool std::operator!= | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 819 of file stl_multimap.h.
bool std::operator!= | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
bool std::operator!= | ( | const forward_list< _Tp, _Alloc > & | __lx, |
const forward_list< _Tp, _Alloc > & | __ly | ||
) | [inline] |
Based on operator==.
Definition at line 1268 of file forward_list.h.
bool std::operator!= | ( | const bitset< _Nb > & | __rhs | ) | const |
bool std::operator!= | ( | const vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 1297 of file stl_vector.h.
bool std::operator!= | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 1600 of file stl_list.h.
bool std::operator!= | ( | const deque< _Tp, _Alloc > & | __x, |
const deque< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 1943 of file stl_deque.h.
bool std::operator!= | ( | const function< _Res(_Args...)> & | __f, |
nullptr_t | |||
) | [inline] |
Compares a polymorphic function object wrapper against 0 (the NULL pointer).
false
if the wrapper has no target, true
otherwiseThis function will not throw an exception.
Definition at line 2245 of file functional.
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 2251 of file functional.
bool std::operator!= | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test difference of two strings.
lhs | First string. |
rhs | Second string. |
Definition at line 2473 of file basic_string.h.
bool std::operator!= | ( | const _CharT * | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test difference of C string and string.
lhs | C string. |
rhs | String. |
Definition at line 2485 of file basic_string.h.
bool std::operator!= | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const _CharT * | __rhs | ||
) | [inline] |
Test difference of string and C string.
lhs | String. |
rhs | C string. |
Definition at line 2497 of file basic_string.h.
bitset<_Nb> std::operator& | ( | const bitset< _Nb > & | __x, |
const bitset< _Nb > & | __y | ||
) | [inline] |
basic_string<_CharT, _Traits, _Alloc> std::operator+ | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) |
Concatenate two strings.
lhs | First string. |
rhs | Last string. |
Definition at line 2306 of file basic_string.h.
basic_string< _CharT, _Traits, _Alloc > std::operator+ | ( | const _CharT * | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) |
Concatenate C string and string.
lhs | First string. |
rhs | Last string. |
Definition at line 694 of file basic_string.tcc.
References std::basic_string::size().
basic_string< _CharT, _Traits, _Alloc > std::operator+ | ( | _CharT | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) |
Concatenate character and string.
lhs | First string. |
rhs | Last string. |
Definition at line 710 of file basic_string.tcc.
References std::basic_string::size().
basic_string<_CharT, _Traits, _Alloc> std::operator+ | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const _CharT * | __rhs | ||
) | [inline] |
Concatenate string and C string.
lhs | First string. |
rhs | Last string. |
Definition at line 2343 of file basic_string.h.
basic_string<_CharT, _Traits, _Alloc> std::operator+ | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
_CharT | __rhs | ||
) | [inline] |
Concatenate string and character.
lhs | First string. |
rhs | Last string. |
Definition at line 2359 of file basic_string.h.
constexpr bool std::operator< | ( | const pair< _T1, _T2 > & | __x, |
const pair< _T1, _T2 > & | __y | ||
) | [inline] |
<http://gcc.gnu.org/onlinedocs/libstdc++/manual/utilities.html>
Definition at line 207 of file stl_pair.h.
References std::pair::first.
bool std::operator< | ( | const stack< _Tp, _Seq > & | __x, |
const stack< _Tp, _Seq > & | __y | ||
) | [inline] |
Stack ordering relation.
x | A stack. |
y | A stack of the same type as x. |
This is an total ordering relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, the elements must be comparable with <
, and std::lexicographical_compare() is usually used to make the determination.
Definition at line 259 of file stl_stack.h.
bool std::operator< | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Queue ordering relation.
x | A queue. |
y | A queue of the same type as x. |
This is an total ordering relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, the elements must be comparable with <
, and std::lexicographical_compare() is usually used to make the determination.
Definition at line 284 of file stl_queue.h.
References std::queue::c.
bool std::operator< | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Multiset ordering relation.
x | A multiset. |
y | A multiset of the same type as x. |
This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 696 of file stl_multiset.h.
bool std::operator< | ( | const set< _Key, _Compare, _Alloc > & | __x, |
const set< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Set ordering relation.
x | A set. |
y | A set of the same type as x. |
This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
bool std::operator< | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Multimap ordering relation.
x | A multimap. |
y | A multimap of the same type as x. |
This is a total ordering relation. It is linear in the size of the multimaps. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 812 of file stl_multimap.h.
bool std::operator< | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Map ordering relation.
x | A map. |
y | A map of the same type as x. |
This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
bool std::operator< | ( | const forward_list< _Tp, _Alloc > & | __lx, |
const forward_list< _Tp, _Alloc > & | __ly | ||
) | [inline] |
Forward list ordering relation.
lx | A forward_list. |
ly | A forward_list of the same type as lx. |
This is a total ordering relation. It is linear in the size of the forward lists. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 1260 of file forward_list.h.
References lexicographical_compare().
bool std::operator< | ( | const vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Vector ordering relation.
x | A vector. |
y | A vector of the same type as x. |
This is a total ordering relation. It is linear in the size of the vectors. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 1290 of file stl_vector.h.
References lexicographical_compare().
bool std::operator< | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
List ordering relation.
x | A list. |
y | A list of the same type as x. |
This is a total ordering relation. It is linear in the size of the lists. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 1593 of file stl_list.h.
References lexicographical_compare().
bool std::operator< | ( | const deque< _Tp, _Alloc > & | __x, |
const deque< _Tp, _Alloc > & | __y | ||
) | [inline] |
Deque ordering relation.
x | A deque. |
y | A deque of the same type as x. |
This is a total ordering relation. It is linear in the size of the deques. The elements must be comparable with <
.
See std::lexicographical_compare() for how the determination is made.
Definition at line 1935 of file stl_deque.h.
References lexicographical_compare().
bool std::operator< | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test if string precedes string.
lhs | First string. |
rhs | Second string. |
Definition at line 2510 of file basic_string.h.
bool std::operator< | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const _CharT * | __rhs | ||
) | [inline] |
Test if string precedes C string.
lhs | String. |
rhs | C string. |
Definition at line 2522 of file basic_string.h.
bool std::operator< | ( | const _CharT * | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test if C string precedes string.
lhs | C string. |
rhs | String. |
Definition at line 2534 of file basic_string.h.
basic_ostream<_CharT, _Traits>& std::operator<< | ( | basic_ostream< _CharT, _Traits > & | __out, |
_CharT | __c | ||
) | [inline] |
Character inserters.
out | An output stream. |
c | A character. |
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.
basic_ostream<_CharT, _Traits>& std::operator<< | ( | basic_ostream< _CharT, _Traits > & | __out, |
char | __c | ||
) | [inline] |
Character inserters.
out | An output stream. |
c | A character. |
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.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, |
char | __c | ||
) | [inline] |
Character inserters.
out | An output stream. |
c | A character. |
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.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, |
signed char | __c | ||
) | [inline] |
Character inserters.
out | An output stream. |
c | A character. |
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.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, |
unsigned char | __c | ||
) | [inline] |
Character inserters.
out | An output stream. |
c | A character. |
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.
basic_ostream<_CharT, _Traits>& std::operator<< | ( | basic_ostream< _CharT, _Traits > & | __out, |
const _CharT * | __s | ||
) | [inline] |
String inserters.
out | An output stream. |
s | A character string. |
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 493 of file ostream.
References std::ios_base::badbit.
basic_ostream< _CharT, _Traits > & std::operator<< | ( | basic_ostream< _CharT, _Traits > & | __out, |
const char * | __s | ||
) |
String inserters.
out | An output stream. |
s | A character string. |
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.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, |
const char * | __s | ||
) | [inline] |
String inserters.
out | An output stream. |
s | A character string. |
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 510 of file ostream.
References std::ios_base::badbit.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, |
const signed char * | __s | ||
) | [inline] |
String inserters.
out | An output stream. |
s | A character string. |
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.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, |
const unsigned char * | __s | ||
) | [inline] |
String inserters.
out | An output stream. |
s | A character string. |
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.
basic_ostream<_CharT, _Traits>& std::operator<< | ( | basic_ostream< _CharT, _Traits > && | __os, |
const _Tp & | __x | ||
) | [inline] |
Generic inserter for rvalue stream.
os | An input stream. |
x | A reference to the object being inserted. |
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.
bitset<_Nb> std::operator<< | ( | size_t | __position | ) | const |
std::basic_ostream<_CharT, _Traits>& std::operator<< | ( | std::basic_ostream< _CharT, _Traits > & | __os, |
const bitset< _Nb > & | __x | ||
) |
basic_ostream<_CharT, _Traits>& std::operator<< | ( | basic_ostream< _CharT, _Traits > & | __os, |
const __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > & | __str | ||
) | [inline] |
basic_ostream<_CharT, _Traits>& std::operator<< | ( | basic_ostream< _CharT, _Traits > & | __os, |
const basic_string< _CharT, _Traits, _Alloc > & | __str | ||
) | [inline] |
Write string to a stream.
os | Output stream. |
str | String to write out. |
Output characters of str into os following the same rules as for writing a C string.
Definition at line 2693 of file basic_string.h.
bitset<_Nb>& std::operator<<= | ( | size_t | __position | ) |
constexpr bool std::operator<= | ( | const pair< _T1, _T2 > & | __x, |
const pair< _T1, _T2 > & | __y | ||
) | [inline] |
Uses operator<
to find the result.
Definition at line 226 of file stl_pair.h.
bool std::operator<= | ( | const stack< _Tp, _Seq > & | __x, |
const stack< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 277 of file stl_stack.h.
bool std::operator<= | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 302 of file stl_queue.h.
bool std::operator<= | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Returns !(y < x)
Definition at line 717 of file stl_multiset.h.
bool std::operator<= | ( | const set< _Key, _Compare, _Alloc > & | __x, |
const set< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
bool std::operator<= | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 833 of file stl_multimap.h.
bool std::operator<= | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
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.
bool std::operator<= | ( | const vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1309 of file stl_vector.h.
bool std::operator<= | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1612 of file stl_list.h.
bool std::operator<= | ( | const deque< _Tp, _Alloc > & | __x, |
const deque< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1957 of file stl_deque.h.
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.
lhs | First string. |
rhs | Second string. |
Definition at line 2584 of file basic_string.h.
bool std::operator<= | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const _CharT * | __rhs | ||
) | [inline] |
Test if string doesn't follow C string.
lhs | String. |
rhs | C string. |
Definition at line 2596 of file basic_string.h.
bool std::operator<= | ( | const _CharT * | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test if C string doesn't follow string.
lhs | C string. |
rhs | String. |
Definition at line 2608 of file basic_string.h.
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 201 of file stl_pair.h.
References std::pair::first, and std::pair::second.
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.
bool std::operator== | ( | const stack< _Tp, _Seq > & | __x, |
const stack< _Tp, _Seq > & | __y | ||
) | [inline] |
Stack equality comparison.
x | A stack. |
y | A stack of the same type as x. |
This is an equivalence relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, and stacks are considered equivalent if their sequences compare equal.
Definition at line 241 of file stl_stack.h.
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 256 of file forward_list.h.
bool std::operator== | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Queue equality comparison.
x | A queue. |
y | A queue of the same type as x. |
This is an equivalence relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, and queues are considered equivalent if their sequences compare equal.
Definition at line 266 of file stl_queue.h.
bool std::operator== | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Multiset equality comparison.
x | A multiset. |
y | A multiset of the same type as x. |
This is an equivalence relation. It is linear in the size of the multisets. Multisets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 679 of file stl_multiset.h.
bool std::operator== | ( | const set< _Key, _Compare, _Alloc > & | __x, |
const set< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Set equality comparison.
x | A set. |
y | A set of the same type as x. |
This is an equivalence relation. It is linear in the size of the sets. Sets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
bool std::operator== | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Multimap equality comparison.
x | A multimap. |
y | A multimap of the same type as x. |
This is an equivalence relation. It is linear in the size of the multimaps. Multimaps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 795 of file stl_multimap.h.
bool std::operator== | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Map equality comparison.
x | A map. |
y | A map of the same type as x. |
This is an equivalence relation. It is linear in the size of the maps. Maps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
bool std::operator== | ( | const forward_list< _Tp, _Alloc > & | __lx, |
const forward_list< _Tp, _Alloc > & | __ly | ||
) |
Forward list equality comparison.
lx | A forward_list |
ly | A forward_list of the same type as lx. |
This is an equivalence relation. It is linear in the size of the forward lists. Deques are considered equivalent if corresponding elements compare equal.
Definition at line 379 of file forward_list.tcc.
References std::forward_list::cbegin(), and std::forward_list::cend().
bool std::operator== | ( | const vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Vector equality comparison.
x | A vector. |
y | A vector of the same type as x. |
This is an equivalence relation. It is linear in the size of the vectors. Vectors are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 1273 of file stl_vector.h.
References equal().
bool std::operator== | ( | const bitset< _Nb > & | __rhs | ) | const |
bool std::operator== | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
List equality comparison.
x | A list. |
y | A list of the same type as x. |
This is an equivalence relation. It is linear in the size of the lists. Lists are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 1564 of file stl_list.h.
bool std::operator== | ( | const deque< _Tp, _Alloc > & | __x, |
const deque< _Tp, _Alloc > & | __y | ||
) | [inline] |
Deque equality comparison.
x | A deque. |
y | A deque of the same type as x. |
This is an equivalence relation. It is linear in the size of the deques. Deques are considered equivalent if their sizes are equal, and if corresponding elements compare equal.
Definition at line 1917 of file stl_deque.h.
References equal().
bool std::operator== | ( | const function< _Res(_Args...)> & | __f, |
nullptr_t | |||
) | [inline] |
Compares a polymorphic function object wrapper against 0 (the NULL pointer).
true
if the wrapper has no target, false
otherwiseThis function will not throw an exception.
Definition at line 2227 of file functional.
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 2233 of file functional.
bool std::operator== | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test equivalence of two strings.
lhs | First string. |
rhs | Second string. |
Definition at line 2427 of file basic_string.h.
bool std::operator== | ( | const _CharT * | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test equivalence of C string and string.
lhs | C string. |
rhs | String. |
Definition at line 2448 of file basic_string.h.
bool std::operator== | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const _CharT * | __rhs | ||
) | [inline] |
Test equivalence of string and C string.
lhs | String. |
rhs | C string. |
Definition at line 2460 of file basic_string.h.
constexpr bool std::operator> | ( | const pair< _T1, _T2 > & | __x, |
const pair< _T1, _T2 > & | __y | ||
) | [inline] |
Uses operator<
to find the result.
Definition at line 220 of file stl_pair.h.
bool std::operator> | ( | const stack< _Tp, _Seq > & | __x, |
const stack< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 271 of file stl_stack.h.
bool std::operator> | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 296 of file stl_queue.h.
bool std::operator> | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Returns y < x.
Definition at line 710 of file stl_multiset.h.
bool std::operator> | ( | const set< _Key, _Compare, _Alloc > & | __x, |
const set< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
bool std::operator> | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 826 of file stl_multimap.h.
bool std::operator> | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
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 vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1303 of file stl_vector.h.
bool std::operator> | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1606 of file stl_list.h.
bool std::operator> | ( | const deque< _Tp, _Alloc > & | __x, |
const deque< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1950 of file stl_deque.h.
bool std::operator> | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test if string follows string.
lhs | First string. |
rhs | Second string. |
Definition at line 2547 of file basic_string.h.
bool std::operator> | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const _CharT * | __rhs | ||
) | [inline] |
Test if string follows C string.
lhs | String. |
rhs | C string. |
Definition at line 2559 of file basic_string.h.
bool std::operator> | ( | const _CharT * | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test if C string follows string.
lhs | C string. |
rhs | String. |
Definition at line 2571 of file basic_string.h.
constexpr bool std::operator>= | ( | const pair< _T1, _T2 > & | __x, |
const pair< _T1, _T2 > & | __y | ||
) | [inline] |
Uses operator<
to find the result.
Definition at line 232 of file stl_pair.h.
bool std::operator>= | ( | const stack< _Tp, _Seq > & | __x, |
const stack< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 283 of file stl_stack.h.
bool std::operator>= | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 308 of file stl_queue.h.
bool std::operator>= | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Returns !(x < y)
Definition at line 724 of file stl_multiset.h.
bool std::operator>= | ( | const set< _Key, _Compare, _Alloc > & | __x, |
const set< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
bool std::operator>= | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 840 of file stl_multimap.h.
bool std::operator>= | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
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.
bool std::operator>= | ( | const vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1315 of file stl_vector.h.
bool std::operator>= | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1618 of file stl_list.h.
bool std::operator>= | ( | const deque< _Tp, _Alloc > & | __x, |
const deque< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1964 of file stl_deque.h.
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.
lhs | First string. |
rhs | Second string. |
Definition at line 2621 of file basic_string.h.
bool std::operator>= | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const _CharT * | __rhs | ||
) | [inline] |
Test if string doesn't precede C string.
lhs | String. |
rhs | C string. |
Definition at line 2633 of file basic_string.h.
bool std::operator>= | ( | const _CharT * | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Test if C string doesn't precede string.
lhs | C string. |
rhs | String. |
Definition at line 2645 of file basic_string.h.
basic_istream< _CharT, _Traits > & std::operator>> | ( | basic_istream< _CharT, _Traits > & | __in, |
_CharT & | __c | ||
) |
Character extractors.
in | An input stream. |
c | A character reference. |
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.
basic_istream<char, _Traits>& std::operator>> | ( | basic_istream< char, _Traits > & | __in, |
unsigned char & | __c | ||
) | [inline] |
Character extractors.
in | An input stream. |
c | A character reference. |
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.
basic_istream<char, _Traits>& std::operator>> | ( | basic_istream< char, _Traits > & | __in, |
signed char & | __c | ||
) | [inline] |
Character extractors.
in | An input stream. |
c | A character reference. |
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.
basic_istream< _CharT, _Traits > & std::operator>> | ( | basic_istream< _CharT, _Traits > & | __in, |
_CharT * | __s | ||
) |
Character string extractors.
in | An input stream. |
s | A pointer to a character array. |
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:
width()
is greater than zero, n
is width() otherwisen
is the number of elements of the largest array of *char_type
that can store a terminating eos
.Characters are extracted and stored until one of the following happens:
n-1
characters are storedcharT()
)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::basic_ios< _CharT, _Traits >::eof(), and std::ios_base::badbit.
basic_istream<char>& std::operator>> | ( | basic_istream< char > & | __in, |
char * | __s | ||
) |
Character string extractors.
in | An input stream. |
s | A pointer to a character array. |
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:
width()
is greater than zero, n
is width() otherwisen
is the number of elements of the largest array of *char_type
that can store a terminating eos
.Characters are extracted and stored until one of the following happens:
n-1
characters are storedcharT()
)width(0)
is then called for the input stream.
If no characters are extracted, sets failbit.
basic_istream<char, _Traits>& std::operator>> | ( | basic_istream< char, _Traits > & | __in, |
unsigned char * | __s | ||
) | [inline] |
Character string extractors.
in | An input stream. |
s | A pointer to a character array. |
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:
width()
is greater than zero, n
is width() otherwisen
is the number of elements of the largest array of *char_type
that can store a terminating eos
.Characters are extracted and stored until one of the following happens:
n-1
characters are storedcharT()
)width(0)
is then called for the input stream.
If no characters are extracted, sets failbit.
basic_istream<char, _Traits>& std::operator>> | ( | basic_istream< char, _Traits > & | __in, |
signed char * | __s | ||
) | [inline] |
Character string extractors.
in | An input stream. |
s | A pointer to a character array. |
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:
width()
is greater than zero, n
is width() otherwisen
is the number of elements of the largest array of *char_type
that can store a terminating eos
.Characters are extracted and stored until one of the following happens:
n-1
characters are storedcharT()
)width(0)
is then called for the input stream.
If no characters are extracted, sets failbit.
basic_istream<_CharT, _Traits>& std::operator>> | ( | basic_istream< _CharT, _Traits > && | __is, |
_Tp & | __x | ||
) | [inline] |
Generic extractor for rvalue stream.
is | An input stream. |
x | A reference to the extraction target. |
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.
bitset<_Nb> std::operator>> | ( | size_t | __position | ) | const |
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 1446 of file bitset.
References std::basic_string::reserve(), std::basic_string::push_back(), and std::basic_string::empty().
basic_istream< _CharT, _Traits > & std::operator>> | ( | basic_istream< _CharT, _Traits > & | __is, |
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > & | __str | ||
) |
Read stream into a string.
__is | Input stream. |
__str | Buffer to store into. |
Stores characters from __is into __str until whitespace is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into __str. Any previous contents of __str are erased.
Definition at line 552 of file vstring.tcc.
basic_istream< _CharT, _Traits > & std::operator>> | ( | basic_istream< _CharT, _Traits > & | __is, |
basic_string< _CharT, _Traits, _Alloc > & | __str | ||
) |
Read stream into a string.
is | Input stream. |
str | Buffer to store into. |
Stores characters from is into str until whitespace is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased.
Definition at line 998 of file basic_string.tcc.
References std::basic_string::erase(), std::basic_string::max_size(), and std::basic_string::append().
bitset<_Nb>& std::operator>>= | ( | size_t | __position | ) |
bool std::operator[] | ( | size_t | __position | ) |
Array-indexing support.
position | Index into the bitset. |
_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
bitset<_Nb> std::operator^ | ( | const bitset< _Nb > & | __x, |
const bitset< _Nb > & | __y | ||
) | [inline] |
bitset<_Nb> std::operator| | ( | const bitset< _Nb > & | __x, |
const bitset< _Nb > & | __y | ||
) | [inline] |
bitset<_Nb> std::operator~ | ( | ) | const |
_OutputIterator std::partial_sum | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result | ||
) |
Return list of partial sums.
Accumulates the values in the range [first,last) using operator+(). As each successive input value is added into the total, that partial sum is written to result. Therefore, the first value in result is the first value of the input, the second value in result is the sum of the first and second input values, and so on.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 238 of file stl_numeric.h.
_OutputIterator std::partial_sum | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryOperation | __binary_op | ||
) |
Return list of partial sums.
Accumulates the values in the range [first,last) using operator+(). As each successive input value is added into the total, that partial sum is written to result. Therefore, the first value in result is the first value of the input, the second value in result is the sum of the first and second input values, and so on.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 278 of file stl_numeric.h.
_Put_money<_MoneyT> std::put_money | ( | const _MoneyT & | __mon, |
bool | __intl = false |
||
) | [inline] |
Extended manipulator for inserting money.
mon | Either long double or a specialization of basic_string . |
intl | A bool indicating whether international format is to be used. |
Sent to a stream object, this manipulator inserts mon.
reference_wrapper<_Tp> std::ref | ( | _Tp & | __t | ) | [inline] |
Denotes a reference should be taken to a variable.
Definition at line 470 of file functional.
Referenced by ref().
void std::ref | ( | const _Tp && | ) |
Denotes a reference should be taken to a variable.
reference_wrapper<_Tp> std::ref | ( | reference_wrapper< _Tp > | __t | ) | [inline] |
_OutputIterator std::replace_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
const _Tp & | __old_value, | ||
const _Tp & | __new_value | ||
) |
Copy a sequence, replacing each element of one value with another value.
first | An input iterator. |
last | An input iterator. |
result | An output iterator. |
old_value | The value to be replaced. |
new_value | The replacement value. |
result+
(last-first).Copies each element in the input range [first,last) to the output range
[result,result+(last-first)) replacing elements equal to
old_value
with new_value
.
Definition at line 3849 of file stl_algo.h.
bitset<_Nb>& std::reset | ( | size_t | __position | ) |
Sets a given bit to false.
position | The index of the bit. |
std::out_of_range | If pos is bigger the size of the set. |
Same as writing set(pos,false)
.
Definition at line 1086 of file bitset.
References _Unchecked_reset().
_Resetiosflags std::resetiosflags | ( | ios_base::fmtflags | __mask | ) | [inline] |
void std::return_temporary_buffer | ( | _Tp * | __p | ) | [inline] |
The companion to get_temporary_buffer().
p | A buffer previously allocated by get_temporary_buffer. |
Frees the memory pointed to by p.
Definition at line 113 of file stl_tempbuf.h.
Referenced by std::_Temporary_buffer::_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 std::ios_base::right, std::ios_base::adjustfield, and __gnu_debug::__base().
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 std::ios_base::scientific, std::ios_base::floatfield, and __gnu_debug::__base().
Referenced by operator<<().
bitset<_Nb>& std::set | ( | size_t | __position, |
bool | __val = true |
||
) |
Sets a given bit to a particular value.
position | The index of the bit. |
val | Either true or false, defaults to true. |
std::out_of_range | If pos is bigger the size of the set. |
Definition at line 1061 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
.
base | A 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.
_Setfill<_CharT> std::setfill | ( | _CharT | __c | ) | [inline] |
_Setiosflags std::setiosflags | ( | ios_base::fmtflags | __mask | ) | [inline] |
_Setprecision std::setprecision | ( | int | __n | ) | [inline] |
_Setw std::setw | ( | int | __n | ) | [inline] |
ios_base& std::showbase | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showbase).
Definition at line 813 of file ios_base.h.
References std::ios_base::showbase, and __gnu_debug::__base().
ios_base& std::showpoint | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showpoint).
Definition at line 829 of file ios_base.h.
References std::ios_base::showpoint, and __gnu_debug::__base().
ios_base& std::showpos | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showpos).
Definition at line 845 of file ios_base.h.
References std::ios_base::showpos, and __gnu_debug::__base().
constexpr size_t std::size | ( | ) | const |
Returns the total number of bits.
Definition at line 1275 of file bitset.
Referenced by std::basic_string::assign(), std::basic_string::append(), std::basic_string::reserve(), std::basic_string::resize(), std::basic_string::find(), std::basic_string::rfind(), std::basic_string::find_first_of(), std::basic_string::find_last_of(), std::basic_string::find_first_not_of(), std::basic_string::find_last_not_of(), std::basic_string::compare(), std::deque::operator=(), std::deque::erase(), std::deque::_M_new_elements_at_front(), std::deque::_M_new_elements_at_back(), std::deque::resize(), std::deque::_M_range_check(), std::vector::reserve(), __gnu_cxx::__versa_string::resize(), __gnu_cxx::__versa_string::find(), __gnu_cxx::__versa_string::rfind(), __gnu_cxx::__versa_string::find_first_of(), __gnu_cxx::__versa_string::find_last_of(), __gnu_cxx::__versa_string::find_first_not_of(), __gnu_cxx::__versa_string::find_last_not_of(), and __gnu_cxx::__versa_string::compare().
ios_base& std::skipws | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::skipws).
Definition at line 861 of file ios_base.h.
References std::ios_base::skipws, and __gnu_debug::__base().
Referenced by std::basic_istream::sentry::sentry(), and operator>>().
__shared_ptr<_Tp, _Lp> std::static_pointer_cast | ( | const __shared_ptr< _Tp1, _Lp > & | __r | ) | [inline] |
static_pointer_cast
Definition at line 1120 of file shared_ptr_base.h.
void std::swap | ( | pair< _T1, _T2 > & | __x, |
pair< _T1, _T2 > & | __y | ||
) | [inline] |
See std::pair::swap().
Definition at line 241 of file stl_pair.h.
void std::swap | ( | multiset< _Key, _Compare, _Alloc > & | __x, |
multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Definition at line 731 of file stl_multiset.h.
void std::swap | ( | set< _Key, _Compare, _Alloc > & | __x, |
set< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
See std::set::swap().
void std::swap | ( | multimap< _Key, _Tp, _Compare, _Alloc > & | __x, |
multimap< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Definition at line 847 of file stl_multimap.h.
void std::swap | ( | map< _Key, _Tp, _Compare, _Alloc > & | __x, |
map< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
See std::map::swap().
void std::swap | ( | forward_list< _Tp, _Alloc > & | __lx, |
forward_list< _Tp, _Alloc > & | __ly | ||
) | [inline] |
See std::forward_list::swap().
Definition at line 1296 of file forward_list.h.
void std::swap | ( | vector< _Tp, _Alloc > & | __x, |
vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
See std::vector::swap().
Definition at line 1321 of file stl_vector.h.
void std::swap | ( | list< _Tp, _Alloc > & | __x, |
list< _Tp, _Alloc > & | __y | ||
) | [inline] |
See std::list::swap().
Definition at line 1624 of file stl_list.h.
void std::swap | ( | deque< _Tp, _Alloc > & | __x, |
deque< _Tp, _Alloc > & | __y | ||
) | [inline] |
See std::deque::swap().
Definition at line 1971 of file stl_deque.h.
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 2263 of file functional.
void std::swap | ( | basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) | [inline] |
Swap contents of two strings.
lhs | First string. |
rhs | Second string. |
Exchanges the contents of lhs and rhs in constant time.
Definition at line 2658 of file basic_string.h.
bool std::test | ( | size_t | __position | ) | const |
Tests the value of a bit.
position | The index of a bit. |
std::out_of_range | If pos is bigger the size of the set. |
Definition at line 1296 of file bitset.
References _Unchecked_test().
std::basic_string< char, std::char_traits< char >, std::allocator< char > > std::to_string | ( | ) | const |
unsigned long std::to_ulong | ( | ) | const |
Returns a numerical interpretation of the bitset.
std::overflow_error | If there are too many bits to be represented in an unsigned long . |
_CharT std::tolower | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.tolower(__c).
Definition at line 2602 of file locale_facets.h.
Referenced by std::regex_traits::translate_nocase().
_CharT std::toupper | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.toupper(__c).
Definition at line 2596 of file locale_facets.h.
_ForwardIterator std::uninitialized_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_ForwardIterator | __result | ||
) | [inline] |
Copies the range [first,last) into result.
first | An input iterator. |
last | An input iterator. |
result | An output iterator. |
Like copy(), but does not require an initialized output range.
Definition at line 109 of file stl_uninitialized.h.
Referenced by __gnu_parallel::parallel_sort_mwms_pu().
_ForwardIterator std::uninitialized_copy_n | ( | _InputIterator | __first, |
_Size | __n, | ||
_ForwardIterator | __result | ||
) | [inline] |
Copies the range [first,first+n) into result.
first | An input iterator. |
n | The number of elements to copy. |
result | An output iterator. |
Like copy_n(), but does not require an initialized output range.
Definition at line 631 of file stl_uninitialized.h.
References __iterator_category().
void std::uninitialized_fill | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
const _Tp & | __x | ||
) | [inline] |
Copies the value x into the range [first,last).
first | An input iterator. |
last | An input iterator. |
x | The source value. |
Like fill(), but does not require an initialized output range.
Definition at line 166 of file stl_uninitialized.h.
void std::uninitialized_fill_n | ( | _ForwardIterator | __first, |
_Size | __n, | ||
const _Tp & | __x | ||
) | [inline] |
Copies the value x into the range [first,first+n).
first | An input iterator. |
n | The number of copies to make. |
x | The source value. |
Like fill_n(), but does not require an initialized output range.
Definition at line 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 std::ios_base::unitbuf, and __gnu_debug::__base().
Referenced by std::basic_ostream::sentry::~sentry().
ios_base& std::uppercase | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::uppercase).
Definition at line 877 of file ios_base.h.
References std::ios_base::uppercase, and __gnu_debug::__base().
Referenced by std::num_put::do_put().
const _Facet & std::use_facet | ( | const locale & | __loc | ) |
Return a facet.
use_facet looks for and returns a reference to a facet of type Facet where Facet is the template parameter. If has_facet(locale) is true, there is a suitable facet to return. It throws std::bad_cast if the locale doesn't contain a facet of type Facet.
Facet | The facet type to access. |
locale | The locale to use. |
std::bad_cast | if locale doesn't contain a facet of type Facet. |
Definition at line 107 of file locale_classes.tcc.
Referenced by std::regex_traits::translate_nocase(), std::regex_traits::transform(), and std::regex_traits::isctype().
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:
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(), and std::ios_base::eofbit.
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 227 of file functional.
ios_base::Init std::__ioinit [static] |
piecewise_construct
Definition at line 75 of file stl_pair.h.
Linked to standard output.
Linked to standard error (unbuffered)
Linked to standard input.