Vectors, iterators, and std :: find

Question

Is it possible to use different types of iterators in different vectors? Or is there a function that returns the position of an element in a vector as an integer?

std::vector<DWORD>::iterator it;        // Iterator

// monsterQueue is a <DWORD> vector

it = std::find(bot.monsterQueue.begin(), bot.monsterQueue.end(), object);   
// Check do we have the object in the queue

if(it != bot.monsterQueue.end())    // If we do have it
{
    bot.monsterDists.at(it) = mobDist; // monsterDists is <int> vector
    bot.monsterCoordX.at(it) = PosX; // monsterCoordX is <int> vector
    bot.monsterCoordY.at(it) = PosY; // monsterCoordY is <int> vector too
}

Something in the sample code, does anyone have pointers?

Answer 1

Try

std::vector<DWORD>::iterator it;        // Iterator

// monsterQueue is a <DWORD> vector

it = std::find(bot.monsterQueue.begin(), bot.monsterQueue.end(), object);   
// Check do we have the object in the queue

if(it != bot.monsterQueue.end())    // If we do have it
{

size_t idx = it - bot.monsterQueue.begin ()

    bot.monsterDists.at(idx) = mobDist; // monsterDists is <int> vector
    bot.monsterCoordX.at(idx) = PosX; // monsterCoordX is <int> vector
    bot.monsterCoordY.at(idx) = PosY; // monsterCoordY is <int> vector too
}

It would also probably be better to create a structure with 4 members of the “monster”, monsterDist and X coordinates and Y coordinates and save struct objects in a vector.

Answer 2

index = std::distance( monsterQueue.begin(), it );

Answer 3

it - bot.monsterQueue.begin()

.

Answer 4

std::vectors:

DWORD find_this = 0x0;
int pos = 0;
for (; i<monsterQueue.size(); ++i)
{
    if (monsterQueue[i]==find_this)
        break;
}

, pos , , .. find_this. , , find_this .

Answer 5

Have you ever thought about changing the base monsterQueue type for an object that contains or has links / pointers to monsterDists, etc.