1 #include <bits/std_valarray.h>
5 // Some explicit instanciations.
7 __valarray_fill(size_t* __restrict__, size_t, const size_t&);
10 __valarray_copy(const size_t* __restrict__, size_t, size_t* __restrict__);
13 __valarray_product(const size_t* __restrict__, const size_t* __restrict__);
15 template valarray<size_t>::valarray(size_t);
16 template valarray<size_t>::valarray(const valarray<size_t>&);
17 template valarray<size_t>::~valarray();
18 template size_t valarray<size_t>::size() const;
19 template size_t& valarray<size_t>::operator[](size_t);
23 __valarray_product(const valarray<size_t>& __a)
25 // XXX: This ugly cast is necessary because
26 // valarray::operator[]() const return a VALUE!
27 // Try to get the committee to correct that gross error.
28 typedef const size_t* __restrict__ _Tp;
29 size_t __n = __a.size() - 1;
30 valarray<size_t>& __t = const_cast<valarray<size_t>&>(__a);
31 return __valarray_product(static_cast<_Tp>(&__t[0]),
32 static_cast<_Tp>(&__t[__n]));
35 void __gslice_to_index(size_t __o, const valarray<size_t>& __l,
36 const valarray<size_t>& __s,
37 valarray<size_t>& __i)
39 size_t __n = __l.size();
40 size_t* const __t = static_cast<size_t*>
41 (__builtin_alloca(__n*sizeof(size_t)));
42 __valarray_fill(__t, __n, size_t(0));
43 const size_t __z = __i.size();
44 __valarray_fill(&__i[0], __z, __o);
45 for (size_t __j=0; __j<__z; ++__j) {
46 for (size_t __k=0; __k<__n; ++__k)
47 __i[__j] += __s[__k]*__t[__k];
49 for (size_t __k=__n-1; __k; --__k) {
50 if (__t[__k] >= __l[__k]) {
58 gslice::_Indexer::_Indexer(size_t __o, const valarray<size_t>& __s,
59 const valarray<size_t>& __l)
60 : _M_count(1), _M_start(__o), _M_size(__s), _M_stride(__l),
61 _M_index(__l.size() ? __valarray_product(__l) : 0)
62 { __gslice_to_index(__o, __l, __s, _M_index); }