Marshall Clow | ef6f115 | 2013-09-13 15:22:55 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is dual licensed under the MIT and the University of Illinois Open |
| 6 | // Source Licenses. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | // dynarray.overview |
| 11 | |
| 12 | // const_reference at(size_type n) const; |
| 13 | // reference at(size_type n); |
| 14 | |
| 15 | #include <__config> |
| 16 | |
| 17 | #if _LIBCPP_STD_VER > 11 |
| 18 | |
| 19 | #include <dynarray> |
| 20 | #include <cassert> |
| 21 | |
| 22 | #include <algorithm> |
| 23 | #include <complex> |
| 24 | #include <string> |
| 25 | |
| 26 | template <class T> |
| 27 | void dyn_at_fail ( std::dynarray<T> &dyn, size_t sz ) { |
| 28 | try { dyn.at (sz); } |
| 29 | catch (const std::out_of_range &) { return; } |
| 30 | assert ( false ); |
| 31 | } |
| 32 | |
| 33 | template <class T> |
| 34 | void dyn_at_fail_const ( const std::dynarray<T> &dyn, size_t sz ) { |
| 35 | try { dyn.at (sz); } |
| 36 | catch (const std::out_of_range &) { return; } |
| 37 | assert ( false ); |
| 38 | } |
| 39 | |
| 40 | |
| 41 | template <class T> |
| 42 | void dyn_test_const ( const std::dynarray<T> &dyn, const std::initializer_list<T> &vals ) { |
| 43 | const T *data = dyn.data (); |
| 44 | auto it = vals.begin (); |
| 45 | for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { |
| 46 | assert ( data + i == &dyn.at(i)); |
| 47 | assert ( *it == dyn.at(i)); |
| 48 | } |
| 49 | |
| 50 | dyn_at_fail_const ( dyn, dyn.size ()); |
| 51 | dyn_at_fail_const ( dyn, 2*dyn.size ()); |
| 52 | dyn_at_fail_const ( dyn, size_t (-1)); |
| 53 | } |
| 54 | |
| 55 | template <class T> |
| 56 | void dyn_test ( std::dynarray<T> &dyn, const std::initializer_list<T> &vals ) { |
| 57 | T *data = dyn.data (); |
| 58 | auto it = vals.begin (); |
| 59 | for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { |
| 60 | assert ( data + i == &dyn.at(i)); |
| 61 | assert ( *it == dyn.at(i)); |
| 62 | } |
| 63 | |
| 64 | dyn_at_fail ( dyn, dyn.size ()); |
| 65 | dyn_at_fail ( dyn, 2*dyn.size ()); |
| 66 | dyn_at_fail ( dyn, size_t (-1)); |
| 67 | } |
| 68 | |
| 69 | |
| 70 | template <class T> |
| 71 | void test ( std::initializer_list<T> vals ) { |
| 72 | typedef std::dynarray<T> dynA; |
| 73 | |
| 74 | dynA d1 ( vals ); |
| 75 | dyn_test ( d1, vals ); |
| 76 | dyn_test_const ( d1, vals ); |
| 77 | } |
| 78 | |
| 79 | int main() |
| 80 | { |
| 81 | test ( { 1, 1, 2, 3, 5, 8 } ); |
| 82 | test ( { 1., 1., 2., 3., 5., 8. } ); |
| 83 | test ( { std::string("1"), std::string("1"), std::string("2"), std::string("3"), |
| 84 | std::string("5"), std::string("8")} ); |
| 85 | |
| 86 | test<int> ( {} ); |
| 87 | test<std::complex<double>> ( {} ); |
| 88 | test<std::string> ( {} ); |
| 89 | } |
| 90 | #else |
| 91 | int main() {} |
| 92 | #endif |