std Namespace Reference


Detailed Description

Macros and namespaces used by the implementation outside of debug wrappers to verify certain properties. The __glibcxx_requires_xxx macros are merely wrappers around the __glibcxx_check_xxx wrappers when we are compiling with debug mode, but disappear when we are in release mode so that there is no checking performed in, e.g., the standard library algorithms.

Classes

Namespaces

Typedefs

Enumerations

Functions

Variables

Standard Stream Objects
The <iostream> header declares the eight standard stream objects. For other declarations, see http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#10 and the I/O forward declarations

They are required by default to cooperate with the global C library's FILE streams, and to be available during program startup and termination. For more information, see the HOWTO linked to above.


Typedef Documentation

typedef void(*) std::new_handler()

If you write your own error handler to be called by new, it must be of this type.

Definition at line 77 of file new.

typedef long long std::streamoff

Type used by fpos, char_traits<char>, and char_traits<wchar_t>.

Definition at line 74 of file postypes.h.

typedef fpos<mbstate_t> std::streampos

File position for char streams.

Definition at line 211 of file postypes.h.

typedef ptrdiff_t std::streamsize

Integral type for I/O operation counts and buffer sizes.

Definition at line 78 of file postypes.h.

typedef void(*) std::terminate_handler()

If you write a replacement terminate handler, it must be of this type.

Definition at line 83 of file exception.

typedef void(*) std::unexpected_handler()

If you write a replacement unexpected handler, it must be of this type.

Definition at line 86 of file exception.

typedef fpos<mbstate_t> std::wstreampos

File position for wchar_t streams.

Definition at line 213 of file postypes.h.


Enumeration Type Documentation

enum std::float_denorm_style

Describes the denormalization for floating-point types.

These values represent the presence or absence of a variable number of exponent bits. This type is used in the std::numeric_limits class.

Enumerator:
denorm_indeterminate  Indeterminate at compile time whether denormalized values are allowed.
denorm_absent  The type does not allow denormalized values.
denorm_present  The type allows denormalized values.

Definition at line 172 of file limits.

enum std::float_round_style

Describes the rounding style for floating-point types.

This is used in the std::numeric_limits class.

Enumerator:
round_indeterminate  Self-explanatory.
round_toward_zero  Self-explanatory.
round_to_nearest  To the nearest representable value.
round_toward_infinity  Self-explanatory.
round_toward_neg_infinity  Self-explanatory.

Definition at line 157 of file limits.


Function Documentation

template<typename _InputIterator, typename _Tp, typename _BinaryOperation>
_Tp std::accumulate ( _InputIterator  __first,
_InputIterator  __last,
_Tp  __init,
_BinaryOperation  __binary_op 
)

Accumulate values in a range with operation.

Accumulates the values in the range [first,last) using the function object binary_op. The initial value is init. The values are processed in order.

Parameters:
first Start of range.
last End of range.
init Starting value to add other values to.
binary_op Function object to accumulate with.
Returns:
The final sum.

Definition at line 107 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _InputIterator, typename _Tp>
_Tp std::accumulate ( _InputIterator  __first,
_InputIterator  __last,
_Tp  __init 
)

Accumulate values in a range.

Accumulates the values in the range [first,last) using operator+(). The initial value is init. The values are processed in order.

Parameters:
first Start of range.
last End of range.
init Starting value to add other values to.
Returns:
The final sum.

Definition at line 81 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _InputIterator, typename _OutputIterator, typename _BinaryOperation>
_OutputIterator std::adjacent_difference ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
_BinaryOperation  __binary_op 
)

Return differences between adjacent values.

Computes the difference between adjacent values in the range [first,last) using the function object binary_op and writes the result to result.

Parameters:
first Start of input range.
last End of input range.
result Output to write sums to.
Returns:
Iterator pointing just beyond the values written to result.

Definition at line 313 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _InputIterator, typename _OutputIterator>
_OutputIterator std::adjacent_difference ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result 
)

Return differences between adjacent values.

Computes the difference between adjacent values in the range [first,last) using operator-() and writes the result to result.

Parameters:
first Start of input range.
last End of input range.
result Output to write sums to.
Returns:
Iterator pointing just beyond the values written to result.

Definition at line 274 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _ForwardIterator, typename _BinaryPredicate>
_ForwardIterator std::adjacent_find ( _ForwardIterator  __first,
_ForwardIterator  __last,
_BinaryPredicate  __binary_pred 
)

Find two adjacent values in a sequence using a predicate.

Parameters:
first A forward iterator.
last A forward iterator.
binary_pred A binary predicate.
Returns:
The first iterator i such that i and i+1 are both valid iterators in [first,last) and such that binary_pred(*i,*(i+1)) is true, or last if no such iterator exists.

Definition at line 393 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _ForwardIterator>
_ForwardIterator std::adjacent_find ( _ForwardIterator  __first,
_ForwardIterator  __last 
)

Find two adjacent values in a sequence that are equal.

Parameters:
first A forward iterator.
last A forward iterator.
Returns:
The first iterator i such that i and i+1 are both valid iterators in [first,last) and such that *i == *(i+1), or last if no such iterator exists.

Definition at line 362 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

Referenced by unique().

template<typename _InputIterator, typename _Distance>
void std::advance ( _InputIterator &  __i,
_Distance  __n 
) [inline]

A generalization of pointer arithmetic.

Parameters:
i An input iterator.
n The "delta" by which to change i.
Returns:
Nothing.
This increments i by n. For bidirectional and random access iterators, n may be negative, in which case i is decremented.

For random access iterators, this uses their + and - operations and are constant time. For other iterator classes they are linear time.

Definition at line 173 of file stl_iterator_base_funcs.h.

References __advance(), and __iterator_category().

Referenced by __find_end(), __inplace_stable_partition(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), std::vector< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Allocator >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::vector< _Tp, _Alloc >::_M_range_insert(), equal_range(), lower_bound(), and upper_bound().

template<typename _Container>
back_insert_iterator<_Container> std::back_inserter ( _Container &  __x  )  [inline]

Parameters:
x A container of arbitrary type.
Returns:
An instance of back_insert_iterator working on x.
This wrapper function helps in creating back_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.

Definition at line 446 of file stl_iterator.h.

ios_base& std::boolalpha ( ios_base &  __base  )  [inline]

Calls base.setf(ios_base::boolalpha).

Definition at line 788 of file ios_base.h.

References std::ios_base::setf().

Referenced by noboolalpha().

template<typename _InputIterator, typename _OutputIterator>
_OutputIterator std::copy ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result 
) [inline]

Copies the range [first,last) into result.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
Returns:
result + (first - last)
This inline function will boil down to a call to 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.

template<typename _BI1, typename _BI2>
_BI2 std::copy_backward ( _BI1  __first,
_BI1  __last,
_BI2  __result 
) [inline]

Copies the range [first,last) into result.

Parameters:
first A bidirectional iterator.
last A bidirectional iterator.
result A bidirectional iterator.
Returns:
result - (first - last)
The function has the same effect as copy, but starts at the end of the range and works its way to the start, returning the start of the result. This inline function will boil down to a call to 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().

template<typename _InputIterator, typename _Tp>
iterator_traits<_InputIterator>::difference_type std::count ( _InputIterator  __first,
_InputIterator  __last,
const _Tp &  __value 
)

Count the number of copies of a value in a sequence.

Parameters:
first An input iterator.
last An input iterator.
value The value to be counted.
Returns:
The number of iterators i in the range [first,last) for which *i == value

Definition at line 424 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _InputIterator, typename _Predicate>
iterator_traits<_InputIterator>::difference_type std::count_if ( _InputIterator  __first,
_InputIterator  __last,
_Predicate  __pred 
)

Count the elements of a sequence for which a predicate is true.

Parameters:
first An input iterator.
last An input iterator.
pred A predicate.
Returns:
The number of iterators i in the range [first,last) for which pred(*i) is true.

Definition at line 448 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

ios_base& std::dec ( ios_base &  __base  )  [inline]

Calls base.setf(ios_base::dec, ios_base::basefield).

Definition at line 926 of file ios_base.h.

References std::ios_base::setf().

Referenced by std::tr1::operator<<(), operator<<(), std::tr1::operator>>(), and operator>>().

template<typename _InputIterator>
iterator_traits<_InputIterator>::difference_type std::distance ( _InputIterator  __first,
_InputIterator  __last 
) [inline]

A generalization of pointer arithmetic.

Parameters:
first An input iterator.
last An input iterator.
Returns:
The distance between them.
Returns n such that first + n == last. This requires that last must be reachable from first. Note that n may be negative.

For random access iterators, this uses their + and - operations and are constant time. For other iterator classes they are linear time.

Definition at line 115 of file stl_iterator_base_funcs.h.

References __distance(), and __iterator_category().

Referenced by std::tr1::__detail::__distance_fw(), __find_end(), __inplace_stable_partition(), __is_heap(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), std::vector< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Allocator >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_initialize_range(), std::vector< bool, _Alloc >::_M_insert_range(), std::vector< _Tp, _Allocator >::_M_range_initialize(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::deque< _Tp, _Alloc >::_M_range_insert_aux(), std::tr1::_Hashtable< _Key, std::pair< _Key, _Tp >, _Alloc, std::_Select1st< std::pair< _Key, _Tp > >, _Pred, _Hash, std::tr1::__detail::_Mod_range_hashing, std::tr1::__detail::_Default_ranged_hash, std::tr1::__detail::_Prime_rehash_policy, __cache_hash_code, false, false >::bucket_size(), std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::count(), equal_range(), inplace_merge(), lower_bound(), __gnu_cxx::random_sample_n(), std::list< _Tp, _Allocator >::size(), and upper_bound().

template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>& std::endl ( basic_ostream< _CharT, _Traits > &  __os  )  [inline]

Write a newline and flush the stream.

This manipulator is often mistakenly used when a simple newline is desired, leading to poor buffering performance. See http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 for more on this subject.

Definition at line 545 of file ostream.

References flush(), std::basic_ostream< _CharT, _Traits >::put(), and std::basic_ios< _CharT, _Traits >::widen().

template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>& std::ends ( basic_ostream< _CharT, _Traits > &  __os  )  [inline]

Write a null character into the output sequence.

"Null character" is CharT() by definition. For CharT of char, this correctly writes the ASCII NUL character string terminator.

Definition at line 556 of file ostream.

References std::basic_ostream< _CharT, _Traits >::put().

template<typename _InputIterator1, typename _InputIterator2, typename _BinaryPredicate>
bool std::equal ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_BinaryPredicate  __binary_pred 
) [inline]

Tests a range for element-wise equality.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
binary_pred A binary predicate functor.
Returns:
A boolean true or false.
This compares the elements of two ranges using the binary_pred parameter, and returns true or false depending on whether all of the corresponding elements of the ranges are equal.

Definition at line 804 of file stl_algobase.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _InputIterator1, typename _InputIterator2>
bool std::equal ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2 
) [inline]

Tests a range for element-wise equality.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
Returns:
A boolean true or false.
This compares the elements of two ranges using == 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==().

template<typename _ForwardIterator, typename _Tp>
void std::fill ( _ForwardIterator  __first,
_ForwardIterator  __last,
const _Tp &  __value 
)

Fills the range [first,last) with copies of value.

Parameters:
first A forward iterator.
last A forward iterator.
value A reference-to-const of arbitrary type.
Returns:
Nothing.
This function fills a range with copies of the same value. For one-byte types filling contiguous areas of memory, this becomes an inline call to memset.

Definition at line 583 of file stl_algobase.h.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, and std::__fill<>::fill().

template<typename _OutputIterator, typename _Size, typename _Tp>
_OutputIterator std::fill_n ( _OutputIterator  __first,
_Size  __n,
const _Tp &  __value 
)

Fills the range [first,first+n) with copies of value.

Parameters:
first An output iterator.
n The count of copies to perform.
value A reference-to-const of arbitrary type.
Returns:
The iterator at first+n.
This function fills a range with copies of the same value. For one-byte types filling contiguous areas of memory, this becomes an inline call to 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().

template<typename _InputIterator, typename _Tp>
_InputIterator std::find ( _InputIterator  __first,
_InputIterator  __last,
const _Tp &  __val 
) [inline]

Find the first occurrence of a value in a sequence.

Parameters:
first An input iterator.
last An input iterator.
val The value to find.
Returns:
The first iterator i in the range [first,last) such that *i == val, or last if no such iterator exists.

Definition at line 318 of file stl_algo.h.

References __find(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category().

Referenced by std::money_get< _CharT, _InIter >::_M_extract(), std::num_get< _CharT, _InIter >::_M_extract_float(), std::num_get< _CharT, _InIter >::_M_extract_int(), std::num_get< _CharT, _InIter >::_M_find(), std::num_put< _CharT, _OutIter >::_M_insert_float(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::erase(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::erase(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::find(), find(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::find(), __gnu_cxx::__debug::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >::find(), __gnu_cxx::__debug::hash_multimap< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::find(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::find(), std::basic_string< _CharT, _Traits, _Alloc >::find(), std::basic_string< _CharT, _Traits, _Allocator >::find(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_first_not_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_first_not_of(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_first_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_first_of(), std::basic_string< _CharT, _Traits, _Allocator >::find_first_of(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_last_not_of(), std::basic_string< _CharT, _Traits, _Alloc >::find_last_not_of(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_last_of(), and std::basic_string< _CharT, _Traits, _Alloc >::find_last_of().

template<typename _ForwardIterator1, typename _ForwardIterator2, typename _BinaryPredicate>
_ForwardIterator1 std::find_end ( _ForwardIterator1  __first1,
_ForwardIterator1  __last1,
_ForwardIterator2  __first2,
_ForwardIterator2  __last2,
_BinaryPredicate  __comp 
) [inline]

Find last matching subsequence in a sequence using a predicate.

Parameters:
first1 Start of range to search.
last1 End of range to search.
first2 Start of sequence to match.
last2 End of sequence to match.
comp The predicate to use.
Returns:
The last iterator i in the range [first1,last1-(last2-first2)) such that predicate(*(i+N), (first2+N)) is true for each N in the range [0,last2-first2), or last1 if no such iterator exists.
Searches the range [first1,last1) for a sub-sequence that compares equal value-by-value with the sequence given by [first2,last2) using comp as a predicate and returns an iterator to the first element of the sub-sequence, or last1 if the sub-sequence is not found. The sub-sequence will be the last such subsequence contained in [first,last1).

Because the sub-sequence must lie completely within the range [first1,last1) it must start at a position less than last1-(last2-first2) where last2-first2 is the length of the sub-sequence. This means that the returned iterator i will be in the range [first1,last1-(last2-first2))

Definition at line 5483 of file stl_algo.h.

References __find_end(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category().

template<typename _ForwardIterator1, typename _ForwardIterator2>
_ForwardIterator1 std::find_end ( _ForwardIterator1  __first1,
_ForwardIterator1  __last1,
_ForwardIterator2  __first2,
_ForwardIterator2  __last2 
) [inline]

Find last matching subsequence in a sequence.

Parameters:
first1 Start of range to search.
last1 End of range to search.
first2 Start of sequence to match.
last2 End of sequence to match.
Returns:
The last iterator i in the range [first1,last1-(last2-first2)) such that *(i+N) == *(first2+N) for each N in the range [0,last2-first2), or last1 if no such iterator exists.
Searches the range [first1,last1) for a sub-sequence that compares equal value-by-value with the sequence given by [first2,last2) and returns an iterator to the first element of the sub-sequence, or last1 if the sub-sequence is not found. The sub-sequence will be the last such subsequence contained in [first,last1).

Because the sub-sequence must lie completely within the range [first1,last1) it must start at a position less than last1-(last2-first2) where last2-first2 is the length of the sub-sequence. This means that the returned iterator i will be in the range [first1,last1-(last2-first2))

Definition at line 5437 of file stl_algo.h.

References __find_end(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category().

template<typename _InputIterator, typename _ForwardIterator, typename _BinaryPredicate>
_InputIterator std::find_first_of ( _InputIterator  __first1,
_InputIterator  __last1,
_ForwardIterator  __first2,
_ForwardIterator  __last2,
_BinaryPredicate  __comp 
)

Find element from a set in a sequence using a predicate.

Parameters:
first1 Start of range to search.
last1 End of range to search.
first2 Start of match candidates.
last2 End of match candidates.
comp Predicate to use.
Returns:
The first iterator i in the range [first1,last1) such that comp(*i, *(i2)) is true and i2 is an interator in [first2,last2), or last1 if no such iterator exists.
Searches the range [first1,last1) for an element that is equal to some element in the range [first2,last2). If found, returns an iterator in the range [first1,last1), otherwise returns last1.

Definition at line 5258 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

Referenced by __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::find_first_of(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::find_first_of(), and std::basic_string< _CharT, _Traits, _Allocator >::find_first_of().

template<typename _InputIterator, typename _ForwardIterator>
_InputIterator std::find_first_of ( _InputIterator  __first1,
_InputIterator  __last1,
_ForwardIterator  __first2,
_ForwardIterator  __last2 
)

Find element from a set in a sequence.

Parameters:
first1 Start of range to search.
last1 End of range to search.
first2 Start of match candidates.
last2 End of match candidates.
Returns:
The first iterator i in the range [first1,last1) such that *i == *(i2) such that i2 is an interator in [first2,last2), or last1 if no such iterator exists.
Searches the range [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.

template<typename _InputIterator, typename _Predicate>
_InputIterator std::find_if ( _InputIterator  __first,
_InputIterator  __last,
_Predicate  __pred 
) [inline]

Find the first element in a sequence for which a predicate is true.

Parameters:
first An input iterator.
last An input iterator.
pred A predicate.
Returns:
The first iterator i in the range [first,last) such that pred(*i) is true, or last if no such iterator exists.

Definition at line 340 of file stl_algo.h.

References __find_if(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and __iterator_category().

Referenced by remove_if().

ios_base& std::fixed ( ios_base &  __base  )  [inline]

Calls base.setf(ios_base::fixed, ios_base::floatfield).

Definition at line 951 of file ios_base.h.

References std::ios_base::setf().

Referenced by std::tr1::operator<<().

template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>& std::flush ( basic_ostream< _CharT, _Traits > &  __os  )  [inline]

Flushes the output stream.

This manipulator simply calls the stream's flush() member function.

Definition at line 566 of file ostream.

References std::basic_ostream< _CharT, _Traits >::flush().

Referenced by __gnu_cxx::sequence_buffer< _Sequence, _Buf_sz >::append(), endl(), __gnu_cxx::sequence_buffer< _Sequence, _Buf_sz >::push_back(), and __gnu_cxx::sequence_buffer< _Sequence, _Buf_sz >::~sequence_buffer().

template<typename _InputIterator, typename _Function>
_Function std::for_each ( _InputIterator  __first,
_InputIterator  __last,
_Function  __f 
)

Apply a function to every element of a sequence.

Parameters:
first An input iterator.
last An input iterator.
f A unary function object.
Returns:
f.
Applies the function object 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.

template<typename _Container>
front_insert_iterator<_Container> std::front_inserter ( _Container &  __x  )  [inline]

Parameters:
x A container of arbitrary type.
Returns:
An instance of front_insert_iterator working on x.
This wrapper function helps in creating front_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.

Definition at line 520 of file stl_iterator.h.

template<typename _ForwardIterator, typename _Generator>
void std::generate ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Generator  __gen 
)

Assign the result of a function object to each value in a sequence.

Parameters:
first A forward iterator.
last A forward iterator.
gen A function object taking no arguments.
Returns:
generate() returns no value.
Performs the assignment *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.

template<typename _OutputIterator, typename _Size, typename _Generator>
_OutputIterator std::generate_n ( _OutputIterator  __first,
_Size  __n,
_Generator  __gen 
)

Assign the result of a function object to each value in a sequence.

Parameters:
first A forward iterator.
n The length of the sequence.
gen A function object taking no arguments.
Returns:
The end of the sequence, first+n
Performs the assignment *i = gen() for each i in the range [first,first+n).

Definition at line 1151 of file stl_algo.h.

References __glibcxx_function_requires.

template<typename _Tp>
pair<_Tp*, ptrdiff_t> std::get_temporary_buffer ( ptrdiff_t  __len  )  [inline]

Allocates a temporary buffer.

Parameters:
len The number of objects of type Tp.
Returns:
See full description.
Reinventing the wheel, but this time with prettier spokes!

This function tries to obtain storage for len adjacent Tp objects. The objects themselves are not constructed, of course. A pair<> is returned containing "the buffer s address and capacity (in the units of sizeof(Tp)), or a pair of 0 values if no storage can be obtained." Note that the capacity obtained may be less than that requested if the memory is unavailable; you should compare len with the .second return value.

Provides the nothrow exception guarantee.

Definition at line 110 of file memory.

References __get_temporary_buffer().

Referenced by std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer().

template<typename _CharT, typename _Traits, typename _Alloc, template< typename, typename, typename > class _Base>
basic_istream<_CharT, _Traits>& std::getline ( basic_istream< _CharT, _Traits > &  __is,
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &  __str 
) [inline]

Read a line from stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
Returns:
Reference to the input stream.
Stores characters from is into str until '
' 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 __gnu_debug::getline(), and std::basic_ios< _CharT, _Traits >::widen().

template<typename _CharT, typename _Traits, typename _Alloc, template< typename, typename, typename > class _Base>
basic_istream< _CharT, _Traits > & std::getline ( basic_istream< _CharT, _Traits > &  __is,
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &  __str,
_CharT  __delim 
)

Read a line from stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
delim Character marking end of line.
Returns:
Reference to the input stream.
Stores characters from is into str until delim 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 delim was encountered, it is extracted but not stored into str.

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().

template<typename _CharT, typename _Traits, typename _Alloc>
basic_istream<_CharT, _Traits>& std::getline ( basic_istream< _CharT, _Traits > &  __is,
basic_string< _CharT, _Traits, _Alloc > &  __str 
) [inline]

Read a line from stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
Returns:
Reference to the input stream.
Stores characters from is into str until '
' 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 __gnu_debug::getline(), and std::basic_ios< _CharT, _Traits >::widen().

template<typename _CharT, typename _Traits, typename _Alloc>
basic_istream< _CharT, _Traits > & std::getline ( basic_istream< _CharT, _Traits > &  __is,
basic_string< _CharT, _Traits, _Alloc > &  __str,
_CharT  __delim 
)

Read a line from stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
delim Character marking end of line.
Returns:
Reference to the input stream.
Stores characters from is into str until delim 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 delim was encountered, it is extracted but not stored into str.

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().

template<typename _Facet>
bool std::has_facet ( const locale &  __loc  )  throw () [inline]

Test for the presence of a facet.

has_facet tests the locale argument for the presence of the facet type provided as the template parameter. Facets derived from the facet parameter will also return true.

Parameters:
Facet The facet type to test the presence of.
locale The locale to test.
Returns:
true if locale contains a facet of type Facet, else false.

Definition at line 89 of file locale_facets.tcc.

ios_base& std::hex ( ios_base &  __base  )  [inline]

Calls base.setf(ios_base::hex, ios_base::basefield).

Definition at line 934 of file ios_base.h.

References std::ios_base::setf().

Referenced by operator<<(), and operator>>().

template<typename _InputIterator1, typename _InputIterator2, typename _Tp, typename _BinaryOperation1, typename _BinaryOperation2>
_Tp std::inner_product ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_Tp  __init,
_BinaryOperation1  __binary_op1,
_BinaryOperation2  __binary_op2 
)

Compute inner product of two ranges.

Starting with an initial value of init, applies binary_op2 to successive elements from the two ranges and accumulates each result into the accumulated value using binary_op1. The values in the ranges are processed in order.

Parameters:
first1 Start of range 1.
last1 End of range 1.
first2 Start of range 2.
init Starting value to add other values to.
binary_op1 Function object to accumulate with.
binary_op2 Function object to apply to pairs of input values.
Returns:
The final inner product.

Definition at line 167 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _InputIterator1, typename _InputIterator2, typename _Tp>
_Tp std::inner_product ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_Tp  __init 
)

Compute inner product of two ranges.

Starting with an initial value of init, multiplies successive elements from the two ranges and adds each product into the accumulated value using operator+(). The values in the ranges are processed in order.

Parameters:
first1 Start of range 1.
last1 End of range 1.
first2 Start of range 2.
init Starting value to add other values to.
Returns:
The final inner product.

Definition at line 135 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _BidirectionalIterator, typename _Compare>
void std::inplace_merge ( _BidirectionalIterator  __first,
_BidirectionalIterator  __middle,
_BidirectionalIterator  __last,
_Compare  __comp 
)

Merges two sorted ranges in place.

Parameters:
first An iterator.
middle Another iterator.
last Another iterator.
comp A functor to use for comparisons.
Returns:
Nothing.
Merges two sorted and consecutive ranges, [first,middle) and [middle,last), and puts the result in [first,last). The output will be sorted. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.

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().

template<typename _BidirectionalIterator>
void std::inplace_merge ( _BidirectionalIterator  __first,
_BidirectionalIterator  __middle,
_BidirectionalIterator  __last 
)

Merges two sorted ranges in place.

Parameters:
first An iterator.
middle Another iterator.
last Another iterator.
Returns:
Nothing.
Merges two sorted and consecutive ranges, [first,middle) and [middle,last), and puts the result in [first,last). The output will be sorted. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.

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().

template<typename _Container, typename _Iterator>
insert_iterator<_Container> std::inserter ( _Container &  __x,
_Iterator  __i 
) [inline]

Parameters:
x A container of arbitrary type.
Returns:
An instance of insert_iterator working on x.
This wrapper function helps in creating insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.

Definition at line 616 of file stl_iterator.h.

Referenced by std::deque< _Tp, _Alloc >::_M_range_insert_aux().

ios_base& std::internal ( ios_base &  __base  )  [inline]

Calls base.setf(ios_base::internal, ios_base::adjustfield).

Definition at line 901 of file ios_base.h.

References std::ios_base::setf().

template<typename _CharT>
bool std::isalnum ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::alnum, __c).

Definition at line 4665 of file locale_facets.h.

References std::ctype_base::alnum.

template<typename _CharT>
bool std::isalpha ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::alpha, __c).

Definition at line 4641 of file locale_facets.h.

References std::ctype_base::alpha.

template<typename _CharT>
bool std::iscntrl ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::cntrl, __c).

Definition at line 4623 of file locale_facets.h.

References std::ctype_base::cntrl.

template<typename _CharT>
bool std::isdigit ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::digit, __c).

Definition at line 4647 of file locale_facets.h.

References std::ctype_base::digit.

template<typename _CharT>
bool std::isgraph ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::graph, __c).

Definition at line 4671 of file locale_facets.h.

References std::ctype_base::graph.

template<typename _CharT>
bool std::islower ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::lower, __c).

Definition at line 4635 of file locale_facets.h.

References std::ctype_base::lower.

template<typename _CharT>
bool std::isprint ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::print, __c).

Definition at line 4617 of file locale_facets.h.

References std::ctype_base::print.

template<typename _CharT>
bool std::ispunct ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::punct, __c).

Definition at line 4653 of file locale_facets.h.

References std::ctype_base::punct.

template<typename _CharT>
bool std::isspace ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::space, __c).

Definition at line 4611 of file locale_facets.h.

References std::ctype_base::space.

template<typename _CharT>
bool std::isupper ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::upper, __c).

Definition at line 4629 of file locale_facets.h.

References std::ctype_base::upper.

template<typename _CharT>
bool std::isxdigit ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.is(ctype_base::xdigit, __c).

Definition at line 4659 of file locale_facets.h.

References std::ctype_base::xdigit.

template<typename _ForwardIterator1, typename _ForwardIterator2>
void std::iter_swap ( _ForwardIterator1  __a,
_ForwardIterator2  __b 
) [inline]

Swaps the contents of two iterators.

Parameters:
a An iterator.
b Another iterator.
Returns:
Nothing.
This function swaps the values pointed to by two iterators, not the iterators themselves.

Definition at line 143 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by __introselect(), __merge_without_buffer(), __partition(), __reverse(), __unguarded_partition(), next_permutation(), prev_permutation(), random_shuffle(), and swap_ranges().

ios_base& std::left ( ios_base &  __base  )  [inline]

Calls base.setf(ios_base::left, ios_base::adjustfield).

Definition at line 909 of file ios_base.h.

References std::ios_base::setf().

Referenced by __ostream_insert(), and std::tr1::operator<<().

template<typename _InputIterator1, typename _InputIterator2, typename _Compare>
bool std::lexicographical_compare ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_InputIterator2  __last2,
_Compare  __comp 
)

Performs "dictionary" comparison on ranges.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
last2 An input iterator.
comp A comparison functor.
Returns:
A boolean true or false.
The same as the four-parameter 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.

template<typename _InputIterator1, typename _InputIterator2>
bool std::lexicographical_compare ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_InputIterator2  __last2 
)

Performs "dictionary" comparison on ranges.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
last2 An input iterator.
Returns:
A boolean true or false.
"Returns true if the sequence of elements defined by the range [first1,last1) is lexicographically less than the sequence of elements defined by the range [first2,last2). Returns false otherwise." (Quoted from [25.3.8]/1.) If the iterators are all character pointers, then this is an inline call to memcmp.

Definition at line 835 of file stl_algobase.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

Referenced by lexicographical_compare(), operator<(), __gnu_cxx::operator<(), and std::tr1::operator<().

template<typename _RandomAccessIterator, typename _Compare>
void std::make_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
) [inline]

Construct a heap over a range using comparison functor.

Parameters:
first Start of heap.
last End of heap.
comp Comparison functor to use.
This operation makes the elements in [first,last) into a heap. Comparisons are made using comp.

Definition at line 384 of file stl_heap.h.

References __adjust_heap(), __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _RandomAccessIterator>
void std::make_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
)

Construct a heap over a range.

Parameters:
first Start of heap.
last End of heap.
This operation makes the elements in [first,last) into a heap.

Definition at line 344 of file stl_heap.h.

References __adjust_heap(), __glibcxx_function_requires, and __glibcxx_requires_valid_range.

Referenced by __heap_select(), partial_sort_copy(), and std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue().

template<class _T1, class _T2>
pair<_T1, _T2> std::make_pair ( _T1  __x,
_T2  __y 
) [inline]

A convenience wrapper for creating a pair from two objects.

Parameters:
x The first object.
y The second object.
Returns:
A newly-constructed pair<> object of the appropriate type.
The standard requires that the objects be passed by reference-to-const, but LWG issue #181 says they should be passed by const value. We follow the LWG by default.

Definition at line 144 of file stl_pair.h.

Referenced by __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_get_distance(), std::tr1::__detail::_Prime_rehash_policy::_M_need_rehash(), std::__debug::set< _Key, _Compare, _Allocator >::equal_range(), std::__debug::multiset< _Key, _Compare, _Allocator >::equal_range(), std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >::equal_range(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::equal_range(), std::tr1::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::equal_range(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_multimap< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::equal_range(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::insert(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::insert(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::insert_noresize(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::insert_noresize(), and std::tr1::__detail::_Map_base< _Key, _Pair, std::_Select1st< _Pair >, true, _Hashtable >::operator[]().

template<typename _Tp, typename _Compare>
const _Tp& std::max ( const _Tp &  __a,
const _Tp &  __b,
_Compare  __comp 
) [inline]

This does what you think it does.

Parameters:
a A thing of arbitrary type.
b Another thing of arbitrary type.
comp A comparison functor.
Returns:
The greater of the parameters.
This will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.

Definition at line 246 of file stl_algobase.h.

Referenced by __get_temporary_buffer(), std::num_get< _CharT, _InIter >::_M_extract_int(), std::basic_istream< _CharT, _Traits >::ignore(), and operator>>().

template<typename _Tp>
const _Tp& std::max ( const _Tp &  __a,
const _Tp &  __b 
) [inline]

This does what you think it does.

Parameters:
a A thing of arbitrary type.
b Another thing of arbitrary type.
Returns:
The greater of the parameters.
This is the simple classic generic implementation. It will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.

Definition at line 204 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by std::tr1::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::_Hashtable(), std::vector< _Tp, _Alloc >::_M_fill_insert(), std::vector< bool, _Alloc >::_M_fill_insert(), std::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), std::vector< bool, _Alloc >::_M_insert_range(), std::tr1::__detail::_Prime_rehash_policy::_M_need_rehash(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::deque< _Tp, _Alloc >::_M_reallocate_map(), __gnu_cxx::rope< _CharT, _Alloc >::_S_apply_to_pieces(), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(), and std::tr1::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::rehash().

template<typename _ForwardIterator, typename _Compare>
_ForwardIterator std::max_element ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Compare  __comp 
)

Return the maximum element in a range using comparison functor.

Parameters:
first Start of range.
last End of range.
comp Comparison functor.
Returns:
Iterator referencing the first instance of the largest value according to comp.

Definition at line 4908 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _ForwardIterator>
_ForwardIterator std::max_element ( _ForwardIterator  __first,
_ForwardIterator  __last 
)

Return the maximum element in a range.

Parameters:
first Start of range.
last End of range.
Returns:
Iterator referencing the first instance of the largest value.

Definition at line 4881 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

Referenced by std::valarray< _Tp >::max().

template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _Compare>
_OutputIterator std::merge ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_InputIterator2  __last2,
_OutputIterator  __result,
_Compare  __comp 
)

Merges two sorted ranges.

Parameters:
first1 An iterator.
first2 Another iterator.
last1 Another iterator.
last2 Another iterator.
result An iterator pointing to the end of the merged range.
comp A functor to use for comparisons.
Returns:
An iterator pointing to the first element "not less than" val.
Merges the ranges [first1,last1) and [first2,last2) into the sorted range [result, result + (last1-first1) + (last2-first2)). Both input ranges must be sorted, and the output range must not overlap with either of the input ranges. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.

The comparison function should have the same effects on ordering as the function used for the initial sort.

Definition at line 3291 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_sorted_pred.

Referenced by std::__debug::list< _Tp, _Allocator >::merge().

template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator>
_OutputIterator std::merge ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_InputIterator2  __last2,
_OutputIterator  __result 
)

Merges two sorted ranges.

Parameters:
first1 An iterator.
first2 Another iterator.
last1 Another iterator.
last2 Another iterator.
result An iterator pointing to the end of the merged range.
Returns:
An iterator pointing to the first element "not less than" val.
Merges the ranges [first1,last1) and [first2,last2) into the sorted range [result, result + (last1-first1) + (last2-first2)). Both input ranges must be sorted, and the output range must not overlap with either of the input ranges. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.

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().

template<typename _Tp, typename _Compare>
const _Tp& std::min ( const _Tp &  __a,
const _Tp &  __b,
_Compare  __comp 
) [inline]

This does what you think it does.

Parameters:
a A thing of arbitrary type.
b Another thing of arbitrary type.
comp A comparison functor.
Returns:
The lesser of the parameters.
This will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.

Definition at line 226 of file stl_algobase.h.

Referenced by __gnu_cxx::__lexicographical_compare_3way(), std::num_get< _CharT, _InIter >::_M_extract_int(), std::basic_istream< _CharT, _Traits >::ignore(), and __gnu_cxx::random_sample_n().

template<typename _Tp>
const _Tp& std::min ( const _Tp &  __a,
const _Tp &  __b 
) [inline]

This does what you think it does.

Parameters:
a A thing of arbitrary type.
b Another thing of arbitrary type.
Returns:
The lesser of the parameters.
This is the simple classic generic implementation. It will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.

Definition at line 182 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by __merge_sort_loop(), __verify_grouping(), std::bitset< _Nb >::_M_copy_from_string(), std::time_get< _CharT, _InIter >::_M_extract_name(), __gnu_cxx::rope< _CharT, _Alloc >::_S_apply_to_pieces(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::compare(), std::basic_string< _CharT, _Traits, _Alloc >::compare(), std::basic_string< _CharT, _Traits, _Allocator >::compare(), lexicographical_compare(), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(), std::basic_istream< _CharT, _Traits >::readsome(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::rfind(), std::basic_string< _CharT, _Traits, _Alloc >::rfind(), std::basic_filebuf< _CharT, _Traits >::underflow(), std::basic_streambuf< _CharT, _Traits >::xsgetn(), std::basic_streambuf< _CharT, _Traits >::xsputn(), and std::basic_filebuf< _CharT, _Traits >::xsputn().

template<typename _ForwardIterator, typename _Compare>
_ForwardIterator std::min_element ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Compare  __comp 
)

Return the minimum element in a range using comparison functor.

Parameters:
first Start of range.
last End of range.
comp Comparison functor.
Returns:
Iterator referencing the first instance of the smallest value according to comp.

Definition at line 4960 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _ForwardIterator>
_ForwardIterator std::min_element ( _ForwardIterator  __first,
_ForwardIterator  __last 
)

Return the minimum element in a range.

Parameters:
first Start of range.
last End of range.
Returns:
Iterator referencing the first instance of the smallest value.

Definition at line 4933 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

Referenced by std::valarray< _Tp >::min().

template<typename _InputIterator1, typename _InputIterator2, typename _BinaryPredicate>
pair<_InputIterator1, _InputIterator2> std::mismatch ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_BinaryPredicate  __binary_pred 
)

Finds the places in ranges which don't match.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
binary_pred A binary predicate functor.
Returns:
A pair of iterators pointing to the first mismatch.
This compares the elements of two ranges using the binary_pred parameter, 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 742 of file stl_algobase.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _InputIterator1, typename _InputIterator2>
pair<_InputIterator1, _InputIterator2> std::mismatch ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2 
)

Finds the places in ranges which don't match.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
Returns:
A pair of iterators pointing to the first mismatch.
This compares the elements of two ranges using == 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.

template<typename _BidirectionalIterator, typename _Compare>
bool std::next_permutation ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last,
_Compare  __comp 
)

Permute range into the next "dictionary" ordering using comparison functor.

Parameters:
first Start of range.
last End of range.
comp 
Returns:
False if wrapped to first permutation, true otherwise.
Treats all permutations of the range [first,last) as a set of "dictionary" sorted sequences ordered by comp. Permutes the current sequence into the next one of this set. Returns true if there are more sequences to generate. If the sequence is the largest of the set, the smallest is generated and false returned.

Definition at line 5051 of file stl_algo.h.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse().

template<typename _BidirectionalIterator>
bool std::next_permutation ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last 
)

Permute range into the next "dictionary" ordering.

Parameters:
first Start of range.
last End of range.
Returns:
False if wrapped to first permutation, true otherwise.
Treats all permutations of the range as a set of "dictionary" sorted sequences. Permutes the current sequence into the next one of this set. Returns true if there are more sequences to generate. If the sequence is the largest of the set, the smallest is generated and false returned.

Definition at line 4995 of file stl_algo.h.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse().

ios_base& std::noboolalpha ( ios_base &  __base  )  [inline]

Calls base.unsetf(ios_base::boolalpha).

Definition at line 796 of file ios_base.h.

References boolalpha(), and std::ios_base::unsetf().

ios_base& std::noshowbase ( ios_base &  __base  )  [inline]

Calls base.unsetf(ios_base::showbase).

Definition at line 812 of file ios_base.h.

References showbase(), and std::ios_base::unsetf().

ios_base& std::noshowpoint ( ios_base &  __base  )  [inline]

Calls base.unsetf(ios_base::showpoint).

Definition at line 828 of file ios_base.h.

References showpoint(), and std::ios_base::unsetf().

ios_base& std::noshowpos ( ios_base &  __base  )  [inline]

Calls base.unsetf(ios_base::showpos).

Definition at line 844 of file ios_base.h.

References showpos(), and std::ios_base::unsetf().

ios_base& std::noskipws ( ios_base &  __base  )  [inline]

Calls base.unsetf(ios_base::skipws).

Definition at line 860 of file ios_base.h.

References skipws(), and std::ios_base::unsetf().

ios_base& std::nounitbuf ( ios_base &  __base  )  [inline]

Calls base.unsetf(ios_base::unitbuf).

Definition at line 892 of file ios_base.h.

References unitbuf(), and std::ios_base::unsetf().

ios_base& std::nouppercase ( ios_base &  __base  )  [inline]

Calls base.unsetf(ios_base::uppercase).

Definition at line 876 of file ios_base.h.

References std::ios_base::unsetf(), and uppercase().

template<typename _RandomAccessIterator, typename _Compare>
void std::nth_element ( _RandomAccessIterator  __first,
_RandomAccessIterator  __nth,
_RandomAccessIterator  __last,
_Compare  __comp 
) [inline]

Sort a sequence just enough to find a particular position using a predicate for comparison.

Parameters:
first An iterator.
nth Another iterator.
last Another iterator.
comp A comparison functor.
Returns:
Nothing.
Rearranges the elements in the range [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().

template<typename _RandomAccessIterator>
void std::nth_element ( _RandomAccessIterator  __first,
_RandomAccessIterator  __nth,
_RandomAccessIterator  __last 
) [inline]

Sort a sequence just enough to find a particular position.

Parameters:
first An iterator.
nth Another iterator.
last Another iterator.
Returns:
Nothing.
Rearranges the elements in the range [first,last) so that *nth is the same element that would have been in that position had the whole sequence been sorted. whole sequence been sorted. The elements either side of *nth are not completely sorted, but for any iterator in the range [first,nth) and any iterator in the range [nth,last) it holds that *j<*i is false.

Definition at line 4032 of file stl_algo.h.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, __introselect(), and __lg().

ios_base& std::oct ( ios_base &  __base  )  [inline]

Calls base.setf(ios_base::oct, ios_base::basefield).

Definition at line 942 of file ios_base.h.

References std::ios_base::setf().

Referenced by operator<<(), and operator>>().

template<size_t _Nb>
bitset<_Nb> std::operator & ( const bitset< _Nb > &  __x,
const bitset< _Nb > &  __y 
) [inline]

Global bitwise operations on bitsets.

Parameters:
x A bitset.
y A bitset of the same size as x.
Returns:
A new bitset.
These should be self-explanatory.

Definition at line 1193 of file bitset.

template<class _Tp, class _CharT, class _Traits, class _Dist>
bool std::operator!= ( const istream_iterator< _Tp, _CharT, _Traits, _Dist > &  __x,
const istream_iterator< _Tp, _CharT, _Traits, _Dist > &  __y 
) [inline]

Return false if x and y are both end or not end, or x and y are the same.

Definition at line 135 of file stream_iterator.h.

References std::istream_iterator< _Tp, _CharT, _Traits, _Dist >::_M_equal().

template<typename _Tp, typename _Alloc>
bool std::operator!= ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 963 of file stl_vector.h.

template<typename _Tp, typename _Seq>
bool std::operator!= ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Based on operator==.

Definition at line 238 of file stl_stack.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator!= ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(x == y).

Definition at line 545 of file stl_set.h.

template<typename _Tp, typename _Seq>
bool std::operator!= ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Based on operator==.

Definition at line 263 of file stl_queue.h.

template<class _T1, class _T2>
bool std::operator!= ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Uses operator== to find the result.

Definition at line 109 of file stl_pair.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator!= ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(x == y).

Definition at line 531 of file stl_multiset.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator!= ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 636 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator!= ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 706 of file stl_map.h.

template<typename _Tp, typename _Alloc>
bool std::operator!= ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 1232 of file stl_list.h.

template<typename _Tp, typename _Alloc>
bool std::operator!= ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Based on operator==.

Definition at line 1575 of file stl_deque.h.

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator!= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test difference of string and C string.

Parameters:
lhs String.
rhs C string.
Returns:
True if lhs.compare(rhs) != 0. False otherwise.

Definition at line 2203 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator!= ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test difference of C string and string.

Parameters:
lhs C string.
rhs String.
Returns:
True if rhs.compare(lhs) != 0. False otherwise.

Definition at line 2191 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator!= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test difference of two strings.

Parameters:
lhs First string.
rhs Second string.
Returns:
True if lhs.compare(rhs) != 0. False otherwise.

Definition at line 2179 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc> std::operator+ ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
_CharT  __rhs 
) [inline]

Concatenate string and character.

Parameters:
lhs First string.
rhs Last string.
Returns:
New string with lhs followed by rhs.

Definition at line 2124 of file basic_string.h.

template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc> std::operator+ ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Concatenate string and C string.

Parameters:
lhs First string.
rhs Last string.
Returns:
New string with lhs followed by rhs.

Definition at line 2108 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::append().

template<typename _CharT, typename _Traits, typename _Alloc>
basic_string< _CharT, _Traits, _Alloc > std::operator+ ( _CharT  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
)

Concatenate character and string.

Parameters:
lhs First string.
rhs Last string.
Returns:
New string with lhs followed by rhs.

Definition at line 690 of file basic_string.tcc.

References std::basic_string< _CharT, _Traits, _Alloc >::size().

template<typename _CharT, typename _Traits, typename _Alloc>
basic_string< _CharT, _Traits, _Alloc > std::operator+ ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
)

Concatenate C string and string.

Parameters:
lhs First string.
rhs Last string.
Returns:
New string with value of lhs followed by rhs.

Definition at line 674 of file basic_string.tcc.

References __glibcxx_requires_string, and std::basic_string< _CharT, _Traits, _Alloc >::size().

template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc> std::operator+ ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
)

Concatenate two strings.

Parameters:
lhs First string.
rhs Last string.
Returns:
New string with value of lhs followed by rhs.

Definition at line 2071 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::append().

template<typename _Tp, typename _Alloc>
bool std::operator< ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Vector ordering relation.

Parameters:
x A vector.
y A vector of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is a total ordering relation. It is linear in the size of the vectors. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 956 of file stl_vector.h.

References lexicographical_compare().

template<typename _Tp, typename _Seq>
bool std::operator< ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Stack ordering relation.

Parameters:
x A stack.
y A stack of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is an total ordering relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, the elements must be comparable with <, and std::lexicographical_compare() is usually used to make the determination.

Definition at line 232 of file stl_stack.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator< ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Set ordering relation.

Parameters:
x A set.
y A set of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 538 of file stl_set.h.

template<typename _Tp, typename _Seq>
bool std::operator< ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Queue ordering relation.

Parameters:
x A queue.
y A queue of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is an total ordering relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, the elements must be comparable with <, and std::lexicographical_compare() is usually used to make the determination.

Definition at line 257 of file stl_queue.h.

template<class _T1, class _T2>
bool std::operator< ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

<http://gcc.gnu.org/onlinedocs/libstdc++/20_util/howto.html#pairlt>

Definition at line 102 of file stl_pair.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator< ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Multiset ordering relation.

Parameters:
x A multiset.
y A multiset of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 524 of file stl_multiset.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator< ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Multimap ordering relation.

Parameters:
x A multimap.
y A multimap of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is a total ordering relation. It is linear in the size of the multimaps. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 629 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator< ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Map ordering relation.

Parameters:
x A map.
y A map of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 699 of file stl_map.h.

template<typename _Tp, typename _Alloc>
bool std::operator< ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

List ordering relation.

Parameters:
x A list.
y A list of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is a total ordering relation. It is linear in the size of the lists. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 1225 of file stl_list.h.

References lexicographical_compare().

template<typename _Tp, typename _Alloc>
bool std::operator< ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Deque ordering relation.

Parameters:
x A deque.
y A deque of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is a total ordering relation. It is linear in the size of the deques. The elements must be comparable with <.

See std::lexicographical_compare() for how the determination is made.

Definition at line 1567 of file stl_deque.h.

References lexicographical_compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator< ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if C string precedes string.

Parameters:
lhs C string.
rhs String.
Returns:
True if lhs precedes rhs. False otherwise.

Definition at line 2240 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator< ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test if string precedes C string.

Parameters:
lhs String.
rhs C string.
Returns:
True if lhs precedes rhs. False otherwise.

Definition at line 2228 of file basic_string.h.

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator< ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if string precedes string.

Parameters:
lhs First string.
rhs Second string.
Returns:
True if lhs precedes rhs. False otherwise.

Definition at line 2216 of file basic_string.h.

template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &  __out,
const _CharT *  __s 
) [inline]

String inserters.

Parameters:
out An output stream.
s A character string.
Returns:
out
Precondition:
s must be a non-NULL pointer
Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(s) characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0) is then called.

Definition at line 495 of file ostream.

References __ostream_insert(), and std::basic_ios< _CharT, _Traits >::setstate().

template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &  __out,
_CharT  __c 
) [inline]

Character inserters.

Parameters:
out An output stream.
c A character.
Returns:
out
Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts a single character and any required padding (as determined by [22.2.2.2.2]). out.width(0) is then called.

If c is of type char and the character type of the stream is not char, the character is widened before insertion.

Definition at line 453 of file ostream.

References __ostream_insert().

template<typename _CharT, typename _Traits, typename _Alloc, template< typename, typename, typename > class _Base>
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &  __os,
const __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &  __str 
) [inline]

Write string to a stream.

Parameters:
os Output stream.
str String to write out.
Returns:
Reference to the output stream.
Output characters of str into os following the same rules as for writing a C string.

Definition at line 2144 of file vstring.h.

References __ostream_insert().

template<typename _CharT, typename _Traits, typename _Alloc>
basic_ostream<_CharT, _Traits>& std::operator<< ( basic_ostream< _CharT, _Traits > &  __os,
const basic_string< _CharT, _Traits, _Alloc > &  __str 
) [inline]

Write string to a stream.

Parameters:
os Output stream.
str String to write out.
Returns:
Reference to the output stream.
Output characters of str into os following the same rules as for writing a C string.

Definition at line 2399 of file basic_string.h.

References __ostream_insert().

template<typename _Tp, typename _Alloc>
bool std::operator<= ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 975 of file stl_vector.h.

template<typename _Tp, typename _Seq>
bool std::operator<= ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 250 of file stl_stack.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator<= ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(y < x).

Definition at line 559 of file stl_set.h.

template<typename _Tp, typename _Seq>
bool std::operator<= ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 275 of file stl_queue.h.

template<class _T1, class _T2>
bool std::operator<= ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Uses operator< to find the result.

Definition at line 121 of file stl_pair.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator<= ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(y < x).

Definition at line 545 of file stl_multiset.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator<= ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 650 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator<= ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 720 of file stl_map.h.

template<typename _Tp, typename _Alloc>
bool std::operator<= ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1244 of file stl_list.h.

template<typename _Tp, typename _Alloc>
bool std::operator<= ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1589 of file stl_deque.h.

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator<= ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if C string doesn't follow string.

Parameters:
lhs C string.
rhs String.
Returns:
True if lhs doesn't follow rhs. False otherwise.

Definition at line 2314 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator<= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test if string doesn't follow C string.

Parameters:
lhs String.
rhs C string.
Returns:
True if lhs doesn't follow rhs. False otherwise.

Definition at line 2302 of file basic_string.h.

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator<= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if string doesn't follow string.

Parameters:
lhs First string.
rhs Second string.
Returns:
True if lhs doesn't follow rhs. False otherwise.

Definition at line 2290 of file basic_string.h.

template<typename _Tp, typename _CharT, typename _Traits, typename _Dist>
bool std::operator== ( const istream_iterator< _Tp, _CharT, _Traits, _Dist > &  __x,
const istream_iterator< _Tp, _CharT, _Traits, _Dist > &  __y 
) [inline]

Return true if x and y are both end or not end, or x and y are the same.

Definition at line 128 of file stream_iterator.h.

References std::istream_iterator< _Tp, _CharT, _Traits, _Dist >::_M_equal().

template<typename _Tp, typename _Alloc>
bool std::operator== ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Vector equality comparison.

Parameters:
x A vector.
y A vector of the same type as x.
Returns:
True iff the size and elements of the vectors are equal.
This is an equivalence relation. It is linear in the size of the vectors. Vectors are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

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().

template<typename _Tp, typename _Seq>
bool std::operator== ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Stack equality comparison.

Parameters:
x A stack.
y A stack of the same type as x.
Returns:
True iff the size and elements of the stacks are equal.
This is an equivalence relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, and stacks are considered equivalent if their sequences compare equal.

Definition at line 214 of file stl_stack.h.

References std::stack< _Tp, _Sequence >::c.

template<class _Key, class _Compare, class _Alloc>
bool std::operator== ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Set equality comparison.

Parameters:
x A set.
y A set of the same type as x.
Returns:
True iff the size and elements of the sets are equal.
This is an equivalence relation. It is linear in the size of the sets. Sets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 521 of file stl_set.h.

References std::set< _Key, _Compare, _Alloc >::_M_t.

template<typename _Tp, typename _Seq>
bool std::operator== ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Queue equality comparison.

Parameters:
x A queue.
y A queue of the same type as x.
Returns:
True iff the size and elements of the queues are equal.
This is an equivalence relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, and queues are considered equivalent if their sequences compare equal.

Definition at line 239 of file stl_queue.h.

References std::queue< _Tp, _Sequence >::c.

template<class _T1, class _T2>
bool std::operator== ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Two pairs of the same type are equal iff their members are equal.

Definition at line 96 of file stl_pair.h.

References std::pair< _T1, _T2 >::first, and std::pair< _T1, _T2 >::second.

template<class _Key, class _Compare, class _Alloc>
bool std::operator== ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Multiset equality comparison.

Parameters:
x A multiset.
y A multiset of the same type as x.
Returns:
True iff the size and elements of the multisets are equal.
This is an equivalence relation. It is linear in the size of the multisets. Multisets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 507 of file stl_multiset.h.

References std::multiset< _Key, _Compare, _Alloc >::_M_t.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator== ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Multimap equality comparison.

Parameters:
x A multimap.
y A multimap of the same type as x.
Returns:
True iff the size and elements of the maps are equal.
This is an equivalence relation. It is linear in the size of the multimaps. Multimaps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 612 of file stl_multimap.h.

References std::multimap< _Key, _Tp, _Compare, _Alloc >::_M_t.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator== ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Map equality comparison.

Parameters:
x A map.
y A map of the same type as x.
Returns:
True iff the size and elements of the maps are equal.
This is an equivalence relation. It is linear in the size of the maps. Maps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 682 of file stl_map.h.

References std::map< _Key, _Tp, _Compare, _Alloc >::_M_t.

template<typename _Tp, typename _Alloc>
bool std::operator== ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

List equality comparison.

Parameters:
x A list.
y A list of the same type as x.
Returns:
True iff the size and elements of the lists are equal.
This is an equivalence relation. It is linear in the size of the lists. Lists are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 1196 of file stl_list.h.

References std::list< _Tp, _Alloc >::begin(), and std::list< _Tp, _Alloc >::end().

template<typename _Iterator>
bool std::operator== ( const reverse_iterator< _Iterator > &  __x,
const reverse_iterator< _Iterator > &  __y 
) [inline]

Parameters:
x A reverse_iterator.
y A reverse_iterator.
Returns:
A simple bool.
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.

Definition at line 282 of file stl_iterator.h.

References std::reverse_iterator< _Iterator >::base().

template<typename _Tp, typename _Alloc>
bool std::operator== ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Deque equality comparison.

Parameters:
x A deque.
y A deque of the same type as x.
Returns:
True iff the size and elements of the deques are equal.
This is an equivalence relation. It is linear in the size of the deques. Deques are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

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().

template<typename _StateT>
bool std::operator== ( const fpos< _StateT > &  __lhs,
const fpos< _StateT > &  __rhs 
) [inline]

Test if equivalent to another position.

Definition at line 199 of file postypes.h.

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator== ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test equivalence of string and C string.

Parameters:
lhs String.
rhs C string.
Returns:
True if lhs.compare(rhs) == 0. False otherwise.

Definition at line 2166 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator== ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test equivalence of C string and string.

Parameters:
lhs C string.
rhs String.
Returns:
True if rhs.compare(lhs) == 0. False otherwise.

Definition at line 2154 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator== ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test equivalence of two strings.

Parameters:
lhs First string.
rhs Second string.
Returns:
True if lhs.compare(rhs) == 0. False otherwise.

Definition at line 2142 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _Tp, typename _Alloc>
bool std::operator> ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 969 of file stl_vector.h.

template<typename _Tp, typename _Seq>
bool std::operator> ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 244 of file stl_stack.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator> ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns y < x.

Definition at line 552 of file stl_set.h.

template<typename _Tp, typename _Seq>
bool std::operator> ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 269 of file stl_queue.h.

template<class _T1, class _T2>
bool std::operator> ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Uses operator< to find the result.

Definition at line 115 of file stl_pair.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator> ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns y < x.

Definition at line 538 of file stl_multiset.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator> ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 643 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator> ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 713 of file stl_map.h.

template<typename _Tp, typename _Alloc>
bool std::operator> ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1238 of file stl_list.h.

template<typename _Tp, typename _Alloc>
bool std::operator> ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1582 of file stl_deque.h.

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator> ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if C string follows string.

Parameters:
lhs C string.
rhs String.
Returns:
True if lhs follows rhs. False otherwise.

Definition at line 2277 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator> ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test if string follows C string.

Parameters:
lhs String.
rhs C string.
Returns:
True if lhs follows rhs. False otherwise.

Definition at line 2265 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator> ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if string follows string.

Parameters:
lhs First string.
rhs Second string.
Returns:
True if lhs follows rhs. False otherwise.

Definition at line 2253 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _Tp, typename _Alloc>
bool std::operator>= ( const vector< _Tp, _Alloc > &  __x,
const vector< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 981 of file stl_vector.h.

template<typename _Tp, typename _Seq>
bool std::operator>= ( const stack< _Tp, _Seq > &  __x,
const stack< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 256 of file stl_stack.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator>= ( const set< _Key, _Compare, _Alloc > &  __x,
const set< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(x < y).

Definition at line 566 of file stl_set.h.

template<typename _Tp, typename _Seq>
bool std::operator>= ( const queue< _Tp, _Seq > &  __x,
const queue< _Tp, _Seq > &  __y 
) [inline]

Based on operator<.

Definition at line 281 of file stl_queue.h.

template<class _T1, class _T2>
bool std::operator>= ( const pair< _T1, _T2 > &  __x,
const pair< _T1, _T2 > &  __y 
) [inline]

Uses operator< to find the result.

Definition at line 127 of file stl_pair.h.

template<class _Key, class _Compare, class _Alloc>
bool std::operator>= ( const multiset< _Key, _Compare, _Alloc > &  __x,
const multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

Returns !(x < y).

Definition at line 552 of file stl_multiset.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator>= ( const multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
const multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 657 of file stl_multimap.h.

template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
bool std::operator>= ( const map< _Key, _Tp, _Compare, _Alloc > &  __x,
const map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 727 of file stl_map.h.

template<typename _Tp, typename _Alloc>
bool std::operator>= ( const list< _Tp, _Alloc > &  __x,
const list< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1250 of file stl_list.h.

template<typename _Tp, typename _Alloc>
bool std::operator>= ( const deque< _Tp, _Alloc > &  __x,
const deque< _Tp, _Alloc > &  __y 
) [inline]

Based on operator<.

Definition at line 1596 of file stl_deque.h.

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator>= ( const _CharT *  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if C string doesn't precede string.

Parameters:
lhs C string.
rhs String.
Returns:
True if lhs doesn't precede rhs. False otherwise.

Definition at line 2351 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator>= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const _CharT *  __rhs 
) [inline]

Test if string doesn't precede C string.

Parameters:
lhs String.
rhs C string.
Returns:
True if lhs doesn't precede rhs. False otherwise.

Definition at line 2339 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<typename _CharT, typename _Traits, typename _Alloc>
bool std::operator>= ( const basic_string< _CharT, _Traits, _Alloc > &  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Test if string doesn't precede string.

Parameters:
lhs First string.
rhs Second string.
Returns:
True if lhs doesn't precede rhs. False otherwise.

Definition at line 2327 of file basic_string.h.

References std::basic_string< _CharT, _Traits, _Alloc >::compare().

template<class _CharT, class _Traits, size_t _Nb>
std::basic_istream<_CharT, _Traits>& std::operator>> ( std::basic_istream< _CharT, _Traits > &  __is,
bitset< _Nb > &  __x 
)

Global I/O operators for bitsets.

Direct I/O between streams and bitsets is supported. Output is straightforward. Input will skip whitespace, only accept '0' and '1' characters, and will only extract as many digits as the bitset will hold.

Definition at line 1230 of file bitset.

References std::bitset< _Nb >::_M_copy_from_string(), std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::basic_string< _CharT, _Traits, _Alloc >::empty(), std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_string< _CharT, _Traits, _Alloc >::push_back(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_string< _CharT, _Traits, _Alloc >::reserve(), std::basic_streambuf< _CharT, _Traits >::sbumpc(), std::basic_ios< _CharT, _Traits >::setstate(), std::basic_streambuf< _CharT, _Traits >::sputbackc(), and std::basic_ios< _CharT, _Traits >::widen().

template<typename _CharT, typename _Traits, typename _Alloc, template< typename, typename, typename > class _Base>
basic_istream< _CharT, _Traits > & std::operator>> ( basic_istream< _CharT, _Traits > &  __is,
__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &  __str 
)

Read stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
Returns:
Reference to the input stream.
Stores characters from is into str until whitespace 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.

Definition at line 550 of file vstring.tcc.

template<typename _CharT, typename _Traits>
basic_istream< _CharT, _Traits > & std::operator>> ( basic_istream< _CharT, _Traits > &  __in,
_CharT *  __s 
)

Character string extractors.

Parameters:
in An input stream.
s A pointer to a character array.
Returns:
in
Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts up to 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:

width(0) is then called for the input stream.

If no characters are extracted, sets failbit.

Definition at line 788 of file istream.tcc.

References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::ios_base::badbit, std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::getloc(), std::ios_base::goodbit, max(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), std::ctype_base::space, and std::ios_base::width().

template<typename _CharT, typename _Traits>
basic_istream< _CharT, _Traits > & std::operator>> ( basic_istream< _CharT, _Traits > &  __in,
_CharT &  __c 
)

Character extractors.

Parameters:
in An input stream.
c A character reference.
Returns:
in
Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts a character (if one is available) and stores it in c. Otherwise, sets failbit in the input stream.

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().

template<typename _CharT, typename _Traits, typename _Alloc>
basic_istream< _CharT, _Traits > & std::operator>> ( basic_istream< _CharT, _Traits > &  __is,
basic_string< _CharT, _Traits, _Alloc > &  __str 
)

Read stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
Returns:
Reference to the input stream.
Stores characters from is into str until whitespace 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.

Definition at line 868 of file istream.tcc.

References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::basic_string< _CharT, _Traits, _Alloc >::append(), std::ios_base::badbit, std::ios_base::eofbit, std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::ios_base::failbit, std::ios_base::getloc(), std::ios_base::goodbit, std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), std::basic_ios< _CharT, _Traits >::setstate(), std::ctype_base::space, and std::ios_base::width().

template<size_t _Nb>
bitset<_Nb> std::operator^ ( const bitset< _Nb > &  __x,
const bitset< _Nb > &  __y 
) [inline]

Global bitwise operations on bitsets.

Parameters:
x A bitset.
y A bitset of the same size as x.
Returns:
A new bitset.
These should be self-explanatory.

Definition at line 1211 of file bitset.

template<size_t _Nb>
bitset<_Nb> std::operator| ( const bitset< _Nb > &  __x,
const bitset< _Nb > &  __y 
) [inline]

Global bitwise operations on bitsets.

Parameters:
x A bitset.
y A bitset of the same size as x.
Returns:
A new bitset.
These should be self-explanatory.

Definition at line 1202 of file bitset.

template<typename _RandomAccessIterator, typename _Compare>
void std::partial_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __middle,
_RandomAccessIterator  __last,
_Compare  __comp 
) [inline]

Sort the smallest elements of a sequence using a predicate for comparison.

Parameters:
first An iterator.
middle Another iterator.
last Another iterator.
comp A comparison functor.
Returns:
Nothing.
Sorts the smallest (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().

template<typename _RandomAccessIterator>
void std::partial_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __middle,
_RandomAccessIterator  __last 
) [inline]

Sort the smallest elements of a sequence.

Parameters:
first An iterator.
middle Another iterator.
last Another iterator.
Returns:
Nothing.
Sorts the smallest (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().

template<typename _InputIterator, typename _RandomAccessIterator, typename _Compare>
_RandomAccessIterator std::partial_sort_copy ( _InputIterator  __first,
_InputIterator  __last,
_RandomAccessIterator  __result_first,
_RandomAccessIterator  __result_last,
_Compare  __comp 
)

Copy the smallest elements of a sequence using a predicate for comparison.

Parameters:
first An input iterator.
last Another input iterator.
result_first A random-access iterator.
result_last Another random-access iterator.
comp A comparison functor.
Returns:
An iterator indicating the end of the resulting sequence.
Copies and sorts the smallest N values from the range [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().

template<typename _InputIterator, typename _RandomAccessIterator>
_RandomAccessIterator std::partial_sort_copy ( _InputIterator  __first,
_InputIterator  __last,
_RandomAccessIterator  __result_first,
_RandomAccessIterator  __result_last 
)

Copy the smallest elements of a sequence.

Parameters:
first An iterator.
last Another iterator.
result_first A random-access iterator.
result_last Another random-access iterator.
Returns:
An iterator indicating the end of the resulting sequence.
Copies and sorts the smallest N values from the range [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().

template<typename _InputIterator, typename _OutputIterator, typename _BinaryOperation>
_OutputIterator std::partial_sum ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
_BinaryOperation  __binary_op 
)

Return list of partial sums.

Accumulates the values in the range [first,last) using operator+(). As each successive input value is added into the total, that partial sum is written to result. Therefore, the first value in result is the first value of the input, the second value in result is the sum of the first and second input values, and so on.

Parameters:
first Start of input range.
last End of input range.
result Output to write sums to.
Returns:
Iterator pointing just beyond the values written to result.

Definition at line 238 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _InputIterator, typename _OutputIterator>
_OutputIterator std::partial_sum ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result 
)

Return list of partial sums.

Accumulates the values in the range [first,last) using operator+(). As each successive input value is added into the total, that partial sum is written to result. Therefore, the first value in result is the first value of the input, the second value in result is the sum of the first and second input values, and so on.

Parameters:
first Start of input range.
last End of input range.
result Output to write sums to.
Returns:
Iterator pointing just beyond the values written to result.

Definition at line 198 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _ForwardIterator, typename _Predicate>
_ForwardIterator std::partition ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Predicate  __pred 
) [inline]

Move elements for which a predicate is true to the beginning of a sequence.

Parameters:
first A forward iterator.
last A forward iterator.
pred A predicate functor.
Returns:
An iterator middle such that pred(i) is true for each iterator i in the range [first,middle) and false for each i in the range [middle,last).
pred must not modify its operand. partition() does not preserve the relative ordering of elements in each group, use stable_partition() if this is needed.

Definition at line 2097 of file stl_algo.h.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, __iterator_category(), and __partition().

template<typename _RandomAccessIterator, typename _Compare>
void std::pop_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
) [inline]

Pop an element off a heap using comparison functor.

Parameters:
first Start of heap.
last End of heap.
comp Comparison functor to use.
This operation pops the top of the heap. The elements first and last-1 are swapped and [first,last-1) is made into a heap. Comparisons are made using comp.

Definition at line 319 of file stl_heap.h.

References __glibcxx_function_requires, __glibcxx_requires_heap_pred, __glibcxx_requires_valid_range, and __pop_heap().

template<typename _RandomAccessIterator>
void std::pop_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
) [inline]

Pop an element off a heap.

Parameters:
first Start of heap.
last End of heap.
This operation pops the top of the heap. The elements first and last-1 are swapped and [first,last-1) is made into 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().

template<typename _BidirectionalIterator, typename _Compare>
bool std::prev_permutation ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last,
_Compare  __comp 
)

Permute range into the previous "dictionary" ordering using comparison functor.

Parameters:
first Start of range.
last End of range.
comp 
Returns:
False if wrapped to last permutation, true otherwise.
Treats all permutations of the range [first,last) as a set of "dictionary" sorted sequences ordered by comp. Permutes the current sequence into the previous one of this set. Returns true if there are more sequences to generate. If the sequence is the smallest of the set, the largest is generated and false returned.

Definition at line 5162 of file stl_algo.h.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse().

template<typename _BidirectionalIterator>
bool std::prev_permutation ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last 
)

Permute range into the previous "dictionary" ordering.

Parameters:
first Start of range.
last End of range.
Returns:
False if wrapped to last permutation, true otherwise.
Treats all permutations of the range as a set of "dictionary" sorted sequences. Permutes the current sequence into the previous one of this set. Returns true if there are more sequences to generate. If the sequence is the smallest of the set, the largest is generated and false returned.

Definition at line 5106 of file stl_algo.h.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, iter_swap(), and reverse().

template<typename _RandomAccessIterator, typename _Compare>
void std::push_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
) [inline]

Push an element onto a heap using comparison functor.

Parameters:
first Start of heap.
last End of heap + element.
comp Comparison functor.
This operation pushes the element at last-1 onto the valid heap over the range [first,last-1). After completion, [first,last) is a valid heap. Compare operations are performed using comp.

Definition at line 189 of file stl_heap.h.

References __glibcxx_function_requires, __glibcxx_requires_heap_pred, __glibcxx_requires_valid_range, and __push_heap().

template<typename _RandomAccessIterator>
void std::push_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
) [inline]

Push an element onto a heap.

Parameters:
first Start of heap.
last End of heap + element.
This operation pushes the element at last-1 onto the valid heap over the range [first,last-1). After completion, [first,last) is a valid 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().

template<typename _RandomAccessIterator, typename _RandomNumberGenerator>
void std::random_shuffle ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomNumberGenerator &  __rand 
)

Shuffle the elements of a sequence using a random number generator.

Parameters:
first A forward iterator.
last A forward iterator.
rand The RNG functor or function.
Returns:
Nothing.
Reorders the elements in the range [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().

template<typename _RandomAccessIterator>
void std::random_shuffle ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
) [inline]

Randomly shuffle the elements of a sequence.

Parameters:
first A forward iterator.
last A forward iterator.
Returns:
Nothing.
Reorder the elements in the range [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().

template<typename _ForwardIterator, typename _Tp>
_ForwardIterator std::remove ( _ForwardIterator  __first,
_ForwardIterator  __last,
const _Tp &  __value 
)

Remove elements from a sequence.

Parameters:
first An input iterator.
last An input iterator.
value The value to be removed.
Returns:
An iterator designating the end of the resulting sequence.
All elements equal to value are removed from the range [first,last).

remove() is stable, so the relative order of elements that are not removed is unchanged.

Elements between the end of the resulting sequence and last are still present, but their value is unspecified.

Definition at line 1253 of file stl_algo.h.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, find(), and remove_copy().

template<typename _InputIterator, typename _OutputIterator, typename _Tp>
_OutputIterator std::remove_copy ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
const _Tp &  __value 
)

Copy a sequence, removing elements of a given value.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
value The value to be removed.
Returns:
An iterator designating the end of the resulting sequence.
Copies each element in the range [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().

template<typename _InputIterator, typename _OutputIterator, typename _Predicate>
_OutputIterator std::remove_copy_if ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
_Predicate  __pred 
)

Copy a sequence, removing elements for which a predicate is true.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
pred A predicate.
Returns:
An iterator designating the end of the resulting sequence.
Copies each element in the range [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