-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathunicodejs.test.js
223 lines (215 loc) · 6.02 KB
/
unicodejs.test.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
/*!
* UnicodeJS Base module tests
*
* @copyright 2013-2018 UnicodeJS team and others; see AUTHORS.txt
* @license The MIT License (MIT); see LICENSE.txt
*/
unicodeJS.testdata = {};
unicodeJS.test = {
parseTestReduce: function ( arr, line ) {
var breakMap = {
'÷': true,
'×': false
},
skip = false,
chars = '',
expected = [],
parts = line.split( '#' ),
data = parts[ 0 ].trim().split( ' ' );
data.forEach( ( str, i ) => {
var codepoint;
if ( i % 2 === 0 ) {
// Tests at even offsets
expected.push( breakMap[ str ] );
} else {
codepoint = +( '0x' + str );
// Chars at odd offsets
chars += String.fromCodePoint( codepoint );
// For surrogate pairs, add an expected no-break between them
if ( codepoint > 0xFFFF ) {
expected.push( false );
}
}
} );
if ( !skip ) {
arr.push( {
msg: line,
string: chars,
expected: expected
} );
}
return arr;
}
};
QUnit.module( 'unicodeJS' );
QUnit.test( 'prevNextCodepoint', ( assert ) => {
var tests = [
// string, nextValues, prevValues, message
[
'XYZ',
[ 'X', 'Y', 'Z', null ],
[ null, 'X', 'Y', 'Z' ],
'no surrogate'
],
[
'X\ud800\udc00YZ',
[ 'X', '\ud800\udc00', '\udc00', 'Y', 'Z', null ],
[ null, 'X', '\ud800', '\ud800\udc00', 'Y', 'Z' ],
'pair'
],
[
'\ud800WX\ud800YZ\ud800',
[ '\ud800', 'W', 'X', '\ud800', 'Y', 'Z', '\ud800', null ],
[ null, '\ud800', 'W', 'X', '\ud800', 'Y', 'Z', '\ud800' ],
'unpaired leading'
],
[
'\udc00WX\udc00YZ\udc00',
[ '\udc00', 'W', 'X', '\udc00', 'Y', 'Z', '\udc00', null ],
[ null, '\udc00', 'W', 'X', '\udc00', 'Y', 'Z', '\udc00' ],
'unpaired trailing'
]
];
tests.forEach( ( test ) => {
var s = new unicodeJS.TextString( test[ 0 ] );
var nextValues = test[ 1 ];
var prevValues = test[ 2 ];
var message = test[ 3 ];
nextValues.forEach( ( value, i ) => {
assert.strictEqual(
s.nextCodepoint( i ),
value,
message + ': nextCodepoint(' + i + ')'
);
} );
prevValues.forEach( ( value, i ) => {
assert.strictEqual(
s.prevCodepoint( i ),
value,
message + ': prevCodepoint(' + i + ')'
);
} );
} );
} );
QUnit.test( 'charRangeArrayRegexp', ( assert ) => {
var equalityTests = [
[ [ 0x0040 ], '\\u0040', 'single BMP character' ],
[ [ 0xFFFF ], '\\uffff', 'highest BMP character' ],
[
[
0x005F,
[ 0x203F, 0x2040 ],
0x2054,
[ 0xFE33, 0xFE34 ],
[ 0xFE4D, 0xFE4F ],
0xFF3F
],
'[\\u005f\\u203f-\\u2040\\u2054\\ufe33-\\ufe34\\ufe4d-\\ufe4f\\uff3f]',
'multiple BMP ranges (= ExtendNumLet from wordbreak rules)'
],
[ [ 0xD7FF ], '\\ud7ff', 'just below surrogate range' ],
[ [ 0xE000 ], '\\ue000', 'just above surrogate range' ],
[ [ 0x10000 ], '\\ud800\\udc00', 'lowest non-BMP character' ],
[ [ 0x10001 ], '\\ud800\\udc01', 'second-lowest non-BMP character' ],
[ [ 0x103FF ], '\\ud800\\udfff', 'highest character with D800 leading surrogate' ],
[ [ 0x10400 ], '\\ud801\\udc00', 'lowest character with D801 leading surrogate' ],
[
[ [ 0xFF00, 0xFFFF ] ],
'[\\uff00-\\uffff]',
'single range at top of BMP'
],
[
[ [ 0xFF00, 0x10000 ] ],
'[\\uff00-\\uffff]|\\ud800\\udc00',
'single range spanning BMP and non-BMP'
],
[
[ 0xFFFF, 0x10000, 0x10002 ],
'\\uffff|\\ud800\\udc00|\\ud800\\udc02', // TODO: could compact
'single characters, both BMP and non-BMP'
],
[
[ [ 0x0300, 0x0400 ], 0x10FFFF ],
'[\\u0300-\\u0400]|\\udbff\\udfff',
'BMP range and non-BMP character'
],
[
[ [ 0xFF00, 0x103FF ] ],
'[\\uff00-\\uffff]|\\ud800[\\udc00-\\udfff]',
'range to top of D800 leading surrogate range'
],
[
[ [ 0xFF00, 0x10400 ] ],
'[\\uff00-\\uffff]|\\ud800[\\udc00-\\udfff]|\\ud801\\udc00',
'range to start of D801 leading surrogate range'
],
[
[ [ 0xFF00, 0x10401 ] ],
'[\\uff00-\\uffff]|\\ud800[\\udc00-\\udfff]|\\ud801[\\udc00-\\udc01]',
'range past start of D801 leading surrogate range'
],
[
[ [ 0xFF00, 0x15555 ] ],
'[\\uff00-\\uffff]|[\\ud800-\\ud814][\\udc00-\\udfff]|\\ud815[\\udc00-\\udd55]',
'range spanning multiple leading surrogate ranges'
],
[
[ [ 0x10454, 0x10997 ] ],
'\\ud801[\\udc54-\\udfff]|\\ud802[\\udc00-\\udd97]',
'range starting within one leading surrogate range, and ending in the next'
],
[
[ [ 0x20222, 0x29999 ] ],
'\\ud840[\\ude22-\\udfff]|[\\ud841-\\ud865][\\udc00-\\udfff]|\\ud866[\\udc00-\\udd99]',
'range starting within one leading surrogate range, and ending in a distant one'
],
[
[ 0x00AD, [ 0x0600, 0x0604 ], 0x06DD, 0x070F,
[ 0x200E, 0x200F ], [ 0x202A, 0x202E ], [ 0x2060, 0x2064 ],
[ 0x206A, 0x206F ], 0xFEFF, [ 0xFFF9, 0xFFFB ],
0x110BD, [ 0x1D173, 0x1D17A ],
0xE0001, [ 0xE0020, 0xE007F ]
],
// TODO: could compact
'[\\u00ad\\u0600-\\u0604\\u06dd\\u070f' +
'\\u200e-\\u200f\\u202a-\\u202e\\u2060-\\u2064' +
'\\u206a-\\u206f\\ufeff\\ufff9-\\ufffb]' +
'|\\ud804\\udcbd|\\ud834[\\udd73-\\udd7a]|\\udb40\\udc01' +
'|\\udb40[\\udc20-\\udc7f]',
'multiple BMP and non-BMP ranges (= Format from wordbreak rules)'
],
[
[ [ 0x0, 0xD7FF ], [ 0xE000, 0xFFFF ], [ 0x10000, 0x10FFFF ] ],
'[\\u0000-\\ud7ff\\ue000-\\uffff]|[\\ud800-\\udbff][\\udc00-\\udfff]',
'largest possible range'
]
];
var throwTests = [
[ [ 0xD800 ], 'surrogate character U+D800' ],
[ [ 0xDFFF ], 'surrogate character U+DFFF' ],
[ [ 0x110000 ], 'character too high' ],
[ [ [ 0xCCCC, 0xDDDD ] ], 'surrogate overlap 1' ],
[ [ [ 0xDDDD, 0xEEEE ] ], 'surrogate overlap 2' ],
[ [ [ 0xDDDD, 0xEEEEE ] ], 'surrogate overlap 3' ],
[ [ [ 0xCCCC, 0xEEEE ] ], 'surrogate overlap 4' ],
[ [ [ 0x2, 0x1 ] ], 'min > max' ],
[ [ [ 0x10FFFF, 0x110000 ] ], 'range too high' ]
];
equalityTests.forEach( ( test ) => {
assert.strictEqual(
unicodeJS.charRangeArrayRegexp( test[ 0 ] ),
test[ 1 ],
test[ 2 ]
);
} );
throwTests.forEach( ( test ) => {
var doTestFunc = function () {
unicodeJS.charRangeArrayRegexp( test[ 0 ] );
};
assert.throws(
doTestFunc,
Error,
'throw: ' + test[ 1 ]
);
} );
} );