std::make_heap

 

C++

言語

コンセプト

ユーティリティライブラリ

ストリングスライブラリ

コンテナライブラリ

アルゴリズムライブラリ

イテレータライブラリ

ニューメリックスライブラリ

入力/出力ライブラリ

ローカライゼーションライブラリ

正規表現ライブラリ(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<使用し、2番目は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	-	比較関数. 最初の値が二つ目の値より小さい 場合、 ​trueを返します. 比較関数のシグネチャは以下と同等でなければなりません.  bool cmp(const Type1 &a, const Type2 &b); シグネチャはconstを含まなくても構いませんが, 比較関数は渡されたオブジェクトを変更してはなりません. 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. ​
型の要件
- RandomIt は RandomAccessIterator の要求を満足しなければなりません。
- The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.

値を返します

(なし)

複雑性

最も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.

ノート

'ヒープは、要素の範囲です[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';}

出力:

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. (関数テンプレート)