[gobolinux-users] exclude localrecipes from freshen and friends?

[Michael Homer]

On Thu, May 22, 2008 at 11:23 PM, kenneth marken <k-marken at online.no> wrote:
> On Thursday 22 May 2008 02:42:15 Michael Homer wrote:
>> On Thu, May 22, 2008 at 11:42 AM, kenneth marken <k-marken at online.no> wrote:
>> > On Thursday 22 May 2008 00:52:53 Michael Homer wrote:
>> >> On Thu, May 22, 2008 at 9:41 AM, kenneth marken <k-marken at online.no>
> wrote:
>> > well i tried to get it to show only packages by doing a grep on the [ P],
>> > but i could not find a regex that worked (unless i messed up how to tell
>> > grep that it should read the [ as just that, not some regex part).
>>
>> The colours will mess with that, as will grep - you have to escape any
>> regular expression metacharacters if you're piping Freshen
>> --no-colours through it.
>>
>
> --no-colour gave me this:
Maybe that was why it's undocumented... I will fix that, anyway.
>> For what you're doing, SVN Freshen/Scripts and the -p option will do
>> what you want. That also required some CheckDependencies fixes, so I
>> can't release it until there's a new Scripts out.
>>
>
> ok, looking forward to the release :) im guessing there is a -r (recipes) as
> well?
Yes. Also one for contrib, and if you specify more than one you can
manipulate the order of preference.
>> >> > if possible, how about a tree sort of the freshen output? but i guess
>> >> > it would make the current freshen even slower then it already is
>> >> > thanks to it trying to at least do some level of sorting, right?
>> >>
>> >> It is already sorted.
>> >
>> > yep, but i cant seem to figure out what the basis for the sorting is. as
>> > in, what source of data makes something be sorted towards the top or
>> > bottom, or how are the different packages and recipes related.
>>
>> It's (in effect) topologically sorted. Every program comes after all
>> of its dependencies, but positioning other than that is undefined.
>> There are many possible topological sorts for a given graph, so you
>> may get a drastically different order when you choose only part of it.
>> --unordered is in arbitrary order, with no dependencies listed.
> ok, so the further towards the top of the list it is, the more likely it is
> that its the dependencie of something further down? so in essence i should
> start at the bottom of the list, working upwards to get a sense of what i
> should think about updating?
I really don't see what your use case is here. They're all updates.
What are you trying to do?

For the sort order, see here:
http://en.wikipedia.org/wiki/Topological_sorting - ordering between
unrelated subgraphs is arbitrary, and this implementation doesn't
limit itself to starting at nodes with in-degree zero, so one tree can
end up split into pieces as well.
-Michael