diff options
Diffstat (limited to 'test/std/numerics/numarray/template.indirect.array')
15 files changed, 1047 insertions, 0 deletions
diff --git a/test/std/numerics/numarray/template.indirect.array/default.fail.cpp b/test/std/numerics/numarray/template.indirect.array/default.fail.cpp new file mode 100644 index 000000000000..2f5e5d832835 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/default.fail.cpp @@ -0,0 +1,22 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// indirect_array() = delete; + +#include <valarray> +#include <type_traits> + +int main() +{ + std::indirect_array<int> ia; +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.assign/indirect_array.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.assign/indirect_array.pass.cpp new file mode 100644 index 000000000000..9c7c816ce218 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.assign/indirect_array.pass.cpp @@ -0,0 +1,80 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// const indirect_array& operator=(const indirect_array& ia) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, + -12, -13, -14, -15, -16, -17, -18, -19, -20, -21, -22, -23, + -24, -25, -26, -27, -28, -29, -30, -31, -32, -33, -34, -35, + -36, -37}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + const std::size_t S = sizeof(s)/sizeof(s[0]); + std::valarray<int> v1(a1, N1); + const std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, S); + v1[ia] = v2[ia]; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == -3); + assert(v1[ 4] == -4); + assert(v1[ 5] == -5); + assert(v1[ 6] == 6); + assert(v1[ 7] == -7); + assert(v1[ 8] == -8); + assert(v1[ 9] == -9); + assert(v1[10] == 10); + assert(v1[11] == -11); + assert(v1[12] == -12); + assert(v1[13] == -13); + assert(v1[14] == 14); + assert(v1[15] == -15); + assert(v1[16] == -16); + assert(v1[17] == -17); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == -22); + assert(v1[23] == -23); + assert(v1[24] == -24); + assert(v1[25] == 25); + assert(v1[26] == -26); + assert(v1[27] == -27); + assert(v1[28] == -28); + assert(v1[29] == 29); + assert(v1[30] == -30); + assert(v1[31] == -31); + assert(v1[32] == -32); + assert(v1[33] == 33); + assert(v1[34] == -34); + assert(v1[35] == -35); + assert(v1[36] == -36); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.assign/valarray.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.assign/valarray.pass.cpp new file mode 100644 index 000000000000..ad934aabcccb --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.assign/valarray.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, + -12, -13, -14, -15, -16, -17, -18, -19, -20, -21, -22, -23}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] = v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 0); + assert(v1[ 4] == -1); + assert(v1[ 5] == -2); + assert(v1[ 6] == 6); + assert(v1[ 7] == -3); + assert(v1[ 8] == -4); + assert(v1[ 9] == -5); + assert(v1[10] == 10); + assert(v1[11] == -6); + assert(v1[12] == -7); + assert(v1[13] == -8); + assert(v1[14] == 14); + assert(v1[15] == -9); + assert(v1[16] == -10); + assert(v1[17] == -11); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == -12); + assert(v1[23] == -13); + assert(v1[24] == -14); + assert(v1[25] == 25); + assert(v1[26] == -15); + assert(v1[27] == -16); + assert(v1[28] == -17); + assert(v1[29] == 29); + assert(v1[30] == -18); + assert(v1[31] == -19); + assert(v1[32] == -20); + assert(v1[33] == 33); + assert(v1[34] == -21); + assert(v1[35] == -22); + assert(v1[36] == -23); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/addition.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/addition.pass.cpp new file mode 100644 index 000000000000..fa966d1b58bb --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/addition.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator+=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, + -12, -13, -14, -15, -16, -17, -18, -19, -20, -21, -22, -23}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] += v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 3); + assert(v1[ 5] == 3); + assert(v1[ 6] == 6); + assert(v1[ 7] == 4); + assert(v1[ 8] == 4); + assert(v1[ 9] == 4); + assert(v1[10] == 10); + assert(v1[11] == 5); + assert(v1[12] == 5); + assert(v1[13] == 5); + assert(v1[14] == 14); + assert(v1[15] == 6); + assert(v1[16] == 6); + assert(v1[17] == 6); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 10); + assert(v1[23] == 10); + assert(v1[24] == 10); + assert(v1[25] == 25); + assert(v1[26] == 11); + assert(v1[27] == 11); + assert(v1[28] == 11); + assert(v1[29] == 29); + assert(v1[30] == 12); + assert(v1[31] == 12); + assert(v1[32] == 12); + assert(v1[33] == 33); + assert(v1[34] == 13); + assert(v1[35] == 13); + assert(v1[36] == 13); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/and.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/and.pass.cpp new file mode 100644 index 000000000000..60f055276745 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/and.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator&=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] &= v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 1); + assert(v1[ 4] == 0); + assert(v1[ 5] == 1); + assert(v1[ 6] == 6); + assert(v1[ 7] == 4); + assert(v1[ 8] == 0); + assert(v1[ 9] == 0); + assert(v1[10] == 10); + assert(v1[11] == 3); + assert(v1[12] == 8); + assert(v1[13] == 9); + assert(v1[14] == 14); + assert(v1[15] == 10); + assert(v1[16] == 0); + assert(v1[17] == 0); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 4); + assert(v1[23] == 6); + assert(v1[24] == 8); + assert(v1[25] == 25); + assert(v1[26] == 16); + assert(v1[27] == 17); + assert(v1[28] == 16); + assert(v1[29] == 29); + assert(v1[30] == 18); + assert(v1[31] == 20); + assert(v1[32] == 0); + assert(v1[33] == 33); + assert(v1[34] == 2); + assert(v1[35] == 3); + assert(v1[36] == 0); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/divide.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/divide.pass.cpp new file mode 100644 index 000000000000..11b5d83fe142 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/divide.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator/=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] /= v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 2); + assert(v1[ 5] == 1); + assert(v1[ 6] == 6); + assert(v1[ 7] == 1); + assert(v1[ 8] == 1); + assert(v1[ 9] == 1); + assert(v1[10] == 10); + assert(v1[11] == 1); + assert(v1[12] == 1); + assert(v1[13] == 1); + assert(v1[14] == 14); + assert(v1[15] == 1); + assert(v1[16] == 1); + assert(v1[17] == 1); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 1); + assert(v1[23] == 1); + assert(v1[24] == 1); + assert(v1[25] == 25); + assert(v1[26] == 1); + assert(v1[27] == 1); + assert(v1[28] == 1); + assert(v1[29] == 29); + assert(v1[30] == 1); + assert(v1[31] == 1); + assert(v1[32] == 1); + assert(v1[33] == 33); + assert(v1[34] == 1); + assert(v1[35] == 1); + assert(v1[36] == 1); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/modulo.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/modulo.pass.cpp new file mode 100644 index 000000000000..4c63684ecb7f --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/modulo.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator%=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] %= v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 0); + assert(v1[ 4] == 0); + assert(v1[ 5] == 2); + assert(v1[ 6] == 6); + assert(v1[ 7] == 3); + assert(v1[ 8] == 3); + assert(v1[ 9] == 3); + assert(v1[10] == 10); + assert(v1[11] == 4); + assert(v1[12] == 4); + assert(v1[13] == 4); + assert(v1[14] == 14); + assert(v1[15] == 5); + assert(v1[16] == 5); + assert(v1[17] == 5); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 9); + assert(v1[23] == 9); + assert(v1[24] == 9); + assert(v1[25] == 25); + assert(v1[26] == 10); + assert(v1[27] == 10); + assert(v1[28] == 10); + assert(v1[29] == 29); + assert(v1[30] == 11); + assert(v1[31] == 11); + assert(v1[32] == 11); + assert(v1[33] == 33); + assert(v1[34] == 12); + assert(v1[35] == 12); + assert(v1[36] == 12); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/multiply.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/multiply.pass.cpp new file mode 100644 index 000000000000..e477353107a7 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/multiply.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator*=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] *= v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 8); + assert(v1[ 5] == 15); + assert(v1[ 6] == 6); + assert(v1[ 7] == 28); + assert(v1[ 8] == 40); + assert(v1[ 9] == 54); + assert(v1[10] == 10); + assert(v1[11] == 77); + assert(v1[12] == 96); + assert(v1[13] == 117); + assert(v1[14] == 14); + assert(v1[15] == 150); + assert(v1[16] == 176); + assert(v1[17] == 204); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 286); + assert(v1[23] == 322); + assert(v1[24] == 360); + assert(v1[25] == 25); + assert(v1[26] == 416); + assert(v1[27] == 459); + assert(v1[28] == 504); + assert(v1[29] == 29); + assert(v1[30] == 570); + assert(v1[31] == 620); + assert(v1[32] == 672); + assert(v1[33] == 33); + assert(v1[34] == 748); + assert(v1[35] == 805); + assert(v1[36] == 864); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/or.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/or.pass.cpp new file mode 100644 index 000000000000..b74ce8621eb3 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/or.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator|=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] |= v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 6); + assert(v1[ 5] == 7); + assert(v1[ 6] == 6); + assert(v1[ 7] == 7); + assert(v1[ 8] == 13); + assert(v1[ 9] == 15); + assert(v1[10] == 10); + assert(v1[11] == 15); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); + assert(v1[16] == 27); + assert(v1[17] == 29); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 31); + assert(v1[23] == 31); + assert(v1[24] == 31); + assert(v1[25] == 25); + assert(v1[26] == 26); + assert(v1[27] == 27); + assert(v1[28] == 30); + assert(v1[29] == 29); + assert(v1[30] == 31); + assert(v1[31] == 31); + assert(v1[32] == 53); + assert(v1[33] == 33); + assert(v1[34] == 54); + assert(v1[35] == 55); + assert(v1[36] == 60); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/shift_left.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/shift_left.pass.cpp new file mode 100644 index 000000000000..e23f14299c9d --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/shift_left.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator<<=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] <<= v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 6); + assert(v1[ 4] == 16); + assert(v1[ 5] == 40); + assert(v1[ 6] == 6); + assert(v1[ 7] == 112); + assert(v1[ 8] == 256); + assert(v1[ 9] == 576); + assert(v1[10] == 10); + assert(v1[11] == 1408); + assert(v1[12] == 3072); + assert(v1[13] == 6656); + assert(v1[14] == 14); + assert(v1[15] == 15360); + assert(v1[16] == 32768); + assert(v1[17] == 69632); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 180224); + assert(v1[23] == 376832); + assert(v1[24] == 786432); + assert(v1[25] == 25); + assert(v1[26] == 1703936); + assert(v1[27] == 3538944); + assert(v1[28] == 7340032); + assert(v1[29] == 29); + assert(v1[30] == 15728640); + assert(v1[31] == 32505856); + assert(v1[32] == 67108864); + assert(v1[33] == 33); + assert(v1[34] == 142606336); + assert(v1[35] == 293601280); + assert(v1[36] == 603979776); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/shift_right.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/shift_right.pass.cpp new file mode 100644 index 000000000000..33db33f0c5fa --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/shift_right.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator>>=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] >>= v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 1); + assert(v1[ 4] == 1); + assert(v1[ 5] == 0); + assert(v1[ 6] == 6); + assert(v1[ 7] == 0); + assert(v1[ 8] == 0); + assert(v1[ 9] == 0); + assert(v1[10] == 10); + assert(v1[11] == 0); + assert(v1[12] == 0); + assert(v1[13] == 0); + assert(v1[14] == 14); + assert(v1[15] == 0); + assert(v1[16] == 0); + assert(v1[17] == 0); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 0); + assert(v1[23] == 0); + assert(v1[24] == 0); + assert(v1[25] == 25); + assert(v1[26] == 0); + assert(v1[27] == 0); + assert(v1[28] == 0); + assert(v1[29] == 29); + assert(v1[30] == 0); + assert(v1[31] == 0); + assert(v1[32] == 0); + assert(v1[33] == 33); + assert(v1[34] == 0); + assert(v1[35] == 0); + assert(v1[36] == 0); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/subtraction.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/subtraction.pass.cpp new file mode 100644 index 000000000000..dd2d35f99204 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/subtraction.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator-=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] -= v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 2); + assert(v1[ 4] == 2); + assert(v1[ 5] == 2); + assert(v1[ 6] == 6); + assert(v1[ 7] == 3); + assert(v1[ 8] == 3); + assert(v1[ 9] == 3); + assert(v1[10] == 10); + assert(v1[11] == 4); + assert(v1[12] == 4); + assert(v1[13] == 4); + assert(v1[14] == 14); + assert(v1[15] == 5); + assert(v1[16] == 5); + assert(v1[17] == 5); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 9); + assert(v1[23] == 9); + assert(v1[24] == 9); + assert(v1[25] == 25); + assert(v1[26] == 10); + assert(v1[27] == 10); + assert(v1[28] == 10); + assert(v1[29] == 29); + assert(v1[30] == 11); + assert(v1[31] == 11); + assert(v1[32] == 11); + assert(v1[33] == 33); + assert(v1[34] == 12); + assert(v1[35] == 12); + assert(v1[36] == 12); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/xor.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/xor.pass.cpp new file mode 100644 index 000000000000..f2c3427b9291 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.comp.assign/xor.pass.cpp @@ -0,0 +1,77 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator^=(const valarray<value_type>& v) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + std::size_t s[N2] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + std::valarray<std::size_t> ia(s, N2); + v1[ia] ^= v2; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 2); + assert(v1[ 4] == 6); + assert(v1[ 5] == 6); + assert(v1[ 6] == 6); + assert(v1[ 7] == 3); + assert(v1[ 8] == 13); + assert(v1[ 9] == 15); + assert(v1[10] == 10); + assert(v1[11] == 12); + assert(v1[12] == 4); + assert(v1[13] == 4); + assert(v1[14] == 14); + assert(v1[15] == 5); + assert(v1[16] == 27); + assert(v1[17] == 29); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 27); + assert(v1[23] == 25); + assert(v1[24] == 23); + assert(v1[25] == 25); + assert(v1[26] == 10); + assert(v1[27] == 10); + assert(v1[28] == 14); + assert(v1[29] == 29); + assert(v1[30] == 13); + assert(v1[31] == 11); + assert(v1[32] == 53); + assert(v1[33] == 33); + assert(v1[34] == 52); + assert(v1[35] == 52); + assert(v1[36] == 60); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/indirect.array.fill/assign_value.pass.cpp b/test/std/numerics/numarray/template.indirect.array/indirect.array.fill/assign_value.pass.cpp new file mode 100644 index 000000000000..de2bb43441c1 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/indirect.array.fill/assign_value.pass.cpp @@ -0,0 +1,74 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> class indirect_array + +// void operator=(const value_type& x) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, + 36, 37, 38, 39, 40}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + std::size_t s[] = { 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, + 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36}; + const std::size_t S = sizeof(s)/sizeof(s[0]); + std::valarray<int> v1(a1, N1); + std::valarray<std::size_t> ia(s, S); + v1[ia] = 51; + assert(v1.size() == 41); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 51); + assert(v1[ 4] == 51); + assert(v1[ 5] == 51); + assert(v1[ 6] == 6); + assert(v1[ 7] == 51); + assert(v1[ 8] == 51); + assert(v1[ 9] == 51); + assert(v1[10] == 10); + assert(v1[11] == 51); + assert(v1[12] == 51); + assert(v1[13] == 51); + assert(v1[14] == 14); + assert(v1[15] == 51); + assert(v1[16] == 51); + assert(v1[17] == 51); + assert(v1[18] == 18); + assert(v1[19] == 19); + assert(v1[20] == 20); + assert(v1[21] == 21); + assert(v1[22] == 51); + assert(v1[23] == 51); + assert(v1[24] == 51); + assert(v1[25] == 25); + assert(v1[26] == 51); + assert(v1[27] == 51); + assert(v1[28] == 51); + assert(v1[29] == 29); + assert(v1[30] == 51); + assert(v1[31] == 51); + assert(v1[32] == 51); + assert(v1[33] == 33); + assert(v1[34] == 51); + assert(v1[35] == 51); + assert(v1[36] == 51); + assert(v1[37] == 37); + assert(v1[38] == 38); + assert(v1[39] == 39); + assert(v1[40] == 40); +} diff --git a/test/std/numerics/numarray/template.indirect.array/types.pass.cpp b/test/std/numerics/numarray/template.indirect.array/types.pass.cpp new file mode 100644 index 000000000000..fe118ea329a3 --- /dev/null +++ b/test/std/numerics/numarray/template.indirect.array/types.pass.cpp @@ -0,0 +1,24 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <valarray> + +// template <class T> +// class indirect_array +// { +// public: +// typedef T value_type; + +#include <valarray> +#include <type_traits> + +int main() +{ + static_assert((std::is_same<std::indirect_array<int>::value_type, int>::value), ""); +} |