in reply to Re: Re: Sorting a hash of IP addresses?
in thread Sorting a hash of IP addresses?

You could simplify the comparison by upgrading your transformation. Instead of just splitting it into four pieces, why not convert it to dotless notation (i.e. the decimal representation of the underlying 32 bits). Comparing ips in dotless notation is trivial... a single <=> is all you need.

In general it makes sense to push the complexity into the transformation since it is only done once for each element in the list.

Something like: (warning untested) 

my @sorted_keys = map  {$_->[0]}
                  sort {$a->[1] <=> $b->[1]}
                  map  { [ $_, unpack("N",pack("C4",split(/\./,$_))) ]
+ }
                  keys %ip;

[download]
* I borrowed the ip => dotless conversion from Fletch's golf entry

-Blake

Replies are listed 'Best First'.
Re: Re: Re: Re: Sorting a hash of IP addresses?
by davorg (Chancellor) on Dec 05, 2001 at 16:32 UTC

    And let's not forget that sorting IP addresses was the canonical example of the packed default sort that Uri Guttman and Larry Rosler used in their most excellent paper on Perl sorting. Changing their code a little gives us this:

    @sorted_keys =
  map  substr($_, 4) =>
  sort
  map  pack('C4' =>
    /(\d+)\.(\d+)\.(\d+)\.(\d+)/)
      . $_ => keys %ip;

    [download]
    --
    <http://www.dave.org.uk>

    "The first rule of Perl club is you do not talk about Perl club."
    -- Chip Salzenberg

[reply]
[d/l]

In Section Seekers of Perl Wisdom