Re^2: Need a faster way to find matches


Keep It Simple, Stupid
	PerlMonks

Re^2: Need a faster way to find matches

by BrowserUk (Patriarch)

on Jan 17, 2010 at 10:30 UTC ( #817854=note: print w/replies, xml )

Need Help??

in reply to Re: Need a faster way to find matches
in thread Need a faster way to find matches

only least significant bit overlaps

Is quite different to just odd or even:

$x = 0b1111_1110_1101_1100_1011_1010_1001_1000_0111_0110_0101_0100_001
+1_0011;;
$y = 0b0000_0001_0010_0011_0100_0101_0110_0111_1000_1001_1010_1011_110
+0_1101;;

printf "%064b\n", $x & $y;;
0000000000000000000000000000000000000000000000000000000000000001
[download]

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

"I'd rather go naked than blow up my ass"

Comment on Re^2: Need a faster way to find matches Download Code

In Section Seekers of Perl Wisdom

Domain Nodelet^?

www.com | www.net | www.org

Node Status^?

node history
Node Type: note [id://817854]
help

Chatterbox^?

How do I use this? | Other CB clients

Other Users^?

Others surveying the Monastery: (3)

As of 2023-03-31 20:06 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

Notices^?