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
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp
View File

@ -56,7 +56,7 @@ test1()
assert(*ib[i] == i);
}
#endif
#endif // _LIBCPP_MOVE
int main()
{
@ -130,5 +130,5 @@ int main()
test1<std::unique_ptr<int>*, bidirectional_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*, std::unique_ptr<int>*>();
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.modifying.operations/alg.move/move_backward.pass.cpp
View File

@ -56,7 +56,7 @@ test1()
assert(*ib[i] == i);
}
#endif
#endif // _LIBCPP_MOVE
int main()
{
@ -84,5 +84,5 @@ int main()
test1<std::unique_ptr<int>*, bidirectional_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*, std::unique_ptr<int>*>();
#endif
#endif // _LIBCPP_MOVE
}

1
test/algorithms/alg.modifying.operations/alg.partitions/is_partitioned.pass.cpp
View File

@ -13,7 +13,6 @@
// bool
// is_partitioned(InputIterator first, InputIterator last, Predicate pred);
#include <algorithm>
#include <cassert>

2
test/algorithms/alg.modifying.operations/alg.partitions/stable_partition.pass.cpp
View File

@ -300,7 +300,7 @@ test1()
Iter r = std::stable_partition(Iter(array), Iter(array+size), is_null());
}
#endif
#endif // _LIBCPP_MOVE
int main()
{

4
test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp
View File

@ -63,7 +63,7 @@ test1()
assert(*ia[5] == 4);
}
#endif
#endif // _LIBCPP_MOVE
int main()
{
@ -79,5 +79,5 @@ int main()
test1<random_access_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*>();
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp
View File

@ -72,7 +72,7 @@ test1()
assert(*ia[5] == 4);
}
#endif
#endif // _LIBCPP_MOVE
int main()
{
@ -88,5 +88,5 @@ int main()
test1<random_access_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*>();
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.modifying.operations/alg.rotate/rotate.pass.cpp
View File

@ -419,7 +419,7 @@ test1()
assert(*ig[5] == 2);
}
#endif
#endif // _LIBCPP_MOVE
int main()
{
@ -435,5 +435,5 @@ int main()
test1<random_access_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*>();
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp
View File

@ -60,7 +60,7 @@ test1()
assert(*j[2] == 3);
}
#endif
#endif // _LIBCPP_MOVE
int main()
{
@ -106,5 +106,5 @@ int main()
test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*, std::unique_ptr<int>*>();
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp
View File

@ -169,7 +169,7 @@ test1()
assert(*ii[2] == 2);
}
#endif
#endif // _LIBCPP_MOVE
int main()
{
@ -185,5 +185,5 @@ int main()
test1<random_access_iterator<Ptr*> >();
test1<Ptr*>();
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.modifying.operations/alg.unique/unique_pred.pass.cpp
View File

@ -211,7 +211,7 @@ test1()
assert(count_equal::count == si-1);
}
#endif
#endif // _LIBCPP_MOVE
int main()
{
@ -227,5 +227,5 @@ int main()
test1<random_access_iterator<Ptr*> >();
test1<Ptr*>();
#endif
#endif // _LIBCPP_MOVE
}

1
test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp
View File

@ -17,7 +17,6 @@
#include <algorithm>
#include <cassert>
void test()
{
int i1[] = {0, 0};

1
test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp
View File

@ -18,7 +18,6 @@
#include <functional>
#include <cassert>
void test()
{
int i1[] = {0, 0};

1
test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp
View File

@ -17,7 +17,6 @@
#include <algorithm>
#include <cassert>
void test()
{
int i1[] = {0, 0};

1
test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp
View File

@ -17,7 +17,6 @@
#include <algorithm>
#include <cassert>
void test(unsigned N)
{
int* ia = new int [N];

4
test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp
View File

@ -27,7 +27,7 @@ struct indirect_less
{return *x < *y;}
};
#endif
#endif // _LIBCPP_MOVE
void test(unsigned N)
{
@ -60,5 +60,5 @@ int main()
assert(std::is_heap(ia, ia+N, indirect_less()));
delete [] ia;
}
#endif
#endif // _LIBCPP_MOVE
}

1
test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp
View File

@ -17,7 +17,6 @@
#include <algorithm>
#include <cassert>
void test(unsigned N)
{
int* ia = new int [N];

4
test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp
View File

@ -27,7 +27,7 @@ struct indirect_less
{return *x < *y;}
};
#endif
#endif // _LIBCPP_MOVE
void test(unsigned N)
{
@ -64,5 +64,5 @@ int main()
}
delete [] ia;
}
#endif
#endif // _LIBCPP_MOVE
}

1
test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp
View File

@ -18,7 +18,6 @@
#include <algorithm>
#include <cassert>
void test(unsigned N)
{
int* ia = new int [N];

4
test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp
View File

@ -28,7 +28,7 @@ struct indirect_less
{return *x < *y;}
};
#endif
#endif // _LIBCPP_MOVE
void test(unsigned N)
{
@ -62,5 +62,5 @@ int main()
}
delete [] ia;
}
#endif
#endif // _LIBCPP_MOVE
}

1
test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp
View File

@ -17,7 +17,6 @@
#include <algorithm>
#include <cassert>
void test(unsigned N)
{
int* ia = new int [N];

4
test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp
View File

@ -27,7 +27,7 @@ struct indirect_less
{return *x < *y;}
};
#endif
#endif // _LIBCPP_MOVE
void test(unsigned N)
{
@ -62,5 +62,5 @@ int main()
assert(std::is_sorted(ia, ia+N, indirect_less()));
delete [] ia;
}
#endif
#endif // _LIBCPP_MOVE
}

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

@ -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
}

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

@ -31,5 +31,5 @@ int main()
assert(i == 3);
i = std::max({1, 3, 2});
assert(i == 3);
#endif
#endif // _LIBCPP_MOVE
}

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

@ -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
}

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

@ -31,5 +31,5 @@ int main()
assert(i == 1);
i = std::min({1, 3, 2});
assert(i == 1);
#endif
#endif // _LIBCPP_MOVE
}

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

@ -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
}

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

@ -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
}

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

@ -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
}

4
test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp
View File

@ -29,7 +29,7 @@ struct indirect_less
{return *x < *y;}
};
#endif
#endif // _LIBCPP_MOVE
void
test_one(unsigned N, unsigned M)
@ -81,5 +81,5 @@ int main()
std::nth_element(v.begin(), v.begin() + v.size()/2, v.end(), indirect_less());
assert(*v[v.size()/2] == v.size()/2);
}
#endif
#endif // _LIBCPP_MOVE
}

1
test/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp
View File

@ -41,7 +41,6 @@ test()
assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb)));
assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa)));
assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2)));
assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2)));

1
test/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp
View File

@ -42,7 +42,6 @@ test()
assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>()));
assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), std::less<int>()));
assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>()));
assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2), std::less<int>()));

4
test/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort_comp.pass.cpp
View File

@ -29,7 +29,7 @@ struct indirect_less
{return *x < *y;}
};
#endif
#endif // _LIBCPP_MOVE
void
test_larger_sorts(unsigned N, unsigned M)
@ -83,5 +83,5 @@ int main()
for (int i = 0; i < v.size()/2; ++i)
assert(*v[i] == i);
}
#endif
#endif // _LIBCPP_MOVE
}

5
test/algorithms/alg.sorting/alg.sort/sort/sort_comp.pass.cpp
View File

@ -29,8 +29,7 @@ struct indirect_less
{return *x < *y;}
};
#endif
#endif // _LIBCPP_MOVE
int main()
{
@ -54,5 +53,5 @@ int main()
assert(*v[1] == 1);
assert(*v[2] == 2);
}
#endif
#endif // _LIBCPP_MOVE
}

4
test/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort_comp.pass.cpp
View File

@ -29,7 +29,7 @@ struct indirect_less
{return *x < *y;}
};
#endif
#endif // _LIBCPP_MOVE
struct first_only
{
@ -79,5 +79,5 @@ int main()
assert(*v[1] == 1);
assert(*v[2] == 2);
}
#endif
#endif // _LIBCPP_MOVE
}

2
test/algorithms/iterators.h
View File

@ -311,4 +311,4 @@ base(Iter i)
return i;
}
#endif
#endif // ITERATORS_H