/* This gets the fore part of the product and saves it and
* also gets the back part
*/
static Bool get_both_parts(
const Set* a,
const Set* b,
SetIter* iter,
SetIter* iter_a,
SetIter* iter_b,
Tuple* tuple,
int offset,
int offset2)
{
int i;
if (!set_iter_next_intern(iter_a, a, tuple, offset))
return FALSE;
for(i = 0; i < a->head.dim; i++)
{
assert(iter->prod.elem[i] == NULL);
iter->prod.elem[i] = elem_copy(tuple_get_elem(tuple, i + offset));
assert(elem_is_valid(iter->prod.elem[i]));
}
if (!set_iter_next_intern(iter_b, b, tuple, offset2))
return FALSE;
return TRUE;
}
/* Initialise Iterator. Write into iter
*/
static SetIter* set_range_iter_init(
const Set* set,
const Tuple* pattern,
int offset)
{
const Elem* elem;
SetIter* iter;
assert(set_range_is_valid(set));
assert(pattern == NULL || tuple_is_valid(pattern));
assert(offset >= 0);
assert(pattern == NULL || offset < tuple_get_dim(pattern));
iter = calloc(1, sizeof(*iter));
assert(iter != NULL);
if (pattern == NULL)
{
iter->range.first = 0;
iter->range.last = val_to_idx(set->range.begin, set->range.step, set->range.end);
}
else
{
elem = tuple_get_elem(pattern, offset);
switch(elem_get_type(elem))
{
case ELEM_NAME :
iter->range.first = 0;
iter->range.last = val_to_idx(set->range.begin, set->range.step, set->range.end);
break;
case ELEM_NUMB :
iter->range.first = set_range_lookup_idx(set, pattern, offset);
if (iter->range.first >= 0)
iter->range.last = iter->range.first;
else
{
iter->range.first = 1;
iter->range.last = 0;
}
break;
case ELEM_STRG :
/* This should not happen. Probably a set with mixed
* numbers and string was generated.
*/
default :
abort();
}
}
iter->range.now = iter->range.first;
SID_set2(iter->range, SET_RANGE_ITER_SID);
assert(set_range_iter_is_valid(iter));
return iter;
}
static int set_range_lookup_idx(const Set* set, const Tuple* tuple, int offset)
{
const Elem* elem;
const Numb* numb;
int val;
assert(set_range_is_valid(set));
assert(tuple_is_valid(tuple));
assert(offset >= 0);
assert(offset < tuple_get_dim(tuple));
elem = tuple_get_elem(tuple, offset);
/* If this fails, this means we have a set with mixed number
* and integer types.
*/
assert(elem_get_type(elem) == ELEM_NUMB);
numb = elem_get_numb(elem);
assert(numb_is_int(numb));
val = numb_toint(numb);
if (set->range.step > 0)
{
if ( val < set->range.begin
|| val > set->range.end
|| ((val - set->range.begin) % set->range.step) != 0)
return -1;
}
else
{
assert(set->range.step < 0);
if ( val > set->range.begin
|| val < set->range.end
|| ((set->range.begin - val) % set->range.step) != 0)
return -1;
}
return val_to_idx(set->range.begin, set->range.step, val);
}
