Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6097919
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 23, 20262026-05-23T13:05:52+00:00 2026-05-23T13:05:52+00:00

I have a vector with some (among other classobjects) multiple added objects class Foo

  • 0

I have a vector with some (among other classobjects) multiple added objects

class Foo {
  ...
  vector<Bar*> v;
  Bar* b = new Bar();
  v.push_back(b);
  v.push_back(b);
  ...
}

in Foo’s destructor I do

for (vector<Bar*>::iterator it = v.begin(); it != v.end(); ++it)
    delete *it;

this causes an exception on the second iteration, because the object is already deallocated: “Access violation reading location 0xfeeefee2.”

How do I solve this problem?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-23T13:05:53+00:00Added an answer on May 23, 2026 at 1:05 pm

    Solve it by not using the terrible idea of storing raw pointers in a container. Instead, use a container of smart pointers:

    #include <memory>
    #include <vector>
    
    typedef std::shared_ptr<Foo> FooPtr;
    
    std::vector<FooPtr> v;
    
    FooPtr b(new Bar());                 // #1
    
    v.push_back(b);
    v.push_back(b);
    v.push_back(b);
    
    // C++0x: even better method:
    auto c = std::make_shared<Bar>();     // #2
    v.push_back(c);
    v.push_back(c);
    
    v.push_back(std::make_shared<Bar>()); // #3
    
    // Three distinct allocations of a Bar object have happened, #1, #2, and #3.
    
    // No explicit deletions!
    

    If you don’t have C++0x, use the TR1 library:

    #include <tr1/memory>
    typedef std::tr1::shared_ptr<Foo> FooPtr;
    

    (You don’t have make_shared in that case, because that’s a new gimmick using rvalue references and forwarding.)

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a vector-like class that contains an array of objects of type T
I have 2 vector of with one has vec1{e1,e2,e3,e4} and the other one with
I have created a BST full of WordInfo objects that have a vector to
I have a vector that I want to insert into a set . This
I have a vector with 1000 nodes if(count + 1 > m_listItems.capacity()) m_listItems.reserve(count +
I have a vector of integers and I want to convert it to a
Suppose we have a vector/array in C++ and we wish to count which of
If I have a vector of pairs: std::vector<std::pair<int, int> > vec; Is there and
I have several std::vector , all of the same length. I want to sort
I have a std::vector containing a handful of numbers, which are not in any

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.