The value types of the forward iterators must be less-than comparable to be ordered. That is, given two elements, you can determine either that one is less than the other, or that they're equivalent. (Here, equivalent means that neither is less than the other.) This comparison results in an ordering between the nonequivalent elements.

### Example

The range referenced must be valid. All pointers must be dereferenceable and, within the sequence, the last position must be reachable from the first by incrementation.

### Example

int main()

{

// Replace elements with a value of 7 with a value of 700

}

```

```Output

```

## <a name="replace_copy"></a> `replace_copy`

The `operator==` used to determine the equality between elements must impose an equivalence relation between its operands.

### Example

int main()

{

using namespace std;

cout << ")." << endl;

cout << ")." << endl;

cout << ")." << endl;

}

```

```Output

```

## <a name="replace_copy_if"></a> `replace_copy_if`

#include <algorithm>

#include <iostream>

{

return value > 6;

}

int main()

{

using namespace std;

cout << ")." << endl;

// Replace elements satisfying the predicate greater6

// with a value of 70

}

```

```Output

elements satisfying the greater6 predicate is:

```

## <a name="reverse"></a> `reverse`