llvm/libcxx
1
0
Fork 0
mirror of https://github.com/llvm-mirror/libcxx.git synced 2025-10-24 03:32:35 +08:00
Code Issues Packages Projects 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.permutation.generators/next_permutation.pass.cpp
View File

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

6
test/algorithms/alg.sorting/alg.permutation.generators/next_permutation_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>
// bool
// next_permutation(Iter first, Iter last, Compare comp);

6
test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation.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>
// bool
// prev_permutation(Iter first, Iter last);

6
test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation_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>
// bool
// prev_permutation(Iter first, Iter last, Compare comp);