summaryrefslogtreecommitdiffstats
path: root/libcxx/test/containers/sequences/dynarray/dynarray.overview/indexing.pass.cpp
diff options
context:
space:
mode:
authorMarshall Clow <mclow.lists@gmail.com>2013-09-13 15:22:55 +0000
committerMarshall Clow <mclow.lists@gmail.com>2013-09-13 15:22:55 +0000
commitef6f1151b0d1f32b80d8d326e7176ca06e06a2f4 (patch)
treed29a706d04024cb5df9102cc146b0a3921e9475f /libcxx/test/containers/sequences/dynarray/dynarray.overview/indexing.pass.cpp
parentc38b2dabb0c0092d131710de0e8e57fbc73b6d0c (diff)
downloadbcm5719-llvm-ef6f1151b0d1f32b80d8d326e7176ca06e06a2f4.tar.gz
bcm5719-llvm-ef6f1151b0d1f32b80d8d326e7176ca06e06a2f4.zip
Initial implementation of <dynarray>. No allocator support pending resolution of LWG #2235; no stack allocation pending compiler support
llvm-svn: 190697
Diffstat (limited to 'libcxx/test/containers/sequences/dynarray/dynarray.overview/indexing.pass.cpp')
-rw-r--r--libcxx/test/containers/sequences/dynarray/dynarray.overview/indexing.pass.cpp69
1 files changed, 69 insertions, 0 deletions
diff --git a/libcxx/test/containers/sequences/dynarray/dynarray.overview/indexing.pass.cpp b/libcxx/test/containers/sequences/dynarray/dynarray.overview/indexing.pass.cpp
new file mode 100644
index 00000000000..a396fbcdf36
--- /dev/null
+++ b/libcxx/test/containers/sequences/dynarray/dynarray.overview/indexing.pass.cpp
@@ -0,0 +1,69 @@
+//===----------------------------------------------------------------------===//
+//
+// 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.
+//
+//===----------------------------------------------------------------------===//
+
+// dynarray.overview
+
+// const_reference at(size_type n) const;
+// reference at(size_type n);
+
+#include <__config>
+
+#if _LIBCPP_STD_VER > 11
+
+#include <dynarray>
+#include <cassert>
+
+#include <algorithm>
+#include <complex>
+#include <string>
+
+template <class T>
+void dyn_test_const ( const std::dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
+ const T *data = dyn.data ();
+ auto it = vals.begin ();
+ for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
+ assert ( data + i == &dyn[i]);
+ assert ( *it == dyn[i]);
+ }
+ }
+
+template <class T>
+void dyn_test ( std::dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
+ T *data = dyn.data ();
+ auto it = vals.begin ();
+ for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
+ assert ( data + i == &dyn[i]);
+ assert ( *it == dyn[i]);
+ }
+ }
+
+
+template <class T>
+void test ( std::initializer_list<T> vals ) {
+ typedef std::dynarray<T> dynA;
+
+ dynA d1 ( vals );
+ dyn_test ( d1, vals );
+ dyn_test_const ( d1, vals );
+ }
+
+int main()
+{
+ test ( { 1, 1, 2, 3, 5, 8 } );
+ test ( { 1., 1., 2., 3., 5., 8. } );
+ test ( { std::string("1"), std::string("1"), std::string("2"), std::string("3"),
+ std::string("5"), std::string("8")} );
+
+ test<int> ( {} );
+ test<std::complex<double>> ( {} );
+ test<std::string> ( {} );
+}
+#else
+int main() {}
+#endif
OpenPOWER on IntegriCloud