Is an iterator in C++ a pointer?

by

The short answer is:

  • Pointer is a kind of iterator.
  • Pointer can be therefore used as an iterator.
  • Pointer has properties other than iterator.

History

Historically, we have C pointer, and it is adapted into C++ when C++ is invented. Pointer represents a location in memory, therefore can be used as a location in an array.

Later, in 1990s, an idea called “iterator concept” is introduced to C++. The “iterator concept” is related to a library called STL (which is later absorbed into the Standard Library) and a paradigm called “generic programming”. The iterator concept is inspired from C pointer to represent a location in containers like vector, deque and others, just like how C pointer represent location in array. The iterator concept is carefully engineered to be compatible with C pointer, hence we can nowadays say C pointer models iterator concept.

Iterator concept

A simplified way to understand iterator concept is that, if a data type suppports a list of operations and behaviours, such that it represent a location in a container, and enable some kind of access to the element, it can be called an iterator.

With carefull design of iterator concept, C pointer fulfill that list. Pointer is therefore a kind of iterator.

Iterator concept being just a set of requirement on types, means that you can create your own iterator through C++ power of data abstraction.

Other properties of pointer

Pointer exhibits other properties, and they are not related to iterator concept.

A significant use of pointer is to express reference semantics, i.e. to refer to an object in a remote memory location. This usage of pointer is later considered unsafe, and causes the invention of “smart pointer”. By comparing smart pointers and iterators, we can find that they are totally unrelated concepts.

Another use of pointer is to refer to a raw memory location. This is completely unsafe for application programming, but is a essential tool for microcontroller programming to manipulate hardware.

More Related Contents:

  1. How to use an iterator?
  2. How are iterators and pointers related?
  3. Are non dereferenced iterators past the “one past-the-end” iterator of an array undefined behavior?
  4. Can raw pointers be used instead of iterators with STL algorithms for containers with linear storage?
  5. address of operator and pointer operator [closed]
  6. How to pass objects to functions in C++?
  7. How does dereferencing of a function pointer happen?
  8. determine size of array if passed to function
  9. Dynamically allocating an array of objects
  10. What happens if you call erase() on a map element while iterating from begin to end?
  11. What is the size of a pointer?
  12. Why does int pointer ‘++’ increment by 4 rather than 1?
  13. C++ pass an array by reference
  14. Why are function pointers and data pointers incompatible in C/C++?
  15. What is the most effective way to get the index of an iterator of an std::vector?
  16. Vector erase iterator
  17. C++ standard: dereferencing NULL pointer to get a reference? [duplicate]
  18. Checking if this is null
  19. Sorting a vector in descending order
  20. Two string literals have the same pointer value?
  21. how portable is end iterator decrement?
  22. Does accessing a declared non-volatile object through a volatile reference/pointer confer volatile rules upon said accesses?
  23. What does “void *(*)(void *)” mean in C++?
  24. Is pointer comparison undefined or unspecified behavior in C++?
  25. What is the uintptr_t data type?
  26. Pointer to array of unspecified size “(*p)[]” illegal in C++ but legal in C
  27. About Pointers To Functions in function declarations
  28. How to print member function address in C++
  29. C++: Why is const_cast evil?
  30. How to pass a 2d array through pointer in c [duplicate]

Leave a Comment