std Namespace Reference

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(*) new_handler()

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

Definition at line 68 of file new.

typedef long long streamoff

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

Definition at line 74 of file postypes.h.

typedef fpos<mbstate_t> streampos

File position for char streams.

Definition at line 210 of file postypes.h.

typedef ptrdiff_t streamsize

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

Definition at line 78 of file postypes.h.

typedef void(*) terminate_handler()

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

Definition at line 76 of file exception.

typedef void(*) unexpected_handler()

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

Definition at line 78 of file exception.

typedef fpos<mbstate_t> wstreampos

File position for wchar_t streams.

Definition at line 212 of file postypes.h.


Enumeration Type Documentation

enum float_denorm_style

Describes the denormalization for floating-point types.

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

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 171 of file limits.

enum 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 156 of file limits.


Function Documentation

_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 108 of file stl_numeric.h.

References __glibcxx_function_requires.

_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 82 of file stl_numeric.h.

References __glibcxx_function_requires.

_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 314 of file stl_numeric.h.

References __glibcxx_function_requires.

_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 275 of file stl_numeric.h.

References __glibcxx_function_requires.

_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 382 of file stl_algo.h.

References __glibcxx_function_requires.

_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 351 of file stl_algo.h.

References __glibcxx_function_requires.

Referenced by unique().

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 172 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(), vector::_M_assign_aux(), deque::_M_assign_aux(), vector< bool, _Alloc >::_M_assign_aux(), deque::_M_insert_aux(), deque::_M_range_initialize(), vector::_M_range_insert(), equal_range(), lower_bound(), and upper_bound().

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 444 of file stl_iterator.h.

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

Calls base.setf(ios_base::boolalpha).

Definition at line 788 of file ios_base.h.

References ios_base::boolalpha, and ios_base::setf().

_OutputIterator std::copy ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result 
) [inline]

Copies the range [first,last) into result.

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 375 of file stl_algobase.h.

References __glibcxx_function_requires, and __copy_normal::copy_n().

Referenced by __gnu_cxx::__copy_n(), __merge_adaptive(), __rotate_adaptive(), __stable_partition_adaptive(), __uninitialized_copy_aux(), vector::_M_assign_aux(), deque::_M_assign_aux(), vector< bool, _Alloc >::_M_assign_aux(), vector< bool, _Alloc >::_M_fill_insert(), num_put::_M_group_float(), vector< bool, _Alloc >::_M_initialize_range(), vector< bool, _Alloc >::_M_insert_aux(), deque::_M_insert_aux(), vector< bool, _Alloc >::_M_insert_range(), vector::_M_range_insert(), deque::_M_range_insert_aux(), deque::_M_reallocate_map(), __sso_string_base::_M_swap(), __vstring_utility::_S_copy(), __pad::_S_pad(), char_traits< __gnu_cxx::character< V, I, S > >::copy(), char_traits::copy(), codecvt< _InternT, _ExternT, encoding_state >::do_in(), codecvt< _InternT, _ExternT, encoding_state >::do_out(), vector::erase(), vector< bool, _Alloc >::erase(), deque::erase(), merge(), vector::operator=(), vector< bool, _Alloc >::operator=(), sequence_buffer::operator=(), deque::operator=(), vector< bool, _Alloc >::reserve(), rotate_copy(), sequence_buffer::sequence_buffer(), set_difference(), set_symmetric_difference(), set_union(), basic_filebuf::underflow(), vector< bool, _Alloc >::vector(), basic_streambuf::xsgetn(), basic_filebuf::xsgetn(), and basic_streambuf::xsputn().

_BI2 std::copy_backward ( _BI1  __first,
_BI1  __last,
_BI2  __result 
) [inline]

Copies the range [first,last) into result.

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 504 of file stl_algobase.h.

References __glibcxx_function_requires, and __copy_backward_normal::copy_b_n().

Referenced by __insertion_sort(), __merge_backward(), __rotate_adaptive(), vector::_M_fill_insert(), vector< bool, _Alloc >::_M_fill_insert(), vector::_M_insert_aux(), vector< bool, _Alloc >::_M_insert_aux(), deque::_M_insert_aux(), vector< bool, _Alloc >::_M_insert_range(), vector::_M_range_insert(), deque::_M_reallocate_map(), and deque::erase().

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 413 of file stl_algo.h.

References __glibcxx_function_requires.

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 437 of file stl_algo.h.

References __glibcxx_function_requires.

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

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

Definition at line 926 of file ios_base.h.

References ios_base::basefield, ios_base::dec, and ios_base::setf().

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

A generalization of pointer arithmetic.

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 114 of file stl_iterator_base_funcs.h.

References __distance(), and __iterator_category().

Referenced by __find_end(), __inplace_stable_partition(), __is_heap(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), vector::_M_assign_aux(), deque::_M_assign_aux(), vector< bool, _Alloc >::_M_assign_aux(), vector< bool, _Alloc >::_M_initialize_range(), vector< bool, _Alloc >::_M_insert_range(), vector::_M_range_initialize(), deque::_M_range_initialize(), vector::_M_range_insert(), deque::_M_range_insert_aux(), hashtable< Value, Value, Alloc, Internal::identity< Value >, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, true, false >::bucket_size(), _Rb_tree::count(), Internal::distance_fw(), equal_range(), _Rb_tree::erase(), inplace_merge(), hashtable::insert_equal(), hashtable::insert_unique(), lower_bound(), __gnu_cxx::random_sample_n(), list::size(), and upper_bound().

basic_ostream<_CharT, _Traits>& std::endl ( basic_ostream< _CharT, _Traits > &  __os  ) 

Write a newline and flush the stream.

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

Definition at line 498 of file ostream.

References flush(), basic_ostream::put(), and basic_ios::widen().

basic_ostream<_CharT, _Traits>& std::ends ( basic_ostream< _CharT, _Traits > &  __os  ) 

Write a null character into the output sequence.

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

Definition at line 509 of file ostream.

References basic_ostream::put().

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

Tests a range for element-wise equality.

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 781 of file stl_algobase.h.

References __glibcxx_function_requires.

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 748 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by operator==(), and std::tr1::operator==().

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 560 of file stl_algobase.h.

References __glibcxx_function_requires, and __fill::fill().

Referenced by __uninitialized_fill_aux(), _Base_bitset::_M_do_left_shift(), _Base_bitset::_M_do_right_shift(), vector::_M_fill_assign(), deque::_M_fill_assign(), vector< bool, _Alloc >::_M_fill_assign(), vector::_M_fill_insert(), vector< bool, _Alloc >::_M_fill_insert(), vector< bool, _Alloc >::_M_initialize_dispatch(), deque::_M_insert_aux(), fill_n(), and vector< bool, _Alloc >::vector().

_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 636 of file stl_algobase.h.

References __glibcxx_function_requires, and __fill_n::fill_n().

Referenced by __uninitialized_fill_n_aux(), vector::_M_fill_assign(), vector< bool, _Alloc >::_M_fill_insert(), char_traits< __gnu_cxx::character< V, I, S > >::assign(), char_traits::assign(), and array::assign().

_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 307 of file stl_algo.h.

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

Referenced by __search_n(), money_get::_M_extract(), num_get::_M_extract_float(), num_get::_M_extract_int(), num_put::_M_insert_float(), __versa_string::find(), basic_string::find(), __versa_string::find_first_not_of(), basic_string::find_first_not_of(), __versa_string::find_first_of(), basic_string::find_first_of(), __versa_string::find_last_not_of(), basic_string::find_last_not_of(), __versa_string::find_last_of(), basic_string::find_last_of(), remove(), search(), and search_n().

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

Find last matching subsequence in a sequence using a predicate.

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 5287 of file stl_algo.h.

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

_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 5241 of file stl_algo.h.

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

_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 5062 of file stl_algo.h.

References __glibcxx_function_requires.

_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 5025 of file stl_algo.h.

References __glibcxx_function_requires.

_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 329 of file stl_algo.h.

References __find_if(), __glibcxx_function_requires, 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 ios_base::fixed, ios_base::floatfield, and ios_base::setf().

basic_ostream<_CharT, _Traits>& std::flush ( basic_ostream< _CharT, _Traits > &  __os  ) 

Flushes the output stream.

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

Definition at line 519 of file ostream.

References basic_ostream::flush().

Referenced by endl().

_Function std::for_each ( _InputIterator  __first,
_InputIterator  __last,
_Function  __f 
)

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.

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 518 of file stl_iterator.h.

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 1114 of file stl_algo.h.

References __glibcxx_function_requires.

_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 1140 of file stl_algo.h.

References __glibcxx_function_requires.

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

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 2185 of file vstring.h.

References getline(), and basic_ios::widen().

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

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 648 of file vstring.tcc.

References basic_ios::_M_setstate(), __versa_string::append(), ios_base::badbit, ios_base::eofbit, __versa_string::erase(), ios_base::failbit, ios_base::goodbit, __versa_string::max_size(), basic_ios::rdbuf(), and basic_ios::setstate().

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

Read a line from stream into a string.

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 1256 of file istream.tcc.

References getline(), and basic_ios::widen().

basic_istream< _CharT, _Traits > & getline ( basic_istream< _CharT, _Traits > &  __is,
basic_string< _CharT, _Traits, _Alloc > &  __str,
_CharT  __delim 
)

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 1196 of file istream.tcc.

References basic_ios::_M_setstate(), ios_base::badbit, ios_base::eofbit, basic_string::erase(), ios_base::failbit, ios_base::goodbit, basic_string::max_size(), basic_ios::rdbuf(), and basic_ios::setstate().

Referenced by getline().

bool has_facet ( const locale &  __loc  )  throw () [inline]

Test for the presence of a facet.

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

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 88 of file locale_facets.tcc.

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

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

Definition at line 934 of file ios_base.h.

References ios_base::basefield, ios_base::hex, and ios_base::setf().

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

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 168 of file stl_numeric.h.

References __glibcxx_function_requires.

_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 136 of file stl_numeric.h.

References __glibcxx_function_requires.

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 3651 of file stl_algo.h.

References __glibcxx_function_requires, __merge_adaptive(), __merge_without_buffer(), _Temporary_buffer::begin(), distance(), and _Temporary_buffer::size().

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 3597 of file stl_algo.h.

References __glibcxx_function_requires, __merge_adaptive(), __merge_without_buffer(), _Temporary_buffer::begin(), distance(), and _Temporary_buffer::size().

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 614 of file stl_iterator.h.

Referenced by deque::_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 ios_base::adjustfield, ios_base::internal, and ios_base::setf().

bool isalnum ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4556 of file locale_facets.h.

References ctype_base::alnum.

bool isalpha ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4532 of file locale_facets.h.

References ctype_base::alpha.

bool iscntrl ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4514 of file locale_facets.h.

References ctype_base::cntrl.

bool isdigit ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4538 of file locale_facets.h.

References ctype_base::digit.

bool isgraph ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4562 of file locale_facets.h.

References ctype_base::graph.

bool islower ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4526 of file locale_facets.h.

References ctype_base::lower.

bool isprint ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4508 of file locale_facets.h.

References ctype_base::print.

bool ispunct ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4544 of file locale_facets.h.

References ctype_base::punct.

bool isspace ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4502 of file locale_facets.h.

References ctype_base::space.

bool isupper ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4520 of file locale_facets.h.

References ctype_base::upper.

bool isxdigit ( _CharT  __c,
const locale &  __loc 
) [inline]

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

Definition at line 4550 of file locale_facets.h.

References ctype_base::xdigit.

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 142 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by __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 ios_base::adjustfield, ios_base::left, and ios_base::setf().

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 853 of file stl_algobase.h.

References __glibcxx_function_requires.

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 812 of file stl_algobase.h.

References __glibcxx_function_requires.

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

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(), and __glibcxx_function_requires.

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(), and __glibcxx_function_requires.

Referenced by partial_sort(), partial_sort_copy(), and priority_queue::priority_queue().

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

A convenience wrapper for creating a pair from two objects.

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 hashtable::equal_range(), prime_rehash_policy::need_rehash(), and map_base< K, Pair, extract1st< Pair >, true, Hashtable >::operator[]().

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 248 of file stl_algobase.h.

Referenced by __get_temporary_buffer(), num_get::_M_extract_int(), basic_istream::ignore(), and operator>>().

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 206 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by vector::_M_fill_insert(), vector< bool, _Alloc >::_M_fill_insert(), _Deque_base::_M_initialize_map(), vector< bool, _Alloc >::_M_insert_range(), vector::_M_range_insert(), deque::_M_reallocate_map(), rope::_S_apply_to_pieces(), hashtable::hashtable(), prime_rehash_policy::need_rehash(), basic_stringbuf::overflow(), and hashtable::rehash().

_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 4712 of file stl_algo.h.

References __glibcxx_function_requires.

_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 4685 of file stl_algo.h.

References __glibcxx_function_requires.

Referenced by valarray::max().

_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 3178 of file stl_algo.h.

References __glibcxx_function_requires, and copy().

_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 3120 of file stl_algo.h.

References __glibcxx_function_requires, and copy().

Referenced by __merge_adaptive(), and __merge_sort_loop().

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 228 of file stl_algobase.h.

Referenced by __gnu_cxx::__lexicographical_compare_3way(), num_get::_M_extract_int(), basic_istream::ignore(), and __gnu_cxx::random_sample_n().

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 184 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by __merge_sort_loop(), __verify_grouping(), bitset::_M_copy_from_string(), time_get::_M_extract_name(), rope::_S_apply_to_pieces(), __versa_string::compare(), basic_string::compare(), codecvt< _InternT, _ExternT, encoding_state >::do_length(), lexicographical_compare(), basic_stringbuf::overflow(), basic_istream::readsome(), __versa_string::rfind(), basic_string::rfind(), basic_filebuf::underflow(), basic_streambuf::xsgetn(), basic_streambuf::xsputn(), and basic_filebuf::xsputn().

_ForwardIterator std::min_element ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Compare  __comp 
)

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 4764 of file stl_algo.h.

References __glibcxx_function_requires.

_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 4737 of file stl_algo.h.

References __glibcxx_function_requires.

Referenced by valarray::min().

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 719 of file stl_algobase.h.

References __glibcxx_function_requires.

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 683 of file stl_algobase.h.

References __glibcxx_function_requires.

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 4855 of file stl_algo.h.

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

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 4799 of file stl_algo.h.

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

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

Calls base.unsetf(ios_base::boolalpha).

Definition at line 796 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::showbase).

Definition at line 812 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::showpoint).

Definition at line 828 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::showpos).

Definition at line 844 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::skipws).

Definition at line 860 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::unitbuf).

Definition at line 892 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::uppercase).

Definition at line 876 of file ios_base.h.

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

void std::nth_element ( _RandomAccessIterator  __first,
_RandomAccessIterator  __nth,
_RandomAccessIterator  __last,
_Compare  __comp 
)

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 3893 of file stl_algo.h.

References __glibcxx_function_requires, __insertion_sort(), __median(), and __unguarded_partition().

void std::nth_element ( _RandomAccessIterator  __first,
_RandomAccessIterator  __nth,
_RandomAccessIterator  __last 
)

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 3842 of file stl_algo.h.

References __glibcxx_function_requires, __insertion_sort(), __median(), and __unguarded_partition().

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

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

Definition at line 942 of file ios_base.h.

References ios_base::basefield, ios_base::oct, and ios_base::setf().

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 1191 of file bitset.

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

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

Definition at line 135 of file stream_iterator.h.

References istream_iterator::_M_equal().

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

Based on operator==.

Definition at line 956 of file stl_vector.h.

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.

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

Returns !(x == y).

Definition at line 559 of file stl_set.h.

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

Based on operator==.

Definition at line 275 of file stl_queue.h.

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.

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

Returns !(x == y).

Definition at line 546 of file stl_multiset.h.

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

Based on operator==.

Definition at line 651 of file stl_multimap.h.

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

Based on operator==.

Definition at line 698 of file stl_map.h.

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

Based on operator==.

Definition at line 1202 of file stl_list.h.

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

Based on operator==.

Definition at line 1499 of file stl_deque.h.

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 2198 of file basic_string.h.

References basic_string::compare().

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

Test difference of C string and string.

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

Definition at line 2186 of file basic_string.h.

References basic_string::compare().

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

Test difference of two strings.

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

Definition at line 2174 of file basic_string.h.

References basic_string::compare().

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 2119 of file basic_string.h.

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

Concatenate string and C string.

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

Definition at line 2103 of file basic_string.h.

References basic_string::append().

basic_string< _CharT, _Traits, _Alloc > operator+ ( _CharT  __lhs,
const basic_string< _CharT, _Traits, _Alloc > &  __rhs 
)

Concatenate character and string.

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

Definition at line 693 of file basic_string.tcc.

References basic_string::size().

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

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 677 of file basic_string.tcc.

References basic_string::size().

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

Concatenate two strings.

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

Definition at line 2066 of file basic_string.h.

References basic_string::append().

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 949 of file stl_vector.h.

References lexicographical_compare().

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

Stack ordering relation.

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 244 of file stl_stack.h.

bool 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 552 of file stl_set.h.

bool std::operator< ( const queue< _Tp, _Sequence > &  __x,
const queue< _Tp, _Sequence > &  __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 269 of file stl_queue.h.

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

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

Definition at line 102 of file stl_pair.h.

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

Multiset ordering relation.

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 539 of file stl_multiset.h.

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

Multimap ordering relation.

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 644 of file stl_multimap.h.

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

Map ordering relation.

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 691 of file stl_map.h.

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 1195 of file stl_list.h.

References lexicographical_compare().

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 1491 of file stl_deque.h.

References lexicographical_compare().

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

Test if C string precedes string.

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

Definition at line 2235 of file basic_string.h.

References basic_string::compare().

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

Test if string precedes C string.

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

Definition at line 2223 of file basic_string.h.

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

Test if string precedes string.

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

Definition at line 2211 of file basic_string.h.

basic_ostream< _CharT, _Traits > & operator<< ( basic_ostream< _CharT, _Traits > &  __os,
const __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > &  __str 
)

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 615 of file vstring.tcc.

basic_ostream< _CharT, _Traits > & operator<< ( basic_ostream< _CharT, _Traits > &  __out,
const _CharT *  __s 
)

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 657 of file ostream.tcc.

References ios_base::badbit.

basic_ostream< _CharT, _Traits > & operator<< ( basic_ostream< _CharT, _Traits > &  __out,
_CharT  __c 
)

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 597 of file ostream.tcc.

References ios_base::badbit.

basic_ostream< _CharT, _Traits > & operator<< ( basic_ostream< _CharT, _Traits > &  __os,
const basic_string< _CharT, _Traits, _Alloc > &  __str 
)

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 767 of file ostream.tcc.

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

Based on operator<.

Definition at line 968 of file stl_vector.h.

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

Based on operator<.

Definition at line 262 of file stl_stack.h.

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

Returns !(y < x).

Definition at line 573 of file stl_set.h.

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

Based on operator<.

Definition at line 288 of file stl_queue.h.

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.

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

Returns !(y < x).

Definition at line 560 of file stl_multiset.h.

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

Based on operator<.

Definition at line 665 of file stl_multimap.h.

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

Based on operator<.

Definition at line 712 of file stl_map.h.

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

Based on operator<.

Definition at line 1214 of file stl_list.h.

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

Based on operator<.

Definition at line 1513 of file stl_deque.h.

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 2309 of file basic_string.h.

References basic_string::compare().

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

Test if string doesn't follow C string.

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

Definition at line 2297 of file basic_string.h.

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

Test if string doesn't follow string.

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

Definition at line 2285 of file basic_string.h.

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

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

Definition at line 128 of file stream_iterator.h.

References istream_iterator::_M_equal().

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

Vector equality comparison.

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 932 of file stl_vector.h.

References vector::begin(), vector::end(), equal(), and vector::size().

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

Stack equality comparison.

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 226 of file stl_stack.h.

References stack::c.

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

Set equality comparison.

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 535 of file stl_set.h.

References set::_M_t.

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

Queue equality comparison.

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 250 of file stl_queue.h.

References queue::c.

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

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

Definition at line 96 of file stl_pair.h.

References pair::first, and pair::second.

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

Multiset equality comparison.

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 522 of file stl_multiset.h.

References multiset::_M_t.

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

Multimap equality comparison.

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 627 of file stl_multimap.h.

References multimap::_M_t.

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

Map equality comparison.

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 674 of file stl_map.h.

References map::_M_t.

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

List equality comparison.

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 1166 of file stl_list.h.

References list::begin(), and list::end().

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 280 of file stl_iterator.h.

References reverse_iterator::base().

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

Deque equality comparison.

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 1473 of file stl_deque.h.

References deque::begin(), deque::end(), equal(), and deque::size().

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

Test equivalence of string and C string.

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

Definition at line 2161 of file basic_string.h.

References basic_string::compare().

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

Test equivalence of C string and string.

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

Definition at line 2149 of file basic_string.h.

References basic_string::compare().

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

Test equivalence of two strings.

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

Definition at line 2137 of file basic_string.h.

References basic_string::compare().

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

Based on operator<.

Definition at line 962 of file stl_vector.h.

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.

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

Returns y < x.

Definition at line 566 of file stl_set.h.

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

Based on operator<.

Definition at line 282 of file stl_queue.h.

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.

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

Returns y < x.

Definition at line 553 of file stl_multiset.h.

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

Based on operator<.

Definition at line 658 of file stl_multimap.h.

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

Based on operator<.

Definition at line 705 of file stl_map.h.

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

Based on operator<.

Definition at line 1208 of file stl_list.h.

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

Based on operator<.

Definition at line 1506 of file stl_deque.h.

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 2272 of file basic_string.h.

References basic_string::compare().

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

Test if string follows C string.

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

Definition at line 2260 of file basic_string.h.

References basic_string::compare().

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

Test if string follows string.

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

Definition at line 2248 of file basic_string.h.

References basic_string::compare().

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

Based on operator<.

Definition at line 974 of file stl_vector.h.

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

Based on operator<.

Definition at line 268 of file stl_stack.h.

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

Returns !(x < y).

Definition at line 580 of file stl_set.h.

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

Based on operator<.

Definition at line 295 of file stl_queue.h.

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.

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

Returns !(x < y).

Definition at line 567 of file stl_multiset.h.

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

Based on operator<.

Definition at line 672 of file stl_multimap.h.

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

Based on operator<.

Definition at line 719 of file stl_map.h.

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

Based on operator<.

Definition at line 1220 of file stl_list.h.

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

Based on operator<.

Definition at line 1520 of file stl_deque.h.

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 2346 of file basic_string.h.

References basic_string::compare().

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

Test if string doesn't precede C string.

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

Definition at line 2334 of file basic_string.h.

References basic_string::compare().

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

Test if string doesn't precede string.

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

Definition at line 2322 of file basic_string.h.

References basic_string::compare().

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 1228 of file bitset.

References bitset::_M_copy_from_string(), basic_ios::_M_setstate(), ios_base::badbit, basic_string::empty(), ios_base::eofbit, ios_base::failbit, ios_base::goodbit, basic_string::push_back(), basic_ios::rdbuf(), basic_string::reserve(), basic_streambuf::sbumpc(), basic_ios::setstate(), basic_streambuf::sputbackc(), and basic_ios::widen().

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

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 546 of file vstring.tcc.

References basic_ios::_M_setstate(), ios_base::badbit, ios_base::eofbit, ios_base::failbit, ios_base::getloc(), ios_base::goodbit, basic_ios::rdbuf(), basic_ios::setstate(), ctype_base::space, and ios_base::width().

basic_istream< _CharT, _Traits > & 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 1050 of file istream.tcc.

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

basic_istream< _CharT, _Traits > & 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 1023 of file istream.tcc.

References basic_ios::_M_setstate(), ios_base::badbit, ios_base::eofbit, ios_base::failbit, ios_base::goodbit, basic_ios::rdbuf(), and basic_ios::setstate().

basic_istream< _CharT, _Traits > & operator>> ( basic_istream< _CharT, _Traits > &  __is,
basic_string< _CharT, _Traits, _Alloc > &  __str 
)

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 1130 of file istream.tcc.

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

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 1209 of file bitset.

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 1200 of file bitset.

void std::partial_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __middle,
_RandomAccessIterator  __last,
_Compare  __comp 
)

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 2459 of file stl_algo.h.

References __glibcxx_function_requires, __pop_heap(), make_heap(), and sort_heap().

void std::partial_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __middle,
_RandomAccessIterator  __last 
)

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 2418 of file stl_algo.h.

References __glibcxx_function_requires, __pop_heap(), make_heap(), and sort_heap().

Referenced by __introsort_loop().

_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 2565 of file stl_algo.h.

References __adjust_heap(), __glibcxx_function_requires, make_heap(), and sort_heap().

_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 2501 of file stl_algo.h.

References __adjust_heap(), __glibcxx_function_requires, make_heap(), and sort_heap().

_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 239 of file stl_numeric.h.

References __glibcxx_function_requires.

_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 199 of file stl_numeric.h.

References __glibcxx_function_requires.

_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 2018 of file stl_algo.h.

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

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, and __pop_heap().

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, and __pop_heap().

Referenced by priority_queue::pop(), and sort_heap().

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 4966 of file stl_algo.h.

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

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 4910 of file stl_algo.h.

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

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, and __push_heap().

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, and __push_heap().

Referenced by priority_queue::push().

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 1924 of file stl_algo.h.

References __glibcxx_function_requires, and iter_swap().

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 1897 of file stl_algo.h.

References __glibcxx_function_requires, and iter_swap().

_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 1242 of file stl_algo.h.

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

_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 1167 of file stl_algo.h.

References __glibcxx_function_requires.

Referenced by remove().

_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 1204 of file stl_algo.h.

References __glibcxx_function_requires.

Referenced by remove_if().

_ForwardIterator std::remove_if ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Predicate  __pred 
)

Remove elements from a sequence using a predicate.

Parameters:
first A forward iterator.
last A forward iterator.
pred A predicate.
Returns:
An iterator designating the end of the resulting sequence.
All elements for which pred returns true are removed from the range [first,last).

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

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

Definition at line 1277 of file stl_algo.h.

References __glibcxx_function_requires, find_if(), and remove_copy_if().

void std::replace ( _ForwardIterator  __first,
_ForwardIterator  __last,
const _Tp &  __old_value,
const _Tp &  __new_value 
)

Replace each occurrence of one value in a sequence with another value.

Parameters:
first A forward iterator.
last A forward iterator.
old_value The value to be replaced.
new_value The replacement value.
Returns:
replace() returns no value.
For each iterator i in the range [first,last) if *i == old_value then the assignment *i = new_value is performed.

Definition at line 980 of file stl_algo.h.

References __glibcxx_function_requires.

_OutputIterator std::replace_copy ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
const _Tp &  __old_value,
const _Tp &  __new_value 
)

Copy a sequence, replacing each element of one value with another value.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
old_value The value to be replaced.
new_value The replacement value.
Returns:
The end of the output sequence, result+(last-first).
Copies each element in the input range [first,last) to the output range [result,result+(last-first)) replacing elements equal to old_value with new_value.

Definition at line 1044 of file stl_algo.h.

References __glibcxx_function_requires.

_OutputIterator std::replace_copy_if ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
_Predicate  __pred,
const _Tp &  __new_value 
)

Copy a sequence, replacing each value for which a predicate returns true with another value.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
pred A predicate.
new_value The replacement value.
Returns:
The end of the output sequence, result+(last-first).
Copies each element in the range [first,last) to the range [result,result+(last-first)) replacing elements for which pred returns true with new_value.

Definition at line 1081 of file stl_algo.h.

References __glibcxx_function_requires.

void std::replace_if ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Predicate  __pred,
const _Tp &  __new_value 
)

Replace each value in a sequence for which a predicate returns true with another value.

Parameters:
first A forward iterator.
last A forward iterator.
pred A predicate.
new_value The replacement value.
Returns:
replace_if() returns no value.
For each iterator i in the range [first,last) if pred(*i) is true then the assignment *i = new_value is performed.

Definition at line 1011 of file stl_algo.h.

References __glibcxx_function_requires.

_Resetiosflags std::resetiosflags ( ios_base::fmtflags  __mask  )  [inline]

Manipulator for setf.

Parameters:
mask A format flags mask.
Sent to a stream object, this manipulator resets the specified flags, via stream.setf(0,mask).

Definition at line 63 of file iomanip.

References _Resetiosflags::_M_mask.

void std::return_temporary_buffer ( _Tp *  __p  ) 

The companion to get_temporary_buffer().

Parameters:
p A buffer previously allocated by get_temporary_buffer.
Returns:
None.
Frees the memory pointed to by p.

Definition at line 122 of file memory.

Referenced by _Temporary_buffer::_Temporary_buffer(), and _Temporary_buffer::~_Temporary_buffer().

void std::reverse ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last 
) [inline]

Reverse a sequence.

Parameters:
first A bidirectional iterator.
last A bidirectional iterator.
Returns:
reverse() returns no value.
Reverses the order of the elements in the range [first,last), so that the first element becomes the last etc. For every i such that 0<=i<=(last-first)/2), reverse() swaps *(first+i) and *(last-(i+1))

Definition at line 1605 of file stl_algo.h.

References __glibcxx_function_requires, __iterator_category(), and __reverse().

Referenced by next_permutation(), and prev_permutation().

_OutputIterator std::reverse_copy ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last,
_OutputIterator  __result 
)

Copy a sequence, reversing its elements.

Parameters:
first A bidirectional iterator.
last A bidirectional iterator.
result An output iterator.
Returns:
An iterator designating the end of the resulting sequence.
Copies the elements in the range [first,last) to the range [result,result+(last-first)) such that the order of the elements is reversed. For every i such that 0<=i<=(last-first), reverse_copy() performs the assignment *(result+(last-first)-i) = *(first+i). The ranges [first,last) and [result,result+(last-first)) must not overlap.

Definition at line 1631 of file stl_algo.h.

References __glibcxx_function_requires.

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

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

Definition at line 917 of file ios_base.h.

References ios_base::adjustfield, ios_base::right, and ios_base::setf().

void std::rotate ( _ForwardIterator  __first,
_ForwardIterator  __middle,
_ForwardIterator  __last 
) [inline]

Rotate the elements of a sequence.

Parameters:
first A forward iterator.
middle A forward iterator.
last A forward iterator.
Returns:
Nothing.
Rotates the elements of the range [first,last) by (middle-first) positions so that the element at middle is moved to first, the element at middle+1 is moved to +1 and so on for each element in the range [first,last).

This effectively swaps the ranges [first,middle) and [middle,last).

Performs *(first+(n+(last-middle))%(last-first))=*(first+n) for each n in the range [0,last-first).

Definition at line 1838 of file stl_algo.h.

References __glibcxx_function_requires, and __rotate().

Referenced by __inplace_stable_partition(), __merge_without_buffer(), __rotate_adaptive(), and __stable_partition_adaptive().

_OutputIterator std::rotate_copy ( _ForwardIterator  __first,
_ForwardIterator  __middle,
_ForwardIterator  __last,
_OutputIterator  __result 
)

Copy a sequence, rotating its elements.

Parameters:
first A forward iterator.
middle A forward iterator.
last A forward iterator.
result An output iterator.
Returns:
An iterator designating the end of the resulting sequence.
Copies the elements of the range [first,last) to the range beginning at
Returns:
, rotating the copied elements by (middle-first) positions so that the element at middle is moved to result, the element at middle+1 is moved to

+1 and so on for each element in the range [first,last).

Performs *(result+(n+(last-middle))%(last-first))=*(first+n) for each n in the range [0,last-first).

Definition at line 1871 of file stl_algo.h.

References __glibcxx_function_requires, and copy().

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

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

Definition at line 959 of file ios_base.h.

References ios_base::floatfield, ios_base::scientific, and ios_base::setf().

_ForwardIterator1 std::search ( _ForwardIterator1  __first1,
_ForwardIterator1  __last1,
_ForwardIterator2  __first2,
_ForwardIterator2  __last2,
_BinaryPredicate  __predicate 
)

Search a sequence for a matching sub-sequence using a predicate.

Parameters:
first1 A forward iterator.
last1 A forward iterator.
first2 A forward iterator.
last2 A forward iterator.
predicate A binary predicate.
Returns:
The first 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 predicate to determine equality, and returns an iterator to the first element of the sub-sequence, or last1 if no such iterator exists.

See also:
search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2)

Definition at line 548 of file stl_algo.h.

References __glibcxx_function_requires.

_ForwardIterator1 std::search ( _ForwardIterator1  __first1,
_ForwardIterator1  __last1,
_ForwardIterator2  __first2,
_ForwardIterator2  __last2 
)

Search a sequence for a matching sub-sequence.

Parameters:
first1 A forward iterator.
last1 A forward iterator.
first2 A forward iterator.
last2 A forward iterator.
Returns:
The first 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.

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

Definition at line 476 of file stl_algo.h.

References __glibcxx_function_requires, and find().

Referenced by __find_end(), __versa_string::find(), rope::find(), and basic_string::find().

_ForwardIterator std::search_n ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Integer  __count,
const _Tp &  __val,
_BinaryPredicate  __binary_pred 
)

Search a sequence for a number of consecutive values using a predicate.

Parameters:
first A forward iterator.
last A forward iterator.
count The number of consecutive values.
val The value to find.
binary_pred A binary predicate.
Returns:
The first iterator i in the range [first,last-count) such that binary_pred(*(i+N),val) is true for each N in the range [0,count), or last if no such iterator exists.
Searches the range [first,last) for count consecutive elements for which the predicate returns true.

Definition at line 840 of file stl_algo.h.

References __glibcxx_function_requires, __iterator_category(), and __search_n().

_ForwardIterator std::search_n ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Integer  __count,
const _Tp &  __val 
)

Search a sequence for a number of consecutive values.

Parameters:
first A forward iterator.
last A forward iterator.
count The number of consecutive values.
val The value to find.
Returns:
The first iterator i in the range [first,last-count) such that *(i+N) == val for each N in the range [0,count), or last if no such iterator exists.
Searches the range [first,last) for count consecutive elements equal to val.

Definition at line 711 of file stl_algo.h.

References __glibcxx_function_requires, __iterator_category(), __search_n(), and find().

new_handler std::set_new_handler ( new_handler   )  throw ()

Takes a replacement handler as the argument, returns the previous handler.

terminate_handler std::set_terminate ( terminate_handler   )  throw ()

Takes a new handler function as an argument, returns the old function.

unexpected_handler std::set_unexpected ( unexpected_handler   )  throw ()

Takes a new handler function as an argument, returns the old function.

_Setbase std::setbase ( int  __base  )  [inline]

Manipulator for setf.

Parameters:
base A numeric base.
Sent to a stream object, this manipulator changes the ios_base::basefield flags to oct, dec, or hex when base is 8, 10, or 16, accordingly, and to 0 if base is any other value.

Definition at line 132 of file iomanip.

References _Setbase::_M_base.

_Setfill<_CharT> std::setfill ( _CharT  __c  )  [inline]

Manipulator for fill.

Parameters:
c The new fill character.
Sent to a stream object, this manipulator calls fill(c) for that object.

Definition at line 174 of file iomanip.

References _Setfill::_M_c.

_Setiosflags std::setiosflags ( ios_base::fmtflags  __mask  )  [inline]

Manipulator for setf.

Parameters:
mask A format flags mask.
Sent to a stream object, this manipulator sets the format flags to mask.

Definition at line 97 of file iomanip.

References _Setiosflags::_M_mask.

_Setprecision std::setprecision ( int  __n  )  [inline]

Manipulator for precision.

Parameters:
n The new precision.
Sent to a stream object, this manipulator calls precision(n) for that object.

Definition at line 208 of file iomanip.

References _Setprecision::_M_n.

_Setw std::setw ( int  __n  )  [inline]

Manipulator for width.

Parameters:
n The new width.
Sent to a stream object, this manipulator calls width(n) for that object.

Definition at line 242 of file iomanip.

References _Setw::_M_n.

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

Calls base.setf(ios_base::showbase).

Definition at line 804 of file ios_base.h.

References ios_base::setf(), and ios_base::showbase.

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

Calls base.setf(ios_base::showpoint).

Definition at line 820 of file ios_base.h.

References ios_base::setf(), and ios_base::showpoint.

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

Calls base.setf(ios_base::showpos).

Definition at line 836 of file ios_base.h.

References ios_base::setf(), and ios_base::showpos.

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

Calls base.setf(ios_base::skipws).

Definition at line 852 of file ios_base.h.

References ios_base::setf(), and ios_base::skipws.

void std::sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
) [inline]

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

Parameters:
first An iterator.
last Another iterator.
comp A comparison functor.
Returns:
Nothing.
Sorts the elements in the range [first,last) in ascending order, such that comp(*(i+1),*i) is false for every iterator i in the range [first,last-1).

The relative ordering of equivalent elements is not preserved, use stable_sort() if this is needed.

Definition at line 2734 of file stl_algo.h.

References __final_insertion_sort(), __glibcxx_function_requires, __introsort_loop(), and __lg().

void std::sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
) [inline]

Sort the elements of a sequence.

Parameters:
first An iterator.
last Another iterator.
Returns:
Nothing.
Sorts the elements in the range [first,last) in ascending order, such that *(i+1)<*i is false for each iterator i in the range [first,last-1).

The relative ordering of equivalent elements is not preserved, use stable_sort() if this is needed.

Definition at line 2700 of file stl_algo.h.

References __final_insertion_sort(), __glibcxx_function_requires, __introsort_loop(), and __lg().

void std::sort_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
)

Sort a heap using comparison functor.

Parameters:
first Start of heap.
last End of heap.
comp Comparison functor to use.
This operation sorts the valid heap in the range [first,last). Comparisons are made using comp.

Definition at line 448 of file stl_heap.h.

References __glibcxx_function_requires, and pop_heap().

void std::sort_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
)

Sort a heap.

Parameters:
first Start of heap.
last End of heap.
This operation sorts the valid heap in the range [first,last).

Definition at line 422 of file stl_heap.h.

References __glibcxx_function_requires, and pop_heap().

Referenced by partial_sort(), and partial_sort_copy().

_ForwardIterator std::stable_partition ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Predicate  __pred 
)

Move elements for which a predicate is true to the beginning of a sequence, preserving relative ordering.

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).
Performs the same function as partition() with the additional guarantee that the relative ordering of elements in each group is preserved, so any two elements x and y in the range [first,last) such that pred(x)==pred(y) will have the same relative ordering after calling stable_partition().

Definition at line 2129 of file stl_algo.h.

References __glibcxx_function_requires, __inplace_stable_partition(), __stable_partition_adaptive(), _Temporary_buffer::begin(), _Temporary_buffer::requested_size(), and _Temporary_buffer::size().

void std::stable_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
) [inline]

Sort the elements of a sequence using a predicate for comparison, preserving the relative order of equivalent elements.

Parameters:
first An iterator.
last Another iterator.
comp A comparison functor.
Returns:
Nothing.
Sorts the elements in the range [first,last) in ascending order, such that comp(*(i+1),*i) is false for each iterator i in the range [first,last-1).

The relative ordering of equivalent elements is preserved, so any two elements x and y in the range [first,last) such that comp(x,y) is false and comp(y,x) is false will have the same relative ordering after calling stable_sort().

Definition at line 3801 of file stl_algo.h.

References __glibcxx_function_requires, __inplace_stable_sort(), __stable_sort_adaptive(), _Temporary_buffer::begin(), and _Temporary_buffer::size().

void std::stable_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last 
) [inline]

Sort the elements of a sequence, preserving the relative order of equivalent elements.

Parameters:
first An iterator.
last Another iterator.
Returns:
Nothing.
Sorts the elements in the range [first,last) in ascending order, such that *(i+1)<*i is false for each iterator i in the range [first,last-1).

The relative ordering of equivalent elements is preserved, so any two elements x and y in the range [first,last) such that x<y is false and y<x is false will have the same relative ordering after calling stable_sort().

Definition at line 3760 of file stl_algo.h.

References __glibcxx_function_requires, __inplace_stable_sort(), __stable_sort_adaptive(), _Temporary_buffer::begin(), and _Temporary_buffer::size().

void std::swap ( vector< _Tp, _Alloc > &  __x,
vector< _Tp, _Alloc > &  __y 
) [inline]

See std::vector::swap().

Definition at line 980 of file stl_vector.h.

References vector::swap().

void std::swap ( set< _Key, _Compare, _Alloc > &  __x,
set< _Key, _Compare, _Alloc > &  __y 
) [inline]

See std::set::swap().

Definition at line 587 of file stl_set.h.

References set::swap().

void std::swap ( multiset< _Key, _Compare, _Alloc > &  __x,
multiset< _Key, _Compare, _Alloc > &  __y 
) [inline]

See std::multiset::swap().

Definition at line 574 of file stl_multiset.h.

References multiset::swap().

void std::swap ( multimap< _Key, _Tp, _Compare, _Alloc > &  __x,
multimap< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

See std::multimap::swap().

Definition at line 679 of file stl_multimap.h.

References multimap::swap().

void std::swap ( map< _Key, _Tp, _Compare, _Alloc > &  __x,
map< _Key, _Tp, _Compare, _Alloc > &  __y 
) [inline]

See std::map::swap().

Definition at line 726 of file stl_map.h.

References map::swap().

void std::swap ( list< _Tp, _Alloc > &  __x,
list< _Tp, _Alloc > &  __y 
) [inline]

See std::list::swap().

Definition at line 1226 of file stl_list.h.

References list::swap().

void std::swap ( deque< _Tp, _Alloc > &  __x,
deque< _Tp, _Alloc > &  __y 
) [inline]

See std::deque::swap().

Definition at line 1527 of file stl_deque.h.

References deque::swap().

void std::swap ( _Tp &  __a,
_Tp &  __b 
) [inline]

Swaps two values.

Parameters:
a A thing of arbitrary type.
b Another thing of arbitrary type.
Returns:
Nothing.
This is the simple classic generic implementation. It will work on any type which has a copy constructor and an assignment operator.

Definition at line 92 of file stl_algobase.h.

References __glibcxx_function_requires.

void std::swap ( basic_string< _CharT, _Traits, _Alloc > &  __lhs,
basic_string< _CharT, _Traits, _Alloc > &  __rhs 
) [inline]

Swap contents of two strings.

Parameters:
lhs First string.
rhs Second string.
Exchanges the contents of lhs and rhs in constant time.

Definition at line 2359 of file basic_string.h.

References basic_string::swap().

Referenced by __partition(), __rotate(), __alloc_swap< _Alloc, false >::_S_do_it(), __iter_swap< true >::iter_swap(), hash_code_base< Key, Value, ExtractKey, Equal, H1, H2, default_ranged_hash, true >::m_swap(), hash_code_base< Key, Value, ExtractKey, Equal, H1, H2, default_ranged_hash, false >::m_swap(), hash_code_base< Key, Value, ExtractKey, Equal, H1, H2, H, false >::m_swap(), vector::swap(), _Rb_tree::swap(), deque::swap(), vector< bool, _Alloc >::swap(), slist::swap(), hashtable::swap(), weak_ptr::swap(), and shared_ptr::swap().

_ForwardIterator2 std::swap_ranges ( _ForwardIterator1  __first1,
_ForwardIterator1  __last1,
_ForwardIterator2  __first2 
)

Swap the elements of two sequences.

Parameters:
first1 A forward iterator.
last1 A forward iterator.
first2 A forward iterator.
Returns:
An iterator equal to first2+(last1-first1).
Swaps each element in the range [first1,last1) with the corresponding element in the range [first2,(last1-first1)). The ranges must not overlap.

Definition at line 875 of file stl_algo.h.

References __glibcxx_function_requires, and iter_swap().

Referenced by __rotate(), std::tr1::swap(), and array::swap().

void std::terminate (  ) 

The runtime will call this function if exception handling must be abandoned for any reason. It can also be called by the user.

_CharT tolower ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.tolower(__c).

Definition at line 4574 of file locale_facets.h.

_CharT toupper ( _CharT  __c,
const locale &  __loc 
) [inline]

Convenience interface to ctype.toupper(__c).

Definition at line 4568 of file locale_facets.h.

_OutputIterator std::transform ( _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_OutputIterator  __result,
_BinaryOperation  __binary_op 
)

Perform an operation on corresponding elements of two sequences.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
result An output iterator.
binary_op A binary operator.
Returns:
An output iterator equal to result+(last-first).
Applies the operator to the corresponding elements in the two input ranges and assigns the results to successive elements of the output sequence. Evaluates *(result+N)=binary_op(*(first1+N),*(first2+N)) for each N in the range [0,last1-first1).

binary_op must not alter either of its arguments.

Definition at line 949 of file stl_algo.h.

References __glibcxx_function_requires.

_OutputIterator std::transform ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
_UnaryOperation  __unary_op 
)

Perform an operation on a sequence.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
unary_op A unary operator.
Returns:
An output iterator equal to result+(last-first).
Applies the operator to each element in the input range and assigns the results to successive elements of the output sequence. Evaluates *(result+N)=unary_op(*(first+N)) for each N in the range [0,last-first).

unary_op must not alter its argument.

Definition at line 914 of file stl_algo.h.

References __glibcxx_function_requires.

bool std::uncaught_exception (  )  throw ()

[18.6.4]/1: "Returns true after completing evaluation of a throw-expression until either completing initialization of the exception-declaration in the matching handler or entering unexpected() due to the throw; or after entering terminate() for any reason other than an explicit call to terminate(). [Note: This includes stack unwinding [15.2]. end note]"

2: "When uncaught_exception() is true, throwing an exception can result in a call of terminate() (15.5.1)."

Referenced by basic_ostream::sentry::~sentry().

void std::unexpected (  ) 

The runtime will call this function if an exception is thrown which violates the function's exception specification.

_ForwardIterator std::uninitialized_copy ( _InputIterator  __first,
_InputIterator  __last,
_ForwardIterator  __result 
) [inline]

Copies the range [first,last) into result.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
Returns:
result + (first - last)
Like copy(), but does not require an initialized output range.

Definition at line 107 of file stl_uninitialized.h.

References __uninitialized_copy_aux().

Referenced by __uninitialized_copy_a(), and __gnu_cxx::__uninitialized_copy_n().

void std::uninitialized_fill ( _ForwardIterator  __first,
_ForwardIterator  __last,
const _Tp &  __x 
) [inline]

Copies the value x into the range [first,last).

Parameters:
first An input iterator.
last An input iterator.
x The source value.
Returns:
Nothing.
Like fill(), but does not require an initialized output range.

Definition at line 169 of file stl_uninitialized.h.

References __uninitialized_fill_aux().

Referenced by __uninitialized_fill_a().

void std::uninitialized_fill_n ( _ForwardIterator  __first,
_Size  __n,
const _Tp &  __x 
) [inline]

Copies the value x into the range [first,first+n).

Parameters:
first An input iterator.
n The number of copies to make.
x The source value.
Returns:
Nothing.
Like fill_n(), but does not require an initialized output range.

Definition at line 214 of file stl_uninitialized.h.

References __uninitialized_fill_n_aux().

Referenced by __uninitialized_fill_n_a(), and _Temporary_buffer::_M_initialize_buffer().

_ForwardIterator std::unique ( _ForwardIterator  __first,
_ForwardIterator  __last,
_BinaryPredicate  __binary_pred 
)

Remove consecutive values from a sequence using a predicate.

Parameters:
first A forward iterator.
last A forward iterator.
binary_pred A binary predicate.
Returns:
An iterator designating the end of the resulting sequence.
Removes all but the first element from each group of consecutive values for which binary_pred returns true. unique() is stable, so the relative order of elements that are not removed is unchanged. Elements between the end of the resulting sequence and last are still present, but their value is unspecified.

Definition at line 1522 of file stl_algo.h.

References __glibcxx_function_requires, and adjacent_find().

_ForwardIterator std::unique ( _ForwardIterator  __first,
_ForwardIterator  __last 
)

Remove consecutive duplicate values from a sequence.

Parameters:
first A forward iterator.
last A forward iterator.
Returns:
An iterator designating the end of the resulting sequence.
Removes all but the first element from each group of consecutive values that compare equal. unique() is stable, so the relative order of elements that are not removed is unchanged. Elements between the end of the resulting sequence and last are still present, but their value is unspecified.

Definition at line 1483 of file stl_algo.h.

References __glibcxx_function_requires, and adjacent_find().

_OutputIterator std::unique_copy ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
_BinaryPredicate  __binary_pred 
) [inline]

Copy a sequence, removing consecutive values using a predicate.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
binary_pred A binary predicate.
Returns:
An iterator designating the end of the resulting sequence.
Copies each element in the range [first,last) to the range beginning at result, except that only the first element is copied from groups of consecutive elements for which binary_pred returns true. unique_copy() is stable, so the relative order of elements that are copied is unchanged.

Definition at line 1450 of file stl_algo.h.

References __glibcxx_function_requires, and __unique_copy().

_OutputIterator std::unique_copy ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result 
) [inline]

Copy a sequence, removing consecutive duplicate values.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
Returns:
An iterator designating the end of the resulting sequence.
Copies each element in the range [first,last) to the range beginning at result, except that only the first element is copied from groups of consecutive elements that compare equal. unique_copy() is stable, so the relative order of elements that are copied is unchanged.

Definition at line 1414 of file stl_algo.h.

References __glibcxx_function_requires, and __unique_copy().

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

Calls base.setf(ios_base::unitbuf).

Definition at line 884 of file ios_base.h.

References ios_base::setf(), and ios_base::unitbuf.

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

Calls base.setf(ios_base::uppercase).

Definition at line 868 of file ios_base.h.

References ios_base::setf(), and ios_base::uppercase.

const _Facet & use_facet ( const locale &  __loc  )  [inline]

Return a facet.

use_facet looks for and returns a reference to a facet of type Facet where Facet is the template parameter. If has_facet(locale) is true, there is a suitable facet to return. It throws std::bad_cast if the locale doesn't contain a facet of type Facet.

Parameters:
Facet The facet type to access.
locale The locale to use.
Returns:
Reference to facet of type Facet.
Exceptions:
std::bad_cast if locale doesn't contain a facet of type Facet.

Definition at line 110 of file locale_facets.tcc.

References locale::_M_impl.

basic_istream< _CharT, _Traits > & ws ( basic_istream< _CharT, _Traits > &  __is  ) 

Quick and easy way to eat whitespace.

This manipulator extracts whitespace characters, stopping when the next character is non-whitespace, or when the input sequence is empty. If the sequence is empty, eofbit is set in the stream, but not failbit.

The current locale is used to distinguish whitespace characters.

Example:

     MyClass   mc;

     std::cin >> std::ws >> mc;
will skip leading whitespace before calling operator>> on cin and your object. Note that the same effect can be achieved by creating a std::basic_istream::sentry inside your definition of operator>>.

Definition at line 1106 of file istream.tcc.

References ios_base::eofbit, ios_base::getloc(), basic_ios::rdbuf(), basic_ios::setstate(), and ctype_base::space.


Variable Documentation

ostream cerr

Linked to standard error (unbuffered).

istream cin

Linked to standard input.

ostream clog

Linked to standard error (buffered).

ostream cout

Linked to standard output.

wostream wcerr

Linked to standard error (unbuffered).

wistream wcin

Linked to standard input.

wostream wclog

Linked to standard error (buffered).

wostream wcout

Linked to standard output.


Generated on Thu Nov 1 17:38:02 2007 for libstdc++ by  doxygen 1.5.1