Iterators are used by the algorithms to carry out operations. Iterators are smart pointers. They
are allowed to contain values that indicate one of the statuses of iterators as described in Table
20.10. Each iterator type supports all the attributes listed in Table 20.9 and shown in Figure 20.3.
Iterators can be incremented, decremented, and their limits are up to the capacity of the contain-
ers. Containers have member functions that return iterators.
20.3 Write a program to transverse list using iterator.
#include<iostream>
#include<list>
using namespace std;
typedef list<int> num_list;
int main()
{
num_list num;
for (int j=0;j<=5;++j) ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.