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 8610043
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 12, 20262026-06-12T04:02:06+00:00 2026-06-12T04:02:06+00:00

I have a std::vector containing a lot of elements. As the vector is huge,

  • 0

I have a std::vector containing a lot of elements. As the vector is huge, I store pointers to some specific elements in another vector, to be able to access them faster. But as the vector grows, sometimes its internal container gets reallocated, causing all my pointers to become invalid.

Is there a way to know when this happens? This way I can update the pointers in the other list.

  • 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-06-12T04:02:07+00:00Added an answer on June 12, 2026 at 4:02 am

    You shoudldn’t store pointers, you should store indexes :

    i.e, instead of :

    var1 = &vector[0];
    var2 = &vector[13];
    

    and access *var1, *var2

    you should store :

    i1 = 0;
    i2 = 13;
    

    and access vector[i1], vector[i2]


    Note : you should still be careful if you use modifier methods :

    • pop_back() (which makes the last position invalid)
    • erase(i) (which shifts all the indexes greater than i)
    • etc …

    (your first method had the same caveat)

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

Sidebar

Related Questions

I have a comma separated integers and I want to store them in std::vector<int>
I have a std::vector of some class of the form class A{ public: A():i(someNumber){}
I have an std::vector that holds all the objects and is passed to them
I have a std::vector<uint8_t> that contains strings at specific offsets. Here's a shortened dump:
I have a vector containing n elements. I need to choose a subset of
I have four std::vector containers that all might (or might not) contain elements. I
Say I have a std::vector called vec with 10 elements and I want to
I have a vector containing large number of elements. Now I want to write
I have an std::vector of std::strings containing data similar to this: [0] = ""
Right now I have a vector std::vector<char> myVector(4) containing any combination of a set

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.