std::replace, std::replace_if

 

C++

Sprache

Concepts

Utilities-Bibliothek

Strings Bibliothek

Container-Bibliothek

Algorithmen-Bibliothek

Iteratoren Bibliothek

Numerik-Bibliothek

Input / Output-Bibliothek

Lokalisierungen Bibliothek

Reguläre Ausdrücke Bibliothek(C++11)

Atomare Operationen Bibliothek(C++11)

Thread Support-Bibliothek(C++11)

 

Algorithm Bibliothek

Funktionen Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Nicht-modifizierende Sequenz Operationen 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
Modifizierende Sequenz Operationen 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
Partitionierungsoperationen 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)
Sortierung Operationen (auf sortierten Bereiche) 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
Binary Suchaktionen (auf sortierten Bereiche) 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
Set-Operationen (auf sortierten Bereiche) 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-Operationen 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 Operationen 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
Numerische Operationen 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-Bibliothek 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 > void replace( ForwardIt first, ForwardIt last,               const T& old_value, const T& new_value );	(1)
template<class ForwardIt, class UnaryPredicate, class T > void replace_if( ForwardIt first, ForwardIt last,                  UnaryPredicate p, const T& new_value );	(2)

Ersetzt alle Elemente, die die spezifischen Kriterien new_value im Bereich [first, last). Die erste Version ersetzt die Elemente, die gleich old_value sind, ersetzt die zweite Version Elemente, für die Prädikats p kehrt true .

Original:

Replaces all elements satisfying specific criteria with new_value in the range [first, last). The first version replaces the elements that are equal to old_value, the second version replaces 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.

Parameter

first, last	-	der Bereich der Elemente zu verarbeiten 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.
old_value	-	der Wert der Elemente zu ersetzen Original: the value of elements to replace 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 wenn der Wert des Elements ersetzt werden sollte Original: if the element value should be replaced 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. ​
new_value	-	der Wert als Ersatz verwenden Original: the value to use as replacement The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Type requirements
- ForwardIt must meet the requirements of ForwardIterator.

Rückgabewert

(None)

Original:

(none)

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

Komplexität

Genau last - first Anwendungen des Prädikats .

Original:

Exactly last - first 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.

Mögliche Implementierung

First version
template<class ForwardIt, class T>void replace(ForwardIt first, ForwardIt last, const T& old_value, const T& new_value){for(; first != last;++first){if(*first == old_value){*first = new_value;}}}
Second version
template<class ForwardIt, class UnaryPredicate, class T>void replace_if(ForwardIt first, ForwardIt last, UnaryPredicate p, const T& new_value){for(; first != last;++first){if(p(*first)){*first = new_value;}}}

Beispiel

Der folgende Code auf den ersten ersetzt alle Vorkommen von 8 mit 88 in einem Vektor von ganzen Zahlen. Dann ersetzt alle Werte kleiner als 5 mit 55 .

Original:

The following code at first replaces all occurrences of 8 with 88 in a vector of integers. Then it replaces all values less than 5 with 55.

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 <array>#include <iostream>#include <functional>   int main(){std::array<int, 10> s{5, 7, 4, 2, 8, 6, 1, 9, 0, 3};   std::replace(s.begin(), s.end(), 8, 88);   for(int a : s){std::cout<< a <<" ";}std::cout<<'\n';   std::replace_if(s.begin(), s.end(), std::bind(std::less<int>(), std::placeholders::_1, 5), 55);for(int a : s){std::cout<< a <<" ";}std::cout<<'\n';}

Output:

5 7 4 2 88 6 1 9 0 3 5 7 55 55 99 6 55 9 55 55

Siehe auch

replace_copy replace_copy_if	Kopiert einen Bereich, ersetzenden Elemente erfüllen bestimmte Kriterien mit einem anderen Wert Original: copies a range, replacing elements satisfying specific criteria with another value The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (Funktions-Template)