On Sat, Feb 6, 2010 at 7:56 AM, Petr JakeŇ° <petr.jakes@tpc.cz> wrote:
> I don't think that serves the purpose. The program is supposed to let the user
> scan whatever structure he/she wants, and this way i'm limiting that, and it
> is also not scalable.
> Thanks anyway

Than I do not understand your needs. Maybe some simple example or explanation???

Sorry for the double post, missed the list address on my previous message =(

The program is a file and directory indexer. Its aim is to provide a sort of catalog, so you can know what you saved where (for example, on a CD, DVD, external HD, etc). This catalog is a representation of the file & directory structure that was scanned.

I was originally using pickle for saving this catalog, but since I had performance problems on huge directories (lots of files), I moved to using sqlite (through sqlobject).

The program can currently handle one catalog at a time (which means that it doesn't keep references in memory to more than one DB). Trying to index a new directory simply dismisses the previous one that was indexed. What I'm aiming for is to be able to scan several directories separately (of course, I have to refactor a lot), and keep in memory several of these references (thus, handling an X quantity of DBs, being X a number that is up to the user and which I can't know).

As an example: currently when you scan a directory, there are two treeviews which are populated: the left one with the entire directory structure (only dirs), and the right one with the contents of the currently selected dir (much like windows explorer). If you scan another dir, the treeviews are wiped and all references to the previous scan are wiped too. My aim is to, instead of wiping all that, keep it and open a new tab (with another two treeviews), show the new catalog in that new tab, and be able to switch between tabs and vieweing both catalogs at the same time.T