Re: portupgrade O(n^m)?

2007-03-01 Thread Coleman Kane
On 2/28/07, Sean Bryant [EMAIL PROTECTED] wrote: [EMAIL PROTECTED] wrote: On Thu, 15 Feb 2007, Michel Talon wrote: Give me a few weeks, and if I can band together with a few people I wanted to try and port sections of portupgrade and its related tools to C++ (and maybe do some code tweaks

Re: portupgrade O(n^m)?

2007-02-28 Thread Sean Bryant
[EMAIL PROTECTED] wrote: On Thu, 15 Feb 2007, Michel Talon wrote: Give me a few weeks, and if I can band together with a few people I wanted to try and port sections of portupgrade and its related tools to C++ (and maybe do some code tweaks along the way). Most of the ruby files are over 400

Re: portupgrade O(n^m)?

2007-02-15 Thread Oliver Fromme
David Gilbert wrote: Jeremy Messenger wrote:: Give ports-mgmt/portmaster a try. I just did. One flaw it has is that I have two no longer supported ports installed. I want to run portmaster -a, but when it finds tund (and I assume it would also stop for xsysinfo), it stops. I put a

Re: portupgrade O(n^m)?

2007-02-15 Thread Ivan Voras
David Gilbert 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

Re: portupgrade O(n^m)?

2007-02-15 Thread Alexander Leidinger
Quoting Olivier Warin [EMAIL PROTECTED] (from Wed, 14 Feb 2007 19:54:09 +0100): This issue is not only related to portupgrade, pkg_add a new port takes far too long now... and make index each time I upgrade my ports is awfull too. Regarding make index: try make fetchindex right after the

Re: portupgrade O(n^m)?

2007-02-15 Thread Joerg Sonnenberger
On Thu, Feb 15, 2007 at 01:17:58AM +0100, Michel Talon wrote: The problem is the so called topological sorting of a DAG which is of order (n+m) where n is the number of nodes and m the number of arrows in the DAG. In my python program pkgupgrade, i perform this sorting for the whole set of

Re: portupgrade O(n^m)?

2007-02-15 Thread Coleman Kane
On 2/15/07, Alexander Leidinger [EMAIL PROTECTED] wrote: Quoting Olivier Warin [EMAIL PROTECTED] (from Wed, 14 Feb 2007 19:54:09 +0100): This issue is not only related to portupgrade, pkg_add a new port takes far too long now... and make index each time I upgrade my ports is awfull too.

Re: portupgrade O(n^m)? and pkgupgrade

2007-02-15 Thread Michel Talon
As a tentative solution to the problem in the subject, i have corrected still more bugs in my program pkguprade. The last version is at http://www.lpthe.jussieu.fr/~talon/pkgupgrade I had observed on my own machine two problems, one being that the topological sort was scrambled, this i have

Re: portupgrade O(n^m)? and pkgupgrade

2007-02-15 Thread Dominic Marks
On Thu, 15 Feb 2007 17:52:29 +0100 Michel Talon [EMAIL PROTECTED] wrote: As a tentative solution to the problem in the subject, i have corrected still more bugs in my program pkguprade. The last version is at http://www.lpthe.jussieu.fr/~talon/pkgupgrade I had observed on my own machine two

Re: portupgrade O(n^m)?

2007-02-15 Thread Niclas Zeising
On 2/15/07, Coleman Kane [EMAIL PROTECTED] wrote: On 2/15/07, Alexander Leidinger [EMAIL PROTECTED] wrote: Quoting Olivier Warin [EMAIL PROTECTED] (from Wed, 14 Feb 2007 19:54:09 +0100): This issue is not only related to portupgrade, pkg_add a new port takes far too long now... and make

Re: portupgrade O(n^m)?

2007-02-15 Thread youshi10
On Thu, 15 Feb 2007, Coleman Kane wrote: On 2/15/07, Alexander Leidinger [EMAIL PROTECTED] wrote: Quoting Olivier Warin [EMAIL PROTECTED] (from Wed, 14 Feb 2007 19:54:09 +0100): This issue is not only related to portupgrade, pkg_add a new port takes far too long now... and make index each

Re: portupgrade O(n^m)?

2007-02-15 Thread youshi10
On Thu, 15 Feb 2007, Michel Talon wrote: Give me a few weeks, and if I can band together with a few people I wanted to try and port sections of portupgrade and its related tools to C++ (and maybe do some code tweaks along the way). Most of the ruby files are over 400 lines long, sparsely

Re: portupgrade O(n^m)?

2007-02-15 Thread Florent Thoumie
[EMAIL PROTECTED] wrote: On Thu, 15 Feb 2007, Coleman Kane wrote: On 2/15/07, Alexander Leidinger [EMAIL PROTECTED] wrote: Quoting Olivier Warin [EMAIL PROTECTED] (from Wed, 14 Feb 2007 19:54:09 +0100): This issue is not only related to portupgrade, pkg_add a new port takes far too

Re: portupgrade O(n^m)?

2007-02-15 Thread Mike Meyer
On Thu, 15 Feb 2007, Michel Talon wrote: A lot of things that I think are half right. I think that porting portupgrade to C++ would be time spent in vain. In my opinion, some of the basic ideas of portupgrade are deeply flawed, and as much as one polishes the algorithms it will not gain much.

Re: portupgrade O(n^m)?

2007-02-15 Thread Coleman Kane
On Thu, Feb 15, 2007 at 05:33:59PM +0100, Niclas Zeising wrote, and it was proclaimed: On 2/15/07, Coleman Kane [EMAIL PROTECTED] wrote: On 2/15/07, Alexander Leidinger [EMAIL PROTECTED] wrote: Quoting Olivier Warin [EMAIL PROTECTED] (from Wed, 14 Feb 2007 19:54:09 +0100): This issue

Re: portupgrade O(n^m)?

2007-02-15 Thread youshi10
On Thu, 15 Feb 2007, Florent Thoumie wrote: [EMAIL PROTECTED] wrote: On Thu, 15 Feb 2007, Coleman Kane wrote: On 2/15/07, Alexander Leidinger [EMAIL PROTECTED] wrote: Quoting Olivier Warin [EMAIL PROTECTED] (from Wed, 14 Feb 2007 19:54:09 +0100): This issue is not only related to

Re: portupgrade O(n^m)?

2007-02-15 Thread Jeremy Messenger
On Thu, 15 Feb 2007 12:17:00 -0600, [EMAIL PROTECTED] wrote: snip = Pros: = -It's written in python (portable). Isn't our more portable for hardware than Python? Also, it is smaller? -It's a system which focuses on ports compilation from source, not binary package installation.

Re: portupgrade O(n^m)?

2007-02-15 Thread Doug Barton
Michel Talon wrote: Joerg Sonnenberger wrote: Well, the complexity is somewhere in the area of O(nm) with m being small. I strongly suggest some basic bucket hashing if it is not done already. For the pkgsrc bulk build (which has similiar problems) it reduced the time to around 3 minutes to

portmaster and local ports (Was: Re: portupgrade O(n^m)?)

2007-02-15 Thread Doug Barton
David Gilbert wrote: Jeremy == Jeremy Messenger [EMAIL PROTECTED] writes: Jeremy Give ports-mgmt/portmaster a try. I just did. One flaw it has is that I have two no longer supported ports installed. What do you mean by no longer supported? I want to run portmaster -a, but when it

Re: portmaster and local ports (Was: Re: portupgrade O(n^m)?)

2007-02-15 Thread Jeremy Messenger
On Thu, 15 Feb 2007 15:54:29 -0600, Doug Barton [EMAIL PROTECTED] wrote: David Gilbert wrote: Jeremy == Jeremy Messenger [EMAIL PROTECTED] writes: Jeremy Give ports-mgmt/portmaster a try. I just did. One flaw it has is that I have two no longer supported ports installed. What do you mean

portupgrade O(n^m)?

2007-02-14 Thread David Gilbert
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,

Re: portupgrade O(n^m)?

2007-02-14 Thread John Nielsen
On Wednesday 14 February 2007 12:41, David Gilbert 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

Re: portupgrade O(n^m)?

2007-02-14 Thread Joerg Sonnenberger
On Wed, Feb 14, 2007 at 12:41:33PM -0500, David Gilbert wrote: 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

Re: portupgrade O(n^m)?

2007-02-14 Thread Coleman Kane
On 2/14/07, John Nielsen [EMAIL PROTECTED] wrote: On Wednesday 14 February 2007 12:41, David Gilbert 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

Re: portupgrade O(n^m)?

2007-02-14 Thread Olivier Warin
[EMAIL PROTECTED]:~ % pkg_info | wc -l -[19:49]- 917 Really portupgrade becomes clearly not so usable for me after I switch to Xorg 7.2RC which install 300 more packages, my workstation is a xSeries 226 with a Xeon 2,8Ghz 1Go DDR2. So I can imagine

Re: portupgrade O(n^m)?

2007-02-14 Thread Jeremy Messenger
On Wed, 14 Feb 2007 11:41:33 -0600, David Gilbert [EMAIL PROTECTED] 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

Re: portupgrade O(n^m)?

2007-02-14 Thread David Gilbert
Jeremy == Jeremy Messenger [EMAIL PROTECTED] writes: Jeremy Give ports-mgmt/portmaster a try. I just did. One flaw it has is that I have two no longer supported ports installed. I want to run portmaster -a, but when it finds tund (and I assume it would also stop for xsysinfo), it stops. I

Re: portupgrade O(n^m)?

2007-02-14 Thread Michel Talon
Joerg Sonnenberger wrote: Well, the complexity is somewhere in the area of O(nm) with m being small. I strongly suggest some basic bucket hashing if it is not done already. For the pkgsrc bulk build (which has similiar problems) it reduced the time to around 3 minutes to resolve all

Re: portupgrade O(n^m)?

2007-02-14 Thread Garrett Cooper
Michel Talon wrote: Joerg Sonnenberger wrote: Well, the complexity is somewhere in the area of O(nm) with m being small. I strongly suggest some basic bucket hashing if it is not done already. For the pkgsrc bulk build (which has similiar problems) it reduced the time to around 3 minutes to