mirror of
git://gcc.gnu.org/git/gcc.git
synced 2025-01-30 08:59:41 +08:00
482c0c5d0f
2004-06-22 Paolo Carlini <pcarlini@suse.de> * testsuite/26_numerics/complex_inserters_extractors.cc, complex_value.cc, buggy_complex.cc: Move to... * testsuite/26_numerics/complex/: ... here. * testsuite/26_numerics/c99_classification_macros_c++.cc, c99_classification_macros_c.cc, c_math.cc, c_math_dynamic.cc, fabs_inline.cc: Move to... * testsuite/26_numerics/cmath/: ... here. * testsuite/26_numerics/binary_closure.cc, slice.cc, slice_array_assignment.cc, valarray.cc, valarray_const_bracket.cc, valarray_name_lookup.cc, valarray_operators.cc, valarray_subset_assignment.cc: Move to... * testsuite/26_numerics/valarray/: ... here (new dir). * testsuite/26_numerics/sum_diff.cc: Move to... * testsuite/26_numerics/numeric/: ... here (new dir). From-SVN: r83489
65 lines
1.8 KiB
C++
65 lines
1.8 KiB
C++
// 20020717 gdr
|
|
|
|
// Copyright (C) 2002, 2003 Free Software Foundation, Inc.
|
|
//
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
|
// software; you can redistribute it and/or modify it under the
|
|
// terms of the GNU General Public License as published by the
|
|
// Free Software Foundation; either version 2, or (at your option)
|
|
// any later version.
|
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License along
|
|
// with this library; see the file COPYING. If not, write to the Free
|
|
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
|
|
// USA.
|
|
|
|
// Test slice class invariants
|
|
|
|
#include <valarray>
|
|
#include <cstdlib>
|
|
#include <testsuite_hooks.h>
|
|
|
|
bool
|
|
construction(std::size_t start, std::size_t size, std::size_t stride)
|
|
{
|
|
std::slice s(start, size, stride);
|
|
return s.start() == start && s.size() == size && s.stride() == stride;
|
|
}
|
|
|
|
bool
|
|
copy(std::size_t start, std::size_t size, std::size_t stride)
|
|
{
|
|
std::slice s(start, size, stride);
|
|
std::slice t = s;
|
|
return t.start() == start && t.size() == size && t.stride() == stride;
|
|
}
|
|
|
|
bool
|
|
assignment(std::size_t start, std::size_t size, std::size_t stride)
|
|
{
|
|
std::slice s(start, size, stride);
|
|
std::slice t;
|
|
t = s;
|
|
return t.start() == start && t.size() == size && t.stride() == stride;
|
|
}
|
|
|
|
|
|
int main()
|
|
{
|
|
bool test __attribute__((unused)) = true;
|
|
std::srand(20020717);
|
|
using std::rand;
|
|
VERIFY(construction(rand(), rand(), rand()));
|
|
|
|
VERIFY(copy(rand(), rand(), rand()));
|
|
|
|
VERIFY(assignment(rand(), rand(), rand()));
|
|
|
|
return 0;
|
|
}
|