Re: (Golf) Keysort

[chipmunk]

in reply to (Golf) Keysort

Here's my lexicographic solution, which comes in at 89 characters (including the call to sort):

sub chipmunk_lexi {
sort{(($B)=$b=~($r='^\s*(0|-?[1-9]\d{0,8})(?!\d)'))<=>(($A)=$a=~$r)||$
+A<=>$B||$a cmp$b}@_
}

If I've understood the hole properly, the definitions of "integer" and "starting with an integer" are a bit tricky. '0' is an integer, but '00' isn't; '0a' starts with an integer, but '00a' doesn't. Thus, '0', '1', '00', 'adam' would be sorted in that order. Have I got that right?

[demerphq]

Nice!

And you are correct with how im defining an integer.

However you are correct that there is a minor problem with the regex. The ignore leading whitespace shouldnt happen, as it prevents reconstructive methods from being successful. (Although ST style stuff should be fine with it...)

So the regex should be

/^(0|-?[1-9]\d{0,8})/

Your (?!\d) is a worthy and intelligent addition, but I was willing to overlook the issue it resolves. ;-)

BTW, my reasoning for disallowing 0000 and the like was to ensure that binary hash keys were sorted lexicographically.

Im going to update the original node with your score and the bit about the regex tomorrow.

Yves / DeMerphq
--
When to use Prototypes?