6 Aug
2011
6 Aug
'11
2:35 a.m.
On Fri, Aug 5, 2011 at 19:05, Michel MORIN <mimomorin@gmail.com> wrote:
Or, I would want `uncompared_push_back` (just filling the flat_* container without sorting) and `sort` functions.
Can we do this with move semantics instead? I picture putting a bunch of data into a flat_set::internal_storage_type, then move-constructing a flat_set from that container, which would do the sorting to fix up the invariants. It would also make sense to have a flat_set::release() function that returns a (moved) temporary of the internal storage.