Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Re: The N-queens problem using pure regexes

by dragonchild (Archbishop)
on Oct 09, 2003 at 13:10 UTC ( #297902=note: print w/ replies, xml ) Need Help??


in reply to Re: The N-queens problem using pure regexes
in thread The N-queens problem using pure regexes

The [\x00-\xFF]* just skips enough lines to get to the next queen.

Your explanation above is good. However, the above quote is the actual meat of my question ...

------
We are the carpenters and bricklayers of the Information Age.

The idea is a little like C++ templates, except not quite so brain-meltingly complicated. -- TheDamian, Exegesis 6

Please remember that I'm crufty and crochety. All opinions are purely mine and all code is untested, unless otherwise specified.


Comment on Re: Re: The N-queens problem using pure regexes
Download Code
Re: The N-queens problem using pure regexes
by Abigail-II (Bishop) on Oct 09, 2003 at 13:18 UTC
    Well, [\x00-\xFF]* matches anything, or any length. I can't use .* here because it should skip over newlines as well. And adding /s to the regex won't do it either, as other </code>.*</code>'s should *not* match newlines.

    Abigail

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (10)
As of 2014-07-30 21:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (241 votes), past polls