Re: [Boost-users] Container with insertion order

Ok, now I want to make find() and erase() methods. In std::map, they return an iterator. Should I wrap the methods find() and erase(), to pass a const K& key, and return a container1:: const_iterator. is it right? -- View this message in context: http://boost.2283326.n4.nabble.com/Container-with-insertion-order-tp4097717p... Sent from the Boost - Users mailing list archive at Nabble.com.