Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Re: (Golf) Dependency List Prioritization

by AidanLee (Chaplain)
on Mar 15, 2002 at 14:16 UTC ( #151984=note: print w/replies, xml ) Need Help??

in reply to Re: (Golf) Dependency List Prioritization
in thread (Golf) Dependency List Prioritization

I think i'm getting the hang of this. Here's 90:

sub f{%h=@_;for(values %h){for(@$_){$h{$_}||=[]}} sort{(grep /^$b$/,@{$h{$a}})?1:-1}keys%h}

Replies are listed 'Best First'.
Re (tilly) 3: (Golf) Dependency List Prioritization
by tilly (Archbishop) on Mar 15, 2002 at 15:50 UTC
    Nice idea.

    A few minor nits though. First is that it is customary to only count the body of the sub, so you actually did slightly better than you thought! A second minor issue is that your grep is not quite right - the string "fooey\n" will match /^fooey$/ so you don't really have an equality test.

    Further than that, there are some mechanical tricks that can be used to improve scores. Such as using an inline for loop, using map to avoid double loops, and the like. Using those I can take your answer to 75 fairly easily:

    sub f{ #23456789_123456789_123456789_123456789_123456789_123456789_123456789_ +12345 %h=@_;$h{$_}||=[]for map@$_,values%h;sort{-1+2*grep$_ eq$b,@{$h{$a}}}k +eys%h }

    Oops. I didn't notice the lack of transitivity in your code. This is a fatal flaw as you see with the following data set.

    my @list = ( a => ['b'], b => ['c'], c => ['d'], d => ['e'], );
Re: Re: Re: (Golf) Dependency List Prioritization
by Sidhekin (Priest) on Mar 15, 2002 at 15:16 UTC

    Assuming the test harness provided, I doubt anyone can beat this:

    sub f{d,c,b,a,f,e}

    Try this for a test harness:

    my @list = ( a => [ 'b', 'c', 'e' ], b => [ 'd' ], c => [ 'b', 'd' ], f => [ 'a' ], ); print join (',', map { "'$_'" } f(@list)),"\n";

    Your code produces 'd','b','c','f','e','a', which does not reflect the fact that 'f' depends on 'a'.

    So, I am afraid your solution holds only for a limited set of test harnesses -- and is certainly not the shortest among such solutions.

    The Sidhekin
    print "Just another Perl ${\(trickster and hacker)},"

Re: Re: Re: (Golf) Dependency List Prioritization
by Juerd (Abbot) on Mar 15, 2002 at 15:00 UTC

    I hope you don't mind me removing a few bytes:

    sub f{for(values(%h=@_)){$h{$_}||=[]for@$_}sort{(grep/^$b$/,@{$h{$a}}) +||-1}keys%h}
    (Note: I didn't test)


      If you test, you will find it doesn't compile.

        If you test, you will find it doesn't compile.

        Perl doesn't DWIM :(
        It was worth a try, it was not worth a post. I should have tested first.


Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://151984]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (5)
As of 2022-05-16 09:29 GMT
Find Nodes?
    Voting Booth?
    Do you prefer to work remotely?

    Results (62 votes). Check out past polls.