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_ |