| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
|
|
|
|
|
| |
bounds" calls
llvm-svn: 170435
|
|
|
|
| |
llvm-svn: 160564
|
|
|
|
| |
llvm-svn: 159921
|
|
|
|
|
|
| |
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.
llvm-svn: 159836
|
|
|
|
|
|
| |
changed a while back and I'm just now updating to these new rules. In a nutshell, you've got to know you're emplacing to a pair and use one of pair's constructors. I made one extension: If you want to emplace the key and default construct the mapped_type, you can just emplace(key), as opposed to emplace(piecewise_construct, forward_as_tuple(key), forward_as_tuple()).
llvm-svn: 157503
|
|
|
|
| |
llvm-svn: 145707
|
|
|
|
|
|
| |
should be considered a temporary state. The API of the debug database and how vector and list use it, is unsatisfactory at the moment. It is both inefficient and overly verbose. I wanted to get this functionality checked in though. In the next day or so I'll refactor what is there in an attempt to streamline things.
llvm-svn: 140660
|
|
|
|
| |
llvm-svn: 139930
|
|
|
|
| |
llvm-svn: 137522
|
|
|
|
| |
llvm-svn: 132652
|
|
|
|
| |
llvm-svn: 132650
|
|
|
|
| |
llvm-svn: 132647
|
|
|
|
| |
llvm-svn: 132646
|
|
|
|
| |
llvm-svn: 132640
|
|
|
|
| |
llvm-svn: 132639
|
|
|
|
|
|
| |
into vector.
llvm-svn: 132577
|
|
|
|
| |
llvm-svn: 132562
|
|
|
|
| |
llvm-svn: 132553
|
|
|
|
|
|
| |
noexcept, should be declared so. The client has the traits to detect and branch on this information, and it is often an important optimization. Give deque() a noexcept. Add test for deque default constructor and deque destructor.
llvm-svn: 132549
|
|
|
|
| |
llvm-svn: 132523
|
|
|
|
| |
llvm-svn: 131326
|
|
|
|
| |
llvm-svn: 128807
|
|
|
|
| |
llvm-svn: 128797
|
|
|
|
| |
llvm-svn: 124508
|
|
|
|
| |
llvm-svn: 119545
|
|
|
|
| |
llvm-svn: 119395
|
|
|
|
| |
llvm-svn: 116515
|
|
|
|
|
|
| |
paths in some tests caused by aligning the test suite with N3126.
llvm-svn: 113403
|
|
|
|
| |
llvm-svn: 113101
|
|
|
|
|
|
| |
flags, and renamed _LIBCPP_MOVE to _LIBCPP_HAS_NO_RVALUE_REFERENCES to be more consistent with the rest of the libc++'s flags, and with clang's nomenclature.
llvm-svn: 113086
|
|
|
|
| |
llvm-svn: 111755
|
|
|
|
| |
llvm-svn: 111745
|
|
|
|
| |
llvm-svn: 111532
|
|
|
|
| |
llvm-svn: 103516
|
|
llvm-svn: 103490
|