1) Not strict and warnings clean.
2) perl -c on
if( $puzmap[$bestpos] 1 == 0 )
gives:
Possible precedence problem on bitwise operator at
sudoku_ip.pl line ...
but this seems to be a clash between undeclared variables.
The intended precedence seems to be
if( (
On 7/27/05, Ian Phillipps [EMAIL PROTECTED] wrote:
On Wed, 27 Jul 2005 at 10:15:25 -0400, Quantum Mechanic wrote:
1) Not strict and warnings clean.
2) perl -c on
if( $puzmap[$bestpos] 1 == 0 )
gives:
Possible precedence problem on bitwise operator at
sudoku_ip.pl line
--- Philippe 'BooK' Bruhat [EMAIL PROTECTED]
wrote:
symbolnicknameRole
--
= spaceship documented
operator
0+venus numification
}{eskimo greeting
--- José Castro [EMAIL PROTECTED] wrote:
* Quantum Mechanic ([EMAIL PROTECTED])
wrote:
$foo = ($bar) = (9,8,7);
RHS list
($bar) array
$bar - 7 (rest discarded)
No, no, no.
$bar - 9
Yes, that was a typo -- thanks.
It's the same as
$foo = ($bar, undef
I don't think you can do that without (??:code)
blocks.
Have you looked at Regexp::Common? There are examples
there (such as for palindromes) that might be useful.
--- Aaron J. Mackey [EMAIL PROTECTED] wrote:
On Mar 2, 2004, at 9:37 AM, Jeff Abrahamson wrote:
Do you allow overlapping
Jonathan E. Paton [mailto:[EMAIL PROTECTED]
wrote:
What about a meet-in-the-middle algorithm, with one
graph
created by running forwards, and one by running
backwards.
You would require to calculate ALL board positions
to a
given depth in each direction.
Yes, good thought. Unfortunately, the
[EMAIL PROTECTED] wrote:
Another list (discussing ICON) got me to:
http://www.bagley.org/~doug/shootout/
and checking on perl's results found it sort of in
the middle.
http://www.bagley.org/~doug/shootout/lang/perl/
This was one of the scripts:
Given the criteria for that test, there
