Question

I have a need to wrap a vector iterator, but don’t like the idea to rewrite it from scratch. And I can’t subclass it as far as vector iterator doesn’t seem to be cross-platform. At least gnu and ibm ones look different.

What I want to do is the following:

class MyContainer {
    vector<double> data;
    vector<int> indices;

    iterator
    begin()
    { return my_iterator(data, indices.begin()); }

    iterator
    end()
    { return my_iterator(data, indices.end()); }
}

MyContainer  cont;

Where indices vector contains integer positions within the data vector. Data is supposed to be much much bigger than the indices.

So I need an iterator that can go through the indices in any direction like a normal vector iterator does with the only exception: it must return a value of data vector when the value is going to be accessed. e.g.:

for(MyContainer::iterator it = cont.begin(); it != cont.end(); it++) {
    cout << *it << endl; // values of data should appear here
}

Basically it should look like a normal collection for the std world. You can iterate it in whatever direction you want, you can sort it, run unique, find_if, etc…

any simple solution?

Answer 1

This looks a lot like a permutation_iterator, one of the “built in” adapters from the Boost.Iterator Library

See this example (modified from the Boost docs) on codepad.