Closed GoogleCodeExporter closed 9 years ago
I find it very suspicious that the dense_hash_set implementation only had one
allocation. It must have had to realloc when growing the hashtable! Can you
douuble check your test?
Also, I don't know what valgrind means by "196,697,008 bytes allocated", but I
assume it has no relationship to the high-level memory mark (if you allocate
and free 100 bytes 10000000 times, how much memory will valgrind say is
allocated)? So this is not necessarily a problematic result. Also, I don't
know what valgrind does if you say realloc(100) and libc is able to reallocate
without actually allocating more memory. That would affect the numbers
reported for sparse_hash_map a lot.
Original comment by csilv...@gmail.com
on 30 Jun 2011 at 10:25
>>I find it very suspicious that the dense_hash_set implementation only had one
allocation.
it's because of TSet set(size);
>>196,697,008
yes, you're right it's due to alloc/dealloc cycle, please close the issue. :-)
sorry.
Original comment by bulovya...@gmail.com
on 30 Jun 2011 at 10:51
Original comment by csilv...@gmail.com
on 1 Jul 2011 at 12:29
Original issue reported on code.google.com by
bulovya...@gmail.com
on 30 Jun 2011 at 5:01