Andre Poenitz wrote: > On Wed, Feb 19, 2003 at 09:43:09AM +0100, Alfredo Braunstein wrote: >> Right now it's implemented as a queue + a set, so it's O(ln n) for the >> 'first time insert' case, and O(n) for the 'already have it' case. >> I plan to make it O(ln n) always. > > Good idea, but we do pretty expensive things in othe places, so I don't > think this hurts.
I think it does now, because all graphics all added to the queue at startup time, so you get a short freeze while they are at it (specially with previews). Another option would be to make the adding part also threaded. That's it: on touch() to add it to some tmp queue (without checkin) and return inmediately, and then on loadNext() load this tmp queue into the good one before proceding. > >> I know that the coding style is broken, please correct me without mercy. >> [...] Please be nice. I known. It's called sado-masochim. Thanks for the corrections. > I have not checked for functionality, I cannot connect to cvs right now, > but it does not look bad. > > Andre' > Thanks, Alfredo
