raxLowWalk , divide and conquer instead of linear scan

[anunique]

what about something like:
int bleh = h->size;
do{
bleh/=2;
if (v[j] < s[i])
{
j+=bleh;
}
else if (v[j] > s[i])
{
j-=bleh;
}
else
{
//got hit
}
}while (bleh>1);

divide and conquer scanning instead of linear?

        /* Even when h->size is large, linear scan provides good
         * performances compared to other approaches that are in theory
         * more sounding, like performing a binary search. */
        for (j = 0; j < h->size; j++) {
            if (v[j] == s[i]) break;
        }

[antirez]

I tried and it was slower, but actually later I found pathological cases where it could help. What to do IMHO is to test it a lot and find the right threshold when to switch to binary search.