David O'Shea wrote:
...
What I'd suggest is you use a binary search tree (with the key
being the filename of course); the trick being that you just use up
all the RAM available to build the tree, and if you run out before you
finish reading the descript.ion file, you remember the file
Hi Jeremy,
There should not be a noticable delay if you do not use them (one
attempt to open per directory displayed), but may be for big
directories as the file is sequentially searched for each filename
displayed (as the file is unsorted and may or may not contain a
description Im not sure
