Log - 1d4a1edbc7e4461b59239e1b8297e9dd395a6322 - platform/external/libcxx

1d4a1ed Revert "Update aosp/master libcxx rebase to r263688" by Dan Albert · 8 years ago
15a326c More tests for LWG#2156 by Marshall Clow · 9 years ago
a90c6dd Move test into test/std subdirectory. by Eric Fiselier · 10 years ago[Renamed from test/containers/unord/unord.multiset/reserve.pass.cpp]
061d0cc There were two identical files named 'min_allocator.h'. Move one of them to /support and delete the other. Then adjust all the tests that used them to include the moved one. No functionality change. by Marshall Clow · 11 years ago
7a6b7ce Implement full support for non-pointer types in custom allocators. This is for the unordered containers only. This work still needs to be done on the sequence containers. by Howard Hinnant · 11 years ago
7a44515 This commit establishes a new bucket_count policy in the unordered containers: The policy now allows a power-of-2 number of buckets to be requested (and that request honored) by the client. And if the number of buckets is set to a power of 2, then the constraint of the hash to the number of buckets uses & instead of %. If the client does not specify a number of buckets, then the policy remains unchanged: a prime number of buckets is selected. The growth policy is that the number of buckets is roughly doubled when needed. While growing, either the prime, or the power-of-2 strategy will be preserved. There is a small run time cost for putting in this switch. For very cheap hash functions, e.g. identity for int, the cost can be as high as 18%. However with more typical use cases, e.g. strings, the cost is in the noise level. I've measured cases with very cheap hash functions (int) that using a power-of-2 number of buckets can make look up about twice as fast. However I've also noted that a power-of-2 number of buckets is more susceptible to accidental catastrophic collisions. Though I've also noted that accidental catastrophic collisions are also possible when using a prime number of buckets (but seems far less likely). In short, this patch adds an extra tuning knob for those clients trying to get the last bit of performance squeezed out of their hash containers. Casual users of the hash containers will not notice the introduction of this tuning knob. Those clients who swear by power-of-2 hash containers can now opt-in to that strategy. Clients who prefer a prime number of buckets can continue as they have. by Howard Hinnant · 12 years ago
b64f8b0 license change by Howard Hinnant · 14 years ago
f5256e1 Wiped out some non-ascii characters that snuck into the copyright. by Howard Hinnant · 14 years ago
bc8d3f9 libcxx initial import by Howard Hinnant · 14 years ago