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

Fixing whitespace problems

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@111753 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Howard Hinnant
2010-08-22 00:08:10 +00:00
parent 16e6e1d72f
commit eb564e76cc
123 changed files with 369 additions and 380 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
test/algorithms/alg.sorting/alg.merge/inplace_merge.pass.cpp
View File

@@ -9,9 +9,9 @@
// <algorithm>
// template<BidirectionalIterator Iter>
// requires ShuffleIterator<Iter>
// && LessThanComparable<Iter::value_type>
// template<BidirectionalIterator Iter>
// requires ShuffleIterator<Iter>
// && LessThanComparable<Iter::value_type>
// void
// inplace_merge(Iter first, Iter middle, Iter last);

10
test/algorithms/alg.sorting/alg.merge/inplace_merge_comp.pass.cpp
View File

@@ -9,9 +9,9 @@
// <algorithm>
// template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
// requires ShuffleIterator<Iter>
// && CopyConstructible<Compare>
// template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
// requires ShuffleIterator<Iter>
// && CopyConstructible<Compare>
// void
// inplace_merge(Iter first, Iter middle, Iter last, Compare comp);
@@ -28,7 +28,7 @@ struct indirect_less
{return *x < *y;}
};
#endif
#endif // _LIBCPP_MOVE
#include "../../iterators.h"
@@ -108,5 +108,5 @@ int main()
}
delete [] ia;
}
#endif
#endif // _LIBCPP_MOVE
}

8
test/algorithms/alg.sorting/alg.merge/merge.pass.cpp
View File

@@ -9,10 +9,10 @@
// <algorithm>
// template<InputIterator InIter1, InputIterator InIter2, typename OutIter>
// requires OutputIterator<OutIter, InIter1::reference>
// && OutputIterator<OutIter, InIter2::reference>
// && HasLess<InIter2::value_type, InIter1::value_type>
// template<InputIterator InIter1, InputIterator InIter2, typename OutIter>
// requires OutputIterator<OutIter, InIter1::reference>
// && OutputIterator<OutIter, InIter2::reference>
// && HasLess<InIter2::value_type, InIter1::value_type>
// OutIter
// merge(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, OutIter result);

8
test/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp
View File

@@ -9,11 +9,11 @@
// <algorithm>
// template<InputIterator InIter1, InputIterator InIter2, typename OutIter,
// Predicate<auto, InIter2::value_type, InIter1::value_type> Compare>
// template<InputIterator InIter1, InputIterator InIter2, typename OutIter,
// Predicate<auto, InIter2::value_type, InIter1::value_type> Compare>
// requires OutputIterator<OutIter, InIter1::reference>
// && OutputIterator<OutIter, InIter2::reference>
// && CopyConstructible<Compare>
// && OutputIterator<OutIter, InIter2::reference>
// && CopyConstructible<Compare>
// OutIter
// merge(InIter1 first1, InIter1 last1,
// InIter2 first2, InIter2 last2, OutIter result, Compare comp);