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...Functor
; use it. More...dynamic_cast
expression, an instance of this class (or something derived from this class) is thrown. More...typeid
expression is used. 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...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 94 of file postypes.h.
typedef fpos<mbstate_t> std::streampos |
File position for char streams.
Definition at line 228 of file postypes.h.
typedef ptrdiff_t std::streamsize |
Integral type for I/O operation counts and buffer sizes.
Definition at line 98 of file postypes.h.
typedef fpos<mbstate_t> std::u16streampos |
File position for char16_t streams.
Definition at line 234 of file postypes.h.
typedef fpos<mbstate_t> std::u32streampos |
File position for char32_t streams.
Definition at line 236 of file postypes.h.
typedef fpos<mbstate_t> std::wstreampos |
File position for wchar_t streams.
Definition at line 230 of file postypes.h.
anonymous enum |
Definition at line 2168 of file stl_algo.h.
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.
size_t std::__deque_buf_size | ( | size_t | __size | ) | [inline] |
This function controls the size of memory nodes.
size | The size of an element. |
This function started off as a compiler kludge from SGI, but seems to be a useful wrapper around a repeated constant expression. The '512' is tunable (and no other code needs to change), but no investigation has been done since inheriting the SGI code.
Definition at line 78 of file stl_deque.h.
Referenced by std::_Deque_base< _Tp, _Alloc >::_M_initialize_map().
void std::__final_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
This is a helper function for the sort routine.
Definition at line 2173 of file stl_algo.h.
References __insertion_sort(), and __unguarded_insertion_sort().
Referenced by sort().
void std::__final_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2188 of file stl_algo.h.
References __insertion_sort(), and __unguarded_insertion_sort().
_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 144 of file stl_algo.h.
Referenced by find().
_RandomAccessIterator std::__find | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
const _Tp & | __val, | ||
random_access_iterator_tag | |||
) |
This is an overload used by find() for the RAI case.
Definition at line 166 of file stl_algo.h.
_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 155 of file stl_algo.h.
Referenced by __gnu_cxx::bitmap_allocator< _Tp >::_M_allocate_single_object(), __gnu_cxx::bitmap_allocator< _Tp >::_M_deallocate_single_object(), and find_if().
_RandomAccessIterator std::__find_if | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Predicate | __pred, | ||
random_access_iterator_tag | |||
) |
This is an overload used by find_if() for the RAI case.
Definition at line 214 of file stl_algo.h.
_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 263 of file stl_algo.h.
Referenced by find_if_not().
_RandomAccessIterator std::__find_if_not | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Predicate | __pred, | ||
random_access_iterator_tag | |||
) |
This is an overload used by find_if_not() for the RAI case.
Definition at line 274 of file stl_algo.h.
_EuclideanRingElement std::__gcd | ( | _EuclideanRingElement | __m, |
_EuclideanRingElement | __n | ||
) |
This is a helper function for the rotate algorithm specialized on RAIs. It returns the greatest common divisor of two integer values.
Definition at line 1503 of file stl_algo.h.
Referenced by __rotate().
void std::__heap_select | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __middle, | ||
_RandomAccessIterator | __last | ||
) |
This is a helper function for the sort routines.
Definition at line 1900 of file stl_algo.h.
References make_heap().
Referenced by partial_sort().
void std::__heap_select | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __middle, | ||
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routines.
Definition at line 1913 of file stl_algo.h.
References make_heap().
_ForwardIterator std::__inplace_stable_partition | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Predicate | __pred, | ||
_Distance | __len | ||
) |
This is a helper function...
Definition at line 1777 of file stl_algo.h.
References advance(), distance(), and rotate().
Referenced by stable_partition().
void std::__inplace_stable_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
This is a helper function for the stable sorting routines.
Definition at line 3409 of file stl_algo.h.
References __insertion_sort(), and __merge_without_buffer().
Referenced by __inplace_stable_sort(), and stable_sort().
void std::__inplace_stable_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the stable sorting routines.
Definition at line 3428 of file stl_algo.h.
References __inplace_stable_sort(), __insertion_sort(), and __merge_without_buffer().
void std::__insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
This is a helper function for the sort routine.
Definition at line 2096 of file stl_algo.h.
References __unguarded_linear_insert(), and copy_backward().
Referenced by __final_insertion_sort(), and __inplace_stable_sort().
void std::__insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2119 of file stl_algo.h.
References __unguarded_linear_insert(), and copy_backward().
void std::__introsort_loop | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Size | __depth_limit | ||
) |
This is a helper function for the sort routine.
Definition at line 2245 of file stl_algo.h.
References __median(), and __unguarded_partition().
Referenced by __introsort_loop(), and sort().
void std::__introsort_loop | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Size | __depth_limit, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2277 of file stl_algo.h.
References __introsort_loop(), __median(), and __unguarded_partition().
_Size std::__lg | ( | _Size | __n | ) | [inline] |
This is a helper function for the sort routines. Precondition: __n > 0.
Definition at line 2310 of file stl_algo.h.
Referenced by std::tr1::__detail::__log_gamma_bernoulli(), nth_element(), and sort().
void std::__merge_adaptive | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_Pointer | __buffer, | ||
_Distance | __buffer_size | ||
) |
This is a helper function for the merge routines.
Definition at line 2910 of file stl_algo.h.
References __merge_backward(), __rotate_adaptive(), advance(), distance(), lower_bound(), and upper_bound().
Referenced by __merge_adaptive(), and inplace_merge().
void std::__merge_adaptive | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_Pointer | __buffer, | ||
_Distance | __buffer_size, | ||
_Compare | __comp | ||
) |
This is a helper function for the merge routines.
Definition at line 2966 of file stl_algo.h.
References __merge_adaptive(), __merge_backward(), __rotate_adaptive(), advance(), distance(), lower_bound(), and upper_bound().
_BidirectionalIterator3 std::__merge_backward | ( | _BidirectionalIterator1 | __first1, |
_BidirectionalIterator1 | __last1, | ||
_BidirectionalIterator2 | __first2, | ||
_BidirectionalIterator2 | __last2, | ||
_BidirectionalIterator3 | __result | ||
) |
This is a helper function for the merge routines.
Definition at line 2807 of file stl_algo.h.
References copy_backward().
Referenced by __merge_adaptive().
_BidirectionalIterator3 std::__merge_backward | ( | _BidirectionalIterator1 | __first1, |
_BidirectionalIterator1 | __last1, | ||
_BidirectionalIterator2 | __first2, | ||
_BidirectionalIterator2 | __last2, | ||
_BidirectionalIterator3 | __result, | ||
_Compare | __comp | ||
) |
This is a helper function for the merge routines.
Definition at line 2842 of file stl_algo.h.
References copy_backward().
void std::__merge_without_buffer | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2 | ||
) |
This is a helper function for the merge routines.
Definition at line 3023 of file stl_algo.h.
References advance(), distance(), iter_swap(), lower_bound(), rotate(), and upper_bound().
Referenced by __inplace_stable_sort(), __merge_without_buffer(), and inplace_merge().
void std::__merge_without_buffer | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_Compare | __comp | ||
) |
This is a helper function for the merge routines.
Definition at line 3067 of file stl_algo.h.
References __merge_without_buffer(), advance(), distance(), iter_swap(), lower_bound(), rotate(), and upper_bound().
_ForwardIterator std::__partition | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Predicate | __pred, | ||
forward_iterator_tag | |||
) |
This is a helper function...
Definition at line 1722 of file stl_algo.h.
References iter_swap().
Referenced by partition().
_BidirectionalIterator std::__partition | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last, | ||
_Predicate | __pred, | ||
bidirectional_iterator_tag | |||
) |
void std::__reverse | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last, | ||
bidirectional_iterator_tag | |||
) |
This is an uglified reverse(_BidirectionalIterator, _BidirectionalIterator) overloaded for bidirectional iterators.
Definition at line 1403 of file stl_algo.h.
References iter_swap().
Referenced by __rotate(), and reverse().
void std::__reverse | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
random_access_iterator_tag | |||
) |
This is an uglified reverse(_BidirectionalIterator, _BidirectionalIterator) overloaded for random access iterators.
Definition at line 1423 of file stl_algo.h.
References iter_swap().
void std::__rotate | ( | _ForwardIterator | __first, |
_ForwardIterator | __middle, | ||
_ForwardIterator | __last, | ||
forward_iterator_tag | |||
) |
This is a helper function for the rotate algorithm.
Definition at line 1517 of file stl_algo.h.
References iter_swap().
Referenced by __gnu_cxx::bitmap_allocator< _Tp >::_M_deallocate_single_object(), and rotate().
void std::__rotate | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
bidirectional_iterator_tag | |||
) |
This is a helper function for the rotate algorithm.
Definition at line 1553 of file stl_algo.h.
References __reverse(), and iter_swap().
void std::__rotate | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __middle, | ||
_RandomAccessIterator | __last, | ||
random_access_iterator_tag | |||
) |
This is a helper function for the rotate algorithm.
Definition at line 1583 of file stl_algo.h.
References __gcd(), and swap_ranges().
_BidirectionalIterator1 std::__rotate_adaptive | ( | _BidirectionalIterator1 | __first, |
_BidirectionalIterator1 | __middle, | ||
_BidirectionalIterator1 | __last, | ||
_Distance | __len1, | ||
_Distance | __len2, | ||
_BidirectionalIterator2 | __buffer, | ||
_Distance | __buffer_size | ||
) |
This is a helper function for the merge routines.
Definition at line 2878 of file stl_algo.h.
References advance(), copy_backward(), distance(), and rotate().
Referenced by __merge_adaptive().
_ForwardIterator std::__search_n | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
std::forward_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) overloaded for forward iterators.
Definition at line 340 of file stl_algo.h.
Referenced by search_n().
_RandomAccessIter std::__search_n | ( | _RandomAccessIter | __first, |
_RandomAccessIter | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
std::random_access_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) overloaded for random access iterators.
Definition at line 372 of file stl_algo.h.
_ForwardIterator std::__search_n | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
_BinaryPredicate | __binary_pred, | ||
std::forward_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, _BinaryPredicate) overloaded for forward iterators.
Definition at line 426 of file stl_algo.h.
_RandomAccessIter std::__search_n | ( | _RandomAccessIter | __first, |
_RandomAccessIter | __last, | ||
_Integer | __count, | ||
const _Tp & | __val, | ||
_BinaryPredicate | __binary_pred, | ||
std::random_access_iterator_tag | |||
) |
This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, _BinaryPredicate) overloaded for random access iterators.
Definition at line 465 of file stl_algo.h.
_ForwardIterator std::__stable_partition_adaptive | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Predicate | __pred, | ||
_Distance | __len, | ||
_Pointer | __buffer, | ||
_Distance | __buffer_size | ||
) |
This is a helper function...
Definition at line 1802 of file stl_algo.h.
References advance(), distance(), and rotate().
Referenced by stable_partition().
void std::__unguarded_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) | [inline] |
This is a helper function for the sort routine.
Definition at line 2141 of file stl_algo.h.
References __unguarded_linear_insert().
Referenced by __final_insertion_sort().
void std::__unguarded_insertion_sort | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) | [inline] |
This is a helper function for the sort routine.
Definition at line 2154 of file stl_algo.h.
References __unguarded_linear_insert().
void std::__unguarded_linear_insert | ( | _RandomAccessIterator | __last, |
_Tp | __val | ||
) |
This is a helper function for the sort routine.
Definition at line 2063 of file stl_algo.h.
Referenced by __insertion_sort(), and __unguarded_insertion_sort().
void std::__unguarded_linear_insert | ( | _RandomAccessIterator | __last, |
_Tp | __val, | ||
_Compare | __comp | ||
) |
This is a helper function for the sort routine.
Definition at line 2079 of file stl_algo.h.
_RandomAccessIterator std::__unguarded_partition | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Tp | __pivot | ||
) |
This is a helper function...
Definition at line 2204 of file stl_algo.h.
References iter_swap().
Referenced by __introsort_loop().
_RandomAccessIterator std::__unguarded_partition | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Tp | __pivot, | ||
_Compare | __comp | ||
) |
_OutputIterator std::__unique_copy | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_OutputIterator | __result, | ||
forward_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for forward iterators and output iterator as result.
Definition at line 1255 of file stl_algo.h.
Referenced by unique_copy().
_OutputIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
input_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for input iterators and output iterator as result.
Definition at line 1278 of file stl_algo.h.
_ForwardIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_ForwardIterator | __result, | ||
input_iterator_tag | , | ||
forward_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for input iterators and forward iterator as result.
Definition at line 1301 of file stl_algo.h.
_OutputIterator std::__unique_copy | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryPredicate | __binary_pred, | ||
forward_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for forward iterators and output iterator as result.
Definition at line 1322 of file stl_algo.h.
_OutputIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryPredicate | __binary_pred, | ||
input_iterator_tag | , | ||
output_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for input iterators and output iterator as result.
Definition at line 1351 of file stl_algo.h.
_ForwardIterator std::__unique_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_ForwardIterator | __result, | ||
_BinaryPredicate | __binary_pred, | ||
input_iterator_tag | , | ||
forward_iterator_tag | |||
) |
This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for input iterators and forward iterator as result.
Definition at line 1380 of file stl_algo.h.
void std::_Construct | ( | _T1 * | __p, |
const _T2 & | __value | ||
) | [inline] |
Constructs an object in existing memory by invoking an allocated object's constructor with an initializer.
Definition at line 70 of file stl_construct.h.
void std::_Destroy | ( | _Tp * | __pointer | ) | [inline] |
Destroy the object pointed to by a pointer type.
Definition at line 82 of file stl_construct.h.
Referenced by std::deque< _Tp, _Alloc >::_M_fill_initialize(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::vector< _Tp, _Alloc >::operator=(), std::vector< _Tp, _Alloc >::reserve(), and std::vector< std::sub_match< _Bi_iter >, _Allocator >::~vector().
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 112 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 115 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 141 of file stl_numeric.h.
_OutputIterator std::adjacent_difference | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result | ||
) |
Return differences between adjacent values.
Computes the difference between adjacent values in the range [first,last) using operator-() and writes the result to result.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 308 of file stl_numeric.h.
_OutputIterator std::adjacent_difference | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryOperation | __binary_op | ||
) |
Return differences between adjacent values.
Computes the difference between adjacent values in the range [first,last) using the function object binary_op and writes the result to result.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 347 of file stl_numeric.h.
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 168 of file stl_iterator_base_funcs.h.
References __iterator_category().
Referenced by __inplace_stable_partition(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), std::deque< _Tp, _Alloc >::_M_range_initialize(), equal_range(), lower_bound(), partition_point(), and upper_bound().
back_insert_iterator<_Container> std::back_inserter | ( | _Container & | __x | ) | [inline] |
x | A container of arbitrary type. |
x
.This wrapper function helps in creating back_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.
Definition at line 459 of file stl_iterator.h.
Referenced by regex_replace().
_Bind<typename _Maybe_wrap_member_pointer<_Functor>::type(_ArgTypes...)> std::bind | ( | _Functor | __f, |
_ArgTypes... | __args | ||
) | [inline] |
ios_base& std::boolalpha | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::boolalpha).
Definition at line 799 of file ios_base.h.
References std::ios_base::setf().
Referenced by std::num_get< _CharT, _InIter >::do_get(), std::num_put< _CharT, _OutIter >::do_put(), and noboolalpha().
Calls base.setf(ios_base::dec, ios_base::basefield).
Definition at line 937 of file ios_base.h.
References std::ios_base::setf().
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 110 of file stl_iterator_base_funcs.h.
References __iterator_category().
Referenced by __inplace_stable_partition(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), std::deque< _Tp, _Alloc >::_M_range_initialize(), equal_range(), inplace_merge(), is_heap_until(), std::sub_match< _Bi_iter >::length(), lower_bound(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), partition_point(), std::match_results< _Bi_iter >::position(), __gnu_cxx::random_sample_n(), and upper_bound().
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++/27_io/howto.html#2 for more on this subject.
Definition at line 538 of file ostream.
References flush(), std::basic_ostream< _CharT, _Traits >::put(), and std::basic_ios< _CharT, _Traits >::widen().
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 549 of file ostream.
References std::basic_ostream< _CharT, _Traits >::put().
ios_base& std::fixed | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::fixed, ios_base::floatfield).
Definition at line 962 of file ios_base.h.
References std::ios_base::setf().
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 559 of file ostream.
References std::basic_ostream< _CharT, _Traits >::flush().
Referenced by endl().
front_insert_iterator<_Container> std::front_inserter | ( | _Container & | __x | ) | [inline] |
x | A container of arbitrary type. |
x
.This wrapper function helps in creating front_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.
Definition at line 542 of file stl_iterator.h.
pair<_Tp*, ptrdiff_t> std::get_temporary_buffer | ( | ptrdiff_t | __len | ) |
Allocates a temporary buffer.
len | The number of objects of type Tp. |
Reinventing the wheel, but this time with prettier spokes!
This function tries to obtain storage for len
adjacent Tp objects. The objects themselves are not constructed, of course. A pair<> is returned containing "the buffer s address and capacity (in the units of sizeof(Tp)), or a pair of 0 values if no storage can be obtained." Note that the capacity obtained may be less than that requested if the memory is unavailable; you should compare len with the .second return value.
Provides the nothrow exception guarantee.
Definition at line 85 of file stl_tempbuf.h.
Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer().
basic_istream< _CharT, _Traits > & std::getline | ( | basic_istream< _CharT, _Traits > & | __is, |
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > & | __str, | ||
_CharT | __delim | ||
) |
Read a line from stream into a string.
__is | Input stream. |
__str | Buffer to store into. |
__delim | Character marking end of line. |
Stores characters from __is into __str until __delim is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into __str. Any previous contents of __str are erased. If delim was encountered, it is extracted but not stored into __str.
Definition at line 622 of file vstring.tcc.
References __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::append(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::erase(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().
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 2435 of file vstring.h.
References std::basic_ios< _CharT, _Traits >::widen().
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 1069 of file basic_string.tcc.
References std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().
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 2538 of file basic_string.h.
References std::basic_ios< _CharT, _Traits >::widen().
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 91 of file locale_classes.tcc.
Calls base.setf(ios_base::hex, ios_base::basefield).
Definition at line 945 of file ios_base.h.
References std::ios_base::setf().
Referenced by std::num_get< _CharT, _InIter >::do_get(), std::num_put< _CharT, _OutIter >::do_put(), std::basic_ostream< _CharT, _Traits >::operator<<(), and std::regex_traits< _Ch_type >::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 169 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 201 of file stl_numeric.h.
insert_iterator<_Container> std::inserter | ( | _Container & | __x, |
_Iterator | __i | ||
) | [inline] |
x | A container of arbitrary type. |
x
.This wrapper function helps in creating insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.
Definition at line 648 of file stl_iterator.h.
ios_base& std::internal | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::internal, ios_base::adjustfield).
Definition at line 912 of file ios_base.h.
References std::ios_base::setf().
void std::iota | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Tp | __value | ||
) |
Create a range of sequentially increasing values.
For each element in the range [first,last) assigns
value
and increments value
as if by ++value
.
first | Start of range. |
last | End of range. |
value | Starting value. |
Definition at line 80 of file stl_numeric.h.
bool std::isalnum | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.is(ctype_base::alnum, __c).
Definition at line 2575 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 2551 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 2533 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 2557 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 2581 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 2545 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 2527 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 2563 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 2521 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 2539 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 2569 of file locale_facets.h.
Calls base.setf(ios_base::left, ios_base::adjustfield).
Definition at line 920 of file ios_base.h.
References std::ios_base::setf().
Referenced by std::num_put< _CharT, _OutIter >::do_put(), __gnu_parallel::LoserTree< false, T, Comparator >::init_winner(), operator<<(), and __gnu_parallel::parallel_partition().
_Mem_fn<_Tp _Class::*> std::mem_fn | ( | _Tp _Class::* | __pm | ) | [inline] |
Returns a function object that forwards to the member pointer pm.
Definition at line 794 of file tr1_impl/functional.
ios_base& std::noboolalpha | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::boolalpha).
Definition at line 807 of file ios_base.h.
References boolalpha(), and std::ios_base::unsetf().
ios_base& std::noshowbase | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::showbase).
Definition at line 823 of file ios_base.h.
References showbase(), and std::ios_base::unsetf().
ios_base& std::noshowpoint | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::showpoint).
Definition at line 839 of file ios_base.h.
References showpoint(), and std::ios_base::unsetf().
ios_base& std::noshowpos | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::showpos).
Definition at line 855 of file ios_base.h.
References showpos(), and std::ios_base::unsetf().
ios_base& std::noskipws | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::skipws).
Definition at line 871 of file ios_base.h.
References skipws(), and std::ios_base::unsetf().
ios_base& std::nounitbuf | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::unitbuf).
Definition at line 903 of file ios_base.h.
References unitbuf(), and std::ios_base::unsetf().
ios_base& std::nouppercase | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::uppercase).
Definition at line 887 of file ios_base.h.
References std::ios_base::unsetf(), and uppercase().
Calls base.setf(ios_base::oct, ios_base::basefield).
Definition at line 953 of file ios_base.h.
References std::ios_base::setf().
Referenced by std::basic_ostream< _CharT, _Traits >::operator<<(), and std::regex_traits< _Ch_type >::value().
bool std::operator!= | ( | const istream_iterator< _Tp, _CharT, _Traits, _Dist > & | __x, |
const istream_iterator< _Tp, _CharT, _Traits, _Dist > & | __y | ||
) | [inline] |
Return false if x and y are both end or not end, or x and y are the same.
Definition at line 130 of file stream_iterator.h.
bool std::operator!= | ( | const pair< _T1, _T2 > & | __x, |
const pair< _T1, _T2 > & | __y | ||
) | [inline] |
Uses operator==
to find the result.
Definition at line 159 of file stl_pair.h.
bool std::operator!= | ( | const _Fwd_list_iterator< _Tp, _Alloc > & | __x, |
const _Fwd_list_const_iterator< _Tp, _Alloc > & | __y | ||
) | [inline] |
Forward list iterator inequality comparison.
Definition at line 254 of file forward_list.h.
bool std::operator!= | ( | const stack< _Tp, _Seq > & | __x, |
const stack< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 259 of file stl_stack.h.
bool std::operator!= | ( | const reverse_iterator< _Iterator > & | __x, |
const reverse_iterator< _Iterator > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 290 of file stl_iterator.h.
bool std::operator!= | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 294 of file stl_queue.h.
bool std::operator!= | ( | const reverse_iterator< _IteratorL > & | __x, |
const reverse_iterator< _IteratorR > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 340 of file stl_iterator.h.
bool std::operator!= | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Returns !(x == y).
Definition at line 649 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 752 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 vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 1192 of file stl_vector.h.
bool std::operator!= | ( | const forward_list< _Tp, _Alloc > & | __lx, |
const forward_list< _Tp, _Alloc > & | __ly | ||
) | [inline] |
Based on operator==.
Definition at line 1256 of file forward_list.h.
bool std::operator!= | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator==.
Definition at line 1492 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 1774 of file stl_deque.h.
bool std::operator!= | ( | const function< _Signature > & | __f, |
_M_clear_type * | |||
) | [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 2108 of file tr1_impl/functional.
bool std::operator!= | ( | _M_clear_type * | , |
const function< _Signature > & | __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 2114 of file tr1_impl/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 2278 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 2290 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 2302 of file basic_string.h.
bitset<_Nb> std::operator& | ( | const bitset< _Nb > & | __x, |
const bitset< _Nb > & | __y | ||
) | [inline] |
reverse_iterator<_Iterator> std::operator+ | ( | typename reverse_iterator< _Iterator >::difference_type | __n, |
const reverse_iterator< _Iterator > & | __x | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 320 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
basic_string<_CharT, _Traits, _Alloc> std::operator+ | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | ||
) |
Concatenate two strings.
lhs | First string. |
rhs | Last string. |
Definition at line 2161 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::append().
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 693 of file basic_string.tcc.
References std::basic_string< _CharT, _Traits, _Alloc >::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 709 of file basic_string.tcc.
References std::basic_string< _CharT, _Traits, _Alloc >::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 2198 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::append().
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 2214 of file basic_string.h.
reverse_iterator<_Iterator>::difference_type std::operator- | ( | const reverse_iterator< _Iterator > & | __x, |
const reverse_iterator< _Iterator > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 314 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
auto std::operator- | ( | const reverse_iterator< _IteratorL > & | __x, |
const reverse_iterator< _IteratorR > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 366 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
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 152 of file stl_pair.h.
References std::pair< _T1, _T2 >::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 253 of file stl_stack.h.
bool std::operator< | ( | const reverse_iterator< _Iterator > & | __x, |
const reverse_iterator< _Iterator > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 284 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
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 288 of file stl_queue.h.
References std::queue< _Tp, _Sequence >::c.
bool std::operator< | ( | const reverse_iterator< _IteratorL > & | __x, |
const reverse_iterator< _IteratorR > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 334 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
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 642 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 745 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 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 1185 of file stl_vector.h.
References lexicographical_compare().
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 1248 of file forward_list.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 1485 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 1766 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 2315 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2327 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 2339 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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.
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 321 of file ostream.tcc.
References std::basic_ios< _CharT, _Traits >::setstate().
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.
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.
std::basic_ostream<_CharT, _Traits>& std::operator<< | ( | std::basic_ostream< _CharT, _Traits > & | __os, |
const bernoulli_distribution & | __x | ||
) |
Inserts a bernoulli_distribution random number distribution __x
into the output stream __os
.
__os | An output stream. |
__x | A bernoulli_distribution random number distribution. |
__x
inserted or in an error state. Definition at line 823 of file random.tcc.
References std::ios_base::flags(), left(), and scientific().
std::basic_ostream<_CharT, _Traits>& std::operator<< | ( | std::basic_ostream< _CharT, _Traits > & | __os, |
const bitset< _Nb > & | __x | ||
) |
Global I/O operators for bitsets.
Direct I/O between streams and bitsets is supported. Output is straightforward. Input will skip whitespace, only accept '0' and '1' characters, and will only extract as many digits as the bitset will hold.
Definition at line 1374 of file bitset.
References std::__ctype_abstract_base< _CharT >::widen().
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 2498 of file basic_string.h.
bool std::operator<= | ( | const pair< _T1, _T2 > & | __x, |
const pair< _T1, _T2 > & | __y | ||
) | [inline] |
Uses operator<
to find the result.
Definition at line 171 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 reverse_iterator< _Iterator > & | __x, |
const reverse_iterator< _Iterator > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 302 of file stl_iterator.h.
bool std::operator<= | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 306 of file stl_queue.h.
bool std::operator<= | ( | const reverse_iterator< _IteratorL > & | __x, |
const reverse_iterator< _IteratorR > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 352 of file stl_iterator.h.
bool std::operator<= | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Returns !(y < x)
Definition at line 663 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 766 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 vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1204 of file stl_vector.h.
bool std::operator<= | ( | const forward_list< _Tp, _Alloc > & | __lx, |
const forward_list< _Tp, _Alloc > & | __ly | ||
) | [inline] |
Based on operator<.
Definition at line 1277 of file forward_list.h.
bool std::operator<= | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1504 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 1788 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 2389 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2401 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 2413 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
bool std::operator== | ( | const istream_iterator< _Tp, _CharT, _Traits, _Dist > & | __x, |
const istream_iterator< _Tp, _CharT, _Traits, _Dist > & | __y | ||
) | [inline] |
Return true if x and y are both end or not end, or x and y are the same.
Definition at line 123 of file stream_iterator.h.
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 146 of file stl_pair.h.
References std::pair< _T1, _T2 >::first, and std::pair< _T1, _T2 >::second.
bool std::operator== | ( | const fpos< _StateT > & | __lhs, |
const fpos< _StateT > & | __rhs | ||
) | [inline] |
Test if equivalent to another position.
Definition at line 216 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 235 of file stl_stack.h.
bool std::operator== | ( | const _Fwd_list_iterator< _Tp, _Alloc > & | __x, |
const _Fwd_list_const_iterator< _Tp, _Alloc > & | __y | ||
) | [inline] |
Forward list iterator equality comparison.
Definition at line 245 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 270 of file stl_queue.h.
References std::queue< _Tp, _Sequence >::c.
bool std::operator== | ( | const reverse_iterator< _Iterator > & | __x, |
const reverse_iterator< _Iterator > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 278 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
bool std::operator== | ( | const reverse_iterator< _IteratorL > & | __x, |
const reverse_iterator< _IteratorR > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 328 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
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 625 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 728 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 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 1168 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin(), std::vector< _Tp, _Alloc >::end(), equal(), and std::vector< _Tp, _Alloc >::size().
bool std::operator== | ( | const forward_list< _Tp, _Alloc > & | __lx, |
const forward_list< _Tp, _Alloc > & | __ly | ||
) |
Forward list equality comparison.
lx | A forward_list |
ly | A forward_list of the same type as lx. |
This is an equivalence relation. It is linear in the size of the forward lists. Deques are considered equivalent if corresponding elements compare equal.
Definition at line 455 of file forward_list.tcc.
References std::forward_list< _Tp, _Alloc >::cbegin(), and std::forward_list< _Tp, _Alloc >::cend().
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 1456 of file stl_list.h.
References std::list< _Tp, _Alloc >::begin(), and std::list< _Tp, _Alloc >::end().
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 1748 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::begin(), std::deque< _Tp, _Alloc >::end(), equal(), and std::deque< _Tp, _Alloc >::size().
bool std::operator== | ( | const function< _Signature > & | __f, |
_M_clear_type * | |||
) | [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 2090 of file tr1_impl/functional.
bool std::operator== | ( | _M_clear_type * | , |
const function< _Signature > & | __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 2096 of file tr1_impl/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 2232 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2253 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2265 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
bool std::operator> | ( | const pair< _T1, _T2 > & | __x, |
const pair< _T1, _T2 > & | __y | ||
) | [inline] |
Uses operator<
to find the result.
Definition at line 165 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 reverse_iterator< _Iterator > & | __x, |
const reverse_iterator< _Iterator > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 296 of file stl_iterator.h.
bool std::operator> | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 300 of file stl_queue.h.
bool std::operator> | ( | const reverse_iterator< _IteratorL > & | __x, |
const reverse_iterator< _IteratorR > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 346 of file stl_iterator.h.
bool std::operator> | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Returns y < x.
Definition at line 656 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 759 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 vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1198 of file stl_vector.h.
bool std::operator> | ( | const forward_list< _Tp, _Alloc > & | __lx, |
const forward_list< _Tp, _Alloc > & | __ly | ||
) | [inline] |
Based on operator<.
Definition at line 1263 of file forward_list.h.
bool std::operator> | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1498 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 1781 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 2352 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2364 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2376 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
bool std::operator>= | ( | const pair< _T1, _T2 > & | __x, |
const pair< _T1, _T2 > & | __y | ||
) | [inline] |
Uses operator<
to find the result.
Definition at line 177 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 reverse_iterator< _Iterator > & | __x, |
const reverse_iterator< _Iterator > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 308 of file stl_iterator.h.
bool std::operator>= | ( | const queue< _Tp, _Seq > & | __x, |
const queue< _Tp, _Seq > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 312 of file stl_queue.h.
bool std::operator>= | ( | const reverse_iterator< _IteratorL > & | __x, |
const reverse_iterator< _IteratorR > & | __y | ||
) | [inline] |
x | A reverse_iterator. |
y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 358 of file stl_iterator.h.
bool std::operator>= | ( | const multiset< _Key, _Compare, _Alloc > & | __x, |
const multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Returns !(x < y)
Definition at line 670 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 773 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 vector< _Tp, _Alloc > & | __x, |
const vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1210 of file stl_vector.h.
bool std::operator>= | ( | const forward_list< _Tp, _Alloc > & | __lx, |
const forward_list< _Tp, _Alloc > & | __ly | ||
) | [inline] |
Based on operator<.
Definition at line 1270 of file forward_list.h.
bool std::operator>= | ( | const list< _Tp, _Alloc > & | __x, |
const list< _Tp, _Alloc > & | __y | ||
) | [inline] |
Based on operator<.
Definition at line 1510 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 1795 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 2426 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2438 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2450 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 853 of file istream.tcc.
References std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().
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()n
is "the number of elements of the largest array of
@c char_type that can store a terminating @c eos." [27.6.1.2.3]/6Characters 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 885 of file istream.tcc.
References std::ios_base::getloc(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), and std::ios_base::width().
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()n
is "the number of elements of the largest array of
@c char_type that can store a terminating @c eos." [27.6.1.2.3]/6Characters 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()n
is "the number of elements of the largest array of
@c char_type that can store a terminating @c eos." [27.6.1.2.3]/6Characters 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()n
is "the number of elements of the largest array of
@c char_type that can store a terminating @c eos." [27.6.1.2.3]/6Characters 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.
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 1306 of file bitset.
References std::basic_string< _CharT, _Traits, _Alloc >::empty(), std::basic_string< _CharT, _Traits, _Alloc >::push_back(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_string< _CharT, _Traits, _Alloc >::reserve(), std::basic_ios< _CharT, _Traits >::setstate(), and std::basic_ios< _CharT, _Traits >::widen().
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 547 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 997 of file basic_string.tcc.
References std::basic_string< _CharT, _Traits, _Alloc >::append(), std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::ios_base::getloc(), std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), and std::ios_base::width().
bitset<_Nb> std::operator^ | ( | const bitset< _Nb > & | __x, |
const bitset< _Nb > & | __y | ||
) | [inline] |
bitset<_Nb> std::operator| | ( | const bitset< _Nb > & | __x, |
const bitset< _Nb > & | __y | ||
) | [inline] |
_OutputIterator std::partial_sum | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result | ||
) |
Return list of partial sums.
Accumulates the values in the range [first,last) using operator+(). As each successive input value is added into the total, that partial sum is written to result. Therefore, the first value in result is the first value of the input, the second value in result is the sum of the first and second input values, and so on.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 232 of file stl_numeric.h.
_OutputIterator std::partial_sum | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
_BinaryOperation | __binary_op | ||
) |
Return list of partial sums.
Accumulates the values in the range [first,last) using operator+(). As each successive input value is added into the total, that partial sum is written to result. Therefore, the first value in result is the first value of the input, the second value in result is the sum of the first and second input values, and so on.
first | Start of input range. |
last | End of input range. |
result | Output to write sums to. |
Definition at line 272 of file stl_numeric.h.
_OutputIterator std::replace_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_OutputIterator | __result, | ||
const _Tp & | __old_value, | ||
const _Tp & | __new_value | ||
) |
Copy a sequence, replacing each element of one value with another value.
first | An input iterator. |
last | An input iterator. |
result | An output iterator. |
old_value | The value to be replaced. |
new_value | The replacement value. |
result+
(last-first).Copies each element in the input range [first,last) to the output range
[result,result+(last-first)) replacing elements equal to
old_value
with new_value
.
Definition at line 3804 of file stl_algo.h.
_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 112 of file stl_tempbuf.h.
Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer().
ios_base& std::right | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::right, ios_base::adjustfield).
Definition at line 928 of file ios_base.h.
References std::ios_base::setf().
Referenced by __gnu_parallel::LoserTree< false, T, Comparator >::init_winner(), and __gnu_parallel::parallel_partition().
ios_base& std::scientific | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::scientific, ios_base::floatfield).
Definition at line 970 of file ios_base.h.
References std::ios_base::setf().
Referenced by operator<<().
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 815 of file ios_base.h.
References std::ios_base::setf().
Referenced by noshowbase().
ios_base& std::showpoint | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showpoint).
Definition at line 831 of file ios_base.h.
References std::ios_base::setf().
Referenced by noshowpoint().
ios_base& std::showpos | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showpos).
Definition at line 847 of file ios_base.h.
References std::ios_base::setf().
Referenced by noshowpos().
ios_base& std::skipws | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::skipws).
Definition at line 863 of file ios_base.h.
References std::ios_base::setf().
Referenced by noskipws(), and std::basic_istream< _CharT, _Traits >::sentry::sentry().
void std::swap | ( | pair< _T1, _T2 > & | __x, |
pair< _T1, _T2 > & | __y | ||
) | [inline] |
See std::pair::swap().
Definition at line 186 of file stl_pair.h.
void std::swap | ( | _Tp & | __a, |
_Tp & | __b | ||
) | [inline] |
void std::swap | ( | multiset< _Key, _Compare, _Alloc > & | __x, |
multiset< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
Definition at line 677 of file stl_multiset.h.
References std::multiset< _Key, _Compare, _Alloc >::swap().
void std::swap | ( | set< _Key, _Compare, _Alloc > & | __x, |
set< _Key, _Compare, _Alloc > & | __y | ||
) | [inline] |
See std::set::swap().
Definition at line 691 of file stl_set.h.
References std::set< _Key, _Compare, _Alloc >::swap().
void std::swap | ( | multimap< _Key, _Tp, _Compare, _Alloc > & | __x, |
multimap< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
Definition at line 780 of file stl_multimap.h.
References std::multimap< _Key, _Tp, _Compare, _Alloc >::swap().
void std::swap | ( | map< _Key, _Tp, _Compare, _Alloc > & | __x, |
map< _Key, _Tp, _Compare, _Alloc > & | __y | ||
) | [inline] |
See std::map::swap().
Definition at line 851 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::swap().
void std::swap | ( | vector< _Tp, _Alloc > & | __x, |
vector< _Tp, _Alloc > & | __y | ||
) | [inline] |
See std::vector::swap().
Definition at line 1216 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::swap().
void std::swap | ( | forward_list< _Tp, _Alloc > & | __lx, |
forward_list< _Tp, _Alloc > & | __ly | ||
) | [inline] |
See std::forward_list::swap().
Definition at line 1284 of file forward_list.h.
References std::forward_list< _Tp, _Alloc >::swap().
void std::swap | ( | forward_list< _Tp, _Alloc > && | __lx, |
forward_list< _Tp, _Alloc > & | __ly | ||
) | [inline] |
See std::forward_list::swap().
Definition at line 1291 of file forward_list.h.
void std::swap | ( | forward_list< _Tp, _Alloc > & | __lx, |
forward_list< _Tp, _Alloc > && | __ly | ||
) | [inline] |
See std::forward_list::swap().
Definition at line 1298 of file forward_list.h.
References std::forward_list< _Tp, _Alloc >::swap().
void std::swap | ( | list< _Tp, _Alloc > & | __x, |
list< _Tp, _Alloc > & | __y | ||
) | [inline] |
See std::list::swap().
Definition at line 1516 of file stl_list.h.
References std::list< _Tp, _Alloc >::swap().
void std::swap | ( | deque< _Tp, _Alloc > & | __x, |
deque< _Tp, _Alloc > & | __y | ||
) | [inline] |
See std::deque::swap().
Definition at line 1802 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::swap().
void std::swap | ( | function< _Signature > & | __x, |
function< _Signature > & | __y | ||
) | [inline] |
Swap the targets of two polymorphic function object wrappers.
This function will not throw an exception.
Definition at line 2126 of file tr1_impl/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 2463 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::swap().
_CharT std::tolower | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.tolower(__c).
Definition at line 2593 of file locale_facets.h.
Referenced by std::regex_traits< _Ch_type >::translate_nocase().
_CharT std::toupper | ( | _CharT | __c, |
const locale & | __loc | ||
) | [inline] |
Convenience interface to ctype.toupper(__c).
Definition at line 2587 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 107 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 470 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 164 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 218 of file stl_uninitialized.h.
Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer().
ios_base& std::unitbuf | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::unitbuf).
Definition at line 895 of file ios_base.h.
References std::ios_base::setf().
Referenced by nounitbuf(), and std::basic_ostream< _CharT, _Traits >::sentry::~sentry().
ios_base& std::uppercase | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::uppercase).
Definition at line 879 of file ios_base.h.
References std::ios_base::setf().
Referenced by std::num_put< _CharT, _OutIter >::do_put(), and nouppercase().
const _Facet & std::use_facet | ( | const locale & | __loc | ) |
Return a facet.
use_facet looks for and returns a reference to a facet of type Facet where Facet is the template parameter. If has_facet(locale) is true, there is a suitable facet to return. It throws std::bad_cast if the locale doesn't contain a facet of type Facet.
Facet | The facet type to access. |
locale | The locale to use. |
std::bad_cast | if locale doesn't contain a facet of type Facet. |
Definition at line 105 of file locale_classes.tcc.
Referenced by std::regex_traits< _Ch_type >::isctype(), std::regex_traits< _Ch_type >::transform(), and std::regex_traits< _Ch_type >::translate_nocase().
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 946 of file istream.tcc.
References std::ios_base::getloc(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().
__gnu_cxx::__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 265 of file tr1_impl/functional.
Linked to standard error (unbuffered)
Linked to standard error (buffered)
Linked to standard output.