mirror of
https://github.com/llvm-mirror/libcxx.git
synced 2025-10-23 18:38:30 +08:00
a9bcd3dae8
Change loop indices from int to std::size_t. Also, include <cstddef> when it wasn't already being included. git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@287820 91177308-0d34-0410-b5e6-96231b3b80d8
91 lines
2.8 KiB
C++
91 lines
2.8 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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>
|
|
#include <cstddef>
|
|
|
|
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 (std::size_t i = 0; i < v1.size(); ++i)
|
|
assert(v1[i] == v2_save[i]);
|
|
assert(v2.size() == v1_save.size());
|
|
for (std::size_t 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 (std::size_t i = 0; i < v1.size(); ++i)
|
|
assert(v1[i] == v2_save[i]);
|
|
assert(v2.size() == v1_save.size());
|
|
for (std::size_t 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 (std::size_t i = 0; i < v1.size(); ++i)
|
|
assert(v1[i] == v2_save[i]);
|
|
assert(v2.size() == v1_save.size());
|
|
for (std::size_t 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 (std::size_t i = 0; i < v1.size(); ++i)
|
|
assert(v1[i] == v2_save[i]);
|
|
assert(v2.size() == v1_save.size());
|
|
for (std::size_t i = 0; i < v2.size(); ++i)
|
|
assert(v2[i] == v1_save[i]);
|
|
}
|
|
}
|