Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re^8: Trying to determine the output length of a Unicode string

by ikegami (Pope)
on Sep 26, 2011 at 22:34 UTC ( #927966=note: print w/replies, xml ) Need Help??

in reply to Re^7: Trying to determine the output length of a Unicode string
in thread Trying to determine the output length of a Unicode string

Again, so what? I don't see what point you are trying to make even if what you said was true. Of course, what hat you said isn't even close to being true.

yet you continue to argue that my criticism of its brokenness was wrong

That's a lie. You never said it was broken, and I never argued on whether it was broken or not.

  • You said it was tricky. I argued it wasn't tricky.
  • You said it was obfuscated. I argued it wasn't obfuscated.
  • You said it seemed to behave weirdly. I fixed that.
  • You said you didn't understand it. I explained it.
  • You implied you didn't need to read the docs to understand your version. I argued that wasn't the case.

Perhaps you forgot to say you thought it was broken? Could you explain why you think so? Like I pointed out, it's broken for assuming all characters are the same width (just like yours is), but what else?

You made your version of length_in_grapheme_clusters() patently more like Tom's version when you fixed it

That's not true. I changed two things: I took out the accumulator and the while loop. I did that by adding () =. It still uses () = instead of the accumulator and the loop, so your claim makes no sense.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://927966]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (4)
As of 2018-05-20 12:47 GMT
Find Nodes?
    Voting Booth?