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 211 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 213 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 107 of file stl_numeric.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 81 of file stl_numeric.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 313 of file stl_numeric.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 274 of file stl_numeric.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Find two adjacent values in a sequence using a predicate.
Definition at line 393 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Find two adjacent values in a sequence that are equal.
Definition at line 362 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. 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 173 of file stl_iterator_base_funcs.h. References __advance(), and __iterator_category(). Referenced by __find_end(), __inplace_stable_partition(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), std::vector< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Allocator >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::vector< _Tp, _Alloc >::_M_range_insert(), equal_range(), lower_bound(), and upper_bound(). |
|
Definition at line 446 of file stl_iterator.h. |
|
Calls base.setf(ios_base::boolalpha).
Definition at line 788 of file ios_base.h. References std::ios_base::setf(). Referenced by noboolalpha(). |
|
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 389 of file stl_algobase.h. References std::__copy_normal<, >::__copy_n(), __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 526 of file stl_algobase.h. References std::__copy_backward_normal<, >::__copy_b_n(), __glibcxx_function_requires, and __glibcxx_requires_valid_range. Referenced by __insertion_sort(), __merge_backward(), __rotate_adaptive(), std::vector< _Tp, _Alloc >::_M_fill_insert(), std::vector< bool, _Alloc >::_M_fill_insert(), std::vector< _Tp, _Alloc >::_M_insert_aux(), std::vector< bool, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_insert_aux(), std::vector< bool, _Alloc >::_M_insert_range(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::deque< _Tp, _Alloc >::_M_reallocate_map(), and std::deque< _Tp, _Alloc >::erase(). |
|
Count the number of copies of a value in a sequence.
Definition at line 424 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Count the elements of a sequence for which a predicate is true.
Definition at line 448 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Calls base.setf(ios_base::dec, ios_base::basefield).
Definition at line 926 of file ios_base.h. References std::ios_base::setf(). Referenced by std::tr1::operator>>(), and operator>>(). |
|
|
Write a newline and flush the stream. This manipulator is often mistakenly used when a simple newline is desired, leading to poor buffering performance. See http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 for more on this subject. Definition at line 545 of file ostream. References flush(), std::basic_ostream< _CharT, _Traits >::put(), and std::basic_ios< _CharT, _Traits >::widen(). |
|
Write a null character into the output sequence.
"Null character" is Definition at line 556 of file ostream. References std::basic_ostream< _CharT, _Traits >::put(). |
|
Tests a range for element-wise equality.
Definition at line 804 of file stl_algobase.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 771 of file stl_algobase.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. Referenced by operator==(), and std::tr1::operator==(). |
|
Fills the range [first,last) with copies of value.
memset .
Definition at line 583 of file stl_algobase.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and std::__fill<>::fill(). |
|
Fills the range [first,first+n) with copies of value.
memset .
Definition at line 659 of file stl_algobase.h. References __glibcxx_function_requires, and std::__fill_n<>::fill_n(). Referenced by __uninitialized_fill_n_aux(), std::vector< _Tp, _Alloc >::_M_fill_assign(), std::char_traits< __gnu_cxx::character< V, I, S > >::assign(), __gnu_cxx::char_traits< _CharT >::assign(), and std::tr1::array< _Tp, _Nm >::assign(). |
|
Find the first occurrence of a value in a sequence.
Definition at line 318 of file stl_algo.h. References __find(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category(). |
|
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 5483 of file stl_algo.h. References __find_end(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category(). |
|
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 5437 of file stl_algo.h. References __find_end(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category(). |
|
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 5258 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 5221 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. Referenced by __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_first_of(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::find_first_of(), and std::basic_string< _CharT, _Traits, _Allocator >::find_first_of(). |
|
Find the first element in a sequence for which a predicate is true.
Definition at line 340 of file stl_algo.h. References __find_if(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category(). Referenced by remove_if(). |
|
Calls base.setf(ios_base::fixed, ios_base::floatfield).
Definition at line 951 of file ios_base.h. References std::ios_base::setf(). |
|
Flushes the output stream.
This manipulator simply calls the stream's Definition at line 566 of file ostream. References std::basic_ostream< _CharT, _Traits >::flush(). Referenced by __gnu_cxx::sequence_buffer< _Sequence, _Buf_sz >::append(), endl(), __gnu_cxx::sequence_buffer< _Sequence, _Buf_sz >::push_back(), and __gnu_cxx::sequence_buffer< _Sequence, _Buf_sz >::~sequence_buffer(). |
|
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 153 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Definition at line 520 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 1125 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 1151 of file stl_algo.h. References __glibcxx_function_requires. |
|
Allocates a temporary buffer.
This function tries to obtain storage for Provides the nothrow exception guarantee. Definition at line 110 of file memory. References __get_temporary_buffer(). Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer(). |
|
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 2188 of file vstring.h. References getline(), and std::basic_ios< _CharT, _Traits >::widen(). |
|
Read a line from stream into a string.
Definition at line 619 of file vstring.tcc. References std::basic_ios< _CharT, _Traits >::_M_setstate(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::append(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::erase(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate(). |
|
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 2439 of file basic_string.h. References getline(), and std::basic_ios< _CharT, _Traits >::widen(). |
|
Read a line from stream into a string.
Definition at line 934 of file istream.tcc. References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::ios_base::eofbit, std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::ios_base::failbit, std::ios_base::goodbit, std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate(). Referenced by __gnu_debug::getline(), std::basic_istream< _CharT, _Traits >::getline(), and 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 90 of file locale_facets.tcc. |
|
Calls base.setf(ios_base::hex, ios_base::basefield).
Definition at line 934 of file ios_base.h. References std::ios_base::setf(). Referenced by operator>>(). |
|
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 167 of file stl_numeric.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 135 of file stl_numeric.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 3767 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_sorted_pred, __merge_adaptive(), __merge_without_buffer(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), distance(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size(). |
|
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 3713 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_sorted, __merge_adaptive(), __merge_without_buffer(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), distance(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size(). |
|
Definition at line 616 of file stl_iterator.h. Referenced by std::deque< _Tp, _Alloc >::_M_range_insert_aux(). |
|
Calls base.setf(ios_base::internal, ios_base::adjustfield).
Definition at line 901 of file ios_base.h. References std::ios_base::setf(). |
|
Convenience interface to ctype.is(ctype_base::alnum, __c).
Definition at line 4665 of file locale_facets.h. References std::ctype_base::alnum. |
|
Convenience interface to ctype.is(ctype_base::alpha, __c).
Definition at line 4641 of file locale_facets.h. References std::ctype_base::alpha. |
|
Convenience interface to ctype.is(ctype_base::cntrl, __c).
Definition at line 4623 of file locale_facets.h. References std::ctype_base::cntrl. |
|
Convenience interface to ctype.is(ctype_base::digit, __c).
Definition at line 4647 of file locale_facets.h. References std::ctype_base::digit. |
|
Convenience interface to ctype.is(ctype_base::graph, __c).
Definition at line 4671 of file locale_facets.h. References std::ctype_base::graph. |
|
Convenience interface to ctype.is(ctype_base::lower, __c).
Definition at line 4635 of file locale_facets.h. References std::ctype_base::lower. |
|
Convenience interface to ctype.is(ctype_base::print, __c).
Definition at line 4617 of file locale_facets.h. References std::ctype_base::print. |
|
Convenience interface to ctype.is(ctype_base::punct, __c).
Definition at line 4653 of file locale_facets.h. References std::ctype_base::punct. |
|
Convenience interface to ctype.is(ctype_base::space, __c).
Definition at line 4611 of file locale_facets.h. References std::ctype_base::space. |
|
Convenience interface to ctype.is(ctype_base::upper, __c).
Definition at line 4629 of file locale_facets.h. References std::ctype_base::upper. |
|
Convenience interface to ctype.is(ctype_base::xdigit, __c).
Definition at line 4659 of file locale_facets.h. References std::ctype_base::xdigit. |
|
Swaps the contents of two iterators.
Definition at line 143 of file stl_algobase.h. References __glibcxx_function_requires. Referenced by __introselect(), __merge_without_buffer(), __partition(), __reverse(), __unguarded_partition(), next_permutation(), prev_permutation(), random_shuffle(), and swap_ranges(). |
|
Calls base.setf(ios_base::left, ios_base::adjustfield).
Definition at line 909 of file ios_base.h. References std::ios_base::setf(). Referenced by __ostream_insert(). |
|
Performs "dictionary" comparison on ranges.
lexigraphical_compare , but uses the comp parameter instead of < .
Definition at line 876 of file stl_algobase.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Performs "dictionary" comparison on ranges.
memcmp .
Definition at line 835 of file stl_algobase.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. Referenced by lexicographical_compare(). |
|
Construct a heap over a range using comparison functor.
Definition at line 384 of file stl_heap.h. References __adjust_heap(), __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Construct a heap over a range.
Definition at line 344 of file stl_heap.h. References __adjust_heap(), __glibcxx_function_requires, and __glibcxx_requires_valid_range. Referenced by __heap_select(), partial_sort_copy(), and std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue(). |
|
A convenience wrapper for creating a pair from two objects.
Definition at line 144 of file stl_pair.h. Referenced by __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_get_distance(), std::tr1::__detail::_Prime_rehash_policy::_M_need_rehash(), std::__debug::set< _Key, _Compare, _Allocator >::equal_range(), std::__debug::multiset< _Key, _Compare, _Allocator >::equal_range(), std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >::equal_range(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::equal_range(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_multimap< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::insert(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::insert(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::insert_noresize(), and __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::insert_noresize(). |
|
This does what you think it does.
Definition at line 246 of file stl_algobase.h. |
|
This does what you think it does.
Definition at line 204 of file stl_algobase.h. References __glibcxx_function_requires. Referenced by __get_temporary_buffer(), std::tr1::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::_Hashtable(), std::num_get< _CharT, _InIter >::_M_extract_int(), std::vector< _Tp, _Alloc >::_M_fill_insert(), std::vector< bool, _Alloc >::_M_fill_insert(), std::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), std::vector< bool, _Alloc >::_M_insert_range(), std::tr1::__detail::_Prime_rehash_policy::_M_need_rehash(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::deque< _Tp, _Alloc >::_M_reallocate_map(), __gnu_cxx::rope< _CharT, _Alloc >::_S_apply_to_pieces(), std::basic_istream< _CharT, _Traits >::ignore(), operator>>(), and std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(). |
|
Return the maximum element in a range using comparison functor.
Definition at line 4908 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Return the maximum element in a range.
Definition at line 4881 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. Referenced by std::valarray< _Tp >::max(). |
|
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 3291 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_sorted_pred. |
|
Merges two sorted ranges.
Definition at line 3230 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_sorted. Referenced by __merge_adaptive(), and __merge_sort_loop(). |
|
This does what you think it does.
Definition at line 226 of file stl_algobase.h. |
|
This does what you think it does.
Definition at line 182 of file stl_algobase.h. References __glibcxx_function_requires. Referenced by __gnu_cxx::__lexicographical_compare_3way(), __merge_sort_loop(), __verify_grouping(), std::bitset< _Nb >::_M_copy_from_string(), std::num_get< _CharT, _InIter >::_M_extract_int(), std::time_get< _CharT, _InIter >::_M_extract_name(), __gnu_cxx::rope< _CharT, _Alloc >::_S_apply_to_pieces(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::compare(), std::basic_string< _CharT, _Traits, _Alloc >::compare(), std::basic_string< _CharT, _Traits, _Allocator >::compare(), std::basic_istream< _CharT, _Traits >::ignore(), lexicographical_compare(), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(), __gnu_cxx::random_sample_n(), std::basic_istream< _CharT, _Traits >::readsome(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::rfind(), std::basic_string< _CharT, _Traits, _Alloc >::rfind(), std::basic_filebuf< _CharT, _Traits >::underflow(), std::basic_streambuf< _CharT, _Traits >::xsgetn(), std::basic_streambuf< _CharT, _Traits >::xsputn(), and std::basic_filebuf< _CharT, _Traits >::xsputn(). |
|
Return the minimum element in a range using comparison functor.
Definition at line 4960 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Return the minimum element in a range.
Definition at line 4933 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. Referenced by std::valarray< _Tp >::min(). |
|
Finds the places in ranges which don't match.
Definition at line 742 of file stl_algobase.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 706 of file stl_algobase.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Permute range into the next "dictionary" ordering using comparison functor.
Definition at line 5051 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse(). |
|
Permute range into the next "dictionary" ordering.
Definition at line 4995 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse(). |
|
Calls base.unsetf(ios_base::boolalpha).
Definition at line 796 of file ios_base.h. References boolalpha(), and std::ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::showbase).
Definition at line 812 of file ios_base.h. References showbase(), and std::ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::showpoint).
Definition at line 828 of file ios_base.h. References showpoint(), and std::ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::showpos).
Definition at line 844 of file ios_base.h. References showpos(), and std::ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::skipws).
Definition at line 860 of file ios_base.h. References skipws(), and std::ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::unitbuf).
Definition at line 892 of file ios_base.h. References unitbuf(), and std::ios_base::unsetf(). |
|
Calls base.unsetf(ios_base::uppercase).
Definition at line 876 of file ios_base.h. References std::ios_base::unsetf(), and 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 4070 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __introselect(), and __lg(). |
|
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 4032 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __introselect(), and __lg(). |
|
Calls base.setf(ios_base::oct, ios_base::basefield).
Definition at line 942 of file ios_base.h. References std::ios_base::setf(). Referenced by operator>>(). |
|
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. References std::istream_iterator< _Tp, _CharT, _Traits, _Dist >::_M_equal(). |
|
Based on operator==.
Definition at line 963 of file stl_vector.h. |
|
Based on operator==.
Definition at line 238 of file stl_stack.h. |
|
Returns !(x == y).
|
|
Based on operator==.
Definition at line 263 of file stl_queue.h. |
|
Uses
Definition at line 109 of file stl_pair.h. |
|
Returns !(x == y).
Definition at line 531 of file stl_multiset.h. |
|
Based on operator==.
Definition at line 636 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 1575 of file stl_deque.h. |
|
Test difference of string and C string.
Definition at line 2203 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test difference of C string and string.
Definition at line 2191 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test difference of two strings.
Definition at line 2179 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Concatenate string and character.
Definition at line 2124 of file basic_string.h. |
|
Concatenate string and C string.
Definition at line 2108 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::append(). |
|
Concatenate character and string.
Definition at line 690 of file basic_string.tcc. References std::basic_string< _CharT, _Traits, _Alloc >::size(). |
|
Concatenate C string and string.
Definition at line 674 of file basic_string.tcc. References __glibcxx_requires_string, and std::basic_string< _CharT, _Traits, _Alloc >::size(). |
|
Concatenate two strings.
Definition at line 2071 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::append(). |
|
Vector ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 956 of file stl_vector.h. |
|
Stack ordering relation.
< , and std::lexicographical_compare() is usually used to make the determination.
Definition at line 232 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 257 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 524 of file stl_multiset.h. |
|
Multimap ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 629 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 1225 of file stl_list.h. |
|
Deque ordering relation.
< .See std::lexicographical_compare() for how the determination is made. Definition at line 1567 of file stl_deque.h. |
|
Test if C string precedes string.
Definition at line 2240 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test if string precedes C string.
Definition at line 2228 of file basic_string.h. |
|
Test if string precedes string.
Definition at line 2216 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.
|
|
Character inserters.
out.width(0) is then called.
If c is of type |
|
Write string to a stream.
Definition at line 2144 of file vstring.h. References __ostream_insert(). |
|
Write string to a stream.
Definition at line 2399 of file basic_string.h. |
|
Based on operator<.
Definition at line 975 of file stl_vector.h. |
|
Based on operator<.
Definition at line 250 of file stl_stack.h. |
|
Returns !(y < x).
|
|
Based on operator<.
Definition at line 275 of file stl_queue.h. |
|
Uses
Definition at line 121 of file stl_pair.h. |
|
Returns !(y < x).
Definition at line 545 of file stl_multiset.h. |
|
Based on operator<.
Definition at line 650 of file stl_multimap.h. |
|
Based on operator<.
|
|
Based on operator<.
Definition at line 1244 of file stl_list.h. |
|
Based on operator<.
Definition at line 1589 of file stl_deque.h. |
|
Test if C string doesn't follow string.
Definition at line 2314 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test if string doesn't follow C string.
Definition at line 2302 of file basic_string.h. |
|
Test if string doesn't follow string.
Definition at line 2290 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. References std::istream_iterator< _Tp, _CharT, _Traits, _Dist >::_M_equal(). |
|
Vector equality comparison.
Definition at line 939 of file stl_vector.h. References std::vector< _Tp, _Alloc >::begin(), std::vector< _Tp, _Alloc >::end(), equal(), and std::vector< _Tp, _Alloc >::size(). |
|
Stack equality comparison.
Definition at line 214 of file stl_stack.h. References std::stack< _Tp, _Sequence >::c. |
|
Set equality comparison.
Definition at line 521 of file stl_set.h. References std::set< _Key, _Compare, _Alloc >::_M_t. |
|
Queue equality comparison.
Definition at line 239 of file stl_queue.h. References std::queue< _Tp, _Sequence >::c. |
|
Two pairs of the same type are equal iff their members are equal.
Definition at line 96 of file stl_pair.h. References std::pair< _T1, _T2 >::first, and std::pair< _T1, _T2 >::second. |
|
Multiset equality comparison.
Definition at line 507 of file stl_multiset.h. References std::multiset< _Key, _Compare, _Alloc >::_M_t. |
|
Multimap equality comparison.
Definition at line 612 of file stl_multimap.h. References std::multimap< _Key, _Tp, _Compare, _Alloc >::_M_t. |
|
Map equality comparison.
Definition at line 682 of file stl_map.h. References std::map< _Key, _Tp, _Compare, _Alloc >::_M_t. |
|
List equality comparison.
Definition at line 1196 of file stl_list.h. References std::list< _Tp, _Alloc >::begin(), and std::list< _Tp, _Alloc >::end(). |
|
Definition at line 282 of file stl_iterator.h. References std::reverse_iterator< _Iterator >::base(). |
|
Deque equality comparison.
Definition at line 1549 of file stl_deque.h. References std::deque< _Tp, _Alloc >::begin(), std::deque< _Tp, _Alloc >::end(), equal(), and std::deque< _Tp, _Alloc >::size(). |
|
Test if equivalent to another position.
Definition at line 199 of file postypes.h. |
|
Test equivalence of string and C string.
Definition at line 2166 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test equivalence of C string and string.
Definition at line 2154 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test equivalence of two strings.
Definition at line 2142 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Based on operator<.
Definition at line 969 of file stl_vector.h. |
|
Based on operator<.
Definition at line 244 of file stl_stack.h. |
|
Returns y < x.
|
|
Based on operator<.
Definition at line 269 of file stl_queue.h. |
|
Uses
Definition at line 115 of file stl_pair.h. |
|
Returns y < x.
Definition at line 538 of file stl_multiset.h. |
|
Based on operator<.
Definition at line 643 of file stl_multimap.h. |
|
Based on operator<.
|
|
Based on operator<.
Definition at line 1238 of file stl_list.h. |
|
Based on operator<.
Definition at line 1582 of file stl_deque.h. |
|
Test if C string follows string.
Definition at line 2277 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test if string follows C string.
Definition at line 2265 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test if string follows string.
Definition at line 2253 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Based on operator<.
Definition at line 981 of file stl_vector.h. |
|
Based on operator<.
Definition at line 256 of file stl_stack.h. |
|
Returns !(x < y).
|
|
Based on operator<.
Definition at line 281 of file stl_queue.h. |
|
Uses
Definition at line 127 of file stl_pair.h. |
|
Returns !(x < y).
Definition at line 552 of file stl_multiset.h. |
|
Based on operator<.
Definition at line 657 of file stl_multimap.h. |
|
Based on operator<.
|
|
Based on operator<.
Definition at line 1250 of file stl_list.h. |
|
Based on operator<.
Definition at line 1596 of file stl_deque.h. |
|
Test if C string doesn't precede string.
Definition at line 2351 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test if string doesn't precede C string.
Definition at line 2339 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Test if string doesn't precede string.
Definition at line 2327 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::compare(). |
|
Global I/O operators for bitsets. Direct I/O between streams and bitsets is supported. Output is straightforward. Input will skip whitespace, only accept '0' and '1' characters, and will only extract as many digits as the bitset will hold. Definition at line 1230 of file bitset. References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_string< _CharT, _Traits, _Alloc >::push_back(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_string< _CharT, _Traits, _Alloc >::reserve(), std::basic_streambuf< _CharT, _Traits >::sbumpc(), std::basic_streambuf< _CharT, _Traits >::sputbackc(), and std::basic_ios< _CharT, _Traits >::widen(). |
|
Read stream into a string.
Definition at line 550 of file vstring.tcc. |
|
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 788 of file istream.tcc. References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::ios_base::eofbit, std::ios_base::getloc(), std::ios_base::goodbit, max(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::ctype_base::space, and std::ios_base::width(). |
|
Character extractors.
Definition at line 761 of file istream.tcc. References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate(). |
|
Read stream into a string.
Definition at line 868 of file istream.tcc. References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::basic_string< _CharT, _Traits, _Alloc >::append(), std::ios_base::badbit, std::ios_base::eofbit, std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::ios_base::getloc(), std::ios_base::goodbit, std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::ctype_base::space, and std::ios_base::width(). |
|
Global bitwise operations on bitsets.
|
|
Global bitwise operations on bitsets.
|
|
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 2575 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __heap_select(), 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 2537 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __heap_select(), and sort_heap(). Referenced by __introsort_loop(). |
|
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 2679 of file stl_algo.h. References __adjust_heap(), __glibcxx_function_requires, __glibcxx_requires_valid_range, 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 2614 of file stl_algo.h. References __adjust_heap(), __glibcxx_function_requires, __glibcxx_requires_valid_range, 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 238 of file stl_numeric.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 198 of file stl_numeric.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 2097 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __partition(). |
|
Pop an element off a heap using comparison functor.
Definition at line 319 of file stl_heap.h. References __glibcxx_function_requires, __glibcxx_requires_heap_pred, __glibcxx_requires_valid_range, and __pop_heap(). |
|
Pop an element off a heap.
Definition at line 253 of file stl_heap.h. References __glibcxx_function_requires, __glibcxx_requires_heap, __glibcxx_requires_valid_range, and __pop_heap(). Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::pop(), and sort_heap(). |
|
Permute range into the previous "dictionary" ordering using comparison functor.
Definition at line 5162 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse(). |
|
Permute range into the previous "dictionary" ordering.
Definition at line 5106 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse(). |
|
Push an element onto a heap using comparison functor.
Definition at line 189 of file stl_heap.h. References __glibcxx_function_requires, __glibcxx_requires_heap_pred, __glibcxx_requires_valid_range, and __push_heap(). |
|
Push an element onto a heap.
Definition at line 141 of file stl_heap.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and __push_heap(). Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::push(). |
|
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 2003 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and 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 1976 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and 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 1253 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, 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 1178 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. 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 1215 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. 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 1288 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, 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 991 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. Referenced by __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::append(), std::basic_string< _CharT, _Traits, _Allocator >::append(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::assign(), std::basic_string< _CharT, _Traits, _Allocator >::assign(), __gnu_cxx::rope< _CharT, _Alloc >::erase(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::insert(), __gnu_cxx::rope< _CharT, _Alloc >::insert(), std::basic_string< _CharT, _Traits, _Allocator >::insert(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::replace(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::replace(), __gnu_cxx::rope< _CharT, _Alloc >::replace(), and std::basic_string< _CharT, _Traits, _Allocator >::replace(). |
|
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 1055 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 1092 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 1022 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Manipulator for
Definition at line 63 of file iomanip. References std::_Resetiosflags::_M_mask. |
|
The companion to get_temporary_buffer().
Definition at line 122 of file memory. Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::~_Temporary_buffer(). |
|
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 1684 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __reverse(). Referenced by next_permutation(), and prev_permutation(). |
|
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 1710 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Calls base.setf(ios_base::right, ios_base::adjustfield).
Definition at line 917 of file ios_base.h. References std::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 Definition at line 1917 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and __rotate(). Referenced by __inplace_stable_partition(), __merge_without_buffer(), and __rotate_adaptive(). |
|
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 1950 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Calls base.setf(ios_base::scientific, ios_base::floatfield).
Definition at line 959 of file ios_base.h. References std::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.
Definition at line 559 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
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 487 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and find(). Referenced by __find_end(), and __gnu_cxx::rope< _CharT, _Alloc >::find(). |
|
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 851 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __search_n(). |
|
Search a sequence for a number of consecutive values.
[first,last) for count consecutive elements equal to val .
Definition at line 722 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), __search_n(), and find(). |
|
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.
Definition at line 132 of file iomanip. References std::_Setbase::_M_base. |
|
Manipulator for
fill(c) for that object.
Definition at line 174 of file iomanip. References std::_Setfill< _CharT >::_M_c. |
|
Manipulator for
Definition at line 97 of file iomanip. References std::_Setiosflags::_M_mask. |
|
Manipulator for
precision(n) for that object.
Definition at line 208 of file iomanip. References std::_Setprecision::_M_n. |
|
Manipulator for
width(n) for that object.
Definition at line 242 of file iomanip. References std::_Setw::_M_n. |
|
Calls base.setf(ios_base::showbase).
Definition at line 804 of file ios_base.h. References std::ios_base::setf(). Referenced by noshowbase(). |
|
Calls base.setf(ios_base::showpoint).
Definition at line 820 of file ios_base.h. References std::ios_base::setf(). Referenced by noshowpoint(). |
|
Calls base.setf(ios_base::showpos).
Definition at line 836 of file ios_base.h. References std::ios_base::setf(). Referenced by noshowpos(). |
|
Calls base.setf(ios_base::skipws).
Definition at line 852 of file ios_base.h. References std::ios_base::setf(). Referenced by noskipws(), std::tr1::operator>>(), and std::basic_istream< _CharT, _Traits >::sentry::sentry(). |
|
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 2851 of file stl_algo.h. References __final_insertion_sort(), __glibcxx_function_requires, __glibcxx_requires_valid_range, __introsort_loop(), and __lg(). |
|
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 2816 of file stl_algo.h. References __final_insertion_sort(), __glibcxx_function_requires, __glibcxx_requires_valid_range, __introsort_loop(), and __lg(). Referenced by std::__debug::list< _Tp, _Allocator >::sort(). |
|
Sort a heap using comparison functor.
Definition at line 448 of file stl_heap.h. References __glibcxx_function_requires, __glibcxx_requires_heap_pred, __glibcxx_requires_valid_range, and pop_heap(). |
|
Sort a heap.
Definition at line 422 of file stl_heap.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and pop_heap(). Referenced by partial_sort(), and partial_sort_copy(). |
|
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 2208 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __inplace_stable_partition(), __stable_partition_adaptive(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), std::_Temporary_buffer< _ForwardIterator, _Tp >::requested_size(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size(). |
|
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 3917 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __inplace_stable_sort(), __stable_sort_adaptive(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size(). |
|
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 3876 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __inplace_stable_sort(), __stable_sort_adaptive(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size(). |
|
See std::vector::swap().
Definition at line 987 of file stl_vector.h. References std::vector< _Tp, _Alloc >::swap(). |
|
See std::set::swap().
Definition at line 573 of file stl_set.h. References std::set< _Key, _Compare, _Alloc >::swap(). |
|
Definition at line 559 of file stl_multiset.h. References std::multiset< _Key, _Compare, _Alloc >::swap(). |
|
Definition at line 664 of file stl_multimap.h. References std::multimap< _Key, _Tp, _Compare, _Alloc >::swap(). |
|
See std::map::swap().
Definition at line 734 of file stl_map.h. References std::map< _Key, _Tp, _Compare, _Alloc >::swap(). |
|
See std::list::swap().
Definition at line 1256 of file stl_list.h. References std::list< _Tp, _Alloc >::swap(). |
|
See std::deque::swap().
Definition at line 1603 of file stl_deque.h. References std::deque< _Tp, _Alloc >::swap(). |
|
Swaps two values.
Definition at line 93 of file stl_algobase.h. References __glibcxx_function_requires. |
|
Swap contents of two strings.
Definition at line 2364 of file basic_string.h. References std::basic_string< _CharT, _Traits, _Alloc >::swap(). Referenced by __partition(), __rotate(), std::tr1::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Default_ranged_hash, true >::_M_swap(), std::tr1::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Default_ranged_hash, false >::_M_swap(), std::tr1::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Hash, false >::_M_swap(), std::__alloc_swap< _Alloc, false >::_S_do_it(), std::__iter_swap< true >::iter_swap(), std::__debug::vector< _Tp, _Allocator >::swap(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::swap(), std::vector< _Tp, _Allocator >::swap(), std::list< _Tp, _Allocator >::swap(), std::deque< _Tp, _Allocator >::swap(), std::vector< bool, _Alloc >::swap(), __gnu_cxx::slist< _Tp, _Alloc >::swap(), std::__debug::set< _Key, _Compare, _Allocator >::swap(), pb_ds::priority_queue< Value_Type, Cmp_Fn, Tag, Allocator >::swap(), std::__debug::multiset< _Key, _Compare, _Allocator >::swap(), std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >::swap(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::swap(), std::__debug::list< _Tp, _Allocator >::swap(), __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_multimap< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::swap(), std::__debug::deque< _Tp, _Allocator >::swap(), pb_ds::list_update< Key, Mapped, Eq_Fn, Update_Policy, Allocator >::swap(), pb_ds::trie< Key, Mapped, E_Access_Traits, Tag, Node_Update, Allocator >::swap(), pb_ds::tree< Key, Mapped, Cmp_Fn, Tag, Node_Update, Allocator >::swap(), pb_ds::gp_hash_table< Key, Mapped, Hash_Fn, Eq_Fn, Comb_Probe_Fn, Probe_Fn, Resize_Policy, Store_Hash, Allocator >::swap(), and pb_ds::cc_hash_table< Key, Mapped, Hash_Fn, Eq_Fn, Comb_Hash_Fn, Resize_Policy, Store_Hash, Allocator >::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 886 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and iter_swap(). Referenced by __rotate(), std::tr1::swap(), and std::tr1::array< _Tp, _Nm >::swap(). |
|
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 4683 of file locale_facets.h. |
|
Convenience interface to ctype.toupper(__c).
Definition at line 4677 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 960 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
Perform an operation on a sequence.
* (result+N)=unary_op(*(first+N)) for each N in the range [0,last-first).
Definition at line 925 of file stl_algo.h. References __glibcxx_function_requires, and __glibcxx_requires_valid_range. |
|
[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 Referenced by std::basic_ostream< _CharT, _Traits >::sentry::~sentry(). |
|
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 108 of file stl_uninitialized.h. References __uninitialized_copy_aux(). Referenced by __uninitialized_copy_a(), and __gnu_cxx::__uninitialized_copy_n(). |
|
Copies the value x into the range [first,last).
Definition at line 170 of file stl_uninitialized.h. References __uninitialized_fill_aux(). Referenced by __uninitialized_fill_a(). |
|
Copies the value x into the range [first,first+n).
Definition at line 215 of file stl_uninitialized.h. References __uninitialized_fill_n_aux(). Referenced by __uninitialized_fill_n_a(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::_M_initialize_buffer(). |
|
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 1601 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and adjacent_find(). |
|
Remove consecutive duplicate values from a sequence.
last are still present, but their value is unspecified.
Definition at line 1562 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, and adjacent_find(). |
|
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 1530 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __unique_copy(). |
|
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 1489 of file stl_algo.h. References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __unique_copy(). |
|
Calls base.setf(ios_base::unitbuf).
Definition at line 884 of file ios_base.h. References std::ios_base::setf(). Referenced by nounitbuf(), and std::basic_ostream< _CharT, _Traits >::sentry::~sentry(). |
|
Calls base.setf(ios_base::uppercase).
Definition at line 868 of file ios_base.h. References std::ios_base::setf(). Referenced by nouppercase(). |
|
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 112 of file locale_facets.tcc. References std::locale::_M_impl. |
|
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 844 of file istream.tcc. References std::ios_base::eofbit, std::ios_base::getloc(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), and std::ctype_base::space. |
|
Linked to standard error (unbuffered).
|
|
Linked to standard 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.
|