Gentoo Archives: gentoo-dev

From: Nirbheek Chauhan <nirbheek@g.o>
To: Fabian Groffen <grobian@g.o>
Cc: gentoo-portage-dev@l.g.o, Gentoo Dev <gentoo-dev@l.g.o>
Subject: [gentoo-dev] Re: proj/portage:master commit in: pym/portage/dbapi/
Date: Sat, 26 Nov 2011 12:51:27
On Sat, Nov 26, 2011 at 5:08 PM, Fabian Groffen <grobian@g.o> wrote:
> On 26-11-2011 16:56:41 +0530, Nirbheek Chauhan wrote: >> [...] Besides, sorting even 30,000 >> entries (if you're merging every ebuild in portage) should not take >> more than a few secs. > > A linux kernel has around that much of files, and I really wonder if > it's worth waiting a couple of seconds (probably more on sparc and arm > systems) just because then the files are in sorted order. >
I'm not sure the two are really comparable. However, looking at a simple string sort on 30,000 strings, I don't see it taking a significant amount of time at all: import random import time t1 = time.time() a = range(100000, 130000) random.shuffle(a) b = [str(i) for i in a] t2 = time.time() b.sort() t3 = time.time() print(t2-t1) print(t3-t2) ---- 0.0682320594788 0.0464689731598
>> 1. I'm obviously assuming that dep nodes that do not depend on each >> other would be sorted > > I think this is per package. >
Actually, reading the code it seems that it's about the file merge order of a single package. My participation in this entire discussion is m00t. Never mind. :p -- ~Nirbheek Chauhan Gentoo GNOME+Mozilla Team


Subject Author
Re: [gentoo-dev] Re: proj/portage:master commit in: pym/portage/dbapi/ Ciaran McCreesh <ciaran.mccreesh@××××××××××.com>
Re: [gentoo-dev] Re: proj/portage:master commit in: pym/portage/dbapi/ Mike Frysinger <vapier@g.o>