Date: prev next · Thread: first prev next last
2011 Archives by date, by thread · List index


Hi Fridrich,

On Thu, 2011-02-10 at 08:44 +0100, Fridrich Strba wrote:
The hash_map, hash_multimap, hash_set and hash_multiset are remplaced by
boost::unordered_map, boost::unordered_multimap, boost::unordered_set
and boost::unordered_multiset. As well, the std::hash is replaced by
boost::hash. So, if your code contains any of them, please adapt it.
Note that the data_type member from the hash_* containers should be
replaced by mapped_type member from the boost types.

        Great; now we just need to run a few times under memprof to see if we
have accidentally introduced some unexpected staggering memory wasteage
such as stlport was at least known to produce in some corner cases, and
(no doubt) boost could do in other ways.

        Having said that - the stlport implementation of eg. hash map iterators
was incredibly sad: re-hashing the majority of entries in the map as you
iterated [ amazing but true ], hopefully boost is less uber-lame and
(thus) faster at least to iterate; I'm just a tad concerned about its
memory usage [ pwrt. cross platform differences there ].

        Anyhow - overall a positive move no doubt.

        Thanks,

                Michael.

-- 
 michael.meeks@novell.com  <><, Pseudo Engineer, itinerant idiot



Context


Privacy Policy | Impressum (Legal Info) | Copyright information: Unless otherwise specified, all text and images on this website are licensed under the Creative Commons Attribution-Share Alike 3.0 License. This does not include the source code of LibreOffice, which is licensed under the Mozilla Public License (MPLv2). "LibreOffice" and "The Document Foundation" are registered trademarks of their corresponding registered owners or are in actual use as trademarks in one or more countries. Their respective logos and icons are also subject to international copyright laws. Use thereof is explained in our trademark policy.