in reply to Re: Better mousetrap (getting top N values from list X)
in thread Better mousetrap (getting top N values from list X)

I don't suppose you recall how they were going to determine how many values to produce?

Is that information --ie. the number of values required on the right-hand side of a list assignment--generally available to XS code, or was the intention to make a special case for the construct?

Examine what is said, not who speaks.
Silence betokens consent.
Love the truth but pardon error.
  • Comment on Re^2: Better mousetrap (getting top N values from list X)

Replies are listed 'Best First'.
Re^3: Better mousetrap (getting top N values from list X)
by demerphq (Chancellor) on Feb 03, 2005 at 09:25 UTC

    IIRC the idea was to apply much the same type of logic as occurs with split. Ie the logic that implicitly sets the third argument of the split to be N+1 where N is the number of scalar slots on the LHS of the assignment. I hazzily recall discussion on whether using an explicit slice would also do the same. I think if you trawl the p5p archives for sort and optimize youll find it. I think the basic idea was that 

    my ($x,$y,$z)=sort @foo;
my @top=(sort @foo)[1..$n];

    [download]

    would be special cased somehow.

    As for your question about XS, I really have no idea right now. Sorry.

    ---
    demerphq

[reply]
[d/l]

      Note that your first construct works for split but your second would give no hints to split.

      As to how this is done, I'd look at Want if I were curious.

      - tye        

[reply]
        I'd look at Want if I were curious

        Eek!

        Now I feel like Pandora!

        Examine what is said, not who speaks.
        Silence betokens consent.
        Love the truth but pardon error.
[reply]

In Section Seekers of Perl Wisdom