std::remove, std::remove_if

 

C++

Langage

Concepts

Bibliothèque d'utilitaires

Bibliothèque pour les chaînes de caractères

Bibliothèque de conteneurs

Bibliothèque d'algorithmes

Bibliothèque d'itérateurs

Bibliothèque pour le calcul numérique

Bibliothèque pour les entrées/sorties

Bibliothèque pour la régionalisation

Bibliothèque pour les expressions régulières (C++11)

Bibliothèque pour les opérations atomiques (C++11)

Bibliothèque pour les processus légers (threads) (C++11)

 

Bibliothèque d'algorithmes

Fonctions 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-modification de la séquence des opérations 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
Modification de la séquence des opérations 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
Des opérations de partitionnement 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)
Opérations de tri (sur les gammes triés) 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
Opérations binaires de recherche (sur les gammes triés) 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
Définir les opérations (sur les gammes triés) 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
Opérations Heap 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
Minimum / maximum de fonctionnement 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
Opérations numériques 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
Bibliothèque 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 ForwardIt, class T > ForwardIt remove( ForwardIt first, ForwardIt last, const T& value );	(1)
template<class ForwardIt, class UnaryPredicate > ForwardIt remove_if( ForwardIt first, ForwardIt last, UnaryPredicate p );	(2)

Supprime tous les éléments répondant à des critères spécifiques de la gamme [first, last). La première version supprime tous les éléments qui sont égaux à value, la deuxième version supprime tous les éléments pour lesquels prédicat retourne ptrue .

Original:

Removes all elements satisfying specific criteria from the range [first, last). The first version removes all elements that are equal to value, the second version removes all elements for which predicate p returns true.

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

D'élimination est effectuée en déplaçant les éléments de la gamme, de telle manière que les éléments à effacer sont écrasés. Les éléments entre les anciens et les nouveaux extrémités de la gamme des valeurs non spécifiées. Un itérateur à la nouvelle extrémité de la gamme est retourné. Ordre relatif des éléments qui demeurent soit préservée .

Original:

Removing is done by shifting the elements in the range in such a way that elements to be erased are overwritten. The elements between the old and the new ends of the range have unspecified values. An iterator to the new end of the range is returned. Relative order of the elements that remain is preserved.

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

Paramètres

first, last	-	l'ensemble d'éléments de processus Original: the range of elements to process The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
value	-	la valeur des éléments à supprimer Original: the value of elements to remove The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
p	-	unary predicate which returns ​true si l'élément doit être supprimé Original: if the element should be removed The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. . The signature of the predicate function should be equivalent to the following:  bool pred(const Type &a); The signature does not need to have const&, but the function must not modify the objects passed to it. The type Type must be such that an object of type ForwardIt can be dereferenced and then implicitly converted to Type. ​
Type requirements
- ForwardIt must meet the requirements of ForwardIterator.
- The type of dereferenced ForwardIt must meet the requirements of MoveAssignable.

Retourne la valeur

Itérateur à la nouvelle extrémité de la gamme

Original:

Iterator to the new end of the range

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

Complexité

Exactement std::distance(first, last) applications du prédicat .

Original:

Exactly std::distance(first, last) applications of the predicate.

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

Notes

Les fonctions de même nom list::remove membres de conteneurs, list::remove_if, forward_list::remove et forward_list::remove_if effacer les éléments supprimés .

Original:

The similarly-named container member functions list::remove, list::remove_if, forward_list::remove, and forward_list::remove_if erase the removed elements.

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

Mise en œuvre possible

First version
template<class ForwardIt, class T> ForwardIt remove(ForwardIt first, ForwardIt last, const T& value){ ForwardIt result = first;for(; first != last;++first){if(!(*first == value)){*result++=*first;}}return result;}
Second version
template<class ForwardIt, class UnaryPredicate> ForwardIt remove_if(ForwardIt first, ForwardIt last, UnaryPredicate p){ ForwardIt result = first;for(; first != last;++first){if(!p(*first)){*result++=*first;}}return result;}

Exemple

Le code suivant supprime tous les espaces d'une chaîne en les déplaçant vers la fin de la chaîne, puis effacer .

Original:

The following code removes all spaces from a string by moving them to the end of the string and then erasing.

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

#include <algorithm>#include <string>#include <iostream>int main(){std::string str ="Text with some spaces"; str.erase(std::remove(str.begin(), str.end(), ' '), str.end());std::cout<< str <<'\n';}

Résultat :

Textwithsomespaces

Voir aussi

remove_copy remove_copy_if	Copie une série d'éléments en omettant ceux qui satisfont à certains critères Original: copies a range of elements omitting those that satisfy specific criteria The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction générique)