Lines Matching refs:sequence

22 receiving UTF-8 shall interpret a "malformed sequence in the same way
26 UTF-8 decoders is to replace any malformed UTF-8 sequence by a
29 visually distinguish a malformed UTF-8 sequence from a correctly
36 Please check, whether a malformed UTF-8 sequence is (1) represented at
39 illegal UTF-8 sequence is correctly displayed, i.e. proper
41 sequence. This file says "THE END" in the last line, so if you don't
54 Note that as an alternative to the notion of malformed sequence used
57 sequence by a replacement character. If you follow this strategy in
69 2.1  First possible sequence of a certain length                              |
78 2.2  Last possible sequence of a certain length                               |
100 malformed sequence of its own.                                                |
149 All bytes of an incomplete sequence should be signalled as a single           |
150 malformed sequence, i.e., you should see only a single replacement            |
153 3.3.1  2-byte sequence with last byte missing (U+0000):     "�"               |
154 3.3.2  3-byte sequence with last byte missing (U+0000):     "��"               |
155 3.3.3  4-byte sequence with last byte missing (U+0000):     "���"               |
156 3.3.4  5-byte sequence with last byte missing (U+0000):     "����"               |
157 3.3.5  6-byte sequence with last byte missing (U+0000):     "�����"               |
158 3.3.6  2-byte sequence with last byte missing (U-000007FF): "�"               |
159 3.3.7  3-byte sequence with last byte missing (U-0000FFFF): "�"               |
160 3.3.8  4-byte sequence with last byte missing (U-001FFFFF): "���"               |
161 3.3.9  5-byte sequence with last byte missing (U-03FFFFFF): "����"               |
162 3.3.10 6-byte sequence with last byte missing (U-7FFFFFFF): "�����"               |
203 like a malformed UTF-8 sequence, for instance by substituting it with         |
216 overlong sequence if represented with the given number of bytes. This         |