Re: [Boost-users] Container with insertion order

It is very difficult to realize?

#include #include #include #include using namespace boost::multi_index; struct item { item(int i) : i_(i) {} int i_; }; typedef multi_index_container< item, indexed_by< random_access<>, ordered_non_unique > >

container;

int main() { container c; c.insert(c.end(), item(2)); c.insert(c.end(), item(1)); c.insert(c.end(), item(3)); c.insert(c.end(), item(4)); for (container::const_iterator i = c.begin(); i != c.end(); ++i) std::cout << i->i_ << std::endl; }