...
In this example, the iterator pos is invalidated after the call to insert, and subsequent loop iterations have undefined behavior.
| Code Block | ||||
|---|---|---|---|---|
| ||||
double data[5] = { 2.3, 3.7, 1.4, 0.8, 9.6 };
deque<double> d;
deque<double>::iterator pos = d.begin();
for (size_t i = 0; i < 5; ++i) {
d.insert(pos++, data[i] + 41);
}
|
...
Update pos each time insert is called to keep the iterators valid, and then increment it:
| Code Block | ||||
|---|---|---|---|---|
| ||||
double data[5] = { 2.3, 3.7, 1.4, 0.8, 9.6 };
deque<double> d;
deque<double>::iterator pos = d.begin();
for (size_t i = 0; i < 5; ++i) {
pos = d.insert(pos, data[i] + 41);
++pos;
}
|
...
Use one of the STL algorithms.
| Code Block | ||||
|---|---|---|---|---|
| ||||
double data[5] = { 2.3, 3.7, 1.4, 0.8, 9.6 };
deque<double> d;
transform(data, data+5,
inserter(d, d.begin()),
bind2nd(plus<int>(), 41));
|
...