Classes

[NOHEADER]

[NOHEADER]

Typedefs

Enumerations

Functions

Variables


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.

Referenced by fpos::fpos(), fpos::operator+(), fpos::operator+=(), fpos::operator-(), and fpos::operator-=().

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.

Referenced by num_put::do_put(), operator<<(), operator>>(), ios_base::precision(), and ios_base::width().

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.


Function Documentation

Type accumulate InputIterator  first,
InputIterator  last,
Type  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.

Type accumulate InputIterator  first,
InputIterator  last,
Type  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.

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

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

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

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

Referenced by unique().

void 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.

Referenced by equal_range(), lower_bound(), and upper_bound().

back_insert_iterator<Container> 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 408 of file stl_iterator.h.

ios_base& boolalpha ios_base &  __base  )  [inline]
 

Calls base.setf(ios_base::boolalpha).

Definition at line 745 of file ios_base.h.

References ios_base::setf().

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

Referenced by basic_string::assign(), basic_string::copy(), vector::erase(), deque::erase(), basic_string::insert(), merge(), vector::operator=(), deque::operator=(), basic_string::replace(), rotate_copy(), set_difference(), set_symmetric_difference(), and set_union().

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

Referenced by deque::erase().

iterator_traits<InputIterator>::difference_type count InputIterator  first,
InputIterator  last,
const Type &  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 412 of file stl_algo.h.

iterator_traits<InputIterator>::difference_type 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.

ios_base& dec ios_base &  __base  )  [inline]
 

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

Definition at line 883 of file ios_base.h.

References ios_base::setf().

iterator_traits<InputIterator>::difference_type 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.

Referenced by equal_range(), inplace_merge(), lower_bound(), list::size(), and upper_bound().

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

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

Referenced by operator==().

void fill ForwardIterator  first,
ForwardIterator  last,
const Type &  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 525 of file stl_algobase.h.

OutputIterator fill_n OutputIterator  first,
Size  n,
const Type &  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 601 of file stl_algobase.h.

InputIterator find InputIterator  first,
InputIterator  last,
const Type &  __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 306 of file stl_algo.h.

Referenced by basic_string::find(), basic_string::find_first_not_of(), basic_string::find_first_of(), basic_string::find_last_not_of(), basic_string::find_last_of(), remove(), search(), and search_n().

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

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

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

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

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

Referenced by remove_if().

ios_base& fixed ios_base &  __base  )  [inline]
 

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

Definition at line 908 of file ios_base.h.

References ios_base::setf().

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

front_insert_iterator<Container> 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 482 of file stl_iterator.h.

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

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

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

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

References basic_string::append(), basic_string::erase(), ios_base::iostate, and basic_string::max_size().

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

ios_base& hex ios_base &  __base  )  [inline]
 

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

Definition at line 891 of file ios_base.h.

References ios_base::setf().

Type inner_product InputIterator1  first1,
InputIterator1  last1,
InputIterator2  first2,
Type  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.

Type inner_product InputIterator1  first1,
InputIterator1  last1,
InputIterator2  first2,
Type  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.

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

References distance().

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

References distance().

insert_iterator<Container> 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 578 of file stl_iterator.h.

References operator+().

ios_base& internal ios_base &  __base  )  [inline]
 

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

Definition at line 858 of file ios_base.h.

References ios_base::setf().

bool isspace CharT  c,
const locale &  __loc
[inline]
 

Convenience interface to ctype.is().

Definition at line 4500 of file locale_facets.h.

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

Referenced by next_permutation(), prev_permutation(), random_shuffle(), and swap_ranges().

ios_base& left ios_base &  __base  )  [inline]
 

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

Definition at line 866 of file ios_base.h.

References ios_base::setf().

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

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

Referenced by operator<().

void 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.

void 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.

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

pair<T1, T2> 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.

const Type& max const Type &  a,
const Type &  __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 213 of file stl_algobase.h.

const Type& max const Type &  a,
const Type &  __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 171 of file stl_algobase.h.

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

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

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

References copy().

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

References copy().

const Type& min const Type &  a,
const Type &  __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 193 of file stl_algobase.h.

const Type& min const Type &  a,
const Type &  __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 149 of file stl_algobase.h.

Referenced by basic_string::compare(), basic_string< char >::compare(), and basic_string::rfind().

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

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

pair<InputIterator1, InputIterator2> 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 685 of file stl_algobase.h.

pair<InputIterator1, InputIterator2> 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 648 of file stl_algobase.h.

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

References iter_swap(), and reverse().

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

References iter_swap(), and reverse().

ios_base& noboolalpha ios_base &  __base  )  [inline]
 

Calls base.unsetf(ios_base::boolalpha).

Definition at line 753 of file ios_base.h.

References ios_base::unsetf().

ios_base& noshowbase ios_base &  __base  )  [inline]
 

Calls base.unsetf(ios_base::showbase).

Definition at line 769 of file ios_base.h.

References ios_base::unsetf().

ios_base& noshowpoint ios_base &  __base  )  [inline]
 

Calls base.unsetf(ios_base::showpoint).

Definition at line 785 of file ios_base.h.

References ios_base::unsetf().

ios_base& noshowpos ios_base &  __base  )  [inline]
 

Calls base.unsetf(ios_base::showpos).

Definition at line 801 of file ios_base.h.

References ios_base::unsetf().

ios_base& noskipws ios_base &  __base  )  [inline]
 

Calls base.unsetf(ios_base::skipws).

Definition at line 817 of file ios_base.h.

References ios_base::unsetf().

ios_base& nounitbuf ios_base &  __base  )  [inline]
 

Calls base.unsetf(ios_base::unitbuf).

Definition at line 849 of file ios_base.h.

References ios_base::unsetf().

ios_base& nouppercase ios_base &  __base  )  [inline]
 

Calls base.unsetf(ios_base::uppercase).

Definition at line 833 of file ios_base.h.

References ios_base::unsetf().

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

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

ios_base& oct ios_base &  __base  )  [inline]
 

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

Definition at line 899 of file ios_base.h.

References ios_base::setf().

bool operator!= const istream_iterator< Type, CharT, Traits, Dist > &  x,
const istream_iterator< Type, 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.

bool operator!= const vector< Type, Alloc > &  x,
const vector< Type, Alloc > &  y
[inline]
 

Based on operator==.

Definition at line 952 of file stl_vector.h.

bool operator!= const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Based on operator==.

Definition at line 250 of file stl_stack.h.

bool operator!= const set< Key, Compare, Alloc > &  x,
const set< Key, Compare, Alloc > &  y
[inline]
 

Returns !(x == y).

Definition at line 560 of file stl_set.h.

bool operator!= const queue< Type, Sequence > &  x,
const queue< Type, Sequence > &  y
[inline]
 

Based on operator==.

Definition at line 275 of file stl_queue.h.

bool 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 operator!= const multiset< Key, Compare, Alloc > &  x,
const multiset< Key, Compare, Alloc > &  y
[inline]
 

Returns !(x == y).

Definition at line 551 of file stl_multiset.h.

bool operator!= const multimap< Key, Type, Compare, Alloc > &  x,
const multimap< Key, Type, Compare, Alloc > &  y
[inline]
 

Based on operator==.

Definition at line 644 of file stl_multimap.h.

bool operator!= const map< Key, Type, Compare, Alloc > &  x,
const map< Key, Type, Compare, Alloc > &  y
[inline]
 

Based on operator==.

Definition at line 662 of file stl_map.h.

bool operator!= const list< Type, Alloc > &  x,
const list< Type, Alloc > &  y
[inline]
 

Based on operator==.

Definition at line 1204 of file stl_list.h.

bool operator!= const deque< Type, Alloc > &  x,
const deque< Type, Alloc > &  y
[inline]
 

Based on operator==.

Definition at line 1483 of file stl_deque.h.

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

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

References basic_string::compare().

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

References basic_string::compare().

basic_string<CharT, Traits, Alloc> 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 2029 of file basic_string.h.

basic_string<CharT, Traits, Alloc> 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 2013 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 656 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 640 of file basic_string.tcc.

References basic_string::reserve(), and basic_string::size().

basic_string<CharT, Traits, Alloc> 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 1976 of file basic_string.h.

References basic_string::append().

Referenced by inserter().

bool operator< const vector< Type, Alloc > &  x,
const vector< Type, 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 945 of file stl_vector.h.

References lexicographical_compare().

bool operator< const stack< Type, Seq > &  x,
const stack< Type, 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 553 of file stl_set.h.

bool operator< const queue< Type, Sequence > &  x,
const queue< Type, 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 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 544 of file stl_multiset.h.

bool operator< const multimap< Key, Type, Compare, Alloc > &  x,
const multimap< Key, Type, 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 637 of file stl_multimap.h.

bool operator< const map< Key, Type, Compare, Alloc > &  x,
const map< Key, Type, 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 655 of file stl_map.h.

bool operator< const list< Type, Alloc > &  x,
const list< Type, 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 1197 of file stl_list.h.

References lexicographical_compare().

bool operator< const deque< Type, Alloc > &  x,
const deque< Type, 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 1475 of file stl_deque.h.

References lexicographical_compare().

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

References basic_string::compare().

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

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

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

References streamsize.

bool operator<= const vector< Type, Alloc > &  x,
const vector< Type, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 964 of file stl_vector.h.

bool operator<= const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Based on operator<.

Definition at line 262 of file stl_stack.h.

bool operator<= const set< Key, Compare, Alloc > &  x,
const set< Key, Compare, Alloc > &  y
[inline]
 

Returns !(y < x).

Definition at line 574 of file stl_set.h.

bool operator<= const queue< Type, Sequence > &  x,
const queue< Type, Sequence > &  y
[inline]
 

Based on operator<.

Definition at line 288 of file stl_queue.h.

bool 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 operator<= const multiset< Key, Compare, Alloc > &  x,
const multiset< Key, Compare, Alloc > &  y
[inline]
 

Returns !(y < x).

Definition at line 565 of file stl_multiset.h.

bool operator<= const multimap< Key, Type, Compare, Alloc > &  x,
const multimap< Key, Type, Compare, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 658 of file stl_multimap.h.

bool operator<= const map< Key, Type, Compare, Alloc > &  x,
const map< Key, Type, Compare, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 676 of file stl_map.h.

bool operator<= const list< Type, Alloc > &  x,
const list< Type, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 1216 of file stl_list.h.

bool operator<= const deque< Type, Alloc > &  x,
const deque< Type, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 1497 of file stl_deque.h.

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

References basic_string::compare().

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

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

bool operator== const istream_iterator< Type, CharT, Traits, Dist > &  x,
const istream_iterator< Type, 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.

bool operator== const vector< Type, Alloc > &  x,
const vector< Type, 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 928 of file stl_vector.h.

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

bool operator== const stack< Type, Seq > &  x,
const stack< Type, 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 536 of file stl_set.h.

bool operator== const queue< Type, Sequence > &  x,
const queue< Type, 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 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 527 of file stl_multiset.h.

bool operator== const multimap< Key, Type, Compare, Alloc > &  x,
const multimap< Key, Type, 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 620 of file stl_multimap.h.

bool operator== const map< Key, Type, Compare, Alloc > &  x,
const map< Key, Type, 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 638 of file stl_map.h.

bool operator== const list< Type, Alloc > &  x,
const list< Type, 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 1168 of file stl_list.h.

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

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

bool operator== const deque< Type, Alloc > &  x,
const deque< Type, 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 1457 of file stl_deque.h.

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

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

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

References basic_string::compare().

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

bool operator> const vector< Type, Alloc > &  x,
const vector< Type, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 958 of file stl_vector.h.

References operator>().

bool operator> const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Based on operator<.

Definition at line 256 of file stl_stack.h.

bool operator> const set< Key, Compare, Alloc > &  x,
const set< Key, Compare, Alloc > &  y
[inline]
 

Returns y < x.

Definition at line 567 of file stl_set.h.

References operator>().

bool operator> const queue< Type, Sequence > &  x,
const queue< Type, Sequence > &  y
[inline]
 

Based on operator<.

Definition at line 282 of file stl_queue.h.

bool 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 operator> const multiset< Key, Compare, Alloc > &  x,
const multiset< Key, Compare, Alloc > &  y
[inline]
 

Returns y < x.

Definition at line 558 of file stl_multiset.h.

References operator>().

bool operator> const multimap< Key, Type, Compare, Alloc > &  x,
const multimap< Key, Type, Compare, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 651 of file stl_multimap.h.

References operator>().

bool operator> const map< Key, Type, Compare, Alloc > &  x,
const map< Key, Type, Compare, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 669 of file stl_map.h.

References operator>().

bool operator> const list< Type, Alloc > &  x,
const list< Type, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 1210 of file stl_list.h.

References operator>().

bool operator> const deque< Type, Alloc > &  x,
const deque< Type, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 1490 of file stl_deque.h.

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

References basic_string::compare().

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

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

Referenced by operator>().

bool operator>= const vector< Type, Alloc > &  x,
const vector< Type, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 970 of file stl_vector.h.

References operator>=().

bool operator>= const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Based on operator<.

Definition at line 268 of file stl_stack.h.

bool operator>= const set< Key, Compare, Alloc > &  x,
const set< Key, Compare, Alloc > &  y
[inline]
 

Returns !(x < y).

Definition at line 581 of file stl_set.h.

References operator>=().

bool operator>= const queue< Type, Sequence > &  x,
const queue< Type, Sequence > &  y
[inline]
 

Based on operator<.

Definition at line 295 of file stl_queue.h.

bool 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 operator>= const multiset< Key, Compare, Alloc > &  x,
const multiset< Key, Compare, Alloc > &  y
[inline]
 

Returns !(x < y).

Definition at line 572 of file stl_multiset.h.

References operator>=().

bool operator>= const multimap< Key, Type, Compare, Alloc > &  x,
const multimap< Key, Type, Compare, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 665 of file stl_multimap.h.

References operator>=().

bool operator>= const map< Key, Type, Compare, Alloc > &  x,
const map< Key, Type, Compare, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 683 of file stl_map.h.

References operator>=().

bool operator>= const list< Type, Alloc > &  x,
const list< Type, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 1222 of file stl_list.h.

References operator>=().

bool operator>= const deque< Type, Alloc > &  x,
const deque< Type, Alloc > &  y
[inline]
 

Based on operator<.

Definition at line 1504 of file stl_deque.h.

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

References basic_string::compare().

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

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

Referenced by operator>=().

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

References basic_string::append(), basic_string::erase(), ios_base::iostate, basic_string::max_size(), operator>>(), and streamsize.

Referenced by operator>>().

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

References make_heap(), and sort_heap().

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

References make_heap(), and sort_heap().

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

References make_heap(), and sort_heap().

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

References make_heap(), and sort_heap().

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

OutputIterator 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.

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

void 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.

void 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.

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

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

References iter_swap(), and reverse().

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

References iter_swap(), and reverse().

void 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.

void 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.

Referenced by priority_queue::push().

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

References iter_swap().

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

References iter_swap().

ForwardIterator remove ForwardIterator  first,
ForwardIterator  last,
const Type &  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 1100 of file stl_algo.h.

References find(), and remove_copy().

OutputIterator remove_copy InputIterator  first,
InputIterator  last,
OutputIterator  __result,
const Type &  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 1025 of file stl_algo.h.

Referenced by remove().

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

Referenced by remove_if().

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

References find_if(), and remove_copy_if().

void replace ForwardIterator  first,
ForwardIterator  last,
const Type &  __old_value,
const Type &  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 844 of file stl_algo.h.

OutputIterator replace_copy InputIterator  first,
InputIterator  last,
OutputIterator  __result,
const Type &  __old_value,
const Type &  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 908 of file stl_algo.h.

OutputIterator replace_copy_if InputIterator  first,
InputIterator  last,
OutputIterator  __result,
Predicate  pred,
const Type &  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 942 of file stl_algo.h.

void replace_if ForwardIterator  first,
ForwardIterator  last,
Predicate  pred,
const Type &  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 875 of file stl_algo.h.

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

Referenced by next_permutation(), and prev_permutation().

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

ios_base& right ios_base &  __base  )  [inline]
 

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

Definition at line 874 of file ios_base.h.

References ios_base::setf().

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

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

References copy().

ios_base& scientific ios_base &  __base  )  [inline]
 

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

Definition at line 916 of file ios_base.h.

References ios_base::setf().

ForwardIterator1 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.

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

Referenced by basic_string::find().

ForwardIterator search_n ForwardIterator  first,
ForwardIterator  last,
Integer  count,
const Type &  __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 678 of file stl_algo.h.

ForwardIterator search_n ForwardIterator  first,
ForwardIterator  last,
Integer  count,
const Type &  __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 625 of file stl_algo.h.

References find().

new_handler set_new_handler new_handler   )  throw ()
 

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

terminate_handler set_terminate terminate_handler   )  throw ()
 

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

unexpected_handler set_unexpected unexpected_handler   )  throw ()
 

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

ios_base& showbase ios_base &  __base  )  [inline]
 

Calls base.setf(ios_base::showbase).

Definition at line 761 of file ios_base.h.

References ios_base::setf().

ios_base& showpoint ios_base &  __base  )  [inline]
 

Calls base.setf(ios_base::showpoint).

Definition at line 777 of file ios_base.h.

References ios_base::setf().

ios_base& showpos ios_base &  __base  )  [inline]
 

Calls base.setf(ios_base::showpos).

Definition at line 793 of file ios_base.h.

References ios_base::setf().

ios_base& skipws ios_base &  __base  )  [inline]
 

Calls base.setf(ios_base::skipws).

Definition at line 809 of file ios_base.h.

References ios_base::setf().

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

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

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

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

Referenced by partial_sort(), and partial_sort_copy().

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

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

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

void swap vector< Type, Alloc > &  x,
vector< Type, Alloc > &  y
[inline]
 

See std::vector::swap().

Definition at line 976 of file stl_vector.h.

References vector::swap(), and swap().

void swap set< Key, Compare, Alloc > &  x,
set< Key, Compare, Alloc > &  y
[inline]
 

See std::set::swap().

Definition at line 588 of file stl_set.h.

References set::swap(), and swap().

void swap multiset< Key, Compare, Alloc > &  x,
multiset< Key, Compare, Alloc > &  y
[inline]
 

See std::multiset::swap().

Definition at line 579 of file stl_multiset.h.

References multiset::swap(), and swap().

void swap multimap< Key, Type, Compare, Alloc > &  x,
multimap< Key, Type, Compare, Alloc > &  y
[inline]
 

See std::multimap::swap().

Definition at line 672 of file stl_multimap.h.

References multimap::swap(), and swap().

void swap map< Key, Type, Compare, Alloc > &  x,
map< Key, Type, Compare, Alloc > &  y
[inline]
 

See std::map::swap().

Definition at line 690 of file stl_map.h.

References map::swap(), and swap().

void swap list< Type, Alloc > &  x,
list< Type, Alloc > &  y
[inline]
 

See std::list::swap().

Definition at line 1228 of file stl_list.h.

References list::swap(), and swap().

void swap deque< Type, Alloc > &  x,
deque< Type, Alloc > &  y
[inline]
 

See std::deque::swap().

Definition at line 1511 of file stl_deque.h.

References deque::swap().

void swap Type &  a,
Type &  __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 124 of file stl_algobase.h.

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

Referenced by vector< Block_pair, BPVec_allocator_type >::swap(), set< Key, Compare, Allocator >::swap(), multiset< Key, Compare, Allocator >::swap(), multimap< Key, Type, Compare, Allocator >::swap(), map< Key, Type, Compare, Allocator >::swap(), swap(), list::swap(), and deque::swap().

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

References iter_swap().

void terminate  ) 
 

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

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

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

bool 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)."

void unexpected  ) 
 

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

ForwardIterator 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.

void uninitialized_fill ForwardIterator  first,
ForwardIterator  last,
const Type &  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.

void uninitialized_fill_n ForwardIterator  first,
Size  n,
const Type &  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.

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

References adjacent_find().

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

References adjacent_find().

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

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

ios_base& unitbuf ios_base &  __base  )  [inline]
 

Calls base.setf(ios_base::unitbuf).

Definition at line 841 of file ios_base.h.

References ios_base::setf().

ios_base& uppercase ios_base &  __base  )  [inline]
 

Calls base.setf(ios_base::uppercase).

Definition at line 825 of file ios_base.h.

References ios_base::setf().

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


Generated on Sun Sep 12 15:50:10 2004 for libstdc++ source by doxygen 1.3.8