llvm/libcxx
1
0
Fork 0
mirror of https://github.com/llvm-mirror/libcxx.git synced 2025-10-23 18:38:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

Some of the tests from earlier today had 'int' as the return type when it should have been 'bool'. Fix that. It doesn't change the behavior of any of the tests, but it's more accurate.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@322505 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Marshall Clow
2018-01-15 19:32:32 +00:00
parent 6a1c2ffea4
commit 82091c2583
15 changed files with 15 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
test/std/algorithms/alg.modifying.operations/alg.partitions/is_partitioned.pass.cpp
View File

@@ -27,7 +27,7 @@ struct is_odd {
};
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 3, 5, 2, 4, 6};
int ib[] = {1, 2, 3, 4, 5, 6};
return std::is_partitioned(std::begin(ia), std::end(ia), is_odd())

2
test/std/algorithms/alg.modifying.operations/alg.partitions/partition_point.pass.cpp
View File

@@ -26,7 +26,7 @@ struct is_odd
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 3, 5, 2, 4, 6};
int ib[] = {1, 2, 3, 4, 5, 6};
return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3)

2
test/std/algorithms/alg.nonmodifying/alg.all_of/all_of.pass.cpp
View File

@@ -28,7 +28,7 @@ struct test1
};
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {2, 4, 6, 8};
int ib[] = {2, 4, 5, 8};
return std::all_of(std::begin(ia), std::end(ia), test1())

2
test/std/algorithms/alg.nonmodifying/alg.any_of/any_of.pass.cpp
View File

@@ -28,7 +28,7 @@ struct test1
};
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {2, 4, 6, 8};
int ib[] = {1, 3, 5, 7};
return std::any_of(std::begin(ia), std::end(ia), test1())

2
test/std/algorithms/alg.nonmodifying/alg.is_permutation/is_permutation.pass.cpp
View File

@@ -22,7 +22,7 @@
#include "test_macros.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 0, 0};
int ib[] = {1, 1, 0};
int ic[] = {1, 0, 1};

2
test/std/algorithms/alg.nonmodifying/alg.is_permutation/is_permutation_pred.pass.cpp
View File

@@ -29,7 +29,7 @@ bool counting_equals ( const T &a, const T &b ) {
}
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 0, 0};
int ib[] = {1, 1, 0};
int ic[] = {1, 0, 1};

2
test/std/algorithms/alg.nonmodifying/alg.none_of/none_of.pass.cpp
View File

@@ -28,7 +28,7 @@ struct test1
};
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 3, 6, 7};
int ib[] = {1, 3, 5, 7};
return !std::none_of(std::begin(ia), std::end(ia), test1())

2
test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp
View File

@@ -20,7 +20,7 @@
#include "test_macros.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 1, 1, 1, 0, 1, 1};
int ib[] = {0, 0, 1, 0, 0, 0, 0};
return std::is_heap(std::begin(ia), std::end(ia))

2
test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp
View File

@@ -21,7 +21,7 @@
#include "test_macros.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 0, 1, 1, 1};
int ib[] = {1, 0, 4, 1, 0};
return std::is_heap(std::begin(ia), std::end(ia), std::greater<int>())

2
test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp
View File

@@ -20,7 +20,7 @@
#include "test_macros.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 0, 0, 0, 1, 0};
int ib[] = {0, 0, 0, 1, 1, 1};
return (std::is_heap_until(std::begin(ia), std::end(ia)) == ia+4)

2
test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_comp.pass.cpp
View File

@@ -21,7 +21,7 @@
#include "test_macros.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 0, 0, 0};
int ib[] = {0, 1, 1, 0};
return (std::is_heap_until(std::begin(ia), std::end(ia), std::greater<int>()) == ia+1)

2
test/std/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted.pass.cpp
View File

@@ -20,7 +20,7 @@
#include "test_iterators.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 0, 1, 1};
int ib[] = {1, 1, 0, 0};
return std::is_sorted(std::begin(ia), std::end(ia))

2
test/std/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp
View File

@@ -21,7 +21,7 @@
#include "test_iterators.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 1, 0, 0};
int ib[] = {0, 0, 1, 1};
return std::is_sorted(std::begin(ia), std::end(ia), std::greater<int>())

2
test/std/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until.pass.cpp
View File

@@ -20,7 +20,7 @@
#include "test_iterators.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 1, 0};
int ib[] = {0, 1, 1};
return (std::is_sorted_until(std::begin(ia), std::end(ia)) == ia+2)

2
test/std/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until_comp.pass.cpp
View File

@@ -21,7 +21,7 @@
#include "test_iterators.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR int test_constexpr() {
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 0, 1};
int ib[] = {1, 1, 0};
return (std::is_sorted_until(std::begin(ia), std::end(ia), std::greater<int>()) == ia+2)