std::make_heap

 

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 RandomIt > void make_heap( RandomIt first, RandomIt last );	(1)
template< class RandomIt, class Compare > void make_heap( RandomIt first, RandomIt last,                 Compare comp );	(2)

构造一个“堆”的范围内[first, last)。 operator<的第一个版本的功能使用比较的元素，第二个使用给定的比较函数comp.

Original:

Constructs a heap in the range [first, last). The first version of the function uses operator< to compare the elements, the second 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.

参数

first, last	-	范围内的元素，使堆 Original: the range of elements to make the heap from 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: bool cmp(const Type1 &a, const Type2 &b); The signature does not need to have const &, but the function must not modify the objects passed to it. The types  Type1 and  Type2 must be such that an object of type RandomIt can be dereferenced and then implicitly converted to both of them. ​
Type requirements
- RandomIt must meet the requirements of RandomAccessIterator.
- The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.

返回值

（无）

Original:

(none)

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

复杂性

在大多数3*std::distance(first, last)比较.

Original:

At most 3*std::distance(first, last) comparisons.

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

注释

A“堆”是一个范围的元素[f,l)具有以下属性：

Original:

A heap is a range of elements [f,l) that has the following properties:

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

• *f范围中的最大元素

  Original:

  *f is the largest element in the range

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.
• 可以添加一个新的元素，使用std::push_heap()

  Original:

  a new element can be added using std::push_heap()

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.
• 使用std::pop_heap()的第一个元素可以被删除

  Original:

  the first element can be removed using std::pop_heap()

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

实际配置是实现定义的元素.

Original:

The actual arrangement of the elements is implementation defined.

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

为例

#include <iostream>
#include <algorithm>
 
int main()
{
    std::vector<int> v { 3, 1, 4, 1, 5, 9 };
 
    std::cout << "initially, v: ";
    for (auto i : v) std::cout << i << ' ';
    std::cout << '\n';
 
    std::make_heap(v.begin(), v.end());
 
    std::cout << "after make_heap, v: ";
    for (auto i : v) std::cout << i << ' ';
    std::cout << '\n';
 
    std::pop_heap(v.begin(), v.end());
    auto largest = v.back();
    v.pop_back();
    std::cout << "largest element: " << largest << '\n';
 
    std::cout << "after removing the largest element, v: ";
    for (auto i : v) std::cout << i << ' ';
    std::cout << '\n';
}

Output:

initially, v: 3 1 4 1 5 9 
after make_heap, v: 9 5 4 1 1 3 
largest element: 9
after removing the largest element, v: 5 3 4 1 1

另请参阅

sort_heap	变成一个堆的排序范围内的元素 Original: turns a heap into a sorted range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （函数模板）