Library: Algorithms
Function
An algorithm that substitutes elements in a sequence with new values, and moves the revised sequence into result
#include <algorithm>
namespace std {
template <class InputIterator,
class OutputIterator,
class T>
OutputIterator replace_copy(InputIterator start,
InputIterator finish,
OutputIterator result,
const T& old_value,
const T& new_value);
}
The replace_copy() algorithm leaves the original sequence intact and places the revised sequence into result. For the range [start, finish), the algorithm compares elements referred to by iterator i with old_value. If *i does not compare equal to old_value, then replace_copy() copies *i to result+(start-i). If *i==old_value, then replace_copy() copies new_value to result+(start-i). replace_copy() returns result+(finish-start).
Exactly finish - start comparisons between values are done.
//
// replace.cpp
//
#include <algorithm> // for replace, replace_if, replace_copy, ...
#include <vector> // for vector
#include <iterator> // for ostream_iterator
#include <functional> // for not1, unary_function
#include <iostream> // for cout, endl
struct is_prime: public std::unary_function<short, bool>
{
bool operator() (const short&) const;
};
bool is_prime::operator() (const short &a) const
{
// all primes smaller than 256
static const unsigned short primes[] = {
2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 23, 25, 29, 31,
35, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 79,
83, 89, 97, 101, 103, 107, 109, 113, 121, 127, 131,
137, 139, 143, 149, 151, 157, 163, 167, 169, 173, 179,
181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239,
241, 251
};
const unsigned short *end = primes + sizeof primes /
sizeof *primes;
// search primes for a divisor
for (const unsigned short *p = primes; p != end; ++p)
if (0 == a % *p)
return false;
return 0 != a;
}
int main ()
{
typedef std::vector<short, std::allocator<short> > Vector;
typedef std::ostream_iterator<short, char,
std::char_traits<char> >
Iter;
// Populate a vector with arbitrary values.
Vector v;
for (Vector::value_type n = 11111; n != 11211; ++n)
v.push_back (n);
// Print out original vector.
std::cout << "Original sequence:\n ";
std::copy (v.begin (), v.end (), Iter (std::cout, " "));
std::cout << std::endl << std::endl;
// Replace one number with another.
std::replace (v.begin (), v.end (), 11199, 11211);
// Print out the new vector.
std::cout << "Sequence after replace:\n ";
std::copy (v.begin (), v.end (), Iter (std::cout, " "));
std::cout << std::endl << std::endl;
// Replace all numbers that aren't primes with zeros.
std::replace_if (v.begin (), v.end (),
std::not1 (is_prime ()), 0);
// Print out the remaining vector.
std::cout << "After replace_if:\n ";
std::copy (v.begin (), v.end (), Iter (std::cout, " "));
std::cout << std::endl << std::endl;
// Replace zeros with ones.
std::cout << "Sequence replace_copy-ed to cout:\n ";
std::replace_copy (v.begin (), v.end (),
Iter (std::cout, " "), 0, 1);
std::cout << std::endl << std::endl;
// A simple example of replace_copy_if.
std::cout << "Sequence replace_copy_if-ed to cout:\n ";
std::replace_copy_if (v.begin (), v.end (),
Iter (std::cout, ""),
is_prime (), 1);
std::cout << std::endl;
return 0;
}
Program Output:
Original sequence:
11111 11112 11113 11114 11115 11116 11117 11118 11119
11120 11121 11122 11123 11124 11125 11126 11127 11128 11129
11130 11131 11132 11133 11134 11135 11136 11137 11138 11139
11140 11141 11142 11143 11144 11145 11146 11147 11148 11149
11150 11151 11152 11153 11154 11155 11156 11157 11158 11159
11160 11161 11162 11163 11164 11165 11166 11167 11168 11169
11170 11171 11172 11173 11174 11175 11176 11177 11178 11179
11180 11181 11182 11183 11184 11185 11186 11187 11188 11189
11190 11191 11192 11193 11194 11195 11196 11197 11198 11199
11200 11201 11202 11203 11204 11205 11206 11207 11208 11209
11210
Sequence after replace:
11111 11112 11113 11114 11115 11116 11117 11118 11119
11120 11121 11122 11123 11124 11125 11126 11127 11128 11129
11130 11131 11132 11133 11134 11135 11136 11137 11138 11139
11140 11141 11142 11143 11144 11145 11146 11147 11148 11149
11150 11151 11152 11153 11154 11155 11156 11157 11158 11159
11160 11161 11162 11163 11164 11165 11166 11167 11168 11169
11170 11171 11172 11173 11174 11175 11176 11177 11178 11179
11180 11181 11182 11183 11184 11185 11186 11187 11188 11189
11190 11191 11192 11193 11194 11195 11196 11197 11198 11211
11200 11201 11202 11203 11204 11205 11206 11207 11208 11209
11210
After replace_if:
0 0 11113 0 0 0 11117 0 11119 0 0 0 0 0 0 0 0 0 0 0 11131
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 11149 0 0 0 0 0 0 0 0 0
11159 0 11161 0 0 0 0 0 0 0 0 0 11171 0 11173 0 0 0 11177 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 11197 0 0 0 0 0 0 0 0 0 0 0
0 0
Sequence replace_copy-ed to cout:
1 1 11113 1 1 1 11117 1 11119 1 1 1 1 1 1 1 1 1 1 1 11131
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 11149 1 1 1 1 1 1 1 1 1
11159 1 11161 1 1 1 1 1 1 1 1 1 11171 1 11173 1 1 1 11177 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 11197 1 1 1 1 1 1 1 1 1 1 1
1 1
Sequence replace_copy_if-ed to cout:
00100010100000000000100000000000000000100000000010100000000010
10001000000000000000000010000000000000
replace(), replace_if(), replace_copy_if()
ISO/IEC 14882:1998 -- International Standard for Information Systems -- Programming Language C++, Section 25.2.4