std::partition_copy

 

C++

語言

概念

實用工具庫

字元串庫

集裝箱庫

演算法庫

迭代器庫

Numerics庫

輸入/輸出庫

本地化庫

正則表達式庫 （C++11）

原子操作庫 （C++11）

線程的支持庫 （C++11）

 

演算法庫

功能 Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
修改序列操作 Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of （C++11） （C++11） （C++11） for_each count count_if mismatch equal	find find_if find_if_not （C++11） find_end find_first_of adjacent_find search search_n
修改序列操作 Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if （C++11） copy_n （C++11） copy_backward move （C++11） move_backward （C++11） fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   （C++11） unique unique_copy
分區操作 Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned （C++11） partition partition_copy （C++11）	stable_partition partition_point （C++11）
排序操作（排序的區間） Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted （C++11） is_sorted_until （C++11） sort	partial_sort partial_sort_copy stable_sort nth_element
二進制搜索操作（排序的區間） Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
設置操作（排序的區間） Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
堆的操作 Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until （C++11） make_heap	push_heap pop_heap sort_heap
最小/最大操作 Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax （C++11） minmax_element （C++11）	lexicographical_compare is_permutation （C++11） next_permutation prev_permutation
數字操作 Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota （C++11） accumulate inner_product	adjacent_difference partial_sum
C庫 Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <algorithm>
template< class InputIt, class OutputIt1,           class OutputIt2, class UnaryPredicate > std::pair<OutputIt1, OutputIt2>      partition_copy(InputIt first, InputIt last,                     OutputIt1 d_first_true, OutputIt2 d_first_false,                     UnaryPredicate p);		（C++11 起）

複製的元素滿足謂詞p從[first, last)的範圍的範圍內開始，d_first_true，和複製元素沒有開始的範圍內，在滿足pd_first_false.

Original:

Copies the elements that satisfy the predicate p from the range [first, last) to the range beginning at d_first_true, and copies the elements that do not satisfy p to the range beginning at d_first_false.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

參數

first, last	-	範圍內的元素進行排序 Original: the range of elements to sort The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
d_first_true	-	滿足p的元素的輸出範圍的開頭 Original: the beginning of the output range for the elements that satisfy p The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
d_first_false	-	元素沒有滿足p的輸出範圍的開頭 Original: the beginning of the output range for the elements that do not satisfy p The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
p	-	unary predicate which returns ​true 如果元素應該被放置在d_first_true Original: if the element should be placed in d_first_true The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. . The signature of the predicate function should be equivalent to the following: bool pred(const Type &a); The signature does not need to have const &, but the function must not modify the objects passed to it. The type Type must be such that an object of type InputIt can be dereferenced and then implicitly converted to Type. ​
Type requirements
- InputIt must meet the requirements of InputIterator.
- OutputIt1 must meet the requirements of OutputIterator.
- OutputIt2 must meet the requirements of OutputIterator.

返回值

構建一個paird_first_true範圍和d_first_false範圍的結束迭代器迭代器.

Original:

A pair constructed from the iterator to the end of the d_first_true range and the iterator to the end of the d_first_false range.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

複雜性

究竟distance(first, last)應用程序的p

Original:

Exactly distance(first, last) applications of p.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

可能的實現

template<class InputIt, class OutputIt1, class OutputIt2, class UnaryPredicate> std::pair<OutputIt1, OutputIt2> partition_copy(InputIt first, InputIt last, OutputIt1 d_first_true, OutputIt2 d_first_false, UnaryPredicate p) { while (first != last) { if (p(*first)) { *d_first_true = *first; ++d_first_true; } else { *d_first_false = *first; ++d_first_false; } ++first; } return std::pair<OutputIt1, OutputIt2>(d_first_true, d_first_false); }

為例

#include <iostream>
#include <algorithm>
#include <utility>
 
int main()
{
    int arr [10] = {1,2,3,4,5,6,7,8,9,10};
    int true_arr [5] = {0};
    int false_arr [5] = {0};
 
    std::partition_copy(std::begin(arr), std::end(arr), std::begin(true_arr),std::begin(false_arr),
                        [] (int i) {return i > 5;});
 
    std::cout << "true_arr: ";
    for (auto it = std::begin(true_arr); it != std::end(true_arr); ++it) {
        std::cout << *it << ' ';
    }
    std::cout << '\n'; 
 
    std::cout << "false_arr: ";
    for (auto it = std::begin(false_arr); it != std::end(false_arr); ++it) {
        std::cout << *it << ' ';
    }
    std::cout << '\n'; 
 
    return 0;
 
}

Output:

true_arr: 6 7 8 9 10
false_arr: 1 2 3 4 5

另請參閱

partition	把一個範圍的元素分為兩組 Original: divides a range of elements into two groups The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （函數模板）
stable_partition	將元素分為兩組，同時保留其相對順序 Original: divides elements into two groups while preserving their relative order The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （函數模板）