Sha256: 0e71215039d3d758c49eeaeb65a1cac5ea4c2bbe1bf8d2b43c43caf171996e29
Contents?: true
Size: 1.33 KB
Versions: 4
Compression:
Stored size: 1.33 KB
Contents
static void
<%=c_iter%>(na_loop_t *const lp)
{
ssize_t i, s1, s2;
size_t p1;
char *p2;
size_t *idx1, *idx2;
<%=dtype%> x;
BIT_DIGIT *a1;
BIT_DIGIT y;
INIT_COUNTER(lp, i);
INIT_PTR_BIT_IDX(lp, 0, a1, p1, s1, idx1);
INIT_PTR_IDX(lp, 1, p2, s2, idx2);
if (idx2) {
if (idx1) {
for (; i--;) {
GET_DATA_INDEX(p2,idx2,<%=dtype%>,x);
y = <%=macro%>(x);
STORE_BIT(a1, p1+*idx1, y); idx1++;
}
} else {
for (; i--;) {
GET_DATA_INDEX(p2,idx2,<%=dtype%>,x);
y = <%=macro%>(x);
STORE_BIT(a1, p1, y); p1+=s1;
}
}
} else {
if (idx1) {
for (; i--;) {
GET_DATA_STRIDE(p2,s2,<%=dtype%>,x);
y = <%=macro%>(x);
STORE_BIT(a1, p1+*idx1, y); idx1++;
}
} else {
for (; i--;) {
GET_DATA_STRIDE(p2,s2,<%=dtype%>,x);
y = <%=macro%>(x);
STORE_BIT(a1, p1, y); p1+=s1;
}
}
}
}
static VALUE
<%=c_func%>(VALUE self, VALUE obj)
{
ndfunc_arg_in_t ain[2] = {{OVERWRITE,0},{Qnil,0}};
ndfunc_t ndf = {<%=c_iter%>, FULL_LOOP, 2,0, ain,0};
na_ndloop(&ndf, 2, self, obj);
return self;
}
Version data entries
4 entries across 4 versions & 1 rubygems