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.binary.search/binary.search/binary_search.pass.cpp
View File

@@ -9,9 +9,9 @@
// <algorithm>
// template<ForwardIterator Iter, class T>
// requires HasLess<T, Iter::value_type>
// && HasLess<Iter::value_type, T>
// template<ForwardIterator Iter, class T>
// requires HasLess<T, Iter::value_type>
// && HasLess<Iter::value_type, T>
// bool
// binary_search(Iter first, Iter last, const T& value);

6
test/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search_comp.pass.cpp
View File

@@ -9,9 +9,9 @@
// <algorithm>
// template<ForwardIterator Iter, class T, CopyConstructible Compare>
// requires Predicate<Compare, T, Iter::value_type>
// && Predicate<Compare, Iter::value_type, T>
// template<ForwardIterator Iter, class T, CopyConstructible Compare>
// requires Predicate<Compare, T, Iter::value_type>
// && Predicate<Compare, Iter::value_type, T>
// bool
// binary_search(Iter first, Iter last, const T& value, Compare comp);

8
test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range.pass.cpp
View File

@@ -9,10 +9,10 @@
// <algorithm>
// template<ForwardIterator Iter, class T>
// requires HasLess<T, Iter::value_type>
// && HasLess<Iter::value_type, T>
// pair<Iter, Iter>
// template<ForwardIterator Iter, class T>
// requires HasLess<T, Iter::value_type>
// && HasLess<Iter::value_type, T>
// pair<Iter, Iter>
// equal_range(Iter first, Iter last, const T& value);
#include <algorithm>

8
test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range_comp.pass.cpp
View File

@@ -9,10 +9,10 @@
// <algorithm>
// template<ForwardIterator Iter, class T, CopyConstructible Compare>
// requires Predicate<Compare, T, Iter::value_type>
// && Predicate<Compare, Iter::value_type, T>
// pair<Iter, Iter>
// template<ForwardIterator Iter, class T, CopyConstructible Compare>
// requires Predicate<Compare, T, Iter::value_type>
// && Predicate<Compare, Iter::value_type, T>
// pair<Iter, Iter>
// equal_range(Iter first, Iter last, const T& value, Compare comp);
#include <algorithm>

4
test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound.pass.cpp
View File

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

4
test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound_comp.pass.cpp
View File

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

4
test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound.pass.cpp
View File

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

4
test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound_comp.pass.cpp
View File

@@ -9,8 +9,8 @@
// <algorithm>
// template<ForwardIterator Iter, class T, Predicate<auto, T, Iter::value_type> Compare>
// requires CopyConstructible<Compare>
// template<ForwardIterator Iter, class T, Predicate<auto, T, Iter::value_type> Compare>
// requires CopyConstructible<Compare>
// Iter
// upper_bound(Iter first, Iter last, const T& value, Compare comp);