OLD | NEW |
1 Ace ten twenty-one thirty-five. xxxxxxxxxxxxxxxxxxx | 1 Ace ten twenty-one thirty-five. xxxxxxxxxxxxxxxxxxx |
2 | 2 |
3 Tests that we can compute word boundaries for any character index from the acces
sibility tree. | 3 Tests that we can compute word boundaries for any character index from the acces
sibility tree. |
4 | 4 |
5 On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE
". | 5 On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE
". |
6 | 6 |
7 | 7 |
8 Accessible text: "Ace ten twenty-one thirty-five. xxxxxxxxxxxxxxxxxxx" | 8 Accessible text: "Ace ten twenty-one thirty-five. xxxxxxxxxxxxxxxxxxx" |
9 Character 0: 'A' word=(0, 3): 'Ace' | 9 Character 0: 'A' word=(0, 3): 'Ace' |
10 Character 1: 'c' word=(0, 3): 'Ace' | 10 Character 1: 'c' word=(0, 3): 'Ace' |
(...skipping 43 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
54 Character 45: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' | 54 Character 45: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' |
55 Character 46: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' | 55 Character 46: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' |
56 Character 47: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' | 56 Character 47: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' |
57 Character 48: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' | 57 Character 48: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' |
58 Character 49: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' | 58 Character 49: 'x' word=(32, 50): 'xxxxxxxxxxxxxxxxxx' |
59 Character 50: 'x' word=(50, 51): 'x' | 59 Character 50: 'x' word=(50, 51): 'x' |
60 PASS successfullyParsed is true | 60 PASS successfullyParsed is true |
61 | 61 |
62 TEST COMPLETE | 62 TEST COMPLETE |
63 | 63 |
OLD | NEW |