1// Explicit instantiation file.
2
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.
11
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.
16
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.
20
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/>.
25
26//
27// ISO C++ 14882:
28//
29
30#include <valarray>
31
32_GLIBCXX_BEGIN_NAMESPACE(std)
33
34  // Some explicit instantiations.
35  template void
36     __valarray_fill(size_t* __restrict__, size_t, const size_t&);
37
38  template void
39     __valarray_copy(const size_t* __restrict__, size_t, size_t* __restrict__);
40
41  template valarray<size_t>::valarray(size_t);
42  template valarray<size_t>::valarray(const valarray<size_t>&);
43  template valarray<size_t>::~valarray();
44  template size_t valarray<size_t>::size() const;
45  template size_t& valarray<size_t>::operator[](size_t);
46
47  inline size_t
48  __valarray_product(const valarray<size_t>& __a)
49  {
50    typedef const size_t* __restrict__ _Tp;
51    const size_t __n = __a.size();
52    // XXX: This ugly cast is necessary because
53    //      valarray::operator[]() const return a VALUE!
54    //      Try to get the committee to correct that gross error.
55    valarray<size_t>& __t = const_cast<valarray<size_t>&>(__a);
56    return __valarray_product(&__t[0], &__t[0] + __n);
57  }
58
59  // Map a gslice, described by its multidimensional LENGTHS
60  // and corresponding STRIDES, to a linear array of INDEXES
61  // for the purpose of indexing a flat, one-dimensional array
62  // representation of a gslice_array.
63  void
64  __gslice_to_index(size_t __o, const valarray<size_t>& __l,
65                    const valarray<size_t>& __s, valarray<size_t>& __i)
66  {
67    // There are as many dimensions as there are strides.
68    const size_t __n = __l.size();
69
70    // Holds current multi-index as we go through the gslice for the
71    // purpose of computing its linear-image.
72    valarray<size_t> __t(__l);
73
74    // Note that this should match the product of all numbers appearing
75    // in __l which describes the multidimensional sizes of the
76    // generalized slice.
77    const size_t __z = __i.size();
78
79    for (size_t __j = 0; __j < __z; ++__j)
80      {
81	// Compute the linear-index image of (t_0, ... t_{n-1}).
82	__i[__j] = __o;
83
84	--__t[__n - 1];
85	__o += __s[__n - 1];
86
87        // Process the next multi-index.  The loop ought to be
88        // backward since we're making a lexicographical visit.
89        for (size_t __k2 = __n - 1; __k2 && !__t[__k2]; --__k2)
90          {
91	    __o -= __s[__k2] * __l[__k2];
92	    __t[__k2] = __l[__k2];
93
94	    --__t[__k2 - 1];
95	    __o += __s[__k2 - 1];
96          }
97      }
98  }
99
100  gslice::_Indexer::_Indexer(size_t __o, const valarray<size_t>& __l,
101                             const valarray<size_t>& __s)
102  : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s),
103    _M_index(__l.size() == 0 ? 0 : __valarray_product(__l))
104  { __gslice_to_index(__o, __l, __s, _M_index); }
105
106_GLIBCXX_END_NAMESPACE
107