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
|
/* Test of word breaks in UTF-32 strings.
Copyright (C) 2009-2022 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>. */
/* Written by Bruno Haible <bruno@clisp.org>, 2009. */
#include <config.h>
#include "uniwbrk.h"
#include <stdlib.h>
#include "macros.h"
int
main ()
{
/* Test case n = 0. */
u32_wordbreaks (NULL, 0, NULL);
{
static const uint32_t input[61] =
/* "Grüß Gott. Здравствуйте! x=(-b±sqrt(b²-4ac))/(2a) 日本語,中文,한글" */
{ 'G', 'r', 0x00FC, 0x00DF, ' ', 'G', 'o', 't', 't', '.', ' ',
0x0417, 0x0434, 0x0440, 0x0430, 0x0432, 0x0441, 0x0442, 0x0432, 0x0443,
0x0439, 0x0442, 0x0435, '!', ' ',
'x', '=', '(', '-', 'b', 0x00B1, 's', 'q', 'r', 't', '(', 'b', 0x00B2,
'-', '4', 'a', 'c', ')', ')', '/', '(', '2', 'a', ')', ' ', ' ',
0x65E5, 0x672C, 0x8A9E, ',', 0x4E2D, 0x6587, ',', 0xD55C, 0xAE00, '\n'
};
char *p = (char *) malloc (SIZEOF (input));
size_t i;
u32_wordbreaks (input, SIZEOF (input), p);
for (i = 0; i < 61; i++)
{
ASSERT (p[i] == ((i >= 4 && i <= 5)
|| (i >= 9 && i <= 11)
|| (i >= 23 && i <= 31)
|| (i >= 35 && i <= 39)
|| (i >= 42 && i <= 46)
|| (i >= 48 && i <= 49)
|| (i >= 51 && i <= 58)
|| i == 60
? 1 : 0));
}
free (p);
}
{
/* Same input string, decomposed. */
static const uint32_t input[67] =
/* "Grüß Gott. Здравствуйте! x=(-b±sqrt(b²-4ac))/(2a) 日本語,中文,한글" */
{ 'G', 'r', 0x0075, 0x0308, 0x00DF, ' ', 'G', 'o', 't', 't', '.', ' ',
0x0417, 0x0434, 0x0440, 0x0430, 0x0432, 0x0441, 0x0442, 0x0432, 0x0443,
0x0438, 0x0306, 0x0442, 0x0435, '!', ' ',
'x', '=', '(', '-', 'b', 0x00B1, 's', 'q', 'r', 't', '(', 'b', 0x00B2,
'-', '4', 'a', 'c', ')', ')', '/', '(', '2', 'a', ')', ' ', ' ',
0x65E5, 0x672C, 0x8A9E, ',', 0x4E2D, 0x6587, ',',
0x1112, 0x1161, 0x11AB, 0x1100, 0x1173, 0x11AF, '\n'
};
char *p = (char *) malloc (SIZEOF (input));
size_t i;
u32_wordbreaks (input, SIZEOF (input), p);
for (i = 0; i < 67; i++)
{
ASSERT (p[i] == ((i >= 5 && i <= 6)
|| (i >= 10 && i <= 12)
|| (i >= 25 && i <= 33)
|| (i >= 37 && i <= 41)
|| (i >= 44 && i <= 48)
|| (i >= 50 && i <= 51)
|| (i >= 53 && i <= 60)
|| i == 66
? 1 : 0));
}
free (p);
}
/* CR LF handling. */
{
static const uint32_t input[8] =
{ 'a', '\n', 'b', '\r', 'c', '\r', '\n', 'd' };
char *p = (char *) malloc (SIZEOF (input));
size_t i;
u32_wordbreaks (input, SIZEOF (input), p);
for (i = 0; i < 8; i++)
{
ASSERT (p[i] == (i == 1 || i == 2 || i == 3 || i == 4 || i == 5
|| i == 7 ? 1 :
0));
}
free (p);
}
/* Test regional indicators. */
{
static const uint32_t input[6] =
{ '.', 0x1F1E9, 0x1F1EA, 0x1F1EB, 0x1F1F7, '.' };
char *p = (char *) malloc (SIZEOF (input));
size_t i;
u32_wordbreaks (input, SIZEOF (input), p);
for (i = 0; i < 6; i++)
{
ASSERT (p[i] == (i == 1 || i == 3 || i == 5 ? 1 : 0));
}
free (p);
}
return 0;
}
|
