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

Re: @arrys & Non exact searches.

by tadman (Prior)
on Mar 20, 2001 at 21:27 UTC ( #65755=note: print w/replies, xml ) Need Help??


in reply to @arrys & Non exact searches.

Implementing Google or AltaVista in Perl for this kind of application is likely overkill, so here's a simple solution.
my (@names) = ( ... ); sub search { my (@search_keywords) = split (/\s+/, shift); my ($match_code) = "sub{".join('&&', map { "/\Q$_\E/" } @searc +h_keywords)."}"; my ($match_func) = eval $match_code; return grep { &$match_func() } (@names); } my (@results) = search ("the fried potato king");
This will return all records that match all terms. For a version that matches any, switch the '&&' in the join() to be '||' instead.

Essentially, this 'search' function generates a subroutine that tells grep() if the array entry matches or not. You can have a look at the value of $match_code to see what it is doing.

The \Q and \E are used to escape the metacharacters which would interfere with the // regexp. Saves you from having to tr/// them yourself.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (2)
As of 2022-05-25 01:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you prefer to work remotely?



    Results (84 votes). Check out past polls.

    Notices?