Re^2: Sort hash with values

[sammy_01]

Hi Rahul,

May be this will solve your problem.

sub mySort {
    
    $a =~ /(\d+)/;
    my $firstVal = $1;
    $b =~ /(\d+)/;
    my $secVal = $1;
    $firstVal <=> $secVal;
}

my %IP_Store = (
                "11.0.0.1" => "UEH1_system_ip",
                "11.0.0.11" => "UEH11_system_ip",
                "11.0.0.3" => "UEH25_system_ip",
                "11.0.0.25" => "UEH111_system_ip"
                );

%new_hash = reverse(%IP_Store);

foreach my $key (sort mySort (keys(%new_hash))) {
        chomp($key);
        print "$key\n";
        print "System_ip = $new_hash{$key}\n";
       #print "PDN-IP = '$Values' \n";
}

The only change i have done is reversing the hash.

Output:

-------

UEH1_system_ip

System_ip = 11.0.0.1

UEH11_system_ip

System_ip = 11.0.0.11

UEH25_system_ip

System_ip = 11.0.0.3

UEH111_system_ip

System_ip = 11.0.0.25

[AnomalousMonk]

The only change i have done is reversing the hash.

A naive hash reversal works just fine if the hash values are unique to begin with. If they're not, somebody's gonna get (silently) clobbered. Maybe add a pre/post reversal size check:

>perl -wMstrict -le
"my %hash = qw(a aye  b bee  c see  eh aye);
 ;;
 my $pre_k = keys %hash;
 %hash = reverse %hash;
 $pre_k == keys %hash or die 'somebody got clobbered';
"
somebody got clobbered at -e line 1.

[sammy_01]

Oh Yes, i do agree with you.