C++ program to find the type of the given iterator
Last Updated :
23 Dec, 2022
Given a program that uses an iterator, the task is to find the type of iterator used.
Examples:
Input : vector.begin()
Output : Random_Access Iterator
Input : list.begin()
Output : Bidirectional Iterator
There are namely five types of iterators present in the C++ Standard Library which are mentioned below:
- Forward Iterator in C++
- Bidirectional_Iterators in C++
- Input iterators in C++
- Output iterator in C++
- Random_access iterators in C++
Approach:
- Iterator type can be checked by using typeid. typeid is a C++ language operator which returns type identification information at run time. It basically returns a type_info object, which is equality-comparable with other type_info objects.
- Along with it use iterator traits. Traits class defines properties of iterators. Standard algorithms determine certain properties of the iterators passed to them and the range they represent by using the members of the corresponding iterator_traits instantiation.
- Also a iterator category is passed which defines the iterator category the iterator belongs to.
There are five type of tags namely: input_iterator_tag, output_iterator_tag, forward_iterator_tag, bidirectional_iterator_tag, random_access_iterator_tag.
- typename is used along with it to provide a type to the iterator during instantiation.
- Now if the iterator category of the input iterator matches the existing iterator categories the result is displayed.
#include <bits/stdc++.h>
using namespace std;
template < class T>
string get_iterator_type(T it)
{
if ( typeid ( typename iterator_traits<T>::iterator_category)
== typeid (input_iterator_tag))
return "Input" ;
else if ( typeid ( typename iterator_traits<T>::iterator_category)
== typeid (output_iterator_tag))
return "Output" ;
else if ( typeid ( typename iterator_traits<T>::iterator_category)
== typeid (forward_iterator_tag))
return "Forward" ;
else if ( typeid ( typename iterator_traits<T>::iterator_category)
== typeid (bidirectional_iterator_tag))
return "Bidirectional" ;
else if ( typeid ( typename iterator_traits<T>::iterator_category)
== typeid (random_access_iterator_tag))
return "Random_Access" ;
return "Missing" ;
}
int main()
{
vector< int > v;
auto it = v.begin();
cout << get_iterator_type(it) << " Iterator\n" ;
return 0;
}
|
Output:
Random_Access Iterator
Time-Complexity: O(1) to find the iterator type
Share your thoughts in the comments
Please Login to comment...