By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
445,958 Members | 2,110 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 445,958 IT Pros & Developers. It's quick & easy.

Is this a valid used of STL vector::erase()

P: n/a
Hi all,

I recently came across the following code:

// some data
struct Data { // ... some data };

// a list to hold the data
vector<Data> dataList;

// a function to erase an element inside the datalist
void destroyDataAtIndex(int index)
{
dataList.erase( &dataList[index] ); //(a)
}

Is line (a) valid? If so, how does that work since the function
declaration of erase is erase(iterator iter)? Does it automatically
converts the address of the element to an iterator? or it makes the
assumption that an iterator is a typedef of pointer?

Also, I created a toy program with the above code snipplet, from the
test runs, some times the program will crashed. Is it because of the
way we used erase in (a)?

Thanks,
Kaede
Jul 22 '05 #1
Share this Question
Share on Google+
1 Reply


P: n/a
On 22 Nov 2003 21:16:45 -0800, ka************@hotmail.com (kaede) wrote:
Hi all,

I recently came across the following code:

// some data
struct Data { // ... some data };

// a list to hold the data
vector<Data> dataList;

// a function to erase an element inside the datalist
void destroyDataAtIndex(int index)
{
dataList.erase( &dataList[index] ); //(a)
}

Is line (a) valid? If so, how does that work since the function
declaration of erase is erase(iterator iter)? Does it automatically
converts the address of the element to an iterator? or it makes the
assumption that an iterator is a typedef of pointer?


No, it's not valid. However, it might work on some compilers that use
pointers as iterators for vectors. It will fail on others.

--
Be seeing you.
Jul 22 '05 #2

This discussion thread is closed

Replies have been disabled for this discussion.