⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 omptl_algorithm

📁 omptl使用openmp多核库优化过的STL库
💻
📖 第 1 页 / 共 2 页
字号:
void nth_element(RandomAccessIterator first, RandomAccessIterator nth,                 RandomAccessIterator last, StrictWeakOrdering comp,		 const unsigned P = omp_get_max_threads());template <class RandomAccessIterator>void nth_element(RandomAccessIterator first, RandomAccessIterator nth,                 RandomAccessIterator last,		 const unsigned P = omp_get_max_threads());template <class RandomAccessIterator, class StrictWeakOrdering>void partial_sort(RandomAccessIterator first,                  RandomAccessIterator middle,                  RandomAccessIterator last,                  StrictWeakOrdering comp,		  const unsigned P = omp_get_max_threads());template <class RandomAccessIterator>void partial_sort(RandomAccessIterator first,                  RandomAccessIterator middle,                  RandomAccessIterator last,		  const unsigned P = omp_get_max_threads());template <class InputIterator, class RandomAccessIterator,          class StrictWeakOrdering>RandomAccessIteratorpartial_sort_copy(InputIterator first, InputIterator last,                  RandomAccessIterator result_first,                  RandomAccessIterator result_last, StrictWeakOrdering comp,		  const unsigned P = omp_get_max_threads());template <class InputIterator, class RandomAccessIterator>RandomAccessIteratorpartial_sort_copy(InputIterator first, InputIterator last,                  RandomAccessIterator result_first,                  RandomAccessIterator result_last,		  const unsigned P = omp_get_max_threads());template <class ForwardIterator, class Predicate>ForwardIterator partition(ForwardIterator first, ForwardIterator last,			  Predicate pred,			  const unsigned P = omp_get_max_threads());template <class BidirectionalIterator, class StrictWeakOrdering>bool next_permutation(BidirectionalIterator first, BidirectionalIterator last,                      StrictWeakOrdering comp,		      const unsigned P = omp_get_max_threads());template <class BidirectionalIterator>bool next_permutation(BidirectionalIterator first, BidirectionalIterator last,		      const unsigned P = omp_get_max_threads());template <class BidirectionalIterator, class StrictWeakOrdering>bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last,                      StrictWeakOrdering comp,		      const unsigned P = omp_get_max_threads());template <class BidirectionalIterator>bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last,		      const unsigned P = omp_get_max_threads());template <class ForwardIterator, class Predicate>ForwardIteratorstable_partition(ForwardIterator first, ForwardIterator last,		 Predicate pred, const unsigned P = omp_get_max_threads());template <class RandomAccessIterator>void random_shuffle(RandomAccessIterator first, RandomAccessIterator last,		    const unsigned P = omp_get_max_threads());template <class RandomAccessIterator, class RandomNumberGenerator>void random_shuffle(RandomAccessIterator first, RandomAccessIterator last,                    RandomNumberGenerator &rgen,		    const unsigned P = omp_get_max_threads());template <class ForwardIterator, class T>ForwardIterator remove(ForwardIterator first, ForwardIterator last,                       const T& value, const unsigned P = omp_get_max_threads());template <class ForwardIterator, class Predicate>ForwardIterator remove_if(ForwardIterator first, ForwardIterator last,                          Predicate pred,			  const unsigned P = omp_get_max_threads());template <class InputIterator, class OutputIterator, class T>OutputIterator remove_copy(InputIterator first, InputIterator last,                           OutputIterator result, const T& value,			   const unsigned P = omp_get_max_threads());template <class InputIterator, class OutputIterator, class Predicate>OutputIterator remove_copy_if(InputIterator first, InputIterator last,                              OutputIterator result, Predicate pred,			      const unsigned P = omp_get_max_threads());template <class ForwardIterator, class T>void replace(ForwardIterator first, ForwardIterator last, const T& old_value,             const T& new_value, const unsigned P = omp_get_max_threads());template <class InputIterator, class OutputIterator, class T>OutputIterator replace_copy(InputIterator first, InputIterator last,                            OutputIterator result, const T& old_value,                            const T& new_value,			    const unsigned P = omp_get_max_threads());template <class InputIterator, class OutputIterator, class Predicate, class T>OutputIterator replace_copy_if(InputIterator first, InputIterator last,                               OutputIterator result, Predicate pred,                               const T& new_value,			       const unsigned P = omp_get_max_threads());template <class ForwardIterator, class Predicate, class T>void replace_if(ForwardIterator first, ForwardIterator last, Predicate pred,                const T& new_value,		const unsigned P = omp_get_max_threads());template <class BidirectionalIterator>void reverse(BidirectionalIterator first, BidirectionalIterator last,	     const unsigned P = omp_get_max_threads());template <class BidirectionalIterator, class OutputIterator>OutputIterator reverse_copy(BidirectionalIterator first,			    BidirectionalIterator last,			    OutputIterator result,			    const unsigned P = omp_get_max_threads());template <class ForwardIterator>ForwardIterator rotate( ForwardIterator first, ForwardIterator middle,			ForwardIterator last,			const unsigned P = omp_get_max_threads());template <class ForwardIterator, class OutputIterator>OutputIterator rotate_copy(ForwardIterator first, ForwardIterator middle,                           ForwardIterator last, OutputIterator result,			   const unsigned P = omp_get_max_threads());// search suffers from a loss of efficiency when executed in parallel!template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1,                        ForwardIterator2 first2, ForwardIterator2 last2,                        BinaryPredicate binary_pred,			const unsigned P = omp_get_max_threads());template <class ForwardIterator1, class ForwardIterator2>ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1,                        ForwardIterator2 first2, ForwardIterator2 last2,			const unsigned P = omp_get_max_threads());template <class ForwardIterator, class Integer,          class T, class BinaryPredicate>ForwardIterator search_n(ForwardIterator first, ForwardIterator last,                         Integer count, const T& value,                         BinaryPredicate binary_pred,			 const unsigned P = omp_get_max_threads());template <class ForwardIterator, class Integer, class T>ForwardIterator search_n(ForwardIterator first, ForwardIterator last,                         Integer count, const T& value,			const unsigned P = omp_get_max_threads());template <class InputIterator1, class InputIterator2, class OutputIterator,          class StrictWeakOrdering>OutputIterator set_difference(InputIterator1 first1, InputIterator1 last1,				InputIterator2 first2, InputIterator2 last2,				OutputIterator result, StrictWeakOrdering comp,				const unsigned P = omp_get_max_threads());template <class InputIterator1, class InputIterator2, class OutputIterator>OutputIterator set_difference(InputIterator1 first1, InputIterator1 last1,				InputIterator2 first2, InputIterator2 last2,				OutputIterator result,				const unsigned P = omp_get_max_threads());template <class InputIterator1, class InputIterator2, class OutputIterator,          class StrictWeakOrdering>OutputIterator set_intersection(InputIterator1 first1, InputIterator1 last1,				InputIterator2 first2, InputIterator2 last2,				OutputIterator result, StrictWeakOrdering comp,			 	const unsigned P = omp_get_max_threads());template <class InputIterator1, class InputIterator2, class OutputIterator>OutputIterator set_intersection(InputIterator1 first1, InputIterator1 last1,				InputIterator2 first2, InputIterator2 last2,				OutputIterator result,				const unsigned P = omp_get_max_threads());template <class InputIterator1, class InputIterator2, class OutputIterator,          class StrictWeakOrdering>OutputIteratorset_symmetric_difference(InputIterator1 first1, InputIterator1 last1,			 InputIterator2 first2, InputIterator2 last2,			 OutputIterator result, StrictWeakOrdering comp,			 const unsigned P = omp_get_max_threads());template <class InputIterator1, class InputIterator2, class OutputIterator>OutputIteratorset_symmetric_difference(InputIterator1 first1, InputIterator1 last1,			 InputIterator2 first2, InputIterator2 last2,			 OutputIterator result,			 const unsigned P = omp_get_max_threads());template <class InputIterator1, class InputIterator2, class OutputIterator,          class StrictWeakOrdering>OutputIterator set_union(InputIterator1 first1, InputIterator1 last1,			 InputIterator2 first2, InputIterator2 last2,			 OutputIterator result, StrictWeakOrdering comp,			 const unsigned P = omp_get_max_threads());template <class InputIterator1, class InputIterator2, class OutputIterator>OutputIterator set_union(InputIterator1 first1, InputIterator1 last1,			 InputIterator2 first2, InputIterator2 last2,			 OutputIterator result,			 const unsigned P = omp_get_max_threads());template<typename RandomAccessIterator>void stable_sort(RandomAccessIterator first, RandomAccessIterator last,			const unsigned P = omp_get_max_threads());template<typename RandomAccessIterator, class StrictWeakOrdering>void stable_sort(RandomAccessIterator first, RandomAccessIterator last,	StrictWeakOrdering comp, const unsigned P = omp_get_max_threads());template<typename RandomAccessIterator>void sort(RandomAccessIterator first, RandomAccessIterator last,			const unsigned P = omp_get_max_threads());template<typename RandomAccessIterator, class StrictWeakOrdering>void sort(RandomAccessIterator first, RandomAccessIterator last,	  StrictWeakOrdering comp, const unsigned P = omp_get_max_threads());template <class ForwardIterator1, class ForwardIterator2>ForwardIterator2 swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1,				ForwardIterator2 first2,				const unsigned P = omp_get_max_threads());template <class InputIterator, class OutputIterator, class UnaryFunction>OutputIterator transform(InputIterator first, InputIterator last,                         OutputIterator result, UnaryFunction op,			 const unsigned P = omp_get_max_threads());template <class InputIterator1, class InputIterator2, class OutputIterator,          class BinaryFunction>OutputIterator transform(InputIterator1 first1, InputIterator1 last1,                         InputIterator2 first2, OutputIterator result,                         BinaryFunction binary_op,			 const unsigned P = omp_get_max_threads());template <class ForwardIterator, class BinaryPredicate>ForwardIterator unique(ForwardIterator first, ForwardIterator last,                       BinaryPredicate binary_pred,		       const unsigned P = omp_get_max_threads());template <class ForwardIterator>ForwardIterator unique(ForwardIterator first, ForwardIterator last,		       const unsigned P = omp_get_max_threads());template <class InputIterator, class OutputIterator, class BinaryPredicate>OutputIterator unique_copy(InputIterator first, InputIterator last,                           OutputIterator result, BinaryPredicate binary_pred,		       const unsigned P = omp_get_max_threads());template <class InputIterator, class OutputIterator>OutputIterator unique_copy(InputIterator first, InputIterator last,                           OutputIterator result,		       const unsigned P = omp_get_max_threads());template <class ForwardIterator, class T, class StrictWeakOrdering>ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last,			    const T& value, StrictWeakOrdering comp,			    const unsigned P = omp_get_max_threads());template <class ForwardIterator, class T>ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last,			    const T& value,			    const unsigned P = omp_get_max_threads());} // namespace omptl#include <omptl/omptl_algorithm.h>#endif /* OMPTL_OFF */#endif /* OMPTL_ALGORITHM */

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -