Namespaces | Classes | Typedefs | Enumerations | Functions | Variables

std Namespace Reference

ISO C++ entities toplevel namespace is std. More...

Namespaces

Classes

Typedefs

Enumerations

Functions

Matching, Searching, and Replacing

Variables

Standard Stream Objects

The <iostream> header declares the eight standard stream objects. For other declarations, see http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt11ch24.html 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.


Detailed Description

ISO C++ entities toplevel namespace is std.


Typedef Documentation

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 75 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 96 of file postypes.h.

typedef fpos<mbstate_t> std::streampos

File position for char streams.

Definition at line 230 of file postypes.h.

typedef ptrdiff_t std::streamsize

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

Definition at line 100 of file postypes.h.

typedef fpos<mbstate_t> std::u16streampos

File position for char16_t streams.

Definition at line 236 of file postypes.h.

typedef fpos<mbstate_t> std::u32streampos

File position for char32_t streams.

Definition at line 238 of file postypes.h.

typedef fpos<mbstate_t> std::wstreampos

File position for wchar_t streams.

Definition at line 232 of file postypes.h.


Enumeration Type Documentation

anonymous enum
Todo:
Needs documentation! See http://gcc.gnu.org/onlinedocs/libstdc++/manual/documentation_style.html This controls some aspect of the sort routines.

Definition at line 2171 of file stl_algo.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_toward_zero 

Intermediate.

round_to_nearest 

To zero.

round_toward_infinity 

To the nearest representable value.

round_toward_neg_infinity 

To infinity.

Definition at line 157 of file limits.


Function Documentation

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

This is a helper function for the sort routine.

Definition at line 2176 of file stl_algo.h.

References __insertion_sort(), and __unguarded_insertion_sort().

Referenced by sort().

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

References __insertion_sort(), and __unguarded_insertion_sort().

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

Referenced by find().

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

Referenced by find_if().

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

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

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

Definition at line 251 of file stl_algo.h.

Referenced by find_if_not().

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

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

Definition at line 262 of file stl_algo.h.

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

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

References make_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 1899 of file stl_algo.h.

References make_heap().

Referenced by 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 1776 of file stl_algo.h.

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

Referenced by stable_partition().

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 3377 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::__inplace_stable_sort ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_Compare  __comp 
)

This is a helper function for the stable sorting routines.

Definition at line 3396 of file stl_algo.h.

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

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

References __unguarded_linear_insert().

Referenced by __final_insertion_sort(), and __inplace_stable_sort().

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

References __unguarded_partition_pivot().

Referenced by __introsort_loop(), and sort().

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

References __introsort_loop(), and __unguarded_partition_pivot().

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

This is a helper function for the sort routines and for random.tcc.

Definition at line 972 of file stl_algobase.h.

Referenced by nth_element(), std::linear_congruential_engine< _UIntType, __a, __c, __m >::seed(), and sort().

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

References __move_merge(), __move_merge_backward(), __rotate_adaptive(), advance(), distance(), lower_bound(), and upper_bound().

Referenced by __merge_adaptive(), and inplace_merge().

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

References __merge_adaptive(), __move_merge(), __move_merge_backward(), __rotate_adaptive(), advance(), distance(), lower_bound(), and upper_bound().

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

References advance(), distance(), iter_swap(), lower_bound(), rotate(), and upper_bound().

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

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

References __merge_without_buffer(), advance(), distance(), iter_swap(), lower_bound(), rotate(), and upper_bound().

template<typename _Iterator >
void std::__move_median_first ( _Iterator  __a,
_Iterator  __b,
_Iterator  __c 
)

Swaps the median value of *__a, *__b and *__c to *__a.

Definition at line 80 of file stl_algo.h.

References iter_swap().

Referenced by __unguarded_partition_pivot().

template<typename _Iterator , typename _Compare >
void std::__move_median_first ( _Iterator  __a,
_Iterator  __b,
_Iterator  __c,
_Compare  __comp 
)

Swaps the median value of *__a, *__b and *__c under __comp to *__a.

Definition at line 104 of file stl_algo.h.

References iter_swap().

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

This is a helper function for the merge routines.

Definition at line 2794 of file stl_algo.h.

Referenced by __merge_adaptive().

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

This is a helper function for the merge routines.

Definition at line 2821 of file stl_algo.h.

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

This is a helper function for the merge routines.

Definition at line 2723 of file stl_algo.h.

Referenced by __merge_adaptive().

template<typename _BidirectionalIterator1 , typename _BidirectionalIterator2 , typename _BidirectionalIterator3 , typename _Compare >
_BidirectionalIterator3 std::__move_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 2758 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 1721 of file stl_algo.h.

References iter_swap().

Referenced by partition().

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

References iter_swap().

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

References iter_swap().

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

References iter_swap().

Referenced by __rotate(), and reverse().

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

References __reverse(), and iter_swap().

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

References iter_swap(), and swap_ranges().

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

References iter_swap().

Referenced by __gnu_cxx::bitmap_allocator< _Tp >::_M_deallocate_single_object(), and 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 2849 of file stl_algo.h.

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

Referenced by __merge_adaptive().

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

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

Referenced by search_n().

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

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

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

Referenced by stable_partition().

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

References __unguarded_linear_insert().

Referenced by __final_insertion_sort().

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

References __unguarded_linear_insert().

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

This is a helper function for the sort routine.

Definition at line 2062 of file stl_algo.h.

Referenced by __insertion_sort(), and __unguarded_insertion_sort().

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

This is a helper function for the sort routine.

Definition at line 2080 of file stl_algo.h.

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

This is a helper function...

Definition at line 2207 of file stl_algo.h.

References iter_swap().

Referenced by __unguarded_partition_pivot().

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

This is a helper function...

Definition at line 2227 of file stl_algo.h.

References iter_swap().

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

This is a helper function...

Definition at line 2248 of file stl_algo.h.

References __move_median_first(), and __unguarded_partition().

Referenced by __introsort_loop().

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

This is a helper function...

Definition at line 2260 of file stl_algo.h.

References __move_median_first(), and __unguarded_partition().

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

Referenced by unique_copy().

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

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

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

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

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

template<typename _T1 , typename... _Args>
void std::_Construct ( _T1 *  __p,
_Args &&...  __args 
) [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.

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 123 of file stl_construct.h.

template<typename _Tp >
void std::_Destroy ( _Tp *  __pointer  )  [inline]
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 121 of file stl_numeric.h.

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

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

acos(__z) [8.1.2].

Definition at line 1580 of file complex.

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

acosh(__z) [8.1.5].

Definition at line 1699 of file complex.

template<typename _Tp >
_Tp* std::addressof ( _Tp &  __r  )  [inline]

declval, from type_traits.

Returns the actual address of the object or function referenced by r, even in the presence of an overloaded operator&.

Parameters:
__r Reference to an object or function.
Returns:
The actual address.

Definition at line 96 of file move.h.

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.

_GLIBCXX_RESOLVE_LIB_DEFECTS DR 539. partial_sum and adjacent_difference should mention requirements

Definition at line 317 of file stl_numeric.h.

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.

_GLIBCXX_RESOLVE_LIB_DEFECTS DR 539. partial_sum and adjacent_difference should mention requirements

Definition at line 359 of file stl_numeric.h.

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

References __iterator_category().

Referenced by __inplace_stable_partition(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), std::deque< _Tp, _Alloc >::_M_range_initialize(), equal_range(), is_permutation(), lower_bound(), partition_point(), and upper_bound().

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

Additional overloads [8.1.9].

Definition at line 1797 of file complex.

References arg().

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

asin(__z) [8.1.3].

Definition at line 1616 of file complex.

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

asinh(__z) [8.1.6].

Definition at line 1738 of file complex.

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

atan(__z) [8.1.4].

Definition at line 1660 of file complex.

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

atanh(__z) [8.1.7].

Definition at line 1782 of file complex.

template<class _Tp >
constexpr const _Tp* std::begin ( initializer_list< _Tp >  __ils  ) 

Return an iterator pointing to the first element of the initilizer_list.

Parameters:
il Initializer list.

Definition at line 86 of file initializer_list.

Referenced by std::list< _Tp, _Alloc >::merge().

template<class _Tp , size_t _Nm>
_Tp* std::begin ( _Tp(&)  __arr[_Nm]  )  [inline]

Return an iterator pointing to the first element of the array.

Parameters:
arr Array.

Definition at line 87 of file range_access.h.

template<class _Container >
auto std::begin ( _Container &  __cont  )  [inline]

Return an iterator pointing to the first element of the container.

Parameters:
cont Container.

Definition at line 48 of file range_access.h.

template<class _Container >
auto std::begin ( const _Container &  __cont  )  [inline]

Return an iterator pointing to the first element of the const container.

Parameters:
cont Container.

Definition at line 58 of file range_access.h.

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

Function template for std::bind<R>.

Definition at line 1462 of file functional.

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

Calls base.setf(ios_base::boolalpha).

Definition at line 797 of file ios_base.h.

References std::ios_base::boolalpha.

template<typename _Tp , typename _Tp1 , _Lock_policy _Lp>
__shared_ptr<_Tp, _Lp> std::const_pointer_cast ( const __shared_ptr< _Tp1, _Lp > &  __r  )  [inline]

const_pointer_cast

Definition at line 1130 of file shared_ptr_base.h.

template<typename _Tp >
reference_wrapper<const _Tp> std::cref ( const _Tp &  __t  )  [inline]

Denotes a const reference should be taken to a variable.

Definition at line 476 of file functional.

Referenced by cref().

template<typename _Tp >
reference_wrapper<const _Tp> std::cref ( reference_wrapper< _Tp >  __t  )  [inline]

Partial specialization.

Definition at line 488 of file functional.

References cref().

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

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

Definition at line 935 of file ios_base.h.

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

Referenced by 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 113 of file stl_iterator_base_funcs.h.

References __iterator_category().

Referenced by __inplace_stable_partition(), __merge_adaptive(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), std::deque< _Tp, _Alloc >::_M_range_initialize(), equal_range(), inplace_merge(), is_heap_until(), is_permutation(), std::sub_match< _Bi_iter >::length(), lower_bound(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), partition_point(), std::match_results< _FwdIterT, _Alloc >::position(), std::list< _Tp, _Alloc >::size(), and upper_bound().

template<typename _Tp , typename _Tp1 , _Lock_policy _Lp>
__shared_ptr<_Tp, _Lp> std::dynamic_pointer_cast ( const __shared_ptr< _Tp1, _Lp > &  __r  )  [inline]

dynamic_pointer_cast

Definition at line 1140 of file shared_ptr_base.h.

template<class _Container >
auto std::end ( _Container &  __cont  )  [inline]

Return an iterator pointing to one past the last element of the container.

Parameters:
cont Container.

Definition at line 68 of file range_access.h.

template<class _Container >
auto std::end ( const _Container &  __cont  )  [inline]

Return an iterator pointing to one past the last element of the const container.

Parameters:
cont Container.

Definition at line 78 of file range_access.h.

template<class _Tp , size_t _Nm>
_Tp* std::end ( _Tp(&)  __arr[_Nm]  )  [inline]

Return an iterator pointing to one past the last element of the array.

Parameters:
arr Array.

Definition at line 97 of file range_access.h.

template<class _Tp >
constexpr const _Tp* std::end ( initializer_list< _Tp >  __ils  ) 

Return an iterator pointing to one past the last element of the initilizer_list.

Parameters:
il Initializer list.

Definition at line 96 of file initializer_list.

Referenced by std::list< _Tp, _Alloc >::merge().

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++/manual/bk01pt11ch25s02.html for more on this subject.

Definition at line 543 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 554 of file ostream.

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

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

fabs(__z) [8.1.8].

Definition at line 1791 of file complex.

References abs().

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

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

Definition at line 960 of file ios_base.h.

References std::ios_base::fixed, std::ios_base::floatfield, and std::ios_base::setf().

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

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

Referenced by endl().

template<typename _Tp >
_Tp&& std::forward ( typename std::remove_reference< _Tp >::type &  __t  )  [inline]

forward (as per N3143)

Definition at line 62 of file move.h.

template<typename _MoneyT >
_Get_money<_MoneyT> std::get_money ( _MoneyT &  __mon,
bool  __intl = false 
) [inline]

Extended manipulator for extracting money.

Parameters:
mon Either long double or a specialization of basic_string.
intl A bool indicating whether international format is to be used.

Sent to a stream object, this manipulator extracts mon.

Definition at line 258 of file iomanip.

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

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

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

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

Referenced by getline().

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

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

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 __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 , 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 2509 of file vstring.h.

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

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 93 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 943 of file ios_base.h.

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

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

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

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

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

Definition at line 910 of file ios_base.h.

References __gnu_debug::__base(), std::ios_base::adjustfield, and std::ios_base::internal.

template<typename _ForwardIterator , typename _Tp >
void std::iota ( _ForwardIterator  __first,
_ForwardIterator  __last,
_Tp  __value 
)

Create a range of sequentially increasing values.

For each element in the range [first,last) assigns value and increments value as if by ++value.

Parameters:
first Start of range.
last End of range.
value Starting value.
Returns:
Nothing.

Definition at line 83 of file stl_numeric.h.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Definition at line 918 of file ios_base.h.

References std::ios_base::adjustfield, std::ios_base::left, and std::ios_base::setf().

Referenced by operator<<().

template<class _T1 , class _T2 >
pair<typename __decay_and_strip<_T1>::__type, typename __decay_and_strip<_T2>::__type> 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 262 of file stl_pair.h.

Referenced by __gnu_parallel::__find_template(), __gnu_parallel::__parallel_merge_advance(), __gnu_parallel::__parallel_sort_qsb(), __gnu_parallel::__qsb_local_sort_with_helping(), __gnu_parallel::__find_first_of_selector< _FIterator >::_M_sequential_algorithm(), __gnu_parallel::__adjacent_find_selector::_M_sequential_algorithm(), __gnu_parallel::__find_if_selector::_M_sequential_algorithm(), minmax_element(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), __gnu_parallel::parallel_multiway_merge(), and __gnu_parallel::parallel_sort_mwms_pu().

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

Calls base.unsetf(ios_base::boolalpha).

Definition at line 805 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::showbase).

Definition at line 821 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::showpoint).

Definition at line 837 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::showpos).

Definition at line 853 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::skipws).

Definition at line 869 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::unitbuf).

Definition at line 901 of file ios_base.h.

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

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

Calls base.unsetf(ios_base::uppercase).

Definition at line 885 of file ios_base.h.

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

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

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

Definition at line 951 of file ios_base.h.

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

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 2473 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 2485 of file basic_string.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 2497 of file basic_string.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 1943 of file stl_deque.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 1600 of file stl_list.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 901 of file stl_map.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 819 of file stl_multimap.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 703 of file stl_multiset.h.