void
sord_iter_free(SordIter* iter)
{
SORD_ITER_LOG("%p Free\n", (void*)iter);
if (iter) {
free(iter);
}
}
void
sord_iter_free(SordIter* iter)
{
SORD_ITER_LOG("%p Free\n", (void*)iter);
if (iter) {
--((SordModel*)iter->sord)->n_iters;
zix_btree_iter_free(iter->cur);
free(iter);
}
}
bool
sord_iter_next(SordIter* iter)
{
if (iter->end)
return true;
const SordNode** key;
iter->end = sord_iter_forward(iter);
if (!iter->end) {
switch (iter->mode) {
case ALL:
// At the end if the cursor is (assigned above)
break;
case SINGLE:
iter->end = true;
SORD_ITER_LOG("%p reached single end\n", (void*)iter);
break;
case RANGE:
SORD_ITER_LOG("%p range next\n", (void*)iter);
// At the end if the MSNs no longer match
key = (const SordNode**)zix_btree_get(iter->cur);
assert(key);
for (int i = 0; i < iter->n_prefix; ++i) {
const int idx = orderings[iter->order][i];
if (!sord_id_match(key[idx], iter->pat[idx])) {
iter->end = true;
SORD_ITER_LOG("%p reached non-match end\n", (void*)iter);
break;
}
}
break;
case FILTER_RANGE:
// Seek forward to next match, stopping if prefix changes
sord_iter_seek_match_range(iter);
break;
case FILTER_ALL:
// Seek forward to next match
sord_iter_seek_match(iter);
break;
}
} else {
SORD_ITER_LOG("%p reached index end\n", (void*)iter);
}
if (iter->end) {
SORD_ITER_LOG("%p Reached end\n", (void*)iter);
return true;
} else {
#ifdef SORD_DEBUG_ITER
SordQuad tup;
sord_iter_get(iter, tup);
SORD_ITER_LOG("%p Increment to " TUP_FMT "\n",
(void*)iter, TUP_FMT_ARGS(tup));
#endif
return false;
}
}
static SordIter*
sord_iter_new(const SordModel* sord, ZixBTreeIter* cur, const SordQuad pat,
SordOrder order, SearchMode mode, int n_prefix)
{
SordIter* iter = (SordIter*)malloc(sizeof(SordIter));
iter->sord = sord;
iter->cur = cur;
iter->order = order;
iter->mode = mode;
iter->n_prefix = n_prefix;
iter->end = false;
iter->skip_graphs = order < GSPO;
for (int i = 0; i < TUP_LEN; ++i) {
iter->pat[i] = pat[i];
}
switch (iter->mode) {
case ALL:
case SINGLE:
case RANGE:
assert(
sord_quad_match_inline((const SordNode**)zix_btree_get(iter->cur),
iter->pat));
break;
case FILTER_RANGE:
sord_iter_seek_match_range(iter);
break;
case FILTER_ALL:
sord_iter_seek_match(iter);
break;
}
#ifdef SORD_DEBUG_ITER
SordQuad value;
sord_iter_get(iter, value);
SORD_ITER_LOG("New %p pat=" TUP_FMT " cur=" TUP_FMT " end=%d skip=%d\n",
(void*)iter, TUP_FMT_ARGS(pat), TUP_FMT_ARGS(value),
iter->end, iter->skip_graphs);
#endif
++((SordModel*)sord)->n_iters;
return iter;
}
