On Mon, 2005-03-28 at 16:08 +0200, Steven Bosscher wrote: > On Mar 28, 2005 03:08 AM, Kazu Hirata <[EMAIL PROTECTED]> wrote: > > Huh, whey I talked to them on IRC they didn't seem to have implemented > > this. I'll try to get this issue one of these days. > > Ehm. I did in fact implement this. The trouble was that inserting > blocks into the worklist got more expensive, so there was no overall > win. You need a smart data structure to allow quick inserts and > quick traverses.
You'd have to use a priority queue. Or you could just maintain the relative ordering you get from starting in some order. Dunno which ends up being better. Probably varies from program to program. > My implementation wasn't very smart, I mostly did > it to see if it would cause things to fall through the lattice more > quickly (and it did).
