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

4
test/algorithms/alg.sorting/alg.min.max/max_comp.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<class T, StrictWeakOrder<auto, T> Compare>
// requires !SameType<T, Compare> && CopyConstructible<Compare>
// template<class T, StrictWeakOrder<auto, T> Compare>
// requires !SameType<T, Compare> && CopyConstructible<Compare>
// const T&
// max(const T& a, const T& b, Compare comp);

6
test/algorithms/alg.sorting/alg.min.max/max_element.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter>
// requires LessThanComparable<Iter::value_type>
// template<ForwardIterator Iter>
// requires LessThanComparable<Iter::value_type>
// Iter
// max_element(Iter first, Iter last);
@@ -41,7 +41,7 @@ test(unsigned N)
for (int i = 0; i < N; ++i)
a[i] = i;
std::random_shuffle(a, a+N);
test(Iter(a), Iter(a+N));
test(Iter(a), Iter(a+N));
delete [] a;
}

6
test/algorithms/alg.sorting/alg.min.max/max_element_comp.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
// requires CopyConstructible<Compare>
// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
// requires CopyConstructible<Compare>
// Iter
// max_element(Iter first, Iter last, Compare comp);
@@ -42,7 +42,7 @@ test(unsigned N)
for (int i = 0; i < N; ++i)
a[i] = i;
std::random_shuffle(a, a+N);
test(Iter(a), Iter(a+N));
test(Iter(a), Iter(a+N));
delete [] a;
}

4
test/algorithms/alg.sorting/alg.min.max/max_init_list.pass.cpp
View File

@@ -9,7 +9,7 @@
// <algorithm>
// template <class T>
// template <class T>
// T
// max(initializer_list<T> t);
@@ -31,5 +31,5 @@ int main()
assert(i == 3);
i = std::max({1, 3, 2});
assert(i == 3);
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.sorting/alg.min.max/max_init_list_comp.pass.cpp
View File

@@ -9,7 +9,7 @@
// <algorithm>
// template<class T, class Compare>
// template<class T, class Compare>
// T
// max(initializer_list<T> t, Compare comp);
@@ -32,5 +32,5 @@ int main()
assert(i == 1);
i = std::max({1, 3, 2}, std::greater<int>());
assert(i == 1);
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.sorting/alg.min.max/min_comp.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<class T, StrictWeakOrder<auto, T> Compare>
// requires !SameType<T, Compare> && CopyConstructible<Compare>
// template<class T, StrictWeakOrder<auto, T> Compare>
// requires !SameType<T, Compare> && CopyConstructible<Compare>
// const T&
// min(const T& a, const T& b, Compare comp);

6
test/algorithms/alg.sorting/alg.min.max/min_element.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter>
// requires LessThanComparable<Iter::value_type>
// template<ForwardIterator Iter>
// requires LessThanComparable<Iter::value_type>
// Iter
// min_element(Iter first, Iter last);
@@ -41,7 +41,7 @@ test(unsigned N)
for (int i = 0; i < N; ++i)
a[i] = i;
std::random_shuffle(a, a+N);
test(Iter(a), Iter(a+N));
test(Iter(a), Iter(a+N));
delete [] a;
}

6
test/algorithms/alg.sorting/alg.min.max/min_element_comp.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
// requires CopyConstructible<Compare>
// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
// requires CopyConstructible<Compare>
// Iter
// min_element(Iter first, Iter last, Compare comp);
@@ -42,7 +42,7 @@ test(unsigned N)
for (int i = 0; i < N; ++i)
a[i] = i;
std::random_shuffle(a, a+N);
test(Iter(a), Iter(a+N));
test(Iter(a), Iter(a+N));
delete [] a;
}

4
test/algorithms/alg.sorting/alg.min.max/min_init_list.pass.cpp
View File

@@ -9,7 +9,7 @@
// <algorithm>
// template<class T>
// template<class T>
// T
// min(initializer_list<T> t);
@@ -31,5 +31,5 @@ int main()
assert(i == 1);
i = std::min({1, 3, 2});
assert(i == 1);
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.sorting/alg.min.max/min_init_list_comp.pass.cpp
View File

@@ -9,7 +9,7 @@
// <algorithm>
// template<class T, class Compare>
// template<class T, class Compare>
// T
// min(initializer_list<T> t, Compare comp);
@@ -32,5 +32,5 @@ int main()
assert(i == 3);
i = std::min({1, 3, 2}, std::greater<int>());
assert(i == 3);
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.sorting/alg.min.max/minmax_comp.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<class T, StrictWeakOrder<auto, T> Compare>
// requires !SameType<T, Compare> && CopyConstructible<Compare>
// template<class T, StrictWeakOrder<auto, T> Compare>
// requires !SameType<T, Compare> && CopyConstructible<Compare>
// pair<const T&, const T&>
// minmax(const T& a, const T& b, Compare comp);

8
test/algorithms/alg.sorting/alg.min.max/minmax_element.pass.cpp
View File

@@ -9,9 +9,9 @@
// <algorithm>
// template<ForwardIterator Iter>
// requires LessThanComparable<Iter::value_type>
// pair<Iter, Iter>
// template<ForwardIterator Iter>
// requires LessThanComparable<Iter::value_type>
// pair<Iter, Iter>
// minmax_element(Iter first, Iter last);
#include <algorithm>
@@ -47,7 +47,7 @@ test(unsigned N)
for (int i = 0; i < N; ++i)
a[i] = i;
std::random_shuffle(a, a+N);
test(Iter(a), Iter(a+N));
test(Iter(a), Iter(a+N));
delete [] a;
}

6
test/algorithms/alg.sorting/alg.min.max/minmax_element_comp.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
// requires CopyConstructible<Compare>
// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
// requires CopyConstructible<Compare>
// pair<Iter, Iter>
// minmax_element(Iter first, Iter last, Compare comp);
@@ -50,7 +50,7 @@ test(unsigned N)
for (int i = 0; i < N; ++i)
a[i] = i;
std::random_shuffle(a, a+N);
test(Iter(a), Iter(a+N));
test(Iter(a), Iter(a+N));
delete [] a;
}

4
test/algorithms/alg.sorting/alg.min.max/minmax_init_list.pass.cpp
View File

@@ -9,7 +9,7 @@
// <algorithm>
// template<class T>
// template<class T>
// pair<T, T>
// minmax(initializer_list<T> t);
@@ -25,5 +25,5 @@ int main()
assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)));
assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3)));
assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3)));
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.sorting/alg.min.max/minmax_init_list_comp.pass.cpp
View File

@@ -9,7 +9,7 @@
// <algorithm>
// template<class T, class Compare>
// template<class T, class Compare>
// pair<T, T>
// minmax(initializer_list<T> t, Compare comp);
@@ -26,5 +26,5 @@ int main()
assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)));
assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
#endif
#endif // _LIBCPP_MOVE
}