2012-01-13 Paul Thomas <pault@gcc.gnu.org>
[official-gcc.git] / libstdc++-v3 / src / valarray.cc
blob5de146bc156141dd67fb6f5ec3451582b70a57bd
1 // Explicit instantiation file.
3 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2009
4 // Free Software Foundation, Inc.
5 //
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 3, or (at your option)
10 // any later version.
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // Under Section 7 of GPL version 3, you are granted additional
18 // permissions described in the GCC Runtime Library Exception, version
19 // 3.1, as published by the Free Software Foundation.
21 // You should have received a copy of the GNU General Public License and
22 // a copy of the GCC Runtime Library Exception along with this program;
23 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 // <http://www.gnu.org/licenses/>.
27 // ISO C++ 14882:
30 #include <valarray>
32 namespace std _GLIBCXX_VISIBILITY(default)
34 _GLIBCXX_BEGIN_NAMESPACE_VERSION
36 // Some explicit instantiations.
37 template void
38 __valarray_fill(size_t* __restrict__, size_t, const size_t&);
40 template void
41 __valarray_copy(const size_t* __restrict__, size_t, size_t* __restrict__);
43 template valarray<size_t>::valarray(size_t);
44 template valarray<size_t>::valarray(const valarray<size_t>&);
45 template valarray<size_t>::~valarray();
46 template size_t valarray<size_t>::size() const;
47 template size_t& valarray<size_t>::operator[](size_t);
49 inline size_t
50 __valarray_product(const valarray<size_t>& __a)
52 const size_t __n = __a.size();
53 // XXX: This ugly cast is necessary because
54 // valarray::operator[]() const return a VALUE!
55 // Try to get the committee to correct that gross error.
56 valarray<size_t>& __t = const_cast<valarray<size_t>&>(__a);
57 return __valarray_product(&__t[0], &__t[0] + __n);
60 // Map a gslice, described by its multidimensional LENGTHS
61 // and corresponding STRIDES, to a linear array of INDEXES
62 // for the purpose of indexing a flat, one-dimensional array
63 // representation of a gslice_array.
64 void
65 __gslice_to_index(size_t __o, const valarray<size_t>& __l,
66 const valarray<size_t>& __s, valarray<size_t>& __i)
68 // There are as many dimensions as there are strides.
69 const size_t __n = __l.size();
71 // Holds current multi-index as we go through the gslice for the
72 // purpose of computing its linear-image.
73 valarray<size_t> __t(__l);
75 // Note that this should match the product of all numbers appearing
76 // in __l which describes the multidimensional sizes of the
77 // generalized slice.
78 const size_t __z = __i.size();
80 for (size_t __j = 0; __j < __z; ++__j)
82 // Compute the linear-index image of (t_0, ... t_{n-1}).
83 __i[__j] = __o;
85 --__t[__n - 1];
86 __o += __s[__n - 1];
88 // Process the next multi-index. The loop ought to be
89 // backward since we're making a lexicographical visit.
90 for (size_t __k2 = __n - 1; __k2 && !__t[__k2]; --__k2)
92 __o -= __s[__k2] * __l[__k2];
93 __t[__k2] = __l[__k2];
95 --__t[__k2 - 1];
96 __o += __s[__k2 - 1];
101 gslice::_Indexer::_Indexer(size_t __o, const valarray<size_t>& __l,
102 const valarray<size_t>& __s)
103 : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s),
104 _M_index(__l.size() == 0 ? 0 : __valarray_product(__l))
105 { __gslice_to_index(__o, __l, __s, _M_index); }
107 _GLIBCXX_END_NAMESPACE_VERSION
108 } // namespace