I initially started out using a std::multimap
to store many values with the same key, but then I discovered that it doesn\'t preserve the insertion order among
You could achieve this by using boost::multi_index
with two indices: ordered_non_unique
(which allows values with the same key) and random_access(which will keep the insertion order).
struct some {
long key;
int data;
int more_data;
// etc.
};
typedef multi_index_container<
some,
indexed_by<
random_access<>, // keep insertion order
ordered_non_unique< member >
>
> some_mic_t;