std Namespace Reference


Detailed Description

ISO C++ entities toplevel namespace is std.

Classes

Namespaces

Typedefs

Enumerations

Functions

Variables

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

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


Typedef Documentation

typedef integral_constant<bool, false> std::false_type

typedef for true_type

Definition at line 83 of file tr1_impl/type_traits.

typedef void(*) std::new_handler()

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

Definition at line 77 of file new.

typedef long long std::streamoff

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

In clauses 21.1.3.1 and 27.4.1 streamoff is described as an implementation defined type. Note: In versions of GCC up to and including GCC 3.3, streamoff was typedef long.

Definition at line 73 of file postypes.h.

typedef fpos<mbstate_t> std::streampos

File position for char streams.

Definition at line 207 of file postypes.h.

typedef ptrdiff_t std::streamsize

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

Definition at line 77 of file postypes.h.

typedef void(*) std::terminate_handler()

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

Definition at line 83 of file exception.

typedef integral_constant<bool, true> std::true_type

typedef for true_type

Definition at line 80 of file tr1_impl/type_traits.

typedef void(*) std::unexpected_handler()

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

Definition at line 86 of file exception.

typedef fpos<mbstate_t> std::wstreampos

File position for wchar_t streams.

Definition at line 209 of file postypes.h.


Enumeration Type Documentation

anonymous enum

Todo:
Doc me! See doc/doxygen/TODO and http://gcc.gnu.org/ml/libstdc++/2002-02/msg00003.html for more. This controls some aspect of the sort routines.

Definition at line 1819 of file stl_algo.h.

enum std::float_denorm_style

Describes the denormalization for floating-point types.

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

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

Definition at line 173 of file limits.

enum std::float_round_style

Describes the rounding style for floating-point types.

This is used in the std::numeric_limits class.

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

Definition at line 158 of file limits.


Function Documentation

template<typename _Tp>
std::complex<_Tp> std::__complex_acos ( const std::complex< _Tp > &  __z  )  [inline]

acos(__z) [8.1.2].

Definition at line 59 of file impl/complex.

References _GLIBCXX_TR1, and asin().

Referenced by acos().

template<typename _Tp>
std::complex<_Tp> std::__complex_acosh ( const std::complex< _Tp > &  __z  ) 

acosh(__z) [8.1.5].

Definition at line 175 of file impl/complex.

References log(), and sqrt().

Referenced by acosh().

template<typename _Tp>
std::complex<_Tp> std::__complex_asin ( const std::complex< _Tp > &  __z  )  [inline]

asin(__z) [8.1.3].

Definition at line 95 of file impl/complex.

References _GLIBCXX_TR1, and asinh().

Referenced by asin().

template<typename _Tp>
std::complex<_Tp> std::__complex_asinh ( const std::complex< _Tp > &  __z  ) 

asinh(__z) [8.1.6].

Definition at line 214 of file impl/complex.

References log(), and sqrt().

Referenced by asinh().

template<typename _Tp>
std::complex<_Tp> std::__complex_atan ( const std::complex< _Tp > &  __z  ) 

atan(__z) [8.1.4].

Definition at line 131 of file impl/complex.

References atan2(), and log().

Referenced by atan().

template<typename _Tp>
std::complex<_Tp> std::__complex_atanh ( const std::complex< _Tp > &  __z  ) 

atanh(__z) [8.1.7].

Definition at line 253 of file impl/complex.

References atan2(), and log().

Referenced by atanh().

size_t std::__deque_buf_size ( size_t  __size  )  [inline]

This function controls the size of memory nodes.

Parameters:
size The size of an element.
Returns:
The number (not byte size) of elements per node.
This function started off as a compiler kludge from SGI, but seems to be a useful wrapper around a repeated constant expression. The '512' is tunable (and no other code needs to change), but no investigation has been done since inheriting the SGI code.

Definition at line 82 of file stl_deque.h.

Referenced by std::_Deque_base< _Tp, _Alloc >::_M_allocate_node(), std::_Deque_base< _Tp, _Alloc >::_M_deallocate_node(), std::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), std::deque< _Tp, _Alloc >::_S_buffer_size(), and std::_Deque_iterator< _Tp, _Ref, _Ptr >::_S_buffer_size().

template<typename _RandomAccessIterator, typename _Compare>
void std::__final_insertion_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the sort routine.

Definition at line 1839 of file stl_algo.h.

References __insertion_sort(), and __unguarded_insertion_sort().

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

This is a helper function for the sort routine.

Definition at line 1824 of file stl_algo.h.

References __insertion_sort(), and __unguarded_insertion_sort().

Referenced by sort().

template<typename _RandomAccessIterator, typename _Tp>
_RandomAccessIterator std::__find ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
const _Tp &  __val,
random_access_iterator_tag   
)

This is an overload used by find() for the RAI case.

Definition at line 170 of file stl_algo.h.

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

This is an overload used by find() for the Input Iterator case.

Definition at line 148 of file stl_algo.h.

Referenced by find().

template<typename _RandomAccessIterator, typename _Predicate>
_RandomAccessIterator std::__find_if ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Predicate  __pred,
random_access_iterator_tag   
)

This is an overload used by find_if() for the RAI case.

Definition at line 218 of file stl_algo.h.

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

This is an overload used by find_if() for the Input Iterator case.

Definition at line 159 of file stl_algo.h.

Referenced by find_if().

template<typename _EuclideanRingElement>
_EuclideanRingElement std::__gcd ( _EuclideanRingElement  __m,
_EuclideanRingElement  __n 
)

This is a helper function for the rotate algorithm specialized on RAIs. It returns the greatest common divisor of two integer values.

Definition at line 1159 of file stl_algo.h.

Referenced by __rotate().

template<typename _RandomAccessIterator, typename _Compare>
void std::__heap_select ( _RandomAccessIterator  __first,
_RandomAccessIterator  __middle,
_RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the sort routines.

Definition at line 1566 of file stl_algo.h.

References __pop_heap().

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

This is a helper function for the sort routines.

Definition at line 1553 of file stl_algo.h.

References __pop_heap().

Referenced by __introselect(), and partial_sort().

template<typename _ForwardIterator, typename _Predicate, typename _Distance>
_ForwardIterator std::__inplace_stable_partition ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Predicate  __pred,
_Distance  __len 
)

This is a helper function...

Definition at line 1431 of file stl_algo.h.

References advance(), and distance().

Referenced by stable_partition().

template<typename _RandomAccessIterator, typename _Compare>
void std::__inplace_stable_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the stable sorting routines.

Definition at line 3073 of file stl_algo.h.

References __inplace_stable_sort(), __insertion_sort(), and __merge_without_buffer().

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

This is a helper function for the stable sorting routines.

Definition at line 3054 of file stl_algo.h.

References __insertion_sort(), and __merge_without_buffer().

Referenced by __inplace_stable_sort(), and stable_sort().

template<typename _RandomAccessIterator, typename _Compare>
void std::__insertion_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the sort routine.

Definition at line 1770 of file stl_algo.h.

References __unguarded_linear_insert().

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

This is a helper function for the sort routine.

Definition at line 1747 of file stl_algo.h.

References __unguarded_linear_insert().

Referenced by __chunk_insertion_sort(), __final_insertion_sort(), __inplace_stable_sort(), and __introselect().

template<typename _RandomAccessIterator, typename _Size, typename _Compare>
void std::__introsort_loop ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Size  __depth_limit,
_Compare  __comp 
)

This is a helper function for the sort routine.

Definition at line 1928 of file stl_algo.h.

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

template<typename _RandomAccessIterator, typename _Size>
void std::__introsort_loop ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Size  __depth_limit 
)

This is a helper function for the sort routine.

Definition at line 1896 of file stl_algo.h.

References __median(), and __unguarded_partition().

Referenced by __introsort_loop(), and sort().

template<typename _Functor, typename... _Args>
__gnu_cxx::__enable_if< (is_member_pointer< _Functor >::value &&!is_function< _Functor >::value &&!is_function< typename remove_pointer< _Functor >::type >::value), typename result_of< _Functor(_Args...)>::type >::__type std::__invoke ( _Functor &  __f,
_Args &...  __args 
) [inline]

Invoke a function object, which may be either a member pointer or a function object. The first parameter will tell which.

Definition at line 270 of file tr1_impl/functional.

template<typename _Iter>
iterator_traits<_Iter>::iterator_category std::__iterator_category ( const _Iter &   )  [inline]

This function is not a part of the C++ standard but is syntactic sugar for internal library use only.

Definition at line 166 of file stl_iterator_base_types.h.

Referenced by __gnu_cxx::__uninitialized_copy_n(), std::vector< bool, _Alloc >::_M_assign_dispatch(), std::vector< bool, _Alloc >::_M_initialize_dispatch(), std::vector< bool, _Alloc >::_M_insert_dispatch(), advance(), __gnu_cxx::copy_n(), distance(), __gnu_cxx::distance(), find(), find_end(), find_if(), __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >::insert_equal(), __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >::insert_unique(), partition(), reverse(), search_n(), __gnu_cxx::uninitialized_copy_n(), and unique_copy().

template<typename _Size>
_Size std::__lg ( _Size  __n  )  [inline]

This is a helper function for the sort routines. Precondition: __n > 0.

Definition at line 1961 of file stl_algo.h.

Referenced by std::tr1::__detail::__log_gamma_bernoulli(), nth_element(), and sort().

template<typename _BidirectionalIterator, typename _Distance, typename _Pointer, typename _Compare>
void std::__merge_adaptive ( _BidirectionalIterator  __first,
_BidirectionalIterator  __middle,
_BidirectionalIterator  __last,
_Distance  __len1,
_Distance  __len2,
_Pointer  __buffer,
_Distance  __buffer_size,
_Compare  __comp 
)

This is a helper function for the merge routines.

Definition at line 2613 of file stl_algo.h.

References __merge_adaptive(), __merge_backward(), __rotate_adaptive(), advance(), and distance().

template<typename _BidirectionalIterator, typename _Distance, typename _Pointer>
void std::__merge_adaptive ( _BidirectionalIterator  __first,
_BidirectionalIterator  __middle,
_BidirectionalIterator  __last,
_Distance  __len1,
_Distance  __len2,
_Pointer  __buffer,
_Distance  __buffer_size 
)

This is a helper function for the merge routines.

Definition at line 2557 of file stl_algo.h.

References __merge_backward(), __rotate_adaptive(), advance(), and distance().

Referenced by __merge_adaptive(), __stable_sort_adaptive(), and inplace_merge().

template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, typename _BidirectionalIterator3, typename _Compare>
_BidirectionalIterator3 std::__merge_backward ( _BidirectionalIterator1  __first1,
_BidirectionalIterator1  __last1,
_BidirectionalIterator2  __first2,
_BidirectionalIterator2  __last2,
_BidirectionalIterator3  __result,
_Compare  __comp 
)

This is a helper function for the merge routines.

Definition at line 2489 of file stl_algo.h.

template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, typename _BidirectionalIterator3>
_BidirectionalIterator3 std::__merge_backward ( _BidirectionalIterator1  __first1,
_BidirectionalIterator1  __last1,
_BidirectionalIterator2  __first2,
_BidirectionalIterator2  __last2,
_BidirectionalIterator3  __result 
)

This is a helper function for the merge routines.

Definition at line 2454 of file stl_algo.h.

Referenced by __merge_adaptive().

template<typename _BidirectionalIterator, typename _Distance, typename _Compare>
void std::__merge_without_buffer ( _BidirectionalIterator  __first,
_BidirectionalIterator  __middle,
_BidirectionalIterator  __last,
_Distance  __len1,
_Distance  __len2,
_Compare  __comp 
)

This is a helper function for the merge routines.

Definition at line 2714 of file stl_algo.h.

References __merge_without_buffer(), advance(), and distance().

template<typename _BidirectionalIterator, typename _Distance>
void std::__merge_without_buffer ( _BidirectionalIterator  __first,
_BidirectionalIterator  __middle,
_BidirectionalIterator  __last,
_Distance  __len1,
_Distance  __len2 
)

This is a helper function for the merge routines.

Definition at line 2670 of file stl_algo.h.

References advance(), and distance().

Referenced by __inplace_stable_sort(), __merge_without_buffer(), and inplace_merge().

template<typename _BidirectionalIterator, typename _Predicate>
_BidirectionalIterator std::__partition ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last,
_Predicate  __pred,
bidirectional_iterator_tag   
)

This is a helper function...

Definition at line 1401 of file stl_algo.h.

template<typename _ForwardIterator, typename _Predicate>
_ForwardIterator std::__partition ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Predicate  __pred,
forward_iterator_tag   
)

This is a helper function...

Definition at line 1376 of file stl_algo.h.

Referenced by partition().

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

This is an uglified reverse(_BidirectionalIterator, _BidirectionalIterator) overloaded for random access iterators.

Definition at line 1081 of file stl_algo.h.

template<typename _BidirectionalIterator>
void std::__reverse ( _BidirectionalIterator  __first,
_BidirectionalIterator  __last,
bidirectional_iterator_tag   
)

This is an uglified reverse(_BidirectionalIterator, _BidirectionalIterator) overloaded for bidirectional iterators.

Definition at line 1061 of file stl_algo.h.

Referenced by __rotate(), and reverse().

template<typename _RandomAccessIterator>
void std::__rotate ( _RandomAccessIterator  __first,
_RandomAccessIterator  __middle,
_RandomAccessIterator  __last,
random_access_iterator_tag   
)

This is a helper function for the rotate algorithm.

Definition at line 1239 of file stl_algo.h.

References __gcd(), __glibcxx_function_requires, and _GLIBCXX_MOVE.

Referenced by __gnu_cxx::bitmap_allocator< _Tp >::_M_deallocate_single_object().

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

This is a helper function for the rotate algorithm.

Definition at line 1209 of file stl_algo.h.

References __glibcxx_function_requires, and __reverse().

template<typename _ForwardIterator>
void std::__rotate ( _ForwardIterator  __first,
_ForwardIterator  __middle,
_ForwardIterator  __last,
forward_iterator_tag   
)

This is a helper function for the rotate algorithm.

Definition at line 1173 of file stl_algo.h.

Referenced by rotate().

template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, typename _Distance>
_BidirectionalIterator1 std::__rotate_adaptive ( _BidirectionalIterator1  __first,
_BidirectionalIterator1  __middle,
_BidirectionalIterator1  __last,
_Distance  __len1,
_Distance  __len2,
_BidirectionalIterator2  __buffer,
_Distance  __buffer_size 
)

This is a helper function for the merge routines.

Definition at line 2525 of file stl_algo.h.

References advance(), and distance().

Referenced by __merge_adaptive().

template<typename _RandomAccessIter, typename _Integer, typename _Tp, typename _BinaryPredicate>
_RandomAccessIter std::__search_n ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_Integer  __count,
const _Tp &  __val,
_BinaryPredicate  __binary_pred,
std::random_access_iterator_tag   
)

This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, _BinaryPredicate) overloaded for random access iterators.

Definition at line 408 of file stl_algo.h.

template<typename _ForwardIterator, typename _Integer, typename _Tp, typename _BinaryPredicate>
_ForwardIterator std::__search_n ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Integer  __count,
const _Tp &  __val,
_BinaryPredicate  __binary_pred,
std::forward_iterator_tag   
)

This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, _BinaryPredicate) overloaded for forward iterators.

Definition at line 369 of file stl_algo.h.

template<typename _RandomAccessIter, typename _Integer, typename _Tp>
_RandomAccessIter std::__search_n ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_Integer  __count,
const _Tp &  __val,
std::random_access_iterator_tag   
)

This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) overloaded for random access iterators.

Definition at line 315 of file stl_algo.h.

template<typename _ForwardIterator, typename _Integer, typename _Tp>
_ForwardIterator std::__search_n ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Integer  __count,
const _Tp &  __val,
std::forward_iterator_tag   
)

This is an uglified search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) overloaded for forward iterators.

Definition at line 283 of file stl_algo.h.

Referenced by search_n(), and std::__parallel::search_n_switch().

template<typename _ForwardIterator, typename _Pointer, typename _Predicate, typename _Distance>
_ForwardIterator std::__stable_partition_adaptive ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Predicate  __pred,
_Distance  __len,
_Pointer  __buffer,
_Distance  __buffer_size 
)

This is a helper function...

Definition at line 1456 of file stl_algo.h.

References advance(), and distance().

Referenced by stable_partition().

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

This is a helper function for the sort routine.

Definition at line 1805 of file stl_algo.h.

References __unguarded_linear_insert().

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

This is a helper function for the sort routine.

Definition at line 1792 of file stl_algo.h.

References __unguarded_linear_insert().

Referenced by __final_insertion_sort().

template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
void std::__unguarded_linear_insert ( _RandomAccessIterator  __last,
_Tp  __val,
_Compare  __comp 
)

This is a helper function for the sort routine.

Definition at line 1730 of file stl_algo.h.

template<typename _RandomAccessIterator, typename _Tp>
void std::__unguarded_linear_insert ( _RandomAccessIterator  __last,
_Tp  __val 
)

This is a helper function for the sort routine.

Definition at line 1714 of file stl_algo.h.

Referenced by __insertion_sort(), and __unguarded_insertion_sort().

template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
_RandomAccessIterator std::__unguarded_partition ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Tp  __pivot,
_Compare  __comp 
)

This is a helper function...

Definition at line 1875 of file stl_algo.h.

template<typename _RandomAccessIterator, typename _Tp>
_RandomAccessIterator std::__unguarded_partition ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Tp  __pivot 
)

This is a helper function...

Definition at line 1855 of file stl_algo.h.

Referenced by __introselect(), and __introsort_loop().

template<typename _InputIterator, typename _ForwardIterator, typename _BinaryPredicate>
_ForwardIterator std::__unique_copy ( _InputIterator  __first,
_InputIterator  __last,
_ForwardIterator  __result,
_BinaryPredicate  __binary_pred,
input_iterator_tag  ,
forward_iterator_tag   
)

This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for input iterators and forward iterator as result.

Definition at line 1038 of file stl_algo.h.

References __glibcxx_function_requires.

template<typename _InputIterator, typename _OutputIterator, typename _BinaryPredicate>
_OutputIterator std::__unique_copy ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
_BinaryPredicate  __binary_pred,
input_iterator_tag  ,
output_iterator_tag   
)

This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for input iterators and output iterator as result.

Definition at line 1009 of file stl_algo.h.

References __glibcxx_function_requires.

template<typename _ForwardIterator, typename _OutputIterator, typename _BinaryPredicate>
_OutputIterator std::__unique_copy ( _ForwardIterator  __first,
_ForwardIterator  __last,
_OutputIterator  __result,
_BinaryPredicate  __binary_pred,
forward_iterator_tag  ,
output_iterator_tag   
)

This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator, _BinaryPredicate) overloaded for forward iterators and output iterator as result.

Definition at line 980 of file stl_algo.h.

References __glibcxx_function_requires.

template<typename _InputIterator, typename _ForwardIterator>
_ForwardIterator std::__unique_copy ( _InputIterator  __first,
_InputIterator  __last,
_ForwardIterator  __result,
input_iterator_tag  ,
forward_iterator_tag   
)

This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for input iterators and forward iterator as result.

Definition at line 959 of file stl_algo.h.

template<typename _InputIterator, typename _OutputIterator>
_OutputIterator std::__unique_copy ( _InputIterator  __first,
_InputIterator  __last,
_OutputIterator  __result,
input_iterator_tag  ,
output_iterator_tag   
)

This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for input iterators and output iterator as result.

Definition at line 936 of file stl_algo.h.

template<typename _ForwardIterator, typename _OutputIterator>
_OutputIterator std::__unique_copy ( _ForwardIterator  __first,
_ForwardIterator  __last,
_OutputIterator  __result,
forward_iterator_tag  ,
output_iterator_tag   
)

This is an uglified unique_copy(_InputIterator, _InputIterator, _OutputIterator) overloaded for forward iterators and output iterator as result.

Definition at line 913 of file stl_algo.h.

Referenced by unique_copy().

template<typename _T1, typename _T2>
void std::_Construct ( _T1 *  __p,
const _T2 &  __value 
) [inline]

Constructs an object in existing memory by invoking an allocated object's constructor with an initializer.

Definition at line 75 of file stl_construct.h.

Referenced by __gnu_cxx::__uninitialized_copy_n(), std::raw_storage_iterator< _OutputIterator, _Tp >::operator=(), std::__uninitialized_fill<>::uninitialized_fill(), and std::__uninitialized_fill_n<>::uninitialized_fill_n().

template<typename _ForwardIterator>
void std::_Destroy ( _ForwardIterator  __first,
_ForwardIterator  __last 
) [inline]

Destroy a range of objects. If the value_type of the object has a trivial destructor, the compiler should optimize all of this away, otherwise the objects' destructors must be invoked.

Definition at line 97 of file stl_construct.h.

References _Destroy().

template<typename _Tp>
void std::_Destroy ( _Tp *  __pointer  )  [inline]

Destroy the object pointed to by a pointer type.

Definition at line 87 of file stl_construct.h.

Referenced by __uninitialized_copy_a(), __uninitialized_copy_move(), __gnu_cxx::__uninitialized_copy_n(), __gnu_cxx::__uninitialized_copy_n_a(), __uninitialized_fill_a(), __uninitialized_fill_move(), __uninitialized_fill_n_a(), __uninitialized_move_copy(), __uninitialized_move_fill(), _Destroy(), std::vector< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_destroy_data_aux(), std::vector< std::sub_match< _Bi_iter >, _Allocator >::_M_erase_at_end(), std::deque< _Tp, _Alloc >::_M_fill_initialize(), std::vector< _Tp, _Alloc >::_M_fill_insert(), std::vector< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::vector< _Tp, _Alloc >::operator=(), std::vector< _Tp, _Alloc >::reserve(), std::__uninitialized_copy<>::uninitialized_copy(), std::__uninitialized_fill<>::uninitialized_fill(), std::__uninitialized_fill_n<>::uninitialized_fill_n(), std::_Temporary_buffer< _ForwardIterator, _Tp >::~_Temporary_buffer(), and std::vector< std::sub_match< _Bi_iter >, _Allocator >::~vector().

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

Accumulate values in a range with operation.

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

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

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Accumulate values in a range.

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

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

Definition at line 83 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

Referenced by __gnu_parallel::parallel_partial_sum_linear().

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

Return differences between adjacent values.

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

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

Definition at line 315 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Return differences between adjacent values.

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

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

Definition at line 276 of file stl_numeric.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Find two adjacent values in a sequence using a predicate.

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

Definition at line 3956 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Find two adjacent values in a sequence that are equal.

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

Definition at line 3925 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

A generalization of pointer arithmetic.

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

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

Definition at line 173 of file stl_iterator_base_funcs.h.

References __advance(), and __iterator_category().

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

template<typename _Tp>
__gnu_cxx::__promote<_Tp>::__type std::arg ( _Tp  __x  )  [inline]

Additional overloads [8.1.9].

Definition at line 312 of file impl/complex.

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

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

Definition at line 456 of file stl_iterator.h.

Referenced by regex_replace().

template<typename _Functor, typename... _ArgTypes>
_Bind_result< _Result, typename _Maybe_wrap_member_pointer< _Functor >::type(_ArgTypes...)> std::bind ( _Functor  __f,
_ArgTypes...  __args 
) [inline]

bind

Definition at line 1344 of file tr1_impl/functional.

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

Calls base.setf(ios_base::boolalpha).

Definition at line 792 of file ios_base.h.

References std::ios_base::setf().

Referenced by noboolalpha().

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

Copies the range [first,last) into result.

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

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

Definition at line 456 of file stl_algobase.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Copies the range [first,last) into result.

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

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

Definition at line 624 of file stl_algobase.h.

References __copy_move_backward_a2(), __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

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

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

Definition at line 3987 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

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

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

Definition at line 4011 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

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

Definition at line 930 of file ios_base.h.

References std::ios_base::setf().

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

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

A generalization of pointer arithmetic.

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

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

Definition at line 115 of file stl_iterator_base_funcs.h.

References __distance(), and __iterator_category().

Referenced by std::__detail::__distance_fw(), __find_end(), __inplace_stable_partition(), __is_heap(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), std::vector< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_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< std::sub_match< _Bi_iter >, _Allocator >::_M_range_initialize(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::deque< _Tp, _Alloc >::_M_range_insert_aux(), std::_Hashtable< _Value, _Value, _Alloc, std::_Identity< _Value >, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, __cache_hash_code, true, false >::bucket_size(), std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::count(), equal_range(), inplace_merge(), __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >::insert_equal(), __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >::insert_unique(), std::sub_match< _BiIter >::length(), lower_bound(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), std::match_results< _Bi_iter >::position(), __gnu_cxx::random_sample_n(), std::list< _Tp, _Alloc >::size(), and upper_bound().

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

Write a newline and flush the stream.

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

Definition at line 545 of file ostream.

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

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

Write a null character into the output sequence.

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

Definition at line 556 of file ostream.

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

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

Tests a range for element-wise equality.

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

Definition at line 938 of file stl_algobase.h.

References __equal_aux(), __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Tests a range for element-wise equality.

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

Definition at line 969 of file stl_algobase.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _Tp>
_Tp std::fabs ( const std::complex< _Tp > &   )  [inline]

fabs(__z) [8.1.8].

Definition at line 301 of file impl/complex.

References abs().

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

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 char types filling contiguous areas of memory, this becomes an inline call to memset or wmemset.

Definition at line 719 of file stl_algobase.h.

References __fill_a(), __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _OI, typename _Size, typename _Tp>
_OI std::fill_n ( _OI  __first,
_Size  __n,
const _Tp &  __value 
) [inline]

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 char types filling contiguous areas of memory, this becomes an inline call to memset or @ wmemset.

Definition at line 772 of file stl_algobase.h.

References __fill_n_a(), and __glibcxx_function_requires.

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

Find the first occurrence of a value in a sequence.

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

Definition at line 3805 of file stl_algo.h.

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

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

Find last matching subsequence in a sequence using a predicate.

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

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

Definition at line 651 of file stl_algo.h.

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

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

Find last matching subsequence in a sequence.

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

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

Definition at line 605 of file stl_algo.h.

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

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

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

Parameters:
first1 Start of range to search.
last1 End of range to search.
first2 Start of match candidates.
last2 End of match candidates.
comp Predicate to use.
Returns:
The first iterator i in the range [first1,last1) such that comp(*i, *(i2)) is true and i2 is an iterator 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 3895 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Find element from a set in a sequence.

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

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

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

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

Definition at line 3828 of file stl_algo.h.

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

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

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

Definition at line 955 of file ios_base.h.

References std::ios_base::setf().

Referenced by operator<<().

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

Flushes the output stream.

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

Definition at line 566 of file ostream.

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

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

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

Apply a function to every element of a sequence.

Parameters:
first An input iterator.
last An input iterator.
f A unary function object.
Returns:
f.
Applies the function object f to each element in the range [first,last). f must not modify the order of the sequence. If f has a return value it is ignored.

Definition at line 3785 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

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

Definition at line 539 of file stl_iterator.h.

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

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

Parameters:
first A forward iterator.
last A forward iterator.
gen A function object taking no arguments and returning std::iterator_traits<_ForwardIterator>::value_type
Returns:
generate() returns no value.
Performs the assignment *i = gen() for each i in the range [first,last).

Definition at line 4398 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

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

Parameters:
first A forward iterator.
n The length of the sequence.
gen A function object taking no arguments and returning std::iterator_traits<_ForwardIterator>::value_type
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 4425 of file stl_algo.h.

References __glibcxx_function_requires.

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

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 90 of file stl_tempbuf.h.

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

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

Read a line from stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
Returns:
Reference to the input stream.
Stores characters from is into str until '
' is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If end of line was encountered, it is extracted but not stored into str.

Definition at line 2318 of file vstring.h.

References std::basic_ios< _CharT, _Traits >::widen().

Referenced by std::basic_istream< char >::getline(), and getline().

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

Read a line from stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
delim Character marking end of line.
Returns:
Reference to the input stream.
Stores characters from is into str until delim is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If delim was encountered, it is extracted but not stored into str.

Definition at line 627 of file vstring.tcc.

References std::basic_ios< _CharT, _Traits >::_M_setstate(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::append(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::erase(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().

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

Read a line from stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
Returns:
Reference to the input stream.
Stores characters from is into str until '
' is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If end of line was encountered, it is extracted but not stored into str.

Definition at line 2460 of file basic_string.h.

References getline(), and std::basic_ios< _CharT, _Traits >::widen().

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

Read a line from stream into a string.

Parameters:
is Input stream.
str Buffer to store into.
delim Character marking end of line.
Returns:
Reference to the input stream.
Stores characters from is into str until delim is found, the end of the stream is encountered, or str.max_size() is reached. If is.width() is non-zero, that is the limit on the number of characters stored into str. Any previous contents of str are erased. If delim was encountered, it is extracted but not stored into str.

Definition at line 1043 of file basic_string.tcc.

References std::basic_ios< _CharT, _Traits >::_M_setstate(), std::basic_string< _CharT, _Traits, _Alloc >::erase(), std::basic_string< _CharT, _Traits, _Alloc >::max_size(), std::basic_ios< _CharT, _Traits >::rdbuf(), and std::basic_ios< _CharT, _Traits >::setstate().

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

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 96 of file locale_classes.tcc.

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

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

Definition at line 938 of file ios_base.h.

References std::ios_base::setf().

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

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

Compute inner product of two ranges.

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

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

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Compute inner product of two ranges.

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

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

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Merges two sorted ranges in place.

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

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

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

Definition at line 2830 of file stl_algo.h.

References __glibcxx_function_requires, __glibcxx_requires_sorted_pred, __merge_adaptive(), __merge_without_buffer(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), distance(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().

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

Merges two sorted ranges in place.

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

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

Definition at line 2776 of file stl_algo.h.

References __glibcxx_function_requires, __glibcxx_requires_sorted, __merge_adaptive(), __merge_without_buffer(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), distance(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().

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

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

Definition at line 645 of file stl_iterator.h.

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

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

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

Definition at line 905 of file ios_base.h.

References std::ios_base::setf().

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

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

Definition at line 2611 of file locale_facets.h.

References std::ctype_base::alnum.

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

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

Definition at line 2587 of file locale_facets.h.

References std::ctype_base::alpha.

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

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

Definition at line 2569 of file locale_facets.h.

References std::ctype_base::cntrl.

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

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

Definition at line 2593 of file locale_facets.h.

References std::ctype_base::digit.

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

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

Definition at line 2617 of file locale_facets.h.

References std::ctype_base::graph.

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

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

Definition at line 2581 of file locale_facets.h.

References std::ctype_base::lower.

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

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

Definition at line 2563 of file locale_facets.h.

References std::ctype_base::print.

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

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

Definition at line 2599 of file locale_facets.h.

References std::ctype_base::punct.

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

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

Definition at line 2557 of file locale_facets.h.

References std::ctype_base::space.

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

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

Definition at line 2575 of file locale_facets.h.

References std::ctype_base::upper.

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

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

Definition at line 2605 of file locale_facets.h.

References std::ctype_base::xdigit.

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

Swaps the contents of two iterators.

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

Definition at line 121 of file stl_algobase.h.

References __glibcxx_function_requires.

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

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

Definition at line 913 of file ios_base.h.

References std::ios_base::setf().

Referenced by __ostream_insert(), operator<<(), and __gnu_parallel::parallel_partition().

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

Performs "dictionary" comparison on ranges.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
last2 An input iterator.
comp A comparison functor.
Returns:
A boolean true or false.
The same as the four-parameter lexicographical_compare, but uses the comp parameter instead of <.

Definition at line 1033 of file stl_algobase.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _II1, typename _II2>
bool std::lexicographical_compare ( _II1  __first1,
_II1  __last1,
_II2  __first2,
_II2  __last2 
) [inline]

Performs "dictionary" comparison on ranges.

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

Definition at line 999 of file stl_algobase.h.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, and __lexicographical_compare_aux().

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

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 411 of file stl_heap.h.

References __adjust_heap(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and _GLIBCXX_MOVE.

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

Construct a heap over a range.

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

Definition at line 371 of file stl_heap.h.

References __adjust_heap(), __glibcxx_function_requires, __glibcxx_requires_valid_range, and _GLIBCXX_MOVE.

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

A convenience wrapper for creating a pair from two objects.

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

Definition at line 218 of file stl_pair.h.

Referenced by __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_get_distance(), std::__detail::_Prime_rehash_policy::_M_need_rehash(), std::__debug::set< _Key, _Compare, _Allocator >::equal_range(), __gnu_debug::_Safe_association< ::std::__debug::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > >::equal_range(), std::__debug::multiset< _Key, _Compare, _Allocator >::equal_range(), std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >::equal_range(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::equal_range(), std::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::equal_range(), __gnu_parallel::find_template(), __gnu_debug::_Safe_association< ::std::__debug::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > >::insert(), std::__parallel::mismatch_switch(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), std::__detail::_Map_base< _Key, _Pair, std::_Select1st< _Pair >, true, _Hashtable >::operator[](), __gnu_parallel::parallel_merge_advance(), __gnu_parallel::parallel_multiway_merge(), __gnu_parallel::parallel_set_operation(), __gnu_parallel::parallel_sort_mwms_pu(), __gnu_parallel::parallel_sort_qsb(), __gnu_parallel::qsb_local_sort_with_helping(), __gnu_parallel::find_first_of_selector< ForwardIterator >::sequential_algorithm(), __gnu_parallel::adjacent_find_selector::sequential_algorithm(), and __gnu_parallel::find_if_selector::sequential_algorithm().

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

This does what you think it does.

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

Definition at line 252 of file stl_algobase.h.

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

This does what you think it does.

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

Definition at line 210 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by std::tr1::__detail::__bessel_jn(), std::tr1::__detail::__ellint_rd(), std::tr1::__detail::__ellint_rf(), std::tr1::__detail::__ellint_rj(), std::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::_Hashtable(), std::vector< std::sub_match< _Bi_iter >, _Allocator >::_M_check_len(), std::vector< bool, _Alloc >::_M_check_len(), std::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), std::__detail::_Prime_rehash_policy::_M_need_rehash(), std::deque< _Tp, _Alloc >::_M_reallocate_map(), __gnu_cxx::rope< _CharT, _Alloc >::_S_apply_to_pieces(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(), and std::_Hashtable< _Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys >::rehash().

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

Return the maximum element in a range using comparison functor.

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

Definition at line 5616 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Return the maximum element in a range.

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

Definition at line 5589 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _Tp, typename _Class>
_Mem_fn<_Tp _Class::*> std::mem_fn ( _Tp _Class::*  __pm  )  [inline]

Returns a function object that forwards to the member pointer pm.

Definition at line 799 of file tr1_impl/functional.

Referenced by __callable_functor(), std::_Function_handler< void(_ArgTypes...), _Member _Class::* >::_M_invoke(), and std::_Function_handler< _Res(_ArgTypes...), _Member _Class::* >::_M_invoke().

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

Merges two sorted ranges.

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

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

Definition at line 4908 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_sorted_set_pred.

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

Merges two sorted ranges.

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

Definition at line 4846 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_sorted_set.

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

This does what you think it does.

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

Definition at line 232 of file stl_algobase.h.

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

This does what you think it does.

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

Definition at line 188 of file stl_algobase.h.

References __glibcxx_function_requires.

Referenced by std::__lexicographical_compare< true >::__lc(), __merge_sort_loop(), std::bitset< _Nb >::_M_copy_from_string(), std::time_get< _CharT, _InIter >::_M_extract_name(), __gnu_cxx::rope< _CharT, _Alloc >::_S_apply_to_pieces(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::compare(), std::basic_string< _CharT, _Traits, _Alloc >::compare(), std::basic_string< _CharT, _Traits, _Allocator >::compare(), std::codecvt< _InternT, _ExternT, encoding_state >::do_length(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), __gnu_parallel::multiway_merge_3_combined(), __gnu_parallel::multiway_merge_4_combined(), __gnu_parallel::multiway_merge_loser_tree(), __gnu_parallel::multiway_merge_loser_tree_combined(), __gnu_parallel::multiway_merge_loser_tree_sentinel(), __gnu_parallel::multiway_merge_loser_tree_unguarded(), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(), __gnu_parallel::parallel_multiway_merge(), __gnu_parallel::parallel_random_shuffle_drs(), __gnu_parallel::parallel_set_operation(), __gnu_parallel::parallel_sort_qs_divide(), std::basic_istream< _CharT, _Traits >::readsome(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::rfind(), std::basic_string< _CharT, _Traits, _Alloc >::rfind(), __gnu_parallel::search_template(), __gnu_parallel::sequential_random_shuffle(), std::basic_filebuf< _CharT, _Traits >::underflow(), std::basic_streambuf< _CharT, _Traits >::xsgetn(), std::basic_streambuf< _CharT, _Traits >::xsputn(), and std::basic_filebuf< _CharT, _Traits >::xsputn().

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

Return the minimum element in a range using comparison functor.

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

Definition at line 5562 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Return the minimum element in a range.

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

Definition at line 5535 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Finds the places in ranges which don't match.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
binary_pred A binary predicate functor.
Returns:
A pair of iterators pointing to the first mismatch.
This compares the elements of two ranges using the binary_pred parameter, and returns a pair of iterators. The first iterator points into the first range, the second iterator points into the second range, and the elements pointed to by the iterators are not equal.

Definition at line 1109 of file stl_algobase.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Finds the places in ranges which don't match.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
Returns:
A pair of iterators pointing to the first mismatch.
This compares the elements of two ranges using == and returns a pair of iterators. The first iterator points into the first range, the second iterator points into the second range, and the elements pointed to by the iterators are not equal.

Definition at line 1072 of file stl_algobase.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

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

Parameters:
first Start of range.
last End of range.
comp A comparison functor.
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 3273 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Permute range into the next "dictionary" ordering.

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

Definition at line 3217 of file stl_algo.h.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

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

Calls base.unsetf(ios_base::boolalpha).

Definition at line 800 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::showbase).

Definition at line 816 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::showpoint).

Definition at line 832 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::showpos).

Definition at line 848 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::skipws).

Definition at line 864 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::unitbuf).

Definition at line 896 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::uppercase).

Definition at line 880 of file ios_base.h.

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

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

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

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

Definition at line 4733 of file stl_algo.h.

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

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

Sort a sequence just enough to find a particular position.

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

Definition at line 4695 of file stl_algo.h.

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

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

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

Definition at line 946 of file ios_base.h.

References std::ios_base::setf().

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

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

Global bitwise operations on bitsets.

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

Definition at line 1205 of file bitset.

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

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

Definition at line 135 of file stream_iterator.h.

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

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

Based on operator==.

Definition at line 1133 of file stl_vector.h.

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

Based on operator==.

Definition at line 262 of file stl_stack.h.

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

Returns !(x == y).

Definition at line 619 of file stl_set.h.

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

Based on operator==.

Definition at line 297 of file stl_queue.h.

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

Uses operator== to find the result.

Definition at line 164 of file stl_pair.h.

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

Returns !(x == y).

Definition at line 606 of file stl_multiset.h.

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

Based on operator==.

Definition at line 708 of file stl_multimap.h.

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

Based on operator==.

Definition at line 779 of file stl_map.h.

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

Based on operator==.

Definition at line 1422 of file stl_list.h.

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

Based on operator==.

Definition at line 1725 of file stl_deque.h.

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

Test difference of string and C string.

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

Definition at line 2224 of file basic_string.h.

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

Test difference of C string and string.

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

Definition at line 2212 of file basic_string.h.

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

Test difference of two strings.

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

Definition at line 2200 of file basic_string.h.

template<typename _Signature>
bool std::operator!= ( const function< _Signature > &  __f,
_M_clear_type *   
) [inline]

Compares a polymorphic function object wrapper against 0 (the NULL pointer).