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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 24, 20262026-05-24T08:32:06+00:00 2026-05-24T08:32:06+00:00

I have a std::vector that I know will never have to grow–it will always

  • 0

I have a std::vector that I know will never have to grow–it will always have n elements (unfortunately, n isn’t known at compile time so I can’t use std::array). I can do:

std::vector<blah> v(n);

Which correctly sets its capacity to n. But when I proceed to fill v with push_back, it automatically resizes to 2n.

I realize this is premature optimization, but it’s bugging me. Is there a way to set max size or something?

  • 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-24T08:32:07+00:00Added an answer on May 24, 2026 at 8:32 am

    That constructor does not sets the capacity of the vector to n, but insteads creates a vector containing n objects constructed with blah‘s default constructor. This can be confusing for people with a Java or .NET background, where ArrayList and List<T> both have a constructor that sets an initial capacity.

    The solution is to do it in two steps:

    std::vector<blah> v; // create an empty vector
    v.reserve(n); // increase capacity
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a std::vector. I want to create iterators representing a slice of that
I have a std::vector<uint8_t> that contains strings at specific offsets. Here's a shortened dump:
I have a std::vector that holds a Point struct (x,y,z and some other non-pointer
Suppose I have a vector of ints, std::vector<int> numbers; that is populated with a
This is related to this question I have a vector of points that will,
What I mean is - we know that the std::map 's elements are sorted
I have a std::vector<Word> data that is off of the struct below: struct Word
I have to fill a std::vector with elements of type struct MHD_OptionItem . This
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.