115
117
// if we get here then the item is not in the cache,
120
122
// Add it to the list, and index it:
123
125
s_data.index.insert(std::make_pair(k, --(s_data.cont.end())));
124
126
s_data.cont.back().second = &(s_data.index.find(k)->first);
126
128
BOOST_ASSERT(s_data.index[k]->first.get() == result.get());
127
129
BOOST_ASSERT(&(s_data.index.find(k)->first) == s_data.cont.back().second);
128
130
BOOST_ASSERT(s_data.index.find(k)->first == k);