Experimentation shows me that large primes just don't last very long
with the old heuristic. Switch to another one that's more tolerant but
still weeds out no-hopers.
if (l->qq.p) {
dist = l->u.s.disp < 0 ? -l->u.s.disp : l->u.s.disp;
if (l->qq.p) {
dist = l->u.s.disp < 0 ? -l->u.s.disp : l->u.s.disp;
- if (dist && dist > l->u.s.steps/dist) {
+ if (dist && dist > l->u.s.steps/3) {
l->pops->pfree(&l->qq, l);
l->qq.p = 0;
}
l->pops->pfree(&l->qq, l);
l->qq.p = 0;
}