stlp_addalgo.h File Reference

#include <bits/stlp_pairheap.h>
#include <bits/stl_tempbuf.h>
#include <bits/stl_algobase.h>
#include <bits/stl_algo.h>

Include dependency graph for stlp_addalgo.h:

Go to the source code of this file.


Namespaces

namespace  std
 The standard namespace.

Defines

#define __ISTLGLIBCXX_function_requires(...)   __glibcpp_function_requires( __gnu_cxx::__VA_ARGS__ )
#define __ISTLGLIBCXX_requires_valid_range(A, B)

Enumerations

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

Functions

template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Tp >
pair< _RandomAccessIter,
_RandomAccessIterp > 
std::__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 > 
std::__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 std::__unguarded_linear_p_insert (_RandomAccessIter __last1, _Tp __val1, _RandomAccessIterp __last2, _Tpp __val2)
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)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
void std::__insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void std::__insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
void std::__unguarded_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void std::__unguarded_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
void std::__final_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void std::__final_insertion_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Compare __comp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Size >
void std::__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 std::__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 std::__introsort_p_loop (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp, _Size __depth_limit)
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)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
bool std::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 std::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 std::__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 std::__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 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)
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)
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)
 Merges two sorted ranges.
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)
 Merges two sorted ranges.
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)
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)
template<typename _RandomAccessIter , typename _RandomAccessIterp >
void std::__inplace_stable_p_sort (_RandomAccessIter __first, _RandomAccessIter __last, _RandomAccessIterp __firstp, _RandomAccessIterp __lastp)
template<typename _RandomAccessIter , typename _RandomAccessIterp , typename _Compare >
void std::__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 std::__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 std::__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 std::__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 std::__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 std::__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 std::__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 std::__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 std::__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 std::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 std::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 std::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 std::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 std::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.


Detailed Description

Definition in file stlp_addalgo.h.


Define Documentation

#define __ISTLGLIBCXX_function_requires ( ...   )     __glibcpp_function_requires( __gnu_cxx::__VA_ARGS__ )

Definition at line 42 of file stlp_addalgo.h.

#define __ISTLGLIBCXX_requires_valid_range ( A,
 ) 

Definition at line 43 of file stlp_addalgo.h.


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