On Apr 21, 2004, at 10:20 AM, Dan Sugalski wrote:
At 9:22 AM -0700 4/21/04, Jeff Clites wrote:On Apr 21, 2004, at 4:05 AM, Leopold Toetsch wrote:
... a factor ~14 performance increase for the "not equal" case.
Ah, great! (And the "not equal" case is the only one which should be showing a speed up--the "same" and "equal" cases are expected to be unaffected.)
Just to make sure... we're making sure the strings are always properly decomposed before comparing, right?
Nope, this is a literal "equal" comparison--you'd build a normalized compare on top of this.
I think this got caught on the list queue for a bit, and it's already been addressed, but just to be clear, Parrot's keeping decomposable characters decomposed, and generally normalizing, or at least pretending it's normalizing if it doesn't actually do so, when working with strings.
--
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
