#include <stl/_cstddef.h>
#include <stl/_cstring.h>
#include <climits>
#include <stl/_cstdlib.h>
#include <stl/_pair.h>
#include <stl/_iterator_base.h>
#include <stl/type_traits.h>
#include <stl/_algobase.c>

Include dependency graph for _algobase.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	_STLP_DECLARE_COPY_TRIVIAL(_Tp)

Functions
template<class _Tp >
_STLP_BEGIN_NAMESPACE void	swap (_Tp &__a, _Tp &__b)

template<class _ForwardIter1 , class _ForwardIter2 , class _Value >
_STLP_MOVE_TO_PRIV_NAMESPACE void	__iter_swap_aux_aux (_ForwardIter1 &__i1, _ForwardIter2 &__i2, _Value *)

template<class _ForwardIter1 , class _ForwardIter2 >
void	__iter_swap_aux (_ForwardIter1 &__i1, _ForwardIter2 &__i2, const __true_type &)

template<class _ForwardIter1 , class _ForwardIter2 >
void	__iter_swap_aux (_ForwardIter1 &__i1, _ForwardIter2 &__i2, const __false_type &)

template<class _ForwardIter1 , class _ForwardIter2 >
_STLP_MOVE_TO_STD_NAMESPACE void	iter_swap (_ForwardIter1 __i1, _ForwardIter2 __i2)

template<class _Tp >
const _Tp &()	min (const _Tp &__a, const _Tp &__b)

template<class _Tp >
const _Tp &()	max (const _Tp &__a, const _Tp &__b)

template<class _Tp , class _Compare >
const _Tp &()	min (const _Tp &__a, const _Tp &__b, _Compare __comp)

template<class _Tp , class _Compare >
const _Tp &()	max (const _Tp &__a, const _Tp &__b, _Compare __comp)

template<class _InputIter , class _OutputIter , class _Distance >
_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter	__copy (_InputIter __first, _InputIter __last, _OutputIter __result, const input_iterator_tag &, _Distance *)

template<class _RandomAccessIter , class _OutputIter , class _Distance >
_OutputIter	__copy (_RandomAccessIter __first, _RandomAccessIter __last, _OutputIter __result, const random_access_iterator_tag &, _Distance *)

void *	__copy_trivial (const void __first, const void __last, void *__result)

template<class _BidirectionalIter1 , class _BidirectionalIter2 , class _Distance >
_BidirectionalIter2	__copy_backward (_BidirectionalIter1 __first, _BidirectionalIter1 __last, _BidirectionalIter2 __result, const bidirectional_iterator_tag &, _Distance *)

template<class _RandomAccessIter , class _BidirectionalIter , class _Distance >
_BidirectionalIter	__copy_backward (_RandomAccessIter __first, _RandomAccessIter __last, _BidirectionalIter __result, const random_access_iterator_tag &, _Distance *)

void *	__copy_trivial_backward (const void __first, const void __last, void *__result)

template<class _InputIter , class _OutputIter >
_OutputIter	__copy_ptrs (_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type &)

template<class _InputIter , class _OutputIter >
_OutputIter	__copy_ptrs (_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type &)

template<class _InputIter , class _OutputIter >
_OutputIter	__copy_aux (_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type &)

template<class _InputIter , class _OutputIter >
_OutputIter	__copy_aux (_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type &)

template<class _InputIter , class _OutputIter >
_STLP_MOVE_TO_STD_NAMESPACE _OutputIter	copy (_InputIter __first, _InputIter __last, _OutputIter __result)

template<class _InputIter , class _OutputIter >
_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter	__copy_backward_ptrs (_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type &)

template<class _InputIter , class _OutputIter >
_OutputIter	__copy_backward_ptrs (_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type &)

template<class _InputIter , class _OutputIter >
_OutputIter	__copy_backward_aux (_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type &)

template<class _InputIter , class _OutputIter >
_OutputIter	__copy_backward_aux (_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type &)

template<class _InputIter , class _OutputIter >
_STLP_MOVE_TO_STD_NAMESPACE _OutputIter	copy_backward (_InputIter __first, _InputIter __last, _OutputIter __result)

template<class _InputIter , class _Size , class _OutputIter >
_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP _STLP_STD::pair< _InputIter, _OutputIter >	__copy_n (_InputIter __first, _Size __count, _OutputIter __result, const input_iterator_tag &)

template<class _RAIter , class _Size , class _OutputIter >
_STLP_STD::pair< _RAIter, _OutputIter >	__copy_n (_RAIter __first, _Size __count, _OutputIter __result, const random_access_iterator_tag &)

template<class _InputIter , class _Size , class _OutputIter >
_STLP_MOVE_TO_STD_NAMESPACE pair< _InputIter, _OutputIter >	copy_n (_InputIter __first, _Size __count, _OutputIter __result)

template<class _ForwardIter , class _Tp >
_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP void	__fill_fwd (_ForwardIter __first, _ForwardIter __last, const _Tp &__val)

template<class _ForwardIter , class _Tp , class _Distance >
void	__fill (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, const input_iterator_tag &, _Distance *)

template<class _RandomAccessIter , class _Tp , class _Distance >
_STLP_INLINE_LOOP void	__fill (_RandomAccessIter __first, _RandomAccessIter __last, const _Tp &__val, const random_access_iterator_tag &, _Distance *)

template<class _ForwardIter , class _Tp >
_STLP_MOVE_TO_STD_NAMESPACE void	fill (_ForwardIter __first, _ForwardIter __last, const _Tp &__val)

void	fill (unsigned char __first, unsigned char __last, const unsigned char &__val)

void	fill (signed char __first, signed char __last, const signed char &__val)

void	fill (char __first, char __last, const char &__val)

template<class _OutputIter , class _Size , class _Tp >
_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP _OutputIter	__fill_n (_OutputIter __first, _Size __n, const _Tp &__val)

template<class _OutputIter , class _Size , class _Tp >
_STLP_MOVE_TO_STD_NAMESPACE void	fill_n (_OutputIter __first, _Size __n, const _Tp &__val)

template<class _InputIter1 , class _InputIter2 >
_STLP_INLINE_LOOP _STLP_STD::pair< _InputIter1, _InputIter2 >	mismatch (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2)

template<class _InputIter1 , class _InputIter2 , class _BinaryPredicate >
_STLP_INLINE_LOOP _STLP_STD::pair< _InputIter1, _InputIter2 >	mismatch (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _BinaryPredicate __binary_pred)

template<class _InputIter1 , class _InputIter2 >
_STLP_INLINE_LOOP bool	equal (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2)

template<class _InputIter1 , class _InputIter2 , class _BinaryPredicate >
_STLP_INLINE_LOOP bool	equal (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _BinaryPredicate __binary_pred)

template<class _InputIter1 , class _InputIter2 >
bool	lexicographical_compare (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2)

template<class _InputIter1 , class _InputIter2 , class _Compare >
bool	lexicographical_compare (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp)

bool	lexicographical_compare (const unsigned char __first1, const unsigned char __last1, const unsigned char __first2, const unsigned char __last2)

template<class _InputIter1 , class _InputIter2 >
_STLP_MOVE_TO_PRIV_NAMESPACE int	__lexicographical_compare_3way (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2)

int	__lexicographical_compare_3way (const unsigned char __first1, const unsigned char __last1, const unsigned char __first2, const unsigned char __last2)

template<class _InputIter1 , class _InputIter2 >
_STLP_MOVE_TO_STD_NAMESPACE int	lexicographical_compare_3way (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2)

template<class _InputIter , class _Tp >
_STLP_INLINE_LOOP	_STLP_DIFFERENCE_TYPE (_InputIter) count(_InputIter __first

	for (;__first !=__last;++__first) if(*__first

template<class _InputIter , class _Tp >
_InputIter	find (_InputIter __first, _InputIter __last, const _Tp &__val)

template<class _InputIter , class _Predicate >
_InputIter	find_if (_InputIter __first, _InputIter __last, _Predicate __pred)

template<class _ForwardIter1 , class _ForwardIter2 , class _BinaryPred >
_ForwardIter1	search (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, _BinaryPred __predicate)

template<class _InputIter , class _ForwardIter >
_STLP_MOVE_TO_PRIV_NAMESPACE _InputIter	__find_first_of (_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2)

template<class _InputIter , class _ForwardIter , class _BinaryPredicate >
_InputIter	__find_first_of (_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp)

template<class _ForwardIter1 , class _ForwardIter2 , class _BinaryPredicate >
_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter1	find_end (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, _BinaryPredicate __comp)

template<class _ForwardIter , class _Tp >
_STLP_INLINE_LOOP void	replace (_ForwardIter __first, _ForwardIter __last, const _Tp &__old_value, const _Tp &__new_value)

template<class _ForwardIter , class _Tp , class _Compare1 , class _Compare2 , class _Distance >
_STLP_MOVE_TO_PRIV_NAMESPACE _ForwardIter	__lower_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare1 __comp1, _Compare2 __comp2, _Distance *)

Variables
_STLP_INLINE_LOOP _InputIter	__last

_STLP_INLINE_LOOP _InputIter const _Tp &	__val

return	__n

Macro Definition Documentation

◆ _STLP_DECLARE_COPY_TRIVIAL

#define _STLP_DECLARE_COPY_TRIVIAL ( _Tp )

Value:

inline _Tp* copy(const _Tp* __first, const _Tp* __last, _Tp* __result)          \
{ return (_Tp*)_STLP_PRIV __copy_trivial(__first, __last, __result); }          \
inline _Tp* copy_backward(const _Tp* __first, const _Tp* __last, _Tp* __result) \
{ return (_Tp*)_STLP_PRIV __copy_trivial_backward(__first, __last, __result); }

Definition at line 334 of file _algobase.h.

Function Documentation

◆ __copy() [1/2]

template<class _InputIter , class _OutputIter , class _Distance >

_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter __copy	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		const input_iterator_tag &	,
		_Distance *
	)

inline

Definition at line 184 of file _algobase.h.

                                                                                        {
  for ( ; __first != __last; ++__result, ++__first)
    *__result = *__first;
  return __result;
}

Referenced by __copy_aux(), and __copy_ptrs().

◆ __copy() [2/2]

template<class _RandomAccessIter , class _OutputIter , class _Distance >

_OutputIter __copy	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_OutputIter	__result,
		const random_access_iterator_tag &	,
		_Distance *
	)

inline

Definition at line 211 of file _algobase.h.

                                                                             {
  for (_Distance __n = __last - __first; __n > 0; --__n) {
    *__result = *__first;
    ++__first;
    ++__result;
  }
  return __result;
}

◆ __copy_aux() [1/2]

template<class _InputIter , class _OutputIter >

_OutputIter __copy_aux	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		const __false_type &
	)

inline

Definition at line 281 of file _algobase.h.

                                                     {
  return _STLP_PRIV __copy(__first, __last, __result,
                           _STLP_ITERATOR_CATEGORY(__first, _InputIter),
                           _STLP_DISTANCE_TYPE(__first, _InputIter));
}

◆ __copy_aux() [2/2]

template<class _InputIter , class _OutputIter >

_OutputIter __copy_aux	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		const __true_type &
	)

inline

Definition at line 273 of file _algobase.h.

                                                    {
  return _STLP_PRIV __copy_ptrs(__first, __last, __result,
                                _UseTrivialCopy(_STLP_VALUE_TYPE(__first, _InputIter),
                                                _STLP_VALUE_TYPE(__result, _OutputIter))._Answer());
}

Referenced by copy().

◆ __copy_backward() [1/2]

template<class _BidirectionalIter1 , class _BidirectionalIter2 , class _Distance >

_BidirectionalIter2 __copy_backward	(	_BidirectionalIter1	__first,
		_BidirectionalIter1	__last,
		_BidirectionalIter2	__result,
		const bidirectional_iterator_tag &	,
		_Distance *
	)

inline

Definition at line 232 of file _algobase.h.

                                                       {
  while (__first != __last)
    *--__result = *--__last;
  return __result;
}

Referenced by __copy_backward_aux(), __copy_backward_ptrs(), __BVECTOR_QUALIFIED::_M_fill_insert(), __BVECTOR_QUALIFIED::_M_insert_aux(), and __BVECTOR_QUALIFIED::insert().

◆ __copy_backward() [2/2]

template<class _RandomAccessIter , class _BidirectionalIter , class _Distance >

_BidirectionalIter __copy_backward	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_BidirectionalIter	__result,
		const random_access_iterator_tag &	,
		_Distance *
	)

inline

Definition at line 243 of file _algobase.h.

                                                      {
  for (_Distance __n = __last - __first; __n > 0; --__n)
    *--__result = *--__last;
  return __result;
}

◆ __copy_backward_aux() [1/2]

template<class _InputIter , class _OutputIter >

_OutputIter __copy_backward_aux	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		const __false_type &
	)

inline

Definition at line 312 of file _algobase.h.

                                                                                                                         {
  return _STLP_PRIV __copy_backward(__first, __last, __result,
                                    _STLP_ITERATOR_CATEGORY(__first,_InputIter),
                                    _STLP_DISTANCE_TYPE(__first, _InputIter));
}

Referenced by copy_backward().

◆ __copy_backward_aux() [2/2]

template<class _InputIter , class _OutputIter >

_OutputIter __copy_backward_aux	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		const __true_type &
	)

inline

Definition at line 319 of file _algobase.h.

                                                                                                                        {
  return _STLP_PRIV __copy_backward_ptrs(__first, __last, __result,
                                         _UseTrivialCopy(_STLP_VALUE_TYPE(__first, _InputIter),
                                                         _STLP_VALUE_TYPE(__result, _OutputIter))._Answer());
}

◆ __copy_backward_ptrs() [1/2]

template<class _InputIter , class _OutputIter >

_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter __copy_backward_ptrs	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		const __false_type &
	)

inline

Definition at line 299 of file _algobase.h.

                                                                                     {
  return _STLP_PRIV __copy_backward(__first, __last, __result,
                                    _STLP_ITERATOR_CATEGORY(__first, _InputIter),
                                    _STLP_DISTANCE_TYPE(__first, _InputIter));
}

Referenced by __copy_backward_aux(), and vector< _Tp, >::_M_range_insert_aux().

◆ __copy_backward_ptrs() [2/2]

template<class _InputIter , class _OutputIter >

_OutputIter __copy_backward_ptrs	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		const __true_type &
	)

inline

Definition at line 306 of file _algobase.h.

                                                                                    {
  return (_OutputIter)_STLP_PRIV __copy_trivial_backward(__first, __last, __result);
}

◆ __copy_n() [1/2]

template<class _InputIter , class _Size , class _OutputIter >

_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP _STLP_STD::pair< _InputIter, _OutputIter > __copy_n	(	_InputIter	__first,
		_Size	__count,
		_OutputIter	__result,
		const input_iterator_tag &
	)

Definition at line 377 of file _algobase.h.

                                     {
  for ( ; __count > 0; --__count) {
    *__result = *__first;
    ++__first;
    ++__result;
  }
  return _STLP_STD::pair<_InputIter, _OutputIter>(__first, __result);
}

Referenced by copy_n().

◆ __copy_n() [2/2]

template<class _RAIter , class _Size , class _OutputIter >

_STLP_STD::pair< _RAIter, _OutputIter > __copy_n	(	_RAIter	__first,
		_Size	__count,
		_OutputIter	__result,
		const random_access_iterator_tag &
	)

inline

Definition at line 389 of file _algobase.h.

                                             {
  _RAIter __last = __first + __count;
  return _STLP_STD::pair<_RAIter, _OutputIter>(__last, _STLP_STD::copy(__first, __last, __result));
}

◆ __copy_ptrs() [1/2]

template<class _InputIter , class _OutputIter >

_OutputIter __copy_ptrs	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		const __false_type &
	)

inline

Definition at line 260 of file _algobase.h.

                                                      {
  return _STLP_PRIV __copy(__first, __last, __result, random_access_iterator_tag(), (ptrdiff_t*)0);
}

Referenced by __copy_aux(), vector< _Tp, >::_M_erase(), and vector< _Tp, >::operator=().

◆ __copy_ptrs() [2/2]

template<class _InputIter , class _OutputIter >

_OutputIter __copy_ptrs	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		const __true_type &
	)

inline

Definition at line 265 of file _algobase.h.

                                                     {
  // we know they all pointers, so this cast is OK
  //  return (_OutputIter)__copy_trivial(&(*__first), &(*__last), &(*__result));
  return (_OutputIter)_STLP_PRIV __copy_trivial(__first, __last, __result);
}

◆ __copy_trivial()

void * __copy_trivial	(	const void *	__first,
		const void *	__last,
		void *	__result
	)

inline

Definition at line 222 of file _algobase.h.

                                                                        {
  size_t __n = (const char*)__last - (const char*)__first;
  return __n ? (void *)((char*)memmove(__result, __first, __n) + __n) : __result;
}

Referenced by __copy_ptrs(), and vector< _Tp, >::_M_insert_overflow().

◆ __copy_trivial_backward()

void * __copy_trivial_backward	(	const void *	__first,
		const void *	__last,
		void *	__result
	)

inline

Definition at line 254 of file _algobase.h.

                                                                                 {
  const ptrdiff_t _Num = (const char*)__last - (const char*)__first;
  return (_Num > 0) ? memmove((char*)__result - _Num, __first, _Num) : __result ;
}

Referenced by __copy_backward_ptrs().

◆ __fill() [1/2]

template<class _ForwardIter , class _Tp , class _Distance >

void __fill	(	_ForwardIter	__first,
		_ForwardIter	__last,
		const _Tp &	__val,
		const input_iterator_tag &	,
		_Distance *
	)

inline

Definition at line 417 of file _algobase.h.

                                                           {
  _STLP_PRIV __fill_fwd(__first, __last, __val);
}

Referenced by __copy_float_and_fill(), __copy_integer_and_fill(), __do_put_bool(), __do_put_float(), __do_put_integer(), __money_do_put(), __put_float(), __put_integer(), _Slist_sort(), num_put< _CharT, _OutputIter >::do_put(), money_put< _CharT, _OutputIter >::do_put(), fill(), basic_ios< _CharT, _Traits >::fill(), money_put< _CharT, _OutputIter >::put(), time_put< _Ch, _OutIt >::put(), and num_put< _CharT, _OutputIter >::put().

◆ __fill() [2/2]

template<class _RandomAccessIter , class _Tp , class _Distance >

_STLP_INLINE_LOOP void __fill	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		const _Tp &	__val,
		const random_access_iterator_tag &	,
		_Distance *
	)

Definition at line 440 of file _algobase.h.

                                                            {
  for (_Distance __n = __last - __first ; __n > 0; ++__first, --__n)
    *__first = __val;
}

◆ __fill_fwd()

template<class _ForwardIter , class _Tp >

_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP void __fill_fwd	(	_ForwardIter	__first,
		_ForwardIter	__last,
		const _Tp &	__val
	)

Definition at line 411 of file _algobase.h.

                                                                             {
  for ( ; __first != __last; ++__first)
    *__first = __val;
}

Referenced by __fill().

◆ __fill_n()

template<class _OutputIter , class _Size , class _Tp >

_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP _OutputIter __fill_n	(	_OutputIter	__first,
		_Size	__n,
		const _Tp &	__val
	)

Definition at line 478 of file _algobase.h.

                                                                       {
  _STLP_FIX_LITERAL_BUG(__first)
  for ( ; __n > 0; --__n, ++__first)
    *__first = __val;
  return __first;
}

Referenced by __copy_float_and_fill(), __copy_integer_and_fill(), __do_put_bool(), __money_do_put(), vector< _Tp, >::_M_fill_assign(), vector< _Tp, >::_M_insert_overflow(), and fill_n().

◆ __find_first_of() [1/2]

template<class _InputIter , class _ForwardIter >

_STLP_MOVE_TO_PRIV_NAMESPACE _InputIter __find_first_of	(	_InputIter	__first1,
		_InputIter	__last1,
		_ForwardIter	__first2,
		_ForwardIter	__last2
	)

inline

Definition at line 339 of file _algobase.c.

                                                                               {
  return _STLP_PRIV __find_first_of_aux1(__first1, __last1, __first2, __last2,
                                         _STLP_VALUE_TYPE(__first1, _InputIter),
                                         _STLP_VALUE_TYPE(__first2, _ForwardIter));
}

Referenced by __find_first_of_aux2(), __str_find_first_of_aux(), and find_first_of().

◆ __find_first_of() [2/2]

template<class _InputIter , class _ForwardIter , class _BinaryPredicate >

_InputIter __find_first_of	(	_InputIter	__first1,
		_InputIter	__last1,
		_ForwardIter	__first2,
		_ForwardIter	__last2,
		_BinaryPredicate	__comp
	)

Definition at line 348 of file _algobase.c.

                                                    {
  for ( ; __first1 != __last1; ++__first1) {
    for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter) {
      if (__comp(*__first1, *__iter)) {
        return __first1;
      }
    }
  }
  return __last1;
}

◆ __iter_swap_aux() [1/2]

template<class _ForwardIter1 , class _ForwardIter2 >

void __iter_swap_aux	(	_ForwardIter1 &	__i1,
		_ForwardIter2 &	__i2,
		const __false_type &
	)

inline

Definition at line 113 of file _algobase.h.

                                                                                             {
  _STLP_PRIV __iter_swap_aux_aux( __i1, __i2, _STLP_VALUE_TYPE(__i1,_ForwardIter1) );
}

◆ __iter_swap_aux() [2/2]

template<class _ForwardIter1 , class _ForwardIter2 >

void __iter_swap_aux	(	_ForwardIter1 &	__i1,
		_ForwardIter2 &	__i2,
		const __true_type &
	)

inline

Definition at line 107 of file _algobase.h.

                                                                                            {
  /* namespace specification breaks access to the right swap template overload (at least for gcc) */
  /*_STLP_STD::*/ swap(*__i1, *__i2);
}

Referenced by iter_swap().

◆ __iter_swap_aux_aux()

template<class _ForwardIter1 , class _ForwardIter2 , class _Value >

_STLP_MOVE_TO_PRIV_NAMESPACE void __iter_swap_aux_aux	(	_ForwardIter1 &	__i1,
		_ForwardIter2 &	__i2,
		_Value *
	)

inline

Definition at line 100 of file _algobase.h.

                                                                                    {
  _Value tmp = *__i1;
  *__i1 = *__i2;
  *__i2 = tmp;
}

Referenced by __iter_swap_aux().

◆ __lexicographical_compare_3way() [1/2]

template<class _InputIter1 , class _InputIter2 >

_STLP_MOVE_TO_PRIV_NAMESPACE int __lexicographical_compare_3way	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2
	)

Definition at line 78 of file _algobase.c.

                                                                              {
  while (__first1 != __last1 && __first2 != __last2) {
    if (*__first1 < *__first2) {
      _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      return -1;
    }
    if (*__first2 < *__first1)
      return 1;
    ++__first1;
    ++__first2;
  }
  if (__first2 == __last2) {
    return !(__first1 == __last1);
  }
  else {
    return -1;
  }
}

Referenced by rope< _CharT, _Alloc >::_S_compare(), collate< char >::do_compare(), collate< wchar_t >::do_compare(), and lexicographical_compare_3way().

◆ __lexicographical_compare_3way() [2/2]

int __lexicographical_compare_3way	(	const unsigned char *	__first1,
		const unsigned char *	__last1,
		const unsigned char *	__first2,
		const unsigned char *	__last2
	)

inline

Definition at line 621 of file _algobase.h.

                                                             {
  const ptrdiff_t __len1 = __last1 - __first1;
  const ptrdiff_t __len2 = __last2 - __first2;
  const int __result = memcmp(__first1, __first2, (min) (__len1, __len2));
  return __result != 0 ? __result
                       : (__len1 == __len2 ? 0 : (__len1 < __len2 ? -1 : 1));
}

◆ __lower_bound()

template<class _ForwardIter , class _Tp , class _Compare1 , class _Compare2 , class _Distance >

_STLP_MOVE_TO_PRIV_NAMESPACE _ForwardIter __lower_bound	(	_ForwardIter	__first,
		_ForwardIter	__last,
		const _Tp &	__val,
		_Compare1	__comp1,
		_Compare2	__comp2,
		_Distance *
	)

Definition at line 453 of file _algobase.c.

                                                                             {
  _Distance __len = _STLP_STD::distance(__first, __last);
  _Distance __half;
  _ForwardIter __middle;
 
  while (__len > 0) {
    __half = __len >> 1;
    __middle = __first;
    _STLP_STD::advance(__middle, __half);
    if (__comp1(*__middle, __val)) {
      _STLP_VERBOSE_ASSERT(!__comp2(__val, *__middle), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      __first = __middle;
      ++__first;
      __len = __len - __half - 1;
    }
    else
      __len = __half;
  }
  return __first;
}

Referenced by __equal_range(), binary_search(), and lower_bound().

◆ _STLP_DIFFERENCE_TYPE()

template<class _InputIter , class _Tp >

_STLP_INLINE_LOOP _STLP_DIFFERENCE_TYPE ( _InputIter )

◆ copy()

template<class _InputIter , class _OutputIter >

_STLP_MOVE_TO_STD_NAMESPACE _OutputIter copy	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result
	)

inline

Definition at line 291 of file _algobase.h.

                                                                                     {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __copy_aux(__first, __last, __result, _BothPtrType< _InputIter, _OutputIter>::_Answer());
}

◆ copy_backward()

template<class _InputIter , class _OutputIter >

_STLP_MOVE_TO_STD_NAMESPACE _OutputIter copy_backward	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result
	)

inline

Definition at line 328 of file _algobase.h.

                                                                                              {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __copy_backward_aux(__first, __last, __result, _BothPtrType< _InputIter, _OutputIter>::_Answer() );
}

Referenced by __insert_grouping_aux(), __linear_insert(), __merge_backward(), deque< _Tp, >::_M_erase(), deque< _Tp, >::_M_fill_insert_aux(), CopyTest::copy_back(), and CopyTest::copy_back_array().

◆ copy_n()

template<class _InputIter , class _Size , class _OutputIter >

_STLP_MOVE_TO_STD_NAMESPACE pair< _InputIter, _OutputIter > copy_n	(	_InputIter	__first,
		_Size	__count,
		_OutputIter	__result
	)

inline

Definition at line 399 of file _algobase.h.

                                                                {
  _STLP_FIX_LITERAL_BUG(__first)
  return _STLP_PRIV __copy_n(__first, __count, __result, _STLP_ITERATOR_CATEGORY(__first, _InputIter));
}

Referenced by IStreamIteratorTest::copy_n_test().

◆ equal() [1/2]

template<class _InputIter1 , class _InputIter2 >

_STLP_INLINE_LOOP bool equal	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2
	)

Definition at line 551 of file _algobase.h.

                                 {
  _STLP_FIX_LITERAL_BUG(__first1) _STLP_FIX_LITERAL_BUG(__last1)  _STLP_FIX_LITERAL_BUG(__first2)
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  for ( ; __first1 != __last1; ++__first1, ++__first2)
    if (!(*__first1 == *__first2))
      return false;
  return true;
}

◆ equal() [2/2]

template<class _InputIter1 , class _InputIter2 , class _BinaryPredicate >

_STLP_INLINE_LOOP bool equal	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_BinaryPredicate	__binary_pred
	)

Definition at line 563 of file _algobase.h.

                                                                 {
  _STLP_FIX_LITERAL_BUG(__first2)
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  for ( ; __first1 != __last1; ++__first1, ++__first2)
    if (!__binary_pred(*__first1, *__first2))
      return false;
  return true;
}

◆ fill() [1/4]

template<class _ForwardIter , class _Tp >

_STLP_MOVE_TO_STD_NAMESPACE void fill	(	_ForwardIter	__first,
		_ForwardIter	__last,
		const _Tp &	__val
	)

inline

Definition at line 449 of file _algobase.h.

                                                                              {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  _STLP_PRIV __fill(__first, __last, __val,
                    _STLP_ITERATOR_CATEGORY(__first, _ForwardIter),
                    _STLP_DISTANCE_TYPE(__first, _ForwardIter));
}

Referenced by __BVECTOR_QUALIFIED::__BVECTOR(), hashtable< _Val, _Key, _HF, _Traits, _ExK, _EqK, _All >::_M_copy_from(), _Base_bitset< _Nw >::_M_do_left_shift(), _Base_bitset< _Nw >::_M_do_right_shift(), __BVECTOR_QUALIFIED::_M_fill_assign(), vector< _Tp, >::_M_fill_assign(), __BVECTOR_QUALIFIED::_M_fill_insert(), deque< _Tp, >::_M_fill_insert_aux(), hashtable< _Val, _Key, _HF, _Traits, _ExK, _EqK, _All >::_M_insert_noresize(), basic_ostream< _CharT, _Traits >::_M_put_char(), basic_ostream< _CharT, _Traits >::_M_put_nowiden(), basic_ostream< _CharT, _Traits >::_M_put_widen(), hashtable< _Val, _Key, _HF, _Traits, _ExK, _EqK, _All >::_M_rehash(), _Stl_expand_array(), blake2b_update(), brush_fill_path(), brush_fill_pixels(), create_table(), TConsole::DeleteCharacter(), CardButton::DrawRect(), hashtable< _Val, _Key, _HF, _Traits, _ExK, _EqK, _All >::erase(), fi_set(), FillTest::fill1(), GdipCreateAdjustableArrowCap(), GdipCreatePath(), GdipCreatePath2(), GdipCreatePath2I(), GdipFillClosedCurve2(), GdipFillClosedCurve2I(), GdipGetAdjustableArrowCapFillState(), GdipPlayMetafileRecord(), GdipSetAdjustableArrowCapFillState(), GdipSetPathFillMode(), SolidBrush::GetColor(), inflate_table(), init_custom_linecap(), TConsole::InsertCharacter(), TConsole::InsertLine(), make_decode_table(), mpg123_copy_string(), mpg123_index(), mpg123_set_index(), SolidBrush::SetColor(), test_crc2_imp(), ui_ellipse(), ui_patblt(), ui_polygon(), and UniqueTest::uniqcpy2().

◆ fill() [2/4]

void fill	(	char *	__first,
		char *	__last,
		const char &	__val
	)

inline

Definition at line 469 of file _algobase.h.

                                                                 {
  char __tmp = __val;
  memset(__first, __STATIC_CAST(unsigned char,__tmp), __last - __first);
}

◆ fill() [3/4]

void fill	(	signed char *	__first,
		signed char *	__last,
		const signed char &	__val
	)

inline

Definition at line 463 of file _algobase.h.

                                           {
  signed char __tmp = __val;
  memset(__first, __STATIC_CAST(unsigned char,__tmp), __last - __first);
}

◆ fill() [4/4]

void fill	(	unsigned char *	__first,
		unsigned char *	__last,
		const unsigned char &	__val
	)

inline

Definition at line 457 of file _algobase.h.

                                             {
  unsigned char __tmp = __val;
  memset(__first, __tmp, __last - __first);
}

◆ fill_n()

template<class _OutputIter , class _Size , class _Tp >

_STLP_MOVE_TO_STD_NAMESPACE void fill_n	(	_OutputIter	__first,
		_Size	__n,
		const _Tp &	__val
	)

inline

Definition at line 511 of file _algobase.h.

                                                                     {
  _STLP_FIX_LITERAL_BUG(__first)
  _STLP_PRIV __fill_n(__first, __n, __val);
}

Referenced by __BVECTOR_QUALIFIED::_M_fill_insert(), FillTest::filln1(), and valarray< _Tp >::operator=().

◆ find()

template<class _InputIter , class _Tp >

_InputIter find	(	_InputIter	__first,
		_InputIter	__last,
		const _Tp &	__val
	)

Definition at line 221 of file _algobase.c.

                                                                         {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __find(__first, __last, __val, _STLP_ITERATOR_CATEGORY(__first, _InputIter));
}

◆ find_end()

template<class _ForwardIter1 , class _ForwardIter2 , class _BinaryPredicate >

_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter1 find_end	(	_ForwardIter1	__first1,
		_ForwardIter1	__last1,
		_ForwardIter2	__first2,
		_ForwardIter2	__last2,
		_BinaryPredicate	__comp
	)

Definition at line 434 of file _algobase.c.

                                  {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  return _STLP_PRIV __find_end(__first1, __last1, __first2, __last2,
#if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
                               _STLP_ITERATOR_CATEGORY(__first1, _ForwardIter1),
                               _STLP_ITERATOR_CATEGORY(__first2, _ForwardIter2),
#else
                               forward_iterator_tag(),
                               forward_iterator_tag(),
#endif
                               __comp);
}

◆ find_if()

template<class _InputIter , class _Predicate >

_InputIter find_if	(	_InputIter	__first,
		_InputIter	__last,
		_Predicate	__pred
	)

Definition at line 214 of file _algobase.c.

                                      {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __find_if(__first, __last, __pred, _STLP_ITERATOR_CATEGORY(__first, _InputIter));
}

Referenced by __write_floatT(), BcomposTest::bcompos1(), BcomposTest::bcompos2(), ctype_byname< wchar_t >::do_scan_is(), ctype_byname< wchar_t >::do_scan_not(), MemFunPtrTest::find(), FindTest::findif0(), FindTest::findif1(), _Not_within_traits< _Traits >::operator()(), _Scan_for_char_val< _Traits >::operator()(), Ptr2Test::ptrun1(), Ptr2Test::ptrun2(), remove_if(), UnaryTest::unegate1(), UnaryTest::unegate2(), and UnaryTest::unegate3().

◆ for()

for ( ;__first ! = __last;++__first )

Definition at line 71 of file _algo.h.

                                        {
    if (__pred(*__first))
      ++__n;
  }

◆ iter_swap()

template<class _ForwardIter1 , class _ForwardIter2 >

_STLP_MOVE_TO_STD_NAMESPACE void iter_swap	(	_ForwardIter1	__i1,
		_ForwardIter2	__i2
	)

inline

Definition at line 120 of file _algobase.h.

                                                              {
  _STLP_PRIV __iter_swap_aux( __i1, __i2, _IsOKToSwap(_STLP_VALUE_TYPE(__i1, _ForwardIter1), _STLP_VALUE_TYPE(__i2, _ForwardIter2),
                                                      _STLP_IS_REF_TYPE_REAL_REF(__i1, _ForwardIter1),
                                                      _STLP_IS_REF_TYPE_REAL_REF(__i2, _ForwardIter2))._Answer());
}

Referenced by __merge_without_buffer(), __next_permutation(), __partition(), __prev_permutation(), __unguarded_partition(), IterTest::iterswp0(), IterTest::iterswp1(), IterTest::iterswp2(), IterTest::iterswp3(), random_shuffle(), and swap_ranges().

◆ lexicographical_compare() [1/3]

template<class _InputIter1 , class _InputIter2 >

bool lexicographical_compare	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2
	)

Definition at line 39 of file _algobase.c.

                                                                        {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  for ( ; __first1 != __last1 && __first2 != __last2
        ; ++__first1, ++__first2) {
    if (*__first1 < *__first2) {
      _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      return true;
    }
    if (*__first2 < *__first1)
      return false;
  }
  return __first1 == __last1 && __first2 != __last2;
}

Referenced by LexcmpTest::lexcmp1(), LexcmpTest::lexcmp2(), and operator<().

◆ lexicographical_compare() [2/3]

template<class _InputIter1 , class _InputIter2 , class _Compare >

bool lexicographical_compare	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_Compare	__comp
	)

Definition at line 56 of file _algobase.c.

                                              {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  for ( ; __first1 != __last1 && __first2 != __last2
        ; ++__first1, ++__first2) {
    if (__comp(*__first1, *__first2)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1),
                           _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      return true;
    }
    if (__comp(*__first2, *__first1))
      return false;
  }
  return __first1 == __last1 && __first2 != __last2;
}

◆ lexicographical_compare() [3/3]

bool lexicographical_compare	(	const unsigned char *	__first1,
		const unsigned char *	__last1,
		const unsigned char *	__first2,
		const unsigned char *	__last2
	)

inline

Definition at line 587 of file _algobase.h.

                                                      {
  const size_t __len1 = __last1 - __first1;
  const size_t __len2 = __last2 - __first2;
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
 
  const int __result = memcmp(__first1, __first2, (min) (__len1, __len2));
  return __result != 0 ? (__result < 0) : (__len1 < __len2);
}

◆ lexicographical_compare_3way()

template<class _InputIter1 , class _InputIter2 >

_STLP_MOVE_TO_STD_NAMESPACE int lexicographical_compare_3way	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2
	)

Definition at line 101 of file _algobase.c.

                                                                            {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  return _STLP_PRIV __lexicographical_compare_3way(__first1, __last1, __first2, __last2);
}

◆ max() [1/2]

template<class _Tp >

const _Tp &() max	(	const _Tp &	__a,
		const _Tp &	__b
	)

inline

Definition at line 141 of file _algobase.h.

141{ return __a < __b ? __b : __a; }

◆ max() [2/2]

template<class _Tp , class _Compare >

const _Tp &() max	(	const _Tp &	__a,
		const _Tp &	__b,
		_Compare	__comp
	)

inline

Definition at line 157 of file _algobase.h.

                                                                         {
  return __comp(__a, __b) ? __b : __a;
}

◆ min() [1/2]

template<class _Tp >

const _Tp &() min	(	const _Tp &	__a,
		const _Tp &	__b
	)

inline

Definition at line 139 of file _algobase.h.

139{ return __b < __a ? __b : __a; }

◆ min() [2/2]

template<class _Tp , class _Compare >

const _Tp &() min	(	const _Tp &	__a,
		const _Tp &	__b,
		_Compare	__comp
	)

inline

Definition at line 152 of file _algobase.h.

                                                                         {
  return __comp(__b, __a) ? __b : __a;
}

◆ mismatch() [1/2]

template<class _InputIter1 , class _InputIter2 >

_STLP_INLINE_LOOP _STLP_STD::pair< _InputIter1, _InputIter2 > mismatch	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2
	)

Definition at line 522 of file _algobase.h.

                                                                         {
  _STLP_FIX_LITERAL_BUG(__first2)
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  while (__first1 != __last1 && *__first1 == *__first2) {
    ++__first1;
    ++__first2;
  }
  return _STLP_STD::pair<_InputIter1, _InputIter2>(__first1, __first2);
}

Referenced by adns__findrr_anychk(), LoadRegTypeLib(), MismatchTest::mismatch0(), MismatchTest::mismatch1(), MismatchTest::mismatch2(), and tinyxml2::XMLNode::ParseDeep().

◆ mismatch() [2/2]

template<class _InputIter1 , class _InputIter2 , class _BinaryPredicate >

_STLP_INLINE_LOOP _STLP_STD::pair< _InputIter1, _InputIter2 > mismatch	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_BinaryPredicate	__binary_pred
	)

Definition at line 536 of file _algobase.h.

                                                                                   {
  _STLP_FIX_LITERAL_BUG(__first2)
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  while (__first1 != __last1 && __binary_pred(*__first1, *__first2)) {
    ++__first1;
    ++__first2;
  }
  return _STLP_STD::pair<_InputIter1, _InputIter2>(__first1, __first2);
}

◆ replace()

template<class _ForwardIter , class _Tp >

_STLP_INLINE_LOOP void replace	(	_ForwardIter	__first,
		_ForwardIter	__last,
		const _Tp &	__old_value,
		const _Tp &	__new_value
	)

Definition at line 701 of file _algobase.h.

                                                        {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  for ( ; __first != __last; ++__first)
    if (*__first == __old_value)
      *__first = __new_value;
}

◆ search()

template<class _ForwardIter1 , class _ForwardIter2 , class _BinaryPred >

_ForwardIter1 search	(	_ForwardIter1	__first1,
		_ForwardIter1	__last1,
		_ForwardIter2	__first2,
		_ForwardIter2	__last2,
		_BinaryPred	__predicate
	)

Definition at line 227 of file _algobase.c.

                                          {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  // Test for empty ranges
  if (__first1 == __last1 || __first2 == __last2)
    return __first1;
 
  // Test for a pattern of length 1.
  _ForwardIter2 __p1(__first2);
 
  if ( ++__p1 == __last2 ) {
    while (__first1 != __last1 && !__pred(*__first1, *__first2)) {
      ++__first1;
    }
    return __first1;
  }
 
  // General case.
 
  for ( ; ; ) { // __first1 != __last1 will be checked below
    while (__first1 != __last1 && !__pred(*__first1, *__first2)) {
      ++__first1;
    }
    if (__first1 == __last1) {
      return __last1;
    }
    _ForwardIter2 __p = __p1;
    _ForwardIter1 __current = __first1;
    if (++__current == __last1) return __last1;
 
    while (__pred(*__current, *__p)) {
      if (++__p == __last2)
        return __first1;
      if (++__current == __last1)
        return __last1;
    }
    ++__first1;
  }
  return __first1;
}

◆ swap()

template<class _Tp >

_STLP_BEGIN_NAMESPACE void swap	(	_Tp &	__a,
		_Tp &	__b
	)

inline

Definition at line 81 of file _algobase.h.

                                     {
#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
#  if !defined(__BORLANDC__)
  typedef typename _SwapImplemented<_Tp>::_Ret _Implemented;
#  else
  enum { _Is = _SwapImplemented<_Tp>::_Is };
  typedef typename __bool2type<_Is>::_Ret _Implemented;
#  endif
  _STLP_PRIV __swap_aux(__a, __b, _Implemented());
#else
  _Tp __tmp = __a;
  __a = __b;
  __b = __tmp;
#endif
}

Variable Documentation

◆ __last

_STLP_INLINE_LOOP _InputIter __last

Definition at line 656 of file _algobase.h.

Referenced by __copy(), __copy_aux(), __copy_backward(), __copy_backward_aux(), __copy_backward_ptrs(), __copy_n(), __copy_ptrs(), __copy_trivial(), __copy_trivial_backward(), __fill(), __fill_fwd(), copy(), copy_backward(), fill(), and replace().

◆ __n

return __n

Definition at line 662 of file _algobase.h.

Referenced by __copy(), __copy_backward(), __copy_trivial(), __fill(), __fill_n(), and fill_n().

◆ __val

_STLP_INLINE_LOOP _InputIter const _Tp& __val

Initial value:

{
 
  _STLP_DIFFERENCE_TYPE(_InputIter) __n = 0

Definition at line 656 of file _algobase.h.

Referenced by __adjacent_difference(), __adjust_heap(), __BVECTOR_QUALIFIED::__BVECTOR(), __do_get_float(), __do_get_integer(), __equal_range(), __fill(), __fill_fwd(), __fill_n(), __find(), __get_decimal_integer(), __get_integer(), __get_num(), __iota(), __linear_insert(), __lower_bound(), __partial_sum(), __pop_heap(), __push_heap(), __search_n(), __uinit_aux(), __uinit_aux_aux(), __unguarded_linear_insert(), __uninitialized_init(), __unique_copy(), __upper_bound(), _Base_bitset< _Nw >::_Base_bitset(), _CArray< _Tp, _Nb >::_CArray(), _Copy_Construct(), _Copy_Construct_aux(), _logb(), _Sanitize< _Extrabits >::_M_do_sanitize(), deque< _Tp, >::_M_fill_assign(), slist< _Tp, >::_M_fill_assign(), vector< _Tp, >::_M_fill_assign(), list< _Tp, >::_M_fill_assign(), deque< _Tp, >::_M_fill_initialize(), hashtable< _Val, _Key, _HF, _Traits, _ExK, _EqK, _All >::_M_get_key(), vector< _Tp, >::_M_initialize(), deque< _Tp, >::_M_initialize(), _Rb_tree< _Key, _Compare, _Value, _KeyOfValue, _Traits, >::_M_insert(), _Move_Construct(), _Move_Construct_Aux(), _Param_Construct(), _Param_Construct_aux(), bitset< _Nb >::_Unchecked_set(), deque< _Tp, >::assign(), slist< _Tp, >::assign(), vector< _Tp, >::assign(), list< _Tp, >::assign(), binary_search(), constant0(), constant1(), constant2(), construct(), pthread_allocator< _Tp >::construct(), per_thread_allocator< _Tp >::construct(), EH_allocator< _Tp >::construct(), allocator< _Tp >::construct(), StackAllocator< _Tp >::construct(), count(), num_get< _CharT, _InputIter >::do_get(), num_put< _CharT, _OutputIter >::do_put(), equal_range(), fill(), fill_n(), find(), num_get< _CharT, _InputIter >::get(), _Rb_tree< _Key, _Compare, _Value, _KeyOfValue, _Traits, >::insert_equal(), _Rb_tree< _Key, _Compare, _Value, _KeyOfValue, _Traits, >::insert_unique(), iota(), lower_bound(), unordered_map< _Key, _Tp,,, >::max_load_factor(), unordered_multimap< _Key, _Tp,,, >::max_load_factor(), unordered_set< _Value,,, >::max_load_factor(), unordered_multiset< _Value,,, >::max_load_factor(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, int), _MapTraits, _Alloc >::operator=(), ostream_iterator< _TpP, _CharT, _Traits >::operator=(), back_insert_iterator< _Container >::operator=(), front_insert_iterator< _Container >::operator=(), insert_iterator< _Container >::operator=(), basic_istream< _CharT, _Traits >::operator>>(), num_put< _CharT, _OutputIter >::put(), remove(), slist< _Tp, >::remove(), list< _Tp, >::remove(), remove_copy(), search_n(), bitset< _Nb >::set(), test_signed_integral_limits(), test_unsigned_integral_limits(), uninitialized_fill(), and upper_bound().

Macros

Functions

Variables

Macro Definition Documentation

◆ _STLP_DECLARE_COPY_TRIVIAL

Function Documentation

◆ __copy() [1/2]

◆ __copy() [2/2]

◆ __copy_aux() [1/2]

◆ __copy_aux() [2/2]

◆ __copy_backward() [1/2]

◆ __copy_backward() [2/2]

◆ __copy_backward_aux() [1/2]

◆ __copy_backward_aux() [2/2]

◆ __copy_backward_ptrs() [1/2]

◆ __copy_backward_ptrs() [2/2]

◆ __copy_n() [1/2]

◆ __copy_n() [2/2]

◆ __copy_ptrs() [1/2]

◆ __copy_ptrs() [2/2]

◆ __copy_trivial()

◆ __copy_trivial_backward()

◆ __fill() [1/2]

◆ __fill() [2/2]

◆ __fill_fwd()

◆ __fill_n()

◆ __find_first_of() [1/2]

◆ __find_first_of() [2/2]

◆ __iter_swap_aux() [1/2]

◆ __iter_swap_aux() [2/2]

◆ __iter_swap_aux_aux()

◆ __lexicographical_compare_3way() [1/2]

◆ __lexicographical_compare_3way() [2/2]

◆ __lower_bound()

◆ _STLP_DIFFERENCE_TYPE()

◆ copy()

◆ copy_backward()

◆ copy_n()

◆ equal() [1/2]

◆ equal() [2/2]

◆ fill() [1/4]

◆ fill() [2/4]

◆ fill() [3/4]

◆ fill() [4/4]

◆ fill_n()

◆ find()

◆ find_end()

◆ find_if()

◆ for()

◆ iter_swap()

◆ lexicographical_compare() [1/3]

◆ lexicographical_compare() [2/3]

◆ lexicographical_compare() [3/3]

◆ lexicographical_compare_3way()

◆ max() [1/2]

◆ max() [2/2]

◆ min() [1/2]

◆ min() [2/2]

◆ mismatch() [1/2]

◆ mismatch() [2/2]

◆ replace()

◆ search()

◆ swap()

Variable Documentation

◆ __last

◆ __n

◆ __val