std::partial_sort_copy
来自cppreference.com
 |
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
| Defined in header <algorithm>
|
||
| template< class InputIt, class RandomIt > RandomIt partial_sort_copy( InputIt first, InputIt last, |
(1) | |
| template< class InputIt, class RandomIt, class Compare > RandomIt partial_sort_copy( InputIt first, InputIt last, |
(2) | |
排序部分中的元素按升序排列的范围
[first, last)。在最d_first - d_last元素被移动到的范围内[d_first, d_first + n)并进行排序。 n的元素数进行排序（n = min(last - first, d_last - d_first)）。要保留相等元素的顺序是不能保证。 operator<的第一个版本使用比较的元素，第二个版本使用给定的比较函数comp.Original:
Sorts some of the elements in the range
[first, last) in ascending order. At most d_first - d_last of the elements are moved to the range [d_first, d_first + n) and then sorted. n is the number of elements to sort (n = min(last - first, d_last - d_first)). The order of equal elements is not guaranteed to be preserved. The first version uses operator< to compare the elements, the second version uses the given comparison function comp.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
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, d_last | - | 随机访问迭代器定义的目标范围内
Original: random access iterators defining the destination range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. | |||||||||
| comp | - | comparison function which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following:
The signature does not need to have const &, but the function must not modify the objects passed to it. | |||||||||
| Type requirements | |||||||||||
-InputIt must meet the requirements of InputIterator.
| |||||||||||
-RandomIt must meet the requirements of ValueSwappable and RandomAccessIterator.
| |||||||||||
-The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.
| |||||||||||
[编辑] 返回值
一个迭代器的元素定义的排序范围的上边界，即d_first + min(last - first, d_last - d_first).
Original:
an iterator to the element defining the upper boundary of the sorted range, i.e. d_first + min(last - first, d_last - d_first).
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[编辑] 复杂性
O(N·log(min(D,N))，N = std::distance(first, last)，D = std::distance(d_first, d_last)应用
cmp.Original:
O(N·log(min(D,N)), where N = std::distance(first, last), D = std::distance(d_first, d_last) applications of
cmp.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[编辑] 为例
下面的代码排序向量的整数，并将它们复制到一个较小的和较大的载体.
Original:
The following code sorts an vector of integers and copies them into a smaller and a larger vector.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
#include <algorithm> #include <vector> #include <functional> #include <iostream> int main() { std::vector<int> v0{4, 2, 5, 1, 3}; std::vector<int> v1{10, 11, 12}; std::vector<int> v2{10, 11, 12, 13, 14, 15, 16}; std::vector<int>::iterator it; it = std::partial_sort_copy(v0.begin(), v0.end(), v1.begin(), v1.end()); std::cout << "Writing to the smaller vector in ascending order gives: "; for (int a : v1) { std::cout << a << " "; } std::cout << '\n'; if(it == v1.end()) std::cout << "The return value is the end iterator\n"; it = std::partial_sort_copy(v0.begin(), v0.end(), v2.begin(), v2.end(), std::greater<int>()); std::cout << "Writing to the larger vector in descending order gives: "; for (int a : v2) { std::cout << a << " "; } std::cout << '\n' << "The return value is the iterator to " << *it << '\n'; }
Output:
Writing to the smaller vector in ascending order gives: 1 2 3 The return value is the end iterator Writing to the larger vector in descending order gives: 5 4 3 2 1 15 16 The return value is the iterator to 15
[编辑] 另请参阅
| 排序第一的范围内的N个元素 Original: sorts the first N elements of a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （函数模板） | |
| 为升序排序范围 Original: sorts a range into ascending order The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （函数模板） | |
| 排序范围内的元素，同时保持相等的元素之间的顺序 Original: sorts a range of elements while preserving order between equal elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （函数模板） | |
