diff options
Diffstat (limited to 'test/std/numerics/numarray')
214 files changed, 9632 insertions, 0 deletions
diff --git a/test/std/numerics/numarray/class.gslice/gslice.access/tested_elsewhere.pass.cpp b/test/std/numerics/numarray/class.gslice/gslice.access/tested_elsewhere.pass.cpp new file mode 100644 index 000000000000..b58f5c55b643 --- /dev/null +++ b/test/std/numerics/numarray/class.gslice/gslice.access/tested_elsewhere.pass.cpp @@ -0,0 +1,12 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +int main() +{ +} diff --git a/test/std/numerics/numarray/class.gslice/gslice.cons/default.pass.cpp b/test/std/numerics/numarray/class.gslice/gslice.cons/default.pass.cpp new file mode 100644 index 000000000000..29cc34f0767a --- /dev/null +++ b/test/std/numerics/numarray/class.gslice/gslice.cons/default.pass.cpp @@ -0,0 +1,25 @@ +//===----------------------------------------------------------------------===// +// +// 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> + +// class glice; + +// gslice(); + +#include <valarray> +#include <cassert> + +int main() +{ + std::gslice gs; + assert(gs.start() == 0); + assert(gs.size().size() == 0); + assert(gs.stride().size() == 0); +} diff --git a/test/std/numerics/numarray/class.gslice/gslice.cons/start_size_stride.pass.cpp b/test/std/numerics/numarray/class.gslice/gslice.cons/start_size_stride.pass.cpp new file mode 100644 index 000000000000..931c0d3c7bfe --- /dev/null +++ b/test/std/numerics/numarray/class.gslice/gslice.cons/start_size_stride.pass.cpp @@ -0,0 +1,38 @@ +//===----------------------------------------------------------------------===// +// +// 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> + +// class glice; + +// gslice(size_t start, const valarray<size_t>& size, +// const valarray<size_t>& stride); + +#include <valarray> +#include <cassert> + +int main() +{ + std::size_t a1[] = {1, 2, 3}; + std::size_t a2[] = {4, 5, 6}; + std::valarray<std::size_t> size(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<std::size_t> stride(a2, sizeof(a2)/sizeof(a2[0])); + std::gslice gs(7, size, stride); + assert(gs.start() == 7); + std::valarray<std::size_t> r = gs.size(); + assert(r.size() == 3); + assert(r[0] == 1); + assert(r[1] == 2); + assert(r[2] == 3); + r = gs.stride(); + assert(r.size() == 3); + assert(r[0] == 4); + assert(r[1] == 5); + assert(r[2] == 6); +} diff --git a/test/std/numerics/numarray/class.gslice/nothing_to_do.pass.cpp b/test/std/numerics/numarray/class.gslice/nothing_to_do.pass.cpp new file mode 100644 index 000000000000..b58f5c55b643 --- /dev/null +++ b/test/std/numerics/numarray/class.gslice/nothing_to_do.pass.cpp @@ -0,0 +1,12 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +int main() +{ +} diff --git a/test/std/numerics/numarray/class.slice/cons.slice/default.pass.cpp b/test/std/numerics/numarray/class.slice/cons.slice/default.pass.cpp new file mode 100644 index 000000000000..d0a6cc0d28dd --- /dev/null +++ b/test/std/numerics/numarray/class.slice/cons.slice/default.pass.cpp @@ -0,0 +1,25 @@ +//===----------------------------------------------------------------------===// +// +// 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> + +// class slice; + +// slice(); + +#include <valarray> +#include <cassert> + +int main() +{ + std::slice s; + assert(s.start() == 0); + assert(s.size() == 0); + assert(s.stride() == 0); +} diff --git a/test/std/numerics/numarray/class.slice/cons.slice/start_size_stride.pass.cpp b/test/std/numerics/numarray/class.slice/cons.slice/start_size_stride.pass.cpp new file mode 100644 index 000000000000..84f7ed6a18e1 --- /dev/null +++ b/test/std/numerics/numarray/class.slice/cons.slice/start_size_stride.pass.cpp @@ -0,0 +1,25 @@ +//===----------------------------------------------------------------------===// +// +// 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> + +// class slice; + +// slice(size_t start, size_t size, size_t stride); + +#include <valarray> +#include <cassert> + +int main() +{ + std::slice s(1, 3, 2); + assert(s.start() == 1); + assert(s.size() == 3); + assert(s.stride() == 2); +} diff --git a/test/std/numerics/numarray/class.slice/nothing_to_do.pass.cpp b/test/std/numerics/numarray/class.slice/nothing_to_do.pass.cpp new file mode 100644 index 000000000000..b58f5c55b643 --- /dev/null +++ b/test/std/numerics/numarray/class.slice/nothing_to_do.pass.cpp @@ -0,0 +1,12 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +int main() +{ +} diff --git a/test/std/numerics/numarray/class.slice/slice.access/tested_elsewhere.pass.cpp b/test/std/numerics/numarray/class.slice/slice.access/tested_elsewhere.pass.cpp new file mode 100644 index 000000000000..b58f5c55b643 --- /dev/null +++ b/test/std/numerics/numarray/class.slice/slice.access/tested_elsewhere.pass.cpp @@ -0,0 +1,12 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +int main() +{ +} diff --git a/test/std/numerics/numarray/template.gslice.array/default.fail.cpp b/test/std/numerics/numarray/template.gslice.array/default.fail.cpp new file mode 100644 index 000000000000..d691cbe08a41 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.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 gslice_array + +// gslice_array() = delete; + +#include <valarray> +#include <type_traits> + +int main() +{ + std::gslice_array<int> gs; +} diff --git a/test/std/numerics/numarray/template.gslice.array/gslice.array.assign/gslice_array.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.assign/gslice_array.pass.cpp new file mode 100644 index 000000000000..d26a7b36cade --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.array.assign/gslice_array.pass.cpp @@ -0,0 +1,81 @@ +//===----------------------------------------------------------------------===// +// +// 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 gslice_array + +// const gslice_array& operator=(const gslice_array& ga) 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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + const std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] + = v2[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))]; + 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.gslice.array/gslice.array.assign/valarray.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.assign/valarray.pass.cpp new file mode 100644 index 000000000000..2f960c12d6b0 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] = 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.gslice.array/gslice.array.comp.assign/addition.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/addition.pass.cpp new file mode 100644 index 000000000000..bd2ad7074c10 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] += 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.gslice.array/gslice.array.comp.assign/and.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/and.pass.cpp new file mode 100644 index 000000000000..6875c5ea700b --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] &= 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.gslice.array/gslice.array.comp.assign/divide.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/divide.pass.cpp new file mode 100644 index 000000000000..33a00328f34d --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] /= 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.gslice.array/gslice.array.comp.assign/modulo.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/modulo.pass.cpp new file mode 100644 index 000000000000..addc43da09e0 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] %= 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.gslice.array/gslice.array.comp.assign/multiply.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/multiply.pass.cpp new file mode 100644 index 000000000000..37555fdfa300 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] *= 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.gslice.array/gslice.array.comp.assign/or.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/or.pass.cpp new file mode 100644 index 000000000000..24e96e821a88 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] |= 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.gslice.array/gslice.array.comp.assign/shift_left.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/shift_left.pass.cpp new file mode 100644 index 000000000000..ddaf4f7ca5b8 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] <<= 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.gslice.array/gslice.array.comp.assign/shift_right.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/shift_right.pass.cpp new file mode 100644 index 000000000000..4c06a29e51e6 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] >>= 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.gslice.array/gslice.array.comp.assign/subtraction.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/subtraction.pass.cpp new file mode 100644 index 000000000000..3feda53aef1d --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] -= 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.gslice.array/gslice.array.comp.assign/xor.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.comp.assign/xor.pass.cpp new file mode 100644 index 000000000000..125935169e22 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] ^= 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.gslice.array/gslice.array.fill/assign_value.pass.cpp b/test/std/numerics/numarray/template.gslice.array/gslice.array.fill/assign_value.pass.cpp new file mode 100644 index 000000000000..5c5591aa1093 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.array/gslice.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 gslice_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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] = 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.gslice.array/types.pass.cpp b/test/std/numerics/numarray/template.gslice.array/types.pass.cpp new file mode 100644 index 000000000000..005d907b41c0 --- /dev/null +++ b/test/std/numerics/numarray/template.gslice.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 gslice_array +// { +// public: +// typedef T value_type; + +#include <valarray> +#include <type_traits> + +int main() +{ + static_assert((std::is_same<std::gslice_array<int>::value_type, int>::value), ""); +} 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), ""); +} diff --git a/test/std/numerics/numarray/template.mask.array/default.fail.cpp b/test/std/numerics/numarray/template.mask.array/default.fail.cpp new file mode 100644 index 000000000000..97476c65c195 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.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 mask_array + +// mask_array() = delete; + +#include <valarray> +#include <type_traits> + +int main() +{ + std::mask_array<int> s; +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.assign/mask_array.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.assign/mask_array.pass.cpp new file mode 100644 index 000000000000..29cb787d009e --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.assign/mask_array.pass.cpp @@ -0,0 +1,66 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_array + +// void mask_array& operator=(const mask_array& ma) 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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + bool b1[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + int a2[] = {-1, -2, -3, -4, -5, -6, -7, -8}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b2[N2] = {true, false, true, true, + false, false, true, true}; + std::valarray<int> v1(a1, N1); + const std::valarray<int> v2(a2, N2); + std::valarray<bool> vb1(b1, N1); + std::valarray<bool> vb2(b2, N2); + v1[vb1] = v2[vb2]; + assert(v1.size() == 16); + assert(v1[ 0] == -1); + 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] == -8); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); + } + // Test return value of assignment + { + int a1[] = {0, 1, 2}; + int a2[] = {3, 4, 5}; + bool b1[] = {true, false, true}; + std::valarray<int> v1(a1, 3); + std::valarray<int> v2(a2, 3); + std::valarray<bool> const vb1(b1, 3); + std::mask_array<int> m1 = v1[vb1]; + std::mask_array<int> const m2 = v2[vb1]; + std::mask_array<int> const & r = (m1 = m2); + assert(&r == &m1); + } +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.assign/valarray.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.assign/valarray.pass.cpp new file mode 100644 index 000000000000..63949e2449b8 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.assign/valarray.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] = v2; + assert(v1.size() == 16); + assert(v1[ 0] == 1); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 2); + assert(v1[ 4] == 3); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 4); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 5); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/addition.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/addition.pass.cpp new file mode 100644 index 000000000000..984762943c63 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/addition.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] += v2; + assert(v1.size() == 16); + assert(v1[ 0] == 1); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 5); + assert(v1[ 4] == 7); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 11); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 16); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/and.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/and.pass.cpp new file mode 100644 index 000000000000..7e110b13af21 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/and.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] &= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 2); + assert(v1[ 4] == 0); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 4); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 1); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/divide.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/divide.pass.cpp new file mode 100644 index 000000000000..9fe243875ce5 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/divide.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] /= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 1); + assert(v1[ 4] == 1); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 1); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 2); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/modulo.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/modulo.pass.cpp new file mode 100644 index 000000000000..bd0ee0836fb8 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/modulo.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] %= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 1); + assert(v1[ 4] == 1); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 3); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 1); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/multiply.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/multiply.pass.cpp new file mode 100644 index 000000000000..13efefc375f2 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/multiply.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] *= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 6); + assert(v1[ 4] == 12); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 28); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 55); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/or.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/or.pass.cpp new file mode 100644 index 000000000000..9b06879a8a17 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/or.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] |= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 1); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 7); + 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] == 15); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/shift_left.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/shift_left.pass.cpp new file mode 100644 index 000000000000..9c1f92a3e807 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/shift_left.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] <<= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 12); + assert(v1[ 4] == 32); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 112); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 352); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/shift_right.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/shift_right.pass.cpp new file mode 100644 index 000000000000..438d3427d430 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/shift_right.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] >>= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 0); + assert(v1[ 4] == 0); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 0); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 0); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/subtraction.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/subtraction.pass.cpp new file mode 100644 index 000000000000..16e387dc6d78 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/subtraction.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] -= v2; + assert(v1.size() == 16); + assert(v1[ 0] == -1); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 1); + assert(v1[ 4] == 1); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 3); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 6); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/xor.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/xor.pass.cpp new file mode 100644 index 000000000000..ae3c2383d4d0 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/xor.pass.cpp @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + int a2[] = {1, 2, 3, 4, 5}; + const std::size_t N2 = sizeof(a2)/sizeof(a2[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<int> v2(a2, N2); + assert(N2 == std::count(b, b+N1, true)); + std::valarray<bool> vb(b, N1); + v1[vb] ^= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 1); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 1); + assert(v1[ 4] == 7); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 3); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == 14); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/mask.array.fill/assign_value.pass.cpp b/test/std/numerics/numarray/template.mask.array/mask.array.fill/assign_value.pass.cpp new file mode 100644 index 000000000000..c37916b0b7dc --- /dev/null +++ b/test/std/numerics/numarray/template.mask.array/mask.array.fill/assign_value.pass.cpp @@ -0,0 +1,45 @@ +//===----------------------------------------------------------------------===// +// +// 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 mask_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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<bool> vb(b, N1); + v1[vb] = -5; + assert(v1.size() == 16); + assert(v1[ 0] == -5); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == -5); + assert(v1[ 4] == -5); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == -5); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 10); + assert(v1[11] == -5); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.mask.array/types.pass.cpp b/test/std/numerics/numarray/template.mask.array/types.pass.cpp new file mode 100644 index 000000000000..c984c3feaa16 --- /dev/null +++ b/test/std/numerics/numarray/template.mask.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 mask_array +// { +// public: +// typedef T value_type; + +#include <valarray> +#include <type_traits> + +int main() +{ + static_assert((std::is_same<std::mask_array<int>::value_type, int>::value), ""); +} diff --git a/test/std/numerics/numarray/template.slice.array/default.fail.cpp b/test/std/numerics/numarray/template.slice.array/default.fail.cpp new file mode 100644 index 000000000000..3b522f0e12cb --- /dev/null +++ b/test/std/numerics/numarray/template.slice.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 slice_array + +// slice_array() = delete; + +#include <valarray> +#include <type_traits> + +int main() +{ + std::slice_array<int> s; +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.assign/slice_array.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.assign/slice_array.pass.cpp new file mode 100644 index 000000000000..72275e01e1be --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.assign/slice_array.pass.cpp @@ -0,0 +1,55 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_array + +// const slice_array& operator=(const slice_array& sa) 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}; + int a2[] = {-1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + const std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] = v2[std::slice(2, 5, 2)]; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == -3); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == -5); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == -7); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == -9); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == -11); + assert(v1[14] == 14); + assert(v1[15] == 15); + } + // Test return value of assignment. + { + int a1[] = {0, 1, 2}; + int a2[] = {3, 4, 3}; + std::valarray<int> v1(a1, 3); + std::slice_array<int> s1 = v1[std::slice(1, 1, 1)]; + std::slice_array<int> s2 = v1[std::slice(0, 1, 1)]; + std::slice_array<int> const & s3 = (s1 = s2); + assert(&s1 == &s3); + } +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.assign/valarray.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.assign/valarray.pass.cpp new file mode 100644 index 000000000000..d3857863f91d --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.assign/valarray.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {-1, -2, -3, -4, -5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] = v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == -1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == -2); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == -3); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == -4); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == -5); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/addition.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/addition.pass.cpp new file mode 100644 index 000000000000..8b5bf75d414a --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/addition.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {-1, -2, -3, -4, -5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] += v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 0); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 2); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 4); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 6); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == 8); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/and.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/and.pass.cpp new file mode 100644 index 000000000000..dbcae84771bc --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/and.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {1, 2, 3, 4, 5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] &= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 0); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 3); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 0); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == 5); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/divide.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/divide.pass.cpp new file mode 100644 index 000000000000..71785015ba3b --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/divide.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {-1, -2, -3, -4, -5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] /= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == -1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == -2); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == -2); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == -2); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == -2); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/modulo.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/modulo.pass.cpp new file mode 100644 index 000000000000..e08fb51a8c26 --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/modulo.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {-1, -2, -3, -4, -5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] %= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 0); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 0); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 1); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 2); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == 3); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/multiply.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/multiply.pass.cpp new file mode 100644 index 000000000000..257c03164209 --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/multiply.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {-1, -2, -3, -4, -5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] *= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == -1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == -8); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == -21); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == -40); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == -65); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/or.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/or.pass.cpp new file mode 100644 index 000000000000..0826708a36f3 --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/or.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {1, 2, 3, 4, 5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] |= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 6); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 7); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 14); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == 13); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/shift_left.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/shift_left.pass.cpp new file mode 100644 index 000000000000..84360d8c9405 --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/shift_left.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {1, 2, 3, 4, 5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] <<= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 2); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 16); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 56); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 160); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == 416); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/shift_right.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/shift_right.pass.cpp new file mode 100644 index 000000000000..c39cd53e9167 --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/shift_right.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {1, 2, 3, 4, 5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] >>= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 0); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 1); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 0); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 0); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == 0); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/subtraction.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/subtraction.pass.cpp new file mode 100644 index 000000000000..e6419fb2cd1e --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/subtraction.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {-1, -2, -3, -4, -5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] -= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 2); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 6); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 10); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 14); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == 18); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/xor.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/xor.pass.cpp new file mode 100644 index 000000000000..294106ed75a6 --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/xor.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + int a2[] = {1, 2, 3, 4, 5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] ^= v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 0); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 6); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 4); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 14); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == 8); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/slice.arr.fill/assign_value.pass.cpp b/test/std/numerics/numarray/template.slice.array/slice.arr.fill/assign_value.pass.cpp new file mode 100644 index 000000000000..4f7af4baf6f5 --- /dev/null +++ b/test/std/numerics/numarray/template.slice.array/slice.arr.fill/assign_value.pass.cpp @@ -0,0 +1,41 @@ +//===----------------------------------------------------------------------===// +// +// 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 slice_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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + v1[std::slice(1, 5, 3)] = 20; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == 20); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == 20); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == 20); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == 20); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == 20); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.slice.array/types.pass.cpp b/test/std/numerics/numarray/template.slice.array/types.pass.cpp new file mode 100644 index 000000000000..8c40b154f4dc --- /dev/null +++ b/test/std/numerics/numarray/template.slice.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 slice_array +// { +// public: +// typedef T value_type; + +#include <valarray> +#include <type_traits> + +int main() +{ + static_assert((std::is_same<std::slice_array<int>::value_type, int>::value), ""); +} diff --git a/test/std/numerics/numarray/template.valarray/types.pass.cpp b/test/std/numerics/numarray/template.valarray/types.pass.cpp new file mode 100644 index 000000000000..71421e543ffa --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/types.pass.cpp @@ -0,0 +1,26 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray +// { +// public: +// typedef T value_type; +// ... + +#include <valarray> +#include <type_traits> + +int main() +{ + static_assert((std::is_same<std::valarray<int>::value_type, int>::value), ""); + static_assert((std::is_same<std::valarray<double>::value_type, double>::value), ""); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.access/access.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.access/access.pass.cpp new file mode 100644 index 000000000000..7bf164aafc20 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.access/access.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// value_type& operator[](size_t i); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {5, 4, 3, 2, 1}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + for (int i = 0; i < N; ++i) + { + assert(v[i] == a[i]); + v[i] = i; + assert(v[i] == i); + } + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.access/const_access.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.access/const_access.pass.cpp new file mode 100644 index 000000000000..b9736eedd73b --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.access/const_access.pass.cpp @@ -0,0 +1,31 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// const value_type& operator[](size_t i) const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {5, 4, 3, 2, 1}; + const unsigned N = sizeof(a)/sizeof(a[0]); + const std::valarray<T> v(a, N); + for (int i = 0; i < N; ++i) + { + assert(v[i] == a[i]); + } + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.assign/copy_assign.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.assign/copy_assign.pass.cpp new file mode 100644 index 000000000000..2fc42ada85be --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.assign/copy_assign.pass.cpp @@ -0,0 +1,58 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2; + v2 = v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v[i]); + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2; + v2 = v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v[i]); + } + { + typedef std::valarray<double> T; + T a[] = {T(1), T(2), T(3), T(4), T(5)}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2(a, N-2); + v2 = v; + assert(v2.size() == v.size()); + for (int i = 0; i < N; ++i) + { + assert(v2[i].size() == v[i].size()); + for (int j = 0; j < v[i].size(); ++j) + assert(v2[i][j] == v[i][j]); + } + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.assign/gslice_array_assign.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.assign/gslice_array_assign.pass.cpp new file mode 100644 index 000000000000..dff523f19e68 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.assign/gslice_array_assign.pass.cpp @@ -0,0 +1,58 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator=(const gslice_array<value_type>& ga); + +#include <valarray> +#include <cassert> + +int main() +{ + int a[] = { 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}; + std::valarray<int> v1(a, sizeof(a)/sizeof(a[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + std::valarray<int> v(24); + v = v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))]; + assert(v.size() == 24); + assert(v[ 0] == 3); + assert(v[ 1] == 4); + assert(v[ 2] == 5); + assert(v[ 3] == 7); + assert(v[ 4] == 8); + assert(v[ 5] == 9); + assert(v[ 6] == 11); + assert(v[ 7] == 12); + assert(v[ 8] == 13); + assert(v[ 9] == 15); + assert(v[10] == 16); + assert(v[11] == 17); + assert(v[12] == 22); + assert(v[13] == 23); + assert(v[14] == 24); + assert(v[15] == 26); + assert(v[16] == 27); + assert(v[17] == 28); + assert(v[18] == 30); + assert(v[19] == 31); + assert(v[20] == 32); + assert(v[21] == 34); + assert(v[22] == 35); + assert(v[23] == 36); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.assign/indirect_array_assign.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.assign/indirect_array_assign.pass.cpp new file mode 100644 index 000000000000..6e8069cc2fad --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.assign/indirect_array_assign.pass.cpp @@ -0,0 +1,58 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator=(const indirect_array<value_type>& ia); + +#include <valarray> +#include <cassert> + +int main() +{ + int a[] = { 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(a)/sizeof(a[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(a, N1); + std::valarray<std::size_t> ia(s, S); + std::valarray<int> v(24); + v = v1[ia]; + assert(v.size() == 24); + assert(v[ 0] == 3); + assert(v[ 1] == 4); + assert(v[ 2] == 5); + assert(v[ 3] == 7); + assert(v[ 4] == 8); + assert(v[ 5] == 9); + assert(v[ 6] == 11); + assert(v[ 7] == 12); + assert(v[ 8] == 13); + assert(v[ 9] == 15); + assert(v[10] == 16); + assert(v[11] == 17); + assert(v[12] == 22); + assert(v[13] == 23); + assert(v[14] == 24); + assert(v[15] == 26); + assert(v[16] == 27); + assert(v[17] == 28); + assert(v[18] == 30); + assert(v[19] == 31); + assert(v[20] == 32); + assert(v[21] == 34); + assert(v[22] == 35); + assert(v[23] == 36); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.assign/initializer_list_assign.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.assign/initializer_list_assign.pass.cpp new file mode 100644 index 000000000000..571f56acd575 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.assign/initializer_list_assign.pass.cpp @@ -0,0 +1,57 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator=(initializer_list<value_type> il); + +#include <valarray> +#include <cassert> + +int main() +{ +#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v2; + v2 = {1, 2, 3, 4, 5}; + assert(v2.size() == N); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a[i]); + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v2; + v2 = {1, 2.5, 3, 4.25, 5}; + assert(v2.size() == N); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a[i]); + } + { + typedef std::valarray<double> T; + T a[] = {T(1), T(2), T(3), T(4), T(5)}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v2(a, N-2); + v2 = {T(1), T(2), T(3), T(4), T(5)}; + assert(v2.size() == N); + for (int i = 0; i < N; ++i) + { + assert(v2[i].size() == a[i].size()); + for (int j = 0; j < a[i].size(); ++j) + assert(v2[i][j] == a[i][j]); + } + } +#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.assign/mask_array_assign.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.assign/mask_array_assign.pass.cpp new file mode 100644 index 000000000000..a52c9d9d6726 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.assign/mask_array_assign.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator=(const mask_array<value_type>& ma); + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<bool> vb(b, N1); + std::valarray<int> v2(5); + v2 = v1[vb]; + assert(v2.size() == 5); + assert(v2[ 0] == 0); + assert(v2[ 1] == 3); + assert(v2[ 2] == 4); + assert(v2[ 3] == 7); + assert(v2[ 4] == 11); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.assign/move_assign.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.assign/move_assign.pass.cpp new file mode 100644 index 000000000000..d4f750652e28 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.assign/move_assign.pass.cpp @@ -0,0 +1,63 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator=(valarray&& v); + +#include <valarray> +#include <cassert> + +int main() +{ +#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2; + v2 = std::move(v); + assert(v2.size() == N); + assert(v.size() == 0); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a[i]); + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2; + v2 = std::move(v); + assert(v2.size() == N); + assert(v.size() == 0); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a[i]); + } + { + typedef std::valarray<double> T; + T a[] = {T(1), T(2), T(3), T(4), T(5)}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2(a, N-2); + v2 = std::move(v); + assert(v2.size() == N); + assert(v.size() == 0); + for (int i = 0; i < N; ++i) + { + assert(v2[i].size() == a[i].size()); + for (int j = 0; j < a[i].size(); ++j) + assert(v2[i][j] == a[i][j]); + } + } +#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.assign/slice_array_assign.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.assign/slice_array_assign.pass.cpp new file mode 100644 index 000000000000..9a7517aa1f44 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.assign/slice_array_assign.pass.cpp @@ -0,0 +1,31 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator=(const slice_array<value_type>& sa); + +#include <valarray> +#include <cassert> + +int main() +{ + int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; + std::valarray<int> v1(a, sizeof(a)/sizeof(a[0])); + std::valarray<int> v(5); + v = v1[std::slice(1, 5, 3)]; + assert(v.size() == 5); + assert(v[0] == 1); + assert(v[1] == 4); + assert(v[2] == 7); + assert(v[3] == 10); + assert(v[4] == 13); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.assign/value_assign.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.assign/value_assign.pass.cpp new file mode 100644 index 000000000000..b9d67f86a212 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.assign/value_assign.pass.cpp @@ -0,0 +1,31 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + v = 7; + assert(v.size() == N); + for (int i = 0; i < v.size(); ++i) + assert(v[i] == 7); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/and_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/and_valarray.pass.cpp new file mode 100644 index 000000000000..5b1c1b9911b4 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/and_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator&=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {0, 2, 0, 0, 0}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v1 &= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/and_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/and_value.pass.cpp new file mode 100644 index 000000000000..2106a13e2c35 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/and_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator&=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 1, 2, 3, 0, 1}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v1 &= 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_valarray.pass.cpp new file mode 100644 index 000000000000..3992d0aa43da --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator/=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {6, 14, 24, 36, 50}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v3 /= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_value.pass.cpp new file mode 100644 index 000000000000..7bd1cc84df6c --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator/=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 12, 18, 24, 30}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v2 /= 6; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_valarray.pass.cpp new file mode 100644 index 000000000000..e3d308abacc1 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator-=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {7, 9, 11, 13, 15}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v3 -= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_value.pass.cpp new file mode 100644 index 000000000000..27ea8c2c0366 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator-=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = {-2, -1, 0, 1, 2}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v1 -= 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_valarray.pass.cpp new file mode 100644 index 000000000000..1754a5575eb5 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator%=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {0, 1, 2, 1, 0}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v2 %= v1; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v2[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_value.pass.cpp new file mode 100644 index 000000000000..794a0b629268 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator%=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {1, 2, 0, 1, 2}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v1 %= 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/or_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/or_valarray.pass.cpp new file mode 100644 index 000000000000..0d70b4e715da --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/or_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator|=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {7, 7, 11, 13, 15}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v1 |= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/or_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/or_value.pass.cpp new file mode 100644 index 000000000000..4030907ff3e7 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/or_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator|=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 3, 3, 3, 7, 7}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v1 |= 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/plus_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/plus_valarray.pass.cpp new file mode 100644 index 000000000000..fdf999c2a044 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/plus_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator+=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {7, 9, 11, 13, 15}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v1 += v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/plus_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/plus_value.pass.cpp new file mode 100644 index 000000000000..23d6d9d05229 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/plus_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator+=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {4, 5, 6, 7, 8}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v1 += 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_left_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_left_valarray.pass.cpp new file mode 100644 index 000000000000..ad44e3887eca --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_left_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator<<=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 6, 7, 8, 9, 10}; + T a3[] = {64, 256, 768, 2048, 5120}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v1 <<= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_left_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_left_value.pass.cpp new file mode 100644 index 000000000000..366407a95c6f --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_left_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator<<=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 8, 16, 24, 32, 40}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v1 <<= 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_right_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_right_valarray.pass.cpp new file mode 100644 index 000000000000..f7df16b843ca --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_right_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator>>=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 6, 7, 8, 9, 10}; + T a3[] = {64, 256, 768, 2048, 5120}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v3 >>= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_right_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_right_value.pass.cpp new file mode 100644 index 000000000000..7c568b14cbea --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/shift_right_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator>>=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 8, 16, 24, 32, 40}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v2 >>= 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/times_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/times_valarray.pass.cpp new file mode 100644 index 000000000000..d3cf1eb88641 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/times_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator*=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {6, 14, 24, 36, 50}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v1 *= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/times_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/times_value.pass.cpp new file mode 100644 index 000000000000..aea9806bc0d0 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/times_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator*=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 12, 18, 24, 30}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v1 *= 6; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/xor_valarray.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/xor_valarray.pass.cpp new file mode 100644 index 000000000000..a10bd7e0a000 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/xor_valarray.pass.cpp @@ -0,0 +1,36 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator^=(const valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {7, 5, 11, 13, 15}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3(a3, N); + v1 ^= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v3[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cassign/xor_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cassign/xor_value.pass.cpp new file mode 100644 index 000000000000..327952f7b3aa --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cassign/xor_value.pass.cpp @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray& operator^=(const value_type& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 2, 1, 0, 7, 6}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + v1 ^= 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/copy.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/copy.pass.cpp new file mode 100644 index 000000000000..04ac2cdf1b90 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/copy.pass.cpp @@ -0,0 +1,55 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(const valarray<value_type>& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v[i]); + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v[i]); + } + { + typedef std::valarray<double> T; + T a[] = {T(1), T(2), T(3), T(4), T(5)}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = v; + assert(v2.size() == v.size()); + for (int i = 0; i < N; ++i) + { + assert(v2[i].size() == v[i].size()); + for (int j = 0; j < v[i].size(); ++j) + assert(v2[i][j] == v[i][j]); + } + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/default.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/default.pass.cpp new file mode 100644 index 000000000000..f46e0bf28cf8 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/default.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(); + +#include <valarray> +#include <cassert> + +int main() +{ + { + std::valarray<int> v; + assert(v.size() == 0); + } + { + std::valarray<float> v; + assert(v.size() == 0); + } + { + std::valarray<double> v; + assert(v.size() == 0); + } + { + std::valarray<std::valarray<double> > v; + assert(v.size() == 0); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/gslice_array.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/gslice_array.pass.cpp new file mode 100644 index 000000000000..56601dc92531 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/gslice_array.pass.cpp @@ -0,0 +1,57 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(const gslice_array<value_type>& sa); + +#include <valarray> +#include <cassert> + +int main() +{ + int a[] = { 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}; + std::valarray<int> v1(a, sizeof(a)/sizeof(a[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + std::valarray<int> v(v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))]); + assert(v.size() == 24); + assert(v[ 0] == 3); + assert(v[ 1] == 4); + assert(v[ 2] == 5); + assert(v[ 3] == 7); + assert(v[ 4] == 8); + assert(v[ 5] == 9); + assert(v[ 6] == 11); + assert(v[ 7] == 12); + assert(v[ 8] == 13); + assert(v[ 9] == 15); + assert(v[10] == 16); + assert(v[11] == 17); + assert(v[12] == 22); + assert(v[13] == 23); + assert(v[14] == 24); + assert(v[15] == 26); + assert(v[16] == 27); + assert(v[17] == 28); + assert(v[18] == 30); + assert(v[19] == 31); + assert(v[20] == 32); + assert(v[21] == 34); + assert(v[22] == 35); + assert(v[23] == 36); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/indirect_array.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/indirect_array.pass.cpp new file mode 100644 index 000000000000..dbca1f9c7661 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/indirect_array.pass.cpp @@ -0,0 +1,57 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(const indirect_array<value_type>& ia); + +#include <valarray> +#include <cassert> + +int main() +{ + int a[] = { 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(a)/sizeof(a[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(a, N1); + std::valarray<std::size_t> ia(s, S); + std::valarray<int> v(v1[ia]); + assert(v.size() == 24); + assert(v[ 0] == 3); + assert(v[ 1] == 4); + assert(v[ 2] == 5); + assert(v[ 3] == 7); + assert(v[ 4] == 8); + assert(v[ 5] == 9); + assert(v[ 6] == 11); + assert(v[ 7] == 12); + assert(v[ 8] == 13); + assert(v[ 9] == 15); + assert(v[10] == 16); + assert(v[11] == 17); + assert(v[12] == 22); + assert(v[13] == 23); + assert(v[14] == 24); + assert(v[15] == 26); + assert(v[16] == 27); + assert(v[17] == 28); + assert(v[18] == 30); + assert(v[19] == 31); + assert(v[20] == 32); + assert(v[21] == 34); + assert(v[22] == 35); + assert(v[23] == 36); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/initializer_list.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/initializer_list.pass.cpp new file mode 100644 index 000000000000..1ab460f1b9d5 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/initializer_list.pass.cpp @@ -0,0 +1,41 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(initializer_list<value_type>); + +#include <valarray> +#include <cassert> + +int main() +{ +#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v = {1, 2, 3, 4, 5}; + assert(v.size() == N); + for (int i = 0; i < N; ++i) + assert(v[i] == a[i]); + } + { + typedef double T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v = {1, 2, 3, 4, 5}; + assert(v.size() == N); + for (int i = 0; i < N; ++i) + assert(v[i] == a[i]); + } +#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/mask_array.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/mask_array.pass.cpp new file mode 100644 index 000000000000..be4f7403945e --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/mask_array.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(const mask_array<value_type>& ma); + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<bool> vb(b, N1); + std::valarray<int> v2(v1[vb]); + assert(v2.size() == 5); + assert(v2[ 0] == 0); + assert(v2[ 1] == 3); + assert(v2[ 2] == 4); + assert(v2[ 3] == 7); + assert(v2[ 4] == 11); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/move.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/move.pass.cpp new file mode 100644 index 000000000000..6ac8773fa4e2 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/move.pass.cpp @@ -0,0 +1,61 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(const valarray<value_type>& v); + +#include <valarray> +#include <utility> +#include <cassert> + +int main() +{ +#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = std::move(v); + assert(v2.size() == N); + assert(v.size() == 0); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a[i]); + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = std::move(v); + assert(v2.size() == N); + assert(v.size() == 0); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a[i]); + } + { + typedef std::valarray<double> T; + T a[] = {T(1), T(2), T(3), T(4), T(5)}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = std::move(v); + assert(v2.size() == N); + assert(v.size() == 0); + for (int i = 0; i < N; ++i) + { + assert(v2[i].size() == a[i].size()); + for (int j = 0; j < v2[i].size(); ++j) + assert(v2[i][j] == a[i][j]); + } + } +#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/pointer_size.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/pointer_size.pass.cpp new file mode 100644 index 000000000000..3d3649ee40ac --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/pointer_size.pass.cpp @@ -0,0 +1,52 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(const value_type* p, size_t n); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + assert(v.size() == N); + for (int i = 0; i < N; ++i) + assert(v[i] == a[i]); + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + assert(v.size() == N); + for (int i = 0; i < N; ++i) + assert(v[i] == a[i]); + } + { + typedef std::valarray<double> T; + T a[] = {T(1), T(2), T(3), T(4), T(5)}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + assert(v.size() == N); + for (int i = 0; i < N; ++i) + { + assert(v[i].size() == a[i].size()); + for (int j = 0; j < v[i].size(); ++j) + assert(v[i][j] == a[i][j]); + } + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/size.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/size.pass.cpp new file mode 100644 index 000000000000..359073eb3ae9 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/size.pass.cpp @@ -0,0 +1,39 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// explicit valarray(size_t); + +#include <valarray> +#include <cassert> + +int main() +{ + { + std::valarray<int> v(100); + assert(v.size() == 100); + for (int i = 0; i < 100; ++i) + assert(v[i] == 0); + } + { + std::valarray<double> v(100); + assert(v.size() == 100); + for (int i = 0; i < 100; ++i) + assert(v[i] == 0); + } + { + std::valarray<std::valarray<double> > v(100); + assert(v.size() == 100); + for (int i = 0; i < 100; ++i) + assert(v[i].size() == 0); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/slice_array.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/slice_array.pass.cpp new file mode 100644 index 000000000000..b676414140c1 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/slice_array.pass.cpp @@ -0,0 +1,30 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(const slice_array<value_type>& sa); + +#include <valarray> +#include <cassert> + +int main() +{ + int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; + std::valarray<int> v1(a, sizeof(a)/sizeof(a[0])); + std::valarray<int> v(v1[std::slice(1, 5, 3)]); + assert(v.size() == 5); + assert(v[0] == 1); + assert(v[1] == 4); + assert(v[2] == 7); + assert(v[3] == 10); + assert(v[4] == 13); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.cons/value_size.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.cons/value_size.pass.cpp new file mode 100644 index 000000000000..336c898b548d --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.cons/value_size.pass.cpp @@ -0,0 +1,39 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray(const value_type& x, size_t n); + +#include <valarray> +#include <cassert> + +int main() +{ + { + std::valarray<int> v(5, 100); + assert(v.size() == 100); + for (int i = 0; i < 100; ++i) + assert(v[i] == 5); + } + { + std::valarray<double> v(2.5, 100); + assert(v.size() == 100); + for (int i = 0; i < 100; ++i) + assert(v[i] == 2.5); + } + { + std::valarray<std::valarray<double> > v(std::valarray<double>(10), 100); + assert(v.size() == 100); + for (int i = 0; i < 100; ++i) + assert(v[i].size() == 10); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/apply_cref.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/apply_cref.pass.cpp new file mode 100644 index 000000000000..919a3a5e4997 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/apply_cref.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray apply(value_type f(const value_type&)) const; + +#include <valarray> +#include <cassert> + +typedef int T; + +T f(const T& t) {return t + 5;} + +int main() +{ + { + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.apply(f); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + const unsigned N1 = 0; + std::valarray<T> v1; + std::valarray<T> v2 = v1.apply(f); + assert(v2.size() == N1); + } + { + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {7, 9, 11, 13, 15, 17, 19, 21, 23, 25}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = (v1+v1).apply(f); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/apply_value.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/apply_value.pass.cpp new file mode 100644 index 000000000000..dc7a1a100a21 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/apply_value.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray apply(value_type f(value_type)) const; + +#include <valarray> +#include <cassert> + +typedef int T; + +T f(T t) {return t + 5;} + +int main() +{ + { + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.apply(f); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + const unsigned N1 = 0; + std::valarray<T> v1; + std::valarray<T> v2 = v1.apply(f); + assert(v2.size() == N1); + } + { + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {7, 9, 11, 13, 15, 17, 19, 21, 23, 25}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = (v1+v1).apply(f); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/cshift.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/cshift.pass.cpp new file mode 100644 index 000000000000..601a6df8d5e5 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/cshift.pass.cpp @@ -0,0 +1,127 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray cshift(int i) const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.cshift(0); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {4, 5, 6, 7, 8, 9, 10, 1, 2, 3}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.cshift(3); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.cshift(10); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {8, 9, 10, 1, 2, 3, 4, 5, 6, 7}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.cshift(17); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {8, 9, 10, 1, 2, 3, 4, 5, 6, 7}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.cshift(-3); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.cshift(-10); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {4, 5, 6, 7, 8, 9, 10, 1, 2, 3}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.cshift(-17); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + const unsigned N1 = 0; + std::valarray<T> v1; + std::valarray<T> v2 = v1.cshift(-17); + assert(v2.size() == N1); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {8, 10, 12, 14, 16, 18, 20, 2, 4, 6}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = (v1 + v1).cshift(3); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {16, 18, 20, 2, 4, 6, 8, 10, 12, 14}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = (v1 + v1).cshift(-3); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/max.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/max.pass.cpp new file mode 100644 index 000000000000..697d4cd19ed6 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/max.pass.cpp @@ -0,0 +1,40 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// value_type max() const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef double T; + T a1[] = {1.5, 2.5, -3, 4, -5.5}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + assert(v1.max() == 4.0); + } + { + typedef double T; + std::valarray<T> v1; + v1.max(); + } + { + typedef double T; + T a1[] = {1.5, 2.5, -3, 4, -5.5}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + assert((2*v1).max() == 8.0); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/min.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/min.pass.cpp new file mode 100644 index 000000000000..dac59343715a --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/min.pass.cpp @@ -0,0 +1,40 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// value_type min() const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef double T; + T a1[] = {1.5, 2.5, -3, 4, 5.5}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + assert(v1.min() == -3.0); + } + { + typedef double T; + std::valarray<T> v1; + v1.min(); + } + { + typedef double T; + T a1[] = {1.5, 2.5, -3, 4, 5.5}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + assert((2*v1).min() == -6.0); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/resize.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/resize.pass.cpp new file mode 100644 index 000000000000..176d958aab92 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/resize.pass.cpp @@ -0,0 +1,41 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// void resize(size_t n, value_type x = value_type()); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + v1.resize(8); + assert(v1.size() == 8); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == 0); + v1.resize(0); + assert(v1.size() == 0); + v1.resize(80); + assert(v1.size() == 80); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == 0); + v1.resize(40); + assert(v1.size() == 40); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == 0); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/shift.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/shift.pass.cpp new file mode 100644 index 000000000000..9a617a91a417 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/shift.pass.cpp @@ -0,0 +1,127 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray shift(int i) const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.shift(0); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {2, 3, 4, 5, 6, 7, 8, 9, 10, 0}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.shift(1); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {10, 0, 0, 0, 0, 0, 0, 0, 0, 0}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.shift(9); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.shift(90); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.shift(-1); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 1}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.shift(-9); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = v1.shift(-90); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + const unsigned N1 = 0; + std::valarray<T> v1; + std::valarray<T> v2 = v1.shift(-90); + assert(v2.size() == N1); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {8, 10, 12, 14, 16, 18, 20, 0, 0, 0}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = (v1 + v1).shift(3); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + T a2[] = {0, 0, 0, 2, 4, 6, 8, 10, 12, 14}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2 = (v1 + v1).shift(-3); + assert(v2.size() == N1); + for (unsigned i = 0; i < N1; ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/size.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/size.pass.cpp new file mode 100644 index 000000000000..0aae5b8de7fa --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/size.pass.cpp @@ -0,0 +1,41 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// size_t size() const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + assert(v1.size() == N1); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + const unsigned N1 = 0; + std::valarray<T> v1(a1, N1); + assert(v1.size() == N1); + } + { + typedef int T; + const unsigned N1 = 0; + std::valarray<T> v1; + assert(v1.size() == N1); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/sum.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/sum.pass.cpp new file mode 100644 index 000000000000..189f03d25cf4 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/sum.pass.cpp @@ -0,0 +1,28 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// value_type sum() const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef double T; + T a1[] = {1.5, 2.5, 3, 4, 5.5}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N1); + assert(v1.sum() == 16.5); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.members/swap.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.members/swap.pass.cpp new file mode 100644 index 000000000000..a90a80936376 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.members/swap.pass.cpp @@ -0,0 +1,89 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// void swap(valarray& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10, 11, 12}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + const unsigned N2 = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2(a2, N2); + std::valarray<T> v1_save = v1; + std::valarray<T> v2_save = v2; + v1.swap(v2); + assert(v1.size() == v2_save.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2_save[i]); + assert(v2.size() == v1_save.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v1_save[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + const unsigned N2 = 0; + std::valarray<T> v1(a1, N1); + std::valarray<T> v2; + std::valarray<T> v1_save = v1; + std::valarray<T> v2_save = v2; + v1.swap(v2); + assert(v1.size() == v2_save.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2_save[i]); + assert(v2.size() == v1_save.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v1_save[i]); + } + { + typedef int T; + T a2[] = {6, 7, 8, 9, 10, 11, 12}; + const unsigned N1 = 0; + const unsigned N2 = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v1; + std::valarray<T> v2(a2, N2); + std::valarray<T> v1_save = v1; + std::valarray<T> v2_save = v2; + v1.swap(v2); + assert(v1.size() == v2_save.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2_save[i]); + assert(v2.size() == v1_save.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v1_save[i]); + } + { + typedef int T; + const unsigned N1 = 0; + const unsigned N2 = 0; + std::valarray<T> v1; + std::valarray<T> v2; + std::valarray<T> v1_save = v1; + std::valarray<T> v2_save = v2; + v1.swap(v2); + assert(v1.size() == v2_save.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2_save[i]); + assert(v2.size() == v1_save.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v1_save[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.sub/gslice_const.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.sub/gslice_const.pass.cpp new file mode 100644 index 000000000000..7bbd48c34538 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.sub/gslice_const.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 valarray; + +// gslice_array<value_type> operator[](const gslice& gs); + +#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}; + 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))] = 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.valarray/valarray.sub/gslice_non_const.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.sub/gslice_non_const.pass.cpp new file mode 100644 index 000000000000..282dcf1f6db9 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.sub/gslice_non_const.pass.cpp @@ -0,0 +1,57 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray operator[](const gslice& gs) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a[] = { 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}; + std::valarray<int> v1(a, sizeof(a)/sizeof(a[0])); + std::size_t sz[] = {2, 4, 3}; + std::size_t st[] = {19, 4, 1}; + typedef std::valarray<std::size_t> sizes; + typedef std::valarray<std::size_t> strides; + std::valarray<int> v(v1[std::gslice(3, sizes(sz, sizeof(sz)/sizeof(sz[0])), + strides(st, sizeof(st)/sizeof(st[0])))]); + assert(v.size() == 24); + assert(v[ 0] == 3); + assert(v[ 1] == 4); + assert(v[ 2] == 5); + assert(v[ 3] == 7); + assert(v[ 4] == 8); + assert(v[ 5] == 9); + assert(v[ 6] == 11); + assert(v[ 7] == 12); + assert(v[ 8] == 13); + assert(v[ 9] == 15); + assert(v[10] == 16); + assert(v[11] == 17); + assert(v[12] == 22); + assert(v[13] == 23); + assert(v[14] == 24); + assert(v[15] == 26); + assert(v[16] == 27); + assert(v[17] == 28); + assert(v[18] == 30); + assert(v[19] == 31); + assert(v[20] == 32); + assert(v[21] == 34); + assert(v[22] == 35); + assert(v[23] == 36); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.sub/indirect_array_const.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.sub/indirect_array_const.pass.cpp new file mode 100644 index 000000000000..1bc4fb929007 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.sub/indirect_array_const.pass.cpp @@ -0,0 +1,57 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray operator[](const valarray<size_t>& vs) const; + +#include <valarray> +#include <cassert> + +int main() +{ + int a[] = { 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(a)/sizeof(a[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]); + const std::valarray<int> v1(a, N1); + std::valarray<std::size_t> ia(s, S); + std::valarray<int> v = v1[ia]; + assert(v.size() == 24); + assert(v[ 0] == 3); + assert(v[ 1] == 4); + assert(v[ 2] == 5); + assert(v[ 3] == 7); + assert(v[ 4] == 8); + assert(v[ 5] == 9); + assert(v[ 6] == 11); + assert(v[ 7] == 12); + assert(v[ 8] == 13); + assert(v[ 9] == 15); + assert(v[10] == 16); + assert(v[11] == 17); + assert(v[12] == 22); + assert(v[13] == 23); + assert(v[14] == 24); + assert(v[15] == 26); + assert(v[16] == 27); + assert(v[17] == 28); + assert(v[18] == 30); + assert(v[19] == 31); + assert(v[20] == 32); + assert(v[21] == 34); + assert(v[22] == 35); + assert(v[23] == 36); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.sub/indirect_array_non_const.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.sub/indirect_array_non_const.pass.cpp new file mode 100644 index 000000000000..d0b7438172ee --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.sub/indirect_array_non_const.pass.cpp @@ -0,0 +1,58 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// indirect_array<value_type> operator[](const valarray<size_t>& vs); + +#include <valarray> +#include <cassert> + +int main() +{ + int a[] = { 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(a)/sizeof(a[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(a, N1); + std::valarray<std::size_t> ia(s, S); + std::valarray<int> v(24); + v = v1[ia]; + assert(v.size() == 24); + assert(v[ 0] == 3); + assert(v[ 1] == 4); + assert(v[ 2] == 5); + assert(v[ 3] == 7); + assert(v[ 4] == 8); + assert(v[ 5] == 9); + assert(v[ 6] == 11); + assert(v[ 7] == 12); + assert(v[ 8] == 13); + assert(v[ 9] == 15); + assert(v[10] == 16); + assert(v[11] == 17); + assert(v[12] == 22); + assert(v[13] == 23); + assert(v[14] == 24); + assert(v[15] == 26); + assert(v[16] == 27); + assert(v[17] == 28); + assert(v[18] == 30); + assert(v[19] == 31); + assert(v[20] == 32); + assert(v[21] == 34); + assert(v[22] == 35); + assert(v[23] == 36); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.sub/slice_const.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.sub/slice_const.pass.cpp new file mode 100644 index 000000000000..7f8191035e7a --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.sub/slice_const.pass.cpp @@ -0,0 +1,30 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray operator[](slice s) 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}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2 = v1[std::slice(1, 5, 3)]; + assert(v2.size() == 5); + assert(v2[0] == 1); + assert(v2[1] == 4); + assert(v2[2] == 7); + assert(v2[3] == 10); + assert(v2[4] == 13); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.sub/slice_non_const.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.sub/slice_non_const.pass.cpp new file mode 100644 index 000000000000..6bf9b430ec84 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.sub/slice_non_const.pass.cpp @@ -0,0 +1,43 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// slice_array<value_type> operator[](slice s); + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; + int a2[] = {-1, -2, -3, -4, -5}; + std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0])); + std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0])); + v1[std::slice(1, 5, 3)] = v2; + assert(v1.size() == 16); + assert(v1[ 0] == 0); + assert(v1[ 1] == -1); + assert(v1[ 2] == 2); + assert(v1[ 3] == 3); + assert(v1[ 4] == -2); + assert(v1[ 5] == 5); + assert(v1[ 6] == 6); + assert(v1[ 7] == -3); + assert(v1[ 8] == 8); + assert(v1[ 9] == 9); + assert(v1[10] == -4); + assert(v1[11] == 11); + assert(v1[12] == 12); + assert(v1[13] == -5); + assert(v1[14] == 14); + assert(v1[15] == 15); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.sub/valarray_bool_const.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.sub/valarray_bool_const.pass.cpp new file mode 100644 index 000000000000..10bdd82e5536 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.sub/valarray_bool_const.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray operator[](const valarray<bool>& vb) 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}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<bool> vb(b, N1); + std::valarray<int> v2(v1[vb]); + assert(v2.size() == 5); + assert(v2[ 0] == 0); + assert(v2[ 1] == 3); + assert(v2[ 2] == 4); + assert(v2[ 3] == 7); + assert(v2[ 4] == 11); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.sub/valarray_bool_non_const.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.sub/valarray_bool_non_const.pass.cpp new file mode 100644 index 000000000000..cecf9502293d --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.sub/valarray_bool_non_const.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// mask_array<value_type> operator[](const valarray<bool>& vb); + +#include <valarray> +#include <cassert> + +int main() +{ + int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; + const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); + bool b[N1] = {true, false, false, true, true, false, + false, true, false, false, false, true}; + std::valarray<int> v1(a1, N1); + std::valarray<bool> vb(b, N1); + std::valarray<int> v2(5); + v2 = v1[vb]; + assert(v2.size() == 5); + assert(v2[ 0] == 0); + assert(v2[ 1] == 3); + assert(v2[ 2] == 4); + assert(v2[ 3] == 7); + assert(v2[ 4] == 11); +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.unary/bit_not.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.unary/bit_not.pass.cpp new file mode 100644 index 000000000000..c1d240cb6798 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.unary/bit_not.pass.cpp @@ -0,0 +1,55 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray operator~() const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = ~v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == ~v[i]); + } + { + typedef std::valarray<int> T; + T a[] = {T(1), T(2), T(3), T(4), T(5)}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = ~v; + assert(v2.size() == v.size()); + for (int i = 0; i < N; ++i) + { + assert(v2[i].size() == v[i].size()); + for (int j = 0; j < v[i].size(); ++j) + assert(v2[i][j] == ~v[i][j]); + } + } + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = ~(v + v); + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == ~(2*v[i])); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.unary/negate.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.unary/negate.pass.cpp new file mode 100644 index 000000000000..25674bb44d92 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.unary/negate.pass.cpp @@ -0,0 +1,65 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray operator-() const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = -v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == -v[i]); + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = -v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == -v[i]); + } + { + typedef std::valarray<double> T; + T a[] = {T(1), T(2), T(3), T(4), T(5)}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = -v; + assert(v2.size() == v.size()); + for (int i = 0; i < N; ++i) + { + assert(v2[i].size() == v[i].size()); + for (int j = 0; j < v[i].size(); ++j) + assert(v2[i][j] == -v[i][j]); + } + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = -(v + v); + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == -2*v[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.unary/not.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.unary/not.pass.cpp new file mode 100644 index 000000000000..0b792c68fb94 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.unary/not.pass.cpp @@ -0,0 +1,41 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray<bool> operator!() const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<bool> v2 = !v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == !v[i]); + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<bool> v2 = !(v + v); + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == !2*v[i]); + } +} diff --git a/test/std/numerics/numarray/template.valarray/valarray.unary/plus.pass.cpp b/test/std/numerics/numarray/template.valarray/valarray.unary/plus.pass.cpp new file mode 100644 index 000000000000..4bcdaf095ff5 --- /dev/null +++ b/test/std/numerics/numarray/template.valarray/valarray.unary/plus.pass.cpp @@ -0,0 +1,65 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// valarray operator+() const; + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = +v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == +v[i]); + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = +v; + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == +v[i]); + } + { + typedef std::valarray<double> T; + T a[] = {T(1), T(2), T(3), T(4), T(5)}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = +v; + assert(v2.size() == v.size()); + for (int i = 0; i < N; ++i) + { + assert(v2[i].size() == v[i].size()); + for (int j = 0; j < v[i].size(); ++j) + assert(v2[i][j] == +v[i][j]); + } + } + { + typedef double T; + T a[] = {1, 2.5, 3, 4.25, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + std::valarray<T> v2 = +(v + v); + assert(v2.size() == v.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == +2*v[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/nothing_to_do.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/nothing_to_do.pass.cpp new file mode 100644 index 000000000000..b58f5c55b643 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/nothing_to_do.pass.cpp @@ -0,0 +1,12 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +int main() +{ +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/and_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/and_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..9214e61fb4da --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/and_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator&(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {0, 2, 0, 0, 0}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 & v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/and_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/and_valarray_value.pass.cpp new file mode 100644 index 000000000000..0976a88dcb81 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/and_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator&(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 1, 2, 3, 0, 1}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 & 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/and_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/and_value_valarray.pass.cpp new file mode 100644 index 000000000000..e3dd180b2181 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/and_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator&(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 1, 2, 3, 0, 1}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 3 & v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/divide_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/divide_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..ff250afd2a1a --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/divide_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator/(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {6, 14, 24, 36, 50}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 / v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/divide_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/divide_valarray_value.pass.cpp new file mode 100644 index 000000000000..ffbebab1e1ae --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/divide_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator/(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {6, 12, 18, 24, 30}; + T a2[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 / 6; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/divide_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/divide_value_valarray.pass.cpp new file mode 100644 index 000000000000..1a7f2f07c83a --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/divide_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator/(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {3, 1, 1, 0, 0}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 3 / v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/minus_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/minus_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..1f0354e8ac63 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/minus_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator-(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {7, 9, 11, 13, 15}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 - v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/minus_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/minus_valarray_value.pass.cpp new file mode 100644 index 000000000000..382cab8eae6e --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/minus_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator-(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = {-2, -1, 0, 1, 2}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 - 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/minus_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/minus_value_valarray.pass.cpp new file mode 100644 index 000000000000..7f00aba84884 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/minus_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator-(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 2, 1, 0, -1, -2}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 3 - v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/modulo_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/modulo_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..0a9cf3884c08 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/modulo_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator%(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {6, 7, 8, 9, 10}; + T a2[] = {1, 2, 3, 4, 5}; + T a3[] = {0, 1, 2, 1, 0}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 % v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/modulo_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/modulo_valarray_value.pass.cpp new file mode 100644 index 000000000000..12c4c2453702 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/modulo_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator%(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {1, 2, 0, 1, 2}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 % 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/modulo_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/modulo_value_valarray.pass.cpp new file mode 100644 index 000000000000..1d73887217e1 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/modulo_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator%(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {0, 1, 0, 3, 3}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 3 % v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/or_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/or_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..a23ea4f58b8c --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/or_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator|(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {7, 7, 11, 13, 15}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 | v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/or_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/or_valarray_value.pass.cpp new file mode 100644 index 000000000000..f617c27ae7fc --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/or_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator|(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 3, 3, 3, 7, 7}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 | 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/or_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/or_value_valarray.pass.cpp new file mode 100644 index 000000000000..8903f438aaf1 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/or_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator|(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 3, 3, 3, 7, 7}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 3 | v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/plus_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/plus_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..1167772aff6a --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/plus_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator+(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {7, 9, 11, 13, 15}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 + v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/plus_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/plus_valarray_value.pass.cpp new file mode 100644 index 000000000000..b1b4e6931c0c --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/plus_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator+(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {4, 5, 6, 7, 8}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 + 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/plus_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/plus_value_valarray.pass.cpp new file mode 100644 index 000000000000..df22853488e9 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/plus_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator+(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {4, 5, 6, 7, 8}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 3 + v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_left_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_left_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..42a7c419a3a3 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_left_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator<<(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 6, 7, 8, 9, 10}; + T a3[] = {64, 256, 768, 2048, 5120}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 << v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_left_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_left_valarray_value.pass.cpp new file mode 100644 index 000000000000..753ba38f357f --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_left_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator<<(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 8, 16, 24, 32, 40}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 << 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_left_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_left_value_valarray.pass.cpp new file mode 100644 index 000000000000..640ce1a47b32 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_left_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator<<(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 6, 12, 24, 48, 96}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 3 << v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_right_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_right_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..8e6358d62060 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_right_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator>>(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {64, 256, 768, 2048, 5120}; + T a2[] = { 6, 7, 8, 9, 10}; + T a3[] = { 1, 2, 3, 4, 5}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 >> v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_right_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_right_valarray_value.pass.cpp new file mode 100644 index 000000000000..0c0ba54463e1 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_right_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator>>(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 8, 16, 24, 32, 40}; + T a2[] = { 1, 2, 3, 4, 5}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 >> 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_right_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_right_value_valarray.pass.cpp new file mode 100644 index 000000000000..ad5418af0267 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/shift_right_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator>>(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = {20, 10, 5, 2, 1}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 40 >> v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/times_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/times_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..69a3bffc3e77 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/times_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator*(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {6, 14, 24, 36, 50}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 * v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/times_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/times_valarray_value.pass.cpp new file mode 100644 index 000000000000..c4fb410de768 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/times_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator+(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 12, 18, 24, 30}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 * 6; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/times_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/times_value_valarray.pass.cpp new file mode 100644 index 000000000000..f5d877783ded --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/times_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator*(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 12, 18, 24, 30}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 6 * v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/xor_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/xor_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..71b505b0cbe8 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/xor_valarray_valarray.pass.cpp @@ -0,0 +1,35 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator^(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10}; + T a3[] = {7, 5, 11, 13, 15}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = v1 ^ v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/xor_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/xor_valarray_value.pass.cpp new file mode 100644 index 000000000000..8dbe6843cd24 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/xor_valarray_value.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator^(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 2, 1, 0, 7, 6}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = v1 ^ 3; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/xor_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/xor_value_valarray.pass.cpp new file mode 100644 index 000000000000..face0635dfb4 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/xor_value_valarray.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> valarray<T> operator^(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = { 1, 2, 3, 4, 5}; + T a2[] = { 2, 1, 0, 7, 6}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2 = 3 ^ v1; + assert(v1.size() == v2.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == a2[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/and_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/and_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..af2a1b3ed792 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/and_valarray_valarray.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator&&(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + T a2[] = {6, 7, 0, 9, 10}; + bool a3[] = {true, true, false, true, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = v1 && v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/and_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/and_valarray_value.pass.cpp new file mode 100644 index 000000000000..f34fe9642574 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/and_valarray_value.pass.cpp @@ -0,0 +1,45 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator&&(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, true, true, true, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 && 5; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {false, false, false, false, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 && 0; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/and_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/and_value_valarray.pass.cpp new file mode 100644 index 000000000000..c323d13ff42d --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/and_value_valarray.pass.cpp @@ -0,0 +1,45 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator&&(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, true, true, true, false}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 5 && v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {false, false, false, false, false}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 0 && v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/equal_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/equal_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..6222e91595dd --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/equal_valarray_valarray.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator==(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 0, 4, 10}; + T a2[] = {6, 7, 0, 9, 10}; + bool a3[] = {false, false, true, false, true}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = v1 == v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/equal_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/equal_valarray_value.pass.cpp new file mode 100644 index 000000000000..dca65055b2a0 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/equal_valarray_value.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator==(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {false, true, false, false, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 == 2; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/equal_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/equal_value_valarray.pass.cpp new file mode 100644 index 000000000000..532219e2e858 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/equal_value_valarray.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator==(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {false, true, false, false, false}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 2 == v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_equal_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_equal_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..75e62693baef --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_equal_valarray_valarray.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator>=(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 0, 4, 10}; + T a2[] = {6, 7, 0, 2, 1}; + bool a3[] = {false, false, true, true, true}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = v1 >= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_equal_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_equal_valarray_value.pass.cpp new file mode 100644 index 000000000000..020706dfa2ef --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_equal_valarray_value.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator>=(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {false, true, true, true, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 >= 2; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_equal_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_equal_value_valarray.pass.cpp new file mode 100644 index 000000000000..faf2003adb7f --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_equal_value_valarray.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator>=(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, true, false, false, true}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 2 >= v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..3276085f37dc --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_valarray_valarray.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator>(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 0, 4, 10}; + T a2[] = {6, 7, 0, 2, 1}; + bool a3[] = {false, false, false, true, true}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = v1 > v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_valarray_value.pass.cpp new file mode 100644 index 000000000000..1ab774cdfb48 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_valarray_value.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator>(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {false, false, true, true, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 > 2; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_value_valarray.pass.cpp new file mode 100644 index 000000000000..c5012d6fc0e5 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/greater_value_valarray.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator>(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, false, false, false, true}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 2 > v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_equal_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_equal_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..ceb6658833eb --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_equal_valarray_valarray.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator<=(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 0, 4, 10}; + T a2[] = {6, 7, 0, 2, 1}; + bool a3[] = {true, true, true, false, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = v1 <= v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_equal_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_equal_valarray_value.pass.cpp new file mode 100644 index 000000000000..4a391a3f3799 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_equal_valarray_value.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator<=(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, true, false, false, true}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 <= 2; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_equal_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_equal_value_valarray.pass.cpp new file mode 100644 index 000000000000..cf34e18b92c0 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_equal_value_valarray.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator<=(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {false, true, true, true, false}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 2 <= v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..0fa99488b791 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_valarray_valarray.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator<(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 0, 4, 10}; + T a2[] = {6, 7, 0, 2, 1}; + bool a3[] = {true, true, false, false, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = v1 < v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_valarray_value.pass.cpp new file mode 100644 index 000000000000..7a47c900a8f8 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_valarray_value.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator<(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, false, false, false, true}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 < 2; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_value_valarray.pass.cpp new file mode 100644 index 000000000000..4d6cbadcc8b5 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/less_value_valarray.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator<(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {false, false, true, true, false}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 2 < v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/not_equal_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/not_equal_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..c9675a9ce3e7 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/not_equal_valarray_valarray.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator!=(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 0, 4, 10}; + T a2[] = {6, 7, 0, 9, 10}; + bool a3[] = {true, true, false, true, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = v1 != v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/not_equal_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/not_equal_valarray_value.pass.cpp new file mode 100644 index 000000000000..9daa7289b715 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/not_equal_valarray_value.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator!=(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, false, true, true, true}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 != 2; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/not_equal_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/not_equal_value_valarray.pass.cpp new file mode 100644 index 000000000000..37439aabcb28 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/not_equal_value_valarray.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator!=(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, false, true, true, true}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 2 != v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/or_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/or_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..9a2f84e8f7da --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/or_valarray_valarray.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator||(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 0, 4, 0}; + T a2[] = {6, 7, 0, 9, 10}; + bool a3[] = {true, true, false, true, true}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = v1 || v2; + assert(v1.size() == v2.size()); + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/or_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/or_valarray_value.pass.cpp new file mode 100644 index 000000000000..789df5badf04 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/or_valarray_value.pass.cpp @@ -0,0 +1,45 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator||(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, true, true, true, true}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 || 5; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, true, true, true, false}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<bool> v3 = v1 || 0; + assert(v1.size() == v3.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/or_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/or_value_valarray.pass.cpp new file mode 100644 index 000000000000..d66905960274 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/or_value_valarray.pass.cpp @@ -0,0 +1,45 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<bool> +// operator||(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, true, true, true, true}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 5 || v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } + { + typedef int T; + T a2[] = {1, 2, 3, 4, 0}; + bool a3[] = {true, true, true, true, false}; + const unsigned N = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v2(a2, N); + std::valarray<bool> v3 = 0 || v2; + assert(v2.size() == v3.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.special/swap.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.special/swap.pass.cpp new file mode 100644 index 000000000000..84f73945c401 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.special/swap.pass.cpp @@ -0,0 +1,91 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// void +// swap(valarray<T>& x, valarray<T>& y); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + T a2[] = {6, 7, 8, 9, 10, 11, 12}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + const unsigned N2 = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v1(a1, N1); + std::valarray<T> v2(a2, N2); + std::valarray<T> v1_save = v1; + std::valarray<T> v2_save = v2; + swap(v1, v2); + assert(v1.size() == v2_save.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2_save[i]); + assert(v2.size() == v1_save.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v1_save[i]); + } + { + typedef int T; + T a1[] = {1, 2, 3, 4, 5}; + const unsigned N1 = sizeof(a1)/sizeof(a1[0]); + const unsigned N2 = 0; + std::valarray<T> v1(a1, N1); + std::valarray<T> v2; + std::valarray<T> v1_save = v1; + std::valarray<T> v2_save = v2; + swap(v1, v2); + assert(v1.size() == v2_save.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2_save[i]); + assert(v2.size() == v1_save.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v1_save[i]); + } + { + typedef int T; + T a2[] = {6, 7, 8, 9, 10, 11, 12}; + const unsigned N1 = 0; + const unsigned N2 = sizeof(a2)/sizeof(a2[0]); + std::valarray<T> v1; + std::valarray<T> v2(a2, N2); + std::valarray<T> v1_save = v1; + std::valarray<T> v2_save = v2; + swap(v1, v2); + assert(v1.size() == v2_save.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2_save[i]); + assert(v2.size() == v1_save.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v1_save[i]); + } + { + typedef int T; + const unsigned N1 = 0; + const unsigned N2 = 0; + std::valarray<T> v1; + std::valarray<T> v2; + std::valarray<T> v1_save = v1; + std::valarray<T> v2_save = v2; + swap(v1, v2); + assert(v1.size() == v2_save.size()); + for (int i = 0; i < v1.size(); ++i) + assert(v1[i] == v2_save[i]); + assert(v2.size() == v1_save.size()); + for (int i = 0; i < v2.size(); ++i) + assert(v2[i] == v1_save[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/abs_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/abs_valarray.pass.cpp new file mode 100644 index 000000000000..7d112a61140e --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/abs_valarray.pass.cpp @@ -0,0 +1,34 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// abs(const valarray<T>& x); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef double T; + T a1[] = {1.5, -2.5, 3.4, -4.5, -5.0}; + T a3[] = {1.5, 2.5, 3.4, 4.5, 5.0}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = abs(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(v3[i] == a3[i]); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/acos_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/acos_valarray.pass.cpp new file mode 100644 index 000000000000..ef2451d76457 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/acos_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// acos(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {2.6905658417935308e+00, + 2.0943951023931957e+00, + 1.5707963267948966e+00, + 1.0471975511965976e+00, + 7.2273424781341566e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = acos(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/asin_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/asin_valarray.pass.cpp new file mode 100644 index 000000000000..11c7c68d664a --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/asin_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// asin(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {-1.1197695149986342e+00, + -5.2359877559829882e-01, + 0.0000000000000000e+00, + 5.2359877559829882e-01, + 8.4806207898148100e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = asin(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan2_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan2_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..b860413805b8 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan2_valarray_valarray.pass.cpp @@ -0,0 +1,53 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// atan2(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a2[] = {-.8, .25, 0.375, -.5, .75}; + T a3[] = {-2.2974386674766221e+00, + -1.1071487177940904e+00, + 0.0000000000000000e+00, + 2.3561944901923448e+00, + 7.8539816339744828e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = atan2(v1, v2); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan2_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan2_valarray_value.pass.cpp new file mode 100644 index 000000000000..94ffebf79d8d --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan2_valarray_value.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// atan2(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {-8.7605805059819342e-01, + -5.8800260354756750e-01, + 0.0000000000000000e+00, + 5.8800260354756750e-01, + 7.8539816339744828e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = atan2(v1, .75); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan2_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan2_value_valarray.pass.cpp new file mode 100644 index 000000000000..360e70ee7cdd --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan2_value_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// atan2(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {2.4468543773930902e+00, + 2.1587989303424640e+00, + 1.5707963267948966e+00, + 9.8279372324732905e-01, + 7.8539816339744828e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = atan2(.75, v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan_valarray.pass.cpp new file mode 100644 index 000000000000..e66118b1d6de --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/atan_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// atan(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {-7.3281510178650666e-01, + -4.6364760900080615e-01, + 0.0000000000000000e+00, + 4.6364760900080615e-01, + 6.4350110879328437e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = atan(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/cos_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/cos_valarray.pass.cpp new file mode 100644 index 000000000000..baeb0d067008 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/cos_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// cos(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {6.2160996827066450e-01, + 8.7758256189037276e-01, + 1.0000000000000000e+00, + 8.7758256189037276e-01, + 7.3168886887382090e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = cos(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/cosh_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/cosh_valarray.pass.cpp new file mode 100644 index 000000000000..02a547a54404 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/cosh_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// cosh(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {1.4330863854487743e+00, + 1.1276259652063807e+00, + 1.0000000000000000e+00, + 1.1276259652063807e+00, + 1.2946832846768448e+00}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = cosh(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/exp_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/exp_valarray.pass.cpp new file mode 100644 index 000000000000..dce9c5546f78 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/exp_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// exp(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {4.0656965974059911e-01, + 6.0653065971263342e-01, + 1.0000000000000000e+00, + 1.6487212707001282e+00, + 2.1170000166126748e+00}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = exp(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/log10_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/log10_valarray.pass.cpp new file mode 100644 index 000000000000..2b9908198476 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/log10_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// log10(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {.5, .75, 1, 3, 7}; + T a3[] = {-3.0102999566398120e-01, + -1.2493873660829995e-01, + 0.0000000000000000e+00, + 4.7712125471966244e-01, + 8.4509804001425681e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = log10(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/log_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/log_valarray.pass.cpp new file mode 100644 index 000000000000..2c51cd6ed405 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/log_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// log(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {.5, .75, 1, 3, 7}; + T a3[] = {-6.9314718055994529e-01, + -2.8768207245178090e-01, + 0.0000000000000000e+00, + 1.0986122886681098e+00, + 1.9459101490553132e+00}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = log(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/pow_valarray_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/pow_valarray_valarray.pass.cpp new file mode 100644 index 000000000000..37ca74292aad --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/pow_valarray_valarray.pass.cpp @@ -0,0 +1,53 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// pow(const valarray<T>& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {.9, .5, 0., .5, .75}; + T a2[] = {-.8, .25, 0.375, -.5, .75}; + T a3[] = {1.0879426248455297e+00, + 8.4089641525371450e-01, + 0.0000000000000000e+00, + 1.4142135623730949e+00, + 8.0592744886765644e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v2(a2, N); + std::valarray<T> v3 = pow(v1, v2); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/pow_valarray_value.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/pow_valarray_value.pass.cpp new file mode 100644 index 000000000000..290ddc6f63da --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/pow_valarray_value.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// pow(const valarray<T>& x, const T& y); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {.9, .5, 0., .5, .75}; + T a3[] = {8.1000000000000005e-01, + 2.5000000000000000e-01, + 0.0000000000000000e+00, + 2.5000000000000000e-01, + 5.6250000000000000e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = pow(v1, 2.0); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/pow_value_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/pow_value_valarray.pass.cpp new file mode 100644 index 000000000000..f52990b4be7d --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/pow_value_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// pow(const T& x, const valarray<T>& y); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {.9, .5, 0., .5, .75}; + T a3[] = {1.8660659830736148e+00, + 1.4142135623730951e+00, + 1.0000000000000000e+00, + 1.4142135623730951e+00, + 1.6817928305074290e+00}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = pow(2.0, v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/sin_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/sin_valarray.pass.cpp new file mode 100644 index 000000000000..f05bd058fd72 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/sin_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// sin(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {-7.8332690962748330e-01, + -4.7942553860420301e-01, + 0.0000000000000000e+00, + 4.7942553860420301e-01, + 6.8163876002333423e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = sin(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/sinh_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/sinh_valarray.pass.cpp new file mode 100644 index 000000000000..73dca833bf24 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/sinh_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// sinh(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {-1.0265167257081753e+00, + -5.2109530549374738e-01, + 0.0000000000000000e+00, + 5.2109530549374738e-01, + 8.2231673193582999e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = sinh(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/sqrt_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/sqrt_valarray.pass.cpp new file mode 100644 index 000000000000..193dcd21fd1e --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/sqrt_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// sqrt(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {.5, .75, 1, 3, 7}; + T a3[] = {7.0710678118654757e-01, + 8.6602540378443860e-01, + 1.0000000000000000e+00, + 1.7320508075688772e+00, + 2.6457513110645907e+00}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = sqrt(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/tan_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/tan_valarray.pass.cpp new file mode 100644 index 000000000000..021dbc4d7754 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/tan_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// tan(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {-1.2601582175503390e+00, + -5.4630248984379048e-01, + 0.0000000000000000e+00, + 5.4630248984379048e-01, + 9.3159645994407259e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = tan(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/tanh_valarray.pass.cpp b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/tanh_valarray.pass.cpp new file mode 100644 index 000000000000..4cc58c321af1 --- /dev/null +++ b/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/tanh_valarray.pass.cpp @@ -0,0 +1,51 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template<class T> +// valarray<T> +// tanh(const valarray<T>& x); + +#include <valarray> +#include <cassert> +#include <sstream> + +bool is_about(double x, double y, int p) +{ + std::ostringstream o; + o.precision(p); + scientific(o); + o << x; + std::string a = o.str(); + o.str(""); + o << y; + return a == o.str(); +} + +int main() +{ + { + typedef double T; + T a1[] = {-.9, -.5, 0., .5, .75}; + T a3[] = {-7.1629787019902447e-01, + -4.6211715726000974e-01, + 0.0000000000000000e+00, + 4.6211715726000974e-01, + 6.3514895238728730e-01}; + const unsigned N = sizeof(a1)/sizeof(a1[0]); + std::valarray<T> v1(a1, N); + std::valarray<T> v3 = tanh(v1); + assert(v3.size() == v1.size()); + for (int i = 0; i < v3.size(); ++i) + assert(is_about(v3[i], a3[i], 10)); + } +} diff --git a/test/std/numerics/numarray/valarray.range/begin_const.pass.cpp b/test/std/numerics/numarray/valarray.range/begin_const.pass.cpp new file mode 100644 index 000000000000..873c4847e8d2 --- /dev/null +++ b/test/std/numerics/numarray/valarray.range/begin_const.pass.cpp @@ -0,0 +1,30 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template <class T> +// unspecified1 +// begin(const valarray<T>& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + const std::valarray<T> v(a, N); + assert(v[0] == 1); + } +} diff --git a/test/std/numerics/numarray/valarray.range/begin_non_const.pass.cpp b/test/std/numerics/numarray/valarray.range/begin_non_const.pass.cpp new file mode 100644 index 000000000000..0a39d009fd9b --- /dev/null +++ b/test/std/numerics/numarray/valarray.range/begin_non_const.pass.cpp @@ -0,0 +1,31 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template <class T> +// unspecified1 +// begin(valarray<T>& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + *begin(v) = 10; + assert(v[0] == 10); + } +} diff --git a/test/std/numerics/numarray/valarray.range/end_const.pass.cpp b/test/std/numerics/numarray/valarray.range/end_const.pass.cpp new file mode 100644 index 000000000000..7363508943bb --- /dev/null +++ b/test/std/numerics/numarray/valarray.range/end_const.pass.cpp @@ -0,0 +1,31 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template <class T> +// unspecified1 +// end(const valarray<T>& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + const std::valarray<T> v(a, N); + assert(v[v.size()-1] == 5); + assert(end(v) - begin(v) == v.size()); + } +} diff --git a/test/std/numerics/numarray/valarray.range/end_non_const.pass.cpp b/test/std/numerics/numarray/valarray.range/end_non_const.pass.cpp new file mode 100644 index 000000000000..f095f5cc35ee --- /dev/null +++ b/test/std/numerics/numarray/valarray.range/end_non_const.pass.cpp @@ -0,0 +1,32 @@ +//===----------------------------------------------------------------------===// +// +// 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 valarray; + +// template <class T> +// unspecified1 +// end(valarray<T>& v); + +#include <valarray> +#include <cassert> + +int main() +{ + { + typedef int T; + T a[] = {1, 2, 3, 4, 5}; + const unsigned N = sizeof(a)/sizeof(a[0]); + std::valarray<T> v(a, N); + *(end(v) - 1) = 10; + assert(v[v.size()-1] == 10); + assert(end(v) - begin(v) == v.size()); + } +} diff --git a/test/std/numerics/numarray/valarray.syn/nothing_to_do.pass.cpp b/test/std/numerics/numarray/valarray.syn/nothing_to_do.pass.cpp new file mode 100644 index 000000000000..b58f5c55b643 --- /dev/null +++ b/test/std/numerics/numarray/valarray.syn/nothing_to_do.pass.cpp @@ -0,0 +1,12 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +int main() +{ +} diff --git a/test/std/numerics/numarray/version.pass.cpp b/test/std/numerics/numarray/version.pass.cpp new file mode 100644 index 000000000000..85457d4329ec --- /dev/null +++ b/test/std/numerics/numarray/version.pass.cpp @@ -0,0 +1,20 @@ +//===----------------------------------------------------------------------===// +// +// 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> + +#include <valarray> + +#ifndef _LIBCPP_VERSION +#error _LIBCPP_VERSION not defined +#endif + +int main() +{ +} |