Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Re: Sort by Reputation in Super-Search?

by newrisedesigns (Curate)
on Feb 03, 2004 at 05:41 UTC ( #326121=note: print w/ replies, xml ) Need Help??


in reply to Re: Sort by Reputation in Super-Search?
in thread Sort by Reputation in Super-Search?

You could filter on section, provided you like LWP.

Grab the best nodes list, and use HTML::TokeParser to filter out the list of links. Then, grab each of those best nodes and do an if($_ =~ /Node Type\: obfuscation/ ) to see if it's an obfu. Of course, the code will return false findings if that pattern is in the body of the searched page (or if this node becomes a best node (unlikely)).

It's quick, horribly dirty, but it's a perlish, screen scraping solution to the problem. There's probably a million and one ways to do this (most accurate and quickest-to-write/run would be on the back end), but sometimes going about the long way can be worth it. Your perlish and other intellectual skills are often best honed on projects that are more "fun" than they are "work."

John J Reiser
newrisedesigns.com


Comment on Re: Re: Sort by Reputation in Super-Search?
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (5)
As of 2014-07-24 23:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (167 votes), past polls