Date: Wed, 14 Feb 2007 14:47:10 -0600 From: "Jeremy Messenger" <mezz7@cox.net> To: "David Gilbert" <dgilbert@dclg.ca> Cc: freebsd-hackers@freebsd.org Subject: Re: portupgrade O(n^m)? Message-ID: <op.tnraowth9aq2h7@mezz.mezzweb.com> In-Reply-To: <17875.18893.789217.224987@canoe.dclg.ca> References: <17875.18893.789217.224987@canoe.dclg.ca>
next in thread | previous in thread | raw e-mail | index | archive | help
On Wed, 14 Feb 2007 11:41:33 -0600, David Gilbert <dgilbert@dclg.ca> wrote: > I have 734 ports installed on my laptop right now. I'm pretty sure, > at times, I've had over 1000 ports on my laptop. > > On machine with moderate numbers of ports (most servers seem to have > 50 to 200 ports), portupgrade takes a moderate amount of time to start > work. On machines like my laptop, portupgrade seems to take much more > time to run. I assume it's solving the dependency graph before it > decides what to upgrade first, but is this truly a O(n^2) problem? It > seems like the implemented algorithm is O(n^2). Give ports-mgmt/portmaster a try. Cheers, Mezz > Dave. -- mezz7@cox.net - mezz@FreeBSD.org FreeBSD GNOME Team - FreeBSD Multimedia Hat (ports, not src) http://www.FreeBSD.org/gnome/ - gnome@FreeBSD.org http://wiki.freebsd.org/multimedia - multimedia@FreeBSD.org
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?op.tnraowth9aq2h7>