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