Re: Re: Re: Removing Duplicate Array Elements!!!

[gbarr]

in reply to Re: Re: Removing Duplicate Array Elements!!!
in thread Removing Duplicate Array Elements!!!

If you are looking an efficient method to do this then try.

my %hash;
@hash{@a} = ();
@a = keys %hash;

But that only works, just as your example, for non-references as the keys of a hash can only be strings. If @a may contain references that you want to preserve then use

my %hash;
@hash{@a} = @a;
@a = values %hash;

This is slightly less efficient as it causes an extra copy of each element in @a

I generally write this as

@a = do { my %h; @h{@a} = @a; values %h }; # unique

[tachyon]

As you say, the slice method is faster again. I will be using it from now on. Thanks.

use Benchmark;

@a= (0..100,0..100);

$mine = <<'CODE';
my %hash;
@hash{$_}++ for @a;
@a = keys %hash;
CODE

$yours1 = <<'CODE';
my %hash;
@hash{@a} = ();
@a = keys %hash;
CODE

$yours2 = <<'CODE';
my %hash;
@hash{@a} = @a;
@a = values %hash;
CODE

$his = <<'CODE';
my %hash;
map { $hash{$_}=1 } @a;
@a = keys %hash;
CODE

timethese ( 10000, { 'mine'   => $mine, 
                     'yours1' => $yours1,
                     'yours2' => $yours2, 
                     'his'    => $his 
                   } );

__END__
C:\>perl test.pl
Benchmark: timing 10000 iterations of his, mine, yours1, yours2...
       his: 17 wallclock secs (17.03 usr +  0.00 sys = 17.03 CPU) @ 58
+7.20/s (n=10000)
      mine: 15 wallclock secs (15.05 usr +  0.00 sys = 15.05 CPU) @ 66
+4.45/s (n=10000)
    yours1: 12 wallclock secs (11.76 usr +  0.00 sys = 11.76 CPU) @ 85
+0.34/s (n=10000)
    yours2: 15 wallclock secs (14.78 usr +  0.00 sys = 14.78 CPU) @ 67
+6.59/s (n=10000)

C:\>

cheers

tachyon

s&&rsenoyhcatreve&&&s&n.+t&"$'$`$\"$\&"&ee&&y&srve&&d&&print

[littlemonk]

Hi thank u so much for your code ..it is working it has solved my problem ..but as a beginner i want know wats happening there ..could plz explain me the code..thanks in advance.