in reply to Re: Re: Re: Re: List::Compare
in thread List::Compare
Am I missing something or is List::Compare in your context giving you nothing that this code does not? This is probably faster and will use less memory as well.
my @ary1 = ( 1..10 ); my @ary2 = ( 5..15 ); my %h; $h{$_}++ for ( @ary1, @ary2 ); unique( "Only in ary1", \@ary1, \%h ); unique( "Only in ary2", \@ary2, \%h ); common( "Common to ary1 and ary2", \%h ); sub unique { my ( $text, $ary, $hash ) = @_; print $text, $/; do{ print "$_\n" unless $hash->{$_} == 2} for @$ary; } sub common { my ( $text, $hash ) = @_; print $text, $/; do{ print "$_\n" if $hash->{$_} == 2} for keys %$hash }
cheers
tachyon
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: alternative to List::Compare
by graff (Chancellor) on Mar 26, 2004 at 04:32 UTC | |
by McMahon (Chaplain) on Mar 26, 2004 at 15:37 UTC | |
by jkeenan1 (Deacon) on Jun 04, 2004 at 14:48 UTC | |
by QM (Parson) on Mar 26, 2004 at 22:27 UTC |