sql reporting services qr code TeamLRN in Software

Generation UPC - 13 in Software TeamLRN

APP. D]

iterator insert(iterator // inserts a copy of the // precondition: begin() // postcondition: size()

p, const T& x); element x at position p; returns p; <= p <= end(); has been incremented;

iterator erase(iterator p); // removes the element at position p; returns p // precondition: begin() <= p <= end(); // postcondition: size() has been decremented; iterator erase(iterator p1, iterator p2); // removes the elements from position p1 to the position before p2; // returns p1; // precondition: begin() <= p1 <= p2 <= end(); // postcondition: size() has been decreased by int(p2-p1); void clear(); // removes all the elements from this vector; // postcondition: size() == 0;

#include <iostream> #include <vector> using namespace std; typedef vector<int>::iterator It; int main() { vector<int> v(4); for (int i=0; i<4; i++) v[i] = 222*i + 333; cout << "Using the iterator it in a for loop:\n"; for (It it=v.begin(); it!=v.end(); it++) cout << "\t*it=" << *it << "\n"; cout << "Using the iterator p in a while loop:\n"; It p=v.begin(); while(p!=v.end()) cout << "\t*p++=" << *p++ << "\n"; } Using the iterator it in a for loop: *it=333 *it=555 *it=777 *it=999 Using the iterator p in a while loop: *p++=333 *p++=555 *p++=777 *p++=999

The vector v has 4 elements: 333, 555, 777, and 999. The second for loop uses the iterator it to traverse the vector v from beginning to end, accessing each of its elements with *it. The while loop has the same effect using *p.

#include <iostream> #include <vector> using namespace std; typedef vector<int>::reverse_iterator RIt; int main() { vector<int> v(4); for (int i=0; i<4; i++) v[i] = 222*i + 333; cout << "Using the reverse iterator rit in a for loop:\n"; for (RIt rit=v.rbegin(); rit!=v.rend(); rit++) cout << "\t*rit=" << *rit << "\n"; cout << "Using the reverse iterator rp in a while loop:\n"; RIt rp=v.rbegin(); while(rp!=v.rend()) cout << "\t*rp++=" << *rp++ << "\n"; } Using the reverse iterator rit in a for loop: *rit=999 *rit=777 *rit=555 *rit=333 Using the reverse iterator rp in a while loop: *rp++=999 *rp++=777 *rp++=555 *rp++=333 The vector v has 4 elements: 333, 555, 777, and 999 (the same as in Example D.1). The second for loop uses the reverse iterator rit to traverse the vector v backwards, accessing each of its elements with *rit. The while loop has the same effect using *rp.

#include <iostream> #include <vector> using namespace std; typedef vector<int> Vector; typedef Vector::iterator It; void print(const Vector&); int main() { Vector v(4); for (int i=0; i<4; i++) v[i] = 222*i + 333; print(v); It it = v.insert(v.begin()+2,666); print(v); cout << "*it=" << *it << "\n"; }

APP. D]

void print(const Vector& v) { cout << "size=" << v.size() << ": (" << v[0]; for (int i=1; i<v.size(); i++) cout << "," << v[i]; cout << ")\n"; } size=4: (333,555,777,999) size=5: (333,555,666,777,999) *it=666

The vector v has 4 elements: 333, 555, 777, and 999 (the same as in Example D.1). The second for loop uses the reverse iterator rit to traverse the vector v backwards, accessing each of its elements with *rit. The while loop has the same effect using *rp.

#include <iostream> #include <vector> using namespace std; typedef vector<int> Vector; typedef Vector::iterator It; void print(const Vector&); int main() { Vector v(9); for (int i=0; i<9; i++) v[i] = 111*i + 111; print(v); It it=v.begin(); fill(it+2,it+5,400); // replaces v[2:5] with 400 print(v); reverse(it+4,it+7); // print(v); iter_swap(it+6,it+8); print(v); sort(it+4,it+9); print(v); } void print(const Vector& v) { cout << "size=" << v.size() << ": (" << v[0]; for (int i=1; i<v.size(); i++) cout << "," << v[i]; cout << ")\n"; } size=9: (111,222,333,444,555,666,777,888,999) size=9: (111,222,400,400,400,666,777,888,999) size=9: (111,222,400,400,777,666,400,888,999) size=9: (111,222,400,400,777,666,999,888,400) size=9: (111,222,400,400,400,666,777,888,999)