_algo.c File Reference

#include <stl/_algo.h>
#include <stl/_tempbuf.h>

Include dependency graph for _algo.c:

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

Go to the source code of this file.

Macros
#define	_STLP_ALGO_C
#define	__stl_threshold   16

Functions
template<class _BidirectionalIter , class _Distance , class _Compare >
_STLP_BEGIN_NAMESPACE _STLP_MOVE_TO_PRIV_NAMESPACE void	__merge_without_buffer (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Compare __comp)
template<class _BidirectionalIter1 , class _BidirectionalIter2 , class _BidirectionalIter3 , class _Compare >
_BidirectionalIter3	__merge_backward (_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result, _Compare __comp)
template<class _Tp >
const _Tp &	__median (const _Tp &__a, const _Tp &__b, const _Tp &__c)
template<class _Tp , class _Compare >
const _Tp &	__median (const _Tp &__a, const _Tp &__b, const _Tp &__c, _Compare __comp)
template<class _ForwardIter1 , class _ForwardIter2 >
_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter1	search (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2)
template<class _RandomAccessIter , class _Integer , class _Tp , class _BinaryPred , class _Distance >
_STLP_MOVE_TO_PRIV_NAMESPACE _RandomAccessIter	__search_n (_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, const _Tp &__val, _BinaryPred __pred, _Distance *, const random_access_iterator_tag &)
template<class _ForwardIter , class _Integer , class _Tp , class _Distance , class _BinaryPred >
_ForwardIter	__search_n (_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp &__val, _BinaryPred __pred, _Distance *, const forward_iterator_tag &)
template<class _ForwardIter , class _Integer , class _Tp >
_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter	search_n (_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp &__val)
template<class _ForwardIter , class _Integer , class _Tp , class _BinaryPred >
_ForwardIter	search_n (_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp &__val, _BinaryPred __binary_pred)
template<class _ForwardIter1 , class _ForwardIter2 >
_ForwardIter1	find_end (_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2)
template<class _InputIterator , class _OutputIterator , class _BinaryPredicate , class _Tp >
_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP _OutputIterator	__unique_copy (_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, _Tp *)
template<class _InputIter , class _OutputIter , class _BinaryPredicate >
_OutputIter	__unique_copy (_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred, const output_iterator_tag &)
template<class _InputIter , class _ForwardIter , class _BinaryPredicate >
_STLP_INLINE_LOOP _ForwardIter	__unique_copy (_InputIter __first, _InputIter __last, _ForwardIter __result, _BinaryPredicate __binary_pred, const forward_iterator_tag &)
template<class _InputIter , class _OutputIter >
_STLP_MOVE_TO_STD_NAMESPACE _OutputIter	unique_copy (_InputIter __first, _InputIter __last, _OutputIter __result)
template<class _InputIter , class _OutputIter , class _BinaryPredicate >
_OutputIter	unique_copy (_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred)
template<class _ForwardIter , class _Distance >
_STLP_MOVE_TO_PRIV_NAMESPACE _ForwardIter	__rotate_aux (_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last, _Distance *, const forward_iterator_tag &)
template<class _BidirectionalIter , class _Distance >
_BidirectionalIter	__rotate_aux (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance *, const bidirectional_iterator_tag &)
template<class _EuclideanRingElement >
_STLP_INLINE_LOOP _EuclideanRingElement	__gcd (_EuclideanRingElement __m, _EuclideanRingElement __n)
template<class _RandomAccessIter , class _Distance , class _Tp >
_RandomAccessIter	__rotate_aux (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Distance *, _Tp *)
template<class _RandomAccessIter , class _Distance >
_RandomAccessIter	__rotate_aux (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Distance *__dis, const random_access_iterator_tag &)
template<class _ForwardIter >
_ForwardIter	__rotate (_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last)
template<class _ForwardIter >
_STLP_MOVE_TO_STD_NAMESPACE void	rotate (_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last)
template<class _Distance >
_STLP_MOVE_TO_PRIV_NAMESPACE _Distance	__random_number (_Distance __n)
template<class _RandomAccessIter >
_STLP_MOVE_TO_STD_NAMESPACE void	random_shuffle (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter , class _RandomNumberGenerator >
void	random_shuffle (_RandomAccessIter __first, _RandomAccessIter __last, _RandomNumberGenerator &__rand)
template<class _ForwardIter , class _OutputIter , class _Distance >
_OutputIter	random_sample_n (_ForwardIter __first, _ForwardIter __last, _OutputIter __out_ite, const _Distance __n)
template<class _ForwardIter , class _OutputIter , class _Distance , class _RandomNumberGenerator >
_OutputIter	random_sample_n (_ForwardIter __first, _ForwardIter __last, _OutputIter __out_ite, const _Distance __n, _RandomNumberGenerator &__rand)
template<class _InputIter , class _RandomAccessIter , class _Distance >
_STLP_MOVE_TO_PRIV_NAMESPACE _RandomAccessIter	__random_sample (_InputIter __first, _InputIter __last, _RandomAccessIter __out_ite, const _Distance __n)
template<class _InputIter , class _RandomAccessIter , class _RandomNumberGenerator , class _Distance >
_RandomAccessIter	__random_sample (_InputIter __first, _InputIter __last, _RandomAccessIter __out_ite, _RandomNumberGenerator &__rand, const _Distance __n)
template<class _InputIter , class _RandomAccessIter >
_STLP_MOVE_TO_STD_NAMESPACE _RandomAccessIter	random_sample (_InputIter __first, _InputIter __last, _RandomAccessIter __out_first, _RandomAccessIter __out_last)
template<class _InputIter , class _RandomAccessIter , class _RandomNumberGenerator >
_RandomAccessIter	random_sample (_InputIter __first, _InputIter __last, _RandomAccessIter __out_first, _RandomAccessIter __out_last, _RandomNumberGenerator &__rand)
template<class _ForwardIter , class _Predicate >
_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP _ForwardIter	__partition (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, const forward_iterator_tag &)
template<class _BidirectionalIter , class _Predicate >
_STLP_INLINE_LOOP _BidirectionalIter	__partition (_BidirectionalIter __first, _BidirectionalIter __last, _Predicate __pred, const bidirectional_iterator_tag &)
template<class _ForwardIter , class _Predicate >
_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter	partition (_ForwardIter __first, _ForwardIter __last, _Predicate __pred)
template<class _ForwardIter , class _Predicate , class _Distance >
_STLP_MOVE_TO_PRIV_NAMESPACE _ForwardIter	__inplace_stable_partition (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len, bool __pred_of_first, bool __pred_of_before_last)
template<class _ForwardIter , class _Pointer , class _Predicate , class _Distance >
_ForwardIter	__stable_partition_adaptive (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size, bool __pred_of_first, bool __pred_of_before_last)
template<class _ForwardIter , class _Predicate , class _Tp , class _Distance >
_ForwardIter	__stable_partition_aux_aux (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Tp *, _Distance *, bool __pred_of_before_last)
template<class _ForwardIter , class _Predicate >
_ForwardIter	__stable_partition_aux (_ForwardIter __first, _ForwardIter __last, _Predicate __pred, const forward_iterator_tag &)
template<class _BidirectIter , class _Predicate >
_BidirectIter	__stable_partition_aux (_BidirectIter __first, _BidirectIter __last, _Predicate __pred, const bidirectional_iterator_tag &)
template<class _ForwardIter , class _Predicate >
_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter	stable_partition (_ForwardIter __first, _ForwardIter __last, _Predicate __pred)
template<class _RandomAccessIter , class _Tp , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE _RandomAccessIter	__unguarded_partition (_RandomAccessIter __first, _RandomAccessIter __last, _Tp __pivot, _Compare __comp)
template<class _RandomAccessIter , class _Tp , class _Compare >
void	__unguarded_linear_insert (_RandomAccessIter __last, _Tp __val, _Compare __comp)
template<class _RandomAccessIter , class _Tp , class _Compare >
void	__linear_insert (_RandomAccessIter __first, _RandomAccessIter __last, _Tp __val, _Compare __comp)
template<class _RandomAccessIter , class _Tp , class _Compare >
void	__insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Compare __comp)
template<class _RandomAccessIter , class _Tp , class _Compare >
void	__unguarded_insertion_sort_aux (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Compare __comp)
template<class _RandomAccessIter , class _Compare >
void	__unguarded_insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter , class _Compare >
void	__final_insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter , class _Tp , class _Size , class _Compare >
void	__introsort_loop (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Size __depth_limit, _Compare __comp)
template<class _RandomAccessIter >
_STLP_MOVE_TO_STD_NAMESPACE void	sort (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter , class _Compare >
void	sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE void	__inplace_stable_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter1 , class _RandomAccessIter2 , class _Distance , class _Compare >
void	__merge_sort_loop (_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _Distance __step_size, _Compare __comp)
template<class _RandomAccessIter , class _Distance , class _Compare >
void	__chunk_insertion_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Distance __chunk_size, _Compare __comp)
template<class _RandomAccessIter , class _Pointer , class _Distance , class _Compare >
void	__merge_sort_with_buffer (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance *, _Compare __comp)
template<class _BidirectionalIter1 , class _BidirectionalIter2 , class _Distance >
_BidirectionalIter1	__rotate_adaptive (_BidirectionalIter1 __first, _BidirectionalIter1 __middle, _BidirectionalIter1 __last, _Distance __len1, _Distance __len2, _BidirectionalIter2 __buffer, _Distance __buffer_size)
template<class _BidirectionalIter , class _Distance , class _Pointer , class _Compare >
void	__merge_adaptive (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp)
template<class _RandomAccessIter , class _Pointer , class _Distance , class _Compare >
void	__stable_sort_adaptive (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp)
template<class _RandomAccessIter , class _Tp , class _Distance , class _Compare >
void	__stable_sort_aux (_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Distance *, _Compare __comp)
template<class _RandomAccessIter >
_STLP_MOVE_TO_STD_NAMESPACE void	stable_sort (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter , class _Compare >
void	stable_sort (_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
template<class _RandomAccessIter , class _Tp , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE void	__partial_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Tp *, _Compare __comp)
template<class _RandomAccessIter >
_STLP_MOVE_TO_STD_NAMESPACE void	partial_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last)
template<class _RandomAccessIter , class _Compare >
void	partial_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Compare __comp)
template<class _InputIter , class _RandomAccessIter , class _Compare , class _Distance , class _Tp >
_STLP_MOVE_TO_PRIV_NAMESPACE _RandomAccessIter	__partial_sort_copy (_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp, _Distance *, _Tp *)
template<class _InputIter , class _RandomAccessIter >
_STLP_MOVE_TO_STD_NAMESPACE _RandomAccessIter	partial_sort_copy (_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last)
template<class _InputIter , class _RandomAccessIter , class _Compare >
_RandomAccessIter	partial_sort_copy (_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp)
template<class _RandomAccessIter , class _Tp , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE void	__nth_element (_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Tp *, _Compare __comp)
template<class _RandomAccessIter >
_STLP_MOVE_TO_STD_NAMESPACE void	nth_element (_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last)
template<class _RandomAccessIter , class _Compare >
void	nth_element (_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Compare __comp)
template<class _ForwardIter , class _Tp , class _Compare1 , class _Compare2 , class _Distance >
_STLP_MOVE_TO_PRIV_NAMESPACE _ForwardIter	__upper_bound (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare1 __comp1, _Compare2 __comp2, _Distance *)
template<class _ForwardIter , class _Tp , class _Compare1 , class _Compare2 , class _Distance >
pair< _ForwardIter, _ForwardIter >	__equal_range (_ForwardIter __first, _ForwardIter __last, const _Tp &__val, _Compare1 __comp1, _Compare2 __comp2, _Distance *__dist)
template<class _InputIter1 , class _InputIter2 , class _OutputIter >
_STLP_MOVE_TO_STD_NAMESPACE _OutputIter	merge (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >
_OutputIter	merge (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _BidirectionalIter , class _Distance , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE void	__merge_without_buffer (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Compare __comp)
template<class _BidirectionalIter , class _Tp , class _Distance , class _Compare >
void	__inplace_merge_aux (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Tp *, _Distance *, _Compare __comp)
template<class _BidirectionalIter >
_STLP_MOVE_TO_STD_NAMESPACE void	inplace_merge (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last)
template<class _BidirectionalIter , class _Compare >
void	inplace_merge (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Compare __comp)
template<class _InputIter1 , class _InputIter2 , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE bool	__includes (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp)
template<class _InputIter1 , class _InputIter2 , class _Compare >
_STLP_MOVE_TO_STD_NAMESPACE bool	includes (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp)
template<class _InputIter1 , class _InputIter2 >
bool	includes (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2)
template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter	__set_union (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1 , class _InputIter2 , class _OutputIter >
_STLP_MOVE_TO_STD_NAMESPACE _OutputIter	set_union (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >
_OutputIter	set_union (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter	__set_intersection (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1 , class _InputIter2 , class _OutputIter >
_STLP_MOVE_TO_STD_NAMESPACE _OutputIter	set_intersection (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >
_OutputIter	set_intersection (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter	__set_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1 , class _InputIter2 , class _OutputIter >
_STLP_MOVE_TO_STD_NAMESPACE _OutputIter	set_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >
_OutputIter	set_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter	__set_symmetric_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _InputIter1 , class _InputIter2 , class _OutputIter >
_STLP_MOVE_TO_STD_NAMESPACE _OutputIter	set_symmetric_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >
_OutputIter	set_symmetric_difference (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp)
template<class _ForwardIter >
_ForwardIter	max_element (_ForwardIter __first, _ForwardIter __last)
template<class _ForwardIter , class _Compare >
_ForwardIter	max_element (_ForwardIter __first, _ForwardIter __last, _Compare __comp)
template<class _ForwardIter >
_ForwardIter	min_element (_ForwardIter __first, _ForwardIter __last)
template<class _ForwardIter , class _Compare >
_ForwardIter	min_element (_ForwardIter __first, _ForwardIter __last, _Compare __comp)
template<class _BidirectionalIter , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE bool	__next_permutation (_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp)
template<class _BidirectionalIter >
_STLP_MOVE_TO_STD_NAMESPACE bool	next_permutation (_BidirectionalIter __first, _BidirectionalIter __last)
template<class _BidirectionalIter , class _Compare >
bool	next_permutation (_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp)
template<class _BidirectionalIter , class _Compare >
_STLP_MOVE_TO_PRIV_NAMESPACE bool	__prev_permutation (_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp)
template<class _BidirectionalIter >
_STLP_MOVE_TO_STD_NAMESPACE bool	prev_permutation (_BidirectionalIter __first, _BidirectionalIter __last)
template<class _BidirectionalIter , class _Compare >
bool	prev_permutation (_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp)
template<class _RandomAccessIter , class _Distance , class _StrictWeakOrdering >
_STLP_MOVE_TO_PRIV_NAMESPACE bool	__is_heap (_RandomAccessIter __first, _StrictWeakOrdering __comp, _Distance __n)
template<class _RandomAccessIter >
_STLP_MOVE_TO_STD_NAMESPACE bool	is_heap (_RandomAccessIter __first, _RandomAccessIter __last)
template<class _RandomAccessIter , class _StrictWeakOrdering >
bool	is_heap (_RandomAccessIter __first, _RandomAccessIter __last, _StrictWeakOrdering __comp)
template<class _ForwardIter , class _StrictWeakOrdering >
_STLP_MOVE_TO_PRIV_NAMESPACE bool	__is_sorted (_ForwardIter __first, _ForwardIter __last, _StrictWeakOrdering __comp)

Variables
const int	__stl_chunk_size = 7

Macro Definition Documentation

__stl_threshold

#define __stl_threshold   16

Definition at line 904 of file _algo.c.

_STLP_ALGO_C

#define _STLP_ALGO_C

Definition at line 27 of file _algo.c.

Function Documentation

__chunk_insertion_sort()

template<class _RandomAccessIter , class _Distance , class _Compare >

void __chunk_insertion_sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Distance	__chunk_size,
		_Compare	__comp
	)

Definition at line 1061 of file _algo.c.

                                                                     {
  while (__last - __first >= __chunk_size) {
    __insertion_sort(__first, __first + __chunk_size,
                     _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
    __first += __chunk_size;
  }
  __insertion_sort(__first, __last, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
}

Referenced by __merge_sort_with_buffer().

__equal_range()

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

pair< _ForwardIter, _ForwardIter > __equal_range	(	_ForwardIter	__first,
		_ForwardIter	__last,
		const _Tp &	__val,
		_Compare1	__comp1,
		_Compare2	__comp2,
		_Distance *	__dist
	)

Definition at line 1381 of file _algo.c.

                                                                       {
  _Distance __len = _STLP_STD::distance(__first, __last);
  _Distance __half;
 
  while (__len > 0) {
    __half = __len >> 1;
    _ForwardIter __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 if (__comp2(__val, *__middle)) {
      _STLP_VERBOSE_ASSERT(!__comp1(*__middle, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      __len = __half;
    }
    else {
      _ForwardIter __left = _STLP_PRIV __lower_bound(__first, __middle, __val, __comp1, __comp2, __dist);
      //Small optim: If lower_bound haven't found an equivalent value
      //there is no need to call upper_bound.
      if (__comp1(*__left, __val)) {
        _STLP_VERBOSE_ASSERT(!__comp2(__val, *__left), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
        return pair<_ForwardIter, _ForwardIter>(__left, __left);
      }
      _STLP_STD::advance(__first, __len);
      _ForwardIter __right = _STLP_PRIV __upper_bound(++__middle, __first, __val, __comp1, __comp2, __dist);
      return pair<_ForwardIter, _ForwardIter>(__left, __right);
    }
  }
  return pair<_ForwardIter, _ForwardIter>(__first, __first);
}

Referenced by equal_range().

__final_insertion_sort()

template<class _RandomAccessIter , class _Compare >

void __final_insertion_sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Compare	__comp
	)

Definition at line 959 of file _algo.c.

                                                                       {
  if (__last - __first > __stl_threshold) {
    __insertion_sort(__first, __first + __stl_threshold, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
    __unguarded_insertion_sort(__first + __stl_threshold, __last, __comp);
  }
  else
    __insertion_sort(__first, __last, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
}

Referenced by sort().

__gcd()

template<class _EuclideanRingElement >

_STLP_INLINE_LOOP _EuclideanRingElement __gcd	(	_EuclideanRingElement	__m,
		_EuclideanRingElement	__n
	)

Definition at line 432 of file _algo.c.

                                                       {
  while (__n != 0) {
    _EuclideanRingElement __t = __m % __n;
    __m = __n;
    __n = __t;
  }
  return __m;
}

Referenced by __rotate_aux().

__includes()

template<class _InputIter1 , class _InputIter2 , class _Compare >

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

Definition at line 1581 of file _algo.c.

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

Referenced by includes().

__inplace_merge_aux()

template<class _BidirectionalIter , class _Tp , class _Distance , class _Compare >

void __inplace_merge_aux ( _BidirectionalIter  __first, _BidirectionalIter  __middle, _BidirectionalIter  __last, _Tp *  , _Distance *  , _Compare  __comp  )

inline

Definition at line 1534 of file _algo.c.

                                                 {
  _Distance __len1 = _STLP_STD::distance(__first, __middle);
  _Distance __len2 = _STLP_STD::distance(__middle, __last);
 
  _Temporary_buffer<_BidirectionalIter, _Tp> __buf(__first, __last);
  if (__buf.begin() == 0)
    __merge_without_buffer(__first, __middle, __last, __len1, __len2, __comp);
  else
    __merge_adaptive(__first, __middle, __last, __len1, __len2,
                     __buf.begin(), _Distance(__buf.size()),
                     __comp);
}

Referenced by inplace_merge().

__inplace_stable_partition()

template<class _ForwardIter , class _Predicate , class _Distance >

_STLP_MOVE_TO_PRIV_NAMESPACE _ForwardIter __inplace_stable_partition	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Predicate	__pred,
		_Distance	__len,
		bool	__pred_of_first,
		bool	__pred_of_before_last
	)

Definition at line 752 of file _algo.c.

                                                                                          {
  if (__len == 1)
    return (__pred_of_first && (__pred_of_before_last || __pred(*__first))) ? __last : __first;
  _ForwardIter __middle = __first;
  _Distance __half_len = __len / 2;
  _STLP_STD::advance(__middle, __half_len);
  return _STLP_PRIV __rotate(_STLP_PRIV __inplace_stable_partition(__first, __middle, __pred, __half_len, __pred_of_first, false),
                             __middle,
                             _STLP_PRIV __inplace_stable_partition(__middle, __last, __pred, __len - __half_len, true, __pred_of_before_last));
}

Referenced by __inplace_stable_partition(), and __stable_partition_aux_aux().

__inplace_stable_sort()

template<class _RandomAccessIter , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE void __inplace_stable_sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Compare	__comp
	)

Definition at line 1020 of file _algo.c.

                                                                      {
  if (__last - __first < 15) {
    __insertion_sort(__first, __last, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
    return;
  }
  _RandomAccessIter __middle = __first + (__last - __first) / 2;
  __inplace_stable_sort(__first, __middle, __comp);
  __inplace_stable_sort(__middle, __last, __comp);
  __merge_without_buffer(__first, __middle, __last,
                         __middle - __first,
                         __last - __middle,
                         __comp);
}

Referenced by __inplace_stable_sort(), and __stable_sort_aux().

__insertion_sort()

template<class _RandomAccessIter , class _Tp , class _Compare >

void __insertion_sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Tp *	,
		_Compare	__comp
	)

Definition at line 935 of file _algo.c.

                                              {
  if (__first == __last) return;
  for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
    __linear_insert<_RandomAccessIter, _Tp, _Compare>(__first, __i, *__i, __comp);  //*TY 12/26/1998 - supply *__i as __val
}

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

__introsort_loop()

template<class _RandomAccessIter , class _Tp , class _Size , class _Compare >

void __introsort_loop	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Tp *	,
		_Size	__depth_limit,
		_Compare	__comp
	)

Definition at line 970 of file _algo.c.

                                                            {
  while (__last - __first > __stl_threshold) {
    if (__depth_limit == 0) {
      partial_sort(__first, __last, __last, __comp);
      return;
    }
    --__depth_limit;
    _RandomAccessIter __cut =
      __unguarded_partition(__first, __last,
                            _Tp(__median(*__first,
                                         *(__first + (__last - __first)/2),
                                         *(__last - 1), __comp)),
       __comp);
    __introsort_loop(__cut, __last, (_Tp*) 0, __depth_limit, __comp);
    __last = __cut;
  }
}

Referenced by __introsort_loop(), and sort().

__is_heap()

template<class _RandomAccessIter , class _Distance , class _StrictWeakOrdering >

_STLP_MOVE_TO_PRIV_NAMESPACE bool __is_heap	(	_RandomAccessIter	__first,
		_StrictWeakOrdering	__comp,
		_Distance	__n
	)

Definition at line 1968 of file _algo.c.

                              {
  _Distance __parent = 0;
  for (_Distance __child = 1; __child < __n; ++__child) {
    if (__comp(__first[__parent], __first[__child])) {
      _STLP_VERBOSE_ASSERT(!__comp(__first[__child], __first[__parent]), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      return false;
    }
    if ((__child & 1) == 0)
      ++__parent;
  }
  return true;
}

Referenced by is_heap().

__is_sorted()

template<class _ForwardIter , class _StrictWeakOrdering >

_STLP_MOVE_TO_PRIV_NAMESPACE bool __is_sorted	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_StrictWeakOrdering	__comp
	)

Definition at line 2001 of file _algo.c.

                                             {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last)
    return true;
 
  _ForwardIter __next = __first;
  for (++__next; __next != __last; __first = __next, ++__next) {
    if (__comp(*__next, *__first)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first, *__next), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      return false;
    }
  }
 
  return true;
}

Referenced by is_sorted().

__linear_insert()

template<class _RandomAccessIter , class _Tp , class _Compare >

void __linear_insert ( _RandomAccessIter  __first, _RandomAccessIter  __last, _Tp  __val, _Compare  __comp  )

inline

Definition at line 921 of file _algo.c.

                                                                                  {
  //*TY 12/26/1998 - added __val as a paramter
  //  _Tp __val = *__last;        //*TY 12/26/1998 - __val supplied by caller
  if (__comp(__val, *__first)) {
    _STLP_VERBOSE_ASSERT(!__comp(*__first, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
    copy_backward(__first, __last, __last + 1);
    *__first = __val;
  }
  else
    __unguarded_linear_insert(__last, __val, __comp);
}

__median() [1/2]

template<class _Tp >

const _Tp & __median ( const _Tp &  __a, const _Tp &  __b, const _Tp &  __c  )

inline

Definition at line 62 of file _algo.c.

                                                                    {
  if (__a < __b)
    if (__b < __c)
      return __b;
    else if (__a < __c)
      return __c;
    else
      return __a;
  else if (__a < __c)
    return __a;
  else if (__b < __c)
    return __c;
  else
    return __b;
}

Referenced by __introsort_loop(), and __nth_element().

__median() [2/2]

template<class _Tp , class _Compare >

const _Tp & __median ( const _Tp &  __a, const _Tp &  __b, const _Tp &  __c, _Compare  __comp  )

inline

Definition at line 83 of file _algo.c.

                                                                          {
  if (__comp(__a, __b)) {
    _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
    if (__comp(__b, __c)) {
      _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      return __b;
    }
    else if (__comp(__a, __c)) {
      _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      return __c;
    }
    else
      return __a;
  }
  else if (__comp(__a, __c)) {
    _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
    return __a;
  }
  else if (__comp(__b, __c)) {
    _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
    return __c;
  }
  else
    return __b;
}

__merge_adaptive()

template<class _BidirectionalIter , class _Distance , class _Pointer , class _Compare >

void __merge_adaptive	(	_BidirectionalIter	__first,
		_BidirectionalIter	__middle,
		_BidirectionalIter	__last,
		_Distance	__len1,
		_Distance	__len2,
		_Pointer	__buffer,
		_Distance	__buffer_size,
		_Compare	__comp
	)

Definition at line 1115 of file _algo.c.

                                       {
  if (__len1 <= __len2 && __len1 <= __buffer_size) {
    _Pointer __buffer_end = _STLP_STD::copy(__first, __middle, __buffer);
    _STLP_STD::merge(__buffer, __buffer_end, __middle, __last, __first, __comp);
  }
  else if (__len2 <= __buffer_size) {
    _Pointer __buffer_end = _STLP_STD::copy(__middle, __last, __buffer);
    _STLP_PRIV __merge_backward(__first, __middle, __buffer, __buffer_end, __last,
                                __comp);
  }
  else {
    _BidirectionalIter __first_cut = __first;
    _BidirectionalIter __second_cut = __middle;
    _Distance __len11 = 0;
    _Distance __len22 = 0;
    if (__len1 > __len2) {
      __len11 = __len1 / 2;
      _STLP_STD::advance(__first_cut, __len11);
      __second_cut = _STLP_STD::lower_bound(__middle, __last, *__first_cut, __comp);
      __len22 += _STLP_STD::distance(__middle, __second_cut);
    }
    else {
      __len22 = __len2 / 2;
      _STLP_STD::advance(__second_cut, __len22);
      __first_cut = _STLP_STD::upper_bound(__first, __middle, *__second_cut, __comp);
      __len11 += _STLP_STD::distance(__first, __first_cut);
    }
    _BidirectionalIter __new_middle =
      __rotate_adaptive(__first_cut, __middle, __second_cut, __len1 - __len11,
                        __len22, __buffer, __buffer_size);
    __merge_adaptive(__first, __first_cut, __new_middle, __len11,
                     __len22, __buffer, __buffer_size, __comp);
    __merge_adaptive(__new_middle, __second_cut, __last, __len1 - __len11,
                     __len2 - __len22, __buffer, __buffer_size, __comp);
  }
}

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

__merge_backward()

template<class _BidirectionalIter1 , class _BidirectionalIter2 , class _BidirectionalIter3 , class _Compare >

_BidirectionalIter3 __merge_backward	(	_BidirectionalIter1	__first1,
		_BidirectionalIter1	__last1,
		_BidirectionalIter2	__first2,
		_BidirectionalIter2	__last2,
		_BidirectionalIter3	__result,
		_Compare	__comp
	)

Definition at line 1503 of file _algo.c.

                                                      {
  if (__first1 == __last1)
    return copy_backward(__first2, __last2, __result);
  if (__first2 == __last2)
    return copy_backward(__first1, __last1, __result);
  --__last1;
  --__last2;
  for (;;) {
    if (__comp(*__last2, *__last1)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__last1, *__last2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      *--__result = *__last1;
      if (__first1 == __last1)
        return copy_backward(__first2, ++__last2, __result);
      --__last1;
    }
    else {
      *--__result = *__last2;
      if (__first2 == __last2)
        return copy_backward(__first1, ++__last1, __result);
      --__last2;
    }
  }
}

Referenced by __merge_adaptive().

__merge_sort_loop()

template<class _RandomAccessIter1 , class _RandomAccessIter2 , class _Distance , class _Compare >

void __merge_sort_loop	(	_RandomAccessIter1	__first,
		_RandomAccessIter1	__last,
		_RandomAccessIter2	__result,
		_Distance	__step_size,
		_Compare	__comp
	)

Definition at line 1037 of file _algo.c.

                                        {
  _Distance __two_step = 2 * __step_size;
 
  while (__last - __first >= __two_step) {
    __result = merge(__first, __first + __step_size,
                     __first + __step_size, __first + __two_step,
                     __result,
                     __comp);
    __first += __two_step;
  }
  __step_size = (min) (_Distance(__last - __first), __step_size);
 
  merge(__first, __first + __step_size,
        __first + __step_size, __last,
        __result,
        __comp);
}

Referenced by __merge_sort_with_buffer().

__merge_sort_with_buffer()

template<class _RandomAccessIter , class _Pointer , class _Distance , class _Compare >

void __merge_sort_with_buffer	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Pointer	__buffer,
		_Distance *	,
		_Compare	__comp
	)

Definition at line 1074 of file _algo.c.

                                                           {
  _Distance __len = __last - __first;
  _Pointer __buffer_last = __buffer + __len;
 
  _Distance __step_size = __stl_chunk_size;
  __chunk_insertion_sort(__first, __last, __step_size, __comp);
 
  while (__step_size < __len) {
    __merge_sort_loop(__first, __last, __buffer, __step_size, __comp);
    __step_size *= 2;
    __merge_sort_loop(__buffer, __buffer_last, __first, __step_size, __comp);
    __step_size *= 2;
  }
}

Referenced by __stable_sort_adaptive().

__merge_without_buffer() [1/2]

template<class _BidirectionalIter , class _Distance , class _Compare >

_STLP_BEGIN_NAMESPACE _STLP_MOVE_TO_PRIV_NAMESPACE void __merge_without_buffer	(	_BidirectionalIter	__first,
		_BidirectionalIter	__middle,
		_BidirectionalIter	__last,
		_Distance	__len1,
		_Distance	__len2,
		_Compare	__comp
	)

Definition at line 1463 of file _algo.c.

                                             {
  if (__len1 == 0 || __len2 == 0)
    return;
  if (__len1 + __len2 == 2) {
    if (__comp(*__middle, *__first)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first, *__middle), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      iter_swap(__first, __middle);
    }
    return;
  }
  _BidirectionalIter __first_cut = __first;
  _BidirectionalIter __second_cut = __middle;
  _Distance __len11 = 0;
  _Distance __len22 = 0;
  if (__len1 > __len2) {
    __len11 = __len1 / 2;
    _STLP_STD::advance(__first_cut, __len11);
    __second_cut = _STLP_STD::lower_bound(__middle, __last, *__first_cut, __comp);
    __len22 += _STLP_STD::distance(__middle, __second_cut);
  }
  else {
    __len22 = __len2 / 2;
    _STLP_STD::advance(__second_cut, __len22);
    __first_cut = _STLP_STD::upper_bound(__first, __middle, *__second_cut, __comp);
    __len11 += _STLP_STD::distance(__first, __first_cut);
  }
  _BidirectionalIter __new_middle
    = _STLP_PRIV __rotate(__first_cut, __middle, __second_cut);
  __merge_without_buffer(__first, __first_cut, __new_middle, __len11, __len22,
                         __comp);
  __merge_without_buffer(__new_middle, __second_cut, __last, __len1 - __len11,
                         __len2 - __len22, __comp);
}

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

__merge_without_buffer() [2/2]

template<class _BidirectionalIter , class _Distance , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE void __merge_without_buffer	(	_BidirectionalIter	__first,
		_BidirectionalIter	__middle,
		_BidirectionalIter	__last,
		_Distance	__len1,
		_Distance	__len2,
		_Compare	__comp
	)

Definition at line 1463 of file _algo.c.

                                             {
  if (__len1 == 0 || __len2 == 0)
    return;
  if (__len1 + __len2 == 2) {
    if (__comp(*__middle, *__first)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first, *__middle), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      iter_swap(__first, __middle);
    }
    return;
  }
  _BidirectionalIter __first_cut = __first;
  _BidirectionalIter __second_cut = __middle;
  _Distance __len11 = 0;
  _Distance __len22 = 0;
  if (__len1 > __len2) {
    __len11 = __len1 / 2;
    _STLP_STD::advance(__first_cut, __len11);
    __second_cut = _STLP_STD::lower_bound(__middle, __last, *__first_cut, __comp);
    __len22 += _STLP_STD::distance(__middle, __second_cut);
  }
  else {
    __len22 = __len2 / 2;
    _STLP_STD::advance(__second_cut, __len22);
    __first_cut = _STLP_STD::upper_bound(__first, __middle, *__second_cut, __comp);
    __len11 += _STLP_STD::distance(__first, __first_cut);
  }
  _BidirectionalIter __new_middle
    = _STLP_PRIV __rotate(__first_cut, __middle, __second_cut);
  __merge_without_buffer(__first, __first_cut, __new_middle, __len11, __len22,
                         __comp);
  __merge_without_buffer(__new_middle, __second_cut, __last, __len1 - __len11,
                         __len2 - __len22, __comp);
}

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

__next_permutation()

template<class _BidirectionalIter , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE bool __next_permutation	(	_BidirectionalIter	__first,
		_BidirectionalIter	__last,
		_Compare	__comp
	)

Definition at line 1860 of file _algo.c.

                                         {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last)
    return false;
  _BidirectionalIter __i = __first;
  ++__i;
  if (__i == __last)
    return false;
  __i = __last;
  --__i;
 
  for(;;) {
    _BidirectionalIter __ii = __i;
    --__i;
    if (__comp(*__i, *__ii)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__ii, *__i), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      _BidirectionalIter __j = __last;
      while (!__comp(*__i, *--__j)) {}
      iter_swap(__i, __j);
      reverse(__ii, __last);
      return true;
    }
    if (__i == __first) {
      reverse(__first, __last);
      return false;
    }
  }
#if defined (_STLP_NEED_UNREACHABLE_RETURN)
    return false;
#endif
}

Referenced by next_permutation().

__nth_element()

template<class _RandomAccessIter , class _Tp , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE void __nth_element	(	_RandomAccessIter	__first,
		_RandomAccessIter	__nth,
		_RandomAccessIter	__last,
		_Tp *	,
		_Compare	__comp
	)

Definition at line 1314 of file _algo.c.

                                                                    {
  while (__last - __first > 3) {
    _RandomAccessIter __cut =
      __unguarded_partition(__first, __last,
                            _Tp(__median(*__first,
                                         *(__first + (__last - __first)/2),
                                         *(__last - 1),
                                         __comp)),
                            __comp);
    if (__cut <= __nth)
      __first = __cut;
    else
      __last = __cut;
  }
  __insertion_sort(__first, __last, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
}

Referenced by nth_element().

__partial_sort()

template<class _RandomAccessIter , class _Tp , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE void __partial_sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__middle,
		_RandomAccessIter	__last,
		_Tp *	,
		_Compare	__comp
	)

Definition at line 1220 of file _algo.c.

                                                                     {
  make_heap(__first, __middle, __comp);
  for (_RandomAccessIter __i = __middle; __i < __last; ++__i) {
    if (__comp(*__i, *__first)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first, *__i), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      __pop_heap(__first, __middle, __i, _Tp(*__i), __comp,
                 _STLP_DISTANCE_TYPE(__first, _RandomAccessIter));
    }
  }
  sort_heap(__first, __middle, __comp);
}

Referenced by partial_sort().

__partial_sort_copy()

template<class _InputIter , class _RandomAccessIter , class _Compare , class _Distance , class _Tp >

_STLP_MOVE_TO_PRIV_NAMESPACE _RandomAccessIter __partial_sort_copy	(	_InputIter	__first,
		_InputIter	__last,
		_RandomAccessIter	__result_first,
		_RandomAccessIter	__result_last,
		_Compare	__comp,
		_Distance *	,
		_Tp *
	)

Definition at line 1256 of file _algo.c.

                                                                         {
  if (__result_first == __result_last) return __result_last;
  _RandomAccessIter __result_real_last = __result_first;
  while(__first != __last && __result_real_last != __result_last) {
    *__result_real_last = *__first;
    ++__result_real_last;
    ++__first;
  }
  make_heap(__result_first, __result_real_last, __comp);
  while (__first != __last) {
    if (__comp(*__first, *__result_first)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__result_first, *__first), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      __adjust_heap(__result_first, _Distance(0),
                    _Distance(__result_real_last - __result_first),
                    _Tp(*__first),
                    __comp);
    }
    ++__first;
  }
  sort_heap(__result_first, __result_real_last, __comp);
  return __result_real_last;
}

Referenced by partial_sort_copy().

__partition() [1/2]

template<class _BidirectionalIter , class _Predicate >

_STLP_INLINE_LOOP _BidirectionalIter __partition	(	_BidirectionalIter	__first,
		_BidirectionalIter	__last,
		_Predicate	__pred,
		const bidirectional_iterator_tag &
	)

Definition at line 697 of file _algo.c.

                                                                                     {
  for (;;) {
    for (;;) {
      if (__first == __last)
        return __first;
      else if (__pred(*__first))
        ++__first;
      else
        break;
    }
    --__last;
    for (;;) {
      if (__first == __last)
        return __first;
      else if (!__pred(*__last))
        --__last;
      else
        break;
    }
    iter_swap(__first, __last);
    ++__first;
  }
}

__partition() [2/2]

template<class _ForwardIter , class _Predicate >

_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP _ForwardIter __partition	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Predicate	__pred,
		const forward_iterator_tag &
	)

Definition at line 676 of file _algo.c.

                                                                         {
  if (__first == __last) return __first;
 
  while (__pred(*__first))
    if (++__first == __last) return __first;
 
  _ForwardIter __next = __first;
 
  while (++__next != __last) {
    if (__pred(*__next)) {
      _STLP_STD::swap(*__first, *__next);
      ++__first;
    }
  }
  return __first;
}

Referenced by partition().

__prev_permutation()

template<class _BidirectionalIter , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE bool __prev_permutation	(	_BidirectionalIter	__first,
		_BidirectionalIter	__last,
		_Compare	__comp
	)

Definition at line 1912 of file _algo.c.

                                         {
  if (__first == __last)
    return false;
  _BidirectionalIter __i = __first;
  ++__i;
  if (__i == __last)
    return false;
  __i = __last;
  --__i;
 
  for(;;) {
    _BidirectionalIter __ii = __i;
    --__i;
    if (__comp(*__ii, *__i)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__i, *__ii), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      _BidirectionalIter __j = __last;
      while (!__comp(*--__j, *__i)) {}
      iter_swap(__i, __j);
      reverse(__ii, __last);
      return true;
    }
    if (__i == __first) {
      reverse(__first, __last);
      return false;
    }
  }
#if defined (_STLP_NEED_UNREACHABLE_RETURN)
    return false;
#endif
}

Referenced by prev_permutation().

__random_number()

template<class _Distance >

_STLP_MOVE_TO_PRIV_NAMESPACE _Distance __random_number ( _Distance  __n )

inline

Definition at line 529 of file _algo.c.

                                                {
#ifdef _STLP_NO_DRAND48
  return rand() % __n;
#else
  return lrand48() % __n;
#endif
}

Referenced by __random_sample(), random_sample_n(), and random_shuffle().

__random_sample() [1/2]

template<class _InputIter , class _RandomAccessIter , class _RandomNumberGenerator , class _Distance >

_RandomAccessIter __random_sample	(	_InputIter	__first,
		_InputIter	__last,
		_RandomAccessIter	__out_ite,
		_RandomNumberGenerator &	__rand,
		const _Distance	__n
	)

Definition at line 626 of file _algo.c.

                                                       {
  _Distance __m = 0;
  _Distance __t = __n;
  for ( ; __first != __last && __m < __n; ++__m, ++__first)
    __out_ite[__m] = *__first;
 
  while (__first != __last) {
    ++__t;
    _Distance __M = __rand(__t);
    if (__M < __n)
      __out_ite[__M] = *__first;
    ++__first;
  }
 
  return __out_ite + __m;
}

__random_sample() [2/2]

template<class _InputIter , class _RandomAccessIter , class _Distance >

_STLP_MOVE_TO_PRIV_NAMESPACE _RandomAccessIter __random_sample	(	_InputIter	__first,
		_InputIter	__last,
		_RandomAccessIter	__out_ite,
		const _Distance	__n
	)

Definition at line 605 of file _algo.c.

                                                       {
  _Distance __m = 0;
  _Distance __t = __n;
  for ( ; __first != __last && __m < __n; ++__m, ++__first)
    __out_ite[__m] = *__first;
 
  while (__first != __last) {
    ++__t;
    _Distance __M = __random_number(__t);
    if (__M < __n)
      __out_ite[__M] = *__first;
    ++__first;
  }
 
  return __out_ite + __m;
}

Referenced by random_sample().

__rotate()

template<class _ForwardIter >

_ForwardIter __rotate	(	_ForwardIter	__first,
		_ForwardIter	__middle,
		_ForwardIter	__last
	)

Definition at line 508 of file _algo.c.

                                                                           {
  _STLP_DEBUG_CHECK(__check_range(__first, __middle))
  _STLP_DEBUG_CHECK(__check_range(__middle, __last))
  return __rotate_aux(__first, __middle, __last,
                      _STLP_DISTANCE_TYPE(__first, _ForwardIter),
                      _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
}

Referenced by __inplace_stable_partition(), __merge_without_buffer(), __rotate_adaptive(), __stable_partition_adaptive(), and rotate().

__rotate_adaptive()

template<class _BidirectionalIter1 , class _BidirectionalIter2 , class _Distance >

_BidirectionalIter1 __rotate_adaptive	(	_BidirectionalIter1	__first,
		_BidirectionalIter1	__middle,
		_BidirectionalIter1	__last,
		_Distance	__len1,
		_Distance	__len2,
		_BidirectionalIter2	__buffer,
		_Distance	__buffer_size
	)

Definition at line 1093 of file _algo.c.

                                                               {
  if (__len1 > __len2 && __len2 <= __buffer_size) {
    _BidirectionalIter2 __buffer_end = _STLP_STD::copy(__middle, __last, __buffer);
    _STLP_STD::copy_backward(__first, __middle, __last);
    return _STLP_STD::copy(__buffer, __buffer_end, __first);
  }
  else if (__len1 <= __buffer_size) {
    _BidirectionalIter2 __buffer_end = _STLP_STD::copy(__first, __middle, __buffer);
    _STLP_STD::copy(__middle, __last, __first);
    return _STLP_STD::copy_backward(__buffer, __buffer_end, __last);
  }
  else
    return _STLP_PRIV __rotate(__first, __middle, __last);
}

Referenced by __merge_adaptive().

__rotate_aux() [1/4]

template<class _BidirectionalIter , class _Distance >

_BidirectionalIter __rotate_aux	(	_BidirectionalIter	__first,
		_BidirectionalIter	__middle,
		_BidirectionalIter	__last,
		_Distance *	,
		const bidirectional_iterator_tag &
	)

Definition at line 403 of file _algo.c.

                                                                    {
  if (__first == __middle)
    return __last;
  if (__last  == __middle)
    return __first;
 
  _STLP_PRIV __reverse(__first,  __middle, bidirectional_iterator_tag());
  _STLP_PRIV __reverse(__middle, __last,   bidirectional_iterator_tag());
 
  while (__first != __middle && __middle != __last)
    _STLP_STD::swap(*__first++, *--__last);
 
  if (__first == __middle) {
    _STLP_PRIV __reverse(__middle, __last,   bidirectional_iterator_tag());
    return __last;
  }
  else {
    _STLP_PRIV __reverse(__first,  __middle, bidirectional_iterator_tag());
    return __first;
  }
}

__rotate_aux() [2/4]

template<class _ForwardIter , class _Distance >

_STLP_MOVE_TO_PRIV_NAMESPACE _ForwardIter __rotate_aux	(	_ForwardIter	__first,
		_ForwardIter	__middle,
		_ForwardIter	__last,
		_Distance *	,
		const forward_iterator_tag &
	)

Definition at line 370 of file _algo.c.

                                                        {
  if (__first == __middle)
    return __last;
  if (__last  == __middle)
    return __first;
 
  _ForwardIter __first2 = __middle;
  do {
    _STLP_STD::swap(*__first++, *__first2++);
    if (__first == __middle)
      __middle = __first2;
  } while (__first2 != __last);
 
  _ForwardIter __new_middle = __first;
 
  __first2 = __middle;
 
  while (__first2 != __last) {
    _STLP_STD::swap (*__first++, *__first2++);
    if (__first == __middle)
      __middle = __first2;
    else if (__first2 == __last)
      __first2 = __middle;
  }
 
  return __new_middle;
}

Referenced by __rotate(), and __rotate_aux().

__rotate_aux() [3/4]

template<class _RandomAccessIter , class _Distance , class _Tp >

_RandomAccessIter __rotate_aux	(	_RandomAccessIter	__first,
		_RandomAccessIter	__middle,
		_RandomAccessIter	__last,
		_Distance *	,
		_Tp *
	)

Definition at line 443 of file _algo.c.

                                                   {
 
  _Distance __n = __last   - __first;
  _Distance __k = __middle - __first;
  _Distance __l = __n - __k;
  _RandomAccessIter __result = __first + (__last - __middle);
 
  if (__k == 0)  /* __first == middle */
    return __last;
 
  if (__k == __l) {
    _STLP_STD::swap_ranges(__first, __middle, __middle);
    return __result;
  }
 
  _Distance __d = _STLP_PRIV __gcd(__n, __k);
 
  for (_Distance __i = 0; __i < __d; __i++) {
    _Tp __tmp = *__first;
    _RandomAccessIter __p = __first;
 
    if (__k < __l) {
      for (_Distance __j = 0; __j < __l/__d; __j++) {
        if (__p > __first + __l) {
          *__p = *(__p - __l);
          __p -= __l;
        }
 
        *__p = *(__p + __k);
        __p += __k;
      }
    }
 
    else {
      for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
        if (__p < __last - __k) {
          *__p = *(__p + __k);
          __p += __k;
        }
 
        *__p = * (__p - __l);
        __p -= __l;
      }
    }
 
    *__p = __tmp;
    ++__first;
  }
 
  return __result;
}

__rotate_aux() [4/4]

template<class _RandomAccessIter , class _Distance >

_RandomAccessIter __rotate_aux ( _RandomAccessIter  __first, _RandomAccessIter  __middle, _RandomAccessIter  __last, _Distance *  __dis, const random_access_iterator_tag &    )

inline

Definition at line 500 of file _algo.c.

                                                                    {
  return _STLP_PRIV __rotate_aux(__first, __middle, __last,
                                 __dis, _STLP_VALUE_TYPE(__first, _RandomAccessIter));
}

__search_n() [1/2]

template<class _ForwardIter , class _Integer , class _Tp , class _Distance , class _BinaryPred >

_ForwardIter __search_n	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Integer	__count,
		const _Tp &	__val,
		_BinaryPred	__pred,
		_Distance *	,
		const forward_iterator_tag &
	)

Definition at line 220 of file _algo.c.

                                                                  {
  for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
  while (__first != __last) {
    _Integer __n = __count - 1;
    _ForwardIter __i = __first;
    ++__i;
    while (__i != __last && __n != 0 && __pred(*__i, __val)) {
      ++__i;
      --__n;
    }
    if (__n == 0)
      return __first;
    else if (__i != __last)
      for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {}
    else
      break;
  }
  return __last;
}

__search_n() [2/2]

template<class _RandomAccessIter , class _Integer , class _Tp , class _BinaryPred , class _Distance >

_STLP_MOVE_TO_PRIV_NAMESPACE _RandomAccessIter __search_n	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Integer	__count,
		const _Tp &	__val,
		_BinaryPred	__pred,
		_Distance *	,
		const random_access_iterator_tag &
	)

Definition at line 154 of file _algo.c.

{
  _Distance __tailSize = __last - __first;
  const _Distance __pattSize = __count;
  const _Distance __skipOffset = __pattSize - 1;
  _RandomAccessIter __backTrack;
  _Distance __remainder, __prevRemainder;
 
  for ( _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize >= __pattSize; __lookAhead += __pattSize ) { // the main loop...
    //__lookAhead here is always pointing to the last element of next possible match.
    __tailSize -= __pattSize;
 
    while ( !__pred(*__lookAhead, __val) ) { // the skip loop...
      if (__tailSize < __pattSize)
        return __last;
 
      __lookAhead += __pattSize;
      __tailSize -= __pattSize;
    }
 
    if ( __skipOffset == 0 ) {
      return (__lookAhead - __skipOffset); //Success
    }
 
    __remainder = __skipOffset;
 
    for (__backTrack = __lookAhead; __pred(*--__backTrack, __val); ) {
      if (--__remainder == 0)
        return (__lookAhead - __skipOffset); //Success
    }
 
    if (__remainder > __tailSize)
      return __last; //failure
 
    __lookAhead += __remainder;
    __tailSize -= __remainder;
 
    while ( __pred(*__lookAhead, __val) ) {
      __prevRemainder = __remainder;
      __backTrack = __lookAhead;
 
      do {
        if (--__remainder == 0)
          return (__lookAhead - __skipOffset); //Success
      } while (__pred(*--__backTrack, __val));
 
      //adjust remainder for next comparison
      __remainder += __pattSize - __prevRemainder;
 
      if (__remainder > __tailSize)
        return __last; //failure
 
      __lookAhead += __remainder;
      __tailSize -= __remainder;
    }
 
    //__lookAhead here is always pointing to the element of the last mismatch.
  }
 
  return __last; //failure
}

Referenced by search_n().

__set_difference()

template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter __set_difference	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result,
		_Compare	__comp
	)

Definition at line 1708 of file _algo.c.

                                                                    {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  while (__first1 != __last1 && __first2 != __last2)
    if (__comp(*__first1, *__first2)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      *__result = *__first1;
      ++__first1;
      ++__result;
    }
    else if (__comp(*__first2, *__first1))
      ++__first2;
    else {
      ++__first1;
      ++__first2;
    }
  return _STLP_STD::copy(__first1, __last1, __result);
}

Referenced by set_difference().

__set_intersection()

template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter __set_intersection	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result,
		_Compare	__comp
	)

Definition at line 1665 of file _algo.c.

                                                                      {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  while (__first1 != __last1 && __first2 != __last2)
    if (__comp(*__first1, *__first2)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      ++__first1;
    }
    else if (__comp(*__first2, *__first1))
      ++__first2;
    else {
      *__result = *__first1;
      ++__first1;
      ++__first2;
      ++__result;
    }
  return __result;
}

Referenced by set_intersection().

__set_symmetric_difference()

template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter __set_symmetric_difference	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result,
		_Compare	__comp
	)

Definition at line 1751 of file _algo.c.

                                                                  {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  while (__first1 != __last1 && __first2 != __last2) {
    if (__comp(*__first1, *__first2)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      *__result = *__first1;
      ++__first1;
      ++__result;
    }
    else if (__comp(*__first2, *__first1)) {
      *__result = *__first2;
      ++__first2;
      ++__result;
    }
    else {
      ++__first1;
      ++__first2;
    }
  }
  return _STLP_STD::copy(__first2, __last2, _STLP_STD::copy(__first1, __last1, __result));
}

Referenced by set_symmetric_difference().

__set_union()

template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE _OutputIter __set_union	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result,
		_Compare	__comp
	)

Definition at line 1617 of file _algo.c.

                                                               {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  while (__first1 != __last1 && __first2 != __last2) {
    if (__comp(*__first1, *__first2)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      *__result = *__first1;
      ++__first1;
    }
    else if (__comp(*__first2, *__first1)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      *__result = *__first2;
      ++__first2;
    }
    else {
      *__result = *__first1;
      ++__first1;
      ++__first2;
    }
    ++__result;
  }
  return _STLP_STD::copy(__first2, __last2, _STLP_STD::copy(__first1, __last1, __result));
}

Referenced by set_union().

__stable_partition_adaptive()

template<class _ForwardIter , class _Pointer , class _Predicate , class _Distance >

_ForwardIter __stable_partition_adaptive	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Predicate	__pred,
		_Distance	__len,
		_Pointer	__buffer,
		_Distance	__buffer_size,
		bool	__pred_of_first,
		bool	__pred_of_before_last
	)

Definition at line 768 of file _algo.c.

                                                                                           {
  if (__len <= __buffer_size) {
    _ForwardIter __result1 = __first;
    _Pointer __result2 = __buffer;
    if ((__first != __last) && (!__pred_of_first || __pred(*__first))) {
      *__result2 = *__first;
      ++__result2; ++__first; --__len;
    }
    for (; __first != __last ; ++__first, --__len) {
      if (((__len == 1) && (__pred_of_before_last || __pred(*__first))) ||
          ((__len != 1) && __pred(*__first))){
        *__result1 = *__first;
        ++__result1;
      }
      else {
        *__result2 = *__first;
        ++__result2;
      }
    }
    _STLP_STD::copy(__buffer, __result2, __result1);
    return __result1;
  }
  else {
    _ForwardIter __middle = __first;
    _Distance __half_len = __len / 2;
    _STLP_STD::advance(__middle, __half_len);
    return _STLP_PRIV __rotate(_STLP_PRIV __stable_partition_adaptive(__first, __middle, __pred,
                                                                      __half_len, __buffer, __buffer_size,
                                                                      __pred_of_first, false),
                               __middle,
                               _STLP_PRIV __stable_partition_adaptive(__middle, __last, __pred,
                                                                      __len - __half_len, __buffer, __buffer_size,
                                                                      true, __pred_of_before_last));
  }
}

Referenced by __stable_partition_adaptive(), and __stable_partition_aux_aux().

__stable_partition_aux() [1/2]

template<class _BidirectIter , class _Predicate >

_BidirectIter __stable_partition_aux	(	_BidirectIter	__first,
		_BidirectIter	__last,
		_Predicate	__pred,
		const bidirectional_iterator_tag &
	)

Definition at line 836 of file _algo.c.

                                                           {
  for (--__last;;) {
    if (__first == __last)
      return __first;
    else if (!__pred(*__last))
      --__last;
    else
      break;
  }
  ++__last;
  //Here we know that __pred(*--__last) is true
  return __stable_partition_aux_aux(__first, __last, __pred,
                                    _STLP_VALUE_TYPE(__first, _BidirectIter),
                                    _STLP_DISTANCE_TYPE(__first, _BidirectIter), true);
}

__stable_partition_aux() [2/2]

template<class _ForwardIter , class _Predicate >

_ForwardIter __stable_partition_aux	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Predicate	__pred,
		const forward_iterator_tag &
	)

Definition at line 827 of file _algo.c.

                                                     {
  return __stable_partition_aux_aux(__first, __last, __pred,
                                    _STLP_VALUE_TYPE(__first, _ForwardIter),
                                    _STLP_DISTANCE_TYPE(__first, _ForwardIter), false);
}

Referenced by stable_partition().

__stable_partition_aux_aux()

template<class _ForwardIter , class _Predicate , class _Tp , class _Distance >

_ForwardIter __stable_partition_aux_aux ( _ForwardIter  __first, _ForwardIter  __last, _Predicate  __pred, _Tp *  , _Distance *  , bool  __pred_of_before_last  )

inline

Definition at line 810 of file _algo.c.

                                                                                            {
  _Temporary_buffer<_ForwardIter, _Tp> __buf(__first, __last);
  _STLP_MPWFIX_TRY    //*TY 06/01/2000 - they forget to call dtor for _Temporary_buffer if no try/catch block is present
  return (__buf.size() > 0) ?
    __stable_partition_adaptive(__first, __last, __pred,
                                _Distance(__buf.requested_size()),
                                __buf.begin(), __buf.size(),
                                false, __pred_of_before_last)  :
    __inplace_stable_partition(__first, __last, __pred,
                               _Distance(__buf.requested_size()),
                               false, __pred_of_before_last);
  _STLP_MPWFIX_CATCH  //*TY 06/01/2000 - they forget to call dtor for _Temporary_buffer if no try/catch block is present
}

Referenced by __stable_partition_aux().

__stable_sort_adaptive()

template<class _RandomAccessIter , class _Pointer , class _Distance , class _Compare >

void __stable_sort_adaptive	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Pointer	__buffer,
		_Distance	__buffer_size,
		_Compare	__comp
	)

Definition at line 1159 of file _algo.c.

                                                                      {
  _Distance __len = (__last - __first + 1) / 2;
  _RandomAccessIter __middle = __first + __len;
  if (__len > __buffer_size) {
    __stable_sort_adaptive(__first, __middle, __buffer, __buffer_size,
                           __comp);
    __stable_sort_adaptive(__middle, __last, __buffer, __buffer_size,
                           __comp);
  }
  else {
    __merge_sort_with_buffer(__first, __middle, __buffer, (_Distance*)0,
                               __comp);
    __merge_sort_with_buffer(__middle, __last, __buffer, (_Distance*)0,
                               __comp);
  }
  __merge_adaptive(__first, __middle, __last, _Distance(__middle - __first),
                   _Distance(__last - __middle), __buffer, __buffer_size,
                   __comp);
}

Referenced by __stable_sort_adaptive(), and __stable_sort_aux().

__stable_sort_aux()

template<class _RandomAccessIter , class _Tp , class _Distance , class _Compare >

void __stable_sort_aux	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Tp *	,
		_Distance *	,
		_Compare	__comp
	)

Definition at line 1182 of file _algo.c.

                                        {
  _Temporary_buffer<_RandomAccessIter, _Tp> buf(__first, __last);
  if (buf.begin() == 0)
    __inplace_stable_sort(__first, __last, __comp);
  else
    __stable_sort_adaptive(__first, __last, buf.begin(),
                           _Distance(buf.size()),
                           __comp);
}

Referenced by stable_sort().

__unguarded_insertion_sort()

template<class _RandomAccessIter , class _Compare >

void __unguarded_insertion_sort ( _RandomAccessIter  __first, _RandomAccessIter  __last, _Compare  __comp  )

inline

Definition at line 952 of file _algo.c.

                                                        {
  __unguarded_insertion_sort_aux(__first, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter), __comp);
}

Referenced by __final_insertion_sort().

__unguarded_insertion_sort_aux()

template<class _RandomAccessIter , class _Tp , class _Compare >

void __unguarded_insertion_sort_aux	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Tp *	,
		_Compare	__comp
	)

Definition at line 944 of file _algo.c.

                                                           {
  for (_RandomAccessIter __i = __first; __i != __last; ++__i)
    __unguarded_linear_insert<_RandomAccessIter, _Tp, _Compare>(__i, *__i, __comp);
}

Referenced by __unguarded_insertion_sort().

__unguarded_linear_insert()

template<class _RandomAccessIter , class _Tp , class _Compare >

void __unguarded_linear_insert	(	_RandomAccessIter	__last,
		_Tp	__val,
		_Compare	__comp
	)

Definition at line 907 of file _algo.c.

                                                {
  _RandomAccessIter __next = __last;
  --__next;
  while (__comp(__val, *__next)) {
    _STLP_VERBOSE_ASSERT(!__comp(*__next, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
    *__last = *__next;
    __last = __next;
    --__next;
  }
  *__last = __val;
}

Referenced by __linear_insert().

__unguarded_partition()

template<class _RandomAccessIter , class _Tp , class _Compare >

_STLP_MOVE_TO_PRIV_NAMESPACE _RandomAccessIter __unguarded_partition	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Tp	__pivot,
		_Compare	__comp
	)

Definition at line 883 of file _algo.c.

                                                                      {
  for (;;) {
    while (__comp(*__first, __pivot)) {
      _STLP_VERBOSE_ASSERT(!__comp(__pivot, *__first), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      ++__first;
    }
    --__last;
    while (__comp(__pivot, *__last)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__last, __pivot), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      --__last;
    }
    if (!(__first < __last))
      return __first;
    iter_swap(__first, __last);
    ++__first;
  }
}

Referenced by __introsort_loop(), and __nth_element().

__unique_copy() [1/3]

template<class _InputIter , class _ForwardIter , class _BinaryPredicate >

_STLP_INLINE_LOOP _ForwardIter __unique_copy	(	_InputIter	__first,
		_InputIter	__last,
		_ForwardIter	__result,
		_BinaryPredicate	__binary_pred,
		const forward_iterator_tag &
	)

Definition at line 318 of file _algo.c.

                                                                            {
  *__result = *__first;
  while (++__first != __last)
    if (!__binary_pred(*__result, *__first)) *++__result = *__first;
  return ++__result;
}

__unique_copy() [2/3]

template<class _InputIter , class _OutputIter , class _BinaryPredicate >

_OutputIter __unique_copy ( _InputIter  __first, _InputIter  __last, _OutputIter  __result, _BinaryPredicate  __binary_pred, const output_iterator_tag &    )

inline

Definition at line 310 of file _algo.c.

                                                                           {
  return _STLP_PRIV __unique_copy(__first, __last, __result, __binary_pred,
                                  _STLP_VALUE_TYPE(__first, _InputIter));
}

__unique_copy() [3/3]

template<class _InputIterator , class _OutputIterator , class _BinaryPredicate , class _Tp >

_STLP_MOVE_TO_PRIV_NAMESPACE _STLP_INLINE_LOOP _OutputIterator __unique_copy	(	_InputIterator	__first,
		_InputIterator	__last,
		_OutputIterator	__result,
		_BinaryPredicate	__binary_pred,
		_Tp *
	)

Definition at line 295 of file _algo.c.

                                                    {
  _Tp __val = *__first;
  *__result = __val;
  while (++__first != __last)
    if (!__binary_pred(__val, *__first)) {
      __val = *__first;
      *++__result = __val;
    }
  return ++__result;
}

Referenced by __unique_copy(), and unique_copy().

__upper_bound()

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

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

Definition at line 1356 of file _algo.c.

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

Referenced by __equal_range(), and upper_bound().

find_end()

template<class _ForwardIter1 , class _ForwardIter2 >

_ForwardIter1 find_end	(	_ForwardIter1	__first1,
		_ForwardIter1	__last1,
		_ForwardIter2	__first2,
		_ForwardIter2	__last2
	)

Definition at line 273 of file _algo.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
                               _STLP_PRIV __equal_to(_STLP_VALUE_TYPE(__first1, _ForwardIter1))
    );
}

includes() [1/2]

template<class _InputIter1 , class _InputIter2 >

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

Definition at line 1607 of file _algo.c.

                                                         {
  return _STLP_PRIV __includes(__first1, __last1, __first2, __last2,
                               _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
}

includes() [2/2]

template<class _InputIter1 , class _InputIter2 , class _Compare >

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

Definition at line 1601 of file _algo.c.

                                                                          {
  return _STLP_PRIV __includes(__first1, __last1, __first2, __last2, __comp);
}

inplace_merge() [1/2]

template<class _BidirectionalIter >

_STLP_MOVE_TO_STD_NAMESPACE void inplace_merge	(	_BidirectionalIter	__first,
		_BidirectionalIter	__middle,
		_BidirectionalIter	__last
	)

Definition at line 1553 of file _algo.c.

                                              {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
  if (__first == __middle || __middle == __last)
    return;
  _STLP_PRIV __inplace_merge_aux(__first, __middle, __last,
                                 _STLP_VALUE_TYPE(__first, _BidirectionalIter), _STLP_DISTANCE_TYPE(__first, _BidirectionalIter),
                                 _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _BidirectionalIter)));
}

Referenced by InplaceTest::inplmrg1(), and InplaceTest::inplmrg2().

inplace_merge() [2/2]

template<class _BidirectionalIter , class _Compare >

void inplace_merge	(	_BidirectionalIter	__first,
		_BidirectionalIter	__middle,
		_BidirectionalIter	__last,
		_Compare	__comp
	)

Definition at line 1566 of file _algo.c.

                                                               {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
  if (__first == __middle || __middle == __last)
    return;
  _STLP_PRIV __inplace_merge_aux(__first, __middle, __last,
                                 _STLP_VALUE_TYPE(__first, _BidirectionalIter), _STLP_DISTANCE_TYPE(__first, _BidirectionalIter),
                                 __comp);
}

is_heap() [1/2]

template<class _RandomAccessIter >

_STLP_MOVE_TO_STD_NAMESPACE bool is_heap	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last
	)

Definition at line 1985 of file _algo.c.

                                                                  {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __is_heap(__first, _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)), __last - __first);
}

is_heap() [2/2]

template<class _RandomAccessIter , class _StrictWeakOrdering >

bool is_heap	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_StrictWeakOrdering	__comp
	)

Definition at line 1991 of file _algo.c.

                                         {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __is_heap(__first, __comp, __last - __first);
}

max_element() [1/2]

template<class _ForwardIter >

_ForwardIter max_element	(	_ForwardIter	__first,
		_ForwardIter	__last
	)

Definition at line 1800 of file _algo.c.

                                                                    {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last) return __first;
  _ForwardIter __result = __first;
  while (++__first != __last)
    if (*__result < *__first) {
      _STLP_VERBOSE_ASSERT(!(*__first < *__result), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      __result = __first;
    }
  return __result;
}

Referenced by valarray< _Tp >::max(), MaxTest::maxelem1(), and MaxTest::maxelem2().

max_element() [2/2]

template<class _ForwardIter , class _Compare >

_ForwardIter max_element	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Compare	__comp
	)

Definition at line 1813 of file _algo.c.

                                          {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last) return __first;
  _ForwardIter __result = __first;
  while (++__first != __last) {
    if (__comp(*__result, *__first)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first, *__result), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      __result = __first;
    }
  }
  return __result;
}

merge() [1/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter >

_STLP_MOVE_TO_STD_NAMESPACE _OutputIter merge	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result
	)

Definition at line 1419 of file _algo.c.

                                        {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  while (__first1 != __last1 && __first2 != __last2) {
    if (*__first2 < *__first1) {
      *__result = *__first2;
      ++__first2;
    }
    else {
      *__result = *__first1;
      ++__first1;
    }
    ++__result;
  }
  return _STLP_STD::copy(__first2, __last2, _STLP_STD::copy(__first1, __last1, __result));
}

Referenced by __merge_sort_loop(), create_diff_row_query(), ext4_ext_insert_extent(), gather_merge_data(), MergeTest::merge0(), MergeTest::merge1(), MergeTest::merge2(), MergeChmProperties(), MsiDatabaseMergeW(), nsChannel_SetResponseHeader(), parse_obj_node_param(), and test_IImageList_Merge().

merge() [2/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >

_OutputIter merge	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result,
		_Compare	__comp
	)

Definition at line 1440 of file _algo.c.

                                                         {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
  while (__first1 != __last1 && __first2 != __last2) {
    if (__comp(*__first2, *__first1)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      *__result = *__first2;
      ++__first2;
    }
    else {
      *__result = *__first1;
      ++__first1;
    }
    ++__result;
  }
  return _STLP_STD::copy(__first2, __last2, _STLP_STD::copy(__first1, __last1, __result));
}

min_element() [1/2]

template<class _ForwardIter >

_ForwardIter min_element	(	_ForwardIter	__first,
		_ForwardIter	__last
	)

Definition at line 1828 of file _algo.c.

                                                                    {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last) return __first;
  _ForwardIter __result = __first;
  while (++__first != __last)
    if (*__first < *__result) {
      _STLP_VERBOSE_ASSERT(!(*__result < *__first), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      __result = __first;
    }
  return __result;
}

Referenced by valarray< _Tp >::min(), MinTest::minelem1(), and MinTest::minelem2().

min_element() [2/2]

template<class _ForwardIter , class _Compare >

_ForwardIter min_element	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Compare	__comp
	)

Definition at line 1841 of file _algo.c.

                                          {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last) return __first;
  _ForwardIter __result = __first;
  while (++__first != __last) {
    if (__comp(*__first, *__result)) {
      _STLP_VERBOSE_ASSERT(!__comp(*__result, *__first), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
      __result = __first;
    }
  }
  return __result;
}

next_permutation() [1/2]

template<class _BidirectionalIter >

_STLP_MOVE_TO_STD_NAMESPACE bool next_permutation	(	_BidirectionalIter	__first,
		_BidirectionalIter	__last
	)

Definition at line 1896 of file _algo.c.

                                                                             {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __next_permutation(__first, __last,
                                       _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _BidirectionalIter)));
}

Referenced by PermTest::nextprm0(), PermTest::nextprm1(), and PermTest::nextprm2().

next_permutation() [2/2]

template<class _BidirectionalIter , class _Compare >

bool next_permutation	(	_BidirectionalIter	__first,
		_BidirectionalIter	__last,
		_Compare	__comp
	)

Definition at line 1903 of file _algo.c.

                                       {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __next_permutation(__first, __last, __comp);
}

nth_element() [1/2]

template<class _RandomAccessIter >

_STLP_MOVE_TO_STD_NAMESPACE void nth_element	(	_RandomAccessIter	__first,
		_RandomAccessIter	__nth,
		_RandomAccessIter	__last
	)

Definition at line 1335 of file _algo.c.

                                           {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __nth))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__nth, __last))
  _STLP_PRIV __nth_element(__first, __nth, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter),
                           _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
}

Referenced by NthElemTest::nthelem0(), NthElemTest::nthelem1(), and NthElemTest::nthelem2().

nth_element() [2/2]

template<class _RandomAccessIter , class _Compare >

void nth_element	(	_RandomAccessIter	__first,
		_RandomAccessIter	__nth,
		_RandomAccessIter	__last,
		_Compare	__comp
	)

Definition at line 1344 of file _algo.c.

                                                            {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __nth))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__nth, __last))
  _STLP_PRIV __nth_element(__first, __nth, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter), __comp);
}

partial_sort() [1/2]

template<class _RandomAccessIter >

_STLP_MOVE_TO_STD_NAMESPACE void partial_sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__middle,
		_RandomAccessIter	__last
	)

Definition at line 1236 of file _algo.c.

                                            {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
  _STLP_PRIV __partial_sort(__first, __middle, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter),
                            _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
}

Referenced by __introsort_loop(), PartialTest::parsrt0(), PartialTest::parsrt1(), and PartialTest::parsrt2().

partial_sort() [2/2]

template<class _RandomAccessIter , class _Compare >

void partial_sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__middle,
		_RandomAccessIter	__last,
		_Compare	__comp
	)

Definition at line 1245 of file _algo.c.

                                                             {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
  _STLP_PRIV __partial_sort(__first, __middle, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter), __comp);
}

partial_sort_copy() [1/2]

template<class _InputIter , class _RandomAccessIter >

_STLP_MOVE_TO_STD_NAMESPACE _RandomAccessIter partial_sort_copy	(	_InputIter	__first,
		_InputIter	__last,
		_RandomAccessIter	__result_first,
		_RandomAccessIter	__result_last
	)

Definition at line 1287 of file _algo.c.

                                                                                     {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__result_first, __result_last))
  return _STLP_PRIV __partial_sort_copy(__first, __last, __result_first, __result_last,
                                        _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _InputIter)),
                                        _STLP_DISTANCE_TYPE(__result_first, _RandomAccessIter),
                                        _STLP_VALUE_TYPE(__first, _InputIter));
}

Referenced by PartialTest::parsrtc0(), PartialTest::parsrtc1(), and PartialTest::parsrtc2().

partial_sort_copy() [2/2]

template<class _InputIter , class _RandomAccessIter , class _Compare >

_RandomAccessIter partial_sort_copy	(	_InputIter	__first,
		_InputIter	__last,
		_RandomAccessIter	__result_first,
		_RandomAccessIter	__result_last,
		_Compare	__comp
	)

Definition at line 1299 of file _algo.c.

                                                                    {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__result_first, __result_last))
  return _STLP_PRIV __partial_sort_copy(__first, __last, __result_first, __result_last,
                                        __comp,
                                        _STLP_DISTANCE_TYPE(__result_first, _RandomAccessIter),
                                        _STLP_VALUE_TYPE(__first, _InputIter));
}

partition()

template<class _ForwardIter , class _Predicate >

_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter partition	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Predicate	__pred
	)

Definition at line 738 of file _algo.c.

                                                                                       {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __partition(__first, __last, __pred, _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
}

prev_permutation() [1/2]

template<class _BidirectionalIter >

_STLP_MOVE_TO_STD_NAMESPACE bool prev_permutation	(	_BidirectionalIter	__first,
		_BidirectionalIter	__last
	)

Definition at line 1947 of file _algo.c.

                                                                             {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __prev_permutation(__first, __last,
                                       _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _BidirectionalIter)));
}

Referenced by PermTest::prevprm0(), PermTest::prevprm1(), and PermTest::prevprm2().

prev_permutation() [2/2]

template<class _BidirectionalIter , class _Compare >

bool prev_permutation	(	_BidirectionalIter	__first,
		_BidirectionalIter	__last,
		_Compare	__comp
	)

Definition at line 1954 of file _algo.c.

                                       {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  return _STLP_PRIV __prev_permutation(__first, __last, __comp);
}

random_sample() [1/2]

template<class _InputIter , class _RandomAccessIter >

_STLP_MOVE_TO_STD_NAMESPACE _RandomAccessIter random_sample	(	_InputIter	__first,
		_InputIter	__last,
		_RandomAccessIter	__out_first,
		_RandomAccessIter	__out_last
	)

Definition at line 650 of file _algo.c.

                                                                           {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__out_first, __out_last))
  return _STLP_PRIV __random_sample(__first, __last,
                                    __out_first, __out_last - __out_first);
}

random_sample() [2/2]

template<class _InputIter , class _RandomAccessIter , class _RandomNumberGenerator >

_RandomAccessIter random_sample	(	_InputIter	__first,
		_InputIter	__last,
		_RandomAccessIter	__out_first,
		_RandomAccessIter	__out_last,
		_RandomNumberGenerator &	__rand
	)

Definition at line 660 of file _algo.c.

                                              {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__out_first, __out_last))
  return _STLP_PRIV __random_sample(__first, __last,
                                    __out_first, __rand,
                                    __out_last - __out_first);
}

random_sample_n() [1/2]

template<class _ForwardIter , class _OutputIter , class _Distance >

_OutputIter random_sample_n	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_OutputIter	__out_ite,
		const _Distance	__n
	)

Definition at line 560 of file _algo.c.

                                                                        {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  _Distance __remaining = _STLP_STD::distance(__first, __last);
  _Distance __m = (min) (__n, __remaining);
 
  while (__m > 0) {
    if (_STLP_PRIV __random_number(__remaining) < __m) {
      *__out_ite = *__first;
      ++__out_ite;
      --__m;
    }
 
    --__remaining;
    ++__first;
  }
  return __out_ite;
}

random_sample_n() [2/2]

template<class _ForwardIter , class _OutputIter , class _Distance , class _RandomNumberGenerator >

_OutputIter random_sample_n	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_OutputIter	__out_ite,
		const _Distance	__n,
		_RandomNumberGenerator &	__rand
	)

Definition at line 582 of file _algo.c.

                                                            {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  _Distance __remaining = _STLP_STD::distance(__first, __last);
  _Distance __m = (min) (__n, __remaining);
 
  while (__m > 0) {
    if (__rand(__remaining) < __m) {
      *__out_ite = *__first;
      ++__out_ite;
      --__m;
    }
 
    --__remaining;
    ++__first;
  }
  return __out_ite;
}

random_shuffle() [1/2]

template<class _RandomAccessIter >

_STLP_MOVE_TO_STD_NAMESPACE void random_shuffle	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last
	)

Definition at line 540 of file _algo.c.

                                              {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last) return;
  for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
    iter_swap(__i, __first + _STLP_PRIV __random_number((__i - __first) + 1));
}

Referenced by RndShuffleTest::rndshuf0(), and RndShuffleTest::rndshuf2().

random_shuffle() [2/2]

template<class _RandomAccessIter , class _RandomNumberGenerator >

void random_shuffle	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_RandomNumberGenerator &	__rand
	)

Definition at line 549 of file _algo.c.

                                                    {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last) return;
  for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
    iter_swap(__i, __first + __rand((__i - __first) + 1));
}

rotate()

template<class _ForwardIter >

_STLP_MOVE_TO_STD_NAMESPACE void rotate	(	_ForwardIter	__first,
		_ForwardIter	__middle,
		_ForwardIter	__last
	)

Definition at line 519 of file _algo.c.

                                                                              {
  _STLP_PRIV __rotate(__first, __middle, __last);
}

Referenced by ft_stroke_border_arcto(), ft_stroker_arcto(), ft_stroker_cap(), FT_Stroker_ConicTo(), FT_Stroker_CubicTo(), ft_stroker_inside(), ft_stroker_outside(), GdipRotateMatrix(), RotateTest::rotate0(), RotateTest::rotate1(), and test_rotate().

search()

template<class _ForwardIter1 , class _ForwardIter2 >

_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter1 search	(	_ForwardIter1	__first1,
		_ForwardIter1	__last1,
		_ForwardIter2	__first2,
		_ForwardIter2	__last2
	)

Definition at line 112 of file _algo.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 )
    return find(__first1, __last1, *__first2);
 
  // General case.
 
  for ( ; ; ) { // __first1 != __last1 will be checked in find below
    __first1 = find(__first1, __last1, *__first2);
    if (__first1 == __last1)
      return __last1;
 
    _ForwardIter2 __p = __p1;
    _ForwardIter1 __current = __first1;
    if (++__current == __last1)
      return __last1;
 
    while (*__current == *__p) {
      if (++__p == __last2)
        return __first1;
      if (++__current == __last1)
        return __last1;
    }
 
    ++__first1;
  }
  return __first1;
}

search_n() [1/2]

template<class _ForwardIter , class _Integer , class _Tp >

_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter search_n	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Integer	__count,
		const _Tp &	__val
	)

Definition at line 246 of file _algo.c.

                                                          {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__count <= 0)
    return __first;
  if (__count == 1)
    //We use find when __count == 1 to use potential find overload.
    return find(__first, __last, __val);
  return _STLP_PRIV __search_n(__first, __last, __count, __val, equal_to<_Tp>(),
                               _STLP_DISTANCE_TYPE(__first, _ForwardIter),
                               _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
}

Referenced by AlgTest::search_n_test().

search_n() [2/2]

template<class _ForwardIter , class _Integer , class _Tp , class _BinaryPred >

_ForwardIter search_n	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Integer	__count,
		const _Tp &	__val,
		_BinaryPred	__binary_pred
	)

Definition at line 260 of file _algo.c.

                                                 {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__count <= 0)
    return __first;
  return _STLP_PRIV __search_n(__first, __last, __count, __val, __binary_pred,
                               _STLP_DISTANCE_TYPE(__first, _ForwardIter),
                               _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
}

set_difference() [1/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter >

_STLP_MOVE_TO_STD_NAMESPACE _OutputIter set_difference	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result
	)

Definition at line 1732 of file _algo.c.

                                                 {
  return _STLP_PRIV __set_difference(__first1, __last1, __first2, __last2, __result,
                                     _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
}

Referenced by SetDifferenceTest::setdiff0(), SetDifferenceTest::setdiff1(), and SetDifferenceTest::setdiff2().

set_difference() [2/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >

_OutputIter set_difference	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result,
		_Compare	__comp
	)

Definition at line 1741 of file _algo.c.

                                                                  {
  return _STLP_PRIV __set_difference(__first1, __last1, __first2, __last2, __result, __comp);
}

set_intersection() [1/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter >

_STLP_MOVE_TO_STD_NAMESPACE _OutputIter set_intersection	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result
	)

Definition at line 1689 of file _algo.c.

                                                   {
  return _STLP_PRIV __set_intersection(__first1, __last1, __first2, __last2, __result,
                                       _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
}

Referenced by SetIntersectionTest::setintr0(), SetIntersectionTest::setintr1(), and SetIntersectionTest::setintr2().

set_intersection() [2/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >

_OutputIter set_intersection	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result,
		_Compare	__comp
	)

Definition at line 1698 of file _algo.c.

                                                                    {
  return _STLP_PRIV __set_intersection(__first1, __last1, __first2, __last2, __result, __comp);
}

set_symmetric_difference() [1/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter >

_STLP_MOVE_TO_STD_NAMESPACE _OutputIter set_symmetric_difference	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result
	)

Definition at line 1780 of file _algo.c.

                                               {
  return _STLP_PRIV __set_symmetric_difference(__first1, __last1, __first2, __last2, __result,
                                               _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
}

Referenced by SetDifferenceTest::setsymd0(), SetDifferenceTest::setsymd1(), and SetDifferenceTest::setsymd2().

set_symmetric_difference() [2/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >

_OutputIter set_symmetric_difference	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result,
		_Compare	__comp
	)

Definition at line 1789 of file _algo.c.

                                          {
  return _STLP_PRIV __set_symmetric_difference(__first1, __last1, __first2, __last2, __result, __comp);
}

set_union() [1/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter >

_STLP_MOVE_TO_STD_NAMESPACE _OutputIter set_union	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result
	)

Definition at line 1646 of file _algo.c.

                                            {
  return _STLP_PRIV __set_union(__first1, __last1, __first2, __last2, __result,
                                _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
}

Referenced by SetUnionTest::setunon0(), SetUnionTest::setunon1(), and SetUnionTest::setunon2().

set_union() [2/2]

template<class _InputIter1 , class _InputIter2 , class _OutputIter , class _Compare >

_OutputIter set_union	(	_InputIter1	__first1,
		_InputIter1	__last1,
		_InputIter2	__first2,
		_InputIter2	__last2,
		_OutputIter	__result,
		_Compare	__comp
	)

Definition at line 1655 of file _algo.c.

                                                             {
  return _STLP_PRIV __set_union(__first1, __last1, __first2, __last2, __result, __comp);
}

sort() [1/2]

template<class _RandomAccessIter >

_STLP_MOVE_TO_STD_NAMESPACE void sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last
	)

Definition at line 993 of file _algo.c.

                                                               {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first != __last) {
    _STLP_PRIV __introsort_loop(__first, __last,
                                _STLP_VALUE_TYPE(__first, _RandomAccessIter),
                                _STLP_PRIV __lg(__last - __first) * 2,
                                _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
    _STLP_PRIV __final_insertion_sort(__first, __last,
                                      _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
  }
}

Referenced by _Function_class_(), BnegateTest::bnegate1(), BnegateTest::bnegate2(), LocaleTest::collate_by_name(), LocaleTest::collate_facet(), FindProgramDlg::CompareFunc(), FuncTest::func2(), FuncTest::func3(), CDefView::GetArrangeParam(), GreaterTest::greatereq(), GreaterTest::greatert(), IncludesTest::incl2(), LessTest::lesseqt(), LessTest::lesst(), ListView_SortEx(), BtrfsDeviceAdd::populate_device_tree(), psh_hint_table_activate_mask(), psh_hint_table_find_strong_points(), CDefView::Rearrange(), should_balance_chunk(), SortTest::sort1(), SortTest::sort2(), SortTest::sort3(), AlgTest::sort_test(), test_GetDefaultColumn(), test_ldap_parse_sort_control(), UnorderedTest::umap(), UnorderedTest::umultimap(), UnorderedTest::umultiset(), UnorderedTest::uset(), xsltComputeSortResult(), and xsltComputeSortResultInternal().

sort() [2/2]

template<class _RandomAccessIter , class _Compare >

void sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Compare	__comp
	)

Definition at line 1006 of file _algo.c.

                                                                                {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first != __last) {
    _STLP_PRIV __introsort_loop(__first, __last,
                                _STLP_VALUE_TYPE(__first, _RandomAccessIter),
                                _STLP_PRIV __lg(__last - __first) * 2, __comp);
    _STLP_PRIV __final_insertion_sort(__first, __last, __comp);
  }
}

stable_partition()

template<class _ForwardIter , class _Predicate >

_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter stable_partition	(	_ForwardIter	__first,
		_ForwardIter	__last,
		_Predicate	__pred
	)

Definition at line 866 of file _algo.c.

                                                                               {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  for (;;) {
    if (__first == __last)
      return __first;
    else if (__pred(*__first))
      ++__first;
    else
      break;
  }
  return _STLP_PRIV __stable_partition_aux(__first, __last, __pred,
                                           _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
}

Referenced by PartitionTest::stblptn0(), and PartitionTest::stblptn1().

stable_sort() [1/2]

template<class _RandomAccessIter >

_STLP_MOVE_TO_STD_NAMESPACE void stable_sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last
	)

Definition at line 1197 of file _algo.c.

                                           {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  _STLP_PRIV __stable_sort_aux(__first, __last,
                               _STLP_VALUE_TYPE(__first, _RandomAccessIter),
                               _STLP_DISTANCE_TYPE(__first, _RandomAccessIter),
                               _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
}

Referenced by SortTest::stblsrt1(), and SortTest::stblsrt2().

stable_sort() [2/2]

template<class _RandomAccessIter , class _Compare >

void stable_sort	(	_RandomAccessIter	__first,
		_RandomAccessIter	__last,
		_Compare	__comp
	)

Definition at line 1207 of file _algo.c.

                                                            {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  _STLP_PRIV __stable_sort_aux(__first, __last,
                               _STLP_VALUE_TYPE(__first, _RandomAccessIter),
                               _STLP_DISTANCE_TYPE(__first, _RandomAccessIter),
                               __comp);
}

unique_copy() [1/2]

template<class _InputIter , class _OutputIter >

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

Definition at line 348 of file _algo.c.

                                                                         {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last) return __result;
  return _STLP_PRIV __unique_copy(__first, __last, __result,
                                  _STLP_PRIV __equal_to(_STLP_VALUE_TYPE(__first, _InputIter)),
                                  _STLP_ITERATOR_CATEGORY(__result, _OutputIter));
}

Referenced by UniqueTest::uniqcpy1(), UniqueTest::uniqcpy2(), and unique().

unique_copy() [2/2]

template<class _InputIter , class _OutputIter , class _BinaryPredicate >

_OutputIter unique_copy	(	_InputIter	__first,
		_InputIter	__last,
		_OutputIter	__result,
		_BinaryPredicate	__binary_pred
	)

Definition at line 358 of file _algo.c.

                                            {
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
  if (__first == __last) return __result;
  return _STLP_PRIV __unique_copy(__first, __last, __result, __binary_pred,
                                  _STLP_ITERATOR_CATEGORY(__result, _OutputIter));
}

Variable Documentation

__stl_chunk_size

const int __stl_chunk_size = 7

Definition at line 1058 of file _algo.c.

Referenced by __merge_sort_with_buffer().