new
. More...
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.
typedef void(*) std::new_handler() |
typedef long long std::streamoff |
Type used by fpos, char_traits<char>, and char_traits<wchar_t>.
Definition at line 74 of file postypes.h.
typedef fpos<mbstate_t> std::streampos |
typedef ptrdiff_t std::streamsize |
typedef void(*) std::terminate_handler() |
typedef void(*) std::unexpected_handler() |
typedef fpos<mbstate_t> std::wstreampos |
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.
_Tp std::accumulate | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_Tp | __init, | |||
_BinaryOperation | __binary_op | |||
) |
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 107 of file stl_numeric.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_Tp std::accumulate | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_Tp | __init | |||
) |
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 81 of file stl_numeric.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_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 313 of file stl_numeric.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_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 274 of file stl_numeric.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_ForwardIterator std::adjacent_find | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_BinaryPredicate | __binary_pred | |||
) |
Find two adjacent values in a sequence using a predicate.
first | A forward iterator. | |
last | A forward iterator. | |
binary_pred | A binary predicate. |
i
such that i
and i+1
are both valid iterators in
[first,last) and such that binary_pred
(*i,*(i+1)) is true, or last
if no such iterator exists. Definition at line 393 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_ForwardIterator std::adjacent_find | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last | |||
) |
Find two adjacent values in a sequence that are equal.
first | A forward iterator. | |
last | A forward iterator. |
i
such that i
and i+1
are both valid iterators in
[first,last) and such that *i
== *
(i+1), or last
if no such iterator exists. Definition at line 362 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by unique().
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 . |
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 173 of file stl_iterator_base_funcs.h.
References __advance(), and __iterator_category().
Referenced by __find_end(), __inplace_stable_partition(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), std::vector< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Allocator >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::vector< _Tp, _Alloc >::_M_range_insert(), equal_range(), lower_bound(), and upper_bound().
back_insert_iterator<_Container> std::back_inserter | ( | _Container & | __x | ) | [inline] |
x | A container of arbitrary type. |
x
.Definition at line 446 of file stl_iterator.h.
ios_base& std::boolalpha | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::boolalpha).
Definition at line 788 of file ios_base.h.
References std::ios_base::setf().
Referenced by noboolalpha().
_OutputIterator std::copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result | |||
) | [inline] |
Copies the range [first,last) into result.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. |
memmove
whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling). Result may not be contained within [first,last); the copy_backward function should be used instead.Note that the end of the output range is permitted to be contained within [first,last).
Definition at line 389 of file stl_algobase.h.
References std::__copy_normal<, >::__copy_n(), __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_BI2 std::copy_backward | ( | _BI1 | __first, | |
_BI1 | __last, | |||
_BI2 | __result | |||
) | [inline] |
Copies the range [first,last) into result.
first | A bidirectional iterator. | |
last | A bidirectional iterator. | |
result | A bidirectional iterator. |
memmove
whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling).Result may not be in the range [first,last). Use copy instead. Note that the start of the output range may overlap [first,last).
Definition at line 526 of file stl_algobase.h.
References std::__copy_backward_normal<, >::__copy_b_n(), __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by __insertion_sort(), __merge_backward(), __rotate_adaptive(), std::vector< _Tp, _Alloc >::_M_fill_insert(), std::vector< bool, _Alloc >::_M_fill_insert(), std::vector< _Tp, _Alloc >::_M_insert_aux(), std::vector< bool, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_insert_aux(), std::vector< bool, _Alloc >::_M_insert_range(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::deque< _Tp, _Alloc >::_M_reallocate_map(), and std::deque< _Tp, _Alloc >::erase().
iterator_traits<_InputIterator>::difference_type std::count | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Tp & | __value | |||
) |
Count the number of copies of a value in a sequence.
first | An input iterator. | |
last | An input iterator. | |
value | The value to be counted. |
i
in the range
[first,last) for which *i
== value
Definition at line 424 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
iterator_traits<_InputIterator>::difference_type std::count_if | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_Predicate | __pred | |||
) |
Count the elements of a sequence for which a predicate is true.
first | An input iterator. | |
last | An input iterator. | |
pred | A predicate. |
i
in the range
[first,last) for which pred(*i)
is true. Definition at line 448 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
ios_base& std::dec | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::dec, ios_base::basefield).
Definition at line 926 of file ios_base.h.
References std::ios_base::setf().
Referenced by std::tr1::operator<<(), operator<<(), std::tr1::operator>>(), and operator>>().
iterator_traits<_InputIterator>::difference_type std::distance | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
A generalization of pointer arithmetic.
first | An input iterator. | |
last | An input iterator. |
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 115 of file stl_iterator_base_funcs.h.
References __distance(), and __iterator_category().
Referenced by std::tr1::__detail::__distance_fw(), __find_end(), __inplace_stable_partition(), __is_heap(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), std::vector< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Allocator >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_initialize_range(), std::vector< bool, _Alloc >::_M_insert_range(), std::vector< _Tp, _Allocator >::_M_range_initialize(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::deque< _Tp, _Alloc >::_M_range_insert_aux(), std::tr1::_Hashtable< _Key, std::pair< _Key, _Tp >, _Alloc, std::_Select1st< std::pair< _Key, _Tp > >, _Pred, _Hash, std::tr1::__detail::_Mod_range_hashing, std::tr1::__detail::_Default_ranged_hash, std::tr1::__detail::_Prime_rehash_policy, __cache_hash_code, false, false >::bucket_size(), std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::count(), equal_range(), inplace_merge(), lower_bound(), __gnu_cxx::random_sample_n(), std::list< _Tp, _Allocator >::size(), 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 545 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 556 of file ostream.
References std::basic_ostream< _CharT, _Traits >::put().
bool std::equal | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_BinaryPredicate | __binary_pred | |||
) | [inline] |
Tests a range for element-wise equality.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
binary_pred | A binary predicate functor. |
Definition at line 804 of file stl_algobase.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
bool std::equal | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2 | |||
) | [inline] |
Tests a range for element-wise equality.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. |
==
and returns true or false depending on whether all of the corresponding elements of the ranges are equal.
Definition at line 771 of file stl_algobase.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by operator==(), and std::tr1::operator==().
void std::fill | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __value | |||
) |
Fills the range [first,last) with copies of value.
first | A forward iterator. | |
last | A forward iterator. | |
value | A reference-to-const of arbitrary type. |
memset
.
Definition at line 583 of file stl_algobase.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and std::__fill<>::fill().
_OutputIterator std::fill_n | ( | _OutputIterator | __first, | |
_Size | __n, | |||
const _Tp & | __value | |||
) |
Fills the range [first,first+n) with copies of value.
first | An output iterator. | |
n | The count of copies to perform. | |
value | A reference-to-const of arbitrary type. |
memset
.
Definition at line 659 of file stl_algobase.h.
References __glibcxx_function_requires, and std::__fill_n<>::fill_n().
Referenced by __uninitialized_fill_n_aux(), std::vector< _Tp, _Alloc >::_M_fill_assign(), std::char_traits< __gnu_cxx::character< V, I, S > >::assign(), __gnu_cxx::char_traits< _CharT >::assign(), and std::tr1::array< _Tp, _Nm >::assign().
_InputIterator std::find | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Tp & | __val | |||
) | [inline] |
Find the first occurrence of a value in a sequence.
first | An input iterator. | |
last | An input iterator. | |
val | The value to find. |
i
in the range
[first,last) such that *i
== val
, or last
if no such iterator exists. Definition at line 318 of file stl_algo.h.
References __find(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category().
Referenced by std::money_get< _CharT, _InIter >::_M_extract(), std::num_get< _CharT, _InIter >::_M_extract_float(), std::num_get< _CharT, _InIter >::_M_extract_int(), std::num_get< _CharT, _InIter >::_M_find(), std::num_put< _CharT, _OutIter >::_M_insert_float(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::erase(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::erase(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::find(), find(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::find(), __gnu_cxx::__debug::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >::find(), __gnu_cxx::__debug::hash_multimap< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::find(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::find(), std::basic_string< _CharT, _Traits, _Alloc >::find(), std::basic_string< _CharT, _Traits, _Allocator >::find(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_first_not_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_first_not_of(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_first_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_first_of(), std::basic_string< _CharT, _Traits, _Allocator >::find_first_of(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_last_not_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_last_not_of(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_last_of(), and std::basic_string< _CharT, _Traits, _Alloc >::find_last_of().
_ForwardIterator1 std::find_end | ( | _ForwardIterator1 | __first1, | |
_ForwardIterator1 | __last1, | |||
_ForwardIterator2 | __first2, | |||
_ForwardIterator2 | __last2, | |||
_BinaryPredicate | __comp | |||
) | [inline] |
Find last matching subsequence in a sequence using a predicate.
first1 | Start of range to search. | |
last1 | End of range to search. | |
first2 | Start of sequence to match. | |
last2 | End of sequence to match. | |
comp | The predicate to use. |
i
in the range
[first1,last1-(last2-first2)) such that predicate
(*(i+N),
(first2+N)) is true for each N
in the range
[0,last2-first2), or last1
if no such iterator exists.
[first1,last1) for a sub-sequence that compares equal value-by-value with the sequence given by
[first2,last2) using comp as a predicate and returns an iterator to the first element of the sub-sequence, or last1
if the sub-sequence is not found. The sub-sequence will be the last such subsequence contained in [first,last1).
Because the sub-sequence must lie completely within the range [first1,last1) it must start at a position less than
last1-
(last2-first2) where last2-first2
is the length of the sub-sequence. This means that the returned iterator i
will be in the range [first1,last1-(last2-first2))
Definition at line 5483 of file stl_algo.h.
References __find_end(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category().
_ForwardIterator1 std::find_end | ( | _ForwardIterator1 | __first1, | |
_ForwardIterator1 | __last1, | |||
_ForwardIterator2 | __first2, | |||
_ForwardIterator2 | __last2 | |||
) | [inline] |
Find last matching subsequence in a sequence.
first1 | Start of range to search. | |
last1 | End of range to search. | |
first2 | Start of sequence to match. | |
last2 | End of sequence to match. |
i
in the range
[first1,last1-(last2-first2)) such that *
(i+N) == *
(first2+N) for each N
in the range
[0,last2-first2), or last1
if no such iterator exists.
[first1,last1) for a sub-sequence that compares equal value-by-value with the sequence given by
[first2,last2) and returns an iterator to the first element of the sub-sequence, or last1
if the sub-sequence is not found. The sub-sequence will be the last such subsequence contained in [first,last1).
Because the sub-sequence must lie completely within the range [first1,last1) it must start at a position less than
last1-
(last2-first2) where last2-first2
is the length of the sub-sequence. This means that the returned iterator i
will be in the range [first1,last1-(last2-first2))
Definition at line 5437 of file stl_algo.h.
References __find_end(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category().
_InputIterator std::find_first_of | ( | _InputIterator | __first1, | |
_InputIterator | __last1, | |||
_ForwardIterator | __first2, | |||
_ForwardIterator | __last2, | |||
_BinaryPredicate | __comp | |||
) |
Find element from a set in a sequence using a predicate.
first1 | Start of range to search. | |
last1 | End of range to search. | |
first2 | Start of match candidates. | |
last2 | End of match candidates. | |
comp | Predicate to use. |
i
in the range
[first1,last1) such that comp
(*i, *
(i2)) is true and i2 is an interator in [first2,last2), or last1
if no such iterator exists.
[first1,last1) for an element that is equal to some element in the range [first2,last2). If found, returns an iterator in the range [first1,last1), otherwise returns last1
.
Definition at line 5258 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_first_of(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::find_first_of(), and std::basic_string< _CharT, _Traits, _Allocator >::find_first_of().
_InputIterator std::find_first_of | ( | _InputIterator | __first1, | |
_InputIterator | __last1, | |||
_ForwardIterator | __first2, | |||
_ForwardIterator | __last2 | |||
) |
Find element from a set in a sequence.
first1 | Start of range to search. | |
last1 | End of range to search. | |
first2 | Start of match candidates. | |
last2 | End of match candidates. |
i
in the range
[first1,last1) such that *i
== *
(i2) such that i2 is an interator in [first2,last2), or last1
if no such iterator exists.
[first1,last1) for an element that is equal to some element in the range [first2,last2). If found, returns an iterator in the range [first1,last1), otherwise returns last1
.
Definition at line 5221 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_InputIterator std::find_if | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_Predicate | __pred | |||
) | [inline] |
Find the first element in a sequence for which a predicate is true.
first | An input iterator. | |
last | An input iterator. | |
pred | A predicate. |
i
in the range
[first,last) such that pred(*i)
is true, or last
if no such iterator exists. Definition at line 340 of file stl_algo.h.
References __find_if(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category().
Referenced by remove_if().
ios_base& std::fixed | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::fixed, ios_base::floatfield).
Definition at line 951 of file ios_base.h.
References std::ios_base::setf().
Referenced by std::tr1::operator<<().
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 566 of file ostream.
References std::basic_ostream< _CharT, _Traits >::flush().
Referenced by __gnu_cxx::sequence_buffer< _Sequence, _Buf_sz >::append(), endl(), __gnu_cxx::sequence_buffer< _Sequence, _Buf_sz >::push_back(), and __gnu_cxx::sequence_buffer< _Sequence, _Buf_sz >::~sequence_buffer().
_Function std::for_each | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_Function | __f | |||
) |
Apply a function to every element of a sequence.
first | An input iterator. | |
last | An input iterator. | |
f | A unary function object. |
f
.f
to each element in the range
[first,last). f
must not modify the order of the sequence. If f
has a return value it is ignored.
Definition at line 153 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
front_insert_iterator<_Container> std::front_inserter | ( | _Container & | __x | ) | [inline] |
x | A container of arbitrary type. |
x
.Definition at line 520 of file stl_iterator.h.
void std::generate | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Generator | __gen | |||
) |
Assign the result of a function object to each value in a sequence.
first | A forward iterator. | |
last | A forward iterator. | |
gen | A function object taking no arguments. |
*i
= gen()
for each i
in the range
[first,last).
Definition at line 1125 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_OutputIterator std::generate_n | ( | _OutputIterator | __first, | |
_Size | __n, | |||
_Generator | __gen | |||
) |
Assign the result of a function object to each value in a sequence.
first | A forward iterator. | |
n | The length of the sequence. | |
gen | A function object taking no arguments. |
first+n
*i
= gen()
for each i
in the range
[first,first+n).
Definition at line 1151 of file stl_algo.h.
References __glibcxx_function_requires.
pair<_Tp*, ptrdiff_t> std::get_temporary_buffer | ( | ptrdiff_t | __len | ) | [inline] |
Allocates a temporary buffer.
len | The number of objects of type Tp. |
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 110 of file memory.
References __get_temporary_buffer().
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 | |||
) | [inline] |
Read a line from stream into a string.
is | Input stream. | |
str | Buffer to store into. |
Definition at line 2188 of file vstring.h.
References __gnu_debug::getline(), and std::basic_ios< _CharT, _Traits >::widen().
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. |
Definition at line 619 of file vstring.tcc.
References std::basic_ios< _CharT, _Traits >::_M_setstate(), __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, | |
basic_string< _CharT, _Traits, _Alloc > & | __str | |||
) | [inline] |
Read a line from stream into a string.
is | Input stream. | |
str | Buffer to store into. |
Definition at line 2439 of file basic_string.h.
References __gnu_debug::getline(), and 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. |
Definition at line 934 of file istream.tcc.
References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::ios_base::eofbit, std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::ios_base::failbit, std::ios_base::goodbit, std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().
bool std::has_facet | ( | const locale & | __loc | ) | throw () [inline] |
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 89 of file locale_facets.tcc.
ios_base& std::hex | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::hex, ios_base::basefield).
Definition at line 934 of file ios_base.h.
References std::ios_base::setf().
Referenced by operator<<(), and operator>>().
_Tp std::inner_product | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_Tp | __init, | |||
_BinaryOperation1 | __binary_op1, | |||
_BinaryOperation2 | __binary_op2 | |||
) |
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 167 of file stl_numeric.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_Tp std::inner_product | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_Tp | __init | |||
) |
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 135 of file stl_numeric.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
void std::inplace_merge | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __middle, | |||
_BidirectionalIterator | __last, | |||
_Compare | __comp | |||
) |
Merges two sorted ranges in place.
first | An iterator. | |
middle | Another iterator. | |
last | Another iterator. | |
comp | A functor to use for comparisons. |
If enough additional memory is available, this takes (last-first)-1 comparisons. Otherwise an NlogN algorithm is used, where N is distance(first,last).
The comparison function should have the same effects on ordering as the function used for the initial sort.
Definition at line 3767 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_sorted_pred, __merge_adaptive(), __merge_without_buffer(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), distance(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().
void std::inplace_merge | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __middle, | |||
_BidirectionalIterator | __last | |||
) |
Merges two sorted ranges in place.
first | An iterator. | |
middle | Another iterator. | |
last | Another iterator. |
If enough additional memory is available, this takes (last-first)-1 comparisons. Otherwise an NlogN algorithm is used, where N is distance(first,last).
Definition at line 3713 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_sorted, __merge_adaptive(), __merge_without_buffer(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), distance(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().
insert_iterator<_Container> std::inserter | ( | _Container & | __x, | |
_Iterator | __i | |||
) | [inline] |
x | A container of arbitrary type. |
x
.Definition at line 616 of file stl_iterator.h.
Referenced by std::deque< _Tp, _Alloc >::_M_range_insert_aux().
ios_base& std::internal | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::internal, ios_base::adjustfield).
Definition at line 901 of file ios_base.h.
References std::ios_base::setf().
bool std::isalnum | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::alnum, __c).
Definition at line 4665 of file locale_facets.h.
References std::ctype_base::alnum.
bool std::isalpha | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::alpha, __c).
Definition at line 4641 of file locale_facets.h.
References std::ctype_base::alpha.
bool std::iscntrl | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::cntrl, __c).
Definition at line 4623 of file locale_facets.h.
References std::ctype_base::cntrl.
bool std::isdigit | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::digit, __c).
Definition at line 4647 of file locale_facets.h.
References std::ctype_base::digit.
bool std::isgraph | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::graph, __c).
Definition at line 4671 of file locale_facets.h.
References std::ctype_base::graph.
bool std::islower | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::lower, __c).
Definition at line 4635 of file locale_facets.h.
References std::ctype_base::lower.
bool std::isprint | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::print, __c).
Definition at line 4617 of file locale_facets.h.
References std::ctype_base::print.
bool std::ispunct | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::punct, __c).
Definition at line 4653 of file locale_facets.h.
References std::ctype_base::punct.
bool std::isspace | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::space, __c).
Definition at line 4611 of file locale_facets.h.
References std::ctype_base::space.
bool std::isupper | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::upper, __c).
Definition at line 4629 of file locale_facets.h.
References std::ctype_base::upper.
bool std::isxdigit | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::xdigit, __c).
Definition at line 4659 of file locale_facets.h.
References std::ctype_base::xdigit.
void std::iter_swap | ( | _ForwardIterator1 | __a, | |
_ForwardIterator2 | __b | |||
) | [inline] |
Swaps the contents of two iterators.
a | An iterator. | |
b | Another iterator. |
Definition at line 143 of file stl_algobase.h.
References __glibcxx_function_requires.
Referenced by __introselect(), __merge_without_buffer(), __partition(), __reverse(), __unguarded_partition(), next_permutation(), prev_permutation(), random_shuffle(), and swap_ranges().
ios_base& std::left | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::left, ios_base::adjustfield).
Definition at line 909 of file ios_base.h.
References std::ios_base::setf().
Referenced by __ostream_insert(), and std::tr1::operator<<().
bool std::lexicographical_compare | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_InputIterator2 | __last2, | |||
_Compare | __comp | |||
) |
Performs "dictionary" comparison on ranges.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
last2 | An input iterator. | |
comp | A comparison functor. |
lexigraphical_compare
, but uses the comp parameter instead of <
.
Definition at line 876 of file stl_algobase.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
bool std::lexicographical_compare | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_InputIterator2 | __last2 | |||
) |
Performs "dictionary" comparison on ranges.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
last2 | An input iterator. |
memcmp
.
Definition at line 835 of file stl_algobase.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by lexicographical_compare(), operator<(), __gnu_cxx::operator<(), and std::tr1::operator<().
void std::make_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Construct a heap over a range using comparison functor.
first | Start of heap. | |
last | End of heap. | |
comp | Comparison functor to use. |
Definition at line 384 of file stl_heap.h.
References __adjust_heap(), __glibcxx_function_requires, and __glibcxx_requires_valid_range.
void std::make_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) |
Construct a heap over a range.
first | Start of heap. | |
last | End of heap. |
Definition at line 344 of file stl_heap.h.
References __adjust_heap(), __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by __heap_select(), partial_sort_copy(), and std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue().
pair<_T1, _T2> std::make_pair | ( | _T1 | __x, | |
_T2 | __y | |||
) | [inline] |
A convenience wrapper for creating a pair from two objects.
x | The first object. | |
y | The second object. |
Definition at line 144 of file stl_pair.h.
Referenced by __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_get_distance(), std::tr1::__detail::_Prime_rehash_policy::_M_need_rehash(), std::__debug::set< _Key, _Compare, _Allocator >::equal_range(), std::__debug::multiset< _Key, _Compare, _Allocator >::equal_range(), std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >::equal_range(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::equal_range(), std::tr1::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::equal_range(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_multimap< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::insert(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::insert(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::insert_noresize(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::insert_noresize(), and std::tr1::__detail::_Map_base< _Key, _Pair, std::_Select1st< _Pair >, true, _Hashtable >::operator[]().
const _Tp& std::max | ( | const _Tp & | __a, | |
const _Tp & | __b, | |||
_Compare | __comp | |||
) | [inline] |
This does what you think it does.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. | |
comp | A comparison functor. |
Definition at line 246 of file stl_algobase.h.
Referenced by __get_temporary_buffer(), std::num_get< _CharT, _InIter >::_M_extract_int(), std::basic_istream< _CharT, _Traits >::ignore(), and operator>>().
const _Tp& std::max | ( | const _Tp & | __a, | |
const _Tp & | __b | |||
) | [inline] |
This does what you think it does.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. |
Definition at line 204 of file stl_algobase.h.
References __glibcxx_function_requires.
Referenced by std::tr1::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::_Hashtable(), std::vector< _Tp, _Alloc >::_M_fill_insert(), std::vector< bool, _Alloc >::_M_fill_insert(), std::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), std::vector< bool, _Alloc >::_M_insert_range(), std::tr1::__detail::_Prime_rehash_policy::_M_need_rehash(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::deque< _Tp, _Alloc >::_M_reallocate_map(), __gnu_cxx::rope< _CharT, _Alloc >::_S_apply_to_pieces(), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(), and std::tr1::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::rehash().
_ForwardIterator std::max_element | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Compare | __comp | |||
) |
Return the maximum element in a range using comparison functor.
first | Start of range. | |
last | End of range. | |
comp | Comparison functor. |
Definition at line 4908 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_ForwardIterator std::max_element | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last | |||
) |
Return the maximum element in a range.
first | Start of range. | |
last | End of range. |
Definition at line 4881 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by std::valarray< _Tp >::max().
_OutputIterator std::merge | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_InputIterator2 | __last2, | |||
_OutputIterator | __result, | |||
_Compare | __comp | |||
) |
Merges two sorted ranges.
first1 | An iterator. | |
first2 | Another iterator. | |
last1 | Another iterator. | |
last2 | Another iterator. | |
result | An iterator pointing to the end of the merged range. | |
comp | A functor to use for comparisons. |
The comparison function should have the same effects on ordering as the function used for the initial sort.
Definition at line 3291 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_sorted_pred.
Referenced by std::__debug::list< _Tp, _Allocator >::merge().
_OutputIterator std::merge | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_InputIterator2 | __last2, | |||
_OutputIterator | __result | |||
) |
Merges two sorted ranges.
first1 | An iterator. | |
first2 | Another iterator. | |
last1 | Another iterator. | |
last2 | Another iterator. | |
result | An iterator pointing to the end of the merged range. |
Definition at line 3230 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_sorted.
Referenced by __merge_adaptive(), and __merge_sort_loop().
const _Tp& std::min | ( | const _Tp & | __a, | |
const _Tp & | __b, | |||
_Compare | __comp | |||
) | [inline] |
This does what you think it does.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. | |
comp | A comparison functor. |
Definition at line 226 of file stl_algobase.h.
Referenced by __gnu_cxx::__lexicographical_compare_3way(), std::num_get< _CharT, _InIter >::_M_extract_int(), std::basic_istream< _CharT, _Traits >::ignore(), and __gnu_cxx::random_sample_n().
const _Tp& std::min | ( | const _Tp & | __a, | |
const _Tp & | __b | |||
) | [inline] |
This does what you think it does.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. |
Definition at line 182 of file stl_algobase.h.
References __glibcxx_function_requires.
Referenced by __merge_sort_loop(), __verify_grouping(), std::bitset< _Nb >::_M_copy_from_string(), std::time_get< _CharT, _InIter >::_M_extract_name(), __gnu_cxx::rope< _CharT, _Alloc >::_S_apply_to_pieces(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::compare(), std::basic_string< _CharT, _Traits, _Alloc >::compare(), std::basic_string< _CharT, _Traits, _Allocator >::compare(), lexicographical_compare(), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(), std::basic_istream< _CharT, _Traits >::readsome(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::rfind(), std::basic_string< _CharT, _Traits, _Alloc >::rfind(), std::basic_filebuf< _CharT, _Traits >::underflow(), std::basic_streambuf< _CharT, _Traits >::xsgetn(), std::basic_streambuf< _CharT, _Traits >::xsputn(), and std::basic_filebuf< _CharT, _Traits >::xsputn().
_ForwardIterator std::min_element | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Compare | __comp | |||
) |
Return the minimum element in a range using comparison functor.
first | Start of range. | |
last | End of range. | |
comp | Comparison functor. |
Definition at line 4960 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_ForwardIterator std::min_element | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last | |||
) |
Return the minimum element in a range.
first | Start of range. | |
last | End of range. |
Definition at line 4933 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by std::valarray< _Tp >::min().
pair<_InputIterator1, _InputIterator2> std::mismatch | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_BinaryPredicate | __binary_pred | |||
) |
Finds the places in ranges which don't match.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
binary_pred | A binary predicate functor. |
Definition at line 742 of file stl_algobase.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
pair<_InputIterator1, _InputIterator2> std::mismatch | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2 | |||
) |
Finds the places in ranges which don't match.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. |
==
and returns a pair of iterators. The first iterator points into the first range, the second iterator points into the second range, and the elements pointed to by the iterators are not equal.
Definition at line 706 of file stl_algobase.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
bool std::next_permutation | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last, | |||
_Compare | __comp | |||
) |
Permute range into the next "dictionary" ordering using comparison functor.
first | Start of range. | |
last | End of range. | |
comp |
Definition at line 5051 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse().
bool std::next_permutation | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last | |||
) |
Permute range into the next "dictionary" ordering.
first | Start of range. | |
last | End of range. |
Definition at line 4995 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse().
ios_base& std::noboolalpha | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::boolalpha).
Definition at line 796 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 812 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 828 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 844 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 860 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 892 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 876 of file ios_base.h.
References std::ios_base::unsetf(), and uppercase().
void std::nth_element | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __nth, | |||
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Sort a sequence just enough to find a particular position using a predicate for comparison.
first | An iterator. | |
nth | Another iterator. | |
last | Another iterator. | |
comp | A comparison functor. |
[first,last) so that *nth
is the same element that would have been in that position had the whole sequence been sorted. The elements either side of *nth
are not completely sorted, but for any iterator in the range
[first,nth) and any iterator in the range
[nth,last) it holds that comp(*j,*i)
is false.
Definition at line 4070 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __introselect(), and __lg().
void std::nth_element | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __nth, | |||
_RandomAccessIterator | __last | |||
) | [inline] |
Sort a sequence just enough to find a particular position.
first | An iterator. | |
nth | Another iterator. | |
last | Another iterator. |
[first,last) so that *nth
is the same element that would have been in that position had the whole sequence been sorted. whole sequence been sorted. The elements either side of *nth
are not completely sorted, but for any iterator in the range
[first,nth) and any iterator in the range
[nth,last) it holds that *j<*i
is false.
Definition at line 4032 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __introselect(), and __lg().
ios_base& std::oct | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::oct, ios_base::basefield).
Definition at line 942 of file ios_base.h.
References std::ios_base::setf().
Referenced by operator<<(), and operator>>().
bitset<_Nb> std::operator & | ( | const bitset< _Nb > & | __x, | |
const bitset< _Nb > & | __y | |||
) | [inline] |
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 135 of file stream_iterator.h.
References std::istream_iterator< _Tp, _CharT, _Traits, _Dist >::_M_equal().
bool std::operator!= | ( | const vector< _Tp, _Alloc > & | __x, | |
const vector< _Tp, _Alloc > & | __y | |||
) | [inline] |
bool std::operator!= | ( | const stack< _Tp, _Seq > & | __x, | |
const stack< _Tp, _Seq > & | __y | |||
) | [inline] |
bool std::operator!= | ( | const set< _Key, _Compare, _Alloc > & | __x, | |
const set< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator!= | ( | const queue< _Tp, _Seq > & | __x, | |
const queue< _Tp, _Seq > & | __y | |||
) | [inline] |
bool std::operator!= | ( | const pair< _T1, _T2 > & | __x, | |
const pair< _T1, _T2 > & | __y | |||
) | [inline] |
bool std::operator!= | ( | const multiset< _Key, _Compare, _Alloc > & | __x, | |
const multiset< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator!= | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, | |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator!= | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, | |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator!= | ( | const list< _Tp, _Alloc > & | __x, | |
const list< _Tp, _Alloc > & | __y | |||
) | [inline] |
bool std::operator!= | ( | const deque< _Tp, _Alloc > & | __x, | |
const deque< _Tp, _Alloc > & | __y | |||
) | [inline] |
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 2203 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 difference of C string and string.
lhs | C string. | |
rhs | String. |
Definition at line 2191 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2179 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2124 of file basic_string.h.
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 2108 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::append().
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 690 of file basic_string.tcc.
References std::basic_string< _CharT, _Traits, _Alloc >::size().
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 674 of file basic_string.tcc.
References __glibcxx_requires_string, and std::basic_string< _CharT, _Traits, _Alloc >::size().
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 2071 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::append().
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. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 956 of file stl_vector.h.
References lexicographical_compare().
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. |
<
, and std::lexicographical_compare() is usually used to make the determination.
Definition at line 232 of file stl_stack.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. |
<
.See std::lexicographical_compare() for how the determination is made.
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. |
<
, and std::lexicographical_compare() is usually used to make the determination.
Definition at line 257 of file stl_queue.h.
bool std::operator< | ( | const pair< _T1, _T2 > & | __x, | |
const pair< _T1, _T2 > & | __y | |||
) | [inline] |
<http://gcc.gnu.org/onlinedocs/libstdc++/20_util/howto.html#pairlt>
Definition at line 102 of file stl_pair.h.
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. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 524 of file stl_multiset.h.
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. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 629 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. |
<
.See std::lexicographical_compare() for how the determination is made.
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. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 1225 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. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 1567 of file stl_deque.h.
References lexicographical_compare().
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 2240 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 2228 of file basic_string.h.
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 2216 of file basic_string.h.
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. |
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 495 of file ostream.
References __ostream_insert(), and std::basic_ios< _CharT, _Traits >::setstate().
basic_ostream<_CharT, _Traits>& std::operator<< | ( | basic_ostream< _CharT, _Traits > & | __out, | |
_CharT | __c | |||
) | [inline] |
Character inserters.
out | An output stream. | |
c | A character. |
out.width(0)
is then called.
If c is of type char
and the character type of the stream is not char
, the character is widened before insertion.
Definition at line 453 of file ostream.
References __ostream_insert().
basic_ostream<_CharT, _Traits>& std::operator<< | ( | basic_ostream< _CharT, _Traits > & | __os, | |
const __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > & | __str | |||
) | [inline] |
Write string to a stream.
os | Output stream. | |
str | String to write out. |
Definition at line 2144 of file vstring.h.
References __ostream_insert().
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. |
Definition at line 2399 of file basic_string.h.
References __ostream_insert().
bool std::operator<= | ( | const vector< _Tp, _Alloc > & | __x, | |
const vector< _Tp, _Alloc > & | __y | |||
) | [inline] |
bool std::operator<= | ( | const stack< _Tp, _Seq > & | __x, | |
const stack< _Tp, _Seq > & | __y | |||
) | [inline] |
bool std::operator<= | ( | const set< _Key, _Compare, _Alloc > & | __x, | |
const set< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator<= | ( | const queue< _Tp, _Seq > & | __x, | |
const queue< _Tp, _Seq > & | __y | |||
) | [inline] |
bool std::operator<= | ( | const pair< _T1, _T2 > & | __x, | |
const pair< _T1, _T2 > & | __y | |||
) | [inline] |
bool std::operator<= | ( | const multiset< _Key, _Compare, _Alloc > & | __x, | |
const multiset< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator<= | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, | |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator<= | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, | |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator<= | ( | const list< _Tp, _Alloc > & | __x, | |
const list< _Tp, _Alloc > & | __y | |||
) | [inline] |
bool std::operator<= | ( | const deque< _Tp, _Alloc > & | __x, | |
const deque< _Tp, _Alloc > & | __y | |||
) | [inline] |
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 2314 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 2302 of file basic_string.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 2290 of file basic_string.h.
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 128 of file stream_iterator.h.
References std::istream_iterator< _Tp, _CharT, _Traits, _Dist >::_M_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. |
Definition at line 939 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 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. |
Definition at line 214 of file stl_stack.h.
References std::stack< _Tp, _Sequence >::c.
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. |
Definition at line 521 of file stl_set.h.
References std::set< _Key, _Compare, _Alloc >::_M_t.
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. |
Definition at line 239 of file stl_queue.h.
References std::queue< _Tp, _Sequence >::c.
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 96 of file stl_pair.h.
References std::pair< _T1, _T2 >::first, and std::pair< _T1, _T2 >::second.
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. |
Definition at line 507 of file stl_multiset.h.
References std::multiset< _Key, _Compare, _Alloc >::_M_t.
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. |
Definition at line 612 of file stl_multimap.h.
References std::multimap< _Key, _Tp, _Compare, _Alloc >::_M_t.
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. |
Definition at line 682 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::_M_t.
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. |
Definition at line 1196 of file stl_list.h.
References std::list< _Tp, _Alloc >::begin(), and std::list< _Tp, _Alloc >::end().
bool std::operator== | ( | const reverse_iterator< _Iterator > & | __x, | |
const reverse_iterator< _Iterator > & | __y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 282 of file stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
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. |
Definition at line 1549 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 fpos< _StateT > & | __lhs, | |
const fpos< _StateT > & | __rhs | |||
) | [inline] |
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 2166 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 2154 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2142 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
bool std::operator> | ( | const vector< _Tp, _Alloc > & | __x, | |
const vector< _Tp, _Alloc > & | __y | |||
) | [inline] |
bool std::operator> | ( | const stack< _Tp, _Seq > & | __x, | |
const stack< _Tp, _Seq > & | __y | |||
) | [inline] |
bool std::operator> | ( | const set< _Key, _Compare, _Alloc > & | __x, | |
const set< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator> | ( | const queue< _Tp, _Seq > & | __x, | |
const queue< _Tp, _Seq > & | __y | |||
) | [inline] |
bool std::operator> | ( | const pair< _T1, _T2 > & | __x, | |
const pair< _T1, _T2 > & | __y | |||
) | [inline] |
bool std::operator> | ( | const multiset< _Key, _Compare, _Alloc > & | __x, | |
const multiset< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator> | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, | |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator> | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, | |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator> | ( | const list< _Tp, _Alloc > & | __x, | |
const list< _Tp, _Alloc > & | __y | |||
) | [inline] |
bool std::operator> | ( | const deque< _Tp, _Alloc > & | __x, | |
const deque< _Tp, _Alloc > & | __y | |||
) | [inline] |
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 2277 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 2265 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2253 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
bool std::operator>= | ( | const vector< _Tp, _Alloc > & | __x, | |
const vector< _Tp, _Alloc > & | __y | |||
) | [inline] |
bool std::operator>= | ( | const stack< _Tp, _Seq > & | __x, | |
const stack< _Tp, _Seq > & | __y | |||
) | [inline] |
bool std::operator>= | ( | const set< _Key, _Compare, _Alloc > & | __x, | |
const set< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator>= | ( | const queue< _Tp, _Seq > & | __x, | |
const queue< _Tp, _Seq > & | __y | |||
) | [inline] |
bool std::operator>= | ( | const pair< _T1, _T2 > & | __x, | |
const pair< _T1, _T2 > & | __y | |||
) | [inline] |
bool std::operator>= | ( | const multiset< _Key, _Compare, _Alloc > & | __x, | |
const multiset< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator>= | ( | const multimap< _Key, _Tp, _Compare, _Alloc > & | __x, | |
const multimap< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator>= | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x, | |
const map< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
bool std::operator>= | ( | const list< _Tp, _Alloc > & | __x, | |
const list< _Tp, _Alloc > & | __y | |||
) | [inline] |
bool std::operator>= | ( | const deque< _Tp, _Alloc > & | __x, | |
const deque< _Tp, _Alloc > & | __y | |||
) | [inline] |
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 2351 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 2339 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 2327 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::compare().
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 1230 of file bitset.
References std::bitset< _Nb >::_M_copy_from_string(), std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::basic_string< _CharT, _Traits, _Alloc >::empty(), std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_string< _CharT, _Traits, _Alloc >::push_back(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_string< _CharT, _Traits, _Alloc >::reserve(), std::basic_streambuf< _CharT, _Traits >::sbumpc(), std::basic_ios< _CharT, _Traits >::setstate(), std::basic_streambuf< _CharT, _Traits >::sputbackc(), 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. |
Definition at line 550 of file vstring.tcc.
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. |
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 char_type
that can store a terminating 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 788 of file istream.tcc.
References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::getloc(), std::ios_base::goodbit, max(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), std::ctype_base::space, and std::ios_base::width().
basic_istream< _CharT, _Traits > & std::operator>> | ( | basic_istream< _CharT, _Traits > & | __in, | |
_CharT & | __c | |||
) |
Character extractors.
in | An input stream. | |
c | A character reference. |
Definition at line 761 of file istream.tcc.
References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().
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. |
Definition at line 868 of file istream.tcc.
References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::basic_string< _CharT, _Traits, _Alloc >::append(), std::ios_base::badbit, std::ios_base::eofbit, std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::ios_base::failbit, std::ios_base::getloc(), std::ios_base::goodbit, std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), std::ctype_base::space, 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] |
void std::partial_sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __middle, | |||
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Sort the smallest elements of a sequence using a predicate for comparison.
first | An iterator. | |
middle | Another iterator. | |
last | Another iterator. | |
comp | A comparison functor. |
(middle-first) elements in the range
[first,last) and moves them to the range
[first,middle). The order of the remaining elements in the range
[middle,last) is undefined. After the sort if i
and are iterators in the range
[first,middle) such that precedes and is an iterator in the range
[middle,last) then *comp
(j,*i) and comp(*k,*i)
are both false.
Definition at line 2575 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __heap_select(), and sort_heap().
void std::partial_sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __middle, | |||
_RandomAccessIterator | __last | |||
) | [inline] |
Sort the smallest elements of a sequence.
first | An iterator. | |
middle | Another iterator. | |
last | Another iterator. |
(middle-first) elements in the range
[first,last) and moves them to the range
[first,middle). The order of the remaining elements in the range
[middle,last) is undefined. After the sort if i
and are iterators in the range
[first,middle) such that precedes and is an iterator in the range
[middle,last) then *j<*i
and *k<*i
are both false.
Definition at line 2537 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __heap_select(), and sort_heap().
Referenced by __introsort_loop().
_RandomAccessIterator std::partial_sort_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_RandomAccessIterator | __result_first, | |||
_RandomAccessIterator | __result_last, | |||
_Compare | __comp | |||
) |
Copy the smallest elements of a sequence using a predicate for comparison.
first | An input iterator. | |
last | Another input iterator. | |
result_first | A random-access iterator. | |
result_last | Another random-access iterator. | |
comp | A comparison functor. |
[first,last) to the range beginning at result_first
, where the number of elements to be copied, N
, is the smaller of
(last-first) and
(result_last-result_first). After the sort if i
and are iterators in the range
[result_first,result_first+N) such that precedes then comp(*j,*i)
is false. The value returned is result_first+N
.
Definition at line 2679 of file stl_algo.h.
References __adjust_heap(), __glibcxx_function_requires, __glibcxx_requires_valid_range, make_heap(), and sort_heap().
_RandomAccessIterator std::partial_sort_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_RandomAccessIterator | __result_first, | |||
_RandomAccessIterator | __result_last | |||
) |
Copy the smallest elements of a sequence.
first | An iterator. | |
last | Another iterator. | |
result_first | A random-access iterator. | |
result_last | Another random-access iterator. |
[first,last) to the range beginning at result_first
, where the number of elements to be copied, N
, is the smaller of
(last-first) and
(result_last-result_first). After the sort if i
and are iterators in the range
[result_first,result_first+N) such that precedes then *j<*i
is false. The value returned is result_first+N
.
Definition at line 2614 of file stl_algo.h.
References __adjust_heap(), __glibcxx_function_requires, __glibcxx_requires_valid_range, make_heap(), and sort_heap().
_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 238 of file stl_numeric.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_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 198 of file stl_numeric.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_ForwardIterator std::partition | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Predicate | __pred | |||
) | [inline] |
Move elements for which a predicate is true to the beginning of a sequence.
first | A forward iterator. | |
last | A forward iterator. | |
pred | A predicate functor. |
middle
such that pred(i)
is true for each iterator i
in the range
[first,middle) and false for each i
in the range
[middle,last).pred
must not modify its operand. partition()
does not preserve the relative ordering of elements in each group, use stable_partition()
if this is needed.
Definition at line 2097 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __partition().
void std::pop_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Pop an element off a heap using comparison functor.
first | Start of heap. | |
last | End of heap. | |
comp | Comparison functor to use. |
Definition at line 319 of file stl_heap.h.
References __glibcxx_function_requires, __glibcxx_requires_heap_pred, __glibcxx_requires_valid_range, and __pop_heap().
void std::pop_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Pop an element off a heap.
first | Start of heap. | |
last | End of heap. |
Definition at line 253 of file stl_heap.h.
References __glibcxx_function_requires, __glibcxx_requires_heap, __glibcxx_requires_valid_range, and __pop_heap().
Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::pop(), and sort_heap().
bool std::prev_permutation | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last, | |||
_Compare | __comp | |||
) |
Permute range into the previous "dictionary" ordering using comparison functor.
first | Start of range. | |
last | End of range. | |
comp |
Definition at line 5162 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse().
bool std::prev_permutation | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last | |||
) |
Permute range into the previous "dictionary" ordering.
first | Start of range. | |
last | End of range. |
Definition at line 5106 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse().
void std::push_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Push an element onto a heap using comparison functor.
first | Start of heap. | |
last | End of heap + element. | |
comp | Comparison functor. |
Definition at line 189 of file stl_heap.h.
References __glibcxx_function_requires, __glibcxx_requires_heap_pred, __glibcxx_requires_valid_range, and __push_heap().
void std::push_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Push an element onto a heap.
first | Start of heap. | |
last | End of heap + element. |
Definition at line 141 of file stl_heap.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and __push_heap().
Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::push().
void std::random_shuffle | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_RandomNumberGenerator & | __rand | |||
) |
Shuffle the elements of a sequence using a random number generator.
first | A forward iterator. | |
last | A forward iterator. | |
rand | The RNG functor or function. |
[first,last) using rand
to provide a random distribution. Calling rand(N)
for a positive integer N
should return a randomly chosen integer from the range [0,N).
Definition at line 2003 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and iter_swap().
void std::random_shuffle | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Randomly shuffle the elements of a sequence.
first | A forward iterator. | |
last | A forward iterator. |
[first,last) using a random distribution, so that every possible ordering of the sequence is equally likely.
Definition at line 1976 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and iter_swap().
_ForwardIterator std::remove | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __value | |||
) |
Remove elements from a sequence.
first | An input iterator. | |
last | An input iterator. | |
value | The value to be removed. |
value
are removed from the range
[first,last).remove() is stable, so the relative order of elements that are not removed is unchanged.
Elements between the end of the resulting sequence and last
are still present, but their value is unspecified.
Definition at line 1253 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, find(), and remove_copy().
_OutputIterator std::remove_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
const _Tp & | __value | |||
) |
Copy a sequence, removing elements of a given value.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
value | The value to be removed. |
[first,last) not equal to value
to the range beginning at result
. remove_copy() is stable, so the relative order of elements that are copied is unchanged.
Definition at line 1178 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by remove().
_OutputIterator std::remove_copy_if | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
_Predicate | __pred | |||
) |
Copy a sequence, removing elements for which a predicate is true.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
pred | A predicate. |
[first,last) for which pred
returns true to the range beginning at result
.remove_copy_if() is stable, so the relative order of elements that are copied is unchanged.
Definition at line 1215 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by remove_if().
_ForwardIterator std::remove_if | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Predicate | __pred | |||
) |
Remove elements from a sequence using a predicate.
first | A forward iterator. | |
last | A forward iterator. | |
pred | A predicate. |
pred
returns true are removed from the range
[first,last).remove_if() is stable, so the relative order of elements that are not removed is unchanged.
Elements between the end of the resulting sequence and last
are still present, but their value is unspecified.
Definition at line 1288 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, find_if(), and remove_copy_if().
void std::replace | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __old_value, | |||
const _Tp & | __new_value | |||
) |
Replace each occurrence of one value in a sequence with another value.
first | A forward iterator. | |
last | A forward iterator. | |
old_value | The value to be replaced. | |
new_value | The replacement value. |
i
in the range
[first,last) if *i
== old_value
then the assignment *i
= new_value
is performed.
Definition at line 991 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
Referenced by __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::append(), std::basic_string< _CharT, _Traits, _Allocator >::append(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::assign(), std::basic_string< _CharT, _Traits, _Allocator >::assign(), __gnu_cxx::rope< _CharT, _Alloc >::erase(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::insert(), __gnu_cxx::rope< _CharT, _Alloc >::insert(), std::basic_string< _CharT, _Traits, _Allocator >::insert(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::replace(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::replace(), __gnu_cxx::rope< _CharT, _Alloc >::replace(), and std::basic_string< _CharT, _Traits, _Allocator >::replace().
_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).
[first,last) to the output range
[result,result+(last-first)) replacing elements equal to old_value
with new_value
.
Definition at line 1055 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_OutputIterator std::replace_copy_if | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
_Predicate | __pred, | |||
const _Tp & | __new_value | |||
) |
Copy a sequence, replacing each value for which a predicate returns true with another value.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
pred | A predicate. | |
new_value | The replacement value. |
result+
(last-first).
[first,last) to the range
[result,result+(last-first)) replacing elements for which pred
returns true with new_value
.
Definition at line 1092 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
void std::replace_if | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Predicate | __pred, | |||
const _Tp & | __new_value | |||
) |
Replace each value in a sequence for which a predicate returns true with another value.
first | A forward iterator. | |
last | A forward iterator. | |
pred | A predicate. | |
new_value | The replacement value. |
i
in the range
[first,last) if pred(*i)
is true then the assignment *i
= new_value
is performed.
Definition at line 1022 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_Resetiosflags std::resetiosflags | ( | ios_base::fmtflags | __mask | ) | [inline] |
Manipulator for setf
.
mask | A format flags mask. |
Definition at line 63 of file iomanip.
References std::_Resetiosflags::_M_mask.
void std::return_temporary_buffer | ( | _Tp * | __p | ) |
The companion to get_temporary_buffer().
p | A buffer previously allocated by get_temporary_buffer. |
Definition at line 122 of file memory.
Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::~_Temporary_buffer().
void std::reverse | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last | |||
) | [inline] |
Reverse a sequence.
first | A bidirectional iterator. | |
last | A bidirectional iterator. |
[first,last), so that the first element becomes the last etc. For every i
such that 0<=i<=
(last-first)/2), reverse()
swaps *
(first+i) and *
(last-(i+1))
Definition at line 1684 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __reverse().
Referenced by next_permutation(), and prev_permutation().
_OutputIterator std::reverse_copy | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last, | |||
_OutputIterator | __result | |||
) |
Copy a sequence, reversing its elements.
first | A bidirectional iterator. | |
last | A bidirectional iterator. | |
result | An output iterator. |
[first,last) to the range
[result,result+(last-first)) such that the order of the elements is reversed. For every i
such that 0<=i<=
(last-first), reverse_copy()
performs the assignment *
(result+(last-first)-i) = *(first+i). The ranges
[first,last) and
[result,result+(last-first)) must not overlap.
Definition at line 1710 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
ios_base& std::right | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::right, ios_base::adjustfield).
Definition at line 917 of file ios_base.h.
References std::ios_base::setf().
void std::rotate | ( | _ForwardIterator | __first, | |
_ForwardIterator | __middle, | |||
_ForwardIterator | __last | |||
) | [inline] |
Rotate the elements of a sequence.
first | A forward iterator. | |
middle | A forward iterator. | |
last | A forward iterator. |
[first,last) by
(middle-first) positions so that the element at middle
is moved to first
, the element at middle+1
is moved to +1 and so on for each element in the range
[first,last).
This effectively swaps the ranges [first,middle) and
[middle,last).
Performs *
(first+(n+(last-middle))%(last-first))=*(first+n) for each n
in the range [0,last-first).
Definition at line 1917 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and __rotate().
Referenced by __inplace_stable_partition(), __merge_without_buffer(), __rotate_adaptive(), and __stable_partition_adaptive().
_OutputIterator std::rotate_copy | ( | _ForwardIterator | __first, | |
_ForwardIterator | __middle, | |||
_ForwardIterator | __last, | |||
_OutputIterator | __result | |||
) |
Copy a sequence, rotating its elements.
first | A forward iterator. | |
middle | A forward iterator. | |
last | A forward iterator. | |
result | An output iterator. |
[first,last) to the range beginning at
(middle-first) positions so that the element at middle
is moved to result
, the element at middle+1
is moved to
+1 and so on for each element in the range [first,last).
*
(result+(n+(last-middle))%(last-first))=*(first+n) for each n
in the range
[0,last-first).
Definition at line 1950 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
ios_base& std::scientific | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::scientific, ios_base::floatfield).
Definition at line 959 of file ios_base.h.
References std::ios_base::setf().
Referenced by std::tr1::operator<<().
_ForwardIterator1 std::search | ( | _ForwardIterator1 | __first1, | |
_ForwardIterator1 | __last1, | |||
_ForwardIterator2 | __first2, | |||
_ForwardIterator2 | __last2, | |||
_BinaryPredicate | __predicate | |||
) |
Search a sequence for a matching sub-sequence using a predicate.
first1 | A forward iterator. | |
last1 | A forward iterator. | |
first2 | A forward iterator. | |
last2 | A forward iterator. | |
predicate | A binary predicate. |
i
in the range
[first1,last1-(last2-first2)) such that predicate
(*(i+N),*(first2+N)) is true for each N
in the range
[0,last2-first2), or last1
if no such iterator exists.
[first1,last1) for a sub-sequence that compares equal value-by-value with the sequence given by
[first2,last2), using predicate
to determine equality, and returns an iterator to the first element of the sub-sequence, or last1
if no such iterator exists.
Definition at line 559 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_ForwardIterator1 std::search | ( | _ForwardIterator1 | __first1, | |
_ForwardIterator1 | __last1, | |||
_ForwardIterator2 | __first2, | |||
_ForwardIterator2 | __last2 | |||
) |
Search a sequence for a matching sub-sequence.
first1 | A forward iterator. | |
last1 | A forward iterator. | |
first2 | A forward iterator. | |
last2 | A forward iterator. |
i
in the range
[first1,last1-(last2-first2)) such that *
(i+N) == *
(first2+N) for each N
in the range
[0,last2-first2), or last1
if no such iterator exists.
[first1,last1) for a sub-sequence that compares equal value-by-value with the sequence given by
[first2,last2) and returns an iterator to the first element of the sub-sequence, or last1
if the sub-sequence is not found.
Because the sub-sequence must lie completely within the range [first1,last1) it must start at a position less than
last1-
(last2-first2) where last2-first2
is the length of the sub-sequence. This means that the returned iterator i
will be in the range [first1,last1-(last2-first2))
Definition at line 487 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and find().
Referenced by __find_end(), and __gnu_cxx::rope< _CharT, _Alloc >::find().
_ForwardIterator std::search_n | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Integer | __count, | |||
const _Tp & | __val, | |||
_BinaryPredicate | __binary_pred | |||
) |
Search a sequence for a number of consecutive values using a predicate.
first | A forward iterator. | |
last | A forward iterator. | |
count | The number of consecutive values. | |
val | The value to find. | |
binary_pred | A binary predicate. |
i
in the range
[first,last-count) such that binary_pred
(*(i+N),val) is true for each N
in the range
[0,count), or last
if no such iterator exists.
[first,last) for count
consecutive elements for which the predicate returns true.
Definition at line 851 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __search_n().
_ForwardIterator std::search_n | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Integer | __count, | |||
const _Tp & | __val | |||
) |
Search a sequence for a number of consecutive values.
first | A forward iterator. | |
last | A forward iterator. | |
count | The number of consecutive values. | |
val | The value to find. |
i
in the range
[first,last-count) such that *
(i+N) == val
for each N
in the range
[0,count), or last
if no such iterator exists.
[first,last) for count
consecutive elements equal to val
.
Definition at line 722 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), __search_n(), and find().
new_handler std::set_new_handler | ( | new_handler | ) | throw () |
previous handler.
terminate_handler std::set_terminate | ( | terminate_handler | ) | throw () |
Takes a new handler function as an argument, returns the old function.
unexpected_handler std::set_unexpected | ( | unexpected_handler | ) | throw () |
Takes a new handler function as an argument, returns the old function.
_Setbase std::setbase | ( | int | __base | ) | [inline] |
Manipulator for setf
.
base | A numeric base. |
ios_base::basefield
flags to oct
, dec
, or hex
when base is 8, 10, or 16, accordingly, and to 0 if base is any other value.
Definition at line 132 of file iomanip.
References std::_Setbase::_M_base.
_Setfill<_CharT> std::setfill | ( | _CharT | __c | ) | [inline] |
Manipulator for fill
.
c | The new fill character. |
fill(c)
for that object.
Definition at line 174 of file iomanip.
References std::_Setfill< _CharT >::_M_c.
_Setiosflags std::setiosflags | ( | ios_base::fmtflags | __mask | ) | [inline] |
Manipulator for setf
.
mask | A format flags mask. |
Definition at line 97 of file iomanip.
References std::_Setiosflags::_M_mask.
_Setprecision std::setprecision | ( | int | __n | ) | [inline] |
Manipulator for precision
.
n | The new precision. |
precision(n)
for that object.
Definition at line 208 of file iomanip.
References std::_Setprecision::_M_n.
_Setw std::setw | ( | int | __n | ) | [inline] |
Manipulator for width
.
n | The new width. |
width(n)
for that object.
Definition at line 242 of file iomanip.
References std::_Setw::_M_n.
ios_base& std::showbase | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showbase).
Definition at line 804 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 820 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 836 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 852 of file ios_base.h.
References std::ios_base::setf().
Referenced by noskipws(), std::tr1::operator>>(), and std::basic_istream< _CharT, _Traits >::sentry::sentry().
void std::sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Sort the elements of a sequence using a predicate for comparison.
first | An iterator. | |
last | Another iterator. | |
comp | A comparison functor. |
[first,last) in ascending order, such that comp
(*(i+1),*i) is false for every iterator i
in the range
[first,last-1).
The relative ordering of equivalent elements is not preserved, use stable_sort()
if this is needed.
Definition at line 2851 of file stl_algo.h.
References __final_insertion_sort(), __glibcxx_function_requires, __glibcxx_requires_valid_range, __introsort_loop(), and __lg().
Referenced by std::__debug::list< _Tp, _Allocator >::sort().
void std::sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Sort the elements of a sequence.
first | An iterator. | |
last | Another iterator. |
[first,last) in ascending order, such that *
(i+1)<*i is false for each iterator i
in the range
[first,last-1).
The relative ordering of equivalent elements is not preserved, use stable_sort()
if this is needed.
Definition at line 2816 of file stl_algo.h.
References __final_insertion_sort(), __glibcxx_function_requires, __glibcxx_requires_valid_range, __introsort_loop(), and __lg().
void std::sort_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) |
Sort a heap using comparison functor.
first | Start of heap. | |
last | End of heap. | |
comp | Comparison functor to use. |
Definition at line 448 of file stl_heap.h.
References __glibcxx_function_requires, __glibcxx_requires_heap_pred, __glibcxx_requires_valid_range, and pop_heap().
void std::sort_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) |
Sort a heap.
first | Start of heap. | |
last | End of heap. |
Definition at line 422 of file stl_heap.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and pop_heap().
Referenced by partial_sort(), and partial_sort_copy().
_ForwardIterator std::stable_partition | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Predicate | __pred | |||
) |
Move elements for which a predicate is true to the beginning of a sequence, preserving relative ordering.
first | A forward iterator. | |
last | A forward iterator. | |
pred | A predicate functor. |
middle
such that pred(i)
is true for each iterator i
in the range
[first,middle) and false for each i
in the range
[middle,last).partition()
with the additional guarantee that the relative ordering of elements in each group is preserved, so any two elements x
and y
in the range
[first,last) such that pred(x)==pred
(y) will have the same relative ordering after calling stable_partition()
.
Definition at line 2208 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __inplace_stable_partition(), __stable_partition_adaptive(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), std::_Temporary_buffer< _ForwardIterator, _Tp >::requested_size(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().
void std::stable_sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Sort the elements of a sequence using a predicate for comparison, preserving the relative order of equivalent elements.
first | An iterator. | |
last | Another iterator. | |
comp | A comparison functor. |
[first,last) in ascending order, such that comp
(*(i+1),*i) is false for each iterator i
in the range
[first,last-1).
The relative ordering of equivalent elements is preserved, so any two elements x
and y
in the range [first,last) such that
comp(x,y)
is false and comp(y,x)
is false will have the same relative ordering after calling stable_sort()
.
Definition at line 3917 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __inplace_stable_sort(), __stable_sort_adaptive(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().
void std::stable_sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Sort the elements of a sequence, preserving the relative order of equivalent elements.
first | An iterator. | |
last | Another iterator. |
[first,last) in ascending order, such that *
(i+1)<*i is false for each iterator i
in the range
[first,last-1).
The relative ordering of equivalent elements is preserved, so any two elements x
and y
in the range [first,last) such that
x<y
is false and y<x
is false will have the same relative ordering after calling stable_sort()
.
Definition at line 3876 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __inplace_stable_sort(), __stable_sort_adaptive(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().
void std::swap | ( | vector< _Tp, _Alloc > & | __x, | |
vector< _Tp, _Alloc > & | __y | |||
) | [inline] |
See std::vector::swap().
Definition at line 987 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::swap().
void std::swap | ( | set< _Key, _Compare, _Alloc > & | __x, | |
set< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
See std::set::swap().
Definition at line 573 of file stl_set.h.
References std::set< _Key, _Compare, _Alloc >::swap().
void std::swap | ( | multiset< _Key, _Compare, _Alloc > & | __x, | |
multiset< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
Definition at line 559 of file stl_multiset.h.
References std::multiset< _Key, _Compare, _Alloc >::swap().
void std::swap | ( | multimap< _Key, _Tp, _Compare, _Alloc > & | __x, | |
multimap< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
Definition at line 664 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 734 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::swap().
void std::swap | ( | list< _Tp, _Alloc > & | __x, | |
list< _Tp, _Alloc > & | __y | |||
) | [inline] |
See std::list::swap().
Definition at line 1256 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 1603 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::swap().
void std::swap | ( | _Tp & | __a, | |
_Tp & | __b | |||
) | [inline] |
Swaps two values.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. |
Definition at line 93 of file stl_algobase.h.
References __glibcxx_function_requires.
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. |
Definition at line 2364 of file basic_string.h.
References std::basic_string< _CharT, _Traits, _Alloc >::swap().
Referenced by std::tr1::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Default_ranged_hash, true >::_M_swap(), std::tr1::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Default_ranged_hash, false >::_M_swap(), std::tr1::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Hash, false >::_M_swap(), std::tr1::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::operator=(), std::__debug::vector< _Tp, _Allocator >::swap(), std::vector< _Tp, _Allocator >::swap(), std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::swap(), std::deque< _Tp, _Allocator >::swap(), std::vector< bool, _Alloc >::swap(), __gnu_cxx::slist< _Tp, _Alloc >::swap(), __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >::swap(), and std::tr1::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::swap().
_ForwardIterator2 std::swap_ranges | ( | _ForwardIterator1 | __first1, | |
_ForwardIterator1 | __last1, | |||
_ForwardIterator2 | __first2 | |||
) |
Swap the elements of two sequences.
first1 | A forward iterator. | |
last1 | A forward iterator. | |
first2 | A forward iterator. |
first2+
(last1-first1).
[first1,last1) with the corresponding element in the range
[first2,(last1-first1)). The ranges must not overlap.
Definition at line 886 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and iter_swap().
Referenced by __rotate(), std::tr1::swap(), and std::tr1::array< _Tp, _Nm >::swap().
void std::terminate | ( | ) |
The runtime will call this function if exception handling must be abandoned for any reason. It can also be called by the user.
_CharT std::tolower | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
_CharT std::toupper | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
_OutputIterator std::transform | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_OutputIterator | __result, | |||
_BinaryOperation | __binary_op | |||
) |
Perform an operation on corresponding elements of two sequences.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
result | An output iterator. | |
binary_op | A binary operator. |
result+
(last-first).*
(result+N)=binary_op(*(first1+N),*(first2+N)) for each N
in the range
[0,last1-first1).
binary_op
must not alter either of its arguments.
Definition at line 960 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
_OutputIterator std::transform | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
_UnaryOperation | __unary_op | |||
) |
Perform an operation on a sequence.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
unary_op | A unary operator. |
result+
(last-first).*
(result+N)=unary_op(*(first+N)) for each N
in the range
[0,last-first).
unary_op
must not alter its argument.
Definition at line 925 of file stl_algo.h.
References __glibcxx_function_requires, and __glibcxx_requires_valid_range.
bool std::uncaught_exception | ( | ) | throw () |
[18.6.4]/1: "Returns true after completing evaluation of a throw-expression until either completing initialization of the exception-declaration in the matching handler or entering unexpected()
due to the throw; or after entering terminate()
for any reason other than an explicit call to terminate()
. [Note: This includes stack unwinding [15.2]. end note]"
2: "When uncaught_exception()
is true, throwing an exception can result in a call of terminate()
(15.5.1)."
Referenced by std::basic_ostream< _CharT, _Traits >::sentry::~sentry().
void std::unexpected | ( | ) |
The runtime will call this function if an exception is thrown which violates the function's exception specification.
_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. |
Definition at line 108 of file stl_uninitialized.h.
References __uninitialized_copy_aux().
Referenced by __uninitialized_copy_a(), and __gnu_cxx::__uninitialized_copy_n().
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. |
Definition at line 170 of file stl_uninitialized.h.
References __uninitialized_fill_aux().
Referenced by __uninitialized_fill_a().
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. |
Definition at line 215 of file stl_uninitialized.h.
References __uninitialized_fill_n_aux().
Referenced by __uninitialized_fill_n_a(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::_M_initialize_buffer().
_ForwardIterator std::unique | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_BinaryPredicate | __binary_pred | |||
) |
Remove consecutive values from a sequence using a predicate.
first | A forward iterator. | |
last | A forward iterator. | |
binary_pred | A binary predicate. |
binary_pred
returns true. unique() is stable, so the relative order of elements that are not removed is unchanged. Elements between the end of the resulting sequence and last
are still present, but their value is unspecified.
Definition at line 1601 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and adjacent_find().
_ForwardIterator std::unique | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last | |||
) |
Remove consecutive duplicate values from a sequence.
first | A forward iterator. | |
last | A forward iterator. |
last
are still present, but their value is unspecified.
Definition at line 1562 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, and adjacent_find().
_OutputIterator std::unique_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
_BinaryPredicate | __binary_pred | |||
) | [inline] |
Copy a sequence, removing consecutive values using a predicate.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
binary_pred | A binary predicate. |
[first,last) to the range beginning at result
, except that only the first element is copied from groups of consecutive elements for which binary_pred
returns true. unique_copy() is stable, so the relative order of elements that are copied is unchanged.
Definition at line 1530 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __unique_copy().
_OutputIterator std::unique_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result | |||
) | [inline] |
Copy a sequence, removing consecutive duplicate values.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. |
[first,last) to the range beginning at result
, except that only the first element is copied from groups of consecutive elements that compare equal. unique_copy() is stable, so the relative order of elements that are copied is unchanged.
Definition at line 1489 of file stl_algo.h.
References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __unique_copy().
ios_base& std::unitbuf | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::unitbuf).
Definition at line 884 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 868 of file ios_base.h.
References std::ios_base::setf().
Referenced by nouppercase().
const _Facet & std::use_facet | ( | const locale & | __loc | ) | [inline] |
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 111 of file locale_facets.tcc.
References std::locale::_M_impl.
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 844 of file istream.tcc.
References std::ios_base::eofbit, std::ios_base::getloc(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), and std::ctype_base::space.
Linked to standard error (unbuffered).
Linked to standard error (buffered).
Linked to standard output.