Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
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.
My question is, if i use uint32_t as data type for the key in std::map will it create a huge structure with indexes for each of the 2^32 combinations? Basically I want to generate a couple of 32-bit numbers each of which should be unique. I have the numbers but I am wondering what structure/technique to use to keep them in memory.
No, it will only create entries that you insert.
If you only have a small number (you mention a couple) it might be faster to put them in a vector and do a linear search. If it’s more than a small number a map will be faster of course.