LineageOS/android_external_libcxx
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

[libcxx] [test] Untabify, NFC.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@309464 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Stephan T. Lavavej
2017-07-29 00:55:10 +00:00
parent 62e519c2f9
commit a686caad20
121 changed files with 786 additions and 786 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
test/std/containers/associative/map/map.cons/compare_copy_constructible.fail.cpp
View File

@@ -16,14 +16,14 @@
template <class T>
struct Comp {
bool operator () (const T& lhs, const T& rhs) const { return lhs < rhs; }
bool operator () (const T& lhs, const T& rhs) const { return lhs < rhs; }
Comp () {}
Comp () {}
private:
Comp (const Comp &); // declared but not defined
};
Comp (const Comp &); // declared but not defined
};
int main() {
std::map<int, int, Comp<int> > m;
std::map<int, int, Comp<int> > m;
}

10
test/std/containers/associative/multimap/multimap.cons/compare_copy_constructible.fail.cpp
View File

@@ -16,14 +16,14 @@
template <class T>
struct Comp {
bool operator () (const T& lhs, const T& rhs) const { return lhs < rhs; }
bool operator () (const T& lhs, const T& rhs) const { return lhs < rhs; }
Comp () {}
Comp () {}
private:
Comp (const Comp &); // declared but not defined
};
Comp (const Comp &); // declared but not defined
};
int main() {
std::multimap<int, int, Comp<int> > m;
std::multimap<int, int, Comp<int> > m;
}

10
test/std/containers/associative/multiset/multiset.cons/compare_copy_constructible.fail.cpp
View File

@@ -16,14 +16,14 @@
template <class T>
struct Comp {
bool operator () (const T& lhs, const T& rhs) const { return lhs < rhs; }
bool operator () (const T& lhs, const T& rhs) const { return lhs < rhs; }
Comp () {}
Comp () {}
private:
Comp (const Comp &); // declared but not defined
};
Comp (const Comp &); // declared but not defined
};
int main() {
std::multiset<int, Comp<int> > m;
std::multiset<int, Comp<int> > m;
}

10
test/std/containers/associative/set/set.cons/compare_copy_constructible.fail.cpp
View File

@@ -16,14 +16,14 @@
template <class T>
struct Comp {
bool operator () (const T& lhs, const T& rhs) const { return lhs < rhs; }
bool operator () (const T& lhs, const T& rhs) const { return lhs < rhs; }
Comp () {}
Comp () {}
private:
Comp (const Comp &); // declared but not defined
};
Comp (const Comp &); // declared but not defined
};
int main() {
std::set<int, Comp<int> > m;
std::set<int, Comp<int> > m;
}

2
test/std/containers/container.adaptors/priority.queue/types.fail.cpp
View File

@@ -31,5 +31,5 @@
int main()
{
// LWG#2566 says that the first template param must match the second one's value type
std::priority_queue<double, std::deque<int>> t;
std::priority_queue<double, std::deque<int>> t;
}

2
test/std/containers/container.adaptors/queue/queue.defn/types.fail.cpp
View File

@@ -16,5 +16,5 @@
int main()
{
// LWG#2566 says that the first template param must match the second one's value type
std::queue<double, std::deque<int>> t;
std::queue<double, std::deque<int>> t;
}

2
test/std/containers/container.adaptors/stack/stack.defn/types.fail.cpp
View File

@@ -31,5 +31,5 @@
int main()
{
// LWG#2566 says that the first template param must match the second one's value type
std::stack<double, std::deque<int>> t;
std::stack<double, std::deque<int>> t;
}

2
test/std/containers/sequences/array/at.pass.cpp
View File

@@ -27,7 +27,7 @@
constexpr bool check_idx( size_t idx, double val )
{
std::array<double, 3> arr = {1, 2, 3.5};
return arr.at(idx) == val;
return arr.at(idx) == val;
}
#endif

4
test/std/containers/sequences/array/front_back.pass.cpp
View File

@@ -27,13 +27,13 @@
constexpr bool check_front( double val )
{
std::array<double, 3> arr = {1, 2, 3.5};
return arr.front() == val;
return arr.front() == val;
}
constexpr bool check_back( double val )
{
std::array<double, 3> arr = {1, 2, 3.5};
return arr.back() == val;
return arr.back() == val;
}
#endif

2
test/std/containers/sequences/array/indexing.pass.cpp
View File

@@ -27,7 +27,7 @@
constexpr bool check_idx( size_t idx, double val )
{
std::array<double, 3> arr = {1, 2, 3.5};
return arr[idx] == val;
return arr[idx] == val;
}
#endif

10
test/std/containers/sequences/deque/deque.modifiers/push_back_exception_safety.pass.cpp
View File

@@ -80,17 +80,17 @@ int main()
assert(false);
}
catch (...) {
gCopyConstructorShouldThow = false;
gCopyConstructorShouldThow = false;
assert(vec==vec2);
}
}
}
{
typedef std::deque<CMyClass, test_allocator<CMyClass> > C;
{
typedef std::deque<CMyClass, test_allocator<CMyClass> > C;
C vec;
C vec2(vec);
C::allocator_type::throw_after = 1;
C::allocator_type::throw_after = 1;
try {
vec.push_back(instance);
assert(false);

10
test/std/containers/sequences/deque/deque.modifiers/push_front_exception_safety.pass.cpp
View File

@@ -80,17 +80,17 @@ int main()
assert(false);
}
catch (...) {
gCopyConstructorShouldThow = false;
gCopyConstructorShouldThow = false;
assert(vec==vec2);
}
}
}
{
typedef std::deque<CMyClass, test_allocator<CMyClass> > C;
{
typedef std::deque<CMyClass, test_allocator<CMyClass> > C;
C vec;
C vec2(vec);
C::allocator_type::throw_after = 1;
C::allocator_type::throw_after = 1;
try {
vec.push_front(instance);
assert(false);

8
test/std/containers/sequences/list/types.pass.cpp
View File

@@ -31,8 +31,8 @@ struct A { std::list<A> v; }; // incomplete type support
int main()
{
{
typedef std::list<int> C;
{
typedef std::list<int> C;
static_assert((std::is_same<C::value_type, int>::value), "");
static_assert((std::is_same<C::allocator_type, std::allocator<int> >::value), "");
static_assert((std::is_same<C::reference, std::allocator<int>::reference>::value), "");
@@ -46,11 +46,11 @@ int main()
typename std::iterator_traits<typename C::iterator>::difference_type>::value), "");
static_assert((std::is_same<typename C::difference_type,
typename std::iterator_traits<typename C::const_iterator>::difference_type>::value), "");
}
}
#if TEST_STD_VER >= 11
{
typedef std::list<int, min_allocator<int>> C;
typedef std::list<int, min_allocator<int>> C;
static_assert((std::is_same<C::value_type, int>::value), "");
static_assert((std::is_same<C::allocator_type, min_allocator<int> >::value), "");
static_assert((std::is_same<C::reference, int&>::value), "");

8
test/std/containers/sequences/vector.bool/construct_default.pass.cpp
View File

@@ -24,9 +24,9 @@ void
test0()
{
#if TEST_STD_VER > 14
static_assert((noexcept(C{})), "" );
static_assert((noexcept(C{})), "" );
#elif TEST_STD_VER >= 11
static_assert((noexcept(C()) == noexcept(typename C::allocator_type())), "" );
static_assert((noexcept(C()) == noexcept(typename C::allocator_type())), "" );
#endif
C c;
LIBCPP_ASSERT(c.__invariants());
@@ -45,9 +45,9 @@ void
test1(const typename C::allocator_type& a)
{
#if TEST_STD_VER > 14
static_assert((noexcept(C{typename C::allocator_type{}})), "" );
static_assert((noexcept(C{typename C::allocator_type{}})), "" );
#elif TEST_STD_VER >= 11
static_assert((noexcept(C(typename C::allocator_type())) == std::is_nothrow_copy_constructible<typename C::allocator_type>::value), "" );
static_assert((noexcept(C(typename C::allocator_type())) == std::is_nothrow_copy_constructible<typename C::allocator_type>::value), "" );
#endif
C c(a);
LIBCPP_ASSERT(c.__invariants());

16
test/std/containers/sequences/vector.bool/reference.swap.pass.cpp
View File

@@ -23,17 +23,17 @@ int main()
bool a[] = {false, true, false, true};
bool* an = a + sizeof(a)/sizeof(a[0]);
std::vector<bool> v(a, an);
std::vector<bool>::reference r1 = v[0];
std::vector<bool>::reference r2 = v[3];
std::vector<bool> v(a, an);
std::vector<bool>::reference r1 = v[0];
std::vector<bool>::reference r2 = v[3];
#if TEST_STD_VER >= 11
static_assert((noexcept(v.swap(r1,r2))), "");
#endif
assert(!r1);
assert( r2);
v.swap(r1, r2);
assert( r1);
assert(!r2);
assert(!r1);
assert( r2);
v.swap(r1, r2);
assert( r1);
assert(!r2);
}

8
test/std/containers/sequences/vector/vector.cons/construct_default.pass.cpp
View File

@@ -27,9 +27,9 @@ void
test0()
{
#if TEST_STD_VER > 14
static_assert((noexcept(C{})), "" );
static_assert((noexcept(C{})), "" );
#elif TEST_STD_VER >= 11
static_assert((noexcept(C()) == noexcept(typename C::allocator_type())), "" );
static_assert((noexcept(C()) == noexcept(typename C::allocator_type())), "" );
#endif
C c;
LIBCPP_ASSERT(c.__invariants());
@@ -50,9 +50,9 @@ void
test1(const typename C::allocator_type& a)
{
#if TEST_STD_VER > 14
static_assert((noexcept(C{typename C::allocator_type{}})), "" );
static_assert((noexcept(C{typename C::allocator_type{}})), "" );
#elif TEST_STD_VER >= 11
static_assert((noexcept(C(typename C::allocator_type())) == std::is_nothrow_copy_constructible<typename C::allocator_type>::value), "" );
static_assert((noexcept(C(typename C::allocator_type())) == std::is_nothrow_copy_constructible<typename C::allocator_type>::value), "" );
#endif
C c(a);
LIBCPP_ASSERT(c.__invariants());

12
test/std/containers/sequences/vector/vector.data/data.pass.cpp
View File

@@ -18,13 +18,13 @@
#include "asan_testing.h"
struct Nasty {
Nasty() : i_(0) {}
Nasty(int i) : i_(i) {}
~Nasty() {}
Nasty() : i_(0) {}
Nasty(int i) : i_(i) {}
~Nasty() {}
Nasty * operator&() const { assert(false); return nullptr; }
int i_;
};
Nasty * operator&() const { assert(false); return nullptr; }
int i_;
};
int main()
{

12
test/std/containers/sequences/vector/vector.data/data_const.pass.cpp
View File

@@ -18,13 +18,13 @@
#include "asan_testing.h"
struct Nasty {
Nasty() : i_(0) {}
Nasty(int i) : i_(i) {}
~Nasty() {}
Nasty() : i_(0) {}
Nasty(int i) : i_(i) {}
~Nasty() {}
Nasty * operator&() const { assert(false); return nullptr; }
int i_;
};
Nasty * operator&() const { assert(false); return nullptr; }
int i_;
};
int main()
{

2
test/std/containers/unord/unord.map/rehash.pass.cpp
View File

@@ -25,7 +25,7 @@
template <class C>
void rehash_postcondition(const C& c, size_t n)
{
assert(c.bucket_count() >= c.size() / c.max_load_factor() && c.bucket_count() >= n);
assert(c.bucket_count() >= c.size() / c.max_load_factor() && c.bucket_count() >= n);
}
template <class C>

10
test/std/containers/unord/unord.map/unord.map.cnstr/compare_copy_constructible.fail.cpp
View File

@@ -19,14 +19,14 @@
template <class T>
struct Comp {
bool operator () (const T& lhs, const T& rhs) const { return lhs == rhs; }
bool operator () (const T& lhs, const T& rhs) const { return lhs == rhs; }
Comp () {}
Comp () {}
private:
Comp (const Comp &); // declared but not defined
};
Comp (const Comp &); // declared but not defined
};
int main() {
std::unordered_map<int, int, std::hash<int>, Comp<int> > m;
std::unordered_map<int, int, std::hash<int>, Comp<int> > m;
}

8
test/std/containers/unord/unord.map/unord.map.cnstr/hash_copy_constructible.fail.cpp
View File

@@ -19,14 +19,14 @@
template <class T>
struct Hash {
std::size_t operator () (const T& lhs) const { return 0; }
std::size_t operator () (const T& lhs) const { return 0; }
Hash () {}
Hash () {}
private:
Hash (const Hash &); // declared but not defined
Hash (const Hash &); // declared but not defined
};
int main() {
std::unordered_map<int, int, Hash<int> > m;
std::unordered_map<int, int, Hash<int> > m;
}

2
test/std/containers/unord/unord.map/unord.map.swap/swap_noexcept.pass.cpp
View File

@@ -122,7 +122,7 @@ struct some_alloc3
int main()
{
typedef std::pair<const MoveOnly, MoveOnly> MapType;
typedef std::pair<const MoveOnly, MoveOnly> MapType;
{
typedef std::unordered_map<MoveOnly, MoveOnly> C;
static_assert(noexcept(swap(std::declval<C&>(), std::declval<C&>())), "");

2
test/std/containers/unord/unord.multimap/rehash.pass.cpp
View File

@@ -28,7 +28,7 @@
template <class C>
void rehash_postcondition(const C& c, size_t n)
{
assert(c.bucket_count() >= c.size() / c.max_load_factor() && c.bucket_count() >= n);
assert(c.bucket_count() >= c.size() / c.max_load_factor() && c.bucket_count() >= n);
}
template <class C>

10
test/std/containers/unord/unord.multimap/unord.multimap.cnstr/compare_copy_constructible.fail.cpp
View File

@@ -19,14 +19,14 @@
template <class T>
struct Comp {
bool operator () (const T& lhs, const T& rhs) const { return lhs == rhs; }
bool operator () (const T& lhs, const T& rhs) const { return lhs == rhs; }
Comp () {}
Comp () {}
private:
Comp (const Comp &); // declared but not defined
};
Comp (const Comp &); // declared but not defined
};
int main() {
std::unordered_multimap<int, int, std::hash<int>, Comp<int> > m;
std::unordered_multimap<int, int, std::hash<int>, Comp<int> > m;
}

10
test/std/containers/unord/unord.multimap/unord.multimap.cnstr/hash_copy_constructible.fail.cpp
View File

@@ -19,14 +19,14 @@
template <class T>
struct Hash {
std::size_t operator () (const T& lhs) const { return 0; }
std::size_t operator () (const T& lhs) const { return 0; }
Hash () {}
Hash () {}
private:
Hash (const Hash &); // declared but not defined
};
Hash (const Hash &); // declared but not defined
};
int main() {
std::unordered_multimap<int, int, Hash<int> > m;
std::unordered_multimap<int, int, Hash<int> > m;
}

2
test/std/containers/unord/unord.multiset/rehash.pass.cpp
View File

@@ -24,7 +24,7 @@
template <class C>
void rehash_postcondition(const C& c, size_t n)
{
assert(c.bucket_count() >= c.size() / c.max_load_factor() && c.bucket_count() >= n);
assert(c.bucket_count() >= c.size() / c.max_load_factor() && c.bucket_count() >= n);
}
template <class C>

10
test/std/containers/unord/unord.multiset/unord.multiset.cnstr/compare_copy_constructible.fail.cpp
View File

@@ -16,14 +16,14 @@
template <class T>
struct Comp {
bool operator () (const T& lhs, const T& rhs) const { return lhs == rhs; }
bool operator () (const T& lhs, const T& rhs) const { return lhs == rhs; }
Comp () {}
Comp () {}
private:
Comp (const Comp &); // declared but not defined
};
Comp (const Comp &); // declared but not defined
};
int main() {
std::unordered_multiset<int, std::hash<int>, Comp<int> > m;
std::unordered_multiset<int, std::hash<int>, Comp<int> > m;
}

10
test/std/containers/unord/unord.multiset/unord.multiset.cnstr/hash_copy_constructible.fail.cpp
View File

@@ -16,14 +16,14 @@
template <class T>
struct Hash {
std::size_t operator () (const T& lhs) const { return 0; }
std::size_t operator () (const T& lhs) const { return 0; }
Hash () {}
Hash () {}
private:
Hash (const Hash &); // declared but not defined
};
Hash (const Hash &); // declared but not defined
};
int main() {
std::unordered_multiset<int, Hash<int> > m;
std::unordered_multiset<int, Hash<int> > m;
}

2
test/std/containers/unord/unord.set/rehash.pass.cpp
View File

@@ -24,7 +24,7 @@
template <class C>
void rehash_postcondition(const C& c, size_t n)
{
assert(c.bucket_count() >= c.size() / c.max_load_factor() && c.bucket_count() >= n);
assert(c.bucket_count() >= c.size() / c.max_load_factor() && c.bucket_count() >= n);
}
template <class C>

10
test/std/containers/unord/unord.set/unord.set.cnstr/compare_copy_constructible.fail.cpp
View File

@@ -16,14 +16,14 @@
template <class T>
struct Comp {
bool operator () (const T& lhs, const T& rhs) const { return lhs == rhs; }
bool operator () (const T& lhs, const T& rhs) const { return lhs == rhs; }
Comp () {}
Comp () {}
private:
Comp (const Comp &); // declared but not defined
};
Comp (const Comp &); // declared but not defined
};
int main() {
std::unordered_set<int, std::hash<int>, Comp<int> > m;
std::unordered_set<int, std::hash<int>, Comp<int> > m;
}

2
test/std/containers/unord/unord.set/unord.set.cnstr/default.pass.cpp
View File

@@ -82,7 +82,7 @@ int main()
assert(c.max_load_factor() == 1);
}
{
A a;
A a;
C c(a);
LIBCPP_ASSERT(c.bucket_count() == 0);
assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());

10
test/std/containers/unord/unord.set/unord.set.cnstr/hash_copy_constructible.fail.cpp
View File

@@ -16,14 +16,14 @@
template <class T>
struct Hash {
std::size_t operator () (const T& lhs) const { return 0; }
std::size_t operator () (const T& lhs) const { return 0; }
Hash () {}
Hash () {}
private:
Hash (const Hash &); // declared but not defined
};
Hash (const Hash &); // declared but not defined
};
int main() {
std::unordered_set<int, Hash<int> > m;
std::unordered_set<int, Hash<int> > m;
}