Home | Libraries | People | FAQ | More |
Boost.Intrusive ordered associative containers with equivalent keys offer stability guarantees, following C++ standard library's defect #233 resolution, explained in document Comments on LWG issue 233: Insertion hints in associative containers. This means that:
a.begin()
as the hint means that the new element
should be inserted before the subsequence even if a.begin()
is far away. This allows code to always
append (or prepend) an equal range with something as simple as: m.insert(m.end(), new_node);
or m.insert(m.begin(), new_node);