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
|
/* Copyright (C) 2011-2012 G.P. Halkes
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License version 3, as
published by the Free Software Foundation.
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 <http://www.gnu.org/licenses/>.
*/
#include <algorithm>
#include <cstring>
#include <transcript/transcript.h>
#include "ucm2ltc.h"
Variant::Variant(Ucm *_base, const char *_id, bool internal) : base(_base) {
char normalized_id_buffer[161];
size_t len;
while (strpbrk(_id, DIRSEPS) != NULL) _id = strpbrk(_id, DIRSEPS) + 1;
id = safe_strdup(_id);
len = strlen(id);
if (len < 4 || strcmp(id + len - 4, ".ucm") == 0) {
len -= 4;
id[len] = 0;
}
transcript_normalize_name(id, normalized_id_buffer, sizeof(normalized_id_buffer));
if (strlen(normalized_id_buffer) > 159) fatal("%s: Variant name %s too long\n", file_name, id);
normalized_id = safe_strdup(normalized_id_buffer);
flags = (base->flags & Ucm::INTERNAL_TABLE);
if (internal) flags |= Ucm::INTERNAL_TABLE;
}
int Variant::check_codepage_bytes(vector<uint8_t> &bytes) {
return base->check_codepage_bytes(bytes);
}
const char *Variant::get_tag_value(tag_t tag) { return base->get_tag_value(tag); }
void Variant::sort_simple_mappings(void) {
uint16_t *indices;
sort(simple_mappings.begin(), simple_mappings.end(), compare_codepage_bytes);
for (size_t idx = 0; idx < simple_mappings.size(); idx++) simple_mappings[idx]->idx = idx;
sort(simple_mappings.begin(), simple_mappings.end(), compare_codepoints);
indices = (uint16_t *)safe_malloc(sizeof(uint16_t) * simple_mappings.size());
for (size_t idx = 0; idx < simple_mappings.size(); idx++)
indices[simple_mappings[idx]->idx] = idx;
for (size_t idx = 0; idx < simple_mappings.size(); idx++)
simple_mappings[idx]->idx = indices[idx];
free(indices);
}
void Variant::dump(void) {
sort(simple_mappings.begin(), simple_mappings.end(), compare_codepoints);
sort(multi_mappings.begin(), multi_mappings.end(), compare_codepoints);
printf("VARIANT %s\"%s\"\n", flags & Ucm::INTERNAL_TABLE ? "INTERNAL " : "", id);
for (vector<Mapping *>::const_iterator iter = simple_mappings.begin();
iter != simple_mappings.end(); iter++)
printf("%s %s |%d\n", sprint_codepoints((*iter)->codepoints),
sprint_sequence((*iter)->codepage_bytes), (*iter)->precision);
for (vector<Mapping *>::const_iterator iter = multi_mappings.begin();
iter != multi_mappings.end(); iter++)
printf("%s %s |%d\n", sprint_codepoints((*iter)->codepoints),
sprint_sequence((*iter)->codepage_bytes), (*iter)->precision);
printf("END VARIANT\n");
}
|
