Marshall Clow
|
146c14ac33
|
Implement P0025R0: 'An algorithm to clamp a value between a pair of boundary values' for C++17
llvm-svn: 262871
|
2016-03-07 22:43:49 +00:00 |
|
Marshall Clow
|
40631133b4
|
Change some #ifdefs to #if - thanks to Dexon for thge catch.
llvm-svn: 243641
|
2015-07-30 13:56:00 +00:00 |
|
Marshall Clow
|
adfdae18c8
|
Fix a self-move bug in inplace_merge. Thanks to Ted and Dexon for the report and the suggested fix.
llvm-svn: 243530
|
2015-07-29 16:25:45 +00:00 |
|
Eric Fiselier
|
19fa337610
|
Fix warnings in test/std/algorithms
llvm-svn: 242626
|
2015-07-18 21:53:16 +00:00 |
|
Marshall Clow
|
0b0671ae36
|
Fix for LWG Issue 2369: constexpr max(initializer_list) vs max_element
llvm-svn: 236952
|
2015-05-10 13:53:31 +00:00 |
|
Marshall Clow
|
5f15a8b959
|
Need to wrap a bit in an ifdef, since there are no initializer_lists in C++03
llvm-svn: 228840
|
2015-02-11 15:48:21 +00:00 |
|
Marshall Clow
|
002144f61d
|
Fix PR 22541: When values are equal, minmax should return the rightmost one in the initializer_list
llvm-svn: 228839
|
2015-02-11 15:41:34 +00:00 |
|
Marshall Clow
|
0b48cf9a62
|
Fix PR#22427. The implementation of inplace_merge had a \'small data set\' optimization; if either half of the merge was small (i.e, less than 9 items), it did an inplace merge rather than allocating a buffer and doing a faster/smarter merge. However, this failed to satisfy the complexity requirements in the standard. Remove that code. Add tests to check the complexity, and add the same tests for std::merge, since we are in that section of the test suite anyway.
llvm-svn: 227811
|
2015-02-02 17:35:53 +00:00 |
|
Eric Fiselier
|
5a83710e37
|
Move test into test/std subdirectory.
llvm-svn: 224658
|
2014-12-20 01:40:03 +00:00 |
|