STL-style iterator

Our deque, stack and bag containers implement the random-access iterators in the style of STL's random-access iterators.

Example

#include <iostream>
#include <string>
#include <assert.h>

#include "chunkedseq.hpp"

int main(int argc, const char * argv[]) {
  
  using mydeque_type = pasl::data::chunkedseq::bootstrapped::deque<int>;
  using iterator = typename mydeque_type::iterator;
  
  mydeque_type mydeque = { 0, 1, 2, 3, 4 };
  
  std::cout << "mydeque contains:";
  iterator it = mydeque.begin();
  while (it != mydeque.end())
    std::cout << " " << *it++;
  
  std::cout << std::endl;
  
  return 0;
  
}

Output

mydeque contains: 0 1 2 3 4

Segment access

As a bonus, the iterator classes support access to segments via the method get_segment. For more information on this operation, see the documentation on segments.