Re: [Json] String comparisons -- LAST CHANCE ON PROPOSALS

[Carsten Bormann <[e-mail]>]

On Jun 12, 2013, at 16:04, Paul Hoffman <[e-mail]> wrote:

> You talk about "prefer", but you don't say whether or not you can live with any of the alternatives.

These are all editorial comments, so I can live with anything*).
(On the technical level, we have consensus on comparing the sequences of Unicode code points.)

> You also talk about some ideas without giving specific wording.

I don't talk about ideas at all, I just point out where the proposed specific wording doesn't quite work.
I'll leave it to the native speakers to fix that.  
In particular, I trust that our esteemed editor can do that much better than I can.
(And I trust that he will transcend us if we try to micromanage him.)

(I sure can generate some clumsy wording for all of this, but I don't want to increase the number of proposals on the table.  Obligatory xkcd: http://xkcd.com/927/‎)

Grüße, Carsten

*) As long as it is not:

10 Let A be the first name, and B be the second name.
20 Let Aseq be the sequence of code points in A, and Bseq the sequence of code points in B.
30 If Aseq is empty, and Bseq is empty, return true.
40 If Aseq is empty, and Bseq is non-empty, return false.
50 If Aseq is non-empty, and Bseq is empty, return false.
60 If the first code point of Aseq is not equal to the first code point in Bseq, return false.
70 Replace Aseq by the sequence of all code points but the first in Aseq.
80 Replace Bseq by the sequence of all code points but the first in Bseq.
90 GOTO 30

READY