> -----Original Message-----
> From: efesar [mailto:efesar@nmia.com]
> Sent: 01 April 2003 00:05
> To: Dave Page; pgadmin-hackers@postgresql.org
> Subject: RE: [pgadmin-hackers] pgadmin3 query tools
>
>
>
> > > 1. I just got time to try this build. There is a new bug
> where if it
> > > can't connect to the server it goes into an infinite loop
> (ok, ok,
> > > ok, ok, etc. -- for instance, if the server is not running).
> > > Starting the server does not help, you have to kill the PGA3
> > > process. Then restart PGA3.
> >
> > Yes, I noticed that as well.
>
> Submitting patch for that.
Thanks, committed.
> > I've been thinking about that, and the majority of places
> we use such
> > info, we only need to oid & identifier. I wonder if it
> would be easier
> > to build some fast, dedicated caches for that instead. We
> do acctually
> > have some of these internally in pgSchema (pga2), but in this code
> > they could be globally accessible within a pgDatabase.
>
> There are pros/cons. The tree is slower than a dedicated
> cache, but the dedicated cache would have to be refreshed in
> the same refreshes as the tree. And it would basically end up
> being a linked list, so we might end up doing double duty.
Yeah, but at least we needn't rely on the user to have accessed that
part of the tree to get the cache. I reckon it will be quicker - even if
only in the users' perception.
I'm not sure we even need to go as far as a linked list do we? Won't a 2
dimensional array do it? We will know the size when it's create after
all. Anyway, even if we do it's not particularly difficult - I would be
tempted to knock up generic cache/cache object classes.
Regards, Dave.
