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

  • SEARCH
  • Home
  • 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 754861
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 14, 20262026-05-14T15:03:46+00:00 2026-05-14T15:03:46+00:00

I have do an extensive calculation on a big vector of integers. The vector

  • 0

I have do an extensive calculation on a big vector of integers. The vector size is not changed during the calculation. The size of the vector is frequently accessed by the code. What is faster in general:

  • using the vector::size() function or
  • using a helper constant vectorSize for storing the size of the vector?

I know that compilers usually inline the size() function when setting the proper compiler flags, however, this is not guaranteed.

  • 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-14T15:03:46+00:00Added an answer on May 14, 2026 at 3:03 pm

    Interesting question.

    So, what’s going to happened ? Well if you debug with gdb you’ll see something like 3 member variables (names are not accurate):

    • _M_begin: pointer to the first element of the dynamic array
    • _M_end: pointer one past the last element of the dynamic array
    • _M_capacity: pointer one past the last element that could be stored in the dynamic array

    The implementation of vector<T,Alloc>::size() is thus usually reduced to:

    return _M_end - _M_begin;  // Note: _Mylast - _Myfirst in VC 2008
    

    Now, there are 2 things to consider when regarding the actual optimizations possible:

    • will this function be inlined ? Probably: I am no compiler writer, but it’s a good bet since the overhead of a function call would dwarf the actual time here and since it’s templated we have all the code available in the translation unit
    • will the result be cached (ie sort of having an unnamed local variable): it could well be, but you won’t know unless you disassemble the generated code

    In other words:

    • If you store the size yourself, there is a good chance it will be as fast as the compiler could get it.
    • If you do not, it will depend on whether the compiler can establish that nothing else is modifying the vector; if not, it cannot cache the variable, and will need to perform memory reads (L1) every time.

    It’s a micro-optimization. In general, it will be unnoticeable, either because the performance does not matter or because the compiler will perform it regardless. In a critical loop where the compiler does not apply the optimization, it can be a significant improvement.

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

Sidebar

Related Questions

No related questions found

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.