portupgrade O(n^m)?
Jeremy Messenger
mezz7 at cox.net
Wed Feb 14 21:26:43 UTC 2007
On Wed, 14 Feb 2007 11:41:33 -0600, David Gilbert <dgilbert at 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 at cox.net - mezz at FreeBSD.org
FreeBSD GNOME Team - FreeBSD Multimedia Hat (ports, not src)
http://www.FreeBSD.org/gnome/ - gnome at FreeBSD.org
http://wiki.freebsd.org/multimedia - multimedia at FreeBSD.org
More information about the freebsd-hackers
mailing list