diff options
| author | Marshall Clow <mclow.lists@gmail.com> | 2014-02-27 16:13:36 +0000 |
|---|---|---|
| committer | Marshall Clow <mclow.lists@gmail.com> | 2014-02-27 16:13:36 +0000 |
| commit | 4ab45349641cdfe9a048a8225adeb38eb8b98fa0 (patch) | |
| tree | e27592c3c7284488105a7e3a804e859cc826a80c /libcxx/test | |
| parent | 6ede6aba287269a369486b094710bb8cc916e54f (diff) | |
| download | bcm5719-llvm-4ab45349641cdfe9a048a8225adeb38eb8b98fa0.tar.gz bcm5719-llvm-4ab45349641cdfe9a048a8225adeb38eb8b98fa0.zip | |
More LWG issues. Mark #2182, #2323 and #2213 as complete. Add a test for #2339, and mark that as complete. No actual changes to the libc++ code; all of these were already in place.
llvm-svn: 202407
Diffstat (limited to 'libcxx/test')
| -rw-r--r-- | libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp | 1 | ||||
| -rw-r--r-- | libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp | 1 |
2 files changed, 2 insertions, 0 deletions
diff --git a/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp index 5104ce90eb6..dc5564eb3fc 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp @@ -29,6 +29,7 @@ test_one(unsigned N, unsigned M) std::random_shuffle(array, array+N); std::nth_element(array, array+M, array+N); assert(array[M] == M); + std::nth_element(array, array+N, array+N); // begin, end, end delete [] array; } diff --git a/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp index 538ec224219..cf8659038f1 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp @@ -42,6 +42,7 @@ test_one(unsigned N, unsigned M) std::random_shuffle(array, array+N); std::nth_element(array, array+M, array+N, std::greater<int>()); assert(array[M] == N-M-1); + std::nth_element(array, array+N, array+N, std::greater<int>()); // begin, end, end delete [] array; } |

