|
Boost Users : |
Subject: Re: [Boost-users] Container with insertion order
From: Claude (clros_at_[hidden])
Date: 2011-12-02 11:38:31
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-tp4097717p4147887.html Sent from the Boost - Users mailing list archive at Nabble.com.
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net