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

RE: PerlMonks Newest 10 Nodes Grabber

by kryten (Scribe)
on May 04, 2000 at 22:04 UTC ( #10248=note: print w/ replies, xml ) Need Help??

in reply to PerlMonks Newest 10 Nodes Grabber

Nice Snippet, I really should get into LWP::Simple. One thing I noticed though.

(reverse sort {$a <=> $b }keys %node)[0..9]
Can be achived without the explicit reverse just by changing the order of $a and $b in the sort subroutine.
(sort {$b <=> $a }keys %node)[0..9]
Sorry to be pedantic, it was bugging me :)

Comment on RE: PerlMonks Newest 10 Nodes Grabber
Select or Download Code
Replies are listed 'Best First'.
RE: RE: PerlMonks Newest 10 Nodes Grabber
by httptech (Chaplain) on May 05, 2000 at 00:10 UTC
    Yeah, but we can throw most of that snippet out the window now, as Vroom has told me about

    So here is the rewritten snippet. (Note that it now retrieves 12 headlines instead of 10. Or how many ever Vroom decides to put into headlines.rdf)

    use LWP::Simple; $/ = undef; my $slurp = get(""); push @node, [$1,$2] while $slurp =~ /<item>\s*<title\s*>([^<]*)<\/title>\s*<link\s*>([^< +]*)/gio; print map { "<a href=\"$_->[1]\">$_->[0]</a>\n" } @node;

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (8)
As of 2015-10-07 12:56 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (184 votes), past polls