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(* new_handler)() |
typedef long long streamoff |
Type used by fpos, char_traits<char>, and char_traits<wchar_t>.
Definition at line 74 of file postypes.h.
typedef ptrdiff_t streamsize |
typedef void(* terminate_handler)() |
typedef void(* unexpected_handler)() |
typedef fpos<mbstate_t> wstreampos |
enum float_denorm_style |
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.
enum float_round_style |
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 | |||
) | [inline] |
Accumulate values in a range with operation.
Accumulates the values in the range [first,last) using the function object binary_op. The initial value is init. The values are processed in order.
first | Start of range. | |
last | End of range. | |
init | Starting value to add other values to. | |
binary_op | Function object to accumulate with. |
Definition at line 108 of file stl_numeric.h.
_Tp std::accumulate | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_Tp | __init | |||
) | [inline] |
Accumulate values in a range.
Accumulates the values in the range [first,last) using operator+(). The initial value is init. The values are processed in order.
first | Start of range. | |
last | End of range. | |
init | Starting value to add other values to. |
Definition at line 82 of file stl_numeric.h.
_OutputIterator std::adjacent_difference | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
_BinaryOperation | __binary_op | |||
) | [inline] |
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 314 of file stl_numeric.h.
_OutputIterator std::adjacent_difference | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result | |||
) | [inline] |
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 275 of file stl_numeric.h.
_ForwardIterator std::adjacent_find | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_BinaryPredicate | __binary_pred | |||
) | [inline] |
Find two adjacent values in a sequence using a 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 382 of file stl_algo.h.
_ForwardIterator std::adjacent_find | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last | |||
) | [inline] |
Find two adjacent values in a sequence that are equal.
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 351 of file stl_algo.h.
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 172 of file stl_iterator_base_funcs.h.
Referenced by 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 444 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 ios_base::boolalpha, and ios_base::setf().
_OutputIterator std::copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result | |||
) | [inline] |
Copies the range [first,last) into result.
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 375 of file stl_algobase.h.
References __gnu_cxx::copy_n().
Referenced by vector::erase(), deque::erase(), merge(), vector::operator=(), deque::operator=(), rotate_copy(), set_difference(), set_symmetric_difference(), set_union(), basic_filebuf::underflow(), basic_streambuf::xsgetn(), basic_filebuf::xsgetn(), and basic_streambuf::xsputn().
_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 504 of file stl_algobase.h.
Referenced by deque::erase().
iterator_traits<_InputIterator>::difference_type std::count | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Tp & | __value | |||
) | [inline] |
Count the number of copies of a value in a sequence.
i
in the range
[first,last) for which *i
== value
Definition at line 413 of file stl_algo.h.
Referenced by set::count(), multiset::count(), multimap::count(), map::count(), and bitset::count().
iterator_traits<_InputIterator>::difference_type std::count_if | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_Predicate | __pred | |||
) | [inline] |
Count the elements of a sequence for which a predicate is true.
i
in the range
[first,last) for which pred(*i)
is true. Definition at line 437 of file stl_algo.h.
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 ios_base::basefield, ios_base::dec, and ios_base::setf().
iterator_traits<_InputIterator>::difference_type std::distance | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
A generalization of pointer arithmetic.
n
such that first + n == last. This requires that last
must be reachable from first
. Note that n
may be negative.
For random access iterators, this uses their +
and -
operations and are constant time. For other iterator classes they are linear time.
Definition at line 114 of file stl_iterator_base_funcs.h.
Referenced by equal_range(), inplace_merge(), lower_bound(), __gnu_cxx::random_sample_n(), list::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 498 of file ostream.
References flush(), basic_ostream::put(), and basic_ios::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 509 of file ostream.
References basic_ostream::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 781 of file stl_algobase.h.
Referenced by operator==().
bool std::equal | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2 | |||
) | [inline] |
Tests a range for element-wise equality.
==
and returns true or false depending on whether all of the corresponding elements of the ranges are equal.
Definition at line 748 of file stl_algobase.h.
Referenced by operator==().
void std::fill | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __value | |||
) | [inline] |
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 560 of file stl_algobase.h.
_OutputIterator std::fill_n | ( | _OutputIterator | __first, | |
_Size | __n, | |||
const _Tp & | __value | |||
) | [inline] |
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 636 of file stl_algobase.h.
_InputIterator std::find | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Tp & | __val | |||
) | [inline] |
Find the first occurrence of a value in a sequence.
i
in the range
[first,last) such that *i
== val
, or last
if no such iterator exists. Definition at line 307 of file stl_algo.h.
Referenced by __versa_string::find_first_not_of(), basic_string::find_first_not_of(), __versa_string::find_last_not_of(), basic_string::find_last_not_of(), __versa_string::find_last_of(), basic_string::find_last_of(), remove(), search(), and search_n().
_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 5287 of file stl_algo.h.
_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 5241 of file stl_algo.h.
_InputIterator std::find_first_of | ( | _InputIterator | __first1, | |
_InputIterator | __last1, | |||
_ForwardIterator | __first2, | |||
_ForwardIterator | __last2, | |||
_BinaryPredicate | __comp | |||
) | [inline] |
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 5062 of file stl_algo.h.
_InputIterator std::find_first_of | ( | _InputIterator | __first1, | |
_InputIterator | __last1, | |||
_ForwardIterator | __first2, | |||
_ForwardIterator | __last2 | |||
) | [inline] |
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 5025 of file stl_algo.h.
_InputIterator std::find_if | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_Predicate | __pred | |||
) | [inline] |
Find the first element in a sequence for which a predicate is true.
i
in the range
[first,last) such that pred(*i)
is true, or last
if no such iterator exists. Definition at line 329 of file stl_algo.h.
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 ios_base::fixed, ios_base::floatfield, and ios_base::setf().
basic_ostream<_CharT, _Traits>& std::flush | ( | basic_ostream< _CharT, _Traits > & | __os | ) | [inline] |
Flushes the output stream.
This manipulator simply calls the stream's flush()
member function.
Definition at line 519 of file ostream.
References basic_ostream::flush().
Referenced by endl().
_Function std::for_each | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_Function | __f | |||
) | [inline] |
Apply a function to every element of a sequence.
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.
front_insert_iterator<_Container> std::front_inserter | ( | _Container & | __x | ) | [inline] |
x | A container of arbitrary type. |
x
.Definition at line 518 of file stl_iterator.h.
void std::generate | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Generator | __gen | |||
) | [inline] |
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 1114 of file stl_algo.h.
_OutputIterator std::generate_n | ( | _OutputIterator | __first, | |
_Size | __n, | |||
_Generator | __gen | |||
) | [inline] |
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 1140 of file stl_algo.h.
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.
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 2185 of file vstring.h.
References getline(), and basic_ios::widen().
basic_istream< _CharT, _Traits > & getline | ( | basic_istream< _CharT, _Traits > & | __is, | |
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > & | __str, | |||
_CharT | __delim | |||
) | [inline] |
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 648 of file vstring.tcc.
References basic_ios::_M_setstate(), __versa_string::append(), ios_base::badbit, ios_base::eofbit, __versa_string::erase(), ios_base::failbit, ios_base::goodbit, __versa_string::max_size(), basic_ios::rdbuf(), and basic_ios::setstate().
basic_istream< _CharT, _Traits > & 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 1256 of file istream.tcc.
References getline(), and basic_ios::widen().
basic_istream< _CharT, _Traits > & getline | ( | basic_istream< _CharT, _Traits > & | __is, | |
basic_string< _CharT, _Traits, _Alloc > & | __str, | |||
_CharT | __delim | |||
) | [inline] |
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 1196 of file istream.tcc.
References basic_ios::_M_setstate(), ios_base::badbit, ios_base::eofbit, basic_string::erase(), ios_base::failbit, ios_base::goodbit, basic_string::max_size(), basic_ios::rdbuf(), and basic_ios::setstate().
Referenced by getline().
bool 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.
Definition at line 88 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 ios_base::basefield, ios_base::hex, and ios_base::setf().
_Tp std::inner_product | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_Tp | __init, | |||
_BinaryOperation1 | __binary_op1, | |||
_BinaryOperation2 | __binary_op2 | |||
) | [inline] |
Compute inner product of two ranges.
Starting with an initial value of init, applies binary_op2 to successive elements from the two ranges and accumulates each result into the accumulated value using binary_op1. The values in the ranges are processed in order.
first1 | Start of range 1. | |
last1 | End of range 1. | |
first2 | Start of range 2. | |
init | Starting value to add other values to. | |
binary_op1 | Function object to accumulate with. | |
binary_op2 | Function object to apply to pairs of input values. |
Definition at line 168 of file stl_numeric.h.
_Tp std::inner_product | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_Tp | __init | |||
) | [inline] |
Compute inner product of two ranges.
Starting with an initial value of init, multiplies successive elements from the two ranges and adds each product into the accumulated value using operator+(). The values in the ranges are processed in order.
first1 | Start of range 1. | |
last1 | End of range 1. | |
first2 | Start of range 2. | |
init | Starting value to add other values to. |
Definition at line 136 of file stl_numeric.h.
void std::inplace_merge | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __middle, | |||
_BidirectionalIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
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 3651 of file stl_algo.h.
References distance().
void std::inplace_merge | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __middle, | |||
_BidirectionalIterator | __last | |||
) | [inline] |
Merges two sorted ranges in place.
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 3597 of file stl_algo.h.
References distance().
insert_iterator<_Container> std::inserter | ( | _Container & | __x, | |
_Iterator | __i | |||
) | [inline] |
x | A container of arbitrary type. |
x
.Definition at line 614 of file stl_iterator.h.
ios_base& std::internal | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::internal, ios_base::adjustfield).
Definition at line 901 of file ios_base.h.
References ios_base::adjustfield, ios_base::internal, and ios_base::setf().
bool isalnum | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::alnum, __c).
Definition at line 4615 of file locale_facets.h.
bool isalpha | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::alpha, __c).
Definition at line 4591 of file locale_facets.h.
bool iscntrl | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::cntrl, __c).
Definition at line 4573 of file locale_facets.h.
bool isdigit | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::digit, __c).
Definition at line 4597 of file locale_facets.h.
bool isgraph | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::graph, __c).
Definition at line 4621 of file locale_facets.h.
bool islower | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::lower, __c).
Definition at line 4585 of file locale_facets.h.
bool isprint | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::print, __c).
Definition at line 4567 of file locale_facets.h.
bool ispunct | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::punct, __c).
Definition at line 4603 of file locale_facets.h.
bool isspace | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::space, __c).
Definition at line 4561 of file locale_facets.h.
bool isupper | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::upper, __c).
Definition at line 4579 of file locale_facets.h.
bool isxdigit | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
Convenience interface to ctype.is(ctype_base::xdigit, __c).
Definition at line 4609 of file locale_facets.h.
void std::iter_swap | ( | _ForwardIterator1 | __a, | |
_ForwardIterator2 | __b | |||
) | [inline] |
Swaps the contents of two iterators.
Definition at line 142 of file stl_algobase.h.
Referenced by 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 ios_base::adjustfield, ios_base::left, and ios_base::setf().
bool std::lexicographical_compare | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_InputIterator2 | __last2, | |||
_Compare | __comp | |||
) | [inline] |
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 853 of file stl_algobase.h.
bool std::lexicographical_compare | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_InputIterator2 | __last2 | |||
) | [inline] |
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 812 of file stl_algobase.h.
Referenced by 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.
void std::make_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Construct a heap over a range.
first | Start of heap. | |
last | End of heap. |
Definition at line 344 of file stl_heap.h.
Referenced by partial_sort(), partial_sort_copy(), and priority_queue::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.
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 248 of file stl_algobase.h.
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 206 of file stl_algobase.h.
Referenced by basic_istream::ignore(), and basic_stringbuf::overflow().
_ForwardIterator std::max_element | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Return the maximum element in a range using comparison functor.
first | Start of range. | |
last | End of range. | |
comp | Comparison functor. |
Definition at line 4712 of file stl_algo.h.
_ForwardIterator std::max_element | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last | |||
) | [inline] |
Return the maximum element in a range.
first | Start of range. | |
last | End of range. |
Definition at line 4685 of file stl_algo.h.
Referenced by valarray::max().
_OutputIterator std::merge | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_InputIterator2 | __last2, | |||
_OutputIterator | __result, | |||
_Compare | __comp | |||
) | [inline] |
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 3178 of file stl_algo.h.
References copy().
_OutputIterator std::merge | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_InputIterator2 | __last2, | |||
_OutputIterator | __result | |||
) | [inline] |
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 3120 of file stl_algo.h.
References copy().
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 228 of file stl_algobase.h.
Referenced by __versa_string::compare(), __gnu_cxx::random_sample_n(), and __versa_string::rfind().
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 184 of file stl_algobase.h.
Referenced by basic_string::compare(), basic_string< char >::compare(), basic_istream::ignore(), basic_stringbuf::overflow(), basic_istream::readsome(), basic_string::rfind(), basic_filebuf::underflow(), basic_streambuf::xsgetn(), basic_streambuf::xsputn(), and basic_filebuf::xsputn().
_ForwardIterator std::min_element | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Return the minimum element in a range using comparison functor.
first | Start of range. | |
last | End of range. | |
comp | Comparison functor. |
Definition at line 4764 of file stl_algo.h.
_ForwardIterator std::min_element | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last | |||
) | [inline] |
Return the minimum element in a range.
first | Start of range. | |
last | End of range. |
Definition at line 4737 of file stl_algo.h.
Referenced by valarray::min().
pair<_InputIterator1, _InputIterator2> std::mismatch | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_BinaryPredicate | __binary_pred | |||
) | [inline] |
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 719 of file stl_algobase.h.
pair<_InputIterator1, _InputIterator2> std::mismatch | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2 | |||
) | [inline] |
Finds the places in ranges which don't match.
==
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 683 of file stl_algobase.h.
bool std::next_permutation | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Permute range into the next "dictionary" ordering using comparison functor.
first | Start of range. | |
last | End of range. | |
comp |
Definition at line 4855 of file stl_algo.h.
References iter_swap(), and reverse().
bool std::next_permutation | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last | |||
) | [inline] |
Permute range into the next "dictionary" ordering.
first | Start of range. | |
last | End of range. |
Definition at line 4799 of file stl_algo.h.
References 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 ios_base::boolalpha, and 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 ios_base::showbase, and 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 ios_base::showpoint, and 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 ios_base::showpos, and 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 ios_base::skipws, and 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 ios_base::unitbuf, and 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 ios_base::unsetf(), and ios_base::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 3893 of file stl_algo.h.
References __median().
void std::nth_element | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __nth, | |||
_RandomAccessIterator | __last | |||
) | [inline] |
Sort a sequence just enough to find a particular position.
[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 3842 of file stl_algo.h.
References __median().
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 ios_base::basefield, ios_base::oct, and ios_base::setf().
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 istream_iterator::_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, _Sequence > & | __x, | |
const queue< _Tp, _Sequence > & | __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 reverse_iterator< _IteratorL > & | __x, | |
const reverse_iterator< _IteratorR > & | __y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 342 of file stl_iterator.h.
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 292 of file stl_iterator.h.
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 2198 of file basic_string.h.
References basic_string::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 2186 of file basic_string.h.
References basic_string::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 2174 of file basic_string.h.
References basic_string::compare().
bitset<_Nb> std::operator& | ( | const bitset< _Nb > & | __x, | |
const bitset< _Nb > & | __y | |||
) | [inline] |
reverse_iterator<_Iterator> std::operator+ | ( | typename reverse_iterator< _Iterator >::difference_type | __n, | |
const reverse_iterator< _Iterator > & | __x | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 322 of file stl_iterator.h.
References reverse_iterator::base().
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 2119 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 2103 of file basic_string.h.
References basic_string::append().
basic_string< _CharT, _Traits, _Alloc > operator+ | ( | _CharT | __lhs, | |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | |||
) | [inline] |
Concatenate character and string.
lhs | First string. | |
rhs | Last string. |
Definition at line 689 of file basic_string.tcc.
References basic_string::size().
basic_string< _CharT, _Traits, _Alloc > operator+ | ( | const _CharT * | __lhs, | |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | |||
) | [inline] |
Concatenate C string and string.
lhs | First string. | |
rhs | Last string. |
Definition at line 673 of file basic_string.tcc.
References basic_string::size().
basic_string<_CharT, _Traits, _Alloc> std::operator+ | ( | const basic_string< _CharT, _Traits, _Alloc > & | __lhs, | |
const basic_string< _CharT, _Traits, _Alloc > & | __rhs | |||
) | [inline] |
Concatenate two strings.
lhs | First string. | |
rhs | Last string. |
Definition at line 2066 of file basic_string.h.
References basic_string::append().
reverse_iterator<_IteratorL>::difference_type std::operator- | ( | const reverse_iterator< _IteratorL > & | __x, | |
const reverse_iterator< _IteratorR > & | __y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 366 of file stl_iterator.h.
References reverse_iterator::base().
reverse_iterator<_Iterator>::difference_type std::operator- | ( | const reverse_iterator< _Iterator > & | __x, | |
const reverse_iterator< _Iterator > & | __y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 316 of file stl_iterator.h.
References reverse_iterator::base().
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 949 of file stl_vector.h.
References lexicographical_compare().
bool 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 244 of file stl_stack.h.
bool 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, _Sequence > & | __x, | |
const queue< _Tp, _Sequence > & | __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 269 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 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 539 of file stl_multiset.h.
bool 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 644 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 1195 of file stl_list.h.
References lexicographical_compare().
bool std::operator< | ( | const reverse_iterator< _IteratorL > & | __x, | |
const reverse_iterator< _IteratorR > & | __y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 336 of file stl_iterator.h.
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 286 of file stl_iterator.h.
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 1491 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 2235 of file basic_string.h.
References basic_string::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 2223 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 2211 of file basic_string.h.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, | |
const unsigned char * | __s | |||
) | [inline] |
String inserters.
out | An output stream. | |
s | A character string. |
traits::length(s)
characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0)
is then called.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, | |
const signed char * | __s | |||
) | [inline] |
String inserters.
out | An output stream. | |
s | A character string. |
traits::length(s)
characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0)
is then called.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, | |
unsigned char | __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.
basic_ostream<char, _Traits>& std::operator<< | ( | basic_ostream< char, _Traits > & | __out, | |
signed char | __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.
basic_ostream<_CharT, _Traits>& std::operator<< | ( | basic_ostream< _CharT, _Traits > & | __out, | |
char | __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.
std::basic_ostream<_CharT, _Traits>& std::operator<< | ( | std::basic_ostream< _CharT, _Traits > & | __os, | |
const bitset< _Nb > & | __x | |||
) | [inline] |
basic_ostream< _CharT, _Traits > & 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 615 of file vstring.tcc.
basic_ostream< char, _Traits > & operator<< | ( | basic_ostream< char, _Traits > & | __out, | |
const char * | __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 735 of file ostream.tcc.
References ios_base::badbit.
basic_ostream< _CharT, _Traits > & operator<< | ( | basic_ostream< _CharT, _Traits > & | __out, | |
const char * | __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 690 of file ostream.tcc.
References ios_base::badbit.
basic_ostream< _CharT, _Traits > & 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 657 of file ostream.tcc.
References ios_base::badbit.
basic_ostream< char, _Traits > & operator<< | ( | basic_ostream< char, _Traits > & | __out, | |
char | __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 628 of file ostream.tcc.
References ios_base::badbit.
basic_ostream< _CharT, _Traits > & 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 597 of file ostream.tcc.
References ios_base::badbit.
basic_ostream< _CharT, _Traits > & 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 767 of file ostream.tcc.
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, _Sequence > & | __x, | |
const queue< _Tp, _Sequence > & | __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 reverse_iterator< _IteratorL > & | __x, | |
const reverse_iterator< _IteratorR > & | __y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 354 of file stl_iterator.h.
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 304 of file stl_iterator.h.
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 2309 of file basic_string.h.
References basic_string::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 2297 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 2285 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 istream_iterator::_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 932 of file stl_vector.h.
References vector::begin(), vector::end(), equal(), and vector::size().
bool 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 226 of file stl_stack.h.
References stack::c.
bool 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 535 of file stl_set.h.
References set::_M_t.
bool std::operator== | ( | const queue< _Tp, _Sequence > & | __x, | |
const queue< _Tp, _Sequence > & | __y | |||
) | [inline] |
Queue equality comparison.
x | A queue. | |
y | A queue of the same type as x. |
Definition at line 250 of file stl_queue.h.
References queue::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 pair::first, and pair::second.
bool 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 522 of file stl_multiset.h.
References multiset::_M_t.
bool 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 627 of file stl_multimap.h.
References multimap::_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 674 of file stl_map.h.
References map::_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 1166 of file stl_list.h.
References list::begin(), and list::end().
bool std::operator== | ( | const reverse_iterator< _IteratorL > & | __x, | |
const reverse_iterator< _IteratorR > & | __y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 330 of file stl_iterator.h.
References reverse_iterator::base().
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 280 of file stl_iterator.h.
References reverse_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 1473 of file stl_deque.h.
References deque::begin(), deque::end(), equal(), and deque::size().
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 2161 of file basic_string.h.
References basic_string::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 2149 of file basic_string.h.
References basic_string::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 2137 of file basic_string.h.
References basic_string::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, _Sequence > & | __x, | |
const queue< _Tp, _Sequence > & | __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 reverse_iterator< _IteratorL > & | __x, | |
const reverse_iterator< _IteratorR > & | __y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 348 of file stl_iterator.h.
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 298 of file stl_iterator.h.
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 2272 of file basic_string.h.
References basic_string::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 2260 of file basic_string.h.
References basic_string::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 2248 of file basic_string.h.
References basic_string::compare().
Referenced by operator>().
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, _Sequence > & | __x, | |
const queue< _Tp, _Sequence > & | __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 reverse_iterator< _IteratorL > & | __x, | |
const reverse_iterator< _IteratorR > & | __y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 360 of file stl_iterator.h.
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 310 of file stl_iterator.h.
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 2346 of file basic_string.h.
References basic_string::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 2334 of file basic_string.h.
References basic_string::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 2322 of file basic_string.h.
References basic_string::compare().
Referenced by operator>=().
basic_istream<char, _Traits>& std::operator>> | ( | basic_istream< char, _Traits > & | __in, | |
signed char * | __s | |||
) | [inline] |
Character string extractors.
in | An input stream. | |
s | A pointer to a character array. |
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.
basic_istream<char, _Traits>& std::operator>> | ( | basic_istream< char, _Traits > & | __in, | |
unsigned char * | __s | |||
) | [inline] |
Character string extractors.
in | An input stream. | |
s | A pointer to a character array. |
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.
basic_istream<char>& std::operator>> | ( | basic_istream< char > & | __in, | |
char * | __s | |||
) | [inline] |
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.
basic_istream<char, _Traits>& std::operator>> | ( | basic_istream< char, _Traits > & | __in, | |
signed char & | __c | |||
) | [inline] |
Character extractors.
in | An input stream. | |
c | A character reference. |
basic_istream<char, _Traits>& std::operator>> | ( | basic_istream< char, _Traits > & | __in, | |
unsigned char & | __c | |||
) | [inline] |
Character extractors.
in | An input stream. | |
c | A character reference. |
std::basic_istream<_CharT, _Traits>& std::operator>> | ( | std::basic_istream< _CharT, _Traits > & | __is, | |
bitset< _Nb > & | __x | |||
) | [inline] |
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 1228 of file bitset.
References bitset::_M_copy_from_string(), basic_ios::_M_setstate(), ios_base::badbit, basic_string::empty(), ios_base::eofbit, ios_base::failbit, ios_base::goodbit, basic_string::push_back(), basic_ios::rdbuf(), basic_string::reserve(), basic_streambuf::sbumpc(), basic_ios::setstate(), basic_streambuf::sputbackc(), and basic_ios::widen().
basic_istream< _CharT, _Traits > & operator>> | ( | basic_istream< _CharT, _Traits > & | __is, | |
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > & | __str | |||
) | [inline] |
Read stream into a string.
is | Input stream. | |
str | Buffer to store into. |
Definition at line 546 of file vstring.tcc.
References basic_ios::_M_setstate(), ios_base::badbit, ios_base::eofbit, ios_base::failbit, ios_base::getloc(), ios_base::goodbit, basic_ios::rdbuf(), basic_ios::setstate(), and ios_base::width().
basic_istream< _CharT, _Traits > & operator>> | ( | basic_istream< _CharT, _Traits > & | __in, | |
_CharT * | __s | |||
) | [inline] |
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 1050 of file istream.tcc.
References basic_ios::_M_setstate(), ios_base::badbit, ios_base::eofbit, ios_base::failbit, ios_base::getloc(), ios_base::goodbit, numeric_limits::max(), basic_ios::rdbuf(), basic_ios::setstate(), and ios_base::width().
basic_istream< _CharT, _Traits > & operator>> | ( | basic_istream< _CharT, _Traits > & | __in, | |
_CharT & | __c | |||
) | [inline] |
Character extractors.
in | An input stream. | |
c | A character reference. |
Definition at line 1023 of file istream.tcc.
References basic_ios::_M_setstate(), ios_base::badbit, ios_base::eofbit, ios_base::failbit, ios_base::goodbit, basic_ios::rdbuf(), and basic_ios::setstate().
basic_istream< _CharT, _Traits > & operator>> | ( | basic_istream< _CharT, _Traits > & | __is, | |
basic_string< _CharT, _Traits, _Alloc > & | __str | |||
) | [inline] |
Read stream into a string.
is | Input stream. | |
str | Buffer to store into. |
Definition at line 1130 of file istream.tcc.
References basic_ios::_M_setstate(), basic_string::append(), ios_base::badbit, ios_base::eofbit, basic_string::erase(), ios_base::failbit, ios_base::getloc(), ios_base::goodbit, basic_string::max_size(), basic_ios::rdbuf(), basic_ios::setstate(), and 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 2459 of file stl_algo.h.
References make_heap(), and sort_heap().
void std::partial_sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __middle, | |||
_RandomAccessIterator | __last | |||
) | [inline] |
Sort the smallest elements of a sequence.
(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 2418 of file stl_algo.h.
References make_heap(), and sort_heap().
_RandomAccessIterator std::partial_sort_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_RandomAccessIterator | __result_first, | |||
_RandomAccessIterator | __result_last, | |||
_Compare | __comp | |||
) | [inline] |
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 2565 of file stl_algo.h.
References make_heap(), and sort_heap().
_RandomAccessIterator std::partial_sort_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_RandomAccessIterator | __result_first, | |||
_RandomAccessIterator | __result_last | |||
) | [inline] |
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 2501 of file stl_algo.h.
References make_heap(), and sort_heap().
_OutputIterator std::partial_sum | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
_BinaryOperation | __binary_op | |||
) | [inline] |
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 239 of file stl_numeric.h.
_OutputIterator std::partial_sum | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result | |||
) | [inline] |
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 199 of file stl_numeric.h.
_ForwardIterator std::partition | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Predicate | __pred | |||
) | [inline] |
Move elements for which a predicate is true to the beginning of a sequence.
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 2018 of file stl_algo.h.
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.
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.
Referenced by priority_queue::pop(), and sort_heap().
bool std::prev_permutation | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Permute range into the previous "dictionary" ordering using comparison functor.
first | Start of range. | |
last | End of range. | |
comp |
Definition at line 4966 of file stl_algo.h.
References iter_swap(), and reverse().
bool std::prev_permutation | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last | |||
) | [inline] |
Permute range into the previous "dictionary" ordering.
first | Start of range. | |
last | End of range. |
Definition at line 4910 of file stl_algo.h.
References 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.
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.
Referenced by priority_queue::push().
void std::random_shuffle | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_RandomNumberGenerator & | __rand | |||
) | [inline] |
Shuffle the elements of a sequence using a random number generator.
[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 1924 of file stl_algo.h.
References iter_swap().
void std::random_shuffle | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Randomly shuffle the elements of a sequence.
[first,last) using a random distribution, so that every possible ordering of the sequence is equally likely.
Definition at line 1897 of file stl_algo.h.
References iter_swap().
_ForwardIterator std::remove | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __value | |||
) | [inline] |
Remove elements from a sequence.
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 1242 of file stl_algo.h.
References find(), and remove_copy().
_OutputIterator std::remove_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
const _Tp & | __value | |||
) | [inline] |
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 1167 of file stl_algo.h.
Referenced by remove().
_OutputIterator std::remove_copy_if | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
_Predicate | __pred | |||
) | [inline] |
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 1204 of file stl_algo.h.
Referenced by remove_if().
_ForwardIterator std::remove_if | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Predicate | __pred | |||
) | [inline] |
Remove elements from a sequence using 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 1277 of file stl_algo.h.
References find_if(), and remove_copy_if().
void std::replace | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __old_value, | |||
const _Tp & | __new_value | |||
) | [inline] |
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 980 of file stl_algo.h.
_OutputIterator std::replace_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
const _Tp & | __old_value, | |||
const _Tp & | __new_value | |||
) | [inline] |
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 1044 of file stl_algo.h.
_OutputIterator std::replace_copy_if | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
_Predicate | __pred, | |||
const _Tp & | __new_value | |||
) | [inline] |
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 1081 of file stl_algo.h.
void std::replace_if | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Predicate | __pred, | |||
const _Tp & | __new_value | |||
) | [inline] |
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 1011 of file stl_algo.h.
_Resetiosflags std::resetiosflags | ( | ios_base::fmtflags | __mask | ) | [inline] |
void std::return_temporary_buffer | ( | _Tp * | __p | ) | [inline] |
The companion to get_temporary_buffer().
p | A buffer previously allocated by get_temporary_buffer. |
void std::reverse | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last | |||
) | [inline] |
Reverse a sequence.
[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 1605 of file stl_algo.h.
Referenced by next_permutation(), and prev_permutation().
_OutputIterator std::reverse_copy | ( | _BidirectionalIterator | __first, | |
_BidirectionalIterator | __last, | |||
_OutputIterator | __result | |||
) | [inline] |
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 1631 of file stl_algo.h.
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 ios_base::adjustfield, ios_base::right, and ios_base::setf().
void std::rotate | ( | _ForwardIterator | __first, | |
_ForwardIterator | __middle, | |||
_ForwardIterator | __last | |||
) | [inline] |
Rotate the elements of a sequence.
[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 1838 of file stl_algo.h.
_OutputIterator std::rotate_copy | ( | _ForwardIterator | __first, | |
_ForwardIterator | __middle, | |||
_ForwardIterator | __last, | |||
_OutputIterator | __result | |||
) | [inline] |
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 1871 of file stl_algo.h.
References copy().
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 ios_base::floatfield, ios_base::scientific, and ios_base::setf().
_ForwardIterator1 std::search | ( | _ForwardIterator1 | __first1, | |
_ForwardIterator1 | __last1, | |||
_ForwardIterator2 | __first2, | |||
_ForwardIterator2 | __last2, | |||
_BinaryPredicate | __predicate | |||
) | [inline] |
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 548 of file stl_algo.h.
Referenced by __versa_string::find().
_ForwardIterator1 std::search | ( | _ForwardIterator1 | __first1, | |
_ForwardIterator1 | __last1, | |||
_ForwardIterator2 | __first2, | |||
_ForwardIterator2 | __last2 | |||
) | [inline] |
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 476 of file stl_algo.h.
References find().
Referenced by basic_string::find().
_ForwardIterator std::search_n | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Integer | __count, | |||
const _Tp & | __val, | |||
_BinaryPredicate | __binary_pred | |||
) | [inline] |
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 840 of file stl_algo.h.
_ForwardIterator std::search_n | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Integer | __count, | |||
const _Tp & | __val | |||
) | [inline] |
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 711 of file stl_algo.h.
References find().
new_handler std::set_new_handler | ( | new_handler | ) | throw () |
Takes a replacement handler as the argument, returns the 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.
_Setfill<_CharT> std::setfill | ( | _CharT | __c | ) | [inline] |
_Setiosflags std::setiosflags | ( | ios_base::fmtflags | __mask | ) | [inline] |
_Setprecision std::setprecision | ( | int | __n | ) | [inline] |
_Setw std::setw | ( | int | __n | ) | [inline] |
ios_base& std::showbase | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showbase).
Definition at line 804 of file ios_base.h.
References ios_base::setf(), and ios_base::showbase.
ios_base& std::showpoint | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showpoint).
Definition at line 820 of file ios_base.h.
References ios_base::setf(), and ios_base::showpoint.
ios_base& std::showpos | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showpos).
Definition at line 836 of file ios_base.h.
References ios_base::setf(), and ios_base::showpos.
ios_base& std::skipws | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::skipws).
Definition at line 852 of file ios_base.h.
References ios_base::setf(), and ios_base::skipws.
void std::sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
Sort the elements of a sequence using a predicate for comparison.
[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 2734 of file stl_algo.h.
void std::sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Sort the elements of a sequence.
[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 2700 of file stl_algo.h.
void std::sort_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last, | |||
_Compare | __comp | |||
) | [inline] |
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 pop_heap().
void std::sort_heap | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Sort a heap.
first | Start of heap. | |
last | End of heap. |
Definition at line 422 of file stl_heap.h.
References pop_heap().
Referenced by partial_sort(), and partial_sort_copy().
_ForwardIterator std::stable_partition | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_Predicate | __pred | |||
) | [inline] |
Move elements for which a predicate is true to the beginning of a sequence, preserving relative ordering.
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 2129 of file stl_algo.h.
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,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 3801 of file stl_algo.h.
void std::stable_sort | ( | _RandomAccessIterator | __first, | |
_RandomAccessIterator | __last | |||
) | [inline] |
Sort the elements of a sequence, preserving the relative order of equivalent elements.
[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 3760 of file stl_algo.h.
void std::swap | ( | vector< _Tp, _Alloc > & | __x, | |
vector< _Tp, _Alloc > & | __y | |||
) | [inline] |
See std::vector::swap().
Definition at line 980 of file stl_vector.h.
References vector::swap(), and swap().
void std::swap | ( | set< _Key, _Compare, _Alloc > & | __x, | |
set< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
void std::swap | ( | multiset< _Key, _Compare, _Alloc > & | __x, | |
multiset< _Key, _Compare, _Alloc > & | __y | |||
) | [inline] |
void std::swap | ( | multimap< _Key, _Tp, _Compare, _Alloc > & | __x, | |
multimap< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
void std::swap | ( | map< _Key, _Tp, _Compare, _Alloc > & | __x, | |
map< _Key, _Tp, _Compare, _Alloc > & | __y | |||
) | [inline] |
void std::swap | ( | list< _Tp, _Alloc > & | __x, | |
list< _Tp, _Alloc > & | __y | |||
) | [inline] |
See std::list::swap().
Definition at line 1226 of file stl_list.h.
References list::swap(), and swap().
void std::swap | ( | deque< _Tp, _Alloc > & | __x, | |
deque< _Tp, _Alloc > & | __y | |||
) | [inline] |
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 92 of file stl_algobase.h.
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 2359 of file basic_string.h.
References basic_string::swap().
Referenced by vector< _Node *, _Nodeptr_Alloc >::swap(), set::swap(), multiset::swap(), multimap::swap(), map::swap(), swap(), list::swap(), and std::tr1::swap().
_ForwardIterator2 std::swap_ranges | ( | _ForwardIterator1 | __first1, | |
_ForwardIterator1 | __last1, | |||
_ForwardIterator2 | __first2 | |||
) | [inline] |
Swap the elements of two sequences.
first2+
(last1-first1).
[first1,last1) with the corresponding element in the range
[first2,(last1-first1)). The ranges must not overlap.
Definition at line 875 of file stl_algo.h.
References iter_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 tolower | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
_CharT toupper | ( | _CharT | __c, | |
const locale & | __loc | |||
) | [inline] |
_OutputIterator std::transform | ( | _InputIterator1 | __first1, | |
_InputIterator1 | __last1, | |||
_InputIterator2 | __first2, | |||
_OutputIterator | __result, | |||
_BinaryOperation | __binary_op | |||
) | [inline] |
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 949 of file stl_algo.h.
_OutputIterator std::transform | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result, | |||
_UnaryOperation | __unary_op | |||
) | [inline] |
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 914 of file stl_algo.h.
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 basic_ostream::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] |
void std::uninitialized_fill | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __x | |||
) | [inline] |
Copies the value x into the range [first,last).
Definition at line 169 of file stl_uninitialized.h.
void std::uninitialized_fill_n | ( | _ForwardIterator | __first, | |
_Size | __n, | |||
const _Tp & | __x | |||
) | [inline] |
Copies the value x into the range [first,first+n).
first | An input iterator. | |
n | The number of copies to make. | |
x | The source value. |
Definition at line 214 of file stl_uninitialized.h.
_ForwardIterator std::unique | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
_BinaryPredicate | __binary_pred | |||
) | [inline] |
Remove consecutive values from a sequence using a 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 1522 of file stl_algo.h.
References adjacent_find().
_ForwardIterator std::unique | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last | |||
) | [inline] |
Remove consecutive duplicate values from a sequence.
last
are still present, but their value is unspecified.
Definition at line 1483 of file stl_algo.h.
References 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 1450 of file stl_algo.h.
_OutputIterator std::unique_copy | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
_OutputIterator | __result | |||
) | [inline] |
Copy a sequence, removing consecutive duplicate values.
[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 1414 of file stl_algo.h.
ios_base& std::unitbuf | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::unitbuf).
Definition at line 884 of file ios_base.h.
References ios_base::setf(), and ios_base::unitbuf.
ios_base& std::uppercase | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::uppercase).
Definition at line 868 of file ios_base.h.
References ios_base::setf(), and ios_base::uppercase.
const _Facet & 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.
std::bad_cast | if locale doesn't contain a facet of type Facet. |
Definition at line 110 of file locale_facets.tcc.
References locale::_M_impl.
basic_istream< _CharT, _Traits > & ws | ( | basic_istream< _CharT, _Traits > & | __is | ) | [inline] |
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 1106 of file istream.tcc.
References ios_base::eofbit, ios_base::getloc(), basic_ios::rdbuf(), and basic_ios::setstate().