In an earlier version it was closer to being an apples-to-apples comparison. It showed that unordered_map was taking about 1/3rd less time on insertions, but nearly 2x on deletions.
That patch I think also found a bug in the bu_hash_rm routine … infinite loop when the key lengths are a match bu the keys themselves are not. Doesn’t seem to be incrementing. This isn’t typical use, but looking like a bug regardless. In all, I think it justifies replacing the guts of bu_hash with a std container. Cheers! Sean > On Dec 18, 2017, at 2:47 PM, Daniel Roßberg <danielmrossb...@gmail.com> wrote: > > I've looked into this task for some time and found it difficult to compare > them. Attached is a version with integers as keys. I haven't done real > tests with it yet. > > Regards > Daniel > <test.cpp>------------------------------------------------------------------------------ > Check out the vibrant tech community on one of the world's most > engaging tech sites, Slashdot.org! > http://sdm.link/slashdot_______________________________________________ > BRL-CAD Developer mailing list > brlcad-devel@lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/brlcad-devel ------------------------------------------------------------------------------ Check out the vibrant tech community on one of the world's most engaging tech sites, Slashdot.org! http://sdm.link/slashdot _______________________________________________ BRL-CAD Developer mailing list brlcad-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/brlcad-devel
