class exception

Base class for all library exceptions. class bad_exception

class bad_alloc

Exception possibly thrown by new. struct nothrow_t

class type_info

Part of RTTI. class bad_cast

Thrown during incorrect typecasting. class bad_typeid

class strstreambuf

class istrstream

class ostrstream

class strstream

class allocator< void >

class allocator

The 'standard' allocator, as per [20.4]. class basic_ios

Virtual base class for all stream classes. class basic_string

Managing sequences of characters and character-like objects. struct char_traits

Basis for explicit traits specializations. struct char_traits< char >

21.1.3.1 char_traits specializations struct Char_traits_match

struct are_same

struct are_same< Type, Type >

struct __enable_if

struct __enable_if< Type, true >

struct __is_void

struct __is_void< void >

struct __is_integer

struct __is_integer< bool >

struct __is_integer< char >

struct __is_integer< signed char >

struct __is_integer< unsigned char >

struct __is_integer< short >

struct __is_integer< unsigned short >

struct __is_integer< int >

struct __is_integer< unsigned int >

struct __is_integer< long >

struct __is_integer< unsigned long >

struct __is_integer< long long >

struct __is_integer< unsigned long long >

struct __is_floating

struct __is_floating< float >

struct __is_floating< double >

struct __is_floating< long double >

struct __is_arithmetic

struct __is_fundamental

struct __is_pod

class gslice

Class defining multi-dimensional subset of an array. class gslice_array

Reference to multi-dimensional subset of an array. class indirect_array

Reference to arbitrary subset of an array. class ios_base

The very top of the I/O class hierarchy. class locale

Container class for localization functionality. struct __pad

class ctype_abstract_base

Common base for ctype facet. class ctype

Template ctype facet. class ctype< char >

The ctype<char> specialization. class ctype_byname

class num_base

struct numpunct_cache

class numpunct

Numpunct facet. class numpunct_byname

class num_get

Facet for parsing number strings. class num_put

Facet for converting numbers to strings. class collate

Facet for localized string comparison. class collate_byname

class time_base

Time format ordering data. struct __timepunct_cache

class __timepunct

class time_get

Facet for parsing dates and times. class time_get_byname

class time_put

Facet for outputting dates and times. class time_put_byname

class money_base

Money format ordering data. struct __moneypunct_cache

class moneypunct

Facet for formatting data for money amounts. class moneypunct_byname

class money_get

Facet for parsing monetary amounts. class money_put

Facet for outputting monetary amounts. struct messages_base

Messages facet base class providing catalog typedef. class messages

Facet for handling message catalogs. class messages_byname

struct __use_cache

struct __use_cache< numpunct_cache< CharT > >

struct __use_cache< __moneypunct_cache< CharT, Intl > >

class mask_array

Reference to selected subset of an array. class fpos

Class representing stream positions. class slice

Class defining one-dimensional subset of an array. class slice_array

Reference to one-dimensional subset of an array. struct copy_backward_dispatch

struct copy_backward_dispatch< Type *, Type *, __true_type >

struct copy_backward_dispatch< const Type *, Type *, __true_type >

struct Bit_reference

struct Bit_iterator_base

struct Bit_iterator

struct Bit_const_iterator

class Bvector_base

class vector< bool, Alloc >

A specialization of vector for booleans which offers fixed time access to individual elements in any order. struct Deque_iterator

A deque::iterator. class Deque_base

class deque

A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end. struct unary_function

struct binary_function

struct plus

One of the math functors. struct minus

One of the math functors. struct multiplies

One of the math functors. struct divides

One of the math functors. struct modulus

One of the math functors. struct negate

One of the math functors. struct equal_to

One of the comparison functors. struct not_equal_to

One of the comparison functors. struct greater

One of the comparison functors. struct less

One of the comparison functors. struct greater_equal

One of the comparison functors. struct less_equal

One of the comparison functors. struct logical_and

One of the Boolean operations functors. struct logical_or

One of the Boolean operations functors. struct logical_not

One of the Boolean operations functors. class unary_negate

One of the negation functors. class binary_negate

One of the negation functors. class binder1st

One of the binder functors. class binder2nd

One of the binder functors. class pointer_to_unary_function

One of the adaptors for function pointers. class pointer_to_binary_function

One of the adaptors for function pointers. struct Identity

struct Select1st

struct Select2nd

class mem_fun_t

One of the adaptors for member pointers. class const_mem_fun_t

One of the adaptors for member pointers. class mem_fun_ref_t

One of the adaptors for member pointers. class const_mem_fun_ref_t

One of the adaptors for member pointers. class mem_fun1_t

One of the adaptors for member pointers. class const_mem_fun1_t

One of the adaptors for member pointers. class mem_fun1_ref_t

One of the adaptors for member pointers. class const_mem_fun1_ref_t

One of the adaptors for member pointers. class mem_fun_t< void, Type >

One of the adaptors for member pointers. class const_mem_fun_t< void, Type >

One of the adaptors for member pointers. class mem_fun_ref_t< void, Type >

One of the adaptors for member pointers. class const_mem_fun_ref_t< void, Type >

One of the adaptors for member pointers. class mem_fun1_t< void, Type, Arg >

One of the adaptors for member pointers. class const_mem_fun1_t< void, Type, Arg >

One of the adaptors for member pointers. class mem_fun1_ref_t< void, Type, Arg >

One of the adaptors for member pointers. class const_mem_fun1_ref_t< void, Type, Arg >

One of the adaptors for member pointers. class reverse_iterator

class back_insert_iterator

Turns assignment into insertion. class front_insert_iterator

Turns assignment into insertion. class insert_iterator

Turns assignment into insertion. struct input_iterator_tag

Marking input iterators. struct output_iterator_tag

Marking output iterators. struct forward_iterator_tag

Forward iterators support a superset of input iterator operations. struct bidirectional_iterator_tag

operations. struct random_access_iterator_tag

operations. struct iterator

Common iterator class. struct iterator_traits

struct iterator_traits< Type * >

struct iterator_traits< const Type * >

struct List_node_base

struct List_node

struct List_iterator

A list::iterator. struct List_const_iterator

A list::const_iterator. class List_base

class list

A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence. class map

A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. class multimap

A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. class multiset

A standard container made up of elements, which can be retrieved in logarithmic time. struct pair

pair holds two objects of arbitrary type. class queue

A standard container giving FIFO behavior. class priority_queue

A standard container automatically sorting its contents. class raw_storage_iterator

class set

A standard container made up of unique keys, which can be retrieved in logarithmic time. class stack

A standard container giving FILO behavior. class Temporary_buffer

struct Rb_tree_node_base

struct Rb_tree_node

struct Rb_tree_iterator

struct Rb_tree_const_iterator

class Rb_tree

struct Vector_base

class vector

A standard container which offers fixed time access to individual elements in any order. class istream_iterator

Provides input iterator semantics for streams. class ostream_iterator

Provides output iterator semantics for streams. class istreambuf_iterator

Provides input iterator semantics for streambufs. class ostreambuf_iterator

Provides output iterator semantics for streambufs. class GBase

class GBase< Array< Type > >

struct GClos< Expr, Dom >

struct GClos< ValArray, Type >

class IBase

struct IClos< Expr, Dom >

struct IClos< ValArray, Type >

class Expr

struct Array_default_ctor

struct Array_default_ctor< Type, true >

struct Array_init_ctor

struct Array_init_ctor< Type, true >

struct Array_copy_ctor

struct Array_copy_ctor< Type, true >

struct Array_copier

struct Array_copier< Type, true >

struct Array

struct abs

struct cos

struct acos

struct cosh

struct sin

struct asin

struct sinh

struct __tan

struct atan

struct __tanh

struct __exp

struct __log

struct __log10

struct sqrt

struct __unary_plus

struct __bitwise_not

struct __plus

struct __minus

struct __multiplies

struct __divides

struct __modulus

struct __bitwise_xor

struct __bitwise_and

struct __bitwise_or

struct shift_left

struct shift_right

struct __logical_and

struct __logical_or

struct __logical_not

struct __equal_to

struct __less

struct __greater

struct __less_equal

struct __greater_equal

struct atan2

struct __pow

struct __fun

struct __fun< __logical_not, Type >

struct __fun< __logical_and, Type >

struct __fun< __logical_or, Type >

struct __fun< __less, Type >

struct __fun< __greater, Type >

struct __fun< __less_equal, Type >

struct __fun< __greater_equal, Type >

struct __fun< __equal_to, Type >

struct __fun< not_equal_to, Type >

class FunBase

struct ValFunClos< Expr, Dom >

struct ValFunClos< ValArray, Type >

struct RefFunClos< Expr, Dom >

struct RefFunClos< ValArray, Type >

class UnBase

struct UnClos< Oper, Expr, Dom >

struct UnClos< Oper, ValArray, Type >

class BinBase

class BinBase2

class BinBase1

struct BinClos< Oper, Expr, Expr, Dom1, Dom2 >

struct BinClos< Oper, ValArray, ValArray, Type, Type >

struct BinClos< Oper, ValArray, Constant, Type, Type >

struct BinClos< Oper, Constant, ValArray, Type, Type >

class SBase

class SBase< Array< Type > >

struct SClos< Expr, Dom >

struct SClos< ValArray, Type >

struct Base_bitset

struct Base_bitset< 1 >

struct Base_bitset< 0 >

struct Sanitize

struct Sanitize< 0 >

class bitset

The bitset class represents a fixed-size sequence of bits. class complex

struct Norm_helper

struct Norm_helper< true >

class complex< float >

class complex< double >

class complex< long double >

class basic_filebuf

The actual work of input and output (for files). class basic_ifstream

Controlling input for files. class basic_ofstream

Controlling output for files. class basic_fstream

Controlling intput and output for files. class __basic_file< char >

struct __ios_flags

struct Resetiosflags

struct Setiosflags

struct Setbase

struct Setfill

struct Setprecision

struct Setw

class basic_istream

Controlling input. class basic_iostream

Merging istream and ostream capabilities. struct numeric_limits_base

Part of std::numeric_limits. struct numeric_limits

Properties of fundamental types. struct numeric_limits< bool >

struct numeric_limits< char >

struct numeric_limits< signed char >

struct numeric_limits< unsigned char >

struct numeric_limits< wchar_t >

struct numeric_limits< short >

struct numeric_limits< unsigned short >

struct numeric_limits< int >

struct numeric_limits< unsigned int >

struct numeric_limits< long >

struct numeric_limits< unsigned long >

struct numeric_limits< long long >

struct numeric_limits< unsigned long long >

struct numeric_limits< float >

struct numeric_limits< double >

struct numeric_limits< long double >

struct auto_ptr_ref

class auto_ptr

A simple smart pointer providing strict ownership semantics. class basic_ostream

Controlling output. class basic_stringbuf

The actual work of input and output (for std::string). class basic_istringstream

Controlling input for std::string. class basic_ostringstream

Controlling output for std::string. class basic_stringstream

Controlling input and output for std::string. class logic_error

One of two subclasses of exception. class domain_error

class invalid_argument

class length_error

class out_of_range

class runtime_error

One of two subclasses of exception. class range_error

class overflow_error

class underflow_error

class basic_streambuf

The actual work of input and output (interface). class valarray

Smart array designed to support numeric processing. struct BinClos< Oper, Expr, ValArray, Dom, typename Dom::value_type >

struct BinClos< Oper, ValArray, Expr, typename Dom::value_type, Dom >

struct BinClos< Oper, Expr, Constant, Dom, typename Dom::value_type >

struct BinClos< Oper, Constant, Expr, typename Dom::value_type, Dom >

class insert_iterator< __gnu_cxx::hash_map< Key, Type, HashFn, EqKey, Alloc > >

class insert_iterator< __gnu_cxx::hash_multimap< Key, Type, HashFn, EqKey, Alloc > >

class insert_iterator< __gnu_cxx::hash_set< Value, HashFcn, EqualKey, Alloc > >

class insert_iterator< __gnu_cxx::hash_multiset< Value, HashFcn, EqualKey, Alloc > >

struct char_traits< __gnu_cxx::character< V, I, S > >

class insert_iterator< __gnu_cxx::slist< Type, Alloc > >

namespace rel_ops

The generated relational operators are sequestered here.

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.

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

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

Linked to standard input. ostream cout

Linked to standard output. ostream cerr

Linked to standard error (unbuffered). ostream clog

Linked to standard error (buffered).

typedef char fake_istream[sizeof(istream)] attribute__ ((aligned(alignof__(istream))))

typedef char fake_ostream[sizeof(ostream)] attribute__ ((aligned(alignof__(ostream))))

typedef basic_string< C > S

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 unsigned long Bit_type

typedef basic_string< char > string

typedef __gthread_mutex_t c_lock

typedef FILE c_file

typedef __locale_t c_locale

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 .

enum IosFmtflags

enum IosOpenmode

enum IosIostate

enum IosSeekdir

enum

enum

enum

enum Rb_tree_color

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. enum float_denorm_style { denorm_indeterminate, denorm_absent, denorm_present }

Describes the denormalization for floating-point types.

void __throw_bad_exception (void)

void __throw_bad_alloc (void)

void __throw_bad_cast (void)

void __throw_bad_typeid (void)

void __throw_logic_error (const char *)

void __throw_domain_error (const char *)

void __throw_invalid_argument (const char *)

void __throw_length_error (const char *)

void __throw_out_of_range (const char *)

void __throw_runtime_error (const char *)

void __throw_range_error (const char *)

void __throw_overflow_error (const char *)

void __throw_underflow_error (const char *)

void __throw_ios_failure (const char *)

Rb_tree_node_base * Rb_tree_increment (Rb_tree_node_base *x)

const Rb_tree_node_base * Rb_tree_increment (const Rb_tree_node_base *x)

Rb_tree_node_base * Rb_tree_decrement (Rb_tree_node_base *x)

const Rb_tree_node_base * Rb_tree_decrement (const Rb_tree_node_base *x)

void Rb_tree_rotate_left (Rb_tree_node_base *const x, Rb_tree_node_base *&__root)

void Rb_tree_rotate_right (Rb_tree_node_base *const x, Rb_tree_node_base *&__root)

void Rb_tree_insert_and_rebalance (const bool insert_left, Rb_tree_node_base *x, Rb_tree_node_base *__p, Rb_tree_node_base &__header)

Rb_tree_node_base * Rb_tree_rebalance_for_erase (Rb_tree_node_base *const __z, Rb_tree_node_base &__header)

unsigned int Rb_tree_black_count (const Rb_tree_node_base *node, const Rb_tree_node_base *__root)

size_t __valarray_product (const valarray< size_t > &a)

void __gslice_to_index (size_t __o, const valarray< size_t > &__l, const valarray< size_t > &s, valarray< size_t > &__i)

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 T1, typename T2> bool operator== (const allocator< T1 > &, const allocator< T2 > &)

template<typename T1, typename T2> bool operator!= (const allocator< T1 > &, const allocator< T2 > &)

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. template<typename Type> bool __is_null_pointer (Type *__ptr)

template<typename Type> bool __is_null_pointer (Type)

template<typename Type> Type cmath_power (Type x, unsigned int n)

IosFmtflags operator & (IosFmtflags a, IosFmtflags __b)

IosFmtflags operator| (IosFmtflags a, IosFmtflags __b)

IosFmtflags operator^ (IosFmtflags a, IosFmtflags __b)

IosFmtflags & operator|= (IosFmtflags &a, IosFmtflags __b)

IosFmtflags & operator &= (IosFmtflags &a, IosFmtflags __b)

IosFmtflags & operator^= (IosFmtflags &a, IosFmtflags __b)

IosFmtflags operator~ (IosFmtflags a)

IosOpenmode operator & (IosOpenmode a, IosOpenmode __b)

IosOpenmode operator| (IosOpenmode a, IosOpenmode __b)

IosOpenmode operator^ (IosOpenmode a, IosOpenmode __b)

IosOpenmode & operator|= (IosOpenmode &a, IosOpenmode __b)

IosOpenmode & operator &= (IosOpenmode &a, IosOpenmode __b)

IosOpenmode & operator^= (IosOpenmode &a, IosOpenmode __b)

IosOpenmode operator~ (IosOpenmode a)

IosIostate operator & (IosIostate a, IosIostate __b)

IosIostate operator| (IosIostate a, IosIostate __b)

IosIostate operator^ (IosIostate a, IosIostate __b)

IosIostate & operator|= (IosIostate &a, IosIostate __b)

IosIostate & operator &= (IosIostate &a, IosIostate __b)

IosIostate & operator^= (IosIostate &a, IosIostate __b)

IosIostate operator~ (IosIostate a)

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 CharT> CharT * add_grouping (CharT *s, CharT sep, const char *__gbeg, size_t __gsize, const CharT *first, const CharT *last)

template<typename CharT> ostreambuf_iterator< CharT > __write (ostreambuf_iterator< CharT > s, const CharT *__ws, int __len)

template<typename CharT, typename OutIter> OutIter __write (OutIter s, const CharT *__ws, int __len)

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. static bool __verify_grouping (const char *__grouping, size_t __grouping_size, const string &__grouping_tmp)

template<typename CharT> int int_to_char (CharT *__bufend, long __v, const CharT *__lit, ios_base::fmtflags __flags)

template<typename CharT> int int_to_char (CharT *__bufend, unsigned long __v, const CharT *__lit, ios_base::fmtflags __flags)

template<typename CharT, typename ValueT> int int_to_char (CharT *__bufend, ValueT __v, const CharT *__lit, ios_base::fmtflags __flags, bool neg)

template<typename Facet> const Facet & check_facet (const Facet *__f)

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, input_iterator_tag)

template<typename InputIterator, typename Predicate> InputIterator find_if (InputIterator first, InputIterator last, Predicate pred, input_iterator_tag)

template<typename RandomAccessIterator, typename Type> RandomAccessIterator find (RandomAccessIterator first, RandomAccessIterator last, const Type &__val, random_access_iterator_tag)

template<typename RandomAccessIterator, typename Predicate> RandomAccessIterator find_if (RandomAccessIterator first, RandomAccessIterator last, Predicate pred, random_access_iterator_tag)

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, output_iterator_tag)

template<typename InputIterator, typename ForwardIterator> ForwardIterator __unique_copy (InputIterator first, InputIterator last, ForwardIterator __result, forward_iterator_tag)

template<typename InputIterator, typename OutputIterator, typename BinaryPredicate> OutputIterator __unique_copy (InputIterator first, InputIterator last, OutputIterator __result, BinaryPredicate __binary_pred, output_iterator_tag)

template<typename InputIterator, typename ForwardIterator, typename BinaryPredicate> ForwardIterator __unique_copy (InputIterator first, InputIterator last, ForwardIterator __result, BinaryPredicate __binary_pred, forward_iterator_tag)

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, bidirectional_iterator_tag)

template<typename RandomAccessIterator> void __reverse (RandomAccessIterator first, RandomAccessIterator last, random_access_iterator_tag)

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 EuclideanRingElement> EuclideanRingElement __gcd (EuclideanRingElement __m, EuclideanRingElement n)

template<typename ForwardIterator> void __rotate (ForwardIterator first, ForwardIterator __middle, ForwardIterator last, forward_iterator_tag)

template<typename BidirectionalIterator> void __rotate (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, bidirectional_iterator_tag)

template<typename RandomAccessIterator> void __rotate (RandomAccessIterator first, RandomAccessIterator __middle, RandomAccessIterator last, random_access_iterator_tag)

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, forward_iterator_tag)

template<typename BidirectionalIterator, typename Predicate> BidirectionalIterator __partition (BidirectionalIterator first, BidirectionalIterator last, Predicate pred, bidirectional_iterator_tag)

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, typename Distance> ForwardIterator inplace_stable_partition (ForwardIterator first, ForwardIterator last, Predicate pred, Distance __len)

template<typename ForwardIterator, typename Pointer, typename Predicate, typename Distance> ForwardIterator stable_partition_adaptive (ForwardIterator first, ForwardIterator last, Predicate pred, Distance __len, Pointer __buffer, Distance __buffer_size)

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, typename Type> RandomAccessIterator __unguarded_partition (RandomAccessIterator first, RandomAccessIterator last, Type __pivot)

template<typename RandomAccessIterator, typename Type, typename Compare> RandomAccessIterator __unguarded_partition (RandomAccessIterator first, RandomAccessIterator last, Type __pivot, Compare comp)

template<typename RandomAccessIterator, typename Type> void __unguarded_linear_insert (RandomAccessIterator last, Type __val)

template<typename RandomAccessIterator, typename Type, typename Compare> void __unguarded_linear_insert (RandomAccessIterator last, Type __val, Compare comp)

template<typename RandomAccessIterator> void insertion_sort (RandomAccessIterator first, RandomAccessIterator last)

template<typename RandomAccessIterator, typename Compare> void insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)

template<typename RandomAccessIterator> void __unguarded_insertion_sort (RandomAccessIterator first, RandomAccessIterator last)

template<typename RandomAccessIterator, typename Compare> void __unguarded_insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)

template<typename RandomAccessIterator> void __final_insertion_sort (RandomAccessIterator first, RandomAccessIterator last)

template<typename RandomAccessIterator, typename Compare> void __final_insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)

template<typename Size> Size __lg (Size n)

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, typename Size> void introsort_loop (RandomAccessIterator first, RandomAccessIterator last, Size __depth_limit)

template<typename RandomAccessIterator, typename Size, typename Compare> void introsort_loop (RandomAccessIterator first, RandomAccessIterator last, Size __depth_limit, Compare comp)

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 BidirectionalIterator, typename Distance> void __merge_without_buffer (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Distance __len1, Distance __len2)

template<typename BidirectionalIterator, typename Distance, typename Compare> void __merge_without_buffer (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Distance __len1, Distance __len2, Compare comp)

template<typename RandomAccessIterator> void inplace_stable_sort (RandomAccessIterator first, RandomAccessIterator last)

template<typename RandomAccessIterator, typename Compare> void inplace_stable_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)

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 RandomAccessIterator1, typename RandomAccessIterator2, typename Distance> void __merge_sort_loop (RandomAccessIterator1 first, RandomAccessIterator1 last, RandomAccessIterator2 __result, Distance step_size)

template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename Distance, typename Compare> void __merge_sort_loop (RandomAccessIterator1 first, RandomAccessIterator1 last, RandomAccessIterator2 __result, Distance step_size, Compare comp)

template<typename RandomAccessIterator, typename Distance> void chunk_insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Distance chunk_size)

template<typename RandomAccessIterator, typename Distance, typename Compare> void chunk_insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Distance chunk_size, Compare comp)

template<typename RandomAccessIterator, typename Pointer> void __merge_sort_with_buffer (RandomAccessIterator first, RandomAccessIterator last, Pointer __buffer)

template<typename RandomAccessIterator, typename Pointer, typename Compare> void __merge_sort_with_buffer (RandomAccessIterator first, RandomAccessIterator last, Pointer __buffer, Compare comp)

template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename BidirectionalIterator3> BidirectionalIterator3 __merge_backward (BidirectionalIterator1 first1, BidirectionalIterator1 last1, BidirectionalIterator2 first2, BidirectionalIterator2 last2, BidirectionalIterator3 __result)

template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename BidirectionalIterator3, typename Compare> BidirectionalIterator3 __merge_backward (BidirectionalIterator1 first1, BidirectionalIterator1 last1, BidirectionalIterator2 first2, BidirectionalIterator2 last2, BidirectionalIterator3 __result, Compare comp)

template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename Distance> BidirectionalIterator1 __rotate_adaptive (BidirectionalIterator1 first, BidirectionalIterator1 __middle, BidirectionalIterator1 last, Distance __len1, Distance __len2, BidirectionalIterator2 __buffer, Distance __buffer_size)

template<typename BidirectionalIterator, typename Distance, typename Pointer> void __merge_adaptive (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Distance __len1, Distance __len2, Pointer __buffer, Distance __buffer_size)

template<typename BidirectionalIterator, typename Distance, typename Pointer, typename Compare> void __merge_adaptive (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Distance __len1, Distance __len2, Pointer __buffer, Distance __buffer_size, Compare comp)

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, typename Pointer, typename Distance> void stable_sort_adaptive (RandomAccessIterator first, RandomAccessIterator last, Pointer __buffer, Distance __buffer_size)

template<typename RandomAccessIterator, typename Pointer, typename Distance, typename Compare> void stable_sort_adaptive (RandomAccessIterator first, RandomAccessIterator last, Pointer __buffer, Distance __buffer_size, Compare comp)

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, forward_iterator_tag, forward_iterator_tag)

template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate> ForwardIterator1 __find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, forward_iterator_tag, forward_iterator_tag, BinaryPredicate comp)

template<typename BidirectionalIterator1, typename BidirectionalIterator2> BidirectionalIterator1 __find_end (BidirectionalIterator1 first1, BidirectionalIterator1 last1, BidirectionalIterator2 first2, BidirectionalIterator2 last2, bidirectional_iterator_tag, bidirectional_iterator_tag)

template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename BinaryPredicate> BidirectionalIterator1 __find_end (BidirectionalIterator1 first1, BidirectionalIterator1 last1, BidirectionalIterator2 first2, BidirectionalIterator2 last2, bidirectional_iterator_tag, bidirectional_iterator_tag, BinaryPredicate comp)

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, input_iterator_tag)

template<typename RandomAccessIterator, typename OutputIterator> OutputIterator copy (RandomAccessIterator first, RandomAccessIterator last, OutputIterator __result, random_access_iterator_tag)

template<typename Type> Type * copy_trivial (const Type *first, const Type *last, Type *__result)

template<typename InputIterator, typename OutputIterator> OutputIterator copy_aux2 (InputIterator first, InputIterator last, OutputIterator __result, __false_type)

template<typename InputIterator, typename OutputIterator> OutputIterator copy_aux2 (InputIterator first, InputIterator last, OutputIterator __result, __true_type)

template<typename Type> Type * copy_aux2 (Type *first, Type *last, Type *__result, __true_type)

template<typename Type> Type * copy_aux2 (const Type *first, const Type *last, Type *__result, __true_type)

template<typename InputIterator, typename OutputIterator> OutputIterator copy_ni2 (InputIterator first, InputIterator last, OutputIterator __result, __true_type)

template<typename InputIterator, typename OutputIterator> OutputIterator copy_ni2 (InputIterator first, InputIterator last, OutputIterator __result, __false_type)

template<typename InputIterator, typename OutputIterator> OutputIterator copy_ni1 (InputIterator first, InputIterator last, OutputIterator __result, __true_type)

template<typename InputIterator, typename OutputIterator> OutputIterator copy_ni1 (InputIterator first, InputIterator last, OutputIterator __result, __false_type)

template<typename InputIterator, typename OutputIterator> OutputIterator copy (InputIterator first, InputIterator last, OutputIterator __result)

Copies the range [first,last) into result. template<typename BidirectionalIterator1, typename BidirectionalIterator2> BidirectionalIterator2 copy_backward (BidirectionalIterator1 first, BidirectionalIterator1 last, BidirectionalIterator2 __result, bidirectional_iterator_tag)

template<typename RandomAccessIterator, typename BidirectionalIterator> BidirectionalIterator copy_backward (RandomAccessIterator first, RandomAccessIterator last, BidirectionalIterator __result, random_access_iterator_tag)

template<typename BI1, typename BI2> BI2 copy_backward_aux (BI1 first, BI1 last, BI2 __result)

template<typename BI1, typename BI2> BI2 copy_backward_output_normal_iterator (BI1 first, BI1 last, BI2 __result, __true_type)

template<typename BI1, typename BI2> BI2 copy_backward_output_normal_iterator (BI1 first, BI1 last, BI2 __result, __false_type)

template<typename BI1, typename BI2> BI2 copy_backward_input_normal_iterator (BI1 first, BI1 last, BI2 __result, __true_type)

template<typename BI1, typename BI2> BI2 copy_backward_input_normal_iterator (BI1 first, BI1 last, BI2 __result, __false_type)

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. void fill (unsigned char *first, unsigned char *last, const unsigned char &c)

void fill (signed char *first, signed char *last, const signed char &c)

void fill (char *first, char *last, const char &c)

template<typename Size> unsigned char * fill_n (unsigned char *first, Size n, const unsigned char &c)

template<typename Size> signed char * fill_n (char *first, Size n, const signed char &c)

template<typename Size> char * fill_n (char *first, Size n, const char &c)

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. bool lexicographical_compare (const unsigned char *first1, const unsigned char *last1, const unsigned char *first2, const unsigned char *last2)

bool lexicographical_compare (const char *first1, const char *last1, const char *first2, const char *last2)

ptrdiff_t operator- (const Bit_iterator_base &x, const Bit_iterator_base &y)

Bit_iterator operator+ (ptrdiff_t n, const Bit_iterator &x)

Bit_const_iterator operator+ (ptrdiff_t n, const Bit_const_iterator &x)

template<typename T1, typename T2> void Construct (T1 *__p, const T2 &value)

template<typename T1> void Construct (T1 *__p)

template<typename Type> void Destroy (Type *__pointer)

template<typename ForwardIterator> void __destroy_aux (ForwardIterator first, ForwardIterator last, __false_type)

template<typename ForwardIterator> void __destroy_aux (ForwardIterator, ForwardIterator, __true_type)

template<typename ForwardIterator> void Destroy (ForwardIterator first, ForwardIterator last)

size_t __deque_buf_size (size_t size)

template<typename Type, typename Ref, typename Ptr> bool operator== (const Deque_iterator< Type, Ref, Ptr > &x, const Deque_iterator< Type, Ref, Ptr > &y)

template<typename Type, typename RefL, typename PtrL, typename RefR, typename PtrR> bool operator== (const Deque_iterator< Type, RefL, PtrL > &x, const Deque_iterator< Type, RefR, PtrR > &y)

template<typename Type, typename Ref, typename Ptr> bool operator!= (const Deque_iterator< Type, Ref, Ptr > &x, const Deque_iterator< Type, Ref, Ptr > &y)

template<typename Type, typename RefL, typename PtrL, typename RefR, typename PtrR> bool operator!= (const Deque_iterator< Type, RefL, PtrL > &x, const Deque_iterator< Type, RefR, PtrR > &y)

template<typename Type, typename Ref, typename Ptr> bool operator< (const Deque_iterator< Type, Ref, Ptr > &x, const Deque_iterator< Type, Ref, Ptr > &y)

template<typename Type, typename RefL, typename PtrL, typename RefR, typename PtrR> bool operator< (const Deque_iterator< Type, RefL, PtrL > &x, const Deque_iterator< Type, RefR, PtrR > &y)

template<typename Type, typename Ref, typename Ptr> bool operator> (const Deque_iterator< Type, Ref, Ptr > &x, const Deque_iterator< Type, Ref, Ptr > &y)

template<typename Type, typename RefL, typename PtrL, typename RefR, typename PtrR> bool operator> (const Deque_iterator< Type, RefL, PtrL > &x, const Deque_iterator< Type, RefR, PtrR > &y)

template<typename Type, typename Ref, typename Ptr> bool operator<= (const Deque_iterator< Type, Ref, Ptr > &x, const Deque_iterator< Type, Ref, Ptr > &y)

template<typename Type, typename RefL, typename PtrL, typename RefR, typename PtrR> bool operator<= (const Deque_iterator< Type, RefL, PtrL > &x, const Deque_iterator< Type, RefR, PtrR > &y)

template<typename Type, typename Ref, typename Ptr> bool operator>= (const Deque_iterator< Type, Ref, Ptr > &x, const Deque_iterator< Type, Ref, Ptr > &y)

template<typename Type, typename RefL, typename PtrL, typename RefR, typename PtrR> bool operator>= (const Deque_iterator< Type, RefL, PtrL > &x, const Deque_iterator< Type, RefR, PtrR > &y)

template<typename Type, typename RefL, typename PtrL, typename RefR, typename PtrR> Deque_iterator< Type, RefL, PtrL >::difference_type operator- (const Deque_iterator< Type, RefL, PtrL > &x, const Deque_iterator< Type, RefR, PtrR > &y)

template<typename Type, typename Ref, typename Ptr> Deque_iterator< Type, Ref, Ptr > operator+ (ptrdiff_t n, const Deque_iterator< Type, Ref, Ptr > &x)

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<class Ret, class Type> mem_fun_t< Ret, Type > mem_fun (Ret(Type::*__f)())

template<class Ret, class Type> mem_fun_ref_t< Ret, Type > mem_fun_ref (Ret(Type::*__f)())

template<class Ret, class Type, class Arg> mem_fun1_t< Ret, Type, Arg > mem_fun (Ret(Type::*__f)(Arg))

template<class Ret, class Type, class Arg> mem_fun1_ref_t< Ret, Type, Arg > mem_fun_ref (Ret(Type::*__f)(Arg))

template<typename RandomAccessIterator, typename Distance> bool __is_heap (RandomAccessIterator first, Distance n)

template<typename RandomAccessIterator, typename Distance, typename StrictWeakOrdering> bool __is_heap (RandomAccessIterator first, StrictWeakOrdering comp, Distance n)

template<typename RandomAccessIterator> bool __is_heap (RandomAccessIterator first, RandomAccessIterator last)

template<typename RandomAccessIterator, typename StrictWeakOrdering> bool __is_heap (RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp)

template<typename RandomAccessIterator, typename Distance, typename Type> void __push_heap (RandomAccessIterator first, Distance __holeIndex, Distance __topIndex, Type value)

template<typename RandomAccessIterator> void push_heap (RandomAccessIterator first, RandomAccessIterator last)

Push an element onto a heap. template<typename RandomAccessIterator, typename Distance, typename Type, typename Compare> void __push_heap (RandomAccessIterator first, Distance __holeIndex, Distance __topIndex, Type value, Compare comp)

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, typename Distance, typename Type> void adjust_heap (RandomAccessIterator first, Distance __holeIndex, Distance __len, Type value)

template<typename RandomAccessIterator, typename Type> void __pop_heap (RandomAccessIterator first, RandomAccessIterator last, RandomAccessIterator __result, Type value)

template<typename RandomAccessIterator> void pop_heap (RandomAccessIterator first, RandomAccessIterator last)

Pop an element off a heap. template<typename RandomAccessIterator, typename Distance, typename Type, typename Compare> void adjust_heap (RandomAccessIterator first, Distance __holeIndex, Distance __len, Type value, Compare comp)

template<typename RandomAccessIterator, typename Type, typename Compare> void __pop_heap (RandomAccessIterator first, RandomAccessIterator last, RandomAccessIterator __result, Type value, Compare comp)

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, input_iterator_tag)

template<typename RandomAccessIterator> iterator_traits< RandomAccessIterator >::difference_type __distance (RandomAccessIterator first, RandomAccessIterator last, random_access_iterator_tag)

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, input_iterator_tag)

template<typename BidirectionalIterator, typename Distance> void advance (BidirectionalIterator &__i, Distance n, bidirectional_iterator_tag)

template<typename RandomAccessIterator, typename Distance> void advance (RandomAccessIterator &__i, Distance n, random_access_iterator_tag)

template<typename InputIterator, typename Distance> void advance (InputIterator &__i, Distance n)

A generalization of pointer arithmetic. template<typename Iter> iterator_traits< Iter >::iterator_category __iterator_category (const Iter &)

template<typename Val> bool operator== (const List_iterator< Val > &x, const List_const_iterator< Val > &y)

template<typename Val> bool operator!= (const List_iterator< Val > &x, const List_const_iterator< Val > &y)

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 Val> bool operator== (const Rb_tree_iterator< Val > &x, const Rb_tree_const_iterator< Val > &y)

template<typename Val> bool operator!= (const Rb_tree_iterator< Val > &x, const Rb_tree_const_iterator< Val > &y)

template<typename Key, typename Val, typename KeyOfValue, typename Compare, typename Alloc> bool operator== (const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &x, const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &y)

template<typename Key, typename Val, typename KeyOfValue, typename Compare, typename Alloc> bool operator< (const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &x, const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &y)

template<typename Key, typename Val, typename KeyOfValue, typename Compare, typename Alloc> bool operator!= (const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &x, const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &y)

template<typename Key, typename Val, typename KeyOfValue, typename Compare, typename Alloc> bool operator> (const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &x, const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &y)

template<typename Key, typename Val, typename KeyOfValue, typename Compare, typename Alloc> bool operator<= (const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &x, const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &y)

template<typename Key, typename Val, typename KeyOfValue, typename Compare, typename Alloc> bool operator>= (const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &x, const Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &y)

template<typename Key, typename Val, typename KeyOfValue, typename Compare, typename Alloc> void swap (Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &x, Rb_tree< Key, Val, KeyOfValue, Compare, Alloc > &y)

template<typename InputIterator, typename ForwardIterator> ForwardIterator __uninitialized_copy_aux (InputIterator first, InputIterator last, ForwardIterator __result, __true_type)

template<typename InputIterator, typename ForwardIterator> ForwardIterator __uninitialized_copy_aux (InputIterator first, InputIterator last, ForwardIterator __result, __false_type)

template<typename InputIterator, typename ForwardIterator> ForwardIterator uninitialized_copy (InputIterator first, InputIterator last, ForwardIterator __result)

Copies the range [first,last) into result. char * uninitialized_copy (const char *first, const char *last, char *__result)

wchar_t * uninitialized_copy (const wchar_t *first, const wchar_t *last, wchar_t *__result)

template<typename ForwardIterator, typename Type> void __uninitialized_fill_aux (ForwardIterator first, ForwardIterator last, const Type &x, __true_type)

template<typename ForwardIterator, typename Type> void __uninitialized_fill_aux (ForwardIterator first, ForwardIterator last, const Type &x, __false_type)

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_aux (ForwardIterator first, Size n, const Type &x, __true_type)

template<typename ForwardIterator, typename Size, typename Type> ForwardIterator __uninitialized_fill_n_aux (ForwardIterator first, Size n, const Type &x, __false_type)

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 InputIterator1, typename InputIterator2, typename ForwardIterator> ForwardIterator __uninitialized_copy_copy (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, ForwardIterator __result)

template<typename ForwardIterator, typename Type, typename InputIterator> ForwardIterator __uninitialized_fill_copy (ForwardIterator __result, ForwardIterator __mid, const Type &x, InputIterator first, InputIterator last)

template<typename InputIterator, typename ForwardIterator, typename Type> void __uninitialized_copy_fill (InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2, const Type &x)

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 CharT, typename Traits> streamsize copy_streambufs (basic_streambuf< CharT, Traits > *sbin, basic_streambuf< CharT, Traits > *sbout)

template<typename CharT, typename Traits> bool operator== (const istreambuf_iterator< CharT, Traits > &a, const istreambuf_iterator< CharT, Traits > &__b)

template<typename CharT, typename Traits> bool operator!= (const istreambuf_iterator< CharT, Traits > &a, const istreambuf_iterator< CharT, Traits > &__b)

void * __valarray_get_memory (size_t n)

template<typename Type> Type *__restrict__ __valarray_get_storage (size_t n)

void __valarray_release_memory (void *__p)

template<typename Type> void __valarray_default_construct (Type *__restrict__ __b, Type *__restrict__ __e)

template<typename Type> void __valarray_fill_construct (Type *__restrict__ __b, Type *__restrict__ __e, const Type __t)

template<typename Type> void __valarray_copy_construct (const Type *__restrict__ __b, const Type *__restrict__ __e, Type *__restrict__ __o)

template<typename Type> void __valarray_copy_construct (const Type *__restrict__ a, size_t n, size_t s, Type *__restrict__ __o)

template<typename Type> void __valarray_copy_construct (const Type *__restrict__ a, const size_t *__restrict__ __i, Type *__restrict__ __o, size_t n)

template<typename Type> void __valarray_destroy_elements (Type *__restrict__ __b, Type *__restrict__ __e)

template<typename Type> void __valarray_fill (Type *__restrict__ a, size_t n, const Type &__t)

template<typename Type> void __valarray_fill (Type *__restrict__ a, size_t n, size_t s, const Type &__t)

template<typename Type> void __valarray_fill (Type *__restrict__ a, const size_t *__restrict__ __i, size_t n, const Type &__t)

template<typename Type> void __valarray_copy (const Type *__restrict__ a, size_t n, Type *__restrict__ __b)

template<typename Type> void __valarray_copy (const Type *__restrict__ a, size_t n, size_t s, Type *__restrict__ __b)

template<typename Type> void __valarray_copy (const Type *__restrict__ a, Type *__restrict__ __b, size_t n, size_t s)

template<typename Type> void __valarray_copy (const Type *__restrict__ src, size_t n, size_t s1, Type *__restrict__ __dst, size_t s2)

template<typename Type> void __valarray_copy (const Type *__restrict__ a, const size_t *__restrict__ __i, Type *__restrict__ __b, size_t n)

template<typename Type> void __valarray_copy (const Type *__restrict__ a, size_t n, Type *__restrict__ __b, const size_t *__restrict__ __i)

template<typename Type> void __valarray_copy (const Type *__restrict__ src, size_t n, const size_t *__restrict__ __i, Type *__restrict__ __dst, const size_t *__restrict__ __j)

template<typename Type> Type __valarray_sum (const Type *__restrict__ __f, const Type *__restrict__ __l)

template<typename Type> Type __valarray_product (const Type *__restrict__ __f, const Type *__restrict__ __l)

template<typename Ta> Ta::value_type __valarray_min (const Ta &a)

template<typename Ta> Ta::value_type __valarray_max (const Ta &a)

template<typename Type> void __valarray_fill (Array< Type > a, size_t n, const Type &__t)

template<typename Type> void __valarray_fill (Array< Type > a, size_t n, size_t s, const Type &__t)

template<typename Type> void __valarray_fill (Array< Type > a, Array< size_t > __i, size_t n, const Type &__t)

template<typename Type> void __valarray_copy (Array< Type > a, size_t n, Array< Type > __b)

template<typename Type> void __valarray_copy (Array< Type > a, size_t n, size_t s, Array< Type > __b)

template<typename Type> void __valarray_copy (Array< Type > a, Array< Type > __b, size_t n, size_t s)

template<typename Type> void __valarray_copy (Array< Type > a, size_t n, size_t s1, Array< Type > __b, size_t s2)

template<typename Type> void __valarray_copy (Array< Type > a, Array< size_t > __i, Array< Type > __b, size_t n)

template<typename Type> void __valarray_copy (Array< Type > a, size_t n, Array< Type > __b, Array< size_t > __i)

template<typename Type> void __valarray_copy (Array< Type > src, size_t n, Array< size_t > __i, Array< Type > __dst, Array< size_t > __j)

template<typename Type> void __valarray_fill (Array< Type > a, size_t n, Array< bool > __m, const Type &__t)

template<typename Type> void __valarray_copy (Array< Type > a, Array< bool > __m, Array< Type > __b, size_t n)

template<typename Type> void __valarray_copy (Array< Type > a, size_t n, Array< Type > __b, Array< bool > __m)

template<typename Type> void __valarray_copy (Array< Type > a, Array< bool > __m, size_t n, Array< Type > __b, Array< bool > __k)

template<typename Type, class Dom> void __valarray_copy (const Expr< Dom, Type > &__e, size_t n, Array< Type > a)

template<typename Type, class Dom> void __valarray_copy (const Expr< Dom, Type > &__e, size_t n, Array< Type > a, size_t s)

template<typename Type, class Dom> void __valarray_copy (const Expr< Dom, Type > &__e, size_t n, Array< Type > a, Array< size_t > __i)

template<typename Type> void __valarray_copy (Array< Type > __e, Array< size_t > __f, size_t n, Array< Type > a, Array< size_t > __i)

template<typename Type, class Dom> void __valarray_copy (const Expr< Dom, Type > &__e, size_t n, Array< Type > a, Array< bool > __m)

template<typename Type, class Dom> void __valarray_copy_construct (const Expr< Dom, Type > &__e, size_t n, Array< Type > a)

template<typename Type> void __valarray_copy_construct (Array< Type > a, Array< bool > __m, Array< Type > __b, size_t n)

double abs (double x)

float abs (float x)

long double abs (long double x)

float acos (float x)

long double acos (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type acos (Type x)

float asin (float x)

long double asin (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type asin (Type x)

float atan (float x)

long double atan (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type atan (Type x)

float atan2 (float y, float x)

long double atan2 (long double y, long double x)

template<typename Type, typename Up> __enable_if< double, __is_integer< Type >::M_type &&__is_integer< Up >::M_type >::M_type atan2 (Type y, Up x)

float ceil (float x)

long double ceil (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type ceil (Type x)

float cos (float x)

long double cos (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type cos (Type x)

float cosh (float x)

long double cosh (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type cosh (Type x)

float exp (float x)

long double exp (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type exp (Type x)

float fabs (float x)

long double fabs (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type fabs (Type x)

float floor (float x)

long double floor (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type floor (Type x)

float fmod (float x, float y)

long double fmod (long double x, long double y)

float frexp (float x, int *__exp)

long double frexp (long double x, int *__exp)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type frexp (Type x, int *__exp)

float ldexp (float x, int __exp)

long double ldexp (long double x, int __exp)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type ldexp (Type x, int __exp)

float log (float x)

long double log (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type log (Type x)

float log10 (float x)

long double log10 (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type log10 (Type x)

float modf (float x, float *__iptr)

long double modf (long double x, long double *__iptr)

template<typename Type> Type __pow_helper (Type x, int n)

float pow (float x, float y)

long double pow (long double x, long double y)

double pow (double x, int __i)

float pow (float x, int n)

long double pow (long double x, int n)

float sin (float x)

long double sin (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type sin (Type x)

float sinh (float x)

long double sinh (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type sinh (Type x)

float sqrt (float x)

long double sqrt (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type sqrt (Type x)

float tan (float x)

long double tan (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type tan (Type x)

float tanh (float x)

long double tanh (long double x)

template<typename Type> __enable_if< double, __is_integer< Type >::M_type >::M_type tanh (Type x)

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. template<typename Type> Type & real (complex< Type > &__z)

template<typename Type> const Type & real (const complex< Type > &__z)

template<typename Type> Type & imag (complex< Type > &__z)

template<typename Type> const Type & imag (const complex< Type > &__z)

long abs (long __i)

ldiv_t div (long __i, long __j)

void * memchr (void *__p, int c, size_t n)

char * strchr (char *s1, int n)

char * strpbrk (char *s1, const char *s2)

char * strrchr (char *s1, int n)

char * strstr (char *s1, const char *s2)

template<typename Tv> int convert_from_v (char *out, const int size, const char *__fmt, Tv __v, const c_locale &, int __prec)

Resetiosflags resetiosflags (ios_base::fmtflags __mask)

Manipulator for setf. template<typename CharT, typename Traits> basic_istream< CharT, Traits > & operator>> (basic_istream< CharT, Traits > &__is, Resetiosflags __f)

template<typename CharT, typename Traits> basic_ostream< CharT, Traits > & operator<< (basic_ostream< CharT, Traits > &__os, Resetiosflags __f)

Setiosflags setiosflags (ios_base::fmtflags __mask)

Manipulator for setf. template<typename CharT, typename Traits> basic_istream< CharT, Traits > & operator>> (basic_istream< CharT, Traits > &__is, Setiosflags __f)

template<typename CharT, typename Traits> basic_ostream< CharT, Traits > & operator<< (basic_ostream< CharT, Traits > &__os, Setiosflags __f)

Setbase setbase (int __base)

Manipulator for setf. template<typename CharT, typename Traits> basic_istream< CharT, Traits > & operator>> (basic_istream< CharT, Traits > &__is, Setbase __f)

template<typename CharT, typename Traits> basic_ostream< CharT, Traits > & operator<< (basic_ostream< CharT, Traits > &__os, Setbase __f)

template<typename CharT> Setfill< CharT > setfill (CharT c)

Manipulator for fill. template<typename CharT, typename Traits> basic_istream< CharT, Traits > & operator>> (basic_istream< CharT, Traits > &__is, Setfill< CharT > __f)

template<typename CharT, typename Traits> basic_ostream< CharT, Traits > & operator<< (basic_ostream< CharT, Traits > &__os, Setfill< CharT > __f)

Setprecision setprecision (int n)

Manipulator for precision. template<typename CharT, typename Traits> basic_istream< CharT, Traits > & operator>> (basic_istream< CharT, Traits > &__is, Setprecision __f)

template<typename CharT, typename Traits> basic_ostream< CharT, Traits > & operator<< (basic_ostream< CharT, Traits > &__os, Setprecision __f)

Setw setw (int n)

Manipulator for width. template<typename CharT, typename Traits> basic_istream< CharT, Traits > & operator>> (basic_istream< CharT, Traits > &__is, Setw __f)

template<typename CharT, typename Traits> basic_ostream< CharT, Traits > & operator<< (basic_ostream< CharT, Traits > &__os, Setw __f)

template<typename Type> pair< Type *, ptrdiff_t > __get_temporary_buffer (ptrdiff_t __len, Type *)

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.

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). istream cin

ostream cout

ostream cerr

ostream clog

static ios_base::Init __ioinit

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

Definition at line 66 of file new.

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

Definition at line 74 of file postypes.h.

File position for char streams.

Definition at line 210 of file postypes.h.

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

Definition at line 78 of file postypes.h.

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

Definition at line 74 of file exception.

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

Definition at line 76 of file exception.

File position for wchar_t streams.

Definition at line 212 of file postypes.h.

Describes the denormalization for floating-point types.

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

Enumerator:

denorm_indeterminate

Indeterminate at compile time whether denormalized values are allowed.

denorm_absent

The type does not allow denormalized values.

denorm_present

The type allows denormalized values.

Definition at line 172 of file limits.

Describes the rounding style for floating-point types.

This is used in the std::numeric_limits class.

Enumerator:

round_indeterminate

Self-explanatory.

round_toward_zero

Self-explanatory.

round_to_nearest

To the nearest representable value.

round_toward_infinity

Self-explanatory.

round_toward_neg_infinity

Self-explanatory.

Definition at line 157 of file limits.

Return magnitude of z.

Definition at line 547 of file complex.

References abs(), std::complex< Type >::imag(), max(), std::complex< Type >::real(), and sqrt().

Accumulate values in a range with operation.

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

Parameters: first Start of range.

last End of range.

init Starting value to add other values to.

binary_op Function object to accumulate with.

Returns: The final sum.

Definition at line 108 of file stl_numeric.h.

References __glibcxx_function_requires.

Accumulate values in a range.

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

Parameters: first Start of range.

last End of range.

init Starting value to add other values to.

Returns: The final sum.

Definition at line 82 of file stl_numeric.h.

References __glibcxx_function_requires.

Return differences between adjacent values.

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

Parameters: first Start of input range.

last End of input range.

result Output to write sums to.

Returns: Iterator pointing just beyond the values written to result.

Definition at line 303 of file stl_numeric.h.

References __glibcxx_function_requires.

Return differences between adjacent values.

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

Parameters: first Start of input range.

last End of input range.

result Output to write sums to.

Returns: Iterator pointing just beyond the values written to result.

Definition at line 268 of file stl_numeric.h.

References __glibcxx_function_requires.

Find two adjacent values in a sequence using a predicate.

Parameters: first A forward iterator.

last A forward iterator.

binary_pred A binary predicate.

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

Definition at line 381 of file stl_algo.h.

References __glibcxx_function_requires.

Find two adjacent values in a sequence that are equal.

Parameters: first A forward iterator.

last A forward iterator.

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

Definition at line 350 of file stl_algo.h.

References __glibcxx_function_requires.

Referenced by unique().

A generalization of pointer arithmetic.

Parameters: i An input iterator.

n The 'delta' by which to change i.

Returns: Nothing.

This increments i by n. For bidirectional and random access iterators, n may be negative, in which case i is decremented.

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

Definition at line 172 of file stl_iterator_base_funcs.h.

References __iterator_category().

Return phase angle of z.

Definition at line 561 of file complex.

References atan2(), std::complex< Type >::imag(), and std::complex< Type >::real().

Referenced by log().

Parameters: x A container of arbitrary type.

Returns: An instance of back_insert_iterator working on x.

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

Definition at line 397 of file stl_iterator.h.

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

Return complex conjugate of z.

Definition at line 606 of file complex.

References std::complex< Type >::imag(), and std::complex< Type >::real().

Copies the range [first,last) into result.

Parameters: first An input iterator.

last An input iterator.

result An output iterator.

Returns: result + (first - last)

This inline function will boil down to a call to memmove whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling). Result may not be contained within [first,last); the copy_backward function should be used instead.

Note that the end of the output range is permitted to be contained within [first,last).

Definition at line 348 of file stl_algobase.h.

References __glibcxx_function_requires.

Copies the range [first,last) into result.

Parameters: first A bidirectional iterator.

last A bidirectional iterator.

result A bidirectional iterator.

Returns: result - (first - last)

The function has the same effect as copy, but starts at the end of the range and works its way to the start, returning the start of the result. This inline function will boil down to a call to memmove whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling).

Result may not be in the range [first,last). Use copy instead. Note that the start of the output range may overlap [first,last).

Definition at line 487 of file stl_algobase.h.

References __glibcxx_function_requires.

Return complex cosine of z.

Definition at line 612 of file complex.

References cos(), cosh(), std::complex< Type >::imag(), std::complex< Type >::real(), sin(), and sinh().

Return complex hyperbolic cosine of z.

Definition at line 621 of file complex.

References cos(), cosh(), std::complex< Type >::imag(), std::complex< Type >::real(), sin(), and sinh().

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

Parameters: first An input iterator.

last An input iterator.

value The value to be counted.

Returns: The number of iterators i in the range [first,last) for which *i == value

Definition at line 412 of file stl_algo.h.

References __glibcxx_function_requires.

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

Parameters: first An input iterator.

last An input iterator.

pred A predicate.

Returns: The number of iterators i in the range [first,last) for which pred(*i) is true.

Definition at line 437 of file stl_algo.h.

References __glibcxx_function_requires.

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

Referenced by operator>>().

A generalization of pointer arithmetic.

Parameters: first An input iterator.

last An input iterator.

Returns: The distance between them.

Returns n such that first + n == last. This requires that last must be reachable from first. Note that n may be negative.

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

Definition at line 114 of file stl_iterator_base_funcs.h.

References __distance(), and __iterator_category().

Referenced by __find_end(), __is_heap(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), std::Rb_tree< Key, Val, KeyOfValue, Compare, Alloc >::count(), equal_range(), std::Rb_tree< Key, Val, KeyOfValue, Compare, Alloc >::erase(), inplace_merge(), inplace_stable_partition(), lower_bound(), std::vector< Type, Alloc >::M_assign_aux(), std::deque< Type, Allocator >::M_assign_aux(), std::vector< bool, Alloc >::M_assign_aux(), std::vector< bool, Alloc >::M_initialize_range(), std::vector< bool, Alloc >::M_insert_range(), std::vector< Type, Allocator >::M_range_initialize(), std::deque< Type, Alloc >::M_range_initialize(), std::vector< Type, Alloc >::M_range_insert(), std::deque< Type, Alloc >::M_range_insert_aux(), __gnu_cxx::random_sample_n(), std::basic_string< CharT, Traits, Alloc >::S_construct(), std::list< Type, Allocator >::size(), and upper_bound().

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 flush(), std::basic_ostream< CharT, Traits >::put(), and std::basic_ios< CharT, Traits >::widen().

Write a null character into the output sequence.

Definition at line 529 of file ostream.

References std::basic_ostream< CharT, Traits >::put().

Tests a range for element-wise equality.

Parameters: first1 An input iterator.

last1 An input iterator.

first2 An input iterator.

binary_pred A binary predicate functor.

Returns: A boolean true or false.

This compares the elements of two ranges using the binary_pred parameter, and returns true or false depending on whether all of the corresponding elements of the ranges are equal.

Definition at line 712 of file stl_algobase.h.

References __glibcxx_function_requires.

Tests a range for element-wise equality.

Parameters: first1 An input iterator.

last1 An input iterator.

first2 An input iterator.

Returns: A boolean true or false.

This compares the elements of two ranges using == and returns true or false depending on whether all of the corresponding elements of the ranges are equal.

Definition at line 679 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by operator==().

Return complex base e exponential of z.

Definition at line 630 of file complex.

References exp(), std::complex< Type >::imag(), polar(), and std::complex< Type >::real().

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

Parameters: first A forward iterator.

last A forward iterator.

value A reference-to-const of arbitrary type.

Returns: Nothing.

This function fills a range with copies of the same value. For one-byte types filling contiguous areas of memory, this becomes an inline call to memset.

Definition at line 516 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by __uninitialized_fill_aux(), fill_n(), std::Base_bitset< Nw >::M_do_left_shift(), std::Base_bitset< Nw >::M_do_right_shift(), std::vector< Type, Alloc >::M_fill_assign(), std::deque< Type, Allocator >::M_fill_assign(), std::vector< bool, Alloc >::M_fill_assign(), std::vector< Type, Alloc >::M_fill_insert(), std::vector< bool, Alloc >::M_fill_insert(), std::vector< bool, Alloc >::M_initialize_dispatch(), std::deque< Type, Alloc >::M_insert_aux(), and std::vector< bool, Alloc >::vector().

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

Parameters: first An output iterator.

n The count of copies to perform.

value A reference-to-const of arbitrary type.

Returns: The iterator at first+n.

This function fills a range with copies of the same value. For one-byte types filling contiguous areas of memory, this becomes an inline call to memset.

Definition at line 540 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by __uninitialized_fill_n_aux(), __gnu_cxx::char_traits< CharT >::assign(), std::vector< Type, Alloc >::M_fill_assign(), and std::vector< bool, Alloc >::M_fill_insert().

Find the first occurrence of a value in a sequence.

Parameters: first An input iterator.

last An input iterator.

val The value to find.

Returns: The first iterator i in the range [first,last) such that *i == val, or last if no such iterator exists.

Definition at line 306 of file stl_algo.h.

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

Find last matching subsequence in a sequence using a predicate.

Parameters: first1 Start of range to search.

last1 End of range to search.

first2 Start of sequence to match.

last2 End of sequence to match.

comp The predicate to use.

Returns: The last iterator i in the range [first1,last1-(last2-first2)) such that predicate(*(i+N), (first2+N)) is true for each N in the range [0,last2-first2), or last1 if no such iterator exists.

Searches the range [first1,last1) for a sub-sequence that compares equal value-by-value with the sequence given by [first2,last2) using comp as a predicate and returns an iterator to the first element of the sub-sequence, or last1 if the sub-sequence is not found. The sub-sequence will be the last such subsequence contained in [first,last1).

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

Definition at line 5127 of file stl_algo.h.

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

Find last matching subsequence in a sequence.

Parameters: first1 Start of range to search.

last1 End of range to search.

first2 Start of sequence to match.

last2 End of sequence to match.

Returns: The last iterator i in the range [first1,last1-(last2-first2)) such that *(i+N) == *(first2+N) for each N in the range [0,last2-first2), or last1 if no such iterator exists.

Searches the range [first1,last1) for a sub-sequence that compares equal value-by-value with the sequence given by [first2,last2) and returns an iterator to the first element of the sub-sequence, or last1 if the sub-sequence is not found. The sub-sequence will be the last such subsequence contained in [first,last1).

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

Definition at line 5081 of file stl_algo.h.

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

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

Parameters: first1 Start of range to search.

last1 End of range to search.

first2 Start of match candidates.

last2 End of match candidates.

comp Predicate to use.

Returns: The first iterator i in the range [first1,last1) such that comp(*i, *(i2)) is true and i2 is an interator in [first2,last2), or last1 if no such iterator exists.

Searches the range [first1,last1) for an element that is equal to some element in the range [first2,last2). If found, returns an iterator in the range [first1,last1), otherwise returns last1.

Definition at line 4902 of file stl_algo.h.

References __glibcxx_function_requires.

Find element from a set in a sequence.

Parameters: first1 Start of range to search.

last1 End of range to search.

first2 Start of match candidates.

last2 End of match candidates.

Returns: The first iterator i in the range [first1,last1) such that *i == *(i2) such that i2 is an interator in [first2,last2), or last1 if no such iterator exists.

Searches the range [first1,last1) for an element that is equal to some element in the range [first2,last2). If found, returns an iterator in the range [first1,last1), otherwise returns last1.

Definition at line 4865 of file stl_algo.h.

References __glibcxx_function_requires.

Referenced by __gnu_debug::basic_string< CharT, Traits, Allocator >::find_first_of().

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

Parameters: first An input iterator.

last An input iterator.

pred A predicate.

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

Definition at line 328 of file stl_algo.h.

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

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

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

Referenced by endl().

Apply a function to every element of a sequence.

Parameters: first An input iterator.

last An input iterator.

f A unary function object.

Returns: f.

Applies the function object f to each element in the range [first,last). f must not modify the order of the sequence. If f has a return value it is ignored.

Definition at line 152 of file stl_algo.h.

References __glibcxx_function_requires.

Parameters: x A container of arbitrary type.

Returns: An instance of front_insert_iterator working on x.

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

Definition at line 471 of file stl_iterator.h.

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

Parameters: first A forward iterator.

last A forward iterator.

gen A function object taking no arguments.

Returns: generate() returns no value.

Performs the assignment *i = gen() for each i in the range [first,last).

Definition at line 972 of file stl_algo.h.

References __glibcxx_function_requires.

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

Parameters: first A forward iterator.

n The length of the sequence.

gen A function object taking no arguments.

Returns: The end of the sequence, first+n

Performs the assignment *i = gen() for each i in the range [first,first+n).

Definition at line 998 of file stl_algo.h.

References __glibcxx_function_requires.

Allocates a temporary buffer.

Parameters: len The number of objects of type Tp.

Returns: See full description.

Reinventing the wheel, but this time with prettier spokes!

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

Provides the nothrow exception guarantee.

Definition at line 111 of file memory.

References __get_temporary_buffer().

Referenced by std::Temporary_buffer< ForwardIterator, Type >::Temporary_buffer().

Read a line from stream into a string.

Parameters: is Input stream.

str Buffer to store into.

Returns: Reference to the input stream.

Stores characters from is into str until '

Definition at line 1162 of file istream.tcc.

References std::basic_ios< CharT, Traits >::widen().

Read a line from stream into a string.

Parameters: is Input stream.

str Buffer to store into.

delim Character marking end of line.

Returns: Reference to the input stream.

Stores characters from is into str until delim is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If delim was encountered, it is extracted but not stored into str.

Definition at line 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().

Referenced by __gnu_debug::getline().

Test for the presence of a facet.

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

Parameters: Facet The facet type to test the presence of.

locale The locale to test.

Returns: true if locale contains a facet of type Facet, else false.

Definition at line 85 of file locale_facets.tcc.

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

Referenced by operator>>().

Compute inner product of two ranges.

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

Parameters: first1 Start of range 1.

last1 End of range 1.

first2 Start of range 2.

init Starting value to add other values to.

binary_op1 Function object to accumulate with.

binary_op2 Function object to apply to pairs of input values.

Returns: The final inner product.

Definition at line 168 of file stl_numeric.h.

References __glibcxx_function_requires.

Compute inner product of two ranges.

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

Parameters: first1 Start of range 1.

last1 End of range 1.

first2 Start of range 2.

init Starting value to add other values to.

Returns: The final inner product.

Definition at line 136 of file stl_numeric.h.

References __glibcxx_function_requires.

Merges two sorted ranges in place.

Parameters: first An iterator.

middle Another iterator.

last Another iterator.

comp A functor to use for comparisons.

Returns: Nothing.

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

If enough additional memory is available, this takes (last-first)-1 comparisons. Otherwise an NlogN algorithm is used, where N is distance(first,last).

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

Definition at line 3491 of file stl_algo.h.

References __glibcxx_function_requires, __merge_adaptive(), __merge_without_buffer(), and distance().

Merges two sorted ranges in place.

Parameters: first An iterator.

middle Another iterator.

last Another iterator.

Returns: Nothing.

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

If enough additional memory is available, this takes (last-first)-1 comparisons. Otherwise an NlogN algorithm is used, where N is distance(first,last).

Definition at line 3437 of file stl_algo.h.

References __glibcxx_function_requires, __merge_adaptive(), __merge_without_buffer(), and distance().

Parameters: x A container of arbitrary type.

Returns: An instance of insert_iterator working on x.

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

Definition at line 567 of file stl_iterator.h.

Referenced by std::deque< Type, Alloc >::M_range_insert_aux().

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

Convenience interface to ctype.is().

Definition at line 4538 of file locale_facets.h.

References ctype_base::alnum.

Referenced by __gnu_debug::Error_formatter::M_print_string().

Convenience interface to ctype.is().

Definition at line 4518 of file locale_facets.h.

References ctype_base::alpha.

Convenience interface to ctype.is().

Definition at line 4504 of file locale_facets.h.

References ctype_base::cntrl.

Convenience interface to ctype.is().

Definition at line 4523 of file locale_facets.h.

References ctype_base::digit.

Convenience interface to ctype.is().

Definition at line 4543 of file locale_facets.h.

References ctype_base::graph.

Convenience interface to ctype.is().

Definition at line 4513 of file locale_facets.h.

References ctype_base::lower.

Convenience interface to ctype.is().

Definition at line 4499 of file locale_facets.h.

References ctype_base::print.

Convenience interface to ctype.is().

Definition at line 4528 of file locale_facets.h.

References ctype_base::punct.

Convenience interface to ctype.is().

Definition at line 4494 of file locale_facets.h.

References ctype_base::space.

Referenced by __gnu_debug::Error_formatter::M_print_string().

Convenience interface to ctype.is().

Definition at line 4509 of file locale_facets.h.

References ctype_base::upper.

Convenience interface to ctype.is().

Definition at line 4533 of file locale_facets.h.

References ctype_base::xdigit.

Swaps the contents of two iterators.

Parameters: a An iterator.

b Another iterator.

Returns: Nothing.

This function swaps the values pointed to by two iterators, not the iterators themselves.

Definition at line 92 of file stl_algobase.h.

References __glibcxx_function_requires.

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

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

Performs 'dictionary' comparison on ranges.

Parameters: first1 An input iterator.

last1 An input iterator.

first2 An input iterator.

last2 An input iterator.

comp A comparison functor.

Returns: A boolean true or false.

The same as the four-parameter lexigraphical_compare, but uses the comp parameter instead of <.

Definition at line 783 of file stl_algobase.h.

References __glibcxx_function_requires.

Performs 'dictionary' comparison on ranges.

Parameters: first1 An input iterator.

last1 An input iterator.

first2 An input iterator.

last2 An input iterator.

Returns: A boolean true or false.

Definition at line 743 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by lexicographical_compare().

Return complex natural logarithm of z.

Definition at line 635 of file complex.

References arg(), and log().

Return complex base 10 logarithm of z.

Definition at line 640 of file complex.

References log().

Construct a heap over a range using comparison functor.

Parameters: first Start of heap.

last End of heap.

comp Comparison functor to use.

This operation makes the elements in [first,last) into a heap. Comparisons are made using comp.

Definition at line 384 of file stl_heap.h.

References __glibcxx_function_requires.

Construct a heap over a range.

Parameters: first Start of heap.

last End of heap.

This operation makes the elements in [first,last) into a heap.

Definition at line 344 of file stl_heap.h.

References __glibcxx_function_requires.

Referenced by partial_sort(), partial_sort_copy(), and std::priority_queue< Type, Sequence, Compare >::priority_queue().

A convenience wrapper for creating a pair from two objects.

Parameters: x The first object.

y The second object.

Returns: A newly-constructed pair<> object of the appropriate type.

The standard requires that the objects be passed by reference-to-const, but LWG issue #181 says they should be passed by const value. We follow the LWG by default.

Definition at line 144 of file stl_pair.h.

Referenced by __gnu_debug_def::set< Key, Compare, Allocator >::equal_range(), __gnu_debug_def::multiset< Key, Compare, Allocator >::equal_range(), __gnu_debug_def::multimap< Key, Type, Compare, Allocator >::equal_range(), __gnu_debug_def::map< Key, Type, Compare, Allocator >::equal_range(), __gnu_debug_def::hash_set< Value, HashFcn, EqualKey, Alloc >::equal_range(), __gnu_debug_def::hash_multiset< Value, HashFcn, EqualKey, Alloc >::equal_range(), __gnu_debug_def::hash_multimap< Value, Type, HashFcn, EqualKey, Alloc >::equal_range(), __gnu_debug_def::hash_map< Value, Type, HashFcn, EqualKey, Alloc >::equal_range(), __gnu_debug_def::hash_set< Value, HashFcn, EqualKey, Alloc >::insert(), __gnu_debug_def::hash_map< Value, Type, HashFcn, EqualKey, Alloc >::insert(), __gnu_debug_def::hash_set< Value, HashFcn, EqualKey, Alloc >::insert_noresize(), __gnu_debug_def::hash_map< Value, Type, HashFcn, EqualKey, Alloc >::insert_noresize(), __gnu_debug::Safe_iterator< Iterator, Sequence >::M_get_distance(), and __gnu_cxx::bitmap_allocator< Type >::S_refill_pool().

This does what you think it does.

Parameters: a A thing of arbitrary type.

b Another thing of arbitrary type.

comp A comparison functor.

Returns: The greater of the parameters.

This will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.

Definition at line 214 of file stl_algobase.h.

This does what you think it does.

Parameters: a A thing of arbitrary type.

b Another thing of arbitrary type.

Returns: The greater of the parameters.

This is the simple classic generic implementation. It will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.

Definition at line 172 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by __get_temporary_buffer(), abs(), allocator< Type >::init_page_size(), std::vector< Type, Alloc >::M_fill_insert(), std::vector< bool, Alloc >::M_fill_insert(), std::Deque_base< Type, Alloc >::M_initialize_map(), std::vector< bool, Alloc >::M_insert_range(), std::vector< Type, Alloc >::M_range_insert(), std::deque< Type, Alloc >::M_reallocate_map(), allocator< Type >::max_size(), operator>>(), std::strstreambuf::overflow(), std::basic_stringbuf< CharT, Traits, Alloc >::overflow(), __gnu_cxx::rope< CharT, Alloc >::S_apply_to_pieces(), and std::strstreambuf::strstreambuf().

Return the maximum element in a range using comparison functor.

Parameters: first Start of range.

last End of range.

comp Comparison functor.

Returns: Iterator referencing the first instance of the largest value according to comp.

Definition at line 4552 of file stl_algo.h.

References __glibcxx_function_requires.

Return the maximum element in a range.

Parameters: first Start of range.

last End of range.

Returns: Iterator referencing the first instance of the largest value.

Definition at line 4525 of file stl_algo.h.

References __glibcxx_function_requires.

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

Merges two sorted ranges.

Parameters: first1 An iterator.

first2 Another iterator.

last1 Another iterator.

last2 Another iterator.

result An iterator pointing to the end of the merged range.

comp A functor to use for comparisons.

Returns: An iterator pointing to the first element 'not less than' val.

Merges the ranges [first1,last1) and [first2,last2) into the sorted range [result, result + (last1-first1) + (last2-first2)). Both input ranges must be sorted, and the output range must not overlap with either of the input ranges. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.

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

Definition at line 3018 of file stl_algo.h.

References __glibcxx_function_requires, and copy().

Merges two sorted ranges.

Parameters: first1 An iterator.

first2 Another iterator.

last1 Another iterator.

last2 Another iterator.

result An iterator pointing to the end of the merged range.

Returns: An iterator pointing to the first element 'not less than' val.

Merges the ranges [first1,last1) and [first2,last2) into the sorted range [result, result + (last1-first1) + (last2-first2)). Both input ranges must be sorted, and the output range must not overlap with either of the input ranges. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.

Definition at line 2960 of file stl_algo.h.

References __glibcxx_function_requires, and copy().

Referenced by __merge_adaptive(), and __merge_sort_loop().

This does what you think it does.

Parameters: a A thing of arbitrary type.

b Another thing of arbitrary type.

comp A comparison functor.

Returns: The lesser of the parameters.

This will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.

Definition at line 194 of file stl_algobase.h.

This does what you think it does.

Parameters: a A thing of arbitrary type.

b Another thing of arbitrary type.

Returns: The lesser of the parameters.

This is the simple classic generic implementation. It will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.

Definition at line 150 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by __gnu_cxx::__lexicographical_compare_3way(), __merge_sort_loop(), __verify_grouping(), std::basic_string< CharT, Traits, Alloc >::compare(), std::basic_string< CharT, Traits, Allocator >::compare(), codecvt< InternT, ExternT, __enc_traits >::do_length(), codecvt< InternT, ExternT, StateT >::do_length(), std::basic_istream< CharT, Traits >::getline(), lexicographical_compare(), std::bitset< Nb >::M_copy_from_string(), std::num_get< CharT, InIter >::M_extract_int(), std::time_get< CharT, InIter >::M_extract_name(), std::basic_stringbuf< CharT, Traits, Alloc >::overflow(), __gnu_cxx::random_sample_n(), std::basic_istream< CharT, Traits >::readsome(), std::basic_string< CharT, Traits, Alloc >::rfind(), __gnu_cxx::rope< CharT, Alloc >::S_apply_to_pieces(), std::basic_filebuf< CharT, Traits >::underflow(), std::basic_streambuf< CharT, Traits >::xsgetn(), std::basic_streambuf< CharT, Traits >::xsputn(), and std::basic_filebuf< CharT, Traits >::xsputn().

Return the minimum element in a range using comparison functor.

Parameters: first Start of range.

last End of range.

comp Comparison functor.

Returns: Iterator referencing the first instance of the smallest value according to comp.

Definition at line 4604 of file stl_algo.h.

References __glibcxx_function_requires.

Return the minimum element in a range.

Parameters: first Start of range.

last End of range.

Returns: Iterator referencing the first instance of the smallest value.

Definition at line 4577 of file stl_algo.h.

References __glibcxx_function_requires.

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

Finds the places in ranges which don't match.

Parameters: first1 An input iterator.

last1 An input iterator.

first2 An input iterator.

binary_pred A binary predicate functor.

Returns: A pair of iterators pointing to the first mismatch.

This compares the elements of two ranges using the binary_pred parameter, and returns a pair of iterators. The first iterator points into the first range, the second iterator points into the second range, and the elements pointed to by the iterators are not equal.

Definition at line 650 of file stl_algobase.h.

References __glibcxx_function_requires.

Finds the places in ranges which don't match.

Parameters: first1 An input iterator.

last1 An input iterator.

first2 An input iterator.

Returns: A pair of iterators pointing to the first mismatch.

This compares the elements of two ranges using == and returns a pair of iterators. The first iterator points into the first range, the second iterator points into the second range, and the elements pointed to by the iterators are not equal.

Definition at line 614 of file stl_algobase.h.

References __glibcxx_function_requires.

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

Parameters: first Start of range.

last End of range.

comp

Returns: False if wrapped to first permutation, true otherwise.

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

Definition at line 4695 of file stl_algo.h.

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

Permute range into the next 'dictionary' ordering.

Parameters: first Start of range.

last End of range.

Returns: False if wrapped to first permutation, true otherwise.

Treats all permutations of the range as a set of 'dictionary' sorted sequences. Permutes the current sequence into the next one of this set. Returns true if there are more sequences to generate. If the sequence is the largest of the set, the smallest is generated and false returned.

Definition at line 4639 of file stl_algo.h.

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

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

Return z magnitude squared.

Definition at line 594 of file complex.

Referenced by std::complex< Type >::operator/=().

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

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

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

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

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

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.

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

Parameters: first An iterator.

nth Another iterator.

last Another iterator.

comp A comparison functor.

Returns: Nothing.

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

Definition at line 3733 of file stl_algo.h.

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

Sort a sequence just enough to find a particular position.

Parameters: first An iterator.

nth Another iterator.

last Another iterator.

Returns: Nothing.

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

Definition at line 3682 of file stl_algo.h.

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

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

Referenced by operator>>().

Global bitwise operations on bitsets.

Parameters: x A bitset.

y A bitset of the same size as x.

Returns: A new bitset.

These should be self-explanatory.

Definition at line 1118 of file bitset.

Return new complex value x times y.

Definition at line 392 of file complex.

Return new complex value x times y.

Definition at line 383 of file complex.

Return new complex value x times y.

Definition at line 374 of file complex.

Referenced by __gnu_cxx::Slist_iterator< Type, Ref, Ptr >::operator->(), __gnu_cxx::Hashtable_const_iterator< Val, Key, HashFcn, ExtractKey, EqualKey, Alloc >::operator->(), and __gnu_cxx::Hashtable_iterator< Val, Key, HashFcn, ExtractKey, EqualKey, Alloc >::operator->().

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

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

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

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.

Based on operator==.

Definition at line 904 of file stl_vector.h.

Based on operator==.

Definition at line 250 of file stl_stack.h.

Returns !(x == y).

Definition at line 560 of file stl_set.h.

Based on operator==.

Definition at line 275 of file stl_queue.h.

Uses operator== to find the result.

Definition at line 109 of file stl_pair.h.

Returns !(x == y).

Definition at line 551 of file stl_multiset.h.

Based on operator==.

Definition at line 644 of file stl_multimap.h.

Based on operator==.

Definition at line 662 of file stl_map.h.

Based on operator==.

Definition at line 1226 of file stl_list.h.

Parameters: x A reverse_iterator.

y A reverse_iterator.

Returns: A simple bool.

Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.

Definition at line 289 of file stl_iterator.h.

Based on operator==.

Definition at line 1469 of file stl_deque.h.

Test difference of string and C string.

Parameters: lhs String.

rhs C string.

Returns: True if lhs.compare(rhs) != 0. False otherwise.

Definition at line 2134 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test difference of C string and string.

Parameters: lhs C string.

rhs String.

Returns: True if rhs.compare(lhs) != 0. False otherwise.

Definition at line 2122 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test difference of two strings.

Parameters: lhs First string.

rhs Second string.

Returns: True if lhs.compare(rhs) != 0. False otherwise.

Definition at line 2110 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Return x.

Definition at line 433 of file complex.

Return new complex value x plus y.

Definition at line 332 of file complex.

References std::complex< Type >::real().

Return new complex value x plus y.

Definition at line 323 of file complex.

References std::complex< Type >::real().

Return new complex value x plus y.

Definition at line 314 of file complex.

Parameters: x A reverse_iterator.

y A reverse_iterator.

Returns: A simple bool.

Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.

Definition at line 319 of file stl_iterator.h.

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

Concatenate string and character.

Parameters: lhs First string.

rhs Last string.

Returns: New string with lhs followed by rhs.

Definition at line 2055 of file basic_string.h.

Concatenate string and C string.

Parameters: lhs First string.

rhs Last string.

Returns: New string with lhs followed by rhs.

Definition at line 2039 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::append().

Concatenate character and string.

Parameters: lhs First string.

rhs Last string.

Returns: New string with lhs followed by rhs.

Definition at line 663 of file basic_string.tcc.

References std::basic_string< CharT, Traits, Alloc >::size().

Concatenate C string and string.

Parameters: lhs First string.

rhs Last string.

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

Definition at line 647 of file basic_string.tcc.

References std::basic_string< CharT, Traits, Alloc >::size().

Concatenate two strings.

Parameters: lhs First string.

rhs Last string.

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

Definition at line 2002 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::append().

Return complex negation of x.

Definition at line 439 of file complex.

References std::complex< Type >::imag(), and std::complex< Type >::real().

Return new complex value x minus y.

Definition at line 362 of file complex.

References std::complex< Type >::imag(), and std::complex< Type >::real().

Return new complex value x minus y.

Definition at line 353 of file complex.

References std::complex< Type >::real().

Return new complex value x minus y.

Definition at line 344 of file complex.

Parameters: x A reverse_iterator.

y A reverse_iterator.

Returns: A simple bool.

Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.

Definition at line 313 of file stl_iterator.h.

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

Return new complex value x divided by y.

Definition at line 422 of file complex.

Return new complex value x divided by y.

Definition at line 413 of file complex.

Return new complex value x divided by y.

Definition at line 404 of file complex.

Vector ordering relation.

Parameters: x A vector.

y A vector of the same type as x.

Returns: True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the vectors. The elements must be comparable with <.

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

Definition at line 895 of file stl_vector.h.

Stack ordering relation.

Parameters: x A stack.

y A stack of the same type as x.

Returns: True iff x is lexicographically less than y.

This is an total ordering relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, the elements must be comparable with <, and std::lexicographical_compare() is usually used to make the determination.

Definition at line 244 of file stl_stack.h.

Set ordering relation.

Parameters: x A set.

y A set of the same type as x.

Returns: True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <.

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

Definition at line 553 of file stl_set.h.

Queue ordering relation.

Parameters: x A queue.

y A queue of the same type as x.

Returns: True iff x is lexicographically less than y.

This is an total ordering relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, the elements must be comparable with <, and std::lexicographical_compare() is usually used to make the determination.

Definition at line 269 of file stl_queue.h.

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

Definition at line 102 of file stl_pair.h.

Multiset ordering relation.

Parameters: x A multiset.

y A multiset of the same type as x.

Returns: True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <.

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

Definition at line 544 of file stl_multiset.h.

Multimap ordering relation.

Parameters: x A multimap.

y A multimap of the same type as x.

Returns: True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the multimaps. The elements must be comparable with <.

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

Definition at line 637 of file stl_multimap.h.

Map ordering relation.

Parameters: x A map.

y A map of the same type as x.

Returns: True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <.

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

Definition at line 655 of file stl_map.h.

List ordering relation.

Parameters: x A list.

y A list of the same type as x.

Returns: True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the lists. The elements must be comparable with <.

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

Definition at line 1219 of file stl_list.h.

Parameters: x A reverse_iterator.

y A reverse_iterator.

Returns: A simple bool.

Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.

Definition at line 283 of file stl_iterator.h.

Deque ordering relation.

Parameters: x A deque.

y A deque of the same type as x.

Returns: True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the deques. The elements must be comparable with <.

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

Definition at line 1461 of file stl_deque.h.

Test if C string precedes string.

Parameters: lhs C string.

rhs String.

Returns: True if lhs precedes rhs. False otherwise.

Definition at line 2171 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test if string precedes C string.

Parameters: lhs String.

rhs C string.

Returns: True if lhs precedes rhs. False otherwise.

Definition at line 2159 of file basic_string.h.

Test if string precedes string.

Parameters: lhs First string.

rhs Second string.

Returns: True if lhs precedes rhs. False otherwise.

Definition at line 2147 of file basic_string.h.

String inserters.

Parameters: out An output stream.

s A character string.

Returns: out

Precondition: s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(s) characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0) is then called.

Definition at line 503 of file ostream.

String inserters.

Parameters: out An output stream.

s A character string.

Returns: out

Precondition: s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(s) characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0) is then called.

Definition at line 498 of file ostream.

Character inserters.

Parameters: out An output stream.

c A character.

Returns: out

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

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

Definition at line 464 of file ostream.

Character inserters.

Parameters: out An output stream.

c A character.

Returns: out

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

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

Definition at line 459 of file ostream.

Character inserters.

Parameters: out An output stream.

c A character.

Returns: out

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

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

Definition at line 448 of file ostream.

Insertion operator for complex values.

Definition at line 514 of file complex.

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

String inserters.

Parameters: out An output stream.

s A character string.

Returns: out

Precondition: s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(s) characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0) is then called.

Definition at line 611 of file ostream.tcc.

String inserters.

Parameters: out An output stream.

s A character string.

Returns: out

Precondition: s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(s) characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0) is then called.

Definition at line 566 of file ostream.tcc.

String inserters.

Parameters: out An output stream.

s A character string.

Returns: out

Precondition: s must be a non-NULL pointer

Behaves like one of the formatted arithmetic inserters described in std::basic_ostream. After constructing a sentry object with good status, this function inserts traits::length(s) characters starting at s, widened if necessary, followed by any required padding (as determined by [22.2.2.2.2]). out.width(0) is then called.

Definition at line 533 of file ostream.tcc.

Character inserters.

Parameters: out An output stream.

c A character.

Returns: out

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

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

Definition at line 504 of file ostream.tcc.

Character inserters.

Parameters: out An output stream.

c A character.

Returns: out

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

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

Definition at line 473 of file ostream.tcc.

Write string to a stream.

Parameters: os Output stream.

str String to write out.

Returns: Reference to the output stream.

Output characters of str into os following the same rules as for writing a C string.

Definition at line 643 of file ostream.tcc.

Based on operator<.

Definition at line 916 of file stl_vector.h.

Based on operator<.

Definition at line 262 of file stl_stack.h.

Returns !(y < x).

Definition at line 574 of file stl_set.h.

Based on operator<.

Definition at line 288 of file stl_queue.h.

Uses operator< to find the result.

Definition at line 121 of file stl_pair.h.

Returns !(y < x).

Definition at line 565 of file stl_multiset.h.

Based on operator<.

Definition at line 658 of file stl_multimap.h.

Based on operator<.

Definition at line 676 of file stl_map.h.

Based on operator<.

Definition at line 1238 of file stl_list.h.

Parameters: x A reverse_iterator.

y A reverse_iterator.

Returns: A simple bool.

Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.

Definition at line 301 of file stl_iterator.h.

Based on operator<.

Definition at line 1483 of file stl_deque.h.

Test if C string doesn't follow string.

Parameters: lhs C string.

rhs String.

Returns: True if lhs doesn't follow rhs. False otherwise.

Definition at line 2245 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test if string doesn't follow C string.

Parameters: lhs String.

rhs C string.

Returns: True if lhs doesn't follow rhs. False otherwise.

Definition at line 2233 of file basic_string.h.

Test if string doesn't follow string.

Parameters: lhs First string.

rhs Second string.

Returns: True if lhs doesn't follow rhs. False otherwise.

Definition at line 2221 of file basic_string.h.

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

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

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

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.

Vector equality comparison.

Parameters: x A vector.

y A vector of the same type as x.

Returns: True iff the size and elements of the vectors are equal.

This is an equivalence relation. It is linear in the size of the vectors. Vectors are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 876 of file stl_vector.h.

References std::vector< Type, Alloc >::begin(), std::vector< Type, Alloc >::end(), equal(), and std::vector< Type, Alloc >::size().

Stack equality comparison.

Parameters: x A stack.

y A stack of the same type as x.

Returns: True iff the size and elements of the stacks are equal.

This is an equivalence relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, and stacks are considered equivalent if their sequences compare equal.

Definition at line 226 of file stl_stack.h.

References std::stack< Type, Sequence >::c.

Set equality comparison.

Parameters: x A set.

y A set of the same type as x.

Returns: True iff the size and elements of the sets are equal.

This is an equivalence relation. It is linear in the size of the sets. Sets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 536 of file stl_set.h.

Queue equality comparison.

Parameters: x A queue.

y A queue of the same type as x.

Returns: True iff the size and elements of the queues are equal.

This is an equivalence relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, and queues are considered equivalent if their sequences compare equal.

Definition at line 250 of file stl_queue.h.

References std::queue< Type, Sequence >::c.

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

Definition at line 96 of file stl_pair.h.

References std::pair< T1, T2 >::first, and std::pair< T1, T2 >::second.

Multiset equality comparison.

Parameters: x A multiset.

y A multiset of the same type as x.

Returns: True iff the size and elements of the multisets are equal.

This is an equivalence relation. It is linear in the size of the multisets. Multisets are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 527 of file stl_multiset.h.

Multimap equality comparison.

Parameters: x A multimap.

y A multimap of the same type as x.

Returns: True iff the size and elements of the maps are equal.

This is an equivalence relation. It is linear in the size of the multimaps. Multimaps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 620 of file stl_multimap.h.

Map equality comparison.

Parameters: x A map.

y A map of the same type as x.

Returns: True iff the size and elements of the maps are equal.

This is an equivalence relation. It is linear in the size of the maps. Maps are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 638 of file stl_map.h.

List equality comparison.

Parameters: x A list.

y A list of the same type as x.

Returns: True iff the size and elements of the lists are equal.

This is an equivalence relation. It is linear in the size of the lists. Lists are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 1190 of file stl_list.h.

References std::list< Type, Alloc >::begin(), and std::list< Type, Alloc >::end().

Parameters: x A reverse_iterator.

y A reverse_iterator.

Returns: A simple bool.

Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.

Definition at line 277 of file stl_iterator.h.

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

Deque equality comparison.

Parameters: x A deque.

y A deque of the same type as x.

Returns: True iff the size and elements of the deques are equal.

This is an equivalence relation. It is linear in the size of the deques. Deques are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

Definition at line 1443 of file stl_deque.h.

References std::deque< Type, Alloc >::begin(), std::deque< Type, Alloc >::end(), equal(), and std::deque< Type, Alloc >::size().

Test equivalence of string and C string.

Parameters: lhs String.

rhs C string.

Returns: True if lhs.compare(rhs) == 0. False otherwise.

Definition at line 2097 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test equivalence of C string and string.

Parameters: lhs C string.

rhs String.

Returns: True if rhs.compare(lhs) == 0. False otherwise.

Definition at line 2085 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test equivalence of two strings.

Parameters: lhs First string.

rhs Second string.

Returns: True if lhs.compare(rhs) == 0. False otherwise.

Definition at line 2073 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Based on operator<.

Definition at line 910 of file stl_vector.h.

Based on operator<.

Definition at line 256 of file stl_stack.h.

Returns y < x.

Definition at line 567 of file stl_set.h.

Based on operator<.

Definition at line 282 of file stl_queue.h.

Uses operator< to find the result.

Definition at line 115 of file stl_pair.h.

Returns y < x.

Definition at line 558 of file stl_multiset.h.

Based on operator<.

Definition at line 651 of file stl_multimap.h.

Based on operator<.

Definition at line 669 of file stl_map.h.

Based on operator<.

Definition at line 1232 of file stl_list.h.

Parameters: x A reverse_iterator.

y A reverse_iterator.

Returns: A simple bool.

Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.

Definition at line 295 of file stl_iterator.h.

Based on operator<.

Definition at line 1476 of file stl_deque.h.

Test if C string follows string.

Parameters: lhs C string.

rhs String.

Returns: True if lhs follows rhs. False otherwise.

Definition at line 2208 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test if string follows C string.

Parameters: lhs String.

rhs C string.

Returns: True if lhs follows rhs. False otherwise.

Definition at line 2196 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test if string follows string.

Parameters: lhs First string.

rhs Second string.

Returns: True if lhs follows rhs. False otherwise.

Definition at line 2184 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Based on operator<.

Definition at line 922 of file stl_vector.h.

Based on operator<.

Definition at line 268 of file stl_stack.h.

Returns !(x < y).

Definition at line 581 of file stl_set.h.

Based on operator<.

Definition at line 295 of file stl_queue.h.

Uses operator< to find the result.

Definition at line 127 of file stl_pair.h.

Returns !(x < y).

Definition at line 572 of file stl_multiset.h.

Based on operator<.

Definition at line 665 of file stl_multimap.h.

Based on operator<.

Definition at line 683 of file stl_map.h.

Based on operator<.

Definition at line 1244 of file stl_list.h.

Parameters: x A reverse_iterator.

y A reverse_iterator.

Returns: A simple bool.

Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.

Definition at line 307 of file stl_iterator.h.

Based on operator<.

Definition at line 1490 of file stl_deque.h.

Test if C string doesn't precede string.

Parameters: lhs C string.

rhs String.

Returns: True if lhs doesn't precede rhs. False otherwise.

Definition at line 2282 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test if string doesn't precede C string.

Parameters: lhs String.

rhs C string.

Returns: True if lhs doesn't precede rhs. False otherwise.

Definition at line 2270 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Test if string doesn't precede string.

Parameters: lhs First string.

rhs Second string.

Returns: True if lhs doesn't precede rhs. False otherwise.

Definition at line 2258 of file basic_string.h.

References std::basic_string< CharT, Traits, Alloc >::compare().

Character string extractors.

Parameters: in An input stream.

s A pointer to a character array.

Returns: in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts up to n characters and stores them into the array starting at s. n is defined as:

•

if width() is greater than zero, n is width()

•

otherwise n is 'the number of elements of the largest array of char_type that can store a terminating eos.' [27.6.1.2.3]/6

Characters are extracted and stored until one of the following happens:

•

n-1 characters are stored

•

EOF is reached

•

the next character is whitespace according to the current locale

•

the next character is a null byte (i.e., charT() )

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

If no characters are extracted, sets failbit.

Definition at line 691 of file istream.

Character string extractors.

Parameters: in An input stream.

s A pointer to a character array.

Returns: in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts up to n characters and stores them into the array starting at s. n is defined as:

•

if width() is greater than zero, n is width()

•

otherwise n is 'the number of elements of the largest array of char_type that can store a terminating eos.' [27.6.1.2.3]/6

Characters are extracted and stored until one of the following happens:

•

n-1 characters are stored

•

EOF is reached

•

the next character is whitespace according to the current locale

•

the next character is a null byte (i.e., charT() )

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

If no characters are extracted, sets failbit.

Definition at line 686 of file istream.

Character extractors.

Parameters: in An input stream.

c A character reference.

Returns: in

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

Definition at line 650 of file istream.

Character extractors.

Parameters: in An input stream.

c A character reference.

Returns: in

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

Definition at line 645 of file istream.

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

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::ios_base::eofbit, std::ios_base::failbit, std::ios_base::goodbit, std::basic_string< CharT, Traits, Alloc >::push_back(), std::basic_ios< CharT, Traits >::rdbuf(), std::basic_string< CharT, Traits, Alloc >::reserve(), std::basic_streambuf< CharT, Traits >::sbumpc(), std::basic_streambuf< CharT, Traits >::sputbackc(), and std::basic_ios< CharT, Traits >::widen().

Character string extractors.

Parameters: in An input stream.

s A pointer to a character array.

Returns: in

Behaves like one of the formatted arithmetic extractors described in std::basic_istream. After constructing a sentry object with good status, this function extracts up to n characters and stores them into the array starting at s. n is defined as:

•

if width() is greater than zero, n is width()

•

otherwise n is 'the number of elements of the largest array of char_type that can store a terminating eos.' [27.6.1.2.3]/6

Characters are extracted and stored until one of the following happens:

•

n-1 characters are stored

•

EOF is reached

•

the next character is whitespace according to the current locale

•

the next character is a null byte (i.e., charT() )

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::getloc(), std::ios_base::goodbit, max(), std::basic_ios< CharT, Traits >::rdbuf(), ctype_base::space, and std::ios_base::width().

Character extractors.

Parameters: in An input stream.

c A character reference.

Returns: in

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

Definition at line 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().

Read stream into a string.

Parameters: is Input stream.

str Buffer to store into.

Returns: Reference to the input stream.

Stores characters from is into str until whitespace is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased.

Definition at line 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::getloc(), std::ios_base::goodbit, std::basic_string< CharT, Traits, Alloc >::max_size(), std::basic_ios< CharT, Traits >::rdbuf(), ctype_base::space, and std::ios_base::width().

Global bitwise operations on bitsets.

Parameters: x A bitset.

y A bitset of the same size as x.

Returns: A new bitset.

These should be self-explanatory.

Definition at line 1136 of file bitset.

Global bitwise operations on bitsets.

Parameters: x A bitset.

y A bitset of the same size as x.

Returns: A new bitset.

These should be self-explanatory.

Definition at line 1127 of file bitset.

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

Parameters: first An iterator.

middle Another iterator.

last Another iterator.

comp A comparison functor.

Returns: Nothing.

Sorts the smallest (middle-first) elements in the range [first,last) and moves them to the range [first,middle). The order of the remaining elements in the range [middle,last) is undefined. After the sort if i and are iterators in the range [first,middle) such that precedes and is an iterator in the range [middle,last) then *comp(j,*i) and comp(*k,*i) are both false.

Definition at line 2299 of file stl_algo.h.

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

Sort the smallest elements of a sequence.

Parameters: first An iterator.

middle Another iterator.

last Another iterator.

Returns: Nothing.

Sorts the smallest (middle-first) elements in the range [first,last) and moves them to the range [first,middle). The order of the remaining elements in the range [middle,last) is undefined. After the sort if i and are iterators in the range [first,middle) such that precedes and is an iterator in the range [middle,last) then *j<*i and *k<*i are both false.

Definition at line 2258 of file stl_algo.h.

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

Referenced by introsort_loop().

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

Parameters: first An input iterator.

last Another input iterator.

result_first A random-access iterator.

result_last Another random-access iterator.

comp A comparison functor.

Returns: An iterator indicating the end of the resulting sequence.

Copies and sorts the smallest N values from the range [first,last) to the range beginning at result_first, where the number of elements to be copied, N, is the smaller of (last-first) and (result_last-result_first). After the sort if i and are iterators in the range [result_first,result_first+N) such that precedes then comp(*j,*i) is false. The value returned is result_first+N.

Definition at line 2405 of file stl_algo.h.

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

Copy the smallest elements of a sequence.

Parameters: first An iterator.

last Another iterator.

result_first A random-access iterator.

result_last Another random-access iterator.

Returns: An iterator indicating the end of the resulting sequence.

Copies and sorts the smallest N values from the range [first,last) to the range beginning at result_first, where the number of elements to be copied, N, is the smaller of (last-first) and (result_last-result_first). After the sort if i and are iterators in the range [result_first,result_first+N) such that precedes then *j<*i is false. The value returned is result_first+N.

Definition at line 2341 of file stl_algo.h.

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

Return list of partial sums.

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

Parameters: first Start of input range.

last End of input range.

result Output to write sums to.

Returns: Iterator pointing just beyond the values written to result.

Definition at line 235 of file stl_numeric.h.

References __glibcxx_function_requires.

Return list of partial sums.

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

Parameters: first Start of input range.

last End of input range.

result Output to write sums to.

Returns: Iterator pointing just beyond the values written to result.

Definition at line 199 of file stl_numeric.h.

References __glibcxx_function_requires.

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

Parameters: first A forward iterator.

last A forward iterator.

pred A predicate functor.

Returns: An iterator middle such that pred(i) is true for each iterator i in the range [first,middle) and false for each i in the range [middle,last).

pred must not modify its operand. partition() does not preserve the relative ordering of elements in each group, use stable_partition() if this is needed.

Definition at line 1858 of file stl_algo.h.

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

Return complex with magnitude rho and angle theta.

Definition at line 601 of file complex.

References cos(), and sin().

Referenced by exp(), and pow().

Pop an element off a heap using comparison functor.

Parameters: first Start of heap.

last End of heap.

comp Comparison functor to use.

This operation pops the top of the heap. The elements first and last-1 are swapped and [first,last-1) is made into a heap. Comparisons are made using comp.

Definition at line 319 of file stl_heap.h.

References __glibcxx_function_requires, and __pop_heap().

Pop an element off a heap.

Parameters: first Start of heap.

last End of heap.

This operation pops the top of the heap. The elements first and last-1 are swapped and [first,last-1) is made into a heap.

Definition at line 253 of file stl_heap.h.

References __glibcxx_function_requires, and __pop_heap().

Referenced by std::priority_queue< Type, Sequence, Compare >::pop(), and sort_heap().

Return x to the y'th power.

Definition at line 724 of file complex.

References std::complex< Type >::imag(), log(), polar(), pow(), and std::complex< Type >::real().

Return x to the y'th power.

Definition at line 717 of file complex.

References exp(), and log().

Return x to the y'th power.

Definition at line 706 of file complex.

References exp(), std::complex< Type >::imag(), log(), polar(), pow(), and std::complex< Type >::real().

Return complex cosine of z.

Definition at line 699 of file complex.

References __pow_helper().

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

Parameters: first Start of range.

last End of range.

comp

Returns: False if wrapped to last permutation, true otherwise.

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

Definition at line 4806 of file stl_algo.h.

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

Permute range into the previous 'dictionary' ordering.

Parameters: first Start of range.

last End of range.

Returns: False if wrapped to last permutation, true otherwise.

Treats all permutations of the range as a set of 'dictionary' sorted sequences. Permutes the current sequence into the previous one of this set. Returns true if there are more sequences to generate. If the sequence is the smallest of the set, the largest is generated and false returned.

Definition at line 4750 of file stl_algo.h.

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

Push an element onto a heap using comparison functor.

Parameters: first Start of heap.

last End of heap + element.

comp Comparison functor.

This operation pushes the element at last-1 onto the valid heap over the range [first,last-1). After completion, [first,last) is a valid heap. Compare operations are performed using comp.

Definition at line 189 of file stl_heap.h.

References __glibcxx_function_requires, and __push_heap().

Push an element onto a heap.

Parameters: first Start of heap.

last End of heap + element.

This operation pushes the element at last-1 onto the valid heap over the range [first,last-1). After completion, [first,last) is a valid heap.