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.
Is the order of the elements within an std::list guaranteed to remain in-order (unless, of course, a sort or something occurs)?
Moreover, is there any potentially undefined behavior with lists that might jumble them up?
I was/am under the impression that containers such as std::deque and the like are order-safe, but alas std::deque is not double-linked.
Yes the order is guaranteed in
std::list. Since anything can happen with UB, mixing up the order of a std::list is possible (though unlikely I would think).Short answer is that if your lists are not in the order you think they should be then the most likely reason is a bug in your program.