Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!elroy.jpl.nasa.gov!ncar!gatech!rutgers!njin!limonce From: limonce@pilot.njin.net (Tom Limoncelli +1 201 408 5389) Newsgroups: comp.sys.amiga.graphics Subject: Re: Layers bug Message-ID: Date: 24 Jan 91 04:25:24 GMT References: <18901@shlump.nac.dec.com> <17628@cbmvax.commodore.com> <19236@shlump.nac.dec.com> <1991Jan22.204914.7652@msuinfo.cl.msu.edu> Organization: Drew University - Madison NJ Lines: 33 In article <1991Jan22.204914.7652@msuinfo.cl.msu.edu> jap@convex.cl.msu.edu (Joe Porkka) writes: >> [ Is layers faster in 2.0? ] > Um, still does get slower in 2.0. > > The dedicer may be better, but Layers handling of lots of windows > (10 or more) is still poor. Things get REAL slow if you > open 20 or more windows, then try to move one. Someone from C-A has stated that layers will be faster in the final (ROM) release of 2.0 but it isn't faster now. Thinking back, someone (non C-A) once explained why layers would still be slow after the de-dicing is improved. [Recollection mode ON] Layers is based on a paper presented at SIGGRAPH a couple years ago. I'm sure I could get the exact bibliographic reference if someone asked for it. Basically, the pseudo-code presented in the paper was almost directly translated into C (or BCPL?) to create layers.library. This included the sequential searches used all over the code. So, it seems that the layers could be stored in sorted order and faster searches could be implemented. [Recollection mode OFF] Could anyone from C-A tell me how good my memory is? Tom -- Headers, headers everywhere! Who needs a .sig?