diff options
| author | Marshall Clow <mclow.lists@gmail.com> | 2015-01-28 20:26:11 +0000 |
|---|---|---|
| committer | Marshall Clow <mclow.lists@gmail.com> | 2015-01-28 20:26:11 +0000 |
| commit | c57d98ae86ae0f6ac6fe14048610344220c361c1 (patch) | |
| tree | c6dc3fefb88138d0d3f939e305786b0fd8894e8b /libcxx/test/std/algorithms/alg.nonmodifying | |
| parent | 3970a7ec9b630a32c6327e6cb20cbb5febd7389f (diff) | |
| download | bcm5719-llvm-c57d98ae86ae0f6ac6fe14048610344220c361c1.tar.gz bcm5719-llvm-c57d98ae86ae0f6ac6fe14048610344220c361c1.zip | |
Removed some tabs that snuck into the test suite. No functionality change
llvm-svn: 227363
Diffstat (limited to 'libcxx/test/std/algorithms/alg.nonmodifying')
| -rw-r--r-- | libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp | 14 | ||||
| -rw-r--r-- | libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp | 14 |
2 files changed, 14 insertions, 14 deletions
diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp index 0cf06bbfba7..abc89dc5609 100644 --- a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp +++ b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp @@ -30,24 +30,24 @@ int main() int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; const unsigned sb = sizeof(ib)/sizeof(ib[0]); - typedef input_iterator<const int*> II; - typedef random_access_iterator<const int*> RAI; + typedef input_iterator<const int*> II; + typedef random_access_iterator<const int*> RAI; 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)) - == (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 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)) - == (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)) - == (std::pair<II, II>(II(ia+2), II(ib+2)))); + == (std::pair<II, II>(II(ia+2), II(ib+2)))); #endif } diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp index ce0326c660f..8d85d993cd6 100644 --- a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp +++ b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp @@ -33,9 +33,9 @@ int main() int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; const unsigned sb = sizeof(ib)/sizeof(ib[0]); - typedef input_iterator<const int*> II; - typedef random_access_iterator<const int*> RAI; - typedef std::equal_to<int> EQ; + typedef input_iterator<const int*> II; + typedef random_access_iterator<const int*> RAI; + typedef std::equal_to<int> EQ; assert(std::mismatch(II(ia), II(ia + sa), II(ib), EQ()) == (std::pair<II, II>(II(ia+3), II(ib+3)))); @@ -45,9 +45,9 @@ int main() binary_counting_predicate<EQ, int> bcp((EQ())); assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp)) == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); - assert(bcp.count() > 0 && bcp.count() < sa); - bcp.reset(); - + assert(bcp.count() > 0 && bcp.count() < sa); + bcp.reset(); + #ifdef HAS_FOUR_ITERATOR_VERSION assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ()) == (std::pair<II, II>(II(ia+3), II(ib+3)))); @@ -56,7 +56,7 @@ int main() 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)))); - assert(bcp.count() > 0 && bcp.count() < std::min(sa, sb)); + assert(bcp.count() > 0 && bcp.count() < std::min(sa, sb)); #endif assert(std::mismatch(ia, ia + sa, ib, EQ()) == |
