Creating my own Iterators

by

/EDIT: I see, an own iterator is actually necessary here (I misread the question first). Still, I’m letting the code below stand because it can be useful in similar circumstances.

Is an own iterator actually necessary here? Perhaps it’s sufficient to forward all required definitions to the container holding the actual Points:

// Your class `Piece`
class Piece {
private:
    Shape m_shape;

public:

    typedef std::vector<Point>::iterator iterator;
    typedef std::vector<Point>::const_iterator const_iterator;

    iterator begin() { return m_shape.container.begin(); }

    const_iterator begin() const { return m_shape.container.begin(); }

    iterator end() { return m_shape.container.end(); }

    const_iterator end() const { return m_shape.const_container.end(); }
}

This is assuming you’re using a vector internally but the type can easily be adapted.

More Related Contents:

  1. C++ – Find numbers between first and last negative numbers in Array
  2. What happens if you call erase() on a map element while iterating from begin to end?
  3. How to correctly implement custom iterators and const_iterators?
  4. How to find the index of current object in range-based for loop?
  5. What is the most effective way to get the index of an iterator of an std::vector?
  6. Vector erase iterator
  7. How to use an iterator?
  8. Removing item from vector while iterating?
  9. How do I get the index of an iterator of an std::vector?
  10. Sorting a vector in descending order
  11. Iterating C++ vector from the end to the beginning
  12. What is the difference between const_iterator and non-const iterator in the C++ STL?
  13. Custom Iterator in C++
  14. how portable is end iterator decrement?
  15. Problem with std::map::iterator after calling erase()
  16. Are non dereferenced iterators past the “one past-the-end” iterator of an array undefined behavior?
  17. Can raw pointers be used instead of iterators with STL algorithms for containers with linear storage?
  18. How to remove constness of const_iterator?
  19. How to avoid code duplication implementing const and non-const iterators?
  20. Are const_iterators faster?
  21. Can I increment an iterator by just adding a number?
  22. Erasing vector::end from vector
  23. Get a reverse iterator from a forward iterator without knowing the value type
  24. Using an iterator to Divide an Array into Parts with Unequal Size
  25. How to increment an iterator by 2?
  26. Types of iterator : Output vs. Input vs. Forward vs. Random Access Iterator
  27. Contiguous iterator detection
  28. How to erase & delete pointers to objects stored in a vector?
  29. How can I copy one map into another using std::copy?
  30. C++ template typename iterator

Leave a Comment