summaryrefslogtreecommitdiffstats
path: root/test
diff options
context:
space:
mode:
authorMarshall Clow <mclow.lists@gmail.com>2018-05-18 23:44:13 +0000
committerMarshall Clow <mclow.lists@gmail.com>2018-05-18 23:44:13 +0000
commit69c2095d922aadd906379c4d1a348b8ba513c6f8 (patch)
treeca1b73dd7522a67486846f513ab1e876fea083e3 /test
parentf2c627db20430e7f4b8838b70ff5f25477770dfe (diff)
downloadexternal_libcxx-69c2095d922aadd906379c4d1a348b8ba513c6f8.tar.gz
external_libcxx-69c2095d922aadd906379c4d1a348b8ba513c6f8.tar.bz2
external_libcxx-69c2095d922aadd906379c4d1a348b8ba513c6f8.zip
Implement deduction guides for <deque>
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@332785 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test')
-rw-r--r--test/std/containers/sequences/deque/deque.cons/deduct.fail.cpp42
-rw-r--r--test/std/containers/sequences/deque/deque.cons/deduct.pass.cpp98
2 files changed, 140 insertions, 0 deletions
diff --git a/test/std/containers/sequences/deque/deque.cons/deduct.fail.cpp b/test/std/containers/sequences/deque/deque.cons/deduct.fail.cpp
new file mode 100644
index 000000000..1f3fdbdae
--- /dev/null
+++ b/test/std/containers/sequences/deque/deque.cons/deduct.fail.cpp
@@ -0,0 +1,42 @@
+//===----------------------------------------------------------------------===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is dual licensed under the MIT and the University of Illinois Open
+// Source Licenses. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+
+// <array>
+// UNSUPPORTED: c++98, c++03, c++11, c++14
+// UNSUPPORTED: libcpp-no-deduction-guides
+
+
+// template <class InputIterator, class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+// deque(InputIterator, InputIterator, Allocator = Allocator())
+// -> deque<typename iterator_traits<InputIterator>::value_type, Allocator>;
+//
+
+
+#include <deque>
+#include <iterator>
+#include <cassert>
+#include <cstddef>
+#include <climits> // INT_MAX
+
+struct A {};
+
+int main()
+{
+// Test the explicit deduction guides
+
+// Test the implicit deduction guides
+ {
+// deque (allocator &)
+ std::deque deq((std::allocator<int>())); // expected-error {{no viable constructor or deduction guide for deduction of template arguments of 'deque'}}
+// Note: The extra parens are necessary, since otherwise clang decides it is a function declaration.
+// Also, we can't use {} instead of parens, because that constructs a
+// deque<allocator<int>, allocator<allocator<int>>>
+ }
+
+}
diff --git a/test/std/containers/sequences/deque/deque.cons/deduct.pass.cpp b/test/std/containers/sequences/deque/deque.cons/deduct.pass.cpp
new file mode 100644
index 000000000..7fc942549
--- /dev/null
+++ b/test/std/containers/sequences/deque/deque.cons/deduct.pass.cpp
@@ -0,0 +1,98 @@
+//===----------------------------------------------------------------------===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is dual licensed under the MIT and the University of Illinois Open
+// Source Licenses. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+
+// <array>
+// UNSUPPORTED: c++98, c++03, c++11, c++14
+// UNSUPPORTED: libcpp-no-deduction-guides
+
+
+// template <class InputIterator, class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+// deque(InputIterator, InputIterator, Allocator = Allocator())
+// -> deque<typename iterator_traits<InputIterator>::value_type, Allocator>;
+//
+
+
+#include <deque>
+#include <iterator>
+#include <cassert>
+#include <cstddef>
+#include <climits> // INT_MAX
+
+#include "test_macros.h"
+#include "test_iterators.h"
+#include "test_allocator.h"
+
+struct A {};
+
+int main()
+{
+
+// Test the explicit deduction guides
+ {
+ const int arr[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
+ std::deque deq(std::begin(arr), std::end(arr));
+
+ static_assert(std::is_same_v<decltype(deq), std::deque<int>>, "");
+ assert(std::equal(deq.begin(), deq.end(), std::begin(arr), std::end(arr)));
+ }
+
+ {
+ const long arr[] = {INT_MAX, 1L + INT_MAX, 2L, 3L };
+ std::deque deq(std::begin(arr), std::end(arr), std::allocator<long>());
+ static_assert(std::is_same_v<decltype(deq)::value_type, long>, "");
+ assert(deq.size() == 4);
+ assert(deq[0] == INT_MAX);
+ assert(deq[1] == 1L + INT_MAX);
+ assert(deq[2] == 2L);
+ }
+
+// Test the implicit deduction guides
+
+ {
+// We don't expect this one to work.
+// std::deque deq(std::allocator<int>()); // deque (allocator &)
+ }
+
+ {
+ std::deque deq(1, A{}); // deque (size_type, T)
+ static_assert(std::is_same_v<decltype(deq)::value_type, A>, "");
+ static_assert(std::is_same_v<decltype(deq)::allocator_type, std::allocator<A>>, "");
+ assert(deq.size() == 1);
+ }
+
+ {
+ std::deque deq(1, A{}, test_allocator<A>()); // deque (size_type, T, allocator)
+ static_assert(std::is_same_v<decltype(deq)::value_type, A>, "");
+ static_assert(std::is_same_v<decltype(deq)::allocator_type, test_allocator<A>>, "");
+ assert(deq.size() == 1);
+ }
+
+ {
+ std::deque deq{1U, 2U, 3U, 4U, 5U}; // deque(initializer-list)
+ static_assert(std::is_same_v<decltype(deq)::value_type, unsigned>, "");
+ assert(deq.size() == 5);
+ assert(deq[2] == 3U);
+ }
+
+ {
+ std::deque deq({1.0, 2.0, 3.0, 4.0}, test_allocator<double>()); // deque(initializer-list, allocator)
+ static_assert(std::is_same_v<decltype(deq)::value_type, double>, "");
+ static_assert(std::is_same_v<decltype(deq)::allocator_type, test_allocator<double>>, "");
+ assert(deq.size() == 4);
+ assert(deq[3] == 4.0);
+ }
+
+ {
+ std::deque<long double> source;
+ std::deque deq(source); // deque(deque &)
+ static_assert(std::is_same_v<decltype(deq)::value_type, long double>, "");
+ static_assert(std::is_same_v<decltype(deq)::allocator_type, std::allocator<long double>>, "");
+ assert(deq.size() == 0);
+ }
+}