new
. More...
|
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. Referenced by fpos::fpos(), fpos::operator+(), fpos::operator+=(), fpos::operator-(), and fpos::operator-=(). |
|
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. Referenced by num_put::do_put(), operator<<(), operator>>(), ios_base::precision(), and ios_base::width(). |
|
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. |
|
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.
|
|
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.
|
|
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.
|
|
Return differences between adjacent values. Computes the difference between adjacent values in the range [first,last) using operator-() and writes the result to result.
|
|
Find two adjacent values in a sequence using a predicate.
|
|
Find two adjacent values in a sequence that are equal.
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 Referenced by equal_range(), lower_bound(), and upper_bound(). |
|
|
|
Calls base.setf(ios_base::boolalpha). Definition at line 745 of file ios_base.h. References 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 340 of file stl_algobase.h. Referenced by basic_string::assign(), basic_string::copy(), vector::erase(), deque::erase(), basic_string::insert(), merge(), vector::operator=(), deque::operator=(), basic_string::replace(), rotate_copy(), set_difference(), set_symmetric_difference(), and set_union(). |
|
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 469 of file stl_algobase.h. Referenced by deque::erase(). |
|
Count the number of copies of a value in a sequence.
|
|
Count the elements of a sequence for which a predicate is true.
|
|
Calls base.setf(ios_base::dec, ios_base::basefield). Definition at line 883 of file ios_base.h. References ios_base::setf(). |
|
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 Referenced by equal_range(), inplace_merge(), lower_bound(), list::size(), and upper_bound(). |
|
Tests a range for element-wise equality.
|
|
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 714 of file stl_algobase.h.
Referenced by operator==(). |
|
Fills the range [first,last) with copies of value.
memset . Definition at line 525 of file stl_algobase.h. |
|
Fills the range [first,first+n) with copies of value.
memset . Definition at line 601 of file stl_algobase.h. |
|
Find the first occurrence of a value in a sequence.
Referenced by basic_string::find(), basic_string::find_first_not_of(), basic_string::find_first_of(), basic_string::find_last_not_of(), basic_string::find_last_of(), remove(), search(), and search_n(). |
|
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 |
|
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 |
|
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 4905 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 4868 of file stl_algo.h. |
|
Find the first element in a sequence for which a predicate is true.
Referenced by remove_if(). |
|
Calls base.setf(ios_base::fixed, ios_base::floatfield). Definition at line 908 of file ios_base.h. References ios_base::setf(). |
|
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. |
|
|
|
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. |
|
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 1274 of file istream.tcc. |
|
Read a line from stream into a string.
References basic_string::append(), basic_string::erase(), ios_base::iostate, and basic_string::max_size(). |
|
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.
|
|
Calls base.setf(ios_base::hex, ios_base::basefield). Definition at line 891 of file ios_base.h. References ios_base::setf(). |
|
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.
|
|
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.
|
|
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 3494 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 3440 of file stl_algo.h. References distance(). |
|
References operator+(). |
|
Calls base.setf(ios_base::internal, ios_base::adjustfield). Definition at line 858 of file ios_base.h. References ios_base::setf(). |
|
Convenience interface to ctype.is(). Definition at line 4500 of file locale_facets.h. |
|
Swaps the contents of two iterators.
Referenced by next_permutation(), prev_permutation(), random_shuffle(), and swap_ranges(). |
|
Calls base.setf(ios_base::left, ios_base::adjustfield). Definition at line 866 of file ios_base.h. References ios_base::setf(). |
|
Performs "dictionary" comparison on ranges.
lexigraphical_compare , but uses the comp parameter instead of < . Definition at line 817 of file stl_algobase.h. |
|
Performs "dictionary" comparison on ranges.
memcmp . Definition at line 778 of file stl_algobase.h.
Referenced by operator<(). |
|
Construct a heap over a range using comparison functor.
|
|
Construct a heap over a range.
Referenced by partial_sort(), partial_sort_copy(), and priority_queue::priority_queue(). |
|
A convenience wrapper for creating a pair from two objects.
|
|
This does what you think it does.
|
|
This does what you think it does.
|
|
Return the maximum element in a range using comparison functor.
|
|
Return the maximum element in a range.
|
|
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 3021 of file stl_algo.h. References copy(). |
|
Merges two sorted ranges.
References copy(). |
|
This does what you think it does.
|
|
This does what you think it does.
Referenced by basic_string::compare(), basic_string< char >::compare(), and basic_string::rfind(). |
|
Return the minimum element in a range using comparison functor.
|
|
Return the minimum element in a range.
|
|
Finds the places in ranges which don't match.
|
|
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 648 of file stl_algobase.h. |
|
Permute range into the next "dictionary" ordering using comparison functor.
References iter_swap(), and reverse(). |
|
Permute range into the next "dictionary" ordering.
References iter_swap(), and reverse(). |
|
Calls base.unsetf(ios_base::boolalpha). Definition at line 753 of file ios_base.h. References ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::showbase). Definition at line 769 of file ios_base.h. References ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::showpoint). Definition at line 785 of file ios_base.h. References ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::showpos). Definition at line 801 of file ios_base.h. References ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::skipws). Definition at line 817 of file ios_base.h. References ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::unitbuf). Definition at line 849 of file ios_base.h. References ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::uppercase). Definition at line 833 of file ios_base.h. References ios_base::unsetf(). |
|
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 3736 of file stl_algo.h. |
|
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 3685 of file stl_algo.h. |
|
Calls base.setf(ios_base::oct, ios_base::basefield). Definition at line 899 of file ios_base.h. References ios_base::setf(). |
|
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 1204 of file stl_list.h. |
|
Based on operator==. Definition at line 1483 of file stl_deque.h. |
|
Test difference of string and C string.
|
|
Test difference of C string and string.
References basic_string::compare(). |
|
Test difference of two strings.
References basic_string::compare(). |
|
Concatenate string and character.
|
|
Concatenate string and C string.
References basic_string::append(). |
|
Concatenate character and string.
References basic_string::size(). |
|
Concatenate C string and string.
References basic_string::reserve(), and basic_string::size(). |
|
Concatenate two strings.
References basic_string::append(). Referenced by inserter(). |
|
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. Definition at line 553 of file stl_set.h. |
|
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. Definition at line 655 of file stl_map.h. |
|
List ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 1197 of file stl_list.h. References lexicographical_compare(). |
|
Deque ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 1475 of file stl_deque.h. References lexicographical_compare(). |
|
Test if C string precedes string.
References basic_string::compare(). |
|
Test if string precedes C string.
|
|
Test if string precedes string.
|
|
Write string to a stream.
References streamsize. |
|
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 1216 of file stl_list.h. |
|
Based on operator<. Definition at line 1497 of file stl_deque.h. |
|
Test if C string doesn't follow string.
References basic_string::compare(). |
|
Test if string doesn't follow C string.
|
|
Test if string doesn't follow string.
|
|
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.
References vector::begin(), vector::end(), equal(), and vector::size(). |
|
Stack equality comparison.
References stack::c. |
|
Set equality comparison.
|
|
Queue equality comparison.
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.
|
|
Multimap equality comparison.
|
|
Map equality comparison.
|
|
List equality comparison.
References list::begin(), and list::end(). |
|
|
|
Deque equality comparison.
References deque::begin(), deque::end(), equal(), and deque::size(). |
|
Test equivalence of string and C string.
|
|
Test equivalence of C string and string.
References basic_string::compare(). |
|
Test equivalence of two strings.
|
|
Based on operator<. Definition at line 958 of file stl_vector.h. References operator>(). |
|
Based on operator<. Definition at line 256 of file stl_stack.h. |
|
Returns y < x. Definition at line 567 of file stl_set.h. References operator>(). |
|
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. References operator>(). |
|
Based on operator<. Definition at line 651 of file stl_multimap.h. References operator>(). |
|
Based on operator<. Definition at line 669 of file stl_map.h. References operator>(). |
|
Based on operator<. Definition at line 1210 of file stl_list.h. References operator>(). |
|
Based on operator<. Definition at line 1490 of file stl_deque.h. |
|
Test if C string follows string.
References basic_string::compare(). |
|
Test if string follows C string.
|
|
Test if string follows string.
Referenced by operator>(). |
|
Based on operator<. Definition at line 970 of file stl_vector.h. References operator>=(). |
|
Based on operator<. Definition at line 268 of file stl_stack.h. |
|
Returns !(x < y). Definition at line 581 of file stl_set.h. References operator>=(). |
|
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. References operator>=(). |
|
Based on operator<. Definition at line 665 of file stl_multimap.h. References operator>=(). |
|
Based on operator<. Definition at line 683 of file stl_map.h. References operator>=(). |
|
Based on operator<. Definition at line 1222 of file stl_list.h. References operator>=(). |
|
Based on operator<. Definition at line 1504 of file stl_deque.h. |
|
Test if C string doesn't precede string.
References basic_string::compare(). |
|
Test if string doesn't precede C string.
|
|
Test if string doesn't precede string.
Referenced by operator>=(). |
|
Read stream into a string.
References basic_string::append(), basic_string::erase(), ios_base::iostate, basic_string::max_size(), operator>>(), and streamsize. Referenced by operator>>(). |
|
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 2302 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 2261 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 2408 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 2344 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.
|
|
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.
|
|
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 1860 of file stl_algo.h. |
|
Pop an element off a heap using comparison functor.
|
|
Pop an element off a heap.
Referenced by priority_queue::pop(), and sort_heap(). |
|
Permute range into the previous "dictionary" ordering using comparison functor.
References iter_swap(), and reverse(). |
|
Permute range into the previous "dictionary" ordering.
References iter_swap(), and reverse(). |
|
Push an element onto a heap using comparison functor.
|
|
Push an element onto a heap.
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 1766 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 1739 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 References find(), and 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 References find_if(), and 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. |
|
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 1455 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 1481 of file stl_algo.h. |
|
Calls base.setf(ios_base::right, ios_base::adjustfield). Definition at line 874 of file ios_base.h. References ios_base::setf(). |
|
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 |
|
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 1714 of file stl_algo.h.
References copy(). |
|
Calls base.setf(ios_base::scientific, ios_base::floatfield). Definition at line 916 of file ios_base.h. References ios_base::setf(). |
|
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.
|
|
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 References find(). 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.
References find(). |
|
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.
|
|
Calls base.setf(ios_base::showbase). Definition at line 761 of file ios_base.h. References ios_base::setf(). |
|
Calls base.setf(ios_base::showpoint). Definition at line 777 of file ios_base.h. References ios_base::setf(). |
|
Calls base.setf(ios_base::showpos). Definition at line 793 of file ios_base.h. References ios_base::setf(). |
|
Calls base.setf(ios_base::skipws). Definition at line 809 of file ios_base.h. References ios_base::setf(). |
|
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 |
|
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 |
|
Sort a heap using comparison functor.
References pop_heap(). |
|
Sort a heap.
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 1971 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 |
|
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 |
|
See std::vector::swap(). Definition at line 976 of file stl_vector.h. References vector::swap(), and swap(). |
|
See std::set::swap(). Definition at line 588 of file stl_set.h. References set::swap(), and swap(). |
|
Definition at line 579 of file stl_multiset.h. References multiset::swap(), and swap(). |
|
Definition at line 672 of file stl_multimap.h. References multimap::swap(), and swap(). |
|
See std::map::swap(). Definition at line 690 of file stl_map.h. References map::swap(), and swap(). |
|
See std::list::swap(). Definition at line 1228 of file stl_list.h. References list::swap(), and swap(). |
|
See std::deque::swap(). Definition at line 1511 of file stl_deque.h. References deque::swap(). |
|
Swaps two values.
|
|
Swap contents of two strings.
Referenced by vector< Block_pair, BPVec_allocator_type >::swap(), set< Key, Compare, Allocator >::swap(), multiset< Key, Compare, Allocator >::swap(), multimap< Key, Type, Compare, Allocator >::swap(), map< Key, Type, Compare, Allocator >::swap(), swap(), list::swap(), and deque::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. |
|
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).
|
|
Perform an operation on a sequence.
* (result+N)=unary_op(*(first+N)) for each N in the range [0,last-first).
|
|
[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.
|
|
Copies the value x into the range [first,last).
|
|
Copies the value x into the range [first,first+n).
|
|
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 1382 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 1343 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 1310 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 1274 of file stl_algo.h. |
|
Calls base.setf(ios_base::unitbuf). Definition at line 841 of file ios_base.h. References ios_base::setf(). |
|
Calls base.setf(ios_base::uppercase). Definition at line 825 of file ios_base.h. References ios_base::setf(). |
|
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.
|