At the previous lesson we have defined a variable of type vector<float>, as an equivalent array, the size of which we can arbitrarily change the course of the execution of code. But this does not mean (as well as vectors for classical C ++), we can thus create only dynamic arrays of simple built-in types. Type of item vector It can be arbitrary and arbitrarily complex! For example, we could describe as a student group:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 | #include <iostream> #include <vector> // подключаем необходимую библиотеку using namespace std; struct student { char fio[80]; short age; // конструктор объекта student(const char* fio, short age) : age(age) { // присваиваем полю age,значение параметра age // в поле fio структуры копируем параметр fio, который указывается при создании объекта strncpy_s(this->fio, fio, sizeof(this->fio)); } // ... }; // перегружаем оператор для форматирования вывода объектов inline ostream& operator <<(ostream& out, const student& obj) { return out << obj.fio << "\t: " << obj.age; } int main(void) { setlocale(LC_ALL, "rus"); vector<student> group; // метод push_back() добавляет новую запись в конец вектора group.push_back(student("Иванов И.И.", 20)); group.push_back(student("Петров П.П.", 21)); group.push_back(student("Сидоров С.С.", 19)); for (int i = 0; i < group.size(); i++) cout << group[i] << endl; } |
In this example,, inter alia, we applied this pointer and operator overloading. I leave links to you, if someone needs to refresh it in memory.
Vector template class (and any STL container) may be, in its turn, container STL. For example vector< vector<int> > or vector< vector< vector<int> > > (do not forget the space between the closing bracket ‘>‘ - It is a feature of syntactic parser). Thus we can, for example, create a class of triangular matrices:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 | #include <vector> #include <cstring> #include <iostream> using namespace std; struct trimatrix : vector< vector<double> > { // треугольная матрица trimatrix(int n) { // n - размер while (n > 0) { vector<double> row(n); for (int i = 0; i < n; i++) row[i] = n - i; push_back(row); n--; } } }; inline ostream& operator <<(ostream& out, const trimatrix& obj) { for (int i = 0; i < obj.size(); i++) { for (int j = 0; j < obj[i].size(); j++) cout << obj[i][j] << " "; cout << endl; } return out; } int main(void) { cout << trimatrix(4); } |
The next level of our going into vectors technique, and STL containers in general, It is the concept of iterator. Iterator - the central concept to work with STL containers. iterator – it is an abstraction, which is used to iterate (iterate) STL elements in a container and providing access to the individual elements.
iterator p It is not a pointer, but, at first, you can conditionally consider it as something similar in appearance: *p will denote the value of the data under the current iterator, p the iterator to the next item in the container, and p– (when this is permissible) - In the previous item. For different types of containers, corresponding iterators may apply to one of 5 categories: inputs, weekend, unidirectional, bidirectional and random access.
vectors iterators - an iterator direct access. That is why vectors can be indexing operation. these, enough surface, Knowledge about iterators us enough, to start working with them.
Reproduce in terms of iterators with the task of finding all the prime numbers, not exceeding N (sieve of Eratosthenes), we have already decided earlier Technology C ++ arrays:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 | #include <iostream> #include <vector> #include <string> using namespace std; int main(int argc, char **argv) { int k, n; // верхняя граница vector<bool> a(n = stoi(argv[1]) + 1, true); a[0] = a[1] = false; for (k = 2; k < n; k++) for (vector<bool>::iterator j = a.begin() + k + k; j < a.end(); j += k) *j = false; const int line = 10; // выводить чисел в строку k = 0; for (vector<bool>::iterator j = a.begin(); j < a.end(); j++) if (*j) { cout << j - a.begin() << "\t"; if (0 == ++k % line) cout << endl; } if (k % line != 0) cout << endl; return 0; } |
As can easily be seen from the description vector<bool>::iterator, iterator that keeps a kind of container, which refers to, and the type of this container. This requires quite cumbersome to write an accurate description of the type of iterator. But the latest C ++ 11 standard introduced the concept hatchability type: if the desired object type is derived from the context of its use, the type of the object can be declared descriptor auto (output type). Then the string 16 the code shown above can be written as:
1 | for( auto j = a.begin(); j < a.end(); j++ ) |
Finally, vectors (and for all containers, having bi-directional iterators, as mentioned above) It can be defined Reverse iterators, are not moved from the beginning to the end of the container, and vice versa - from the end to the beginning. This iterator must be declared as a very different type of, for example:
1 | vector<bool>::reverse_iterator i; |
But here, we can rely on type inference, as in the following example:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | #include <iostream> #include <vector> using namespace std; int main(void) { float data[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 }; int n = sizeof(data) / sizeof(data[0]); // кол-во элементов vector<float> array(data, data + n); // вектор из массива for (auto j = array.begin(); j < array.end(); j++) cout << *j << (j + 1 == array.end() ? "\n" : " "); for (auto j = array.rbegin(); j < array.rend(); j++) cout << *j << (j + 1 == array.rend() ? "\n" : " "); } |
All arising questions to ask in the comments lesson.
Finally, the fact that at the current CPP, keep it up
Passion is wonderful compassion , but a fierce illusion forces us to doubt that , that one passion for a cute divorce is too . Deciding on such a significant leap , like an engagement , you need to try methodologically to assess the validity of your decision .