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.
|
If you write your own error handler to be called by |
|
Type used by fpos, char_traits<char>, and char_traits<wchar_t>.
Definition at line 74 of file postypes.h. |
|
File position for char streams.
Definition at line 210 of file postypes.h. |
|
Integral type for I/O operation counts and buffer sizes.
Definition at line 78 of file postypes.h. |
|
If you write a replacement terminate handler, it must be of this type.
|
|
If you write a replacement unexpected handler, it must be of this type.
|
|
File position for wchar_t streams.
Definition at line 212 of file postypes.h. |
|
Describes the denormalization for floating-point types. These values represent the presence or absence of a variable number of exponent bits. This type is used in the std::numeric_limits class. |
|
Describes the rounding style for floating-point types. This is used in the std::numeric_limits class. |
|
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.
Definition at line 108 of file stl_numeric.h. |
|
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.
Definition at line 82 of file stl_numeric.h. |
|
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.
Definition at line 314 of file stl_numeric.h. |
|
Return differences between adjacent values. Computes the difference between adjacent values in the range [first,last) using operator-() and writes the result to result.
Definition at line 275 of file stl_numeric.h. |
|
Find two adjacent values in a sequence using a predicate.
Definition at line 381 of file stl_algo.h. |
|
Find two adjacent values in a sequence that are equal.
Definition at line 350 of file stl_algo.h. Referenced by unique(). |
|
A generalization of pointer arithmetic.
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 Definition at line 172 of file stl_iterator_base_funcs.h. Referenced by equal_range(), lower_bound(), and upper_bound(). |
|
Definition at line 397 of file stl_iterator.h. |
|
Calls base.setf(ios_base::boolalpha).
Definition at line 788 of file ios_base.h. References ios_base::boolalpha, and ios_base::setf(). |
|
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 codecvt< _InternT, _ExternT, encoding_state >::do_out(), vector::erase(), deque::erase(), merge(), vector::operator=(), deque::operator=(), rotate_copy(), set_difference(), set_symmetric_difference(), set_union(), basic_filebuf::underflow(), basic_streambuf::xsgetn(), and basic_streambuf::xsputn(). |
|
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 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(). |
|
Count the number of copies of a value in a sequence.
Definition at line 412 of file stl_algo.h. |
|
Count the elements of a sequence for which a predicate is true.
Definition at line 437 of file stl_algo.h. |
|
Calls base.setf(ios_base::dec, ios_base::basefield).
Definition at line 926 of file ios_base.h. References ios_base::basefield, and ios_base::dec. |
|
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 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(). |
|
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 517 of file ostream. References flush(). |
|
Write a null character into the output sequence.
"Null character" is Definition at line 528 of file ostream. References basic_ostream::put(). |
|
Tests a range for element-wise equality.
Definition at line 781 of file stl_algobase.h. |
|
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==(). |
|
Fills the range [first,last) with copies of value.
memset .
Definition at line 560 of file stl_algobase.h. |
|
Fills the range [first,first+n) with copies of value.
memset .
Definition at line 636 of file stl_algobase.h. |
|
Find the first occurrence of a value in a sequence.
Definition at line 306 of file stl_algo.h. |
|
Find last matching subsequence in a sequence using a predicate.
[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 Definition at line 5144 of file stl_algo.h. |
|
Find last matching subsequence in a sequence.
[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 Definition at line 5098 of file stl_algo.h. |
|
Find element from a set in a sequence using a predicate.
[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 4919 of file stl_algo.h. |
|
Find element from a set in a sequence.
[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 4882 of file stl_algo.h. |
|
Find the first element in a sequence for which a predicate is true.
Definition at line 328 of file stl_algo.h. |
|
Calls base.setf(ios_base::fixed, ios_base::floatfield).
Definition at line 951 of file ios_base.h. References ios_base::fixed, and ios_base::floatfield. |
|
Flushes the output stream.
This manipulator simply calls the stream's Definition at line 538 of file ostream. References basic_ostream::flush(). Referenced by endl(). |
|
Apply a function to every element of a sequence.
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 152 of file stl_algo.h. |
|
Definition at line 471 of file stl_iterator.h. |
|
Assign the result of a function object to each value in a sequence.
*i = gen() for each i in the range [first,last).
Definition at line 972 of file stl_algo.h. |
|
Assign the result of a function object to each value in a sequence.
*i = gen() for each i in the range [first,first+n).
Definition at line 998 of file stl_algo.h. |
|
Allocates a temporary buffer.
This function tries to obtain storage for Provides the nothrow exception guarantee. |
|
Read a line from stream into a string.
' is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If end of line was encountered, it is extracted but not stored into str. Definition at line 1256 of file istream.tcc. References getline(). |
|
Read a line from stream into a string.
Definition at line 1196 of file istream.tcc. References ios_base::badbit, ios_base::eofbit, basic_string::erase(), ios_base::failbit, ios_base::goodbit, and basic_string::max_size(). Referenced by getline(). |
|
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. |
|
Calls base.setf(ios_base::hex, ios_base::basefield).
Definition at line 934 of file ios_base.h. References ios_base::basefield, and ios_base::hex. |
|
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.
Definition at line 168 of file stl_numeric.h. |
|
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.
Definition at line 136 of file stl_numeric.h. |
|
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). The comparison function should have the same effects on ordering as the function used for the initial sort. Definition at line 3508 of file stl_algo.h. References distance(). |
|
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 3454 of file stl_algo.h. References distance(). |
|
Definition at line 567 of file stl_iterator.h. |
|
Calls base.setf(ios_base::internal, ios_base::adjustfield).
Definition at line 901 of file ios_base.h. References ios_base::adjustfield, and ios_base::internal. |
|
Convenience interface to ctype.is(ctype_base::alnum, __c).
Definition at line 4556 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::alpha, __c).
Definition at line 4532 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::cntrl, __c).
Definition at line 4514 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::digit, __c).
Definition at line 4538 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::graph, __c).
Definition at line 4562 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::lower, __c).
Definition at line 4526 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::print, __c).
Definition at line 4508 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::punct, __c).
Definition at line 4544 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::space, __c).
Definition at line 4502 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::upper, __c).
Definition at line 4520 of file locale_facets.h. |
|
Convenience interface to ctype.is(ctype_base::xdigit, __c).
Definition at line 4550 of file locale_facets.h. |
|
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(). |
|
Calls base.setf(ios_base::left, ios_base::adjustfield).
Definition at line 909 of file ios_base.h. References ios_base::adjustfield, and ios_base::left. |
|
Performs "dictionary" comparison on ranges.
lexigraphical_compare , but uses the comp parameter instead of < .
Definition at line 853 of file stl_algobase.h. |
|
Performs "dictionary" comparison on ranges.
memcmp .
Definition at line 812 of file stl_algobase.h. Referenced by operator<(). |
|
Construct a heap over a range using comparison functor.
Definition at line 384 of file stl_heap.h. |
|
Construct a heap over a range.
Definition at line 344 of file stl_heap.h. Referenced by partial_sort(), partial_sort_copy(), and priority_queue::priority_queue(). |
|
A convenience wrapper for creating a pair from two objects.
Definition at line 144 of file stl_pair.h. |
|
This does what you think it does.
Definition at line 248 of file stl_algobase.h. |
|
This does what you think it does.
Definition at line 206 of file stl_algobase.h. Referenced by basic_istream::ignore(), operator>>(), basic_istream::operator>>(), and basic_stringbuf::overflow(). |
|
Return the maximum element in a range using comparison functor.
Definition at line 4569 of file stl_algo.h. |
|
Return the maximum element in a range.
Definition at line 4542 of file stl_algo.h. Referenced by valarray::max(). |
|
Merges two sorted ranges.
The comparison function should have the same effects on ordering as the function used for the initial sort. Definition at line 3035 of file stl_algo.h. References copy(). |
|
Merges two sorted ranges.
Definition at line 2977 of file stl_algo.h. References copy(). |
|
This does what you think it does.
Definition at line 228 of file stl_algobase.h. |
|
This does what you think it does.
Definition at line 184 of file stl_algobase.h. Referenced by basic_string::compare(), basic_string< char >::compare(), basic_istream::ignore(), basic_istream::operator>>(), basic_stringbuf::overflow(), __gnu_cxx::random_sample_n(), basic_istream::readsome(), basic_string::rfind(), basic_filebuf::underflow(), basic_streambuf::xsgetn(), and basic_streambuf::xsputn(). |
|
Return the minimum element in a range using comparison functor.
Definition at line 4621 of file stl_algo.h. |
|
Return the minimum element in a range.
Definition at line 4594 of file stl_algo.h. Referenced by valarray::min(). |
|
Finds the places in ranges which don't match.
Definition at line 719 of file stl_algobase.h. |
|
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. |
|
Permute range into the next "dictionary" ordering using comparison functor.
Definition at line 4712 of file stl_algo.h. References iter_swap(), and reverse(). |
|
Permute range into the next "dictionary" ordering.
Definition at line 4656 of file stl_algo.h. References iter_swap(), and reverse(). |
|
Calls base.unsetf(ios_base::boolalpha).
Definition at line 796 of file ios_base.h. References ios_base::boolalpha. |
|
Calls base.unsetf(ios_base::showbase).
Definition at line 812 of file ios_base.h. References ios_base::showbase. |
|
Calls base.unsetf(ios_base::showpoint).
Definition at line 828 of file ios_base.h. References ios_base::showpoint. |
|
Calls base.unsetf(ios_base::showpos).
Definition at line 844 of file ios_base.h. References ios_base::showpos. |
|
Calls base.unsetf(ios_base::skipws).
Definition at line 860 of file ios_base.h. References ios_base::skipws. |
|
Calls base.unsetf(ios_base::unitbuf).
Definition at line 892 of file ios_base.h. References ios_base::unitbuf. |
|
Calls base.unsetf(ios_base::uppercase).
Definition at line 876 of file ios_base.h. References ios_base::uppercase. |
|
Sort a sequence just enough to find a particular position using a predicate for comparison.
[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 3750 of file stl_algo.h. References __median(). |
|
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 3699 of file stl_algo.h. References __median(). |
|
Calls base.setf(ios_base::oct, ios_base::basefield).
Definition at line 942 of file ios_base.h. References ios_base::basefield, and ios_base::oct. |
|
Global bitwise operations on bitsets.
|
|
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. |
|
Based on operator==.
Definition at line 952 of file stl_vector.h. |
|
Based on operator==.
Definition at line 250 of file stl_stack.h. |
|
Returns !(x == y).
|
|
Based on operator==.
Definition at line 275 of file stl_queue.h. |
|
Uses
Definition at line 109 of file stl_pair.h. |
|
Returns !(x == y).
Definition at line 551 of file stl_multiset.h. |
|
Based on operator==.
Definition at line 644 of file stl_multimap.h. |
|
Based on operator==.
|
|
Based on operator==.
Definition at line 1214 of file stl_list.h. |
|
Based on operator==.
Definition at line 1498 of file stl_deque.h. |
|
Test difference of string and C string.
Definition at line 2189 of file basic_string.h. |
|
Test difference of C string and string.
Definition at line 2177 of file basic_string.h. References basic_string::compare(). |
|
Test difference of two strings.
Definition at line 2165 of file basic_string.h. References basic_string::compare(). |
|
Concatenate string and character.
Definition at line 2110 of file basic_string.h. |
|
Concatenate string and C string.
Definition at line 2094 of file basic_string.h. References basic_string::append(). |
|
Concatenate character and string.
Definition at line 681 of file basic_string.tcc. References basic_string::size(). |
|
Concatenate C string and string.
Definition at line 665 of file basic_string.tcc. References basic_string::size(). |
|
Concatenate two strings.
Definition at line 2057 of file basic_string.h. References basic_string::append(). |
|
Vector ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 945 of file stl_vector.h. References lexicographical_compare(). |
|
Stack ordering relation.
< , and std::lexicographical_compare() is usually used to make the determination.
Definition at line 244 of file stl_stack.h. |
|
Set ordering relation.
< .See std::lexicographical_compare() for how the determination is made. |
|
Queue ordering relation.
< , and std::lexicographical_compare() is usually used to make the determination.
Definition at line 269 of file stl_queue.h. |
|
<http://gcc.gnu.org/onlinedocs/libstdc++/20_util/howto.html#pairlt>
Definition at line 102 of file stl_pair.h. |
|
Multiset ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 544 of file stl_multiset.h. |
|
Multimap ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 637 of file stl_multimap.h. |
|
Map ordering relation.
< .See std::lexicographical_compare() for how the determination is made. |
|
List ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 1207 of file stl_list.h. References lexicographical_compare(). |
|
Deque ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 1490 of file stl_deque.h. References lexicographical_compare(). |
|
Test if C string precedes string.
Definition at line 2226 of file basic_string.h. References basic_string::compare(). |
|
Test if string precedes C string.
Definition at line 2214 of file basic_string.h. |
|
Test if string precedes string.
Definition at line 2202 of file basic_string.h. |
|
String inserters.
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 538 of file ostream.tcc. References ios_base::badbit. |
|
Character inserters.
out.width(0) is then called.
If c is of type Definition at line 478 of file ostream.tcc. References ios_base::badbit. |
|
Write string to a stream.
Definition at line 648 of file ostream.tcc. |
|
Based on operator<.
Definition at line 964 of file stl_vector.h. |
|
Based on operator<.
Definition at line 262 of file stl_stack.h. |
|
Returns !(y < x).
|
|
Based on operator<.
Definition at line 288 of file stl_queue.h. |
|
Uses
Definition at line 121 of file stl_pair.h. |
|
Returns !(y < x).
Definition at line 565 of file stl_multiset.h. |
|
Based on operator<.
Definition at line 658 of file stl_multimap.h. |
|
Based on operator<.
|
|
Based on operator<.
Definition at line 1226 of file stl_list.h. |
|
Based on operator<.
Definition at line 1512 of file stl_deque.h. |
|
Test if C string doesn't follow string.
Definition at line 2300 of file basic_string.h. References basic_string::compare(). |
|
Test if string doesn't follow C string.
Definition at line 2288 of file basic_string.h. |
|
Test if string doesn't follow string.
Definition at line 2276 of file basic_string.h. |
|
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. |
|
Vector equality comparison.
Definition at line 928 of file stl_vector.h. References vector::begin(), vector::end(), equal(), and vector::size(). |
|
Stack equality comparison.
Definition at line 226 of file stl_stack.h. References stack::c. |
|
Set equality comparison.
Definition at line 536 of file stl_set.h. References set::_M_t. |
|
Queue equality comparison.
Definition at line 250 of file stl_queue.h. References queue::c. |
|
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. |
|
Multiset equality comparison.
Definition at line 527 of file stl_multiset.h. References multiset::_M_t. |
|
Multimap equality comparison.
Definition at line 620 of file stl_multimap.h. References multimap::_M_t. |
|
Map equality comparison.
Definition at line 638 of file stl_map.h. References map::_M_t. |
|
List equality comparison.
Definition at line 1178 of file stl_list.h. References list::begin(), and list::end(). |
|
Definition at line 277 of file stl_iterator.h. References reverse_iterator::base(). |
|
Deque equality comparison.
Definition at line 1472 of file stl_deque.h. References deque::begin(), deque::end(), equal(), and deque::size(). |
|
Test equivalence of string and C string.
Definition at line 2152 of file basic_string.h. |
|
Test equivalence of C string and string.
Definition at line 2140 of file basic_string.h. References basic_string::compare(). |
|
Test equivalence of two strings.
Definition at line 2128 of file basic_string.h. |
|
Based on operator<.
Definition at line 958 of file stl_vector.h. |
|
Based on operator<.
Definition at line 256 of file stl_stack.h. |
|
Returns y < x.
|
|
Based on operator<.
Definition at line 282 of file stl_queue.h. |
|
Uses
Definition at line 115 of file stl_pair.h. |
|
Returns y < x.
Definition at line 558 of file stl_multiset.h. |
|
Based on operator<.
Definition at line 651 of file stl_multimap.h. |
|
Based on operator<.
|
|
Based on operator<.
Definition at line 1220 of file stl_list.h. |
|
Based on operator<.
Definition at line 1505 of file stl_deque.h. |
|
Test if C string follows string.
Definition at line 2263 of file basic_string.h. References basic_string::compare(). |
|
Test if string follows C string.
Definition at line 2251 of file basic_string.h. |
|
Test if string follows string.
Definition at line 2239 of file basic_string.h. |
|
Based on operator<.
Definition at line 970 of file stl_vector.h. |
|
Based on operator<.
Definition at line 268 of file stl_stack.h. |
|
Returns !(x < y).
|
|
Based on operator<.
Definition at line 295 of file stl_queue.h. |
|
Uses
Definition at line 127 of file stl_pair.h. |
|
Returns !(x < y).
Definition at line 572 of file stl_multiset.h. |
|
Based on operator<.
Definition at line 665 of file stl_multimap.h. |
|
Based on operator<.
|
|
Based on operator<.
Definition at line 1232 of file stl_list.h. |
|
Based on operator<.
Definition at line 1519 of file stl_deque.h. |
|
Test if C string doesn't precede string.
Definition at line 2337 of file basic_string.h. References basic_string::compare(). |
|
Test if string doesn't precede C string.
Definition at line 2325 of file basic_string.h. |
|
Test if string doesn't precede string.
Definition at line 2313 of file basic_string.h. |
|
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 1220 of file bitset. References bitset::_M_copy_from_string(), ios_base::badbit, basic_string::empty(), ios_base::eofbit, ios_base::failbit, ios_base::goodbit, basic_string::push_back(), basic_string::reserve(), basic_streambuf::sbumpc(), and basic_streambuf::sputbackc(). |
|
Character string extractors.
n characters and stores them into the array starting at s. n is defined as:
Characters are extracted and stored until one of the following happens:
If no characters are extracted, sets failbit. Definition at line 1050 of file istream.tcc. References ios_base::badbit, ios_base::eofbit, ios_base::failbit, ios_base::goodbit, and max(). |
|
Character extractors.
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(). |
|
Read stream into a string.
Definition at line 1130 of file istream.tcc. References basic_string::append(), ios_base::badbit, ios_base::eofbit, basic_string::erase(), ios_base::failbit, ios_base::goodbit, and basic_string::max_size(). |
|
Sort the smallest elements of a sequence using a predicate for comparison.
(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 2316 of file stl_algo.h. References make_heap(), and sort_heap(). |
|
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 2275 of file stl_algo.h. References make_heap(), and sort_heap(). |
|
Copy the smallest elements of a sequence using a predicate for comparison.
[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 2422 of file stl_algo.h. References make_heap(), and sort_heap(). |
|
Copy the smallest elements of a sequence.
[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 2358 of file stl_algo.h. References make_heap(), and sort_heap(). |
|
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.
Definition at line 239 of file stl_numeric.h. |
|
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.
Definition at line 199 of file stl_numeric.h. |
|
Move elements for which a predicate is true to the beginning of a sequence.
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 1875 of file stl_algo.h. |
|
Pop an element off a heap using comparison functor.
Definition at line 319 of file stl_heap.h. |
|
Pop an element off a heap.
Definition at line 253 of file stl_heap.h. Referenced by priority_queue::pop(), and sort_heap(). |
|
Permute range into the previous "dictionary" ordering using comparison functor.
Definition at line 4823 of file stl_algo.h. References iter_swap(), and reverse(). |
|
Permute range into the previous "dictionary" ordering.
Definition at line 4767 of file stl_algo.h. References iter_swap(), and reverse(). |
|
Push an element onto a heap using comparison functor.
Definition at line 189 of file stl_heap.h. |
|
Push an element onto a heap.
Definition at line 141 of file stl_heap.h. Referenced by priority_queue::push(). |
|
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 1781 of file stl_algo.h. References iter_swap(). |
|
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 1754 of file stl_algo.h. References iter_swap(). |
|
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 Definition at line 1100 of file stl_algo.h. References remove_copy(). |
|
Copy a sequence, removing elements of a given value.
[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 1025 of file stl_algo.h. Referenced by remove(). |
|
Copy a sequence, removing elements for which a predicate is true.
[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 1062 of file stl_algo.h. Referenced by remove_if(). |
|
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 Definition at line 1135 of file stl_algo.h. References remove_copy_if(). |
|
Replace each occurrence of one value in a sequence with another value.
i in the range [first,last) if *i == old_value then the assignment *i = new_value is performed.
Definition at line 844 of file stl_algo.h. |
|
Copy a sequence, replacing each element of one value with another value.
[first,last) to the output range [result,result+(last-first)) replacing elements equal to old_value with new_value .
Definition at line 908 of file stl_algo.h. |
|
Copy a sequence, replacing each value for which a predicate returns true with another value.
[first,last) to the range [result,result+(last-first)) replacing elements for which pred returns true with new_value .
Definition at line 942 of file stl_algo.h. |
|
Replace each value in a sequence for which a predicate returns true with another value.
i in the range [first,last) if pred(*i) is true then the assignment *i = new_value is performed.
Definition at line 875 of file stl_algo.h. |
|
Manipulator for
|
|
The companion to get_temporary_buffer().
|
|
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 1463 of file stl_algo.h. Referenced by next_permutation(), and prev_permutation(). |
|
Copy a sequence, reversing its elements.
[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 1489 of file stl_algo.h. |
|
Calls base.setf(ios_base::right, ios_base::adjustfield).
Definition at line 917 of file ios_base.h. References ios_base::adjustfield, and ios_base::right. |
|
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
Performs Definition at line 1696 of file stl_algo.h. |
|
Copy a sequence, rotating its elements.
[first,last) to the range beginning at
* (result+(n+(last-middle))%(last-first))=*(first+n) for each n in the range [0,last-first).
Definition at line 1729 of file stl_algo.h. References copy(). |
|
Calls base.setf(ios_base::scientific, ios_base::floatfield).
Definition at line 959 of file ios_base.h. References ios_base::floatfield, and ios_base::scientific. |
|
Search a sequence for a matching sub-sequence using a predicate.
[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. |
|
Search a sequence for a matching sub-sequence.
[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 Definition at line 476 of file stl_algo.h. Referenced by basic_string::find(). |
|
Search a sequence for a number of consecutive values using a predicate.
[first,last) for count consecutive elements for which the predicate returns true.
Definition at line 678 of file stl_algo.h. |
|
Search a sequence for a number of consecutive values.
[first,last) for count consecutive elements equal to val .
Definition at line 625 of file stl_algo.h. |
|
Takes a replacement handler as the argument, returns the previous handler.
|
|
Takes a new handler function as an argument, returns the old function.
|
|
Takes a new handler function as an argument, returns the old function.
|
|
Manipulator for
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.
|
|
Manipulator for
fill(c) for that object.
|
|
Manipulator for
|
|
Manipulator for
precision(n) for that object.
|
|
Manipulator for
width(n) for that object.
|
|
Calls base.setf(ios_base::showbase).
Definition at line 804 of file ios_base.h. References ios_base::showbase. |
|
Calls base.setf(ios_base::showpoint).
Definition at line 820 of file ios_base.h. References ios_base::showpoint. |
|
Calls base.setf(ios_base::showpos).
Definition at line 836 of file ios_base.h. References ios_base::showpos. |
|
Calls base.setf(ios_base::skipws).
Definition at line 852 of file ios_base.h. References ios_base::skipws. |
|
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 Definition at line 2591 of file stl_algo.h. |
|
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 Definition at line 2557 of file stl_algo.h. |
|
Sort a heap using comparison functor.
Definition at line 448 of file stl_heap.h. References pop_heap(). |
|
Sort a heap.
Definition at line 422 of file stl_heap.h. References pop_heap(). Referenced by partial_sort(), and partial_sort_copy(). |
|
Move elements for which a predicate is true to the beginning of a sequence, preserving relative ordering.
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 1986 of file stl_algo.h. |
|
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 Definition at line 3658 of file stl_algo.h. |
|
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 Definition at line 3617 of file stl_algo.h. |
|
See std::vector::swap().
Definition at line 976 of file stl_vector.h. References vector::swap(). |
|
See std::set::swap().
Definition at line 588 of file stl_set.h. References set::swap(). |
|
Definition at line 579 of file stl_multiset.h. References multiset::swap(). |
|
Definition at line 672 of file stl_multimap.h. References multimap::swap(). |
|
See std::map::swap().
Definition at line 690 of file stl_map.h. References map::swap(). |
|
See std::list::swap().
Definition at line 1238 of file stl_list.h. References list::swap(). |
|
See std::deque::swap().
Definition at line 1526 of file stl_deque.h. References deque::swap(). |
|
Swaps two values.
Definition at line 92 of file stl_algobase.h. |
|
Swap contents of two strings.
Definition at line 2350 of file basic_string.h. Referenced by vector< _Node *, _Nodeptr_Alloc >::swap(), list::swap(), deque::swap(), and std::tr1::swap(). |
|
Swap the elements of two sequences.
[first1,last1) with the corresponding element in the range [first2,(last1-first1)). The ranges must not overlap.
Definition at line 739 of file stl_algo.h. References iter_swap(). |
|
The runtime will call this function if exception handling must be abandoned for any reason. It can also be called by the user. |
|
Convenience interface to ctype.tolower(__c).
Definition at line 4574 of file locale_facets.h. |
|
Convenience interface to ctype.toupper(__c).
Definition at line 4568 of file locale_facets.h. |
|
Perform an operation on corresponding elements of two sequences.
* (result+N)=binary_op(*(first1+N),*(first2+N)) for each N in the range [0,last1-first1).
Definition at line 813 of file stl_algo.h. |
|
Perform an operation on a sequence.
* (result+N)=unary_op(*(first+N)) for each N in the range [0,last-first).
Definition at line 778 of file stl_algo.h. |
|
[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
2: "When |
|
The runtime will call this function if an exception is thrown which violates the function's exception specification. |
|
Copies the range [first,last) into result.
Definition at line 107 of file stl_uninitialized.h. |
|
Copies the value x into the range [first,last).
Definition at line 169 of file stl_uninitialized.h. |
|
Copies the value x into the range [first,first+n).
Definition at line 214 of file stl_uninitialized.h. |
|
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 1380 of file stl_algo.h. References adjacent_find(). |
|
Remove consecutive duplicate values from a sequence.
last are still present, but their value is unspecified.
Definition at line 1341 of file stl_algo.h. References adjacent_find(). |
|
Copy a sequence, removing consecutive values using a 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 1308 of file stl_algo.h. |
|
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 1272 of file stl_algo.h. |
|
Calls base.setf(ios_base::unitbuf).
Definition at line 884 of file ios_base.h. References ios_base::unitbuf. |
|
Calls base.setf(ios_base::uppercase).
Definition at line 868 of file ios_base.h. References ios_base::uppercase. |
|
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.
Definition at line 110 of file locale_facets.tcc. |
|
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, 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. |
|
Linked to standard error (unbuffered).
|
|
Linked to standard input.
|
|
Linked to standard error (buffered).
|
|
Linked to standard output.
|
|
Linked to standard error (unbuffered).
|
|
Linked to standard input.
|
|
Linked to standard error (buffered).
|
|
Linked to standard output.
|