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.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter>
// requires EqualityComparable<Iter::value_type>
// template<ForwardIterator Iter>
// requires EqualityComparable<Iter::value_type>
// Iter
// adjacent_find(Iter first, Iter last);

4
test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter, EquivalenceRelation<auto, Iter::value_type> Pred>
// requires CopyConstructible<Pred>
// template<ForwardIterator Iter, EquivalenceRelation<auto, Iter::value_type> Pred>
// requires CopyConstructible<Pred>
// Iter
// adjacent_find(Iter first, Iter last, Pred pred);

4
test/algorithms/alg.nonmodifying/alg.count/count.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<InputIterator Iter, class T>
// requires HasEqualTo<Iter::value_type, T>
// template<InputIterator Iter, class T>
// requires HasEqualTo<Iter::value_type, T>
// Iter::difference_type
// count(Iter first, Iter last, const T& value);

4
test/algorithms/alg.nonmodifying/alg.count/count_if.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred>
// requires CopyConstructible<Pred>
// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred>
// requires CopyConstructible<Pred>
// Iter::difference_type
// count_if(Iter first, Iter last, Pred pred);

4
test/algorithms/alg.nonmodifying/alg.equal/equal.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<InputIterator Iter1, InputIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// template<InputIterator Iter1, InputIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// bool
// equal(Iter1 first1, Iter1 last1, Iter2 first2);

6
test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp
View File

@@ -9,9 +9,9 @@
// <algorithm>
// template<InputIterator Iter1, InputIterator Iter2,
// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
// requires CopyConstructible<Pred>
// template<InputIterator Iter1, InputIterator Iter2,
// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
// requires CopyConstructible<Pred>
// bool
// equal(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred);

4
test/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// template<ForwardIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// Iter1
// find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);

6
test/algorithms/alg.nonmodifying/alg.find.end/find_end_pred.pass.cpp
View File

@@ -9,9 +9,9 @@
// <algorithm>
// template<ForwardIterator Iter1, ForwardIterator Iter2,
// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
// requires CopyConstructible<Pred>
// template<ForwardIterator Iter1, ForwardIterator Iter2,
// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
// requires CopyConstructible<Pred>
// Iter1
// find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);

4
test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<InputIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// template<InputIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// Iter1
// find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);

6
test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of_pred.pass.cpp
View File

@@ -9,9 +9,9 @@
// <algorithm>
// template<InputIterator Iter1, ForwardIterator Iter2,
// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
// requires CopyConstructible<Pred>
// template<InputIterator Iter1, ForwardIterator Iter2,
// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
// requires CopyConstructible<Pred>
// Iter1
// find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);

4
test/algorithms/alg.nonmodifying/alg.find/find.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<InputIterator Iter, class T>
// requires HasEqualTo<Iter::value_type, T>
// template<InputIterator Iter, class T>
// requires HasEqualTo<Iter::value_type, T>
// Iter
// find(Iter first, Iter last, const T& value);

4
test/algorithms/alg.nonmodifying/alg.find/find_if.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred>
// requires CopyConstructible<Pred>
// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred>
// requires CopyConstructible<Pred>
// Iter
// find_if(Iter first, Iter last, Pred pred);

4
test/algorithms/alg.nonmodifying/alg.find/find_if_not.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred>
// requires CopyConstructible<Pred>
// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred>
// requires CopyConstructible<Pred>
// Iter
// find_if_not(Iter first, Iter last, Pred pred);

4
test/algorithms/alg.nonmodifying/alg.foreach/test.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<InputIterator Iter, Callable<auto, Iter::reference> Function>
// requires CopyConstructible<Function>
// template<InputIterator Iter, Callable<auto, Iter::reference> Function>
// requires CopyConstructible<Function>
// Function
// for_each(Iter first, Iter last, Function f);

4
test/algorithms/alg.nonmodifying/alg.search/search.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// template<ForwardIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// Iter1
// search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);

4
test/algorithms/alg.nonmodifying/alg.search/search_pred.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// template<ForwardIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// Iter1
// search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);

4
test/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<InputIterator Iter1, InputIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// template<InputIterator Iter1, InputIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// pair<Iter1, Iter2>
// mismatch(Iter1 first1, Iter1 last1, Iter2 first2);

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

@@ -9,9 +9,9 @@
// <algorithm>
// template<InputIterator Iter1, InputIterator Iter2,
// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
// requires CopyConstructible<Pred>
// template<InputIterator Iter1, InputIterator Iter2,
// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
// requires CopyConstructible<Pred>
// pair<Iter1, Iter2>
// mismatch(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred);