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.
Are there any guarantees about the layout of std::map? I know std::vector is guaranteed by the standard to have all objects sequential starting at *vector.begin(), is there any similar guarantee about std::map?.
std::mapis usually implemented as a Red-Black tree. Nodes are allocated from the heap as needed, so it’s likely they end up in random places in memory. More formally, there’s no layout guarantee in the standard.