Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: IP Address sorting

by tadman (Prior)
on Feb 13, 2001 at 08:13 UTC ( #58077=note: print w/replies, xml ) Need Help??

in reply to IP Address sorting

japhy's code is certainly very quick, Benchmarking about 43% better than anything I could come up with on short notice. The 'radix_sort' is obviously more efficient for this kind of application than the built in sort of Perl.

However, under Perl 5.6 + strict + '-w', the following change is required to avoid compilation errors:
sub IPsort { map inet_ntoa($_), IP_radix_sort map inet_aton($_), @_; }
The alternative code which Benchmarks in at #2, but has the advantage of simplicity:
sub byip { inet_ntoa($a) cmp inet_ntoa($b) } foreach (sort byip @ip_list) ...
BTW, I tested both with 100_000 random IP addresses by 10 runs (approx 86 to 150s per test).

Replies are listed 'Best First'.
Re: Re: IP Address sorting
by japhy (Canon) on Feb 13, 2001 at 19:47 UTC

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://58077]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (10)
As of 2016-10-24 15:53 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (309 votes). Check out past polls.