generic-library/cxx
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Removed some tabs that snuck into the test suite. No functionality change

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@227363 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Marshall Clow
2015-01-28 20:26:11 +00:00
parent 01c1c6fcc7
commit eea9d20edb
5 changed files with 29 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
test/std/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp
View File

@@ -155,5 +155,5 @@ int main()
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
test2(); test2();
} }

14
test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp
View File

@@ -30,24 +30,24 @@ int main()
int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; int ib[] = {0, 1, 2, 3, 0, 1, 2, 3};
const unsigned sb = sizeof(ib)/sizeof(ib[0]); const unsigned sb = sizeof(ib)/sizeof(ib[0]);
typedef input_iterator<const int*> II; typedef input_iterator<const int*> II;
typedef random_access_iterator<const int*> RAI; typedef random_access_iterator<const int*> RAI;
assert(std::mismatch(II(ia), II(ia + sa), II(ib)) assert(std::mismatch(II(ia), II(ia + sa), II(ib))
== (std::pair<II, II>(II(ia+3), II(ib+3)))); == (std::pair<II, II>(II(ia+3), II(ib+3))));
assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib)) assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib))
== (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
#ifdef HAS_FOUR_ITERATOR_VERSION #ifdef HAS_FOUR_ITERATOR_VERSION
assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb)) assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb))
== (std::pair<II, II>(II(ia+3), II(ib+3)))); == (std::pair<II, II>(II(ia+3), II(ib+3))));
assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb)) assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb))
== (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+2)) assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+2))
== (std::pair<II, II>(II(ia+2), II(ib+2)))); == (std::pair<II, II>(II(ia+2), II(ib+2))));
#endif #endif
} }

12
test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp
View File

@@ -33,9 +33,9 @@ int main()
int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; int ib[] = {0, 1, 2, 3, 0, 1, 2, 3};
const unsigned sb = sizeof(ib)/sizeof(ib[0]); const unsigned sb = sizeof(ib)/sizeof(ib[0]);
typedef input_iterator<const int*> II; typedef input_iterator<const int*> II;
typedef random_access_iterator<const int*> RAI; typedef random_access_iterator<const int*> RAI;
typedef std::equal_to<int> EQ; typedef std::equal_to<int> EQ;
assert(std::mismatch(II(ia), II(ia + sa), II(ib), EQ()) assert(std::mismatch(II(ia), II(ia + sa), II(ib), EQ())
== (std::pair<II, II>(II(ia+3), II(ib+3)))); == (std::pair<II, II>(II(ia+3), II(ib+3))));
@@ -45,8 +45,8 @@ int main()
binary_counting_predicate<EQ, int> bcp((EQ())); binary_counting_predicate<EQ, int> bcp((EQ()));
assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp)) assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp))
== (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
assert(bcp.count() > 0 && bcp.count() < sa); assert(bcp.count() > 0 && bcp.count() < sa);
bcp.reset(); bcp.reset();
#ifdef HAS_FOUR_ITERATOR_VERSION #ifdef HAS_FOUR_ITERATOR_VERSION
assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ()) assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ())
@@ -56,7 +56,7 @@ int main()
assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), std::ref(bcp)) assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), std::ref(bcp))
== (std::pair<II, II>(II(ia+3), II(ib+3)))); == (std::pair<II, II>(II(ia+3), II(ib+3))));
assert(bcp.count() > 0 && bcp.count() < std::min(sa, sb)); assert(bcp.count() > 0 && bcp.count() < std::min(sa, sb));
#endif #endif
assert(std::mismatch(ia, ia + sa, ib, EQ()) == assert(std::mismatch(ia, ia + sa, ib, EQ()) ==

24
test/std/utilities/meta/meta.unary.prop.query/void_t.pass.cpp
View File

@@ -50,19 +50,19 @@ int main()
{ {
static_assert( std::is_same<void, std::void_t<>>::value, ""); static_assert( std::is_same<void, std::void_t<>>::value, "");
test1<void>(); test1<void>();
test1<int>(); test1<int>();
test1<double>(); test1<double>();
test1<int&>(); test1<int&>();
test1<Class>(); test1<Class>();
test1<Class[]>(); test1<Class[]>();
test1<Class[5]>(); test1<Class[5]>();
test2<void, int>(); test2<void, int>();
test2<double, int>(); test2<double, int>();
test2<int&, int>(); test2<int&, int>();
test2<Class&, bool>(); test2<Class&, bool>();
test2<void *, int&>(); test2<void *, int&>();
static_assert( std::is_same<void, std::void_t<int, double const &, Class, volatile int[], void>>::value, ""); static_assert( std::is_same<void, std::void_t<int, double const &, Class, volatile int[], void>>::value, "");
} }

2
test/std/utilities/meta/meta.unary/meta.unary.prop/is_default_constructible.pass.cpp
View File

@@ -37,7 +37,7 @@ class Empty
class NoDefaultConstructor class NoDefaultConstructor
{ {
NoDefaultConstructor(int) {} NoDefaultConstructor(int) {}
}; };
class NotEmpty class NotEmpty