Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: fastest way to compare two arrays

by repellent (Priest)
on Apr 16, 2011 at 07:16 UTC ( #899738=note: print w/replies, xml ) Need Help??


in reply to fastest way to compare two arrays

use Set::IntSpan::Fast;
my $range = Set::IntSpan::Fast->new('50000-65535'); my $ports = Set::IntSpan::Fast->new('50000-51545,51549,51555-51999'); my $unused = $ports->copy; $unused->invert; my $unused_in_range = $range->intersection($unused); my $first_unused = ($unused_in_range->iterate_runs->())[0];

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://899738]
help
Chatterbox?
NodeReaper duct tapes the vents to muffle the moaning

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (4)
As of 2017-12-15 02:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What programming language do you hate the most?




















    Results (415 votes). Check out past polls.

    Notices?