forked from OSchip/llvm-project
[libcxx] [test] Strip trailing whitespace. NFC.
llvm-svn: 334676
This commit is contained in:
parent
896e499e38
commit
cb0d20519e
|
@ -19,7 +19,7 @@
|
|||
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
// queue(Compare, Container, const Alloc);
|
||||
|
@ -35,7 +35,7 @@ int main()
|
|||
}
|
||||
|
||||
{
|
||||
// priority_queue(Iter, Iter, Comp)
|
||||
// priority_queue(Iter, Iter, Comp)
|
||||
// int is not an iterator
|
||||
std::priority_queue pri(15, 17, std::greater<double>()); // expected-error {{no viable constructor or deduction guide for deduction of template arguments of 'priority_queue'}}
|
||||
}
|
||||
|
|
|
@ -14,17 +14,17 @@
|
|||
// template<class Compare, class Container>
|
||||
// priority_queue(Compare, Container)
|
||||
// -> priority_queue<typename Container::value_type, Container, Compare>;
|
||||
//
|
||||
//
|
||||
// template<class InputIterator,
|
||||
// class Compare = less<typename iterator_traits<InputIterator>::value_type>,
|
||||
// class Container = vector<typename iterator_traits<InputIterator>::value_type>>
|
||||
// priority_queue(InputIterator, InputIterator, Compare = Compare(), Container = Container())
|
||||
// -> priority_queue<typename iterator_traits<InputIterator>::value_type, Container, Compare>;
|
||||
//
|
||||
//
|
||||
// template<class Compare, class Container, class Allocator>
|
||||
// priority_queue(Compare, Container, Allocator)
|
||||
// -> priority_queue<typename Container::value_type, Container, Compare>;
|
||||
|
||||
|
||||
|
||||
#include <queue>
|
||||
#include <vector>
|
||||
|
@ -41,7 +41,7 @@ struct A {};
|
|||
|
||||
int main()
|
||||
{
|
||||
|
||||
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
std::vector<int> v{0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
|
||||
|
@ -56,7 +56,7 @@ int main()
|
|||
std::vector<long, test_allocator<long>> v{10, 11, 12, 13, 14, 15, 16, 17, 18, 19 };
|
||||
std::priority_queue pri(std::greater<long>(), v, test_allocator<long>(2)); // priority_queue(Compare, Container, Allocator)
|
||||
|
||||
static_assert(std::is_same_v<decltype(pri),
|
||||
static_assert(std::is_same_v<decltype(pri),
|
||||
std::priority_queue<long, std::vector<long, test_allocator<long>>, std::greater<long>>>, "");
|
||||
assert(pri.size() == v.size());
|
||||
assert(pri.top() == 10);
|
||||
|
|
|
@ -19,7 +19,7 @@
|
|||
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
// queue(const Container&, const Alloc&);
|
||||
|
|
|
@ -16,8 +16,8 @@
|
|||
|
||||
// template<class Container>
|
||||
// queue(Container) -> queue<typename Container::value_type, Container>;
|
||||
//
|
||||
// template<class Container, class Allocator>
|
||||
//
|
||||
// template<class Container, class Allocator>
|
||||
// queue(Container, Allocator) -> queue<typename Container::value_type, Container>;
|
||||
|
||||
|
||||
|
@ -36,7 +36,7 @@ struct A {};
|
|||
|
||||
int main()
|
||||
{
|
||||
|
||||
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
std::list<int> l{0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
|
||||
|
@ -57,7 +57,7 @@ int main()
|
|||
// I'd like to assert that we've gotten the right allocator in the queue, but
|
||||
// I don't know how to get at the underlying container.
|
||||
}
|
||||
|
||||
|
||||
// Test the implicit deduction guides
|
||||
{
|
||||
// We don't expect this one to work - no way to implicitly get value_type
|
||||
|
|
|
@ -26,7 +26,7 @@
|
|||
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
// stack(const Container&, const Alloc&);
|
||||
|
|
|
@ -17,8 +17,8 @@
|
|||
|
||||
// template<class Container>
|
||||
// stack(Container) -> stack<typename Container::value_type, Container>;
|
||||
//
|
||||
// template<class Container, class Allocator>
|
||||
//
|
||||
// template<class Container, class Allocator>
|
||||
// stack(Container, Allocator) -> stack<typename Container::value_type, Container>;
|
||||
|
||||
|
||||
|
@ -38,7 +38,7 @@ struct A {};
|
|||
|
||||
int main()
|
||||
{
|
||||
|
||||
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
std::vector<int> v{0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
|
||||
|
@ -59,7 +59,7 @@ int main()
|
|||
// I'd like to assert that we've gotten the right allocator in the stack, but
|
||||
// I don't know how to get at the underlying container.
|
||||
}
|
||||
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
||||
{
|
||||
|
|
|
@ -27,7 +27,7 @@
|
|||
struct A {};
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
|
|
@ -32,7 +32,7 @@ struct A {};
|
|||
|
||||
int main()
|
||||
{
|
||||
|
||||
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
const int arr[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
|
||||
|
@ -51,7 +51,7 @@ int main()
|
|||
assert(deq[1] == 1L);
|
||||
assert(deq[2] == 2L);
|
||||
}
|
||||
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
||||
{
|
||||
|
|
|
@ -27,7 +27,7 @@
|
|||
struct A {};
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
|
|
@ -32,7 +32,7 @@ struct A {};
|
|||
|
||||
int main()
|
||||
{
|
||||
|
||||
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
const int arr[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
|
||||
|
@ -52,7 +52,7 @@ int main()
|
|||
assert(*it++ == 1L);
|
||||
assert(*it++ == 2L);
|
||||
}
|
||||
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
||||
{
|
||||
|
|
|
@ -27,7 +27,7 @@
|
|||
struct A {};
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
|
|
@ -32,7 +32,7 @@ struct A {};
|
|||
|
||||
int main()
|
||||
{
|
||||
|
||||
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
const int arr[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
|
||||
|
@ -52,7 +52,7 @@ int main()
|
|||
assert(*it++ == 1L);
|
||||
assert(*it++ == 2L);
|
||||
}
|
||||
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
||||
{
|
||||
|
|
|
@ -25,7 +25,7 @@
|
|||
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
|
|
@ -32,7 +32,7 @@ struct A {};
|
|||
|
||||
int main()
|
||||
{
|
||||
|
||||
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
const int arr[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
|
||||
|
@ -51,7 +51,7 @@ int main()
|
|||
assert(vec[1] == 1L);
|
||||
assert(vec[2] == 2L);
|
||||
}
|
||||
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
||||
{
|
||||
|
|
|
@ -47,7 +47,7 @@ int main () {
|
|||
{
|
||||
Outer o(0);
|
||||
}
|
||||
|
||||
|
||||
assert(std::uncaught_exceptions() == 0);
|
||||
{
|
||||
try {
|
||||
|
@ -56,7 +56,7 @@ int main () {
|
|||
}
|
||||
catch (int) {
|
||||
assert(std::uncaught_exceptions() == 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
assert(std::uncaught_exceptions() == 0);
|
||||
}
|
||||
|
|
|
@ -26,7 +26,7 @@
|
|||
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
// basic_regex(ForwardIterator, ForwardIterator)
|
||||
|
|
|
@ -16,7 +16,7 @@
|
|||
// basic_regex(ForwardIterator, ForwardIterator,
|
||||
// regex_constants::syntax_option_type = regex_constants::ECMAScript)
|
||||
// -> basic_regex<typename iterator_traits<ForwardIterator>::value_type>;
|
||||
|
||||
|
||||
|
||||
#include <regex>
|
||||
#include <string>
|
||||
|
@ -34,7 +34,7 @@ struct A {};
|
|||
|
||||
int main()
|
||||
{
|
||||
|
||||
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
// basic_regex(ForwardIterator, ForwardIterator)
|
||||
|
@ -54,7 +54,7 @@ int main()
|
|||
assert(re.flags() == std::regex_constants::basic);
|
||||
assert(re.mark_count() == 1);
|
||||
}
|
||||
|
||||
|
||||
// Test the implicit deduction guides
|
||||
{
|
||||
// basic_regex(string);
|
||||
|
@ -87,7 +87,7 @@ int main()
|
|||
assert(re.flags() == std::regex_constants::grep);
|
||||
assert(re.mark_count() == 0);
|
||||
}
|
||||
|
||||
|
||||
{
|
||||
// basic_regex(const charT*, size_t);
|
||||
std::basic_regex re("ABCDEDEF", 7);
|
||||
|
|
|
@ -25,7 +25,7 @@
|
|||
struct A {};
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
|
||||
// Test the implicit deduction guides
|
||||
|
|
|
@ -25,7 +25,7 @@
|
|||
struct A {};
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
// Test the explicit deduction guides
|
||||
{
|
||||
// optional(T)
|
||||
|
|
Loading…
Reference in New Issue