Reply to thread

Message: [QUOTE="Gianni Mariani, post: 1513460"] I believe that std:vector guatentees contiguous elements hence the follwoing holds true: std::vector<T> arr; std::vector<T>::iterator i1; .... int indexof_i1 = &(*i1) - &(*arr.begin()); (iff i1 is an iterator of the arr vector and the vector is not empty) You can often use pointers instead of iterators in many stl algorithms. If you're going to be searching for elements very frequently, it may be that you can use a hashing algorithm and that might be faster. Hope this helps. [/QUOTE]