Re: Re: Re:{2} Getting impossible things right (behaviour of keys)

I don't believe sorting on cmp alone will do it in this case. If you had two keys 'ba' and 'cba', then you're going to get the wrong behavior. As long as you're tying the regex to the end of the string, length should be sufficient.

-----------------------------------------------------
Dr. Michael K. Neylon - mneylon-pm@masemware.com || "You've left the lens cap of your mind on again, Pinky" - The Brain
"I can see my house from here!"
It's not what you know, but knowing how to find it if you don't know that's important

Comment on Re: Re: Re:{2} Getting impossible things right (behaviour of keys)

Replies are listed 'Best First'.
Re: Re: Re: Re:{2} Getting impossible things right (behaviour of keys) by blakem (Monsignor) on Oct 24, 2001 at 21:44 UTC
Good, point... the entire sort is unnecessary. The length is taken care of by the regex engine, and its not possible to have two matches of the same length, so no sorting all all is needed. Therefore, I submit that: `my $pattern = join('\|',(keys %sufdata)); if ($name =~ s/($pattern)$/$sufdata{$1}/o) { print "Suffix $1 -> $name\n"; return; } print " no rule apply -> $name\n";` [download] Would work the same as my code above. -Blake	[reply] [d/l]

Replies are listed 'Best First'.

Re: Re: Re: Re:{2} Getting impossible things right (behaviour of keys)
by blakem (Monsignor) on Oct 24, 2001 at 21:44 UTC

my $pattern = join('|',(keys %sufdata));
if ($name =~ s/($pattern)$/$sufdata{$1}/o) {
  print "Suffix $1 -> $name\n";
  return;
}
print " no rule apply -> $name\n";
[download]

-Blake

[reply]
[d/l]