On 02/22/11 08:00, Steven wrote: Hi!
[...] > Hmmm . I suppose you mean sorting the DB but not writing it to disk. > Are you sure this is feasible ? I'm not overly familiar with > DB structure and searches, but it sounds dangerous to me > considering Scid's complexity. And at least part of Scid's > stability comes from it's immediate write-to-disk policy imho. Resorting the DB just to get the games list sorted is actually not a good idea. Two point immediately come to my mind: - it breaks bookmarks. (As far as I can see they rely on the game number + the path to the database. Not perfect as they are broken once you move the base as well, but they are a very handy feature and at least I don't move around bases to often.) - you loose the tree cache. Given the fact that it takes about an hour to calculate and write the tree cache for my ref base it would be very ugly if it gets lost by some clicking at the wrong place. (Yes, I add some more lines to the cache than the Scid default, I index "my openings" a bit deeper and with more variations.) cu Alexander ------------------------------------------------------------------------------ Free Software Download: Index, Search & Analyze Logs and other IT data in Real-Time with Splunk. Collect, index and harness all the fast moving IT data generated by your applications, servers and devices whether physical, virtual or in the cloud. Deliver compliance at lower cost and gain new business insights. http://p.sf.net/sfu/splunk-dev2dev _______________________________________________ Scid-users mailing list Scid-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/scid-users
