more useful options | |
PerlMonks |
Re^5: Need a faster way to find matchesby kikuchiyo (Hermit) |
on Jan 17, 2010 at 19:17 UTC ( [id://817887]=note: print w/replies, xml ) | Need Help?? |
I don't understand then. You stated the condition for a match as ($A & $B) == 1 where $A and $B are (64-bit, unsigned) integers. Let $As = $A >> 1 and $Bs = $B >> 1. Isn't then the original condition equivalent to ($As & $Bs) == 0 ? For a given $A (and $As), what other $B (and $Bs) does satisfy that condition than $Bs = ~$As?
In Section
Seekers of Perl Wisdom
|
|