struct A{ vector<Value> values; vectorstd::size_t freelist; map
index; void erase(...){ push index of unused value to freelist; } void push_back(Value){ reuse a freelist entry or values.push_back; } }; struct B{ vector
data; }; Am 31.03.2013 19:22, schrieb Michael Marcin: template<class Value> class index; template
class vector_map; Is there anything like that?
Is this multi-index?
I don't think so. At least I can't find it. You could implement my "struct A" above using Boost.MultiIndex as it uses a vector and a map, but I can't find a map implementation that uses a vector with empty values for almost-contiguous keys. keep in mind the one-to-many relationship between A and B. I'd like to be able to do ONE map lookup to receive a key with which you can access many associated data values in B objects.