Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Brute Force Algorithm with Perl reg exprs?

by idsfa (Vicar)
on Apr 25, 2006 at 02:41 UTC ( #545447=note: print w/ replies, xml ) Need Help??


in reply to Brute Force Algorithm with Perl reg exprs?

So, to restate your problem, you are looking to match between zero and length - hint_length arbitrary characters, the hint and between zero and length - hint_length arbitrary characters. The perlre sign for "between zero and infinity" is *, though you can be more specific (hint: look for the bit about curly braces in the doc link). Good luck -- old-hand at semester end cramming recommends starting earlier next time ;-).


The intelligent reader will judge for himself. Without examining the facts fully and fairly, there is no way of knowing whether vox populi is really vox dei, or merely vox asinorum. — Cyrus H. Gordon


Comment on Re: Brute Force Algorithm with Perl reg exprs?
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (7)
As of 2015-07-02 23:46 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (47 votes), past polls