On Mon, 4 Dec 2017 12:48:11 -0800
Markus Scherer via Unicode wrote:
> On Mon, Dec 4, 2017 at 5:30 AM, Richard Wordingham via Unicode <
> unicode@unicode.org> wrote:
> > Would an implementation that supported no characters be compliant?
> I guess so. I assume that would
On Mon, Dec 4, 2017 at 5:30 AM, Richard Wordingham via Unicode <
unicode@unicode.org> wrote:
> May a collation algorithm that always compares all strings as equal be a
> compliant implementation of the Unicode Collation Algorithm (UTS #10)?
> If not, by which clause is it not compliant?
May a collation algorithm that always compares all strings as equal be a
compliant implementation of the Unicode Collation Algorithm (UTS #10)?
If not, by which clause is it not compliant? Formally, this algorithm
would require that all weights be zero.
Would an implementation that supported no
3 matches
Mail list logo