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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 8, 20262026-06-08T13:10:53+00:00 2026-06-08T13:10:53+00:00

I use unordered_map with MSVC 2010. If I insert many elements into it, it

  • 0

I use unordered_map with MSVC 2010. If I insert many elements into it, it begins to resize. During this process it copies all pairs and rehash them. When there are too many objects it takes too much time. Are there any tips how to avoid this effect? Something like reserve, but it is not implemented n VS 2010

  • 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-08T13:10:56+00:00Added an answer on June 8, 2026 at 1:10 pm

    Use rehash instead? It seems to function like reserve

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

Sidebar

Related Questions

Yesterday i tried to use std::unordered_map and this code confused me how much memory
recently I've started to use the excellent boost::unordered_map on my system, but got one
I am trying to use unordered_map. But in some of the servers we don't
hi I'm trying to use unordered_map on a program compiled in Xcode 4.2 but
I'm using MinGW 4.5.2 and I'd like to use unordered_map from the tr1 namespace,
I'm trying to use an iterator to output an integer in a multilayered unordered_map
In my following program I'm currently using unordered_map just because I wanted O(1) search/insert
Given an STL container (you may also take boost::unordered_map and boost::multi_index_container into account) that
A recent talk about unordered_map in C++ made me realize that I should use
I am looking to use an intrusive unordered_map. For some reason there is only

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.