Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

(MeowChow) Re2: (Efficiently) comparing arrays

by MeowChow (Vicar)
on Apr 04, 2002 at 10:15 UTC ( #156613=note: print w/ replies, xml ) Need Help??


in reply to Re: (Efficiently) comparing arrays
in thread comparing arrays

You can get about a 30% performance improvement over the original naive code with the following:
  
my ($first, $second) = @_; return 0 if @$first != @$second; my $i = 0; $second->[$i++] ne $_ && return 0 for @$first; return 1;

   MeowChow                                   
               s aamecha.s a..a\u$&owag.print


Comment on (MeowChow) Re2: (Efficiently) comparing arrays
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (7)
As of 2016-02-09 10:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How many photographs, souvenirs, artworks, trophies or other decorative objects are displayed in your home?





    Results (310 votes), past polls