Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re^7: Need a faster way to find matches

by kikuchiyo (Monk)
on Jan 18, 2010 at 10:01 UTC ( #817949=note: print w/replies, xml ) Need Help??

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

Yes, I see it now.

I must have misunderstood your condition "do not share any common bits" to mean ~($i1 XOR $i2) instead of $i1 & $i2. For example, the two numbers in the first example do "share" common bits in the sense that both bits are 0. In this case the only valid value for a given $i1 would be ~$i1 and nothing else.

However, if the condition is $i1 & $i2 == 0, then you're right, there are several possible $i2's.

Still, you may be still better off generating the list of possible values for every existing element of the array and check those instead of blindly doing all comparisons.
  • Comment on Re^7: Need a faster way to find matches

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://817949]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (12)
As of 2016-10-27 12:20 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (362 votes). Check out past polls.