summaryrefslogtreecommitdiff
path: root/tests/test_thcell.c
blob: a9bb738a224e67b3e9601dc7021ce66338447927 (plain)
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
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
/*
 * test_thcell.c : Test suite for <thai/thcell.h> functions
 * Created: 2001-08-09
 * Author:  Theppitak Karoonboonyanan
 */

#include <thai/thcell.h>
#include <thai/tis.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>

static const thchar_t test_msg[] = "¹éÓ¹ÓÓ¡Õè¡èÕ¡Øè¡èØ¡Øì¡ìØ¡Ôì¡ìÔàÔàÓà鹡Ôí¡×ç";
static const struct thcell_t test_ans_nodecomp_am[] = {
    { TIS_NO_NU, 0, TIS_MAI_THO },
    { TIS_SARA_AM, 0, 0 },
    { TIS_NO_NU, 0, 0 },
    { TIS_SARA_AM, 0, 0 },
    { TIS_SARA_AM, 0, 0 },
    { TIS_KO_KAI, TIS_SARA_II, TIS_MAI_EK },
    { TIS_KO_KAI, 0, TIS_MAI_EK },
    { 0, TIS_SARA_II, 0 },
    { TIS_KO_KAI, TIS_SARA_U, TIS_MAI_EK },
    { TIS_KO_KAI, 0, TIS_MAI_EK },
    { 0, TIS_SARA_U, 0 },
    { TIS_KO_KAI, TIS_SARA_U, TIS_THANTHAKHAT },
    { TIS_KO_KAI, 0, TIS_THANTHAKHAT },
    { 0, TIS_SARA_U, 0 },
    { TIS_KO_KAI, TIS_SARA_I, TIS_THANTHAKHAT },
    { TIS_KO_KAI, 0, TIS_THANTHAKHAT },
    { 0, TIS_SARA_I, 0 },
    { TIS_SARA_E, 0, 0 },
    { 0, TIS_SARA_I, 0 },
    { TIS_SARA_E, 0, 0 },
    { TIS_SARA_AM, 0, 0 },
    { TIS_SARA_E, 0, 0 },
    { 0, 0, TIS_MAI_THO },
    { TIS_NO_NU, 0, 0 },
    { TIS_KO_KAI, TIS_SARA_I, TIS_NIKHAHIT },
    { TIS_KO_KAI, TIS_SARA_UEE, TIS_MAITAIKHU },
    { 0, 0, 0 }
};
static const struct thcell_t test_ans_decomp_am[] = {
    { TIS_NO_NU, TIS_SARA_AM, TIS_MAI_THO },
    { TIS_NO_NU, TIS_SARA_AM, 0 },
    { 0, TIS_SARA_AM, 0 },
    { TIS_KO_KAI, TIS_SARA_II, TIS_MAI_EK },
    { TIS_KO_KAI, 0, TIS_MAI_EK },
    { 0, TIS_SARA_II, 0 },
    { TIS_KO_KAI, TIS_SARA_U, TIS_MAI_EK },
    { TIS_KO_KAI, 0, TIS_MAI_EK },
    { 0, TIS_SARA_U, 0 },
    { TIS_KO_KAI, TIS_SARA_U, TIS_THANTHAKHAT },
    { TIS_KO_KAI, 0, TIS_THANTHAKHAT },
    { 0, TIS_SARA_U, 0 },
    { TIS_KO_KAI, TIS_SARA_I, TIS_THANTHAKHAT },
    { TIS_KO_KAI, 0, TIS_THANTHAKHAT },
    { 0, TIS_SARA_I, 0 },
    { TIS_SARA_E, 0, 0 },
    { 0, TIS_SARA_I, 0 },
    { TIS_SARA_E, 0, 0 },
    { 0, TIS_SARA_AM, 0 },
    { TIS_SARA_E, 0, 0 },
    { 0, 0, TIS_MAI_THO },
    { TIS_NO_NU, 0, 0 },
    { TIS_KO_KAI, TIS_SARA_I, TIS_NIKHAHIT },
    { TIS_KO_KAI, TIS_SARA_UEE, TIS_MAITAIKHU },
    { 0, 0, 0 }
};

int test_th_next_cell()
{
    int   err_no = 0;
    const thchar_t *s;
    int   len;
    const struct thcell_t *pCell;

    fprintf(stderr, "testing th_next_cell() without decomposing SARA AM...\n");
    pCell = test_ans_nodecomp_am;
    s = test_msg;
    len = strlen((const char *)test_msg);
    while (*s) {
        struct thcell_t aCell;
        size_t nChars;

        nChars = th_next_cell(s, len, &aCell, 0);
        s += nChars; len -= nChars;
        if (aCell.base != pCell->base ||
            aCell.hilo != pCell->hilo ||
            aCell.top  != pCell->top)
        {
            fprintf(stderr, "(%c,%c,%c) != (%c,%c,%c)\n",
                    aCell.base, aCell.hilo, aCell.top,
                    pCell->base, pCell->hilo, pCell->top);
            ++err_no;
        }
        if (pCell->base || pCell->hilo || pCell->top)
            ++pCell;
    }

    fprintf(stderr, "testing th_next_cell() decomposing SARA AM...\n");
    s = test_msg;
    len = strlen((const char *)test_msg);
    pCell = test_ans_decomp_am;
    while (*s) {
        struct thcell_t aCell;
        size_t nChars;

        nChars = th_next_cell(s, len, &aCell, 1);
        s += nChars; len -= nChars;
        if (aCell.base != pCell->base ||
            aCell.hilo != pCell->hilo ||
            aCell.top  != pCell->top)
        {
            fprintf(stderr, "(%c,%c,%c) != (%c,%c,%c)\n",
                    aCell.base, aCell.hilo, aCell.top,
                    pCell->base, pCell->hilo, pCell->top);
            ++err_no;
        }
        if (pCell->base || pCell->hilo || pCell->top)
            ++pCell;
    }

    return err_no;
}

int test_th_prev_cell()
{
    int   err_no = 0;
    const thchar_t *s;
    int   pos;
    const struct thcell_t *pCell;

    fprintf(stderr, "testing th_prev_cell() without decomposing SARA AM...\n");
    pCell = test_ans_nodecomp_am +
            (sizeof test_ans_nodecomp_am)/(sizeof test_ans_nodecomp_am[0]) - 2;
    s = test_msg;
    pos = strlen((const char *)test_msg);
    while (pos > 0) {
        struct thcell_t aCell;

        pos -= th_prev_cell(s, pos, &aCell, 0);
        if (aCell.base != pCell->base ||
            aCell.hilo != pCell->hilo ||
            aCell.top  != pCell->top)
        {
            fprintf(stderr, "(%c,%c,%c) != (%c,%c,%c)\n",
                    aCell.base, aCell.hilo, aCell.top,
                    pCell->base, pCell->hilo, pCell->top);
            ++err_no;
        }
        if (pCell > test_ans_nodecomp_am)
            --pCell;
    }

    fprintf(stderr, "testing th_prev_cell() decomposing SARA AM...\n");
    pCell = test_ans_decomp_am +
            (sizeof test_ans_decomp_am)/(sizeof test_ans_decomp_am[0]) - 2;
    s = test_msg;
    pos = strlen((const char *)test_msg);
    while (pos > 0) {
        struct thcell_t aCell;

        pos -= th_prev_cell(s, pos, &aCell, 1);
        if (aCell.base != pCell->base ||
            aCell.hilo != pCell->hilo ||
            aCell.top  != pCell->top)
        {
            fprintf(stderr, "(%c,%c,%c) != (%c,%c,%c)\n",
                    aCell.base, aCell.hilo, aCell.top,
                    pCell->base, pCell->hilo, pCell->top);
            ++err_no;
        }
        if (pCell > test_ans_decomp_am)
            --pCell;
    }

    return err_no;
}

#define TESTCELLS 10

int test_th_make_cells()
{
    int err_no = 0;
    struct thcell_t *cells;
    const thchar_t *s;
    int   len;
    const struct thcell_t *pCell;

    cells = (struct thcell_t *) malloc(TESTCELLS * sizeof(struct thcell_t));

    fprintf(stderr, "testing th_make_cells() without decomposing SARA AM...\n");
    pCell = test_ans_nodecomp_am;
    s = test_msg;
    len = strlen((const char *)test_msg);

    while (*s) {
        size_t nCells = TESTCELLS;
        size_t i;
        size_t nChars = th_make_cells(s, len, cells, &nCells, 0);
        s += nChars; len -= nChars;
        for (i = 0; i < nCells; ++i) {
            if (cells[i].base != pCell->base ||
                cells[i].hilo != pCell->hilo ||
                cells[i].top  != pCell->top)
            {
                fprintf(stderr, "(%c,%c,%c) != (%c,%c,%c)\n",
                        cells[i].base, cells[i].hilo, cells[i].top,
                        pCell->base, pCell->hilo, pCell->top);
                ++err_no;
            }
            if (pCell->base || pCell->hilo || pCell->top)
                ++pCell;
        }
    }

    fprintf(stderr, "testing th_make_cells() decomposing SARA AM...\n");
    pCell = test_ans_decomp_am;
    s = test_msg;
    len = strlen((const char *)test_msg);

    while (*s) {
        size_t nCells = TESTCELLS;
        size_t i;
        size_t nChars = th_make_cells(s, len, cells, &nCells, 1);
        s += nChars; len -= nChars;
        for (i = 0; i < nCells; ++i) {
            if (cells[i].base != pCell->base ||
                cells[i].hilo != pCell->hilo ||
                cells[i].top  != pCell->top)
            {
                fprintf(stderr, "(%c,%c,%c) != (%c,%c,%c)\n",
                        cells[i].base, cells[i].hilo, cells[i].top,
                        pCell->base, pCell->hilo, pCell->top);
                ++err_no;
            }
            if (pCell->base || pCell->hilo || pCell->top)
                ++pCell;
        }
    }

    free(cells);

    return err_no;
}

int main()
{
    int err_no = 0;

    err_no += test_th_next_cell();
    err_no += test_th_prev_cell();
    err_no += test_th_make_cells();

    return err_no;
}