[libcxx] [test] D27266: Remove spurious semicolons.

git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@288750 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Stephan T. Lavavej
2016-12-06 01:14:06 +00:00
parent 43d9250a01
commit e2dbcaf969
13 changed files with 27 additions and 27 deletions

View File

@@ -215,7 +215,7 @@ int main()
assert(c.max_load_factor() == 1);
assert(c.hash_function() == test_hash<std::hash<int> >(8));
assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
assert(c.get_allocator() == A{});;
assert(c.get_allocator() == A{});
}
#endif
}

View File

@@ -27,9 +27,9 @@ int main()
assert(ss.good());
assert(ss.str() == " 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == "234 5676");
ss0 << i << ' ' << 567;;
ss0 << i << ' ' << 567;
assert(ss0.str() == "234 567");
}
{
@@ -40,9 +40,9 @@ int main()
assert(ss.good());
assert(ss.str() == L" 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == L"234 5676");
ss0 << i << ' ' << 567;;
ss0 << i << ' ' << 567;
assert(ss0.str() == L"234 567");
}
}

View File

@@ -28,7 +28,7 @@ int main()
assert(ss.good());
assert(ss.str() == " 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == "234 5676");
}
{
@@ -39,7 +39,7 @@ int main()
assert(ss.good());
assert(ss.str() == L" 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == L"234 5676");
}
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES

View File

@@ -27,9 +27,9 @@ int main()
assert(ss.good());
assert(ss.str() == " 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == "234 5676");
ss0 << i << ' ' << 567;;
ss0 << i << ' ' << 567;
assert(ss0.str() == "234 567");
}
{
@@ -40,9 +40,9 @@ int main()
assert(ss.good());
assert(ss.str() == L" 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == L"234 5676");
ss0 << i << ' ' << 567;;
ss0 << i << ' ' << 567;
assert(ss0.str() == L"234 567");
}
}

View File

@@ -27,7 +27,7 @@ int main()
assert(ss.good());
assert(ss.str() == " 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == "234 5676");
}
{
@@ -37,7 +37,7 @@ int main()
assert(ss.good());
assert(ss.str() == L" 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == L"234 5676");
}
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES

View File

@@ -26,7 +26,7 @@ int main()
assert(ss.good());
assert(ss.str() == " 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == "234 5676");
}
{
@@ -35,7 +35,7 @@ int main()
assert(ss.good());
assert(ss.str() == " 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == "234 5676");
}
{
@@ -44,7 +44,7 @@ int main()
assert(ss.good());
assert(ss.str() == L" 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == L"234 5676");
}
{
@@ -53,7 +53,7 @@ int main()
assert(ss.good());
assert(ss.str() == L" 123 456");
int i = 234;
ss << i << ' ' << 567;;
ss << i << ' ' << 567;
assert(ss.str() == L"234 5676");
}
}

View File

@@ -38,7 +38,7 @@ struct testbuf
int main()
{
{ // sanity check
testbuf<char> tb("");;
testbuf<char> tb("");
tb.overflow();
}
{

View File

@@ -36,7 +36,7 @@ struct testbuf
int main()
{
{ // sanity check
testbuf<char> tb("");;
testbuf<char> tb("");
tb.pbackfail();
}
{

View File

@@ -33,7 +33,7 @@ void test_op_and()
std::bitset<N> v1 = make_bitset<N>();
std::bitset<N> v2 = make_bitset<N>();
std::bitset<N> v3 = v1;
assert((v1 & v2) == (v3 &= v2));;
assert((v1 & v2) == (v3 &= v2));
}
int main()

View File

@@ -33,7 +33,7 @@ void test_op_not()
std::bitset<N> v1 = make_bitset<N>();
std::bitset<N> v2 = make_bitset<N>();
std::bitset<N> v3 = v1;
assert((v1 ^ v2) == (v3 ^= v2));;
assert((v1 ^ v2) == (v3 ^= v2));
}
int main()

View File

@@ -33,7 +33,7 @@ void test_op_or()
std::bitset<N> v1 = make_bitset<N>();
std::bitset<N> v2 = make_bitset<N>();
std::bitset<N> v3 = v1;
assert((v1 | v2) == (v3 |= v2));;
assert((v1 | v2) == (v3 |= v2));
}
int main()

View File

@@ -19,7 +19,7 @@
#include <tuple>
template <class T> void cref(T const&) {};
template <class T> void cref(T const&) {}
template <class T> void cref(T const&&) = delete;
std::tuple<int> const tup4() { return std::make_tuple(4); }

View File

@@ -214,7 +214,7 @@ public:
: Base(&makeArgumentID<UsesAllocatorV1 &&>()) {}
// Non-Uses Allocator Ctor
template <class ...Args, EnableIfB<sizeof...(Args) == Arity> = false>
UsesAllocatorV1(Args&&... args) : Base(&makeArgumentID<Args&&...>()) {};
UsesAllocatorV1(Args&&... args) : Base(&makeArgumentID<Args&&...>()) {}
// Uses Allocator Arg Ctor
template <class ...Args>
@@ -248,7 +248,7 @@ public:
// Non-Uses Allocator Ctor
template <class ...Args, EnableIfB<sizeof...(Args) == Arity> = false>
UsesAllocatorV2(Args&&... args) : Base(&makeArgumentID<Args&&...>()) {};
UsesAllocatorV2(Args&&... args) : Base(&makeArgumentID<Args&&...>()) {}
// Uses Allocator Last Ctor
template <class ...Args, EnableIfB<sizeof...(Args) == Arity + 1> = false>
@@ -274,7 +274,7 @@ public:
// Non-Uses Allocator Ctor
template <class ...Args, EnableIfB<sizeof...(Args) == Arity> = false>
UsesAllocatorV3(Args&&... args) : Base(&makeArgumentID<Args&&...>()) {};
UsesAllocatorV3(Args&&... args) : Base(&makeArgumentID<Args&&...>()) {}
// Uses Allocator Arg Ctor
template <class ...Args>
@@ -305,7 +305,7 @@ public:
: Base(&makeArgumentID<NotUsesAllocator &&>()) {}
// Non-Uses Allocator Ctor
template <class ...Args, EnableIfB<sizeof...(Args) == Arity> = false>
NotUsesAllocator(Args&&... args) : Base(&makeArgumentID<Args&&...>()) {};
NotUsesAllocator(Args&&... args) : Base(&makeArgumentID<Args&&...>()) {}
// Uses Allocator Arg Ctor
template <class ...Args>