std::is_heap_until

 

C++

Linguaggio

Concetti

Libreria di Utilità

Stringhe

Contenitori

Algoritmi

Iteratori

Libreria matematca

Input/output

Localizzazione

Espressioni regolari(C++11)

Operazioni atomicche(C++11)

Multithreading(C++11)

 

Algoritmo libreria

Funzioni Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Non modifica le operazioni di sequenza 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
Modifica delle operazioni di sequenza 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
Partizionamento operazioni 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)
Ordinamento delle operazioni (su intervalli ordinati) 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
Binarie (le operazioni di ricerca sui campi ordinati) 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
Impostare le operazioni (su intervalli ordinati) 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
Heap operazioni 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
Minimo / massimo le operazioni 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
Operazioni numeriche 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
Libreria 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 > RandomIt is_heap_until( RandomIt first, RandomIt last );	(1)	(dal C++11)
template<class RandomIt, class Compare > RandomIt is_heap_until( RandomIt first, RandomIt last, Compare comp );	(2)	(dal C++11)

Esamina l'[first, last) campo e trova l'inizio più vasta gamma di first che è heap'. La prima versione della funzione utilizza operator< per confrontare gli elementi, il secondo utilizza la funzione di confronto dato comp.

Original:

Examines the range [first, last) and finds the largest range beginning at first which is heap. 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.

Parametri

first, last	-	la gamma di elementi da esaminare Original: the range of elements to examine 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.

Valore di ritorno

Il limite superiore di inizio più vasta gamma di first che è heap'. Cioè, il it iteratore ultimo per quale gruppo [first, it) è heap'.

Original:

The upper bound of the largest range beginning at first which is heap. That is, the last iterator it for which range [first, it) is heap.

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

Complessità

Lineare della distanza tra first e last

Original:

Linear in the distance between first and last

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

Note

Un mucchio' è una serie di elementi [f,l) che ha le seguenti proprietà:

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 è l'elemento più grande della gamma

  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.
• un nuovo elemento può essere aggiunto utilizzando 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.
• il primo elemento può essere rimosso utilizzando 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.

L'effettiva disposizione degli elementi è definita attuazione.

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.

Esempio

#include <iostream>#include <algorithm>   int main(){std::vector<int> v {3, 1, 4, 1, 5, 9};   std::make_heap(v.begin(), v.end());   // probably mess up the heap v.push_back(2); v.push_back(6);   auto heap_end = std::is_heap_until(v.begin(), v.end());   std::cout<<"all of v: ";for(auto i : v)std::cout<< i <<' ';std::cout<<'\n';   std::cout<<"only heap: ";for(auto i = v.begin(); i != heap_end;++i)std::cout<<*i <<' ';std::cout<<'\n';}

Output:

all of v: 9 5 4 1 1 3 2 6 only heap: 9 5 4 1 1 3 2

Vedi anche

is_heap	checks if the given range is a heap (funzione di modello)