/dports/net/ipsumdump/ipsumdump-1.86/libclick-2.1/include/click/ |
H A D | heap.hh | 32 compare_type comp, place_type place) in push_heap() 49 compare_type comp) in push_heap() 147 compare_type comp, place_type place) in remove_heap() 161 compare_type comp) in remove_heap() 193 compare_type comp, place_type place) in pop_heap() 201 compare_type comp) in pop_heap() 255 compare_type comp) in push_heap() 361 compare_type comp, place_type place) in remove_heap() 376 compare_type comp) in remove_heap() 410 compare_type comp, place_type place) in pop_heap() [all …]
|
/dports/biology/diamond/diamond-2.0.13/src/lib/ips4o/ |
H A D | ips4o.hpp | 65 void sort(It begin, It end, Comp comp = Comp()) { in sort() 80 void sort(It begin, It end, Comp comp) { in sort() 85 void sort(It begin, It end) { in sort() 98 make_sorter(ThreadPool&& thread_pool, Comp comp = Comp()) { in make_sorter() 115 sort(It begin, It end, Comp comp, ThreadPool&& thread_pool) { in sort() 125 void sort(It begin, It end, Comp comp, int num_threads) { in sort() 138 void sort(It begin, It end, Comp comp) { in sort() 144 void sort(It begin, It end) { in sort()
|
H A D | base_case.hpp | 52 void insertionSort(const It begin, const It end, Comp comp) { in insertionSort() 75 inline void baseCaseSort(It begin, It end, Comp&& comp) { in baseCaseSort() 81 inline bool sortedCaseSort(It begin, It end, Comp&& comp) { in sortedCaseSort()
|
/dports/biology/mmseqs2/MMseqs2-13-45111/lib/ips4o/ips4o/ |
H A D | ips4o.hpp | 63 void sort(It begin, It end, Comp comp = Comp()) { in sort() 78 void sort(It begin, It end, Comp comp) { in sort() 83 void sort(It begin, It end) { in sort() 123 void sort(It begin, It end, Comp comp, int num_threads) { in sort() 136 void sort(It begin, It end, Comp comp) { in sort() 142 void sort(It begin, It end) { in sort()
|
H A D | base_case.hpp | 52 void insertionSort(const It begin, const It end, Comp comp) { in insertionSort() 75 inline void baseCaseSort(It begin, It end, Comp&& comp) { in baseCaseSort() 81 inline bool sortedCaseSort(It begin, It end, Comp&& comp) { in sortedCaseSort()
|
/dports/devel/thrust/thrust-1.9.5/thrust/system/detail/generic/ |
H A D | binary_search.inl | 102 ForwardIterator begin; member 104 StrictWeakOrdering comp; member 129 StrictWeakOrdering comp, 149 StrictWeakOrdering comp, 209 StrictWeakOrdering comp) 235 StrictWeakOrdering comp) 260 StrictWeakOrdering comp) 293 StrictWeakOrdering comp) 321 StrictWeakOrdering comp) 349 StrictWeakOrdering comp) [all …]
|
/dports/devel/thrust/thrust-1.9.5/thrust/system/omp/detail/ |
H A D | binary_search.h | 35 ForwardIterator begin, in lower_bound() 38 StrictWeakOrdering comp) in lower_bound() 47 ForwardIterator begin, in upper_bound() 50 StrictWeakOrdering comp) in upper_bound() 59 ForwardIterator begin, in binary_search() 62 StrictWeakOrdering comp) in binary_search()
|
/dports/devel/py-pythran/pythran-0.11.0/pythran/pythonic/utils/ |
H A D | pdqsort.hpp | 93 inline void insertion_sort(Iter begin, Iter end, Compare comp) in insertion_sort() 122 inline void unguarded_insertion_sort(Iter begin, Iter end, Compare comp) in unguarded_insertion_sort() 152 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) in partial_insertion_sort() 184 inline void sort2(Iter a, Iter b, Compare comp) in sort2() 192 inline void sort3(Iter a, Iter b, Iter c, Compare comp) in sort3() 502 inline Iter partition_left(Iter begin, Iter end, Compare comp) in partition_left() 536 inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, in pdqsort_loop() 647 inline void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort() 666 inline void pdqsort(Iter begin, Iter end) in pdqsort() 673 inline void pdqsort_branchless(Iter begin, Iter end, Compare comp) in pdqsort_branchless() [all …]
|
/dports/devel/concurrentqueue/concurrentqueue-1.0.3-15-g0753496/benchmarks/tbb/ |
H A D | parallel_sort.h | 60 const Compare ∁ variable 61 RandomAccessIterator begin; variable 113 const Compare ∁ variable 150 void parallel_quick_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp… in parallel_quick_sort() 195 void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp) { in parallel_sort() 209 inline void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end ) { in parallel_sort() 216 void parallel_sort(Range& rng, const Compare& comp) { in parallel_sort() 223 void parallel_sort(const Range& rng, const Compare& comp) { in parallel_sort() 244 inline void parallel_sort( T * begin, T * end ) { in parallel_sort()
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/tbb-2018_U2/include/tbb/ |
H A D | parallel_sort.h | 100 const Compare ∁ variable 102 RandomAccessIterator begin; variable 123 const Compare ∁ variable 160 void parallel_quick_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp… in parallel_quick_sort() 208 void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp) { in parallel_sort() 222 inline void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end ) { in parallel_sort() 229 void parallel_sort(Range& rng, const Compare& comp) { in parallel_sort() 236 void parallel_sort(const Range& rng, const Compare& comp) { in parallel_sort() 257 inline void parallel_sort( T * begin, T * end ) { in parallel_sort()
|
/dports/devel/hyperscan/boost_1_75_0/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/devel/R-cran-BH/BH/inst/include/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 116 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 144 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 150 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 162 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 206 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 233 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 328 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/emulators/citra/citra-ac98458e0/externals/boost/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/devel/boost-libs/boost_1_72_0/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/devel/boost-docs/boost_1_72_0/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/devel/boost-python-libs/boost_1_72_0/boost/move/algo/detail/ |
H A D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() 138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2() 144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() 227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop() 322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/include/tbb/ |
H A D | parallel_sort.h | 102 const Compare ∁ variable 104 RandomAccessIterator begin; variable 125 const Compare ∁ variable 162 void parallel_quick_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp… in parallel_quick_sort() 210 void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp) { in parallel_sort() 224 inline void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end ) { in parallel_sort() 231 void parallel_sort(Range& rng, const Compare& comp) { in parallel_sort() 245 inline void parallel_sort( T * begin, T * end ) { in parallel_sort()
|
/dports/devel/tbb/oneTBB-2020.3/include/tbb/ |
H A D | parallel_sort.h | 102 const Compare ∁ variable 104 RandomAccessIterator begin; variable 125 const Compare ∁ variable 162 void parallel_quick_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp… in parallel_quick_sort() 210 void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp) { in parallel_sort() 224 inline void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end ) { in parallel_sort() 231 void parallel_sort(Range& rng, const Compare& comp) { in parallel_sort() 245 inline void parallel_sort( T * begin, T * end ) { in parallel_sort()
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/include/tbb/ |
H A D | parallel_sort.h | 102 const Compare ∁ variable 104 RandomAccessIterator begin; variable 125 const Compare ∁ variable 162 void parallel_quick_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp… in parallel_quick_sort() 210 void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp) { in parallel_sort() 224 inline void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end ) { in parallel_sort() 231 void parallel_sort(Range& rng, const Compare& comp) { in parallel_sort() 245 inline void parallel_sort( T * begin, T * end ) { in parallel_sort()
|
/dports/math/combblas/CombBLAS_beta_16_2/psort-1.0/include/psort/ |
H A D | sort.timpl.h | 35 inline void insertion_sort(It begin, It end, Pred comp) in insertion_sort() 49 inline T median(const T& a, const T& b, const T& c, Pred comp) in median() 68 inline BidIt partition(BidIt begin, BidIt end, T pivot, Pred comp) in partition() 82 inline void quicksort(RanIt First, RanIt Last, Pred comp) in quicksort() 107 void batcher_sort(RanIt begin, RanIt end, Pred comp) in batcher_sort() 160 void inplace_base_sort(RanIt begin, RanIt end, Pred comp) in inplace_base_sort() 207 RanIt begin, end; variable 222 inline iterator begin() in begin() function 311 inline void add_streams_(MPtr merger, It begin, size_t order, size_t run_size, size_t big_runs, Pre… in add_streams_() 328 void merge_sort_(It begin, It end, OutIt dest, Merger* cache, Alloc alloc) in merge_sort_() [all …]
|
/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/cont/tbb/internal/ |
H A D | parallel_sort.h | 76 const Compare& comp; variable 77 RandomAccessIterator begin; variable 142 const Compare& comp; variable 187 void parallel_quick_sort(RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp) in parallel_quick_sort() 237 void parallel_sort(RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp) in parallel_sort() 256 inline void parallel_sort(RandomAccessIterator begin, RandomAccessIterator end) in parallel_sort() 265 inline void parallel_sort(T* begin, T* end) in parallel_sort()
|