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__);
12 template valarray<size_t>::valarray(size_t);
13 template valarray<size_t>::valarray(const valarray<size_t>&);
14 template valarray<size_t>::~valarray();
15 template size_t valarray<size_t>::size() const;
16 template size_t& valarray<size_t>::operator[](size_t);
20 __valarray_product(const valarray<size_t>& __a)
22 typedef const size_t* __restrict__ _Tp;
23 const size_t __n = __a.size();
24 // XXX: This ugly cast is necessary because
25 // valarray::operator[]() const return a VALUE!
26 // Try to get the committee to correct that gross error.
27 valarray<size_t>& __t = const_cast<valarray<size_t>&>(__a);
28 return __valarray_product(&__t[0], &__t[0] + __n);
31 void __gslice_to_index(size_t __o, const valarray<size_t>& __l,
32 const valarray<size_t>& __s,
33 valarray<size_t>& __i)
35 size_t __n = __l.size();
36 size_t* const __t = static_cast<size_t*>
37 (__builtin_alloca(__n*sizeof(size_t)));
38 __valarray_fill(__t, __n, size_t(0));
39 const size_t __z = __i.size();
40 __valarray_fill(&__i[0], __z, __o);
41 for (size_t __j=0; __j<__z; ++__j) {
42 for (size_t __k=0; __k<__n; ++__k)
43 __i[__j] += __s[__k]*__t[__k];
45 for (size_t __k=__n-1; __k; --__k) {
46 if (__t[__k] >= __l[__k]) {
54 gslice::_Indexer::_Indexer(size_t __o, const valarray<size_t>& __s,
55 const valarray<size_t>& __l)
56 : _M_count(1), _M_start(__o), _M_size(__s), _M_stride(__l),
57 _M_index(__l.size() ? __valarray_product(__l) : 0)
58 { __gslice_to_index(__o, __l, __s, _M_index); }