bool LeafIterator::hasNext(int32_t max)
{
int i = 20;
while (index < num_indices && ! region->contains(*ps, indices[index]) && i --> 0)
index++;
while (index < num_indices && ! region->contains(*ps, indices[index]) && ps->rank[index] < max)
index++;
return index < num_indices;
}
bool LeafIterator::ready()
{
if (index < num_indices)
return region->contains(*ps, indices[index]);
return false;
}
