| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
|
|
|
| |
llvm-svn: 160585
|
|
|
|
| |
llvm-svn: 160566
|
|
|
|
| |
llvm-svn: 160565
|
|
|
|
| |
llvm-svn: 160564
|
|
|
|
|
|
| |
Args...> to only check Fp, and not Args... . This should be sufficient to give the desired high quality diagnostics under both bind and function. And this allows a test reported by Rich E on cfe-dev to pass. Tracked by <rdar://problem/11880602>.
llvm-svn: 160285
|
|
|
|
| |
llvm-svn: 160184
|
|
|
|
|
|
| |
Jonathan Coxhead for reporting this bug.
llvm-svn: 160136
|
|
|
|
| |
llvm-svn: 159921
|
|
|
|
| |
llvm-svn: 159899
|
|
|
|
| |
llvm-svn: 159857
|
|
|
|
| |
llvm-svn: 159846
|
|
|
|
|
|
| |
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
|
|
|
|
| |
llvm-svn: 157832
|
|
|
|
|
|
| |
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
|
|
|
|
|
|
|
| |
at the moment, but they allow these tests to be used to test clang against
libstdc++. Add myself to the credits file, as suggested by Howard.
llvm-svn: 155085
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
compare-and-exchange failed (it should update the expected value to the current
value, and the tests were checking that it didn't...).
Results of the atomics part of the test suite on FreeBSD with clang trunk and
the atomic.c from compiler-rt (currently kludged into the test, not installed
properly):
****************************************************
Results for /root/libc++/test/atomics:
using clang version 3.1 (trunk 153415)
Target: x86_64-unknown-freebsd10.0
Thread model: posix
with -std=c++0x -stdlib=libc++ -pthread /tmp/atomic.o
----------------------------------------------------
sections without tests : 0
sections with failures : 0
sections without failures: 14
+ ----
total number of sections : 14
----------------------------------------------------
number of tests failed : 0
number of tests passed : 52
+ ----
total number of tests : 52
****************************************************
Yay!
llvm-svn: 154095
|
|
|
|
|
|
|
|
| |
copyable.
Now all of the test cases compile. Some of them even run!
llvm-svn: 154094
|
|
|
|
| |
llvm-svn: 153896
|
|
|
|
|
|
| |
addresses http://llvm.org/bugs/show_bug.cgi?id=12436.
llvm-svn: 153873
|
|
|
|
|
|
| |
is/will be making convincing arguments that a modified form of LWG 2051 (currently NAD Future) is easily acheivable and desirable. He has demonstrated that a tuple<T...> where all of the T are implicitly convertible from U... should have a tuple constructor that is also implicit, instead of explicit. This would support the use cases in LWG 2051 while not undermining T... with explicit conversions from U.... This check-in is an experimental implementation of Daniel's work. I believe this work to be mature enough to warrant inclusion into libc++. If anyone sees real-world problems that this check in causes, please let me know and I will revert it, and provide the feedback to the LWG.
llvm-svn: 153855
|
|
|
|
|
|
| |
part is just some renaming as the variable was already in use, conflicting with something else in the LLVM tree. Contributed by Ruben Van Boxem.
llvm-svn: 153036
|
|
|
|
| |
llvm-svn: 152716
|
|
|
|
| |
llvm-svn: 152501
|
|
|
|
| |
llvm-svn: 151719
|
|
|
|
| |
llvm-svn: 151461
|
|
|
|
| |
llvm-svn: 151451
|
|
|
|
|
|
| |
__is_trivially_assignable traits. Fixes r10925427 and http://llvm.org/bugs/show_bug.cgi?id=12038.
llvm-svn: 151406
|
|
|
|
| |
llvm-svn: 151108
|
|
|
|
|
|
| |
adding support for nullptr, and using less<T*>. Fixes http://llvm.org/bugs/show_bug.cgi?id=12056.
llvm-svn: 151084
|
|
|
|
|
|
| |
Jeffrey Yasskin.
llvm-svn: 150927
|
|
|
|
| |
llvm-svn: 150887
|
|
|
|
|
|
| |
undetected because I had failed to test assigning from a const lvalue. This fixes http://llvm.org/bugs/show_bug.cgi?id=11921
llvm-svn: 150613
|
|
|
|
|
|
| |
floating point from an input stream. Fixes http://llvm.org/bugs/show_bug.cgi?id=11871
llvm-svn: 150609
|
|
|
|
| |
llvm-svn: 146655
|
|
|
|
|
|
| |
and also for basic_string. Also made hash<thread::id> ever so slighly more portable. I had to tweak one test which is questionable (definitely not portable) anyway.
llvm-svn: 145795
|
|
|
|
| |
llvm-svn: 145707
|
|
|
|
|
|
| |
Ganesh Barbati
llvm-svn: 145698
|
|
|
|
| |
llvm-svn: 143519
|
|
|
|
|
|
| |
failure
llvm-svn: 141506
|
|
|
|
| |
llvm-svn: 141494
|
|
|
|
| |
llvm-svn: 141003
|
|
|
|
| |
llvm-svn: 140950
|
|
|
|
|
|
| |
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: 140271
|
|
|
|
| |
llvm-svn: 140265
|
|
|
|
|
|
| |
tests.
llvm-svn: 140264
|
|
|
|
| |
llvm-svn: 140262
|
|
|
|
| |
llvm-svn: 140255
|
|
|
|
|
|
| |
specify one. Undefine some stdio.h macros that break the tests.
llvm-svn: 140252
|
|
|
|
| |
llvm-svn: 140251
|