in reply to
A mod2 Machine.

I only included this:using floats to compute modulo does not seem reasonable to me.

becausemy $n = 534587; print "even\n" if($n % 2 == 0); # modulo operator of possibly a flo +at or possibly an integer (*)

- it is equivalent to the OP's "Most obvious (easiest) solution" (infact code-ninja used this exact example here: Re^2: A mod2 Machine.)
- it might actually be doing a (possibly comparatively slow) float operation because
`use integer`was not used.

It probably had to go: float 534587 --> integer 534587 --> integer modulo operation on integer 534587

Whereas doing a proper integer bit test should be faster:

use integer; my $n = 534587; print "even\n" if($n & 1 == 0); # checking LSB with Bitwise And on +an integer

Comment on
Re: A mod2 Machine.
Select or Download Code | |
---|---|

Re^2: A mod2 Machine. by code-ninja (Scribe) on Jul 13, 2013 at 12:34 UTC |

In Section
Meditations