but I donīt understand this code. I would like to before I try if it works or not. (call me a theory fetish monk)
First I donīt understand why you use cmp for the sort.
Then (or because of this) I donīt see how we can be sure
that the longest suffixes are examined first.
I could understand what ($name =~ s/($pattern)$/$sufdata{$1}/o) does. And in fact it is elegant to use regexp instead of an own iteration, just the $pattern creation isnīt clear.
Ciao
In reply to Re: Re: Re:{2} Getting impossible things right (behaviour of keys)
by PetaMem
in thread Getting impossible things right (behaviour of keys)
by PetaMem
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |