Re: hash sort problems

Thanks folks for all your replies! its really made my day!

as you've probably guessed its some of the concepts i'm struggling with.

what this code does below seems to do is sort my hash by key alphabetically it then (i think) sorts by the value in {tag} which groups all the records which have the same value in {tag} together for me.

I want to add another 2 sorts.

1. I want to be to pick out a value(53) in {tag} and group my records by that, which will be processed by the foreach loop last so it becomes the last lines in my HTML output.

2. The last group/sort of my hash is pick out this condition in $my_server_hash{$server}{ADMINS} =~ s/$account/FOUND:; and group all those trues togther and make this the second last lines in my HTML.

I include a sample hash.

my %server_hash = ( SERVER1 => {tag => 53, ADMINS => undef, ADMINSGRP 
+= undef}, SERVER2 => {tag => 1, ADMINS = "account1", ADMINSGRP = ["gl
+obal1","global2"]}, SERVER3 => {tag => 1236 ADMINS = "account2", ADMI
+NSGRP = ["global1","global2"]}, SERVER4 => {tag => 1236 ADMINS = "acc
+ount1", ADMINSGRP = ["global1","global2"]} )
 )
[download]

i wanna pick out values in {tag} and {admins} and group/sort my hash with them. so all in all. I wanna 1. sort by key alphabetically1 after that, 2. sort by value in {tag} (so it groups all the 1s together all the 87s together etc), 3. drop all the ..{tag}==53 to the bottom. and finally 4. do that pattern match mentioned above and further group my records with that.

  foreach my $server ( sort {$my_server_hash {$a} cmp $my_server_hash 
+{$b}
                   && $my_server_hash{$a}{tag} <=> $my_server_hash{$b}
+{tag}
                            } keys %my_server_hash)

                { my $member =  $my_server_hash{$server}{ADMINS};
                  $servercount++;
                  $access = $my_server_hash{$server}{tag};

                    if ($access == 1)      {
                     $comment = "";
                        $color="#99FF33";
                        }

               elsif ($member =~ s/$account/FOUND:$account/i && $acces
+s !=1)  { # this means password is wrong!
                           $color = "#FF3366";
                           $comment = "<a name=\"password_wrong\"><b>$
+account password is wrong! </b></a>";
                        }

                elsif ($access == 53)           {
                     $comment = " <a name=\"unavailable\"> <font color
+ = \"white\"> <b>machine unavailable! <br></b></a> ";
                     $color = "#996666";
                                                 }

             elsif($my_server_hash{$server}{ADMINS})     {
                           $comment = " <a name=\"no_account\"><b> $ac
+count account does not exist</b> </a>";
                            $color = "#FF3333";
                           }
          else    {
                            $comment = " <a name=\"unknown\"> <font co
+lor = \"white\"> <b>unable to access! <br></b></a> ";
                            $color = "#FF66CC";
                        }


   server_data_row("19%",$color, "27%", "Verdana, Arial, Helvetica, sa
+ns-serif","4",$server,$htm_pass_handle);
   server_data_row("12%",$color, "27%", "Courier New, Courier, mono","
+2","$member",$htm_pass_handle);
   server_data_row("69%",$color, "27%", "Courier New, Courier, mono","
+3",$access."<b> $comment</b>",$htm_pass_handle,"</tr>");


               }  # foreach server
[download]

I think i have enough to go on i will probably go down the graff has suggested although i dont think i'm understanding the concept to implement it properly.

any further nudges in the right direction are very welcome.

for now back to my code. thanks again. C.

Comment on Re: hash sort problems Select or Download Code

Replies are listed 'Best First'.
Re: Re: hash sort problems by dmmiller2k (Chaplain) on Apr 19, 2002 at 13:53 UTC
For the sort of sorting (um, sorry) you seem to want to do, treat a `{tag}` value of 53 as an arbitrary 'high' value and anything else as an arbitrary 'low' value (i.e., just have two) for one level of sorting, and then append to that the sorting you're already doing. To wit: `sub server_sort { # bi-valued key = 0 if {tag} is not 53 and 1 if {tag} is 53 (($my_server_hash{$a}{tag} == 53) <=> ($my_server_hash{$b}{tag} == 53)) \|\| $a cmp $b \|\| $my_server_hash{$a}{tag} <=> $my_server_hash{$b}{tag} } my @server_names = sort &server_sort keys %my_server_hash; # now the server names are sorted with the 53 tags grouped # separately from the rest.` [download] Of course, with a large number of items, this manner of sorting is beau coup inefficient; you may want to precalculate the keys, a la the Schwartzian Transform (or dare I suggest the Advanced Sorting - GRT - Guttman Rosler Transform?). In this case, the precalculated keys might consist of the various components appended together: Update: Admittedly, `pack` would be far more efficient than `sprintf` in the following, but I wanted to illustrate the point without obfuscating it any more than necessary. `sub make_key { my $sn = shift; my $tag = $my_server_hash{$sn}{tag}; # NOTE: presumes largest server name may be contained # in 20 chars and that {tag} values won't exceed 99,999 return sprintf "%1d%20s%5d", ($tag == 53), $sn, $tag}; } sub decode_key { my $key = shift; return substr $key, 1, 20; } my @server_names = map { decode_key($_) } sort { $a cmp $b } map { make_key($_) } keys %my_server_hash;` [download] Similarly, your other criteria (looks like {tag} is contained within the {ADMINS} key, whatever that means) might be incorporated by changing the bi-valued key to a tri-valued key (0, 1, 2) and inserting that criteria between the two existing ones. `sub make_key { my $sn = shift; my $tag = $my_server_hash{$sn}{tag}; my $member = $my_server_hash{$sn}{ADMINS}; my $key = ($tag == 53) ? 2 : (($member =~ s/$tag/FOUND:$tag/i) && $tag != 1) ? 1 : 0; return sprintf "%1d%20s%5d", $key, $sn, $tag}; }` [download] Hope this helps. dmm If you GIVE a man a fish you feed him for a day But, TEACH him to fish and you feed him for a lifetime	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re: Re: hash sort problems
by dmmiller2k (Chaplain) on Apr 19, 2002 at 13:53 UTC

For the sort of sorting (um, sorry) you seem to want to do, treat a {tag} value of 53 as an arbitrary 'high' value and anything else as an arbitrary 'low' value (i.e., just have two) for one level of sorting, and then append to that the sorting you're already doing. To wit:

sub server_sort {
  # bi-valued key = 0 if {tag} is not 53 and 1 if {tag} is 53
  (($my_server_hash{$a}{tag} == 53)
   <=>
   ($my_server_hash{$b}{tag} == 53))
  ||
  $a cmp $b
  ||
  $my_server_hash{$a}{tag} <=> $my_server_hash{$b}{tag}
}

my @server_names = sort &server_sort keys %my_server_hash;

# now the server names are sorted with the 53 tags grouped
# separately from the rest.
[download]

Of course, with a large number of items, this manner of sorting is beau coup inefficient; you may want to precalculate the keys, a la the Schwartzian Transform (or dare I suggest the Advanced Sorting - GRT - Guttman Rosler Transform?).

In this case, the precalculated keys might consist of the various components appended together:

Update: Admittedly, pack would be far more efficient than sprintf in the following, but I wanted to illustrate the point without obfuscating it any more than necessary.

sub make_key {
  my $sn = shift;
  my $tag = $my_server_hash{$sn}{tag};

  # NOTE: presumes largest server name may be contained
  # in 20 chars and that {tag} values won't exceed 99,999
  return sprintf "%1d%20s%5d", ($tag == 53), $sn, $tag};
}

sub decode_key {
  my $key = shift;
  return substr $key, 1, 20;
}

my @server_names = map { decode_key($_) }
                   sort { $a cmp $b }
                   map { make_key($_) } keys %my_server_hash;
[download]

Similarly, your other criteria (looks like {tag} is contained within the {ADMINS} key, whatever that means) might be incorporated by changing the bi-valued key to a tri-valued key (0, 1, 2) and inserting that criteria between the two existing ones.

sub make_key {
  my $sn = shift;
  my $tag = $my_server_hash{$sn}{tag};
  my $member = $my_server_hash{$sn}{ADMINS};
  my $key = ($tag == 53) ? 2 :
            (($member =~ s/$tag/FOUND:$tag/i) && $tag != 1) ? 1 :
            0;

  return sprintf "%1d%20s%5d", $key, $sn, $tag};
}
[download]

Hope this helps.

dmm

If you GIVE a man a fish you feed him for a day
But, TEACH him to fish and you feed him for a lifetime

[reply]
[d/l]
[select]