Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

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.

Replies are listed 'Best First'.
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.


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://297902]
[erix]: it could be interesting to know whether that 57M customer data breach at ueber was before or after the database switch
[erix]: or perhaps it is unrelated

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (8)
As of 2017-11-22 14:03 GMT
Find Nodes?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:

    Results (324 votes). Check out past polls.