Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: any smart ideas??:)

by andreychek (Parson)
on May 30, 2002 at 15:32 UTC ( #170421=note: print w/ replies, xml ) Need Help??


in reply to Comparing two arrays (was: any smart ideas??:)

You may also be able to use TheDamian's Quantum::Superpositions to do the trick for you. Perhaps something like the following code:

#!/usr/bin/perl -w use strict; use Quantum::Superpositions; my @array1 = qw( 0 2 4 6 8 10 12 14 16 18 20 ); my @array2 = qw( 0 5 10 15 20 ); if(any(@array1) eq any(@array2)) { print "A match!\n"; } else { print "Nope, no match\n"; }
As expected, the above example does find a match.

-Eric

--
Lucy: "What happens if you practice the piano for 20 years and then end up not being rich and famous?"
Schroeder: "The joy is in the playing."


Comment on Re: any smart ideas??:)
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (9)
As of 2015-07-29 07:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (260 votes), past polls