Classes | |
class | exception |
Base class for all library exceptions. More... | |
class | bad_exception |
class | bad_alloc |
Exception possibly thrown by new . More... | |
class | type_info |
Part of RTTI. More... | |
class | bad_cast |
Thrown during incorrect typecasting. More... | |
class | bad_typeid |
class | allocator |
The "standard" allocator, as per [20.4]. More... | |
class | basic_ios |
Virtual base class for all stream classes. More... | |
class | basic_string |
Managing sequences of characters and character-like objects. More... | |
struct | char_traits |
Basis for explicit traits specializations. More... | |
struct | char_traits< char > |
21.1.3.1 char_traits specializations More... | |
class | gslice |
Class defining multi-dimensional subset of an array. More... | |
class | gslice_array |
Reference to multi-dimensional subset of an array. More... | |
class | indirect_array |
Reference to arbitrary subset of an array. More... | |
class | ios_base |
The very top of the I/O class hierarchy. More... | |
class | locale |
Container class for localization functionality. More... | |
class | ctype_abstract_base |
Common base for ctype facet. More... | |
class | ctype |
Template ctype facet. More... | |
class | ctype< char > |
The ctype<char> specialization. More... | |
class | numpunct |
Numpunct facet. More... | |
class | num_get |
Facet for parsing number strings. More... | |
class | num_put |
Facet for converting numbers to strings. More... | |
class | collate |
Facet for localized string comparison. More... | |
class | time_base |
Time format ordering data. More... | |
class | time_get |
Facet for parsing dates and times. More... | |
class | time_put |
Facet for outputting dates and times. More... | |
class | money_base |
Money format ordering data. More... | |
class | moneypunct |
Facet for formatting data for money amounts. More... | |
class | money_get |
Facet for parsing monetary amounts. More... | |
class | money_put |
Facet for outputting monetary amounts. More... | |
struct | messages_base |
Messages facet base class providing catalog typedef. More... | |
class | messages |
Facet for handling message catalogs. More... | |
class | mask_array |
Reference to selected subset of an array. More... | |
class | fpos |
Class representing stream positions. More... | |
class | slice |
Class defining one-dimensional subset of an array. More... | |
class | slice_array |
Reference to one-dimensional subset of an array. More... | |
class | vector< bool, Alloc > |
A specialization of vector for booleans which offers fixed time access to individual elements in any order. More... | |
struct | Deque_iterator |
A deque::iterator. More... | |
class | deque |
A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end. More... | |
struct | unary_function |
struct | binary_function |
struct | plus |
One of the math functors. More... | |
struct | minus |
One of the math functors. More... | |
struct | multiplies |
One of the math functors. More... | |
struct | divides |
One of the math functors. More... | |
struct | modulus |
One of the math functors. More... | |
struct | negate |
One of the math functors. More... | |
struct | equal_to |
One of the comparison functors. More... | |
struct | not_equal_to |
One of the comparison functors. More... | |
struct | greater |
One of the comparison functors. More... | |
struct | less |
One of the comparison functors. More... | |
struct | greater_equal |
One of the comparison functors. More... | |
struct | less_equal |
One of the comparison functors. More... | |
struct | logical_and |
One of the Boolean operations functors. More... | |
struct | logical_or |
One of the Boolean operations functors. More... | |
struct | logical_not |
One of the Boolean operations functors. More... | |
class | unary_negate |
One of the negation functors. More... | |
class | binary_negate |
One of the negation functors. More... | |
class | binder1st |
One of the binder functors. More... | |
class | binder2nd |
One of the binder functors. More... | |
class | pointer_to_unary_function |
One of the adaptors for function pointers. More... | |
class | pointer_to_binary_function |
One of the adaptors for function pointers. More... | |
class | mem_fun_t |
One of the adaptors for member pointers. More... | |
class | const_mem_fun_t |
One of the adaptors for member pointers. More... | |
class | mem_fun_ref_t |
One of the adaptors for member pointers. More... | |
class | const_mem_fun_ref_t |
One of the adaptors for member pointers. More... | |
class | mem_fun1_t |
One of the adaptors for member pointers. More... | |
class | const_mem_fun1_t |
One of the adaptors for member pointers. More... | |
class | mem_fun1_ref_t |
One of the adaptors for member pointers. More... | |
class | const_mem_fun1_ref_t |
One of the adaptors for member pointers. More... | |
class | mem_fun_t< void, Type > |
One of the adaptors for member pointers. More... | |
class | const_mem_fun_t< void, Type > |
One of the adaptors for member pointers. More... | |
class | mem_fun_ref_t< void, Type > |
One of the adaptors for member pointers. More... | |
class | const_mem_fun_ref_t< void, Type > |
One of the adaptors for member pointers. More... | |
class | mem_fun1_t< void, Type, Arg > |
One of the adaptors for member pointers. More... | |
class | const_mem_fun1_t< void, Type, Arg > |
One of the adaptors for member pointers. More... | |
class | mem_fun1_ref_t< void, Type, Arg > |
One of the adaptors for member pointers. More... | |
class | const_mem_fun1_ref_t< void, Type, Arg > |
One of the adaptors for member pointers. More... | |
class | reverse_iterator |
class | back_insert_iterator |
Turns assignment into insertion. More... | |
class | front_insert_iterator |
Turns assignment into insertion. More... | |
class | insert_iterator |
Turns assignment into insertion. More... | |
struct | input_iterator_tag |
Marking input iterators. More... | |
struct | output_iterator_tag |
Marking output iterators. More... | |
struct | forward_iterator_tag |
Forward iterators support a superset of input iterator operations. More... | |
struct | bidirectional_iterator_tag |
Bidirectional iterators support a superset of forward iterator operations. More... | |
struct | random_access_iterator_tag |
Random-access iterators support a superset of bidirectional iterator operations. More... | |
struct | iterator |
Common iterator class. More... | |
struct | iterator_traits |
struct | List_iterator |
A list::iterator. More... | |
struct | List_const_iterator |
A list::const_iterator. More... | |
class | list |
A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence. More... | |
class | map |
A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. More... | |
class | multimap |
A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. More... | |
class | multiset |
A standard container made up of elements, which can be retrieved in logarithmic time. More... | |
struct | pair |
pair holds two objects of arbitrary type. More... | |
class | queue |
A standard container giving FIFO behavior. More... | |
class | priority_queue |
A standard container automatically sorting its contents. More... | |
class | raw_storage_iterator |
class | set |
A standard container made up of unique keys, which can be retrieved in logarithmic time. More... | |
class | stack |
A standard container giving FILO behavior. More... | |
class | vector |
A standard container which offers fixed time access to individual elements in any order. More... | |
class | istream_iterator |
Provides input iterator semantics for streams. More... | |
class | ostream_iterator |
Provides output iterator semantics for streams. More... | |
class | istreambuf_iterator |
Provides input iterator semantics for streambufs. More... | |
class | ostreambuf_iterator |
Provides output iterator semantics for streambufs. More... | |
class | bitset |
The bitset class represents a fixed-size sequence of bits. More... | |
class | complex |
class | basic_filebuf |
The actual work of input and output (for files). More... | |
class | basic_ifstream |
Controlling input for files. More... | |
class | basic_ofstream |
Controlling output for files. More... | |
class | basic_fstream |
Controlling intput and output for files. More... | |
class | basic_istream |
Controlling input. More... | |
class | basic_iostream |
Merging istream and ostream capabilities. More... | |
struct | numeric_limits_base |
Part of std::numeric_limits. More... | |
struct | numeric_limits |
Properties of fundamental types. More... | |
struct | auto_ptr_ref |
class | auto_ptr |
A simple smart pointer providing strict ownership semantics. More... | |
class | basic_ostream |
Controlling output. More... | |
class | basic_stringbuf |
The actual work of input and output (for std::string). More... | |
class | basic_istringstream |
Controlling input for std::string. More... | |
class | basic_ostringstream |
Controlling output for std::string. More... | |
class | basic_stringstream |
Controlling input and output for std::string. More... | |
class | logic_error |
One of two subclasses of exception. More... | |
class | domain_error |
class | invalid_argument |
class | length_error |
class | out_of_range |
class | runtime_error |
One of two subclasses of exception. More... | |
class | range_error |
class | overflow_error |
class | underflow_error |
class | basic_streambuf |
The actual work of input and output (interface). More... | |
class | valarray |
Smart array designed to support numeric processing. More... | |
Namespaces | |
namespace | rel_ops |
The generated relational operators are sequestered here. | |
Typedefs | |
typedef void(* | terminate_handler )() |
If you write a replacement terminate handler, it must be of this type. | |
typedef void(* | unexpected_handler )() |
If you write a replacement unexpected handler, it must be of this type. | |
typedef void(* | new_handler )() |
typedef long long | streamoff |
Type used by fpos, char_traits<char>, and char_traits<wchar_t>. | |
typedef ptrdiff_t | streamsize |
Integral type for I/O operation counts and buffer sizes. | |
typedef fpos< mbstate_t > | streampos |
File position for char streams. | |
typedef fpos< mbstate_t > | wstreampos |
File position for wchar_t streams. | |
typedef basic_ios< char > | ios |
One of the I/O forward declarations . | |
typedef basic_streambuf< char > | streambuf |
One of the I/O forward declarations . | |
typedef basic_istream< char > | istream |
One of the I/O forward declarations . | |
typedef basic_ostream< char > | ostream |
One of the I/O forward declarations . | |
typedef basic_iostream< char > | iostream |
One of the I/O forward declarations . | |
typedef basic_stringbuf< char > | stringbuf |
One of the I/O forward declarations . | |
typedef basic_istringstream< char > | istringstream |
One of the I/O forward declarations . | |
typedef basic_ostringstream< char > | ostringstream |
One of the I/O forward declarations . | |
typedef basic_stringstream< char > | stringstream |
One of the I/O forward declarations . | |
typedef basic_filebuf< char > | filebuf |
One of the I/O forward declarations . | |
typedef basic_ifstream< char > | ifstream |
One of the I/O forward declarations . | |
typedef basic_ofstream< char > | ofstream |
One of the I/O forward declarations . | |
typedef basic_fstream< char > | fstream |
One of the I/O forward declarations . | |
Enumerations | |
enum | float_round_style { round_indeterminate, round_toward_zero, round_to_nearest, round_toward_infinity, round_toward_neg_infinity } |
Describes the rounding style for floating-point types. More... | |
enum | float_denorm_style { denorm_indeterminate, denorm_absent, denorm_present } |
Describes the denormalization for floating-point types. More... | |
Functions | |
terminate_handler | set_terminate (terminate_handler) throw () |
Takes a new handler function as an argument, returns the old function. | |
void | terminate () attribute__((noreturn__)) |
unexpected_handler | set_unexpected (unexpected_handler) throw () |
Takes a new handler function as an argument, returns the old function. | |
void | unexpected () attribute__((noreturn__)) |
bool | uncaught_exception () throw () |
new_handler | set_new_handler (new_handler) throw () |
Takes a replacement handler as the argument, returns the previous handler. | |
template<typename CharT, typename Traits, typename Alloc> | |
basic_string< CharT, Traits, Alloc > | operator+ (const basic_string< CharT, Traits, Alloc > &__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Concatenate two strings. | |
template<typename CharT, typename Traits, typename Alloc> | |
basic_string< CharT, Traits, Alloc > | operator+ (const CharT *__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Concatenate C string and string. | |
template<typename CharT, typename Traits, typename Alloc> | |
basic_string< CharT, Traits, Alloc > | operator+ (CharT __lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Concatenate character and string. | |
template<typename CharT, typename Traits, typename Alloc> | |
basic_string< CharT, Traits, Alloc > | operator+ (const basic_string< CharT, Traits, Alloc > &__lhs, const CharT *__rhs) |
Concatenate string and C string. | |
template<typename CharT, typename Traits, typename Alloc> | |
basic_string< CharT, Traits, Alloc > | operator+ (const basic_string< CharT, Traits, Alloc > &__lhs, CharT __rhs) |
Concatenate string and character. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator== (const basic_string< CharT, Traits, Alloc > &__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test equivalence of two strings. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator== (const CharT *__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test equivalence of C string and string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator== (const basic_string< CharT, Traits, Alloc > &__lhs, const CharT *__rhs) |
Test equivalence of string and C string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator!= (const basic_string< CharT, Traits, Alloc > &__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test difference of two strings. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator!= (const CharT *__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test difference of C string and string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator!= (const basic_string< CharT, Traits, Alloc > &__lhs, const CharT *__rhs) |
Test difference of string and C string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator< (const basic_string< CharT, Traits, Alloc > &__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test if string precedes string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator< (const basic_string< CharT, Traits, Alloc > &__lhs, const CharT *__rhs) |
Test if string precedes C string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator< (const CharT *__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test if C string precedes string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator> (const basic_string< CharT, Traits, Alloc > &__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test if string follows string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator> (const basic_string< CharT, Traits, Alloc > &__lhs, const CharT *__rhs) |
Test if string follows C string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator> (const CharT *__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test if C string follows string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator<= (const basic_string< CharT, Traits, Alloc > &__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test if string doesn't follow string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator<= (const basic_string< CharT, Traits, Alloc > &__lhs, const CharT *__rhs) |
Test if string doesn't follow C string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator<= (const CharT *__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test if C string doesn't follow string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator>= (const basic_string< CharT, Traits, Alloc > &__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test if string doesn't precede string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator>= (const basic_string< CharT, Traits, Alloc > &__lhs, const CharT *__rhs) |
Test if string doesn't precede C string. | |
template<typename CharT, typename Traits, typename Alloc> | |
bool | operator>= (const CharT *__lhs, const basic_string< CharT, Traits, Alloc > &__rhs) |
Test if C string doesn't precede string. | |
template<typename CharT, typename Traits, typename Alloc> | |
void | swap (basic_string< CharT, Traits, Alloc > &__lhs, basic_string< CharT, Traits, Alloc > &__rhs) |
Swap contents of two strings. | |
template<typename CharT, typename Traits, typename Alloc> | |
basic_istream< CharT, Traits > & | operator>> (basic_istream< CharT, Traits > &__is, basic_string< CharT, Traits, Alloc > &str) |
Read stream into a string. | |
template<typename CharT, typename Traits, typename Alloc> | |
basic_ostream< CharT, Traits > & | operator<< (basic_ostream< CharT, Traits > &__os, const basic_string< CharT, Traits, Alloc > &str) |
Write string to a stream. | |
template<typename CharT, typename Traits, typename Alloc> | |
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. | |
template<typename CharT, typename Traits, typename Alloc> | |
basic_istream< CharT, Traits > & | getline (basic_istream< CharT, Traits > &__is, basic_string< CharT, Traits, Alloc > &str) |
Read a line from stream into a string. | |
ios_base & | boolalpha (ios_base &__base) |
Calls base.setf(ios_base::boolalpha). | |
ios_base & | noboolalpha (ios_base &__base) |
Calls base.unsetf(ios_base::boolalpha). | |
ios_base & | showbase (ios_base &__base) |
Calls base.setf(ios_base::showbase). | |
ios_base & | noshowbase (ios_base &__base) |
Calls base.unsetf(ios_base::showbase). | |
ios_base & | showpoint (ios_base &__base) |
Calls base.setf(ios_base::showpoint). | |
ios_base & | noshowpoint (ios_base &__base) |
Calls base.unsetf(ios_base::showpoint). | |
ios_base & | showpos (ios_base &__base) |
Calls base.setf(ios_base::showpos). | |
ios_base & | noshowpos (ios_base &__base) |
Calls base.unsetf(ios_base::showpos). | |
ios_base & | skipws (ios_base &__base) |
Calls base.setf(ios_base::skipws). | |
ios_base & | noskipws (ios_base &__base) |
Calls base.unsetf(ios_base::skipws). | |
ios_base & | uppercase (ios_base &__base) |
Calls base.setf(ios_base::uppercase). | |
ios_base & | nouppercase (ios_base &__base) |
Calls base.unsetf(ios_base::uppercase). | |
ios_base & | unitbuf (ios_base &__base) |
Calls base.setf(ios_base::unitbuf). | |
ios_base & | nounitbuf (ios_base &__base) |
Calls base.unsetf(ios_base::unitbuf). | |
ios_base & | internal (ios_base &__base) |
Calls base.setf(ios_base::internal, ios_base::adjustfield). | |
ios_base & | left (ios_base &__base) |
Calls base.setf(ios_base::left, ios_base::adjustfield). | |
ios_base & | right (ios_base &__base) |
Calls base.setf(ios_base::right, ios_base::adjustfield). | |
ios_base & | dec (ios_base &__base) |
Calls base.setf(ios_base::dec, ios_base::basefield). | |
ios_base & | hex (ios_base &__base) |
Calls base.setf(ios_base::hex, ios_base::basefield). | |
ios_base & | oct (ios_base &__base) |
Calls base.setf(ios_base::oct, ios_base::basefield). | |
ios_base & | fixed (ios_base &__base) |
Calls base.setf(ios_base::fixed, ios_base::floatfield). | |
ios_base & | scientific (ios_base &__base) |
Calls base.setf(ios_base::scientific, ios_base::floatfield). | |
template<typename CharT, typename Traits> | |
basic_istream< CharT, Traits > & | ws (basic_istream< CharT, Traits > &__is) |
Quick and easy way to eat whitespace. | |
template<typename Facet> | |
bool | has_facet (const locale &__loc) throw () |
Test for the presence of a facet. | |
template<typename Facet> | |
const Facet & | use_facet (const locale &__loc) |
Return a facet. | |
template<typename Type> | |
const Type & | __median (const Type &a, const Type &__b, const Type &c) |
Find the median of three values. | |
template<typename Type, typename Compare> | |
const Type & | __median (const Type &a, const Type &__b, const Type &c, Compare comp) |
Find the median of three values using a predicate for comparison. | |
template<typename InputIterator, typename Function> | |
Function | for_each (InputIterator first, InputIterator last, Function __f) |
Apply a function to every element of a sequence. | |
template<typename InputIterator, typename Type> | |
InputIterator | find (InputIterator first, InputIterator last, const Type &__val) |
Find the first occurrence of a value in a sequence. | |
template<typename InputIterator, typename Predicate> | |
InputIterator | find_if (InputIterator first, InputIterator last, Predicate pred) |
Find the first element in a sequence for which a predicate is true. | |
template<typename ForwardIterator> | |
ForwardIterator | adjacent_find (ForwardIterator first, ForwardIterator last) |
Find two adjacent values in a sequence that are equal. | |
template<typename ForwardIterator, typename BinaryPredicate> | |
ForwardIterator | adjacent_find (ForwardIterator first, ForwardIterator last, BinaryPredicate __binary_pred) |
Find two adjacent values in a sequence using a predicate. | |
template<typename InputIterator, typename Type> | |
iterator_traits< InputIterator > ::difference_type | count (InputIterator first, InputIterator last, const Type &value) |
Count the number of copies of a value in a sequence. | |
template<typename InputIterator, typename Predicate> | |
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. | |
template<typename ForwardIterator1, typename ForwardIterator2> | |
ForwardIterator1 | search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2) |
Search a sequence for a matching sub-sequence. | |
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate> | |
ForwardIterator1 | search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate predicate) |
Search a sequence for a matching sub-sequence using a predicate. | |
template<typename ForwardIterator, typename Integer, typename Type> | |
ForwardIterator | search_n (ForwardIterator first, ForwardIterator last, Integer count, const Type &__val) |
Search a sequence for a number of consecutive values. | |
template<typename ForwardIterator, typename Integer, typename Type, typename BinaryPredicate> | |
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. | |
template<typename ForwardIterator1, typename ForwardIterator2> | |
ForwardIterator2 | swap_ranges (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2) |
Swap the elements of two sequences. | |
template<typename InputIterator, typename OutputIterator, typename UnaryOperation> | |
OutputIterator | transform (InputIterator first, InputIterator last, OutputIterator __result, UnaryOperation __unary_op) |
Perform an operation on a sequence. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename BinaryOperation> | |
OutputIterator | transform (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator __result, BinaryOperation __binary_op) |
Perform an operation on corresponding elements of two sequences. | |
template<typename ForwardIterator, typename Type> | |
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. | |
template<typename ForwardIterator, typename Predicate, typename Type> | |
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. | |
template<typename InputIterator, typename OutputIterator, typename Type> | |
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. | |
template<typename InputIterator, typename OutputIterator, typename Predicate, typename Type> | |
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. | |
template<typename ForwardIterator, typename Generator> | |
void | generate (ForwardIterator first, ForwardIterator last, Generator __gen) |
Assign the result of a function object to each value in a sequence. | |
template<typename OutputIterator, typename Size, typename Generator> | |
OutputIterator | generate_n (OutputIterator first, Size n, Generator __gen) |
Assign the result of a function object to each value in a sequence. | |
template<typename InputIterator, typename OutputIterator, typename Type> | |
OutputIterator | remove_copy (InputIterator first, InputIterator last, OutputIterator __result, const Type &value) |
Copy a sequence, removing elements of a given value. | |
template<typename InputIterator, typename OutputIterator, typename Predicate> | |
OutputIterator | remove_copy_if (InputIterator first, InputIterator last, OutputIterator __result, Predicate pred) |
Copy a sequence, removing elements for which a predicate is true. | |
template<typename ForwardIterator, typename Type> | |
ForwardIterator | remove (ForwardIterator first, ForwardIterator last, const Type &value) |
Remove elements from a sequence. | |
template<typename ForwardIterator, typename Predicate> | |
ForwardIterator | remove_if (ForwardIterator first, ForwardIterator last, Predicate pred) |
Remove elements from a sequence using a predicate. | |
template<typename InputIterator, typename OutputIterator> | |
OutputIterator | unique_copy (InputIterator first, InputIterator last, OutputIterator __result) |
Copy a sequence, removing consecutive duplicate values. | |
template<typename InputIterator, typename OutputIterator, typename BinaryPredicate> | |
OutputIterator | unique_copy (InputIterator first, InputIterator last, OutputIterator __result, BinaryPredicate __binary_pred) |
Copy a sequence, removing consecutive values using a predicate. | |
template<typename ForwardIterator> | |
ForwardIterator | unique (ForwardIterator first, ForwardIterator last) |
Remove consecutive duplicate values from a sequence. | |
template<typename ForwardIterator, typename BinaryPredicate> | |
ForwardIterator | unique (ForwardIterator first, ForwardIterator last, BinaryPredicate __binary_pred) |
Remove consecutive values from a sequence using a predicate. | |
template<typename BidirectionalIterator> | |
void | reverse (BidirectionalIterator first, BidirectionalIterator last) |
Reverse a sequence. | |
template<typename BidirectionalIterator, typename OutputIterator> | |
OutputIterator | reverse_copy (BidirectionalIterator first, BidirectionalIterator last, OutputIterator __result) |
Copy a sequence, reversing its elements. | |
template<typename ForwardIterator> | |
void | rotate (ForwardIterator first, ForwardIterator __middle, ForwardIterator last) |
Rotate the elements of a sequence. | |
template<typename ForwardIterator, typename OutputIterator> | |
OutputIterator | rotate_copy (ForwardIterator first, ForwardIterator __middle, ForwardIterator last, OutputIterator __result) |
Copy a sequence, rotating its elements. | |
template<typename RandomAccessIterator> | |
void | random_shuffle (RandomAccessIterator first, RandomAccessIterator last) |
Randomly shuffle the elements of a sequence. | |
template<typename RandomAccessIterator, typename RandomNumberGenerator> | |
void | random_shuffle (RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator &__rand) |
Shuffle the elements of a sequence using a random number generator. | |
template<typename ForwardIterator, typename Predicate> | |
ForwardIterator | partition (ForwardIterator first, ForwardIterator last, Predicate pred) |
Move elements for which a predicate is true to the beginning of a sequence. | |
template<typename ForwardIterator, typename Predicate> | |
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. | |
template<typename RandomAccessIterator> | |
void | partial_sort (RandomAccessIterator first, RandomAccessIterator __middle, RandomAccessIterator last) |
Sort the smallest elements of a sequence. | |
template<typename RandomAccessIterator, typename Compare> | |
void | partial_sort (RandomAccessIterator first, RandomAccessIterator __middle, RandomAccessIterator last, Compare comp) |
Sort the smallest elements of a sequence using a predicate for comparison. | |
template<typename InputIterator, typename RandomAccessIterator> | |
RandomAccessIterator | partial_sort_copy (InputIterator first, InputIterator last, RandomAccessIterator __result_first, RandomAccessIterator __result_last) |
Copy the smallest elements of a sequence. | |
template<typename InputIterator, typename RandomAccessIterator, typename Compare> | |
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. | |
template<typename RandomAccessIterator> | |
void | sort (RandomAccessIterator first, RandomAccessIterator last) |
Sort the elements of a sequence. | |
template<typename RandomAccessIterator, typename Compare> | |
void | sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Sort the elements of a sequence using a predicate for comparison. | |
template<typename ForwardIterator, typename Type> | |
ForwardIterator | lower_bound (ForwardIterator first, ForwardIterator last, const Type &__val) |
Finds the first position in which val could be inserted without changing the ordering. | |
template<typename ForwardIterator, typename Type, typename Compare> | |
ForwardIterator | lower_bound (ForwardIterator first, ForwardIterator last, const Type &__val, Compare comp) |
Finds the first position in which val could be inserted without changing the ordering. | |
template<typename ForwardIterator, typename Type> | |
ForwardIterator | upper_bound (ForwardIterator first, ForwardIterator last, const Type &__val) |
Finds the last position in which val could be inserted without changing the ordering. | |
template<typename ForwardIterator, typename Type, typename Compare> | |
ForwardIterator | upper_bound (ForwardIterator first, ForwardIterator last, const Type &__val, Compare comp) |
Finds the last position in which val could be inserted without changing the ordering. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | merge (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Merges two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | merge (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Merges two sorted ranges. | |
template<typename BidirectionalIterator> | |
void | inplace_merge (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last) |
Merges two sorted ranges in place. | |
template<typename BidirectionalIterator, typename Compare> | |
void | inplace_merge (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Compare comp) |
Merges two sorted ranges in place. | |
template<typename RandomAccessIterator> | |
void | stable_sort (RandomAccessIterator first, RandomAccessIterator last) |
Sort the elements of a sequence, preserving the relative order of equivalent elements. | |
template<typename RandomAccessIterator, typename Compare> | |
void | stable_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Sort the elements of a sequence using a predicate for comparison, preserving the relative order of equivalent elements. | |
template<typename RandomAccessIterator> | |
void | nth_element (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last) |
Sort a sequence just enough to find a particular position. | |
template<typename RandomAccessIterator, typename Compare> | |
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. | |
template<typename ForwardIterator, typename Type> | |
pair< ForwardIterator, ForwardIterator > | equal_range (ForwardIterator first, ForwardIterator last, const Type &__val) |
Finds the largest subrange in which val could be inserted at any place in it without changing the ordering. | |
template<typename ForwardIterator, typename Type, typename Compare> | |
pair< ForwardIterator, ForwardIterator > | equal_range (ForwardIterator first, ForwardIterator last, const Type &__val, Compare comp) |
Finds the largest subrange in which val could be inserted at any place in it without changing the ordering. | |
template<typename ForwardIterator, typename Type> | |
bool | binary_search (ForwardIterator first, ForwardIterator last, const Type &__val) |
Determines whether an element exists in a range. | |
template<typename ForwardIterator, typename Type, typename Compare> | |
bool | binary_search (ForwardIterator first, ForwardIterator last, const Type &__val, Compare comp) |
Determines whether an element exists in a range. | |
template<typename InputIterator1, typename InputIterator2> | |
bool | includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2) |
Determines whether all elements of a sequence exists in a range. | |
template<typename InputIterator1, typename InputIterator2, typename Compare> | |
bool | includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp) |
Determines whether all elements of a sequence exists in a range using comparison. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the union of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the union of two sorted ranges using a comparison functor. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the intersection of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the intersection of two sorted ranges using comparison functor. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the difference of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the difference of two sorted ranges using comparison functor. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the symmetric difference of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the symmetric difference of two sorted ranges using comparison functor. | |
template<typename ForwardIterator> | |
ForwardIterator | max_element (ForwardIterator first, ForwardIterator last) |
Return the maximum element in a range. | |
template<typename ForwardIterator, typename Compare> | |
ForwardIterator | max_element (ForwardIterator first, ForwardIterator last, Compare comp) |
Return the maximum element in a range using comparison functor. | |
template<typename ForwardIterator> | |
ForwardIterator | min_element (ForwardIterator first, ForwardIterator last) |
Return the minimum element in a range. | |
template<typename ForwardIterator, typename Compare> | |
ForwardIterator | min_element (ForwardIterator first, ForwardIterator last, Compare comp) |
Return the minimum element in a range using comparison functor. | |
template<typename BidirectionalIterator> | |
bool | next_permutation (BidirectionalIterator first, BidirectionalIterator last) |
Permute range into the next "dictionary" ordering. | |
template<typename BidirectionalIterator, typename Compare> | |
bool | next_permutation (BidirectionalIterator first, BidirectionalIterator last, Compare comp) |
Permute range into the next "dictionary" ordering using comparison functor. | |
template<typename BidirectionalIterator> | |
bool | prev_permutation (BidirectionalIterator first, BidirectionalIterator last) |
Permute range into the previous "dictionary" ordering. | |
template<typename BidirectionalIterator, typename Compare> | |
bool | prev_permutation (BidirectionalIterator first, BidirectionalIterator last, Compare comp) |
Permute range into the previous "dictionary" ordering using comparison functor. | |
template<typename InputIterator, typename ForwardIterator> | |
InputIterator | find_first_of (InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2) |
Find element from a set in a sequence. | |
template<typename InputIterator, typename ForwardIterator, typename BinaryPredicate> | |
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. | |
template<typename ForwardIterator1, typename ForwardIterator2> | |
ForwardIterator1 | find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2) |
Find last matching subsequence in a sequence. | |
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate> | |
ForwardIterator1 | find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate comp) |
Find last matching subsequence in a sequence using a predicate. | |
template<typename ForwardIterator1, typename ForwardIterator2> | |
void | iter_swap (ForwardIterator1 a, ForwardIterator2 __b) |
Swaps the contents of two iterators. | |
template<typename Type> | |
void | swap (Type &a, Type &__b) |
Swaps two values. | |
template<typename Type> | |
const Type & | min (const Type &a, const Type &__b) |
This does what you think it does. | |
template<typename Type> | |
const Type & | max (const Type &a, const Type &__b) |
This does what you think it does. | |
template<typename Type, typename Compare> | |
const Type & | min (const Type &a, const Type &__b, Compare comp) |
This does what you think it does. | |
template<typename Type, typename Compare> | |
const Type & | max (const Type &a, const Type &__b, Compare comp) |
This does what you think it does. | |
template<typename InputIterator, typename OutputIterator> | |
OutputIterator | copy (InputIterator first, InputIterator last, OutputIterator __result) |
Copies the range [first,last) into result. | |
template<typename BI1, typename BI2> | |
BI2 | copy_backward (BI1 first, BI1 last, BI2 __result) |
Copies the range [first,last) into result. | |
template<typename ForwardIterator, typename Type> | |
void | fill (ForwardIterator first, ForwardIterator last, const Type &value) |
Fills the range [first,last) with copies of value. | |
template<typename OutputIterator, typename Size, typename Type> | |
OutputIterator | fill_n (OutputIterator first, Size n, const Type &value) |
Fills the range [first,first+n) with copies of value. | |
template<typename InputIterator1, typename InputIterator2> | |
pair< InputIterator1, InputIterator2 > | mismatch (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2) |
Finds the places in ranges which don't match. | |
template<typename InputIterator1, typename InputIterator2, typename BinaryPredicate> | |
pair< InputIterator1, InputIterator2 > | mismatch (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate __binary_pred) |
Finds the places in ranges which don't match. | |
template<typename InputIterator1, typename InputIterator2> | |
bool | equal (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2) |
Tests a range for element-wise equality. | |
template<typename InputIterator1, typename InputIterator2, typename BinaryPredicate> | |
bool | equal (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate __binary_pred) |
Tests a range for element-wise equality. | |
template<typename InputIterator1, typename InputIterator2> | |
bool | lexicographical_compare (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2) |
Performs "dictionary" comparison on ranges. | |
template<typename InputIterator1, typename InputIterator2, typename Compare> | |
bool | lexicographical_compare (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp) |
Performs "dictionary" comparison on ranges. | |
template<typename Type, typename Alloc> | |
bool | operator== (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Deque equality comparison. | |
template<typename Type, typename Alloc> | |
bool | operator< (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Deque ordering relation. | |
template<typename Type, typename Alloc> | |
bool | operator!= (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Based on operator==. | |
template<typename Type, typename Alloc> | |
bool | operator> (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | operator<= (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | operator>= (const deque< Type, Alloc > &x, const deque< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
void | swap (deque< Type, Alloc > &x, deque< Type, Alloc > &y) |
See std::deque::swap(). | |
template<class Predicate> | |
unary_negate< Predicate > | not1 (const Predicate &pred) |
One of the negation functors. | |
template<class Predicate> | |
binary_negate< Predicate > | not2 (const Predicate &pred) |
One of the negation functors. | |
template<class Operation, class Type> | |
binder1st< Operation > | bind1st (const Operation &__fn, const Type &x) |
One of the binder functors. | |
template<class Operation, class Type> | |
binder2nd< Operation > | bind2nd (const Operation &__fn, const Type &x) |
One of the binder functors. | |
template<class Arg, class Result> | |
pointer_to_unary_function< Arg, Result > | ptr_fun (Result(*x)(Arg)) |
One of the adaptors for function pointers. | |
template<class Arg1, class Arg2, class Result> | |
pointer_to_binary_function < Arg1, Arg2, Result > | ptr_fun (Result(*x)(Arg1, Arg2)) |
One of the adaptors for function pointers. | |
template<typename RandomAccessIterator> | |
void | push_heap (RandomAccessIterator first, RandomAccessIterator last) |
Push an element onto a heap. | |
template<typename RandomAccessIterator, typename Compare> | |
void | push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Push an element onto a heap using comparison functor. | |
template<typename RandomAccessIterator> | |
void | pop_heap (RandomAccessIterator first, RandomAccessIterator last) |
Pop an element off a heap. | |
template<typename RandomAccessIterator, typename Compare> | |
void | pop_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Pop an element off a heap using comparison functor. | |
template<typename RandomAccessIterator> | |
void | make_heap (RandomAccessIterator first, RandomAccessIterator last) |
Construct a heap over a range. | |
template<typename RandomAccessIterator, typename Compare> | |
void | make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Construct a heap over a range using comparison functor. | |
template<typename RandomAccessIterator> | |
void | sort_heap (RandomAccessIterator first, RandomAccessIterator last) |
Sort a heap. | |
template<typename RandomAccessIterator, typename Compare> | |
void | sort_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Sort a heap using comparison functor. | |
template<typename Container> | |
back_insert_iterator< Container > | back_inserter (Container &x) |
template<typename Container> | |
front_insert_iterator< Container > | front_inserter (Container &x) |
template<typename Container, typename Iterator> | |
insert_iterator< Container > | inserter (Container &x, Iterator __i) |
template<typename InputIterator> | |
iterator_traits< InputIterator > ::difference_type | distance (InputIterator first, InputIterator last) |
A generalization of pointer arithmetic. | |
template<typename InputIterator, typename Distance> | |
void | advance (InputIterator &__i, Distance n) |
A generalization of pointer arithmetic. | |
template<typename Type, typename Alloc> | |
bool | operator== (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
List equality comparison. | |
template<typename Type, typename Alloc> | |
bool | operator< (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
List ordering relation. | |
template<typename Type, typename Alloc> | |
bool | operator!= (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
Based on operator==. | |
template<typename Type, typename Alloc> | |
bool | operator> (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | operator<= (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | operator>= (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
void | swap (list< Type, Alloc > &x, list< Type, Alloc > &y) |
See std::list::swap(). | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator== (const map< Key, Type, Compare, Alloc > &x, const map< Key, Type, Compare, Alloc > &y) |
Map equality comparison. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator< (const map< Key, Type, Compare, Alloc > &x, const map< Key, Type, Compare, Alloc > &y) |
Map ordering relation. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator!= (const map< Key, Type, Compare, Alloc > &x, const map< Key, Type, Compare, Alloc > &y) |
Based on operator==. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator> (const map< Key, Type, Compare, Alloc > &x, const map< Key, Type, Compare, Alloc > &y) |
Based on operator<. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator<= (const map< Key, Type, Compare, Alloc > &x, const map< Key, Type, Compare, Alloc > &y) |
Based on operator<. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator>= (const map< Key, Type, Compare, Alloc > &x, const map< Key, Type, Compare, Alloc > &y) |
Based on operator<. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
void | swap (map< Key, Type, Compare, Alloc > &x, map< Key, Type, Compare, Alloc > &y) |
See std::map::swap(). | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator== (const multimap< Key, Type, Compare, Alloc > &x, const multimap< Key, Type, Compare, Alloc > &y) |
Multimap equality comparison. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator< (const multimap< Key, Type, Compare, Alloc > &x, const multimap< Key, Type, Compare, Alloc > &y) |
Multimap ordering relation. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator!= (const multimap< Key, Type, Compare, Alloc > &x, const multimap< Key, Type, Compare, Alloc > &y) |
Based on operator==. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator> (const multimap< Key, Type, Compare, Alloc > &x, const multimap< Key, Type, Compare, Alloc > &y) |
Based on operator<. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator<= (const multimap< Key, Type, Compare, Alloc > &x, const multimap< Key, Type, Compare, Alloc > &y) |
Based on operator<. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
bool | operator>= (const multimap< Key, Type, Compare, Alloc > &x, const multimap< Key, Type, Compare, Alloc > &y) |
Based on operator<. | |
template<typename Key, typename Type, typename Compare, typename Alloc> | |
void | swap (multimap< Key, Type, Compare, Alloc > &x, multimap< Key, Type, Compare, Alloc > &y) |
See std::multimap::swap(). | |
template<class Key, class Compare, class Alloc> | |
bool | operator== (const multiset< Key, Compare, Alloc > &x, const multiset< Key, Compare, Alloc > &y) |
Multiset equality comparison. | |
template<class Key, class Compare, class Alloc> | |
bool | operator< (const multiset< Key, Compare, Alloc > &x, const multiset< Key, Compare, Alloc > &y) |
Multiset ordering relation. | |
template<class Key, class Compare, class Alloc> | |
bool | operator!= (const multiset< Key, Compare, Alloc > &x, const multiset< Key, Compare, Alloc > &y) |
Returns !(x == y). | |
template<class Key, class Compare, class Alloc> | |
bool | operator> (const multiset< Key, Compare, Alloc > &x, const multiset< Key, Compare, Alloc > &y) |
Returns y < x. | |
template<class Key, class Compare, class Alloc> | |
bool | operator<= (const multiset< Key, Compare, Alloc > &x, const multiset< Key, Compare, Alloc > &y) |
Returns !(y < x). | |
template<class Key, class Compare, class Alloc> | |
bool | operator>= (const multiset< Key, Compare, Alloc > &x, const multiset< Key, Compare, Alloc > &y) |
Returns !(x < y). | |
template<class Key, class Compare, class Alloc> | |
void | swap (multiset< Key, Compare, Alloc > &x, multiset< Key, Compare, Alloc > &y) |
See std::multiset::swap(). | |
template<typename InputIterator, typename Type> | |
Type | accumulate (InputIterator first, InputIterator last, Type init) |
Accumulate values in a range. | |
template<typename InputIterator, typename Type, typename BinaryOperation> | |
Type | accumulate (InputIterator first, InputIterator last, Type init, BinaryOperation __binary_op) |
Accumulate values in a range with operation. | |
template<typename InputIterator1, typename InputIterator2, typename Type> | |
Type | inner_product (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Type init) |
Compute inner product of two ranges. | |
template<typename InputIterator1, typename InputIterator2, typename Type, typename BinaryOperation1, typename BinaryOperation2> | |
Type | inner_product (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Type init, BinaryOperation1 __binary_op1, BinaryOperation2 __binary_op2) |
Compute inner product of two ranges. | |
template<typename InputIterator, typename OutputIterator> | |
OutputIterator | partial_sum (InputIterator first, InputIterator last, OutputIterator __result) |
Return list of partial sums. | |
template<typename InputIterator, typename OutputIterator, typename BinaryOperation> | |
OutputIterator | partial_sum (InputIterator first, InputIterator last, OutputIterator __result, BinaryOperation __binary_op) |
Return list of partial sums. | |
template<typename InputIterator, typename OutputIterator> | |
OutputIterator | adjacent_difference (InputIterator first, InputIterator last, OutputIterator __result) |
Return differences between adjacent values. | |
template<typename InputIterator, typename OutputIterator, typename BinaryOperation> | |
OutputIterator | adjacent_difference (InputIterator first, InputIterator last, OutputIterator __result, BinaryOperation __binary_op) |
Return differences between adjacent values. | |
template<class T1, class T2> | |
bool | operator== (const pair< T1, T2 > &x, const pair< T1, T2 > &y) |
Two pairs of the same type are equal iff their members are equal. | |
template<class T1, class T2> | |
bool | operator< (const pair< T1, T2 > &x, const pair< T1, T2 > &y) |
<http://gcc.gnu.org/onlinedocs/libstdc++/20_util/howto.html#pairlt> | |
template<class T1, class T2> | |
bool | operator!= (const pair< T1, T2 > &x, const pair< T1, T2 > &y) |
Uses operator== to find the result. | |
template<class T1, class T2> | |
bool | operator> (const pair< T1, T2 > &x, const pair< T1, T2 > &y) |
Uses operator< to find the result. | |
template<class T1, class T2> | |
bool | operator<= (const pair< T1, T2 > &x, const pair< T1, T2 > &y) |
Uses operator< to find the result. | |
template<class T1, class T2> | |
bool | operator>= (const pair< T1, T2 > &x, const pair< T1, T2 > &y) |
Uses operator< to find the result. | |
template<class T1, class T2> | |
pair< T1, T2 > | make_pair (T1 x, T2 y) |
A convenience wrapper for creating a pair from two objects. | |
template<typename Type, typename Sequence> | |
bool | operator== (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y) |
Queue equality comparison. | |
template<typename Type, typename Sequence> | |
bool | operator< (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y) |
Queue ordering relation. | |
template<typename Type, typename Sequence> | |
bool | operator!= (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y) |
Based on operator==. | |
template<typename Type, typename Sequence> | |
bool | operator> (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y) |
Based on operator<. | |
template<typename Type, typename Sequence> | |
bool | operator<= (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y) |
Based on operator<. | |
template<typename Type, typename Sequence> | |
bool | operator>= (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y) |
Based on operator<. | |
template<class Key, class Compare, class Alloc> | |
bool | operator== (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y) |
Set equality comparison. | |
template<class Key, class Compare, class Alloc> | |
bool | operator< (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y) |
Set ordering relation. | |
template<class Key, class Compare, class Alloc> | |
bool | operator!= (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y) |
Returns !(x == y). | |
template<class Key, class Compare, class Alloc> | |
bool | operator> (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y) |
Returns y < x. | |
template<class Key, class Compare, class Alloc> | |
bool | operator<= (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y) |
Returns !(y < x). | |
template<class Key, class Compare, class Alloc> | |
bool | operator>= (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y) |
Returns !(x < y). | |
template<class Key, class Compare, class Alloc> | |
void | swap (set< Key, Compare, Alloc > &x, set< Key, Compare, Alloc > &y) |
See std::set::swap(). | |
template<typename Type, typename Seq> | |
bool | operator== (const stack< Type, Seq > &x, const stack< Type, Seq > &y) |
Stack equality comparison. | |
template<typename Type, typename Seq> | |
bool | operator< (const stack< Type, Seq > &x, const stack< Type, Seq > &y) |
Stack ordering relation. | |
template<typename Type, typename Seq> | |
bool | operator!= (const stack< Type, Seq > &x, const stack< Type, Seq > &y) |
Based on operator==. | |
template<typename Type, typename Seq> | |
bool | operator> (const stack< Type, Seq > &x, const stack< Type, Seq > &y) |
Based on operator<. | |
template<typename Type, typename Seq> | |
bool | operator<= (const stack< Type, Seq > &x, const stack< Type, Seq > &y) |
Based on operator<. | |
template<typename Type, typename Seq> | |
bool | operator>= (const stack< Type, Seq > &x, const stack< Type, Seq > &y) |
Based on operator<. | |
template<typename InputIterator, typename ForwardIterator> | |
ForwardIterator | uninitialized_copy (InputIterator first, InputIterator last, ForwardIterator __result) |
Copies the range [first,last) into result. | |
template<typename ForwardIterator, typename Type> | |
void | uninitialized_fill (ForwardIterator first, ForwardIterator last, const Type &x) |
Copies the value x into the range [first,last). | |
template<typename ForwardIterator, typename Size, typename Type> | |
ForwardIterator | uninitialized_fill_n (ForwardIterator first, Size n, const Type &x) |
Copies the value x into the range [first,first+n). | |
template<typename Type, typename Alloc> | |
bool | operator== (const vector< Type, Alloc > &x, const vector< Type, Alloc > &y) |
Vector equality comparison. | |
template<typename Type, typename Alloc> | |
bool | operator< (const vector< Type, Alloc > &x, const vector< Type, Alloc > &y) |
Vector ordering relation. | |
template<typename Type, typename Alloc> | |
bool | operator!= (const vector< Type, Alloc > &x, const vector< Type, Alloc > &y) |
Based on operator==. | |
template<typename Type, typename Alloc> | |
bool | operator> (const vector< Type, Alloc > &x, const vector< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | operator<= (const vector< Type, Alloc > &x, const vector< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | operator>= (const vector< Type, Alloc > &x, const vector< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
void | swap (vector< Type, Alloc > &x, vector< Type, Alloc > &y) |
See std::vector::swap(). | |
template<typename Type, typename CharT, typename Traits, typename Dist> | |
bool | operator== (const istream_iterator< Type, CharT, Traits, Dist > &x, const istream_iterator< Type, CharT, Traits, Dist > &y) |
Return true if x and y are both end or not end, or x and y are the same. | |
template<class Type, class CharT, class Traits, class Dist> | |
bool | operator!= (const istream_iterator< Type, CharT, Traits, Dist > &x, const istream_iterator< Type, CharT, Traits, Dist > &y) |
Return false if x and y are both end or not end, or x and y are the same. | |
template<typename Type> | |
Type | abs (const complex< Type > &) |
Return magnitude of z. | |
template<typename Type> | |
Type | arg (const complex< Type > &) |
Return phase angle of z. | |
template<typename Type> | |
Type | norm (const complex< Type > &) |
Return z magnitude squared. | |
template<typename Type> | |
complex< Type > | conj (const complex< Type > &) |
Return complex conjugate of z. | |
template<typename Type> | |
complex< Type > | polar (const Type &, const Type &=0) |
Return complex with magnitude rho and angle theta. | |
template<typename Type> | |
complex< Type > | cos (const complex< Type > &) |
Return complex cosine of z. | |
template<typename Type> | |
complex< Type > | cosh (const complex< Type > &) |
Return complex hyperbolic cosine of z. | |
template<typename Type> | |
complex< Type > | exp (const complex< Type > &) |
Return complex base e exponential of z. | |
template<typename Type> | |
complex< Type > | log (const complex< Type > &) |
Return complex natural logarithm of z. | |
template<typename Type> | |
complex< Type > | log10 (const complex< Type > &) |
Return complex base 10 logarithm of z. | |
template<typename Type> | |
complex< Type > | pow (const complex< Type > &, int) |
Return complex cosine of z. | |
template<typename Type> | |
complex< Type > | pow (const complex< Type > &, const Type &) |
Return x to the y'th power. | |
template<typename Type> | |
complex< Type > | pow (const complex< Type > &, const complex< Type > &) |
Return x to the y'th power. | |
template<typename Type> | |
complex< Type > | pow (const Type &, const complex< Type > &) |
Return x to the y'th power. | |
template<typename Type> | |
complex< Type > | sin (const complex< Type > &) |
Return complex sine of z. | |
template<typename Type> | |
complex< Type > | sinh (const complex< Type > &) |
Return complex hyperbolic sine of z. | |
template<typename Type> | |
complex< Type > | sqrt (const complex< Type > &) |
Return complex square root of z. | |
template<typename Type> | |
complex< Type > | tan (const complex< Type > &) |
Return complex tangent of z. | |
template<typename Type> | |
complex< Type > | tanh (const complex< Type > &) |
Return complex hyperbolic tangent of z. | |
template<typename Type> | |
complex< Type > | operator+ (const complex< Type > &x) |
Return x. | |
template<typename Type> | |
complex< Type > | operator- (const complex< Type > &x) |
Return complex negation of x. | |
template<typename Type, typename CharT, class Traits> | |
basic_istream< CharT, Traits > & | operator>> (basic_istream< CharT, Traits > &__is, complex< Type > &x) |
Extraction operator for complex values. | |
template<typename Type, typename CharT, class Traits> | |
basic_ostream< CharT, Traits > & | operator<< (basic_ostream< CharT, Traits > &__os, const complex< Type > &x) |
Insertion operator for complex values. | |
Resetiosflags | resetiosflags (ios_base::fmtflags __mask) |
Manipulator for setf . | |
Setiosflags | setiosflags (ios_base::fmtflags __mask) |
Manipulator for setf . | |
Setbase | setbase (int __base) |
Manipulator for setf . | |
template<typename CharT> | |
Setfill< CharT > | setfill (CharT c) |
Manipulator for fill . | |
Setprecision | setprecision (int n) |
Manipulator for precision . | |
Setw | setw (int n) |
Manipulator for width . | |
template<typename Type> | |
pair< Type *, ptrdiff_t > | get_temporary_buffer (ptrdiff_t __len) |
Allocates a temporary buffer. | |
template<typename Type> | |
void | return_temporary_buffer (Type *__p) |
The companion to get_temporary_buffer(). | |
template<typename CharT, typename Traits> | |
basic_ostream< CharT, Traits > & | endl (basic_ostream< CharT, Traits > &__os) |
Write a newline and flush the stream. | |
template<typename CharT, typename Traits> | |
basic_ostream< CharT, Traits > & | ends (basic_ostream< CharT, Traits > &__os) |
Write a null character into the output sequence. | |
template<typename CharT, typename Traits> | |
basic_ostream< CharT, Traits > & | flush (basic_ostream< CharT, Traits > &__os) |
Flushes the output stream. | |
template<typename CharT, typename Traits> | |
basic_istream< CharT, Traits > & | operator>> (basic_istream< CharT, Traits > &in, CharT &c) |
Character extractors. | |
template<class Traits> | |
basic_istream< char, Traits > & | operator>> (basic_istream< char, Traits > &in, unsigned char &c) |
Character extractors. | |
template<class Traits> | |
basic_istream< char, Traits > & | operator>> (basic_istream< char, Traits > &in, signed char &c) |
Character extractors. | |
template<typename CharT, typename Traits> | |
basic_istream< CharT, Traits > & | operator>> (basic_istream< CharT, Traits > &in, CharT *s) |
Character string extractors. | |
template<class Traits> | |
basic_istream< char, Traits > & | operator>> (basic_istream< char, Traits > &in, unsigned char *s) |
Character string extractors. | |
template<class Traits> | |
basic_istream< char, Traits > & | operator>> (basic_istream< char, Traits > &in, signed char *s) |
Character string extractors. | |
template<typename CharT> | |
bool | isspace (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | isprint (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | iscntrl (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | isupper (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | islower (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | isalpha (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | isdigit (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | ispunct (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | isxdigit (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | isalnum (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
bool | isgraph (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
CharT | toupper (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT> | |
CharT | tolower (CharT c, const locale &__loc) |
Convenience interface to ctype.is(). | |
template<typename CharT, typename Traits> | |
basic_ostream< CharT, Traits > & | operator<< (basic_ostream< CharT, Traits > &out, CharT c) |
Character inserters. | |
template<class Traits> | |
basic_ostream< char, Traits > & | operator<< (basic_ostream< char, Traits > &out, char c) |
Character inserters. | |
template<typename CharT, typename Traits> | |
basic_ostream< CharT, Traits > & | operator<< (basic_ostream< CharT, Traits > &out, char c) |
Character inserters. | |
template<class Traits> | |
basic_ostream< char, Traits > & | operator<< (basic_ostream< char, Traits > &out, signed char c) |
Character inserters. | |
template<class Traits> | |
basic_ostream< char, Traits > & | operator<< (basic_ostream< char, Traits > &out, unsigned char c) |
Character inserters. | |
template<typename CharT, typename Traits> | |
basic_ostream< CharT, Traits > & | operator<< (basic_ostream< CharT, Traits > &out, const CharT *s) |
String inserters. | |
template<typename CharT, typename Traits> | |
basic_ostream< CharT, Traits > & | operator<< (basic_ostream< CharT, Traits > &out, const char *s) |
String inserters. | |
template<class Traits> | |
basic_ostream< char, Traits > & | operator<< (basic_ostream< char, Traits > &out, const char *s) |
String inserters. | |
template<class Traits> | |
basic_ostream< char, Traits > & | operator<< (basic_ostream< char, Traits > &out, const signed char *s) |
String inserters. | |
template<class Traits> | |
basic_ostream< char, Traits > & | operator<< (basic_ostream< char, Traits > &out, const unsigned char *s) |
String inserters. | |
template<typename Iterator> | |
bool | operator== (const reverse_iterator< Iterator > &x, const reverse_iterator< Iterator > &y) |
template<typename Iterator> | |
bool | operator< (const reverse_iterator< Iterator > &x, const reverse_iterator< Iterator > &y) |
template<typename Iterator> | |
bool | operator!= (const reverse_iterator< Iterator > &x, const reverse_iterator< Iterator > &y) |
template<typename Iterator> | |
bool | operator> (const reverse_iterator< Iterator > &x, const reverse_iterator< Iterator > &y) |
template<typename Iterator> | |
bool | operator<= (const reverse_iterator< Iterator > &x, const reverse_iterator< Iterator > &y) |
template<typename Iterator> | |
bool | operator>= (const reverse_iterator< Iterator > &x, const reverse_iterator< Iterator > &y) |
template<typename Iterator> | |
reverse_iterator< Iterator > ::difference_type | operator- (const reverse_iterator< Iterator > &x, const reverse_iterator< Iterator > &y) |
template<typename Iterator> | |
reverse_iterator< Iterator > | operator+ (typename reverse_iterator< Iterator >::difference_type n, const reverse_iterator< Iterator > &x) |
template<size_t Nb> | |
bitset< Nb > | operator & (const bitset< Nb > &x, const bitset< Nb > &y) |
Global bitwise operations on bitsets. | |
template<size_t Nb> | |
bitset< Nb > | operator| (const bitset< Nb > &x, const bitset< Nb > &y) |
Global bitwise operations on bitsets. | |
template<size_t Nb> | |
bitset< Nb > | operator^ (const bitset< Nb > &x, const bitset< Nb > &y) |
Global bitwise operations on bitsets. | |
template<class CharT, class Traits, size_t Nb> | |
basic_istream< CharT, Traits > & | operator>> (basic_istream< CharT, Traits > &__is, bitset< Nb > &x) |
Global I/O operators for bitsets. | |
template<class CharT, class Traits, size_t Nb> | |
basic_ostream< CharT, Traits > & | operator<< (basic_ostream< CharT, Traits > &__os, const bitset< Nb > &x) |
Global I/O operators for bitsets. | |
template<typename Type> | |
complex< Type > | operator+ (const complex< Type > &x, const complex< Type > &y) |
Return new complex value x plus y. | |
template<typename Type> | |
complex< Type > | operator+ (const complex< Type > &x, const Type &y) |
Return new complex value x plus y. | |
template<typename Type> | |
complex< Type > | operator+ (const Type &x, const complex< Type > &y) |
Return new complex value x plus y. | |
template<typename Type> | |
complex< Type > | operator- (const complex< Type > &x, const complex< Type > &y) |
Return new complex value x minus y. | |
template<typename Type> | |
complex< Type > | operator- (const complex< Type > &x, const Type &y) |
Return new complex value x minus y. | |
template<typename Type> | |
complex< Type > | operator- (const Type &x, const complex< Type > &y) |
Return new complex value x minus y. | |
template<typename Type> | |
complex< Type > | operator * (const complex< Type > &x, const complex< Type > &y) |
Return new complex value x times y. | |
template<typename Type> | |
complex< Type > | operator * (const complex< Type > &x, const Type &y) |
Return new complex value x times y. | |
template<typename Type> | |
complex< Type > | operator * (const Type &x, const complex< Type > &y) |
Return new complex value x times y. | |
template<typename Type> | |
complex< Type > | operator/ (const complex< Type > &x, const complex< Type > &y) |
Return new complex value x divided by y. | |
template<typename Type> | |
complex< Type > | operator/ (const complex< Type > &x, const Type &y) |
Return new complex value x divided by y. | |
template<typename Type> | |
complex< Type > | operator/ (const Type &x, const complex< Type > &y) |
Return new complex value x divided by y. | |
template<typename Type> | |
bool | operator== (const complex< Type > &x, const complex< Type > &y) |
Return true if x is equal to y. | |
template<typename Type> | |
bool | operator== (const complex< Type > &x, const Type &y) |
Return true if x is equal to y. | |
template<typename Type> | |
bool | operator== (const Type &x, const complex< Type > &y) |
Return true if x is equal to y. | |
template<typename Type> | |
bool | operator!= (const complex< Type > &x, const complex< Type > &y) |
Return false if x is equal to y. | |
template<typename Type> | |
bool | operator!= (const complex< Type > &x, const Type &y) |
Return false if x is equal to y. | |
template<typename Type> | |
bool | operator!= (const Type &x, const complex< Type > &y) |
Return false if x is equal to y. | |
Variables | |
Standard Stream Objects | |
The <iostream> header declares the eight standard stream objects. For other declarations, see http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#10 and the I/O forward declarations
They are required by default to cooperate with the global C library's | |
fake_istream | cin |
Linked to standard input. | |
fake_ostream | cout |
Linked to standard output. | |
fake_ostream | cerr |
Linked to standard error (unbuffered). | |
fake_ostream | clog |
Linked to standard error (buffered). |
typedef void(* std::new_handler)() |
typedef long long std::streamoff |
Type used by fpos, char_traits<char>, and char_traits<wchar_t>.
Definition at line 74 of file postypes.h.
typedef fpos<mbstate_t> std::streampos |
typedef ptrdiff_t std::streamsize |
typedef void(* std::terminate_handler)() |
typedef void(* std::unexpected_handler)() |
typedef fpos<mbstate_t> std::wstreampos |
Describes the denormalization for floating-point types.
These values represent the presence or absence of a variable number of exponent bits. This type is used in the std::numeric_limits class.
Describes the rounding style for floating-point types.
This is used in the std::numeric_limits class.
Type std::abs | ( | const complex< Type > & | __z | ) | [inline] |
Return magnitude of z.
Definition at line 547 of file complex.
References std::complex< Type >::imag(), max(), and std::complex< Type >::real().
Type std::accumulate | ( | InputIterator | first, | |
InputIterator | last, | |||
Type | init, | |||
BinaryOperation | __binary_op | |||
) | [inline] |
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.
first | Start of range. | |
last | End of range. | |
init | Starting value to add other values to. | |
binary_op | Function object to accumulate with. |
Definition at line 108 of file stl_numeric.h.
Type std::accumulate | ( | InputIterator | first, | |
InputIterator | last, | |||
Type | init | |||
) | [inline] |
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.
first | Start of range. | |
last | End of range. | |
init | Starting value to add other values to. |
Definition at line 82 of file stl_numeric.h.
OutputIterator std::adjacent_difference | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result, | |||
BinaryOperation | __binary_op | |||
) | [inline] |
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.
first | Start of input range. | |
last | End of input range. | |
result | Output to write sums to. |
Definition at line 303 of file stl_numeric.h.
OutputIterator std::adjacent_difference | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result | |||
) | [inline] |
Return differences between adjacent values.
Computes the difference between adjacent values in the range [first,last) using operator-() and writes the result to result.
first | Start of input range. | |
last | End of input range. | |
result | Output to write sums to. |
Definition at line 268 of file stl_numeric.h.
ForwardIterator std::adjacent_find | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
BinaryPredicate | __binary_pred | |||
) | [inline] |
Find two adjacent values in a sequence using a predicate.
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 std::adjacent_find | ( | ForwardIterator | first, | |
ForwardIterator | last | |||
) | [inline] |
Find two adjacent values in a sequence that are equal.
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 std::advance | ( | InputIterator & | __i, | |
Distance | n | |||
) | [inline] |
A generalization of pointer arithmetic.
i | An input iterator. | |
n | The "delta" by which to change i . |
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.
Type std::arg | ( | const complex< Type > & | __z | ) | [inline] |
Return phase angle of z.
Definition at line 561 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
Referenced by log().
back_insert_iterator<Container> std::back_inserter | ( | Container & | x | ) | [inline] |
x | A container of arbitrary type. |
x
.Definition at line 397 of file stl_iterator.h.
ios_base& std::boolalpha | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::boolalpha).
Definition at line 790 of file ios_base.h.
References std::ios_base::boolalpha, and std::ios_base::setf().
complex< Type > std::conj | ( | const complex< Type > & | __z | ) | [inline] |
Return complex conjugate of z.
Definition at line 606 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
OutputIterator std::copy | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result | |||
) | [inline] |
Copies the range [first,last) into result.
memmove
whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling). Result may not be contained within [first,last); the copy_backward function should be used instead.Note that the end of the output range is permitted to be contained within [first,last).
Definition at line 348 of file stl_algobase.h.
Referenced by std::basic_string< CharT, Traits, Alloc >::assign(), std::basic_string< CharT, Traits, Alloc >::copy(), std::basic_istream< CharT, Traits >::getline(), std::basic_string< CharT, Traits, Alloc >::insert(), std::basic_string< CharT, Traits, Alloc >::replace(), std::basic_filebuf< CharT, Traits >::underflow(), std::basic_streambuf< CharT, Traits >::xsgetn(), std::basic_filebuf< CharT, Traits >::xsgetn(), and std::basic_streambuf< CharT, Traits >::xsputn().
BI2 std::copy_backward | ( | BI1 | first, | |
BI1 | last, | |||
BI2 | __result | |||
) | [inline] |
Copies the range [first,last) into result.
first | A bidirectional iterator. | |
last | A bidirectional iterator. | |
result | A bidirectional iterator. |
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 487 of file stl_algobase.h.
complex< Type > std::cos | ( | const complex< Type > & | __z | ) | [inline] |
Return complex cosine of z.
Definition at line 612 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
complex< Type > std::cosh | ( | const complex< Type > & | __z | ) | [inline] |
Return complex hyperbolic cosine of z.
Definition at line 621 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
iterator_traits<InputIterator>::difference_type std::count | ( | InputIterator | first, | |
InputIterator | last, | |||
const Type & | value | |||
) | [inline] |
Count the number of copies of a value in a sequence.
i
in the range
[first,last) for which *i
== value
Definition at line 412 of file stl_algo.h.
Referenced by std::set< Key, Compare, Allocator >::count(), std::multiset< Key, Compare, Allocator >::count(), std::multimap< Key, Type, Compare, Allocator >::count(), and std::map< Key, Type, Compare, Allocator >::count().
iterator_traits<InputIterator>::difference_type std::count_if | ( | InputIterator | first, | |
InputIterator | last, | |||
Predicate | pred | |||
) | [inline] |
Count the elements of a sequence for which a predicate is true.
i
in the range
[first,last) for which pred(*i)
is true. Definition at line 437 of file stl_algo.h.
ios_base& std::dec | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::dec, ios_base::basefield).
Definition at line 928 of file ios_base.h.
References std::ios_base::basefield, std::ios_base::dec, and std::ios_base::setf().
iterator_traits<InputIterator>::difference_type std::distance | ( | InputIterator | first, | |
InputIterator | last | |||
) | [inline] |
A generalization of pointer arithmetic.
n
such that first + n == last. This requires that last
must be reachable from first
. Note that n
may be negative.
For random access iterators, this uses their +
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(), __gnu_cxx::random_sample_n(), std::list< Type, Allocator >::size(), and upper_bound().
basic_ostream<CharT, Traits>& std::endl | ( | basic_ostream< CharT, Traits > & | __os | ) | [inline] |
Write a newline and flush the stream.
This manipulator is often mistakenly used when a simple newline is desired, leading to poor buffering performance. See http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 for more on this subject.
Definition at line 518 of file ostream.
References std::basic_ostream< CharT, Traits >::put(), and std::basic_ios< CharT, Traits >::widen().
basic_ostream<CharT, Traits>& std::ends | ( | basic_ostream< CharT, Traits > & | __os | ) | [inline] |
Write a null character into the output sequence.
"Null character" is CharT()
by definition. For CharT of char
, this correctly writes the ASCII NUL
character string terminator.
Definition at line 529 of file ostream.
References std::basic_ostream< CharT, Traits >::put().
bool std::equal | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
BinaryPredicate | __binary_pred | |||
) | [inline] |
Tests a range for element-wise equality.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
binary_pred | A binary predicate functor. |
Definition at line 712 of file stl_algobase.h.
bool std::equal | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2 | |||
) | [inline] |
Tests a range for element-wise equality.
==
and returns true or false depending on whether all of the corresponding elements of the ranges are equal.
Definition at line 679 of file stl_algobase.h.
Referenced by operator==().
complex< Type > std::exp | ( | const complex< Type > & | __z | ) | [inline] |
Return complex base e exponential of z.
Definition at line 630 of file complex.
References std::complex< Type >::imag(), polar(), and std::complex< Type >::real().
void std::fill | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
const Type & | value | |||
) | [inline] |
Fills the range [first,last) with copies of value.
first | A forward iterator. | |
last | A forward iterator. | |
value | A reference-to-const of arbitrary type. |
memset
.
Definition at line 516 of file stl_algobase.h.
OutputIterator std::fill_n | ( | OutputIterator | first, | |
Size | n, | |||
const Type & | value | |||
) | [inline] |
Fills the range [first,first+n) with copies of value.
first | An output iterator. | |
n | The count of copies to perform. | |
value | A reference-to-const of arbitrary type. |
memset
.
Definition at line 540 of file stl_algobase.h.
InputIterator std::find | ( | InputIterator | first, | |
InputIterator | last, | |||
const Type & | __val | |||
) | [inline] |
Find the first occurrence of a value in a sequence.
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 std::basic_string< CharT, Traits, Alloc >::find(), std::basic_string< CharT, Traits, Alloc >::find_first_not_of(), std::basic_string< CharT, Traits, Alloc >::find_first_of(), std::basic_string< CharT, Traits, Alloc >::find_last_not_of(), std::basic_string< CharT, Traits, Alloc >::find_last_of(), and std::basic_istream< CharT, Traits >::getline().
ForwardIterator1 std::find_end | ( | ForwardIterator1 | first1, | |
ForwardIterator1 | last1, | |||
ForwardIterator2 | first2, | |||
ForwardIterator2 | last2, | |||
BinaryPredicate | comp | |||
) | [inline] |
Find last matching subsequence in a sequence using a predicate.
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. |
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.
[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 5127 of file stl_algo.h.
ForwardIterator1 std::find_end | ( | ForwardIterator1 | first1, | |
ForwardIterator1 | last1, | |||
ForwardIterator2 | first2, | |||
ForwardIterator2 | last2 | |||
) | [inline] |
Find last matching subsequence in a sequence.
first1 | Start of range to search. | |
last1 | End of range to search. | |
first2 | Start of sequence to match. | |
last2 | End of sequence to match. |
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.
[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 5081 of file stl_algo.h.
InputIterator std::find_first_of | ( | InputIterator | first1, | |
InputIterator | last1, | |||
ForwardIterator | first2, | |||
ForwardIterator | last2, | |||
BinaryPredicate | comp | |||
) | [inline] |
Find element from a set in a sequence using a predicate.
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. |
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.
[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 4902 of file stl_algo.h.
InputIterator std::find_first_of | ( | InputIterator | first1, | |
InputIterator | last1, | |||
ForwardIterator | first2, | |||
ForwardIterator | last2 | |||
) | [inline] |
Find element from a set in a sequence.
first1 | Start of range to search. | |
last1 | End of range to search. | |
first2 | Start of match candidates. | |
last2 | End of match candidates. |
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.
[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 4865 of file stl_algo.h.
InputIterator std::find_if | ( | InputIterator | first, | |
InputIterator | last, | |||
Predicate | pred | |||
) | [inline] |
Find the first element in a sequence for which a predicate is true.
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.
ios_base& std::fixed | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::fixed, ios_base::floatfield).
Definition at line 953 of file ios_base.h.
References std::ios_base::fixed, std::ios_base::floatfield, and std::ios_base::setf().
basic_ostream<CharT, Traits>& std::flush | ( | basic_ostream< CharT, Traits > & | __os | ) | [inline] |
Flushes the output stream.
This manipulator simply calls the stream's flush()
member function.
Definition at line 539 of file ostream.
References std::basic_ostream< CharT, Traits >::flush().
Function std::for_each | ( | InputIterator | first, | |
InputIterator | last, | |||
Function | __f | |||
) | [inline] |
Apply a function to every element of a sequence.
f
.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> std::front_inserter | ( | Container & | x | ) | [inline] |
x | A container of arbitrary type. |
x
.Definition at line 471 of file stl_iterator.h.
void std::generate | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
Generator | __gen | |||
) | [inline] |
Assign the result of a function object to each value in a sequence.
first | A forward iterator. | |
last | A forward iterator. | |
gen | A function object taking no arguments. |
*i
= gen()
for each i
in the range
[first,last).
Definition at line 972 of file stl_algo.h.
OutputIterator std::generate_n | ( | OutputIterator | first, | |
Size | n, | |||
Generator | __gen | |||
) | [inline] |
Assign the result of a function object to each value in a sequence.
first | A forward iterator. | |
n | The length of the sequence. | |
gen | A function object taking no arguments. |
first+n
*i
= gen()
for each i
in the range
[first,first+n).
Definition at line 998 of file stl_algo.h.
pair<Type*, ptrdiff_t> std::get_temporary_buffer | ( | ptrdiff_t | __len | ) | [inline] |
Allocates a temporary buffer.
len | The number of objects of type Tp. |
This function tries to obtain storage for len
adjacent Tp objects. The objects themselves are not constructed, of course. A pair<> is returned containing "the buffer s address and capacity (in the units of sizeof(Tp)), or a pair of 0 values if no storage can be obtained." Note that the capacity obtained may be less than that requested if the memory is unavailable; you should compare len with the .second return value.
Provides the nothrow exception guarantee.
basic_istream< CharT, Traits > & std::getline | ( | basic_istream< CharT, Traits > & | __is, | |
basic_string< CharT, Traits, Alloc > & | str | |||
) | [inline] |
Read a line from stream into a string.
is | Input stream. | |
str | Buffer to store into. |
Definition at line 1162 of file istream.tcc.
References std::basic_istream< CharT, Traits >::getline(), and std::basic_ios< CharT, Traits >::widen().
basic_istream< CharT, Traits > & std::getline | ( | basic_istream< CharT, Traits > & | __is, | |
basic_string< CharT, Traits, Alloc > & | str, | |||
CharT | __delim | |||
) | [inline] |
Read a line from stream into a string.
is | Input stream. | |
str | Buffer to store into. | |
delim | Character marking end of line. |
Definition at line 1093 of file istream.tcc.
References std::basic_string< CharT, Traits, Alloc >::append(), std::ios_base::badbit, std::ios_base::eofbit, std::basic_string< CharT, Traits, Alloc >::erase(), std::ios_base::failbit, std::ios_base::goodbit, std::basic_string< CharT, Traits, Alloc >::max_size(), std::basic_ios< CharT, Traits >::rdbuf(), and std::basic_ios< CharT, Traits >::setstate().
bool std::has_facet | ( | const locale & | __loc | ) | throw () [inline] |
Test for the presence of a facet.
has_facet tests the locale argument for the presence of the facet type provided as the template parameter. Facets derived from the facet parameter will also return true.
Definition at line 85 of file locale_facets.tcc.
ios_base& std::hex | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::hex, ios_base::basefield).
Definition at line 936 of file ios_base.h.
References std::ios_base::basefield, std::ios_base::hex, and std::ios_base::setf().
Type std::inner_product | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
Type | init, | |||
BinaryOperation1 | __binary_op1, | |||
BinaryOperation2 | __binary_op2 | |||
) | [inline] |
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.
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. |
Definition at line 168 of file stl_numeric.h.
Type std::inner_product | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
Type | init | |||
) | [inline] |
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.
first1 | Start of range 1. | |
last1 | End of range 1. | |
first2 | Start of range 2. | |
init | Starting value to add other values to. |
Definition at line 136 of file stl_numeric.h.
void std::inplace_merge | ( | BidirectionalIterator | first, | |
BidirectionalIterator | __middle, | |||
BidirectionalIterator | last, | |||
Compare | comp | |||
) | [inline] |
Merges two sorted ranges in place.
first | An iterator. | |
middle | Another iterator. | |
last | Another iterator. | |
comp | A functor to use for comparisons. |
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 3491 of file stl_algo.h.
References distance().
void std::inplace_merge | ( | BidirectionalIterator | first, | |
BidirectionalIterator | __middle, | |||
BidirectionalIterator | last | |||
) | [inline] |
Merges two sorted ranges in place.
If enough additional memory is available, this takes (last-first)-1 comparisons. Otherwise an NlogN algorithm is used, where N is distance(first,last).
Definition at line 3437 of file stl_algo.h.
References distance().
insert_iterator<Container> std::inserter | ( | Container & | x, | |
Iterator | __i | |||
) | [inline] |
x | A container of arbitrary type. |
x
.Definition at line 567 of file stl_iterator.h.
ios_base& std::internal | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::internal, ios_base::adjustfield).
Definition at line 903 of file ios_base.h.
References std::ios_base::adjustfield, std::ios_base::internal, and std::ios_base::setf().
bool std::isalnum | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::isalpha | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::iscntrl | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::isdigit | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::isgraph | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::islower | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::isprint | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::ispunct | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::isspace | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::isupper | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
bool std::isxdigit | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
void std::iter_swap | ( | ForwardIterator1 | a, | |
ForwardIterator2 | __b | |||
) | [inline] |
Swaps the contents of two iterators.
Definition at line 92 of file stl_algobase.h.
Referenced by next_permutation(), prev_permutation(), random_shuffle(), and swap_ranges().
ios_base& std::left | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::left, ios_base::adjustfield).
Definition at line 911 of file ios_base.h.
References std::ios_base::adjustfield, std::ios_base::left, and std::ios_base::setf().
bool std::lexicographical_compare | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
Compare | comp | |||
) | [inline] |
Performs "dictionary" comparison on ranges.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
last2 | An input iterator. | |
comp | A comparison functor. |
lexigraphical_compare
, but uses the comp parameter instead of <
.
Definition at line 783 of file stl_algobase.h.
bool std::lexicographical_compare | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2 | |||
) | [inline] |
Performs "dictionary" comparison on ranges.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
last2 | An input iterator. |
memcmp
.
Definition at line 743 of file stl_algobase.h.
Referenced by operator<().
complex< Type > std::log | ( | const complex< Type > & | __z | ) | [inline] |
complex< Type > std::log10 | ( | const complex< Type > & | __z | ) | [inline] |
void std::make_heap | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last, | |||
Compare | comp | |||
) | [inline] |
Construct a heap over a range using comparison functor.
first | Start of heap. | |
last | End of heap. | |
comp | Comparison functor to use. |
Definition at line 384 of file stl_heap.h.
void std::make_heap | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last | |||
) | [inline] |
Construct a heap over a range.
first | Start of heap. | |
last | End of heap. |
Definition at line 344 of file stl_heap.h.
Referenced by partial_sort(), partial_sort_copy(), and std::priority_queue< Type, Sequence, Compare >::priority_queue().
pair<T1, T2> std::make_pair | ( | T1 | x, | |
T2 | y | |||
) | [inline] |
A convenience wrapper for creating a pair from two objects.
x | The first object. | |
y | The second object. |
Definition at line 144 of file stl_pair.h.
const Type& std::max | ( | const Type & | a, | |
const Type & | __b, | |||
Compare | comp | |||
) | [inline] |
This does what you think it does.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. | |
comp | A comparison functor. |
Definition at line 214 of file stl_algobase.h.
Referenced by operator>>().
const Type& std::max | ( | const Type & | a, | |
const Type & | __b | |||
) | [inline] |
This does what you think it does.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. |
Definition at line 172 of file stl_algobase.h.
Referenced by abs(), and std::basic_stringbuf< CharT, Traits, Alloc >::overflow().
ForwardIterator std::max_element | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
Compare | comp | |||
) | [inline] |
Return the maximum element in a range using comparison functor.
first | Start of range. | |
last | End of range. | |
comp | Comparison functor. |
Definition at line 4552 of file stl_algo.h.
ForwardIterator std::max_element | ( | ForwardIterator | first, | |
ForwardIterator | last | |||
) | [inline] |
Return the maximum element in a range.
first | Start of range. | |
last | End of range. |
Definition at line 4525 of file stl_algo.h.
Referenced by std::valarray< Type >::max().
OutputIterator std::merge | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result, | |||
Compare | comp | |||
) | [inline] |
Merges two sorted ranges.
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. |
The comparison function should have the same effects on ordering as the function used for the initial sort.
Definition at line 3018 of file stl_algo.h.
OutputIterator std::merge | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result | |||
) | [inline] |
Merges two sorted ranges.
first1 | An iterator. | |
first2 | Another iterator. | |
last1 | Another iterator. | |
last2 | Another iterator. | |
result | An iterator pointing to the end of the merged range. |
Definition at line 2960 of file stl_algo.h.
const Type& std::min | ( | const Type & | a, | |
const Type & | __b, | |||
Compare | comp | |||
) | [inline] |
This does what you think it does.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. | |
comp | A comparison functor. |
Definition at line 194 of file stl_algobase.h.
Referenced by __gnu_cxx::random_sample_n().
const Type& std::min | ( | const Type & | a, | |
const Type & | __b | |||
) | [inline] |
This does what you think it does.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. |
Definition at line 150 of file stl_algobase.h.
Referenced by std::basic_string< CharT, Traits, Alloc >::compare(), std::basic_string< CharT, Traits, Allocator >::compare(), std::basic_istream< CharT, Traits >::getline(), std::basic_stringbuf< CharT, Traits, Alloc >::overflow(), std::basic_istream< CharT, Traits >::readsome(), std::basic_string< CharT, Traits, Alloc >::rfind(), std::basic_filebuf< CharT, Traits >::underflow(), std::basic_streambuf< CharT, Traits >::xsgetn(), std::basic_streambuf< CharT, Traits >::xsputn(), and std::basic_filebuf< CharT, Traits >::xsputn().
ForwardIterator std::min_element | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
Compare | comp | |||
) | [inline] |
Return the minimum element in a range using comparison functor.
first | Start of range. | |
last | End of range. | |
comp | Comparison functor. |
Definition at line 4604 of file stl_algo.h.
ForwardIterator std::min_element | ( | ForwardIterator | first, | |
ForwardIterator | last | |||
) | [inline] |
Return the minimum element in a range.
first | Start of range. | |
last | End of range. |
Definition at line 4577 of file stl_algo.h.
Referenced by std::valarray< Type >::min().
pair<InputIterator1, InputIterator2> std::mismatch | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
BinaryPredicate | __binary_pred | |||
) | [inline] |
Finds the places in ranges which don't match.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
binary_pred | A binary predicate functor. |
Definition at line 650 of file stl_algobase.h.
pair<InputIterator1, InputIterator2> std::mismatch | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2 | |||
) | [inline] |
Finds the places in ranges which don't match.
==
and returns a pair of iterators. The first iterator points into the first range, the second iterator points into the second range, and the elements pointed to by the iterators are not equal.
Definition at line 614 of file stl_algobase.h.
bool std::next_permutation | ( | BidirectionalIterator | first, | |
BidirectionalIterator | last, | |||
Compare | comp | |||
) | [inline] |
Permute range into the next "dictionary" ordering using comparison functor.
first | Start of range. | |
last | End of range. | |
comp |
Definition at line 4695 of file stl_algo.h.
References iter_swap(), and reverse().
bool std::next_permutation | ( | BidirectionalIterator | first, | |
BidirectionalIterator | last | |||
) | [inline] |
Permute range into the next "dictionary" ordering.
first | Start of range. | |
last | End of range. |
Definition at line 4639 of file stl_algo.h.
References iter_swap(), and reverse().
ios_base& std::noboolalpha | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::boolalpha).
Definition at line 798 of file ios_base.h.
References std::ios_base::boolalpha, and std::ios_base::unsetf().
Type std::norm | ( | const complex< Type > & | __z | ) | [inline] |
Return z magnitude squared.
Definition at line 594 of file complex.
Referenced by std::complex< Type >::operator/=().
ios_base& std::noshowbase | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::showbase).
Definition at line 814 of file ios_base.h.
References std::ios_base::showbase, and std::ios_base::unsetf().
ios_base& std::noshowpoint | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::showpoint).
Definition at line 830 of file ios_base.h.
References std::ios_base::showpoint, and std::ios_base::unsetf().
ios_base& std::noshowpos | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::showpos).
Definition at line 846 of file ios_base.h.
References std::ios_base::showpos, and std::ios_base::unsetf().
ios_base& std::noskipws | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::skipws).
Definition at line 862 of file ios_base.h.
References std::ios_base::skipws, and std::ios_base::unsetf().
ios_base& std::nounitbuf | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::unitbuf).
Definition at line 894 of file ios_base.h.
References std::ios_base::unitbuf, and std::ios_base::unsetf().
ios_base& std::nouppercase | ( | ios_base & | __base | ) | [inline] |
Calls base.unsetf(ios_base::uppercase).
Definition at line 878 of file ios_base.h.
References std::ios_base::unsetf(), and std::ios_base::uppercase.
void std::nth_element | ( | RandomAccessIterator | first, | |
RandomAccessIterator | nth, | |||
RandomAccessIterator | last, | |||
Compare | comp | |||
) | [inline] |
Sort a sequence just enough to find a particular position using a predicate for comparison.
first | An iterator. | |
nth | Another iterator. | |
last | Another iterator. | |
comp | A comparison functor. |
[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 3733 of file stl_algo.h.
References __median().
void std::nth_element | ( | RandomAccessIterator | first, | |
RandomAccessIterator | nth, | |||
RandomAccessIterator | last | |||
) | [inline] |
Sort a sequence just enough to find a particular position.
[first,last) so that *nth
is the same element that would have been in that position had the whole sequence been sorted. whole sequence been sorted. The elements either side of *nth
are not completely sorted, but for any iterator in the range
[first,nth) and any iterator in the range
[nth,last) it holds that *j<*i
is false.
Definition at line 3682 of file stl_algo.h.
References __median().
ios_base& std::oct | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::oct, ios_base::basefield).
Definition at line 944 of file ios_base.h.
References std::ios_base::basefield, std::ios_base::oct, and std::ios_base::setf().
bitset<Nb> std::operator & | ( | const bitset< Nb > & | x, | |
const bitset< Nb > & | y | |||
) | [inline] |
complex<Type> std::operator * | ( | const Type & | x, | |
const complex< Type > & | y | |||
) | [inline] |
complex<Type> std::operator * | ( | const complex< Type > & | x, | |
const Type & | y | |||
) | [inline] |
complex<Type> std::operator * | ( | const complex< Type > & | x, | |
const complex< Type > & | y | |||
) | [inline] |
bool std::operator!= | ( | const Type & | x, | |
const complex< Type > & | y | |||
) | [inline] |
Return false if x is equal to y.
Definition at line 474 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
bool std::operator!= | ( | const complex< Type > & | x, | |
const Type & | y | |||
) | [inline] |
Return false if x is equal to y.
Definition at line 469 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
bool std::operator!= | ( | const complex< Type > & | x, | |
const complex< Type > & | y | |||
) | [inline] |
Return false if x is equal to y.
Definition at line 464 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
bool std::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 std::operator!= | ( | const vector< Type, Alloc > & | x, | |
const vector< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator!= | ( | const stack< Type, Seq > & | x, | |
const stack< Type, Seq > & | y | |||
) | [inline] |
bool std::operator!= | ( | const set< Key, Compare, Alloc > & | x, | |
const set< Key, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator!= | ( | const queue< Type, Sequence > & | x, | |
const queue< Type, Sequence > & | y | |||
) | [inline] |
bool std::operator!= | ( | const pair< T1, T2 > & | x, | |
const pair< T1, T2 > & | y | |||
) | [inline] |
bool std::operator!= | ( | const multiset< Key, Compare, Alloc > & | x, | |
const multiset< Key, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator!= | ( | const multimap< Key, Type, Compare, Alloc > & | x, | |
const multimap< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator!= | ( | const map< Key, Type, Compare, Alloc > & | x, | |
const map< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator!= | ( | const list< Type, Alloc > & | x, | |
const list< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator!= | ( | const reverse_iterator< Iterator > & | x, | |
const reverse_iterator< Iterator > & | y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 289 of file stl_iterator.h.
bool std::operator!= | ( | const deque< Type, Alloc > & | x, | |
const deque< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator!= | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const CharT * | __rhs | |||
) | [inline] |
Test difference of string and C string.
lhs | String. | |
rhs | C string. |
Definition at line 2133 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator!= | ( | const CharT * | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test difference of C string and string.
lhs | C string. | |
rhs | String. |
Definition at line 2121 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator!= | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test difference of two strings.
lhs | First string. | |
rhs | Second string. |
Definition at line 2109 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
complex<Type> std::operator+ | ( | const complex< Type > & | x | ) | [inline] |
complex<Type> std::operator+ | ( | const Type & | x, | |
const complex< Type > & | y | |||
) | [inline] |
Return new complex value x plus y.
Definition at line 332 of file complex.
References std::complex< Type >::real().
complex<Type> std::operator+ | ( | const complex< Type > & | x, | |
const Type & | y | |||
) | [inline] |
Return new complex value x plus y.
Definition at line 323 of file complex.
References std::complex< Type >::real().
complex<Type> std::operator+ | ( | const complex< Type > & | x, | |
const complex< Type > & | y | |||
) | [inline] |
reverse_iterator<Iterator> std::operator+ | ( | typename reverse_iterator< Iterator >::difference_type | n, | |
const reverse_iterator< Iterator > & | x | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 319 of file stl_iterator.h.
References std::reverse_iterator< Iterator >::base().
basic_string<CharT, Traits, Alloc> std::operator+ | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
CharT | __rhs | |||
) | [inline] |
Concatenate string and character.
lhs | First string. | |
rhs | Last string. |
Definition at line 2054 of file basic_string.h.
basic_string<CharT, Traits, Alloc> std::operator+ | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const CharT * | __rhs | |||
) | [inline] |
Concatenate string and C string.
lhs | First string. | |
rhs | Last string. |
Definition at line 2038 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::append().
basic_string< CharT, Traits, Alloc > std::operator+ | ( | CharT | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Concatenate character and string.
lhs | First string. | |
rhs | Last string. |
Definition at line 663 of file basic_string.tcc.
References std::basic_string< CharT, Traits, Alloc >::size().
basic_string< CharT, Traits, Alloc > std::operator+ | ( | const CharT * | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Concatenate C string and string.
lhs | First string. | |
rhs | Last string. |
Definition at line 647 of file basic_string.tcc.
References std::basic_string< CharT, Traits, Alloc >::size().
basic_string<CharT, Traits, Alloc> std::operator+ | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Concatenate two strings.
lhs | First string. | |
rhs | Last string. |
Definition at line 2001 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::append().
complex<Type> std::operator- | ( | const complex< Type > & | x | ) | [inline] |
Return complex negation of x.
Definition at line 439 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
complex<Type> std::operator- | ( | const Type & | x, | |
const complex< Type > & | y | |||
) | [inline] |
Return new complex value x minus y.
Definition at line 362 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
complex<Type> std::operator- | ( | const complex< Type > & | x, | |
const Type & | y | |||
) | [inline] |
Return new complex value x minus y.
Definition at line 353 of file complex.
References std::complex< Type >::real().
complex<Type> std::operator- | ( | const complex< Type > & | x, | |
const complex< Type > & | y | |||
) | [inline] |
reverse_iterator<Iterator>::difference_type std::operator- | ( | const reverse_iterator< Iterator > & | x, | |
const reverse_iterator< Iterator > & | y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 313 of file stl_iterator.h.
References std::reverse_iterator< Iterator >::base().
complex<Type> std::operator/ | ( | const Type & | x, | |
const complex< Type > & | y | |||
) | [inline] |
complex<Type> std::operator/ | ( | const complex< Type > & | x, | |
const Type & | y | |||
) | [inline] |
complex<Type> std::operator/ | ( | const complex< Type > & | x, | |
const complex< Type > & | y | |||
) | [inline] |
bool std::operator< | ( | const vector< Type, Alloc > & | x, | |
const vector< Type, Alloc > & | y | |||
) | [inline] |
Vector ordering relation.
x | A vector. | |
y | A vector of the same type as x. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 895 of file stl_vector.h.
References lexicographical_compare().
bool std::operator< | ( | const stack< Type, Seq > & | x, | |
const stack< Type, Seq > & | y | |||
) | [inline] |
Stack ordering relation.
x | A stack. | |
y | A stack of the same type as x. |
<
, and std::lexicographical_compare() is usually used to make the determination.
Definition at line 244 of file stl_stack.h.
bool std::operator< | ( | const set< Key, Compare, Alloc > & | x, | |
const set< Key, Compare, Alloc > & | y | |||
) | [inline] |
Set ordering relation.
x | A set. | |
y | A set of the same type as x. |
<
.See std::lexicographical_compare() for how the determination is made.
bool std::operator< | ( | const queue< Type, Sequence > & | x, | |
const queue< Type, Sequence > & | y | |||
) | [inline] |
Queue ordering relation.
x | A queue. | |
y | A queue of the same type as x. |
<
, and std::lexicographical_compare() is usually used to make the determination.
Definition at line 269 of file stl_queue.h.
bool std::operator< | ( | const pair< T1, T2 > & | x, | |
const pair< T1, T2 > & | y | |||
) | [inline] |
<http://gcc.gnu.org/onlinedocs/libstdc++/20_util/howto.html#pairlt>
Definition at line 102 of file stl_pair.h.
bool std::operator< | ( | const multiset< Key, Compare, Alloc > & | x, | |
const multiset< Key, Compare, Alloc > & | y | |||
) | [inline] |
Multiset ordering relation.
x | A multiset. | |
y | A multiset of the same type as x. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 544 of file stl_multiset.h.
bool std::operator< | ( | const multimap< Key, Type, Compare, Alloc > & | x, | |
const multimap< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
Multimap ordering relation.
x | A multimap. | |
y | A multimap of the same type as x. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 637 of file stl_multimap.h.
bool std::operator< | ( | const map< Key, Type, Compare, Alloc > & | x, | |
const map< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
Map ordering relation.
x | A map. | |
y | A map of the same type as x. |
<
.See std::lexicographical_compare() for how the determination is made.
bool std::operator< | ( | const list< Type, Alloc > & | x, | |
const list< Type, Alloc > & | y | |||
) | [inline] |
List ordering relation.
x | A list. | |
y | A list of the same type as x. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 1219 of file stl_list.h.
References lexicographical_compare().
bool std::operator< | ( | const reverse_iterator< Iterator > & | x, | |
const reverse_iterator< Iterator > & | y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 283 of file stl_iterator.h.
bool std::operator< | ( | const deque< Type, Alloc > & | x, | |
const deque< Type, Alloc > & | y | |||
) | [inline] |
Deque ordering relation.
x | A deque. | |
y | A deque of the same type as x. |
<
.See std::lexicographical_compare() for how the determination is made.
Definition at line 1461 of file stl_deque.h.
References lexicographical_compare().
bool std::operator< | ( | const CharT * | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test if C string precedes string.
lhs | C string. | |
rhs | String. |
Definition at line 2170 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator< | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const CharT * | __rhs | |||
) | [inline] |
Test if string precedes C string.
lhs | String. | |
rhs | C string. |
Definition at line 2158 of file basic_string.h.
bool std::operator< | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test if string precedes string.
lhs | First string. | |
rhs | Second string. |
Definition at line 2146 of file basic_string.h.
basic_ostream<char, Traits>& std::operator<< | ( | basic_ostream< char, Traits > & | out, | |
const unsigned char * | s | |||
) | [inline] |
String inserters.
out | An output stream. | |
s | A character string. |
traits::length(s)
characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0)
is then called.
basic_ostream<char, Traits>& std::operator<< | ( | basic_ostream< char, Traits > & | out, | |
const signed char * | s | |||
) | [inline] |
String inserters.
out | An output stream. | |
s | A character string. |
traits::length(s)
characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0)
is then called.
basic_ostream<char, Traits>& std::operator<< | ( | basic_ostream< char, Traits > & | out, | |
unsigned char | c | |||
) | [inline] |
Character inserters.
out | An output stream. | |
c | A character. |
out.width(0)
is then called.
If c is of type char
and the character type of the stream is not char
, the character is widened before insertion.
basic_ostream<char, Traits>& std::operator<< | ( | basic_ostream< char, Traits > & | out, | |
signed char | c | |||
) | [inline] |
Character inserters.
out | An output stream. | |
c | A character. |
out.width(0)
is then called.
If c is of type char
and the character type of the stream is not char
, the character is widened before insertion.
basic_ostream<CharT, Traits>& std::operator<< | ( | basic_ostream< CharT, Traits > & | out, | |
char | c | |||
) | [inline] |
Character inserters.
out | An output stream. | |
c | A character. |
out.width(0)
is then called.
If c is of type char
and the character type of the stream is not char
, the character is widened before insertion.
basic_ostream<CharT, Traits>& std::operator<< | ( | basic_ostream< CharT, Traits > & | __os, | |
const complex< Type > & | x | |||
) | [inline] |
Insertion operator for complex values.
Definition at line 514 of file complex.
References std::ios_base::flags(), std::basic_ios< CharT, Traits >::imbue(), std::ios_base::precision(), and std::basic_ostringstream< CharT, Traits, Alloc >::str().
basic_ostream<CharT, Traits>& std::operator<< | ( | basic_ostream< CharT, Traits > & | __os, | |
const bitset< Nb > & | x | |||
) | [inline] |
basic_ostream< char, Traits > & std::operator<< | ( | basic_ostream< char, Traits > & | out, | |
const char * | s | |||
) | [inline] |
String inserters.
out | An output stream. | |
s | A character string. |
traits::length(s)
characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0)
is then called.
Definition at line 611 of file ostream.tcc.
References std::ios_base::badbit.
basic_ostream< CharT, Traits > & std::operator<< | ( | basic_ostream< CharT, Traits > & | out, | |
const char * | s | |||
) | [inline] |
String inserters.
out | An output stream. | |
s | A character string. |
traits::length(s)
characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0)
is then called.
Definition at line 566 of file ostream.tcc.
References std::ios_base::badbit.
basic_ostream< CharT, Traits > & std::operator<< | ( | basic_ostream< CharT, Traits > & | out, | |
const CharT * | s | |||
) | [inline] |
String inserters.
out | An output stream. | |
s | A character string. |
traits::length(s)
characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0)
is then called.
Definition at line 533 of file ostream.tcc.
References std::ios_base::badbit.
basic_ostream< char, Traits > & std::operator<< | ( | basic_ostream< char, Traits > & | out, | |
char | c | |||
) | [inline] |
Character inserters.
out | An output stream. | |
c | A character. |
out.width(0)
is then called.
If c is of type char
and the character type of the stream is not char
, the character is widened before insertion.
Definition at line 504 of file ostream.tcc.
References std::ios_base::badbit.
basic_ostream< CharT, Traits > & std::operator<< | ( | basic_ostream< CharT, Traits > & | out, | |
CharT | c | |||
) | [inline] |
Character inserters.
out | An output stream. | |
c | A character. |
out.width(0)
is then called.
If c is of type char
and the character type of the stream is not char
, the character is widened before insertion.
Definition at line 473 of file ostream.tcc.
References std::ios_base::badbit.
basic_ostream< CharT, Traits > & std::operator<< | ( | basic_ostream< CharT, Traits > & | __os, | |
const basic_string< CharT, Traits, Alloc > & | str | |||
) | [inline] |
Write string to a stream.
os | Output stream. | |
str | String to write out. |
Definition at line 643 of file ostream.tcc.
bool std::operator<= | ( | const vector< Type, Alloc > & | x, | |
const vector< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator<= | ( | const stack< Type, Seq > & | x, | |
const stack< Type, Seq > & | y | |||
) | [inline] |
bool std::operator<= | ( | const set< Key, Compare, Alloc > & | x, | |
const set< Key, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator<= | ( | const queue< Type, Sequence > & | x, | |
const queue< Type, Sequence > & | y | |||
) | [inline] |
bool std::operator<= | ( | const pair< T1, T2 > & | x, | |
const pair< T1, T2 > & | y | |||
) | [inline] |
bool std::operator<= | ( | const multiset< Key, Compare, Alloc > & | x, | |
const multiset< Key, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator<= | ( | const multimap< Key, Type, Compare, Alloc > & | x, | |
const multimap< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator<= | ( | const map< Key, Type, Compare, Alloc > & | x, | |
const map< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator<= | ( | const list< Type, Alloc > & | x, | |
const list< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator<= | ( | const reverse_iterator< Iterator > & | x, | |
const reverse_iterator< Iterator > & | y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 301 of file stl_iterator.h.
bool std::operator<= | ( | const deque< Type, Alloc > & | x, | |
const deque< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator<= | ( | const CharT * | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test if C string doesn't follow string.
lhs | C string. | |
rhs | String. |
Definition at line 2244 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator<= | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const CharT * | __rhs | |||
) | [inline] |
Test if string doesn't follow C string.
lhs | String. | |
rhs | C string. |
Definition at line 2232 of file basic_string.h.
bool std::operator<= | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test if string doesn't follow string.
lhs | First string. | |
rhs | Second string. |
Definition at line 2220 of file basic_string.h.
bool std::operator== | ( | const Type & | x, | |
const complex< Type > & | y | |||
) | [inline] |
Return true if x is equal to y.
Definition at line 456 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
bool std::operator== | ( | const complex< Type > & | x, | |
const Type & | y | |||
) | [inline] |
Return true if x is equal to y.
Definition at line 451 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
bool std::operator== | ( | const complex< Type > & | x, | |
const complex< Type > & | y | |||
) | [inline] |
Return true if x is equal to y.
Definition at line 446 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
bool std::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 std::operator== | ( | const vector< Type, Alloc > & | x, | |
const vector< Type, Alloc > & | y | |||
) | [inline] |
Vector equality comparison.
x | A vector. | |
y | A vector of the same type as x. |
Definition at line 876 of file stl_vector.h.
References std::vector< Type, Alloc >::begin(), std::vector< Type, Alloc >::end(), equal(), and std::vector< Type, Alloc >::size().
bool std::operator== | ( | const stack< Type, Seq > & | x, | |
const stack< Type, Seq > & | y | |||
) | [inline] |
Stack equality comparison.
x | A stack. | |
y | A stack of the same type as x. |
Definition at line 226 of file stl_stack.h.
References std::stack< Type, Sequence >::c.
bool std::operator== | ( | const set< Key, Compare, Alloc > & | x, | |
const set< Key, Compare, Alloc > & | y | |||
) | [inline] |
Set equality comparison.
x | A set. | |
y | A set of the same type as x. |
bool std::operator== | ( | const queue< Type, Sequence > & | x, | |
const queue< Type, Sequence > & | y | |||
) | [inline] |
Queue equality comparison.
x | A queue. | |
y | A queue of the same type as x. |
Definition at line 250 of file stl_queue.h.
References std::queue< Type, Sequence >::c.
bool std::operator== | ( | const pair< T1, T2 > & | x, | |
const pair< T1, T2 > & | y | |||
) | [inline] |
Two pairs of the same type are equal iff their members are equal.
Definition at line 96 of file stl_pair.h.
References std::pair< T1, T2 >::first, and std::pair< T1, T2 >::second.
bool std::operator== | ( | const multiset< Key, Compare, Alloc > & | x, | |
const multiset< Key, Compare, Alloc > & | y | |||
) | [inline] |
Multiset equality comparison.
x | A multiset. | |
y | A multiset of the same type as x. |
Definition at line 527 of file stl_multiset.h.
bool std::operator== | ( | const multimap< Key, Type, Compare, Alloc > & | x, | |
const multimap< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
Multimap equality comparison.
x | A multimap. | |
y | A multimap of the same type as x. |
Definition at line 620 of file stl_multimap.h.
bool std::operator== | ( | const map< Key, Type, Compare, Alloc > & | x, | |
const map< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
Map equality comparison.
x | A map. | |
y | A map of the same type as x. |
bool std::operator== | ( | const list< Type, Alloc > & | x, | |
const list< Type, Alloc > & | y | |||
) | [inline] |
List equality comparison.
x | A list. | |
y | A list of the same type as x. |
Definition at line 1190 of file stl_list.h.
References std::list< Type, Alloc >::begin(), and std::list< Type, Alloc >::end().
bool std::operator== | ( | const reverse_iterator< Iterator > & | x, | |
const reverse_iterator< Iterator > & | y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 277 of file stl_iterator.h.
References std::reverse_iterator< Iterator >::base().
bool std::operator== | ( | const deque< Type, Alloc > & | x, | |
const deque< Type, Alloc > & | y | |||
) | [inline] |
Deque equality comparison.
x | A deque. | |
y | A deque of the same type as x. |
Definition at line 1443 of file stl_deque.h.
References std::deque< Type, Alloc >::begin(), std::deque< Type, Alloc >::end(), equal(), and std::deque< Type, Alloc >::size().
bool std::operator== | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const CharT * | __rhs | |||
) | [inline] |
Test equivalence of string and C string.
lhs | String. | |
rhs | C string. |
Definition at line 2096 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator== | ( | const CharT * | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test equivalence of C string and string.
lhs | C string. | |
rhs | String. |
Definition at line 2084 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator== | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test equivalence of two strings.
lhs | First string. | |
rhs | Second string. |
Definition at line 2072 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator> | ( | const vector< Type, Alloc > & | x, | |
const vector< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator> | ( | const stack< Type, Seq > & | x, | |
const stack< Type, Seq > & | y | |||
) | [inline] |
bool std::operator> | ( | const set< Key, Compare, Alloc > & | x, | |
const set< Key, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator> | ( | const queue< Type, Sequence > & | x, | |
const queue< Type, Sequence > & | y | |||
) | [inline] |
bool std::operator> | ( | const pair< T1, T2 > & | x, | |
const pair< T1, T2 > & | y | |||
) | [inline] |
bool std::operator> | ( | const multiset< Key, Compare, Alloc > & | x, | |
const multiset< Key, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator> | ( | const multimap< Key, Type, Compare, Alloc > & | x, | |
const multimap< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator> | ( | const map< Key, Type, Compare, Alloc > & | x, | |
const map< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator> | ( | const list< Type, Alloc > & | x, | |
const list< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator> | ( | const reverse_iterator< Iterator > & | x, | |
const reverse_iterator< Iterator > & | y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 295 of file stl_iterator.h.
bool std::operator> | ( | const deque< Type, Alloc > & | x, | |
const deque< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator> | ( | const CharT * | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test if C string follows string.
lhs | C string. | |
rhs | String. |
Definition at line 2207 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator> | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const CharT * | __rhs | |||
) | [inline] |
Test if string follows C string.
lhs | String. | |
rhs | C string. |
Definition at line 2195 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator> | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test if string follows string.
lhs | First string. | |
rhs | Second string. |
Definition at line 2183 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
Referenced by operator>().
bool std::operator>= | ( | const vector< Type, Alloc > & | x, | |
const vector< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator>= | ( | const stack< Type, Seq > & | x, | |
const stack< Type, Seq > & | y | |||
) | [inline] |
bool std::operator>= | ( | const set< Key, Compare, Alloc > & | x, | |
const set< Key, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator>= | ( | const queue< Type, Sequence > & | x, | |
const queue< Type, Sequence > & | y | |||
) | [inline] |
bool std::operator>= | ( | const pair< T1, T2 > & | x, | |
const pair< T1, T2 > & | y | |||
) | [inline] |
bool std::operator>= | ( | const multiset< Key, Compare, Alloc > & | x, | |
const multiset< Key, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator>= | ( | const multimap< Key, Type, Compare, Alloc > & | x, | |
const multimap< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator>= | ( | const map< Key, Type, Compare, Alloc > & | x, | |
const map< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
bool std::operator>= | ( | const list< Type, Alloc > & | x, | |
const list< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator>= | ( | const reverse_iterator< Iterator > & | x, | |
const reverse_iterator< Iterator > & | y | |||
) | [inline] |
x | A reverse_iterator. | |
y | A reverse_iterator. |
Definition at line 307 of file stl_iterator.h.
bool std::operator>= | ( | const deque< Type, Alloc > & | x, | |
const deque< Type, Alloc > & | y | |||
) | [inline] |
bool std::operator>= | ( | const CharT * | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test if C string doesn't precede string.
lhs | C string. | |
rhs | String. |
Definition at line 2281 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator>= | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const CharT * | __rhs | |||
) | [inline] |
Test if string doesn't precede C string.
lhs | String. | |
rhs | C string. |
Definition at line 2269 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
bool std::operator>= | ( | const basic_string< CharT, Traits, Alloc > & | __lhs, | |
const basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Test if string doesn't precede string.
lhs | First string. | |
rhs | Second string. |
Definition at line 2257 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::compare().
Referenced by operator>=().
basic_istream<char,Traits>& std::operator>> | ( | basic_istream< char, Traits > & | in, | |
signed char * | s | |||
) | [inline] |
Character string extractors.
in | An input stream. | |
s | A pointer to a character array. |
n
characters and stores them into the array starting at s. n
is defined as:
width()
is greater than zero, n
is width()n
is "the number of elements of the largest array of char_type
that can store a terminating eos
." [27.6.1.2.3]/6Characters are extracted and stored until one of the following happens:
n-1
characters are storedcharT()
)
width(0)
is then called for the input stream.
If no characters are extracted, sets failbit.
basic_istream<char,Traits>& std::operator>> | ( | basic_istream< char, Traits > & | in, | |
unsigned char * | s | |||
) | [inline] |
Character string extractors.
in | An input stream. | |
s | A pointer to a character array. |
n
characters and stores them into the array starting at s. n
is defined as:
width()
is greater than zero, n
is width()n
is "the number of elements of the largest array of char_type
that can store a terminating eos
." [27.6.1.2.3]/6Characters are extracted and stored until one of the following happens:
n-1
characters are storedcharT()
)
width(0)
is then called for the input stream.
If no characters are extracted, sets failbit.
basic_istream<char, Traits>& std::operator>> | ( | basic_istream< char, Traits > & | in, | |
signed char & | c | |||
) | [inline] |
Character extractors.
in | An input stream. | |
c | A character reference. |
basic_istream<char, Traits>& std::operator>> | ( | basic_istream< char, Traits > & | in, | |
unsigned char & | c | |||
) | [inline] |
Character extractors.
in | An input stream. | |
c | A character reference. |
basic_istream<CharT, Traits>& std::operator>> | ( | basic_istream< CharT, Traits > & | __is, | |
complex< Type > & | x | |||
) | [inline] |
Extraction operator for complex values.
Definition at line 481 of file complex.
References std::ios_base::failbit, std::basic_istream< CharT, Traits >::putback(), and std::basic_ios< CharT, Traits >::setstate().
basic_istream<CharT, Traits>& std::operator>> | ( | basic_istream< CharT, Traits > & | __is, | |
bitset< Nb > & | x | |||
) | [inline] |
Global I/O operators for bitsets.
Direct I/O between streams and bitsets is supported. Output is straightforward. Input will skip whitespace, only accept '0' and '1' characters, and will only extract as many digits as the bitset will hold.
Definition at line 1155 of file bitset.
References std::ios_base::badbit, std::basic_string< CharT, Traits, Alloc >::empty(), std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_string< CharT, Traits, Alloc >::push_back(), std::basic_ios< CharT, Traits >::rdbuf(), std::basic_string< CharT, Traits, Alloc >::reserve(), std::basic_streambuf< CharT, Traits >::sbumpc(), std::basic_ios< CharT, Traits >::setstate(), std::basic_streambuf< CharT, Traits >::sputbackc(), and std::basic_ios< CharT, Traits >::widen().
basic_istream< CharT, Traits > & std::operator>> | ( | basic_istream< CharT, Traits > & | in, | |
CharT * | s | |||
) | [inline] |
Character string extractors.
in | An input stream. | |
s | A pointer to a character array. |
n
characters and stores them into the array starting at s. n
is defined as:
width()
is greater than zero, n
is width()n
is "the number of elements of the largest array of char_type
that can store a terminating eos
." [27.6.1.2.3]/6Characters are extracted and stored until one of the following happens:
n-1
characters are storedcharT()
)
width(0)
is then called for the input stream.
If no characters are extracted, sets failbit.
Definition at line 947 of file istream.tcc.
References std::ios_base::badbit, std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::getloc(), std::ios_base::goodbit, max(), std::basic_ios< CharT, Traits >::rdbuf(), std::basic_ios< CharT, Traits >::setstate(), and std::ios_base::width().
basic_istream< CharT, Traits > & std::operator>> | ( | basic_istream< CharT, Traits > & | in, | |
CharT & | c | |||
) | [inline] |
Character extractors.
in | An input stream. | |
c | A character reference. |
Definition at line 920 of file istream.tcc.
References std::ios_base::badbit, std::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_ios< CharT, Traits >::rdbuf(), and std::basic_ios< CharT, Traits >::setstate().
basic_istream< CharT, Traits > & std::operator>> | ( | basic_istream< CharT, Traits > & | __is, | |
basic_string< CharT, Traits, Alloc > & | str | |||
) | [inline] |
Read stream into a string.
is | Input stream. | |
str | Buffer to store into. |
Definition at line 1027 of file istream.tcc.
References std::basic_string< CharT, Traits, Alloc >::append(), std::ios_base::badbit, std::ios_base::eofbit, std::basic_string< CharT, Traits, Alloc >::erase(), std::ios_base::failbit, std::ios_base::getloc(), std::ios_base::goodbit, std::basic_string< CharT, Traits, Alloc >::max_size(), std::basic_ios< CharT, Traits >::rdbuf(), std::basic_ios< CharT, Traits >::setstate(), and std::ios_base::width().
bitset<Nb> std::operator^ | ( | const bitset< Nb > & | x, | |
const bitset< Nb > & | y | |||
) | [inline] |
bitset<Nb> std::operator| | ( | const bitset< Nb > & | x, | |
const bitset< Nb > & | y | |||
) | [inline] |
void std::partial_sort | ( | RandomAccessIterator | first, | |
RandomAccessIterator | __middle, | |||
RandomAccessIterator | last, | |||
Compare | comp | |||
) | [inline] |
Sort the smallest elements of a sequence using a predicate for comparison.
first | An iterator. | |
middle | Another iterator. | |
last | Another iterator. | |
comp | A comparison functor. |
(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 2299 of file stl_algo.h.
References make_heap(), and sort_heap().
void std::partial_sort | ( | RandomAccessIterator | first, | |
RandomAccessIterator | __middle, | |||
RandomAccessIterator | last | |||
) | [inline] |
Sort the smallest elements of a sequence.
(middle-first) elements in the range
[first,last) and moves them to the range
[first,middle). The order of the remaining elements in the range
[middle,last) is undefined. After the sort if i
and are iterators in the range
[first,middle) such that precedes and is an iterator in the range
[middle,last) then *j<*i
and *k<*i
are both false.
Definition at line 2258 of file stl_algo.h.
References make_heap(), and sort_heap().
RandomAccessIterator std::partial_sort_copy | ( | InputIterator | first, | |
InputIterator | last, | |||
RandomAccessIterator | __result_first, | |||
RandomAccessIterator | __result_last, | |||
Compare | comp | |||
) | [inline] |
Copy the smallest elements of a sequence using a predicate for comparison.
first | An input iterator. | |
last | Another input iterator. | |
result_first | A random-access iterator. | |
result_last | Another random-access iterator. | |
comp | A comparison functor. |
[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 2405 of file stl_algo.h.
References make_heap(), and sort_heap().
RandomAccessIterator std::partial_sort_copy | ( | InputIterator | first, | |
InputIterator | last, | |||
RandomAccessIterator | __result_first, | |||
RandomAccessIterator | __result_last | |||
) | [inline] |
Copy the smallest elements of a sequence.
first | An iterator. | |
last | Another iterator. | |
result_first | A random-access iterator. | |
result_last | Another random-access iterator. |
[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 2341 of file stl_algo.h.
References make_heap(), and sort_heap().
OutputIterator std::partial_sum | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result, | |||
BinaryOperation | __binary_op | |||
) | [inline] |
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.
first | Start of input range. | |
last | End of input range. | |
result | Output to write sums to. |
Definition at line 235 of file stl_numeric.h.
OutputIterator std::partial_sum | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result | |||
) | [inline] |
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.
first | Start of input range. | |
last | End of input range. | |
result | Output to write sums to. |
Definition at line 199 of file stl_numeric.h.
ForwardIterator std::partition | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
Predicate | pred | |||
) | [inline] |
Move elements for which a predicate is true to the beginning of a sequence.
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 1858 of file stl_algo.h.
complex< Type > std::polar | ( | const Type & | __rho, | |
const Type & | __theta = 0 | |||
) | [inline] |
void std::pop_heap | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last, | |||
Compare | comp | |||
) | [inline] |
Pop an element off a heap using comparison functor.
first | Start of heap. | |
last | End of heap. | |
comp | Comparison functor to use. |
Definition at line 319 of file stl_heap.h.
void std::pop_heap | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last | |||
) | [inline] |
Pop an element off a heap.
first | Start of heap. | |
last | End of heap. |
Definition at line 253 of file stl_heap.h.
Referenced by std::priority_queue< Type, Sequence, Compare >::pop(), and sort_heap().
complex< Type > std::pow | ( | const Type & | x, | |
const complex< Type > & | y | |||
) | [inline] |
Return x to the y'th power.
Definition at line 724 of file complex.
References std::complex< Type >::imag(), polar(), and std::complex< Type >::real().
complex< Type > std::pow | ( | const complex< Type > & | x, | |
const complex< Type > & | y | |||
) | [inline] |
complex< Type > std::pow | ( | const complex< Type > & | x, | |
const Type & | y | |||
) | [inline] |
Return x to the y'th power.
Definition at line 706 of file complex.
References std::complex< Type >::imag(), polar(), and std::complex< Type >::real().
complex< Type > std::pow | ( | const complex< Type > & | __z, | |
int | n | |||
) | [inline] |
bool std::prev_permutation | ( | BidirectionalIterator | first, | |
BidirectionalIterator | last, | |||
Compare | comp | |||
) | [inline] |
Permute range into the previous "dictionary" ordering using comparison functor.
first | Start of range. | |
last | End of range. | |
comp |
Definition at line 4806 of file stl_algo.h.
References iter_swap(), and reverse().
bool std::prev_permutation | ( | BidirectionalIterator | first, | |
BidirectionalIterator | last | |||
) | [inline] |
Permute range into the previous "dictionary" ordering.
first | Start of range. | |
last | End of range. |
Definition at line 4750 of file stl_algo.h.
References iter_swap(), and reverse().
void std::push_heap | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last, | |||
Compare | comp | |||
) | [inline] |
Push an element onto a heap using comparison functor.
first | Start of heap. | |
last | End of heap + element. | |
comp | Comparison functor. |
Definition at line 189 of file stl_heap.h.
void std::push_heap | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last | |||
) | [inline] |
Push an element onto a heap.
first | Start of heap. | |
last | End of heap + element. |
Definition at line 141 of file stl_heap.h.
Referenced by std::priority_queue< Type, Sequence, Compare >::push().
void std::random_shuffle | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last, | |||
RandomNumberGenerator & | __rand | |||
) | [inline] |
Shuffle the elements of a sequence using a random number generator.
[first,last) using rand
to provide a random distribution. Calling rand(N)
for a positive integer N
should return a randomly chosen integer from the range [0,N).
Definition at line 1764 of file stl_algo.h.
References iter_swap().
void std::random_shuffle | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last | |||
) | [inline] |
Randomly shuffle the elements of a sequence.
[first,last) using a random distribution, so that every possible ordering of the sequence is equally likely.
Definition at line 1737 of file stl_algo.h.
References iter_swap().
ForwardIterator std::remove | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
const Type & | value | |||
) | [inline] |
Remove elements from a sequence.
value
are removed from the range
[first,last).remove() is stable, so the relative order of elements that are not removed is unchanged.
Elements between the end of the resulting sequence and last
are still present, but their value is unspecified.
Definition at line 1100 of file stl_algo.h.
References remove_copy().
OutputIterator std::remove_copy | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result, | |||
const Type & | value | |||
) | [inline] |
Copy a sequence, removing elements of a given value.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
value | The value to be removed. |
[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 std::remove_copy_if | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result, | |||
Predicate | pred | |||
) | [inline] |
Copy a sequence, removing elements for which a predicate is true.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
pred | A predicate. |
[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 std::remove_if | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
Predicate | pred | |||
) | [inline] |
Remove elements from a sequence using a predicate.
pred
returns true are removed from the range
[first,last).remove_if() is stable, so the relative order of elements that are not removed is unchanged.
Elements between the end of the resulting sequence and last
are still present, but their value is unspecified.
Definition at line 1135 of file stl_algo.h.
References remove_copy_if().
void std::replace | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
const Type & | __old_value, | |||
const Type & | new_value | |||
) | [inline] |
Replace each occurrence of one value in a sequence with another value.
first | A forward iterator. | |
last | A forward iterator. | |
old_value | The value to be replaced. | |
new_value | The replacement value. |
i
in the range
[first,last) if *i
== old_value
then the assignment *i
= new_value
is performed.
Definition at line 844 of file stl_algo.h.
OutputIterator std::replace_copy | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result, | |||
const Type & | __old_value, | |||
const Type & | new_value | |||
) | [inline] |
Copy a sequence, replacing each element of one value with another value.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
old_value | The value to be replaced. | |
new_value | The replacement value. |
result+
(last-first).
[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 std::replace_copy_if | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result, | |||
Predicate | pred, | |||
const Type & | new_value | |||
) | [inline] |
Copy a sequence, replacing each value for which a predicate returns true with another value.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
pred | A predicate. | |
new_value | The replacement value. |
result+
(last-first).
[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 std::replace_if | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
Predicate | pred, | |||
const Type & | new_value | |||
) | [inline] |
Replace each value in a sequence for which a predicate returns true with another value.
first | A forward iterator. | |
last | A forward iterator. | |
pred | A predicate. | |
new_value | The replacement value. |
i
in the range
[first,last) if pred(*i)
is true then the assignment *i
= new_value
is performed.
Definition at line 875 of file stl_algo.h.
Resetiosflags std::resetiosflags | ( | ios_base::fmtflags | __mask | ) | [inline] |
void std::return_temporary_buffer | ( | Type * | __p | ) | [inline] |
The companion to get_temporary_buffer().
p | A buffer previously allocated by get_temporary_buffer. |
void std::reverse | ( | BidirectionalIterator | first, | |
BidirectionalIterator | last | |||
) | [inline] |
Reverse a sequence.
[first,last), so that the first element becomes the last etc. For every i
such that 0<=i<=
(last-first)/2), reverse()
swaps *
(first+i) and *
(last-(i+1))
Definition at line 1453 of file stl_algo.h.
Referenced by next_permutation(), and prev_permutation().
OutputIterator std::reverse_copy | ( | BidirectionalIterator | first, | |
BidirectionalIterator | last, | |||
OutputIterator | __result | |||
) | [inline] |
Copy a sequence, reversing its elements.
first | A bidirectional iterator. | |
last | A bidirectional iterator. | |
result | An output iterator. |
[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 1479 of file stl_algo.h.
ios_base& std::right | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::right, ios_base::adjustfield).
Definition at line 919 of file ios_base.h.
References std::ios_base::adjustfield, std::ios_base::right, and std::ios_base::setf().
void std::rotate | ( | ForwardIterator | first, | |
ForwardIterator | __middle, | |||
ForwardIterator | last | |||
) | [inline] |
Rotate the elements of a sequence.
[first,last) by
(middle-first) positions so that the element at middle
is moved to first
, the element at middle+1
is moved to +1 and so on for each element in the range
[first,last).
This effectively swaps the ranges [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 1679 of file stl_algo.h.
OutputIterator std::rotate_copy | ( | ForwardIterator | first, | |
ForwardIterator | __middle, | |||
ForwardIterator | last, | |||
OutputIterator | __result | |||
) | [inline] |
Copy a sequence, rotating its elements.
first | A forward iterator. | |
middle | A forward iterator. | |
last | A forward iterator. | |
result | An output iterator. |
[first,last) to the range beginning at
(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).
*
(result+(n+(last-middle))%(last-first))=*(first+n) for each n
in the range
[0,last-first).
Definition at line 1712 of file stl_algo.h.
ios_base& std::scientific | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::scientific, ios_base::floatfield).
Definition at line 961 of file ios_base.h.
References std::ios_base::floatfield, std::ios_base::scientific, and std::ios_base::setf().
ForwardIterator1 std::search | ( | ForwardIterator1 | first1, | |
ForwardIterator1 | last1, | |||
ForwardIterator2 | first2, | |||
ForwardIterator2 | last2, | |||
BinaryPredicate | predicate | |||
) | [inline] |
Search a sequence for a matching sub-sequence using a predicate.
first1 | A forward iterator. | |
last1 | A forward iterator. | |
first2 | A forward iterator. | |
last2 | A forward iterator. | |
predicate | A binary predicate. |
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.
[first1,last1) for a sub-sequence that compares equal value-by-value with the sequence given by
[first2,last2), using predicate
to determine equality, and returns an iterator to the first element of the sub-sequence, or last1
if no such iterator exists.
Definition at line 548 of file stl_algo.h.
ForwardIterator1 std::search | ( | ForwardIterator1 | first1, | |
ForwardIterator1 | last1, | |||
ForwardIterator2 | first2, | |||
ForwardIterator2 | last2 | |||
) | [inline] |
Search a sequence for a matching sub-sequence.
first1 | A forward iterator. | |
last1 | A forward iterator. | |
first2 | A forward iterator. | |
last2 | A forward 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.
[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.
ForwardIterator std::search_n | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
Integer | count, | |||
const Type & | __val, | |||
BinaryPredicate | __binary_pred | |||
) | [inline] |
Search a sequence for a number of consecutive values using a predicate.
first | A forward iterator. | |
last | A forward iterator. | |
count | The number of consecutive values. | |
val | The value to find. | |
binary_pred | A binary predicate. |
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.
[first,last) for count
consecutive elements for which the predicate returns true.
Definition at line 678 of file stl_algo.h.
ForwardIterator std::search_n | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
Integer | count, | |||
const Type & | __val | |||
) | [inline] |
Search a sequence for a number of consecutive values.
first | A forward iterator. | |
last | A forward iterator. | |
count | The number of consecutive values. | |
val | The value to find. |
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.
[first,last) for count
consecutive elements equal to val
.
Definition at line 625 of file stl_algo.h.
new_handler std::set_new_handler | ( | new_handler | ) | throw () |
Takes a replacement handler as the argument, returns the previous handler.
terminate_handler std::set_terminate | ( | terminate_handler | ) | throw () |
Takes a new handler function as an argument, returns the old function.
unexpected_handler std::set_unexpected | ( | unexpected_handler | ) | throw () |
Takes a new handler function as an argument, returns the old function.
Setbase std::setbase | ( | int | __base | ) | [inline] |
Manipulator for setf
.
base | A numeric base. |
ios_base::basefield
flags to oct
, dec
, or hex
when base is 8, 10, or 16, accordingly, and to 0 if base is any other value.
Setfill<CharT> std::setfill | ( | CharT | c | ) | [inline] |
Setiosflags std::setiosflags | ( | ios_base::fmtflags | __mask | ) | [inline] |
Setprecision std::setprecision | ( | int | n | ) | [inline] |
Setw std::setw | ( | int | n | ) | [inline] |
ios_base& std::showbase | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showbase).
Definition at line 806 of file ios_base.h.
References std::ios_base::setf(), and std::ios_base::showbase.
ios_base& std::showpoint | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showpoint).
Definition at line 822 of file ios_base.h.
References std::ios_base::setf(), and std::ios_base::showpoint.
ios_base& std::showpos | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::showpos).
Definition at line 838 of file ios_base.h.
References std::ios_base::setf(), and std::ios_base::showpos.
complex< Type > std::sin | ( | const complex< Type > & | __z | ) | [inline] |
Return complex sine of z.
Definition at line 645 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
complex< Type > std::sinh | ( | const complex< Type > & | __z | ) | [inline] |
Return complex hyperbolic sine of z.
Definition at line 654 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
ios_base& std::skipws | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::skipws).
Definition at line 854 of file ios_base.h.
References std::ios_base::setf(), and std::ios_base::skipws.
void std::sort | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last, | |||
Compare | comp | |||
) | [inline] |
Sort the elements of a sequence using a predicate for comparison.
[first,last) in ascending order, such that comp
(*(i+1),*i) is false for every iterator i
in the range
[first,last-1).
The relative ordering of equivalent elements is not preserved, use stable_sort()
if this is needed.
Definition at line 2574 of file stl_algo.h.
void std::sort | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last | |||
) | [inline] |
Sort the elements of a sequence.
[first,last) in ascending order, such that *
(i+1)<*i is false for each iterator i
in the range
[first,last-1).
The relative ordering of equivalent elements is not preserved, use stable_sort()
if this is needed.
Definition at line 2540 of file stl_algo.h.
void std::sort_heap | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last, | |||
Compare | comp | |||
) | [inline] |
Sort a heap using comparison functor.
first | Start of heap. | |
last | End of heap. | |
comp | Comparison functor to use. |
Definition at line 448 of file stl_heap.h.
References pop_heap().
void std::sort_heap | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last | |||
) | [inline] |
Sort a heap.
first | Start of heap. | |
last | End of heap. |
Definition at line 422 of file stl_heap.h.
References pop_heap().
Referenced by partial_sort(), and partial_sort_copy().
complex< Type > std::sqrt | ( | const complex< Type > & | __z | ) | [inline] |
Return complex square root of z.
Definition at line 663 of file complex.
References std::complex< Type >::imag(), and std::complex< Type >::real().
ForwardIterator std::stable_partition | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
Predicate | pred | |||
) | [inline] |
Move elements for which a predicate is true to the beginning of a sequence, preserving relative ordering.
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).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 1969 of file stl_algo.h.
void std::stable_sort | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last, | |||
Compare | comp | |||
) | [inline] |
Sort the elements of a sequence using a predicate for comparison, preserving the relative order of equivalent elements.
[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 3641 of file stl_algo.h.
void std::stable_sort | ( | RandomAccessIterator | first, | |
RandomAccessIterator | last | |||
) | [inline] |
Sort the elements of a sequence, preserving the relative order of equivalent elements.
[first,last) in ascending order, such that *
(i+1)<*i is false for each iterator i
in the range
[first,last-1).
The relative ordering of equivalent elements is preserved, so any two elements 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 3600 of file stl_algo.h.
void std::swap | ( | vector< Type, Alloc > & | x, | |
vector< Type, Alloc > & | y | |||
) | [inline] |
See std::vector::swap().
Definition at line 928 of file stl_vector.h.
References std::vector< Type, Alloc >::swap(), and swap().
void std::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 std::set< Key, Compare, Alloc >::swap(), and swap().
void std::swap | ( | multiset< Key, Compare, Alloc > & | x, | |
multiset< Key, Compare, Alloc > & | y | |||
) | [inline] |
Definition at line 579 of file stl_multiset.h.
References std::multiset< Key, Compare, Alloc >::swap(), and swap().
void std::swap | ( | multimap< Key, Type, Compare, Alloc > & | x, | |
multimap< Key, Type, Compare, Alloc > & | y | |||
) | [inline] |
Definition at line 672 of file stl_multimap.h.
References std::multimap< Key, Type, Compare, Alloc >::swap(), and swap().
void std::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 std::map< Key, Type, Compare, Alloc >::swap(), and swap().
void std::swap | ( | list< Type, Alloc > & | x, | |
list< Type, Alloc > & | y | |||
) | [inline] |
See std::list::swap().
Definition at line 1250 of file stl_list.h.
References std::list< Type, Alloc >::swap(), and swap().
void std::swap | ( | deque< Type, Alloc > & | x, | |
deque< Type, Alloc > & | y | |||
) | [inline] |
See std::deque::swap().
Definition at line 1497 of file stl_deque.h.
References std::deque< Type, Alloc >::swap().
void std::swap | ( | Type & | a, | |
Type & | __b | |||
) | [inline] |
Swaps two values.
a | A thing of arbitrary type. | |
b | Another thing of arbitrary type. |
Definition at line 125 of file stl_algobase.h.
void std::swap | ( | basic_string< CharT, Traits, Alloc > & | __lhs, | |
basic_string< CharT, Traits, Alloc > & | __rhs | |||
) | [inline] |
Swap contents of two strings.
lhs | First string. | |
rhs | Second string. |
Definition at line 2294 of file basic_string.h.
References std::basic_string< CharT, Traits, Alloc >::swap().
Referenced by __gnu_debug::Safe_sequence_base::M_swap(), std::vector< Type, Allocator >::swap(), std::set< Key, Compare, Allocator >::swap(), std::multiset< Key, Compare, Allocator >::swap(), std::multimap< Key, Type, Compare, Allocator >::swap(), std::map< Key, Type, Compare, Allocator >::swap(), swap(), std::list< Type, Allocator >::swap(), and std::deque< Type, Allocator >::swap().
ForwardIterator2 std::swap_ranges | ( | ForwardIterator1 | first1, | |
ForwardIterator1 | last1, | |||
ForwardIterator2 | first2 | |||
) | [inline] |
Swap the elements of two sequences.
first2+
(last1-first1).
[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().
complex< Type > std::tan | ( | const complex< Type > & | __z | ) | [inline] |
complex< Type > std::tanh | ( | const complex< Type > & | __z | ) | [inline] |
void std::terminate | ( | ) |
The runtime will call this function if exception handling must be abandoned for any reason. It can also be called by the user.
CharT std::tolower | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
CharT std::toupper | ( | CharT | c, | |
const locale & | __loc | |||
) | [inline] |
OutputIterator std::transform | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
OutputIterator | __result, | |||
BinaryOperation | __binary_op | |||
) | [inline] |
Perform an operation on corresponding elements of two sequences.
first1 | An input iterator. | |
last1 | An input iterator. | |
first2 | An input iterator. | |
result | An output iterator. | |
binary_op | A binary operator. |
result+
(last-first).*
(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 std::transform | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result, | |||
UnaryOperation | __unary_op | |||
) | [inline] |
Perform an operation on a sequence.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
unary_op | A unary operator. |
result+
(last-first).*
(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 std::uncaught_exception | ( | ) | throw () |
[18.6.4]/1: "Returns true after completing evaluation of a throw-expression until either completing initialization of the exception-declaration in the matching handler or entering unexpected()
due to the throw; or after entering terminate()
for any reason other than an explicit call to terminate()
. [Note: This includes stack unwinding [15.2]. end note]"
2: "When uncaught_exception()
is true, throwing an exception can result in a call of terminate()
(15.5.1)."
Referenced by std::basic_ostream< CharT, Traits >::sentry::~sentry().
void std::unexpected | ( | ) |
The runtime will call this function if an exception is thrown which violates the function's exception specification.
ForwardIterator std::uninitialized_copy | ( | InputIterator | first, | |
InputIterator | last, | |||
ForwardIterator | __result | |||
) | [inline] |
Copies the range [first,last) into result.
Definition at line 107 of file stl_uninitialized.h.
Referenced by std::deque< Type, Allocator >::deque(), std::vector< Type, Alloc >::operator=(), and std::vector< Type, Allocator >::vector().
void std::uninitialized_fill | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
const Type & | x | |||
) | [inline] |
Copies the value x into the range [first,last).
Definition at line 169 of file stl_uninitialized.h.
ForwardIterator std::uninitialized_fill_n | ( | ForwardIterator | first, | |
Size | n, | |||
const Type & | x | |||
) | [inline] |
Copies the value x into the range [first,first+n).
first | An input iterator. | |
n | The number of copies to make. | |
x | The source value. |
Definition at line 215 of file stl_uninitialized.h.
Referenced by std::vector< Type, Allocator >::vector().
ForwardIterator std::unique | ( | ForwardIterator | first, | |
ForwardIterator | last, | |||
BinaryPredicate | __binary_pred | |||
) | [inline] |
Remove consecutive values from a sequence using a predicate.
binary_pred
returns true. unique() is stable, so the relative order of elements that are not removed is unchanged. Elements between the end of the resulting sequence and last
are still present, but their value is unspecified.
Definition at line 1380 of file stl_algo.h.
References adjacent_find().
ForwardIterator std::unique | ( | ForwardIterator | first, | |
ForwardIterator | last | |||
) | [inline] |
Remove consecutive duplicate values from a sequence.
last
are still present, but their value is unspecified.
Definition at line 1341 of file stl_algo.h.
References adjacent_find().
OutputIterator std::unique_copy | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result, | |||
BinaryPredicate | __binary_pred | |||
) | [inline] |
Copy a sequence, removing consecutive values using a predicate.
first | An input iterator. | |
last | An input iterator. | |
result | An output iterator. | |
binary_pred | A binary predicate. |
[first,last) to the range beginning at result
, except that only the first element is copied from groups of consecutive elements for which binary_pred
returns true. unique_copy() is stable, so the relative order of elements that are copied is unchanged.
Definition at line 1308 of file stl_algo.h.
OutputIterator std::unique_copy | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | __result | |||
) | [inline] |
Copy a sequence, removing consecutive duplicate values.
[first,last) to the range beginning at result
, except that only the first element is copied from groups of consecutive elements that compare equal. unique_copy() is stable, so the relative order of elements that are copied is unchanged.
Definition at line 1272 of file stl_algo.h.
ios_base& std::unitbuf | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::unitbuf).
Definition at line 886 of file ios_base.h.
References std::ios_base::setf(), and std::ios_base::unitbuf.
ios_base& std::uppercase | ( | ios_base & | __base | ) | [inline] |
Calls base.setf(ios_base::uppercase).
Definition at line 870 of file ios_base.h.
References std::ios_base::setf(), and std::ios_base::uppercase.
const Facet & std::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.
std::bad_cast | if locale doesn't contain a facet of type Facet. |
Definition at line 107 of file locale_facets.tcc.
basic_istream< CharT, Traits > & std::ws | ( | basic_istream< CharT, Traits > & | __is | ) | [inline] |
Quick and easy way to eat whitespace.
This manipulator extracts whitespace characters, stopping when the next character is non-whitespace, or when the input sequence is empty. If the sequence is empty, eofbit
is set in the stream, but not failbit
.
The current locale is used to distinguish whitespace characters.
Example:
MyClass mc; std::cin >> std::ws >> mc;
Definition at line 1003 of file istream.tcc.
References std::ios_base::eofbit, std::ios_base::getloc(), std::basic_ios< CharT, Traits >::rdbuf(), and std::basic_ios< CharT, Traits >::setstate().
Linked to standard error (unbuffered).
Definition at line 62 of file globals_io.cc.
Referenced by std::ios_base::sync_with_stdio().
Linked to standard input.
Definition at line 60 of file globals_io.cc.
Referenced by std::ios_base::sync_with_stdio().
Linked to standard error (buffered).
Definition at line 63 of file globals_io.cc.
Referenced by std::ios_base::sync_with_stdio().
Linked to standard output.
Definition at line 61 of file globals_io.cc.
Referenced by std::ios_base::sync_with_stdio().