Iterators in C++ are objects that are used to access and traverse elements of containers like vectors, lists, and maps in the Standard Template Library (STL).<\/p>\n\n\n\n
An iterator works like a pointer. It points to elements inside a container and allows you to move through them one by one.<\/p>\n\n\n\n
Iterators are useful because they:<\/p>\n\n\n\n
container_type::iterator it;<\/code><\/pre>\n\n\n\nIterator with Vector<\/h1>\n\n\n\n#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v = {10, 20, 30};
vector<int>::iterator it;
for (it = v.begin(); it != v.end(); it++) {
cout << *it << endl;
}
return 0;
}<\/code><\/pre>\n\n\n\nOutput<\/h2>\n\n\n\n10
20
30<\/code><\/pre>\n\n\n\nHow Iterators Work<\/h1>\n\n\n\n\nbegin()<\/code> points to the first element<\/li>\n\n\n\nend()<\/code> points just after the last element<\/li>\n\n\n\n*it<\/code> accesses the value<\/li>\n\n\n\nit++<\/code> moves to next element<\/li>\n<\/ul>\n\n\n\nSimplified Iterator Loop<\/h1>\n\n\n\n
Modern C++ uses auto<\/code> keyword.<\/p>\n\n\n\nfor (auto it = v.begin(); it != v.end(); it++) {
cout << *it << endl;
}<\/code><\/pre>\n\n\n\nIterator with List<\/h1>\n\n\n\n#include <iostream>
#include <list>
using namespace std;
int main() {
list<int> l = {1, 2, 3};
for (auto it = l.begin(); it != l.end(); it++) {
cout << *it << endl;
}
return 0;
}<\/code><\/pre>\n\n\n\nIterator with Map<\/h1>\n\n\n\n#include <iostream>
#include <map>
using namespace std;
int main() {
map<string, int> m;
m[\"Ali\"] = 80;
m[\"Ahmed\"] = 90;
for (auto it = m.begin(); it != m.end(); it++) {
cout << it->first << \" : \" << it->second << endl;
}
return 0;
}<\/code><\/pre>\n\n\n\nOutput<\/h2>\n\n\n\nAli : 80
Ahmed : 90<\/code><\/pre>\n\n\n\nTypes of Iterators<\/h1>\n\n\n\n\n- Input Iterator<\/li>\n\n\n\n
- Output Iterator<\/li>\n\n\n\n
- Forward Iterator<\/li>\n\n\n\n
- Bidirectional Iterator<\/li>\n\n\n\n
- Random Access Iterator<\/li>\n<\/ul>\n\n\n\n
Important Iterator Operations<\/h1>\n\n\n\nOperation<\/th> Meaning<\/th><\/tr><\/thead> *it<\/code><\/td>Access value<\/td><\/tr> it++<\/code><\/td>Move forward<\/td><\/tr> it--<\/code><\/td>Move backward (some containers)<\/td><\/tr> it-><\/code><\/td>Access object members<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nWhy Iterators are Important<\/h1>\n\n\n\n
Iterators are important because they:<\/p>\n\n\n\n
\n- Work with all STL containers<\/li>\n\n\n\n
- Replace indexing in complex structures<\/li>\n\n\n\n
- Make code generic and reusable<\/li>\n\n\n\n
- Help in efficient traversal<\/li>\n<\/ul>\n\n\n\n
Difference Between Iterator and Pointer<\/h1>\n\n\n\nIterator<\/th> Pointer<\/th><\/tr><\/thead> Works with STL containers<\/td> Works with memory addresses<\/td><\/tr> Safer and more flexible<\/td> Low-level access<\/td><\/tr> Supports different containers<\/td> Works mainly with arrays<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nReal-Life Example<\/h1>\n\n\n\n
Think of iterators like reading pages of a book:<\/p>\n\n\n\n
\n- Start from first page<\/li>\n\n\n\n
- Move page by page<\/li>\n\n\n\n
- Stop at the end<\/li>\n<\/ul>\n\n\n\n
This is how iterators move through data.<\/p>\n\n\n\n
Applications of Iterators<\/h1>\n\n\n\n
Iterators are used in:<\/p>\n\n\n\n
<\/strong> <\/p> <\/div> <\/div>\n\n\n\n
\n- Data traversal in STL containers<\/li>\n\n\n\n
- Algorithms like sorting and searching<\/li>\n\n\n\n
- Complex data structure handling<\/li>\n\n\n\n
- Generic programming<\/li>\n<\/ul>\n\n\n\n
Conclusion<\/h2>\n\n\n\n
Iterators in C++ are powerful tools used to traverse and access elements in STL containers. They provide a standard and flexible way to work with different data structures, making code more efficient and reusable.<\/p>\n\n\n