From: Petr Baudis <pasky@suse.cz>
Date: Mon, 11 Jul 2005 23:31:50 GMT
Subject: Re: arch 2.0 first source available (git related)
Message-ID: <20050711233150.GB5981@pasky.ji.cz>
In-Reply-To: <1121117816.16511.5.camel@dev1.seyza.com>

Dear diary, on Mon, Jul 11, 2005 at 11:36:56PM CEST, I got a letter
where Thomas Lord <lord@emf.net> told me that...
> On Mon, 2005-07-11 at 21:39 +0200, Petr Baudis wrote:
> > Dear diary, on Sat, Jul 09, 2005 at 04:20:13PM CEST, I got a letter
> > where Thomas Lord <lord@emf.net> told me that...
> > > The prereq graph is, indeed, an improvement.  
> > ..snip..
> 
> > But object retrieval can be potentially as much as linear to the depth
> > of the prereq graph, right? 
> 
> Potentially but not, by far, in the common case.
> 
> Moreover, that depth is an arbitrary parameter which user's can
> freely vary -- that's part of the point.

But if the depth will be less than that, won't the user end up with some
(plenty) of the objects duplicated?

-- 
				Petr "Pasky" Baudis
Stuff: http://pasky.or.cz/
<Espy> be careful, some twit might quote you out of context..