std::is_heap_until

 

C++

Linguagem

Conceitos

Biblioteca de utilitários

Biblioteca cordas

Recipientes biblioteca

Biblioteca algoritmos

Biblioteca iteradores

Biblioteca numéricos

De entrada / saída da biblioteca

Biblioteca localizações

Biblioteca de expressões regulares(C++11)

Biblioteca operações atômica(C++11)

Biblioteca de suporte a discussão(C++11)

 

Biblioteca algoritmo

Funções Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Não modificar operações de seqüência 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
Modificando operações de seqüência 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
Particionamento operações 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)
Operações de classificação (em intervalos ordenados) 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
Binários operações de busca (em intervalos ordenados) 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
Definir operações (em intervalos ordenados) 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
Operações de pilha 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
Mínimo / máximo de operações 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
Operações numéricas 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 biblioteca 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)	(a partir do C++ 11)
template<class RandomIt, class Compare > RandomIt is_heap_until( RandomIt first, RandomIt last, Compare comp );	(2)	(a partir do C++ 11)

Examina o [first, last) gama e encontra o início maior leque de first que é' pilha. A primeira versão da função utiliza operator< comparar os elementos, o segundo usa a função de comparação dada 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.

Parâmetros

first, last	-	a gama de elementos para examinar 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.

Valor de retorno

O limite superior do início ao maior leque first que é pilha'. Isto é, o it iterador último para o qual faixa [first, it) é pilha'.

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.

Complexidade

Linear da distância entre 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.

Notas

Uma pilha' é uma gama de elementos [f,l) que tem as seguintes propriedades:

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 é o maior elemento no intervalo

  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.
• um novo elemento pode ser adicionado usando 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.
• o primeiro elemento pode ser removido usando 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.

O real disposição dos elementos é definido pela implementação.

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.

Exemplo

#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

Veja também

is_heap	checks if the given range is a heap (modelo de função)