Find the position of an elemant in a vector

[Sunil Varma]

Hi,

I've to write a function similar to this.

int process(const vector<int>& vct,int key)
{
// Here I've to find the position of key in the vector and do some
processing.
}

Is there any fucntion in algorithm which directly gives the position of
an elemant.

find() returns an iterator but not the postion of the elemant.
Is there any function equivalent to indexof()?

Regards,
Sunil

[mlimber]

Sunil Varma wrote:

Hi,

I've to write a function similar to this.

int process(const vector<int>& vct,int key)
{
// Here I've to find the position of key in the vector and do some
processing.
}

Is there any fucntion in algorithm which directly gives the position of
an elemant.

find() returns an iterator but not the postion of the elemant.
Is there any function equivalent to indexof()?

Use the result of find() - vct.begin().

Cheers! --M

[Sunil Varma]

mlimber wrote:

Sunil Varma wrote:

Hi,

I've to write a function similar to this.

int process(const vector<int>& vct,int key)
{
// Here I've to find the position of key in the vector and do some
processing.
}

Is there any fucntion in algorithm which directly gives the position of
an elemant.

find() returns an iterator but not the postion of the elemant.
Is there any function equivalent to indexof()?

Use the result of find() - vct.begin().

Cheers! --M

Hi limber,

It worked fine.

Thank you.

[IndyStef]

There is a more 'official' method:

the 'distance' function is guaranteed to work, whereas the subtraction
is not. Especially when you swap your vector with a list at some
point, the subtraction will give you a compiler error, whereas
'distance' will give you the right answer. The subtraction can only
work on random access iterators.
For vectors, however, the subtraction is fine and works.

Stefan

mlimber wrote:

Sunil Varma wrote:

Hi,

I've to write a function similar to this.

int process(const vector<int>& vct,int key)
{
// Here I've to find the position of key in the vector and do some
processing.
}

Is there any fucntion in algorithm which directly gives the position of
an elemant.

find() returns an iterator but not the postion of the elemant.
Is there any function equivalent to indexof()?

Use the result of find() - vct.begin().

Cheers! --M

[Andrew Koenig]

"Sunil Varma" <su*******@gmai l.comwrote in message
news:11******** **************@ k70g2000cwa.goo glegroups.com.. .

find() returns an iterator but not the postion of the elemant.

How's that again? An iterator *is* the position of the element.

[eriwik]

On 16 Nov, 21:08, "Andrew Koenig" <[e-mail] ote:

"Sunil Varma" <sunil....@gmai l.comwrote in messagenews:11* *************** ******@k70g2000 cwa.googlegroup s.com...

find() returns an iterator but not the postion of the elemant.How's that again? An iterator *is* the position of the element.

Not quite, more of a pointer to the element, not it's position. It does
not tell you anything about where in a container (of any type) the
element is. It's not much of a differance but think of it like this:
take the first element of a list and take an iterator to it, the insert
a new element at the beginning of the list, the iterator still points
to the original element even though it has changed position in the
list.

--
Erik Wikström