std Namespace Reference

The standard namespace. More...


Classes

struct  triple
 triple holds three objects of arbitrary type. More...

Enumerations

enum  { _M_p_chunk_size = 7 }
enum  { _M_p_threshold = 16 }

Functions

ostream & operator<< (ostream &s, const coco::interval_set &a)
ostream & operator<< (ostream &o, const coco::proj_rational &x)
template<class I >
ostream & operator<< (ostream &o, const coco::projective_interval< I > &a)
template<typename _TK , typename _Ve , typename _TC , typename _TA >
ostream & operator<< (ostream &o, const map< _TK, _Ve, _TC, _TA > &a)
template<typename _TK , typename _Ve , typename _TC , typename _TA >
ostream & operator<< (ostream &o, const multimap< _TK, _Ve, _TC, _TA > &a)
template<typename _Tp , int NN, int IND_OFFSET>
ostream & operator<< (ostream &o, const mtl::light1D< _Tp, NN, IND_OFFSET > &a)
template<typename _Tp >
ostream & operator<< (ostream &s, const linalg::matrix< _Tp > &A)
template<typename _Tp >
ostream & operator<< (ostream &s, const linalg::c_matrix< _Tp > &A)
template<typename _Ve , typename _TA >
ostream & operator<< (ostream &o, const vector< _Ve, _TA > &a)
template<typename _Ve , typename _TA >
ostream & operator<< (ostream &o, const list< _Ve, _TA > &a)
template<typename _Ve , typename _TA >
ostream & operator<< (ostream &o, const deque< _Ve, _TA > &a)
template<typename _Tp >
ostream & operator<< (ostream &s, const linalg::sparse_vector< _Tp > &a)
template<typename _Ve , typename _TC , typename _TA >
ostream & operator<< (ostream &o, const set< _Ve, _TC, _TA > &a)
template<typename _Ve , typename _TC , typename _TA >
ostream & operator<< (ostream &o, const multiset< _Ve, _TC, _TA > &a)
template<typename _TA , typename _TB >
ostream & operator<< (ostream &o, const pair< _TA, _TB > &a)
template<typename _TA , typename _TB , typename _TC >
ostream & operator<< (ostream &o, const triple< _TA, _TB, _TC > &a)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Tp >
pair< _RandomAccessIter,
_RandomAccessIterp > 		__unguarded_p_partition (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Tp __pivot)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Tp , typename _Compare >
pair< _RandomAccessIter,
_RandomAccessIterp > 		__unguarded_p_partition (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Tp __pivot, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Tp , typename _Tpp >
void __unguarded_linear_p_insert (_RandomAccessIter __last1, _Tp __val1, _RandomAccessIterp __last2, _Tpp __val2)
template<typename _RandomAccessIter , typename _Tp , typename _RandomAccessIterp , typename _Tpp , typename _Compare >
void __unguarded_linear_p_insert (_RandomAccessIter __last1, _Tp __val1, _RandomAccessIterp __last2, _Tpp __val2, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
void __insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void __insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
void __unguarded_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void __unguarded_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
void __final_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void __final_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Size >
void __intro_p_sort_loop (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Size __depth_limit)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Size , typename _Compare >
void __intro_p_sort_loop (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Size __depth_limit, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Size >
void __introsort_p_loop (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Size __depth_limit)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Size , typename _Compare >
void __introsort_p_loop (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Size __depth_limit, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
bool pair_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
 Sort the elements of two sequences in common.
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
bool pair_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
 Sort the elements of a sequence using a predicate for comparison.
template<typename _BidirectionalIter , typename _BidirectionalIterp , typename _Distance >
void __merge_p_without_buffer (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _BidirectionalIterp __firstp, _BidirectionalIterp __middlep, _BidirectionalIterp __lastp, _Distance __len1, _Distance __len2)
template<typename _BidirectionalIter , typename _BidirectionalIterp , typename _Distance , typename _Compare >
void __merge_p_without_buffer (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _BidirectionalIterp __firstp, _BidirectionalIterp __middlep, _BidirectionalIterp __lastp, _Distance __len1, _Distance __len2, _Compare __comp)
template<typename _BidirectionalIter , typename _BidirectionalIterp , typename _Distance , typename _Pointer , typename _Pointerp >
void __p_merge_adaptive (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _BidirectionalIterp __firstp, _BidirectionalIterp __middlep, _BidirectionalIterp __lastp, _Distance __len1, _Distance __len2, _Pointer __buffer, _Pointerp __bufferp, _Distance __buffer_size)
template<typename _BidirectionalIter , typename _BidirectionalIterp , typename _Distance , typename _Pointer , typename _Pointerp , typename _Compare >
void __p_merge_adaptive (_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _BidirectionalIterp __firstp, _BidirectionalIterp __middlep, _BidirectionalIterp __lastp, _Distance __len1, _Distance __len2, _Pointer __buffer, _Pointerp __bufferp, _Distance __buffer_size, _Compare __comp)
template<typename _InputIter1 , typename _InputIter2 , typename _OutputIter , typename _InputIter1p , typename _InputIter2p , typename _OutputIterp >
pair< _OutputIter, _OutputIterp > pair_merge (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _InputIter1p __first1p, _InputIter1p __last1p, _InputIter2p __first2p, _InputIter2p __last2p, _OutputIterp __resultp)
 Merges two sorted ranges.
template<typename _InputIter1 , typename _InputIter2 , typename _OutputIter , typename _InputIter1p , typename _InputIter2p , typename _OutputIterp , typename _Compare >
pair< _OutputIter, _OutputIterp > pair_merge (_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _InputIter1p __first1p, _InputIter1p __last1p, _InputIter2p __first2p, _InputIter2p __last2p, _OutputIterp __resultp, _Compare __comp)
 Merges two sorted ranges.
template<typename _BidirectionalIter1 , typename _BidirectionalIter2 , typename _BidirectionalIter3 , typename _BidirectionalIter1p , typename _BidirectionalIter2p , typename _BidirectionalIter3p >
pair< _BidirectionalIter3,
_BidirectionalIter3p > 		__p_merge_backward (_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result, _BidirectionalIter1p __first1p, _BidirectionalIter1p __last1p, _BidirectionalIter2p __first2p, _BidirectionalIter2p __last2p, _BidirectionalIter3p __resultp)
template<typename _BidirectionalIter1 , typename _BidirectionalIter2 , typename _BidirectionalIter3 , typename _BidirectionalIter1p , typename _BidirectionalIter2p , typename _BidirectionalIter3p , typename _Compare >
pair< _BidirectionalIter3,
_BidirectionalIter3p > 		__p_merge_backward (_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result, _BidirectionalIter1p __first1p, _BidirectionalIter1p __last1p, _BidirectionalIter2p __first2p, _BidirectionalIter2p __last2p, _BidirectionalIter3p __resultp, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
void __inplace_stable_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void __inplace_stable_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
template<typename _RandomAccessIter1 , typename _RandomAccessIter2 , typename _RandomAccessIter1p , typename _RandomAccessIter2p , typename _Distance >
void __merge_p_sort_loop (_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _RandomAccessIter1p __firstp, _RandomAccessIter1p __lastp, _RandomAccessIter2p __resultp, _Distance __step_size)
template<typename _RandomAccessIter1 , typename _RandomAccessIter2 , typename _RandomAccessIter1p , typename _RandomAccessIter2p , typename _Distance , typename _Compare >
void __merge_p_sort_loop (_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _RandomAccessIter1p __firstp, _RandomAccessIter1p __lastp, _RandomAccessIter2p __resultp, _Distance __step_size, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Distance >
void __chunk_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Distance __chunk_size)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Distance , typename _Compare >
void __chunk_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Distance __chunk_size, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Pointer , typename _Pointerp >
void __merge_p_sort_with_buffer (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Pointerp __bufferp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Pointer , typename _Pointerp , typename _Compare >
void __merge_p_sort_with_buffer (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Pointerp __bufferp, _Compare __comp)
template<typename _RandomAccessIter , typename _Pointer , typename _RandomAccessIterp , typename _Pointerp , typename _Distance >
void __stable_p_sort_adaptive (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Pointerp __bufferp, _Distance __buffer_size)
template<typename _RandomAccessIter , typename _Pointer , typename _RandomAccessIterp , typename _Pointerp , typename _Distance , typename _Compare >
void __stable_p_sort_adaptive (_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Pointerp __bufferp, _Distance __buffer_size, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
bool stable_pair_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
 Sort the elements of a pair of sequences, preserving the relative order of equivalent elements.
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
bool stable_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
 Sort the elements of a pair of sequences using a predicate for comparison, preserving the relative order of equivalent elements.
template<typename _RandomAccessIter , typename _RandomAccessIterp >
bool partial_pair_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
 Sort the smallest elements of a pair of sequences.
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
bool partial_pair_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
 Sort the smallest elements of a pair of sequences.
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
bool partial_sort (_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _RandomAccessIter __firstp, _RandomAccessIter __lastp, _Compare __comp)
 Sort the smallest elements of a pair of sequences using a predicate for comparison.
template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _RandomAccessIteratorp , typename _Distancep , typename _Tpp >
void __push_pair_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _RandomAccessIteratorp __firstp, _Distancep __holeIndexp, _Distancep __topIndexp, _Tpp __valuep)
template<typename _RandomAccessIterator , typename _RandomAccessIteratorp >
void push_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp)
template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _RandomAccessIteratorp , typename _Distancep , typename _Tpp , typename _Compare >
void __push_pair_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _RandomAccessIteratorp __firstp, _Distancep __holeIndexp, _Distancep __topIndexp, _Tpp __valuep, _Compare __comp)
template<typename _RandomAccessIterator , typename _RandomAccessIteratorp , typename _Compare >
void push_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp, _Compare __comp)
template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _RandomAccessIteratorp , typename _Distancep , typename _Tpp >
void __adjust_pair_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _RandomAccessIteratorp __firstp, _Distancep __holeIndexp, _Distancep __lenp, _Tpp __valuep)
template<typename _RandomAccessIterator , typename _Tp , typename _RandomAccessIteratorp , typename _Tpp >
void __pop_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp, _RandomAccessIteratorp __resultp, _Tpp __valuep)
template<typename _RandomAccessIterator , typename _RandomAccessIteratorp >
void pop_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp)
template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _RandomAccessIteratorp , typename _Distancep , typename _Tpp , typename _Compare >
void __adjust_pair_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _RandomAccessIteratorp __firstp, _Distancep __holeIndexp, _Distancep __lenp, _Tpp __valuep, _Compare __comp)
template<typename _RandomAccessIterator , typename _Tp , typename _RandomAccessIteratorp , typename _Tpp , typename _Compare >
void __pop_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp, _RandomAccessIteratorp __resultp, _Tpp __valuep, _Compare __comp)
template<typename _RandomAccessIterator , typename _RandomAccessIteratorp , typename _Compare >
void pop_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp, _Compare __comp)
template<typename _RandomAccessIterator , typename _RandomAccessIteratorp >
void make_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp)
template<typename _RandomAccessIterator , typename _RandomAccessIteratorp , typename _Compare >
void make_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp, _Compare __comp)
template<typename _RandomAccessIterator , typename _RandomAccessIteratorp >
void sort_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp)
template<typename _RandomAccessIterator , typename _RandomAccessIteratorp , typename _Compare >
void sort_pair_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIteratorp __firstp, _RandomAccessIteratorp __lastp, _Compare __comp)
template<class _T1 , class _T2 , class _T3 >
bool operator== (const triple< _T1, _T2, _T3 > &__x, const triple< _T1, _T2, _T3 > &__y)
 Two triples of the same type are equal iff their members are equal.
template<class _T1 , class _T2 , class _T3 >
bool operator< (const triple< _T1, _T2, _T3 > &__x, const triple< _T1, _T2, _T3 > &__y)
 This is lexicographic ordering of triples.
template<class _T1 , class _T2 , class _T3 >
bool operator!= (const triple< _T1, _T2, _T3 > &__x, const triple< _T1, _T2, _T3 > &__y)
 Uses operator== to find the result.
template<class _T1 , class _T2 , class _T3 >
bool operator> (const triple< _T1, _T2, _T3 > &__x, const triple< _T1, _T2, _T3 > &__y)
 Uses operator< to find the result.
template<class _T1 , class _T2 , class _T3 >
bool operator<= (const triple< _T1, _T2, _T3 > &__x, const triple< _T1, _T2, _T3 > &__y)
 Uses operator< to find the result.
template<class _T1 , class _T2 , class _T3 >
bool operator>= (const triple< _T1, _T2, _T3 > &__x, const triple< _T1, _T2, _T3 > &__y)
 Uses operator< to find the result.
template<class _T1 , class _T2 , class _T3 >
triple< _T1, _T2, _T3 > make_triple (const _T1 &__x, const _T2 &__y, const _T3 &__z)
 A convenience wrapper for creating a triple from three objects.

Detailed Description

This is the standard namespace of the C++ library.

Enumeration Type Documentation

anonymous enum

Enumerator:
_M_p_chunk_size 

Definition at line 55 of file stlp_addalgo.h.

anonymous enum

Enumerator:
_M_p_threshold 

Definition at line 56 of file stlp_addalgo.h.

Function Documentation

template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _RandomAccessIteratorp , typename _Distancep , typename _Tpp , typename _Compare >
void std::__adjust_pair_heap ( _RandomAccessIterator  __first,
_Distance  __holeIndex,
_Distance  __len,
_Tp  __value,
_RandomAccessIteratorp  __firstp,
_Distancep  __holeIndexp,
_Distancep  __lenp,
_Tpp  __valuep,
_Compare  __comp 
) [inline]

Definition at line 230 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _RandomAccessIteratorp , typename _Distancep , typename _Tpp >
void std::__adjust_pair_heap ( _RandomAccessIterator  __first,
_Distance  __holeIndex,
_Distance  __len,
_Tp  __value,
_RandomAccessIteratorp  __firstp,
_Distancep  __holeIndexp,
_Distancep  __lenp,
_Tpp  __valuep 
) [inline]

Definition at line 155 of file stlp_pairheap.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Distance , typename _Compare >
void std::__chunk_insertion_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Distance  __chunk_size,
_Compare  __comp 
) [inline]

Definition at line 1187 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Distance >
void std::__chunk_insertion_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Distance  __chunk_size 
) [inline]

Definition at line 1171 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void std::__final_insertion_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Compare  __comp 
) [inline]

Definition at line 311 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp >
void std::__final_insertion_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp 
) [inline]

Definition at line 289 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void std::__inplace_stable_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Compare  __comp 
) [inline]

Definition at line 1087 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp >
void std::__inplace_stable_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp 
) [inline]

Definition at line 1062 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void std::__insertion_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Compare  __comp 
) [inline]

Definition at line 216 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp >
void std::__insertion_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp 
) [inline]

Definition at line 186 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Size , typename _Compare >
void std::__intro_p_sort_loop ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Size  __depth_limit,
_Compare  __comp 
) [inline]

Definition at line 365 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Size >
void std::__intro_p_sort_loop ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Size  __depth_limit 
) [inline]

Definition at line 333 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Size , typename _Compare >
void std::__introsort_p_loop ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Size  __depth_limit,
_Compare  __comp 
) [inline]

Definition at line 428 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Size >
void std::__introsort_p_loop ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Size  __depth_limit 
) [inline]

This is a helper function for the pair_sort routine.

Definition at line 396 of file stlp_addalgo.h.

template<typename _RandomAccessIter1 , typename _RandomAccessIter2 , typename _RandomAccessIter1p , typename _RandomAccessIter2p , typename _Distance , typename _Compare >
void std::__merge_p_sort_loop ( _RandomAccessIter1  __first,
_RandomAccessIter1  __last,
_RandomAccessIter2  __result,
_RandomAccessIter1p  __firstp,
_RandomAccessIter1p  __lastp,
_RandomAccessIter2p  __resultp,
_Distance  __step_size,
_Compare  __comp 
) [inline]

Definition at line 1140 of file stlp_addalgo.h.

template<typename _RandomAccessIter1 , typename _RandomAccessIter2 , typename _RandomAccessIter1p , typename _RandomAccessIter2p , typename _Distance >
void std::__merge_p_sort_loop ( _RandomAccessIter1  __first,
_RandomAccessIter1  __last,
_RandomAccessIter2  __result,
_RandomAccessIter1p  __firstp,
_RandomAccessIter1p  __lastp,
_RandomAccessIter2p  __resultp,
_Distance  __step_size 
) [inline]

Definition at line 1110 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Pointer , typename _Pointerp , typename _Compare >
void std::__merge_p_sort_with_buffer ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_Pointer  __buffer,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Pointerp  __bufferp,
_Compare  __comp 
) [inline]

Definition at line 1232 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Pointer , typename _Pointerp >
void std::__merge_p_sort_with_buffer ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_Pointer  __buffer,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Pointerp  __bufferp 
) [inline]

Definition at line 1203 of file stlp_addalgo.h.

template<typename _BidirectionalIter , typename _BidirectionalIterp , typename _Distance , typename _Compare >
void std::__merge_p_without_buffer ( _BidirectionalIter  __first,
_BidirectionalIter  __middle,
_BidirectionalIter  __last,
_BidirectionalIterp  __firstp,
_BidirectionalIterp  __middlep,
_BidirectionalIterp  __lastp,
_Distance  __len1,
_Distance  __len2,
_Compare  __comp 
) [inline]

Definition at line 617 of file stlp_addalgo.h.

template<typename _BidirectionalIter , typename _BidirectionalIterp , typename _Distance >
void std::__merge_p_without_buffer ( _BidirectionalIter  __first,
_BidirectionalIter  __middle,
_BidirectionalIter  __last,
_BidirectionalIterp  __firstp,
_BidirectionalIterp  __middlep,
_BidirectionalIterp  __lastp,
_Distance  __len1,
_Distance  __len2 
) [inline]

Definition at line 555 of file stlp_addalgo.h.

template<typename _BidirectionalIter , typename _BidirectionalIterp , typename _Distance , typename _Pointer , typename _Pointerp , typename _Compare >
void std::__p_merge_adaptive ( _BidirectionalIter  __first,
_BidirectionalIter  __middle,
_BidirectionalIter  __last,
_BidirectionalIterp  __firstp,
_BidirectionalIterp  __middlep,
_BidirectionalIterp  __lastp,
_Distance  __len1,
_Distance  __len2,
_Pointer  __buffer,
_Pointerp  __bufferp,
_Distance  __buffer_size,
_Compare  __comp 
) [inline]

Definition at line 751 of file stlp_addalgo.h.

template<typename _BidirectionalIter , typename _BidirectionalIterp , typename _Distance , typename _Pointer , typename _Pointerp >
void std::__p_merge_adaptive ( _BidirectionalIter  __first,
_BidirectionalIter  __middle,
_BidirectionalIter  __last,
_BidirectionalIterp  __firstp,
_BidirectionalIterp  __middlep,
_BidirectionalIterp  __lastp,
_Distance  __len1,
_Distance  __len2,
_Pointer  __buffer,
_Pointerp  __bufferp,
_Distance  __buffer_size 
) [inline]

Definition at line 679 of file stlp_addalgo.h.

template<typename _BidirectionalIter1 , typename _BidirectionalIter2 , typename _BidirectionalIter3 , typename _BidirectionalIter1p , typename _BidirectionalIter2p , typename _BidirectionalIter3p , typename _Compare >
pair<_BidirectionalIter3,_BidirectionalIter3p> std::__p_merge_backward ( _BidirectionalIter1  __first1,
_BidirectionalIter1  __last1,
_BidirectionalIter2  __first2,
_BidirectionalIter2  __last2,
_BidirectionalIter3  __result,
_BidirectionalIter1p  __first1p,
_BidirectionalIter1p  __last1p,
_BidirectionalIter2p  __first2p,
_BidirectionalIter2p  __last2p,
_BidirectionalIter3p  __resultp,
_Compare  __comp 
) [inline]

Definition at line 1015 of file stlp_addalgo.h.

template<typename _BidirectionalIter1 , typename _BidirectionalIter2 , typename _BidirectionalIter3 , typename _BidirectionalIter1p , typename _BidirectionalIter2p , typename _BidirectionalIter3p >
pair<_BidirectionalIter3,_BidirectionalIter3p> std::__p_merge_backward ( _BidirectionalIter1  __first1,
_BidirectionalIter1  __last1,
_BidirectionalIter2  __first2,
_BidirectionalIter2  __last2,
_BidirectionalIter3  __result,
_BidirectionalIter1p  __first1p,
_BidirectionalIter1p  __last1p,
_BidirectionalIter2p  __first2p,
_BidirectionalIter2p  __last2p,
_BidirectionalIter3p  __resultp 
) [inline]

Definition at line 966 of file stlp_addalgo.h.

template<typename _RandomAccessIterator , typename _Tp , typename _RandomAccessIteratorp , typename _Tpp , typename _Compare >
void std::__pop_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIterator  __result,
_Tp  __value,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp,
_RandomAccessIteratorp  __resultp,
_Tpp  __valuep,
_Compare  __comp 
) [inline]

Definition at line 265 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _Tp , typename _RandomAccessIteratorp , typename _Tpp >
void std::__pop_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIterator  __result,
_Tp  __value,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp,
_RandomAccessIteratorp  __resultp,
_Tpp  __valuep 
) [inline]

Definition at line 190 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _RandomAccessIteratorp , typename _Distancep , typename _Tpp , typename _Compare >
void std::__push_pair_heap ( _RandomAccessIterator  __first,
_Distance  __holeIndex,
_Distance  __topIndex,
_Tp  __value,
_RandomAccessIteratorp  __firstp,
_Distancep  __holeIndexp,
_Distancep  __topIndexp,
_Tpp  __valuep,
_Compare  __comp 
) [inline]

Definition at line 105 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _RandomAccessIteratorp , typename _Distancep , typename _Tpp >
void std::__push_pair_heap ( _RandomAccessIterator  __first,
_Distance  __holeIndex,
_Distance  __topIndex,
_Tp  __value,
_RandomAccessIteratorp  __firstp,
_Distancep  __holeIndexp,
_Distancep  __topIndexp,
_Tpp  __valuep 
) [inline]

Definition at line 53 of file stlp_pairheap.h.

template<typename _RandomAccessIter , typename _Pointer , typename _RandomAccessIterp , typename _Pointerp , typename _Distance , typename _Compare >
void std::__stable_p_sort_adaptive ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_Pointer  __buffer,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Pointerp  __bufferp,
_Distance  __buffer_size,
_Compare  __comp 
) [inline]

Definition at line 1291 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _Pointer , typename _RandomAccessIterp , typename _Pointerp , typename _Distance >
void std::__stable_p_sort_adaptive ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_Pointer  __buffer,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Pointerp  __bufferp,
_Distance  __buffer_size 
) [inline]

Definition at line 1262 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void std::__unguarded_insertion_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Compare  __comp 
) [inline]

Definition at line 268 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp >
void std::__unguarded_insertion_p_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp 
) [inline]

Definition at line 246 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _Tp , typename _RandomAccessIterp , typename _Tpp , typename _Compare >
void std::__unguarded_linear_p_insert ( _RandomAccessIter  __last1,
_Tp  __val1,
_RandomAccessIterp  __last2,
_Tpp  __val2,
_Compare  __comp 
) [inline]

Definition at line 160 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Tp , typename _Tpp >
void std::__unguarded_linear_p_insert ( _RandomAccessIter  __last1,
_Tp  __val1,
_RandomAccessIterp  __last2,
_Tpp  __val2 
) [inline]

Definition at line 133 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Tp , typename _Compare >
pair<_RandomAccessIter, _RandomAccessIterp> std::__unguarded_p_partition ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Tp  __pivot,
_Compare  __comp 
) [inline]

Definition at line 99 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Tp >
pair<_RandomAccessIter, _RandomAccessIterp> std::__unguarded_p_partition ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Tp  __pivot 
) [inline]

Definition at line 65 of file stlp_addalgo.h.

template<typename _RandomAccessIterator , typename _RandomAccessIteratorp , typename _Compare >
void std::make_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp,
_Compare  __comp 
) [inline]

Definition at line 343 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _RandomAccessIteratorp >
void std::make_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp 
) [inline]

Definition at line 303 of file stlp_pairheap.h.

template<class _T1 , class _T2 , class _T3 >
triple<_T1, _T2, _T3> std::make_triple ( const _T1 &  __x,
const _T2 &  __y,
const _T3 &  __z 
) [inline]

Parameters:
x The first object.
y The second object.
z The third object.
Returns:
A newly-constructed triple<> object of the appropriate type.

Definition at line 141 of file stlp_triple.h.

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

Definition at line 103 of file stlp_triple.h.

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

Definition at line 92 of file stlp_triple.h.

template<class I >
ostream& std::operator<< ( ostream &  o,
const coco::projective_interval< I > &  a 
) [inline]

Definition at line 189 of file prointerval.hpp.

ostream& std::operator<< ( ostream &  o,
const coco::proj_rational &  x 
)

Definition at line 180 of file prointerval.hpp.

ostream & std::operator<< ( ostream &  s,
const coco::interval_set &  a 
)

Definition at line 601 of file interval_set.cc.

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

Definition at line 117 of file stlp_triple.h.

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

Definition at line 83 of file stlp_triple.h.

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

Definition at line 110 of file stlp_triple.h.

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

Definition at line 124 of file stlp_triple.h.

template<typename _InputIter1 , typename _InputIter2 , typename _OutputIter , typename _InputIter1p , typename _InputIter2p , typename _OutputIterp , typename _Compare >
pair<_OutputIter,_OutputIterp> std::pair_merge ( _InputIter1  __first1,
_InputIter1  __last1,
_InputIter2  __first2,
_InputIter2  __last2,
_OutputIter  __result,
_InputIter1p  __first1p,
_InputIter1p  __last1p,
_InputIter2p  __first2p,
_InputIter2p  __last2p,
_OutputIterp  __resultp,
_Compare  __comp 
) [inline]

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

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

Definition at line 907 of file stlp_addalgo.h.

template<typename _InputIter1 , typename _InputIter2 , typename _OutputIter , typename _InputIter1p , typename _InputIter2p , typename _OutputIterp >
pair<_OutputIter,_OutputIterp> std::pair_merge ( _InputIter1  __first1,
_InputIter1  __last1,
_InputIter2  __first2,
_InputIter2  __last2,
_OutputIter  __result,
_InputIter1p  __first1p,
_InputIter1p  __last1p,
_InputIter2p  __first2p,
_InputIter2p  __last2p,
_OutputIterp  __resultp 
) [inline]

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

Definition at line 834 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
bool std::pair_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Compare  __comp 
) [inline]

Parameters:
first An iterator.
last Another iterator.
firstp Yet Another iterator.
lastp Yet Another Another iterator.
comp A comparison functor.
Returns:
true if the two ranges had the same length (i.e. sorting worked)
Sorts the elements in the range [first,last) in ascending order, such that comp(*(i+1),*i) is false for every iterator i in the range [first,last-1).

The relative ordering of equivalent elements is not preserved, use stable_pair_sort() if this is needed.

The order of the elements in the range [firstp, lastp) is changed in parallel to the changes made in the range [first, last). So elements in the two sequences which had the same index before the pair_sort will have the same index after the pair_sort.

Definition at line 523 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp >
bool std::pair_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp 
) [inline]

Parameters:
first An iterator.
last Another iterator.
firstp Yet Another iterator.
lastp Yet Another Another iterator.
Returns:
true if the two ranges had the same length (i.e. sorting worked)
Sorts the elements in the range [first,last) in ascending order, such that *(i+1)<*i is false for each iterator i in the range [first,last-1).

The relative ordering of equivalent elements is not preserved, use stable_pair_sort() if this is needed.

The order of the elements in the range [firstp, lastp) is changed in parallel to the changes made in the range [first, last). So elements in the two sequences which had the same index before the pair_sort will have the same index after the pair_sort.

Definition at line 475 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
bool std::partial_pair_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __middle,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Compare  __comp 
) [inline]

Parameters:
first An iterator.
middle Another iterator.
last Another iterator.
firstp Yet Another iterator.
lastp Yet Another Another iterator.
Returns:
true if the two ranges had the same length (i.e. sorting worked)
Sorts the smallest (middle-first) elements in the range [first,last) and moves them to the range [first,middle). The order of the remaining elements in the range [middle,last) is undefined. After the sort if i and are iterators in the range [first,middle) such that precedes and is an iterator in the range [middle,last) then *j<*i and *k<*i are both false.

The order of the elements in the range [firstp, lastp) is changed in parallel to the changes made in the range [first, last). So elements in the two sequences which had the same index before the sort will have the same index after the sort.

Definition at line 1507 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp >
bool std::partial_pair_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __middle,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp 
) [inline]

Parameters:
first An iterator.
middle Another iterator.
last Another iterator.
firstp Yet Another iterator.
lastp Yet Another Another iterator.
Returns:
true if the two ranges had the same length (i.e. sorting worked)
Sorts the smallest (middle-first) elements in the range [first,last) and moves them to the range [first,middle). The order of the remaining elements in the range [middle,last) is undefined. After the sort if i and are iterators in the range [first,middle) such that precedes and is an iterator in the range [middle,last) then *j<*i and *k<*i are both false.

The order of the elements in the range [firstp, lastp) is changed in parallel to the changes made in the range [first, last). So elements in the two sequences which had the same index before the sort will have the same index after the sort.

Definition at line 1449 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
bool std::partial_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __middle,
_RandomAccessIter  __last,
_RandomAccessIter  __firstp,
_RandomAccessIter  __lastp,
_Compare  __comp 
) [inline]

Parameters:
first An iterator.
middle Another iterator.
last Another iterator.
firstp Yet Another iterator.
lastp Yet Another Another iterator.
comp A comparison functor.
Returns:
true if the two ranges had the same length (i.e. sorting worked)
Sorts the smallest (middle-first) elements in the range [first,last) and moves them to the range [first,middle). The order of the remaining elements in the range [middle,last) is undefined. After the sort if i and are iterators in the range [first,middle) such that precedes and is an iterator in the range [middle,last) then *comp(j,*i) and comp(*k,*i) are both false.

The order of the elements in the range [firstp, lastp) is changed in parallel to the changes made in the range [first, last). So elements in the two sequences which had the same index before the sort will have the same index after the sort.

Definition at line 1570 of file stlp_addalgo.h.

template<typename _RandomAccessIterator , typename _RandomAccessIteratorp , typename _Compare >
void std::pop_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp,
_Compare  __comp 
) [inline]

Definition at line 282 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _RandomAccessIteratorp >
void std::pop_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp 
) [inline]

Definition at line 206 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _RandomAccessIteratorp , typename _Compare >
void std::push_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp,
_Compare  __comp 
) [inline]

Definition at line 127 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _RandomAccessIteratorp >
void std::push_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp 
) [inline]

Definition at line 74 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _RandomAccessIteratorp , typename _Compare >
void std::sort_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp,
_Compare  __comp 
) [inline]

Definition at line 403 of file stlp_pairheap.h.

template<typename _RandomAccessIterator , typename _RandomAccessIteratorp >
void std::sort_pair_heap ( _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_RandomAccessIteratorp  __firstp,
_RandomAccessIteratorp  __lastp 
) [inline]

Definition at line 383 of file stlp_pairheap.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp >
bool std::stable_pair_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp 
) [inline]

Parameters:
first An iterator.
last Another iterator.
firstp Yet Another iterator.
lastp Yet Another Another iterator.
Returns:
true if the two ranges had the same length (i.e. sorting worked)
Sorts the elements in the range [first,last) in ascending order, such that *(i+1)<*i is false for each iterator i in the range [first,last-1).

The relative ordering of equivalent elements is preserved, so any two elements x and y in the range [first,last) such that x<y is false and y<x is false will have the same relative ordering after calling stable_sort().

The order of the elements in the range [firstp, lastp) is changed in parallel to the changes made in the range [first, last). So elements in the two sequences which had the same index before the sort will have the same index after the sort.

Definition at line 1342 of file stlp_addalgo.h.

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
bool std::stable_sort ( _RandomAccessIter  __first,
_RandomAccessIter  __last,
_RandomAccessIterp  __firstp,
_RandomAccessIterp  __lastp,
_Compare  __comp 
) [inline]

Parameters:
first An iterator.
last Another iterator.
firstp Yet Another iterator.
lastp Yet Another Another iterator.
comp A comparison functor.
Returns:
true if the two ranges had the same length (i.e. sorting worked)
Sorts the elements in the range [first,last) in ascending order, such that comp(*(i+1),*i) is false for each iterator i in the range [first,last-1).

The relative ordering of equivalent elements is preserved, so any two elements x and y in the range [first,last) such that comp(x,y) is false and comp(y,x) is false will have the same relative ordering after calling stable_sort().

The order of the elements in the range [firstp, lastp) is changed in parallel to the changes made in the range [first, last). So elements in the two sequences which had the same index before the sort will have the same index after the sort.

Definition at line 1397 of file stlp_addalgo.h.

Generated on Tue Feb 9 14:50:07 2010 for COCONUT API by  doxygen 1.5.8