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
|
#include "hyphenator.hh"
#include "../lout/misc.hh"
#include <stdio.h>
#include <string.h>
#define LEN 1000
/*
* This is a direct translation of the Python implementation by Ned
* Batchelder.
*/
using namespace lout::object;
using namespace lout::container::typed;
namespace dw {
HashTable <TypedPair <TypedPointer <core::Platform>, ConstString>,
Hyphenator> *Hyphenator::hyphenators =
new HashTable <TypedPair <TypedPointer <core::Platform>, ConstString>,
Hyphenator> (true, true);
Hyphenator::Hyphenator (core::Platform *platform, const char *filename)
{
this->platform = platform;
tree = new HashTable <Integer, Collection <Integer> > (true, true);
FILE *file = fopen (filename, "r");
// TODO Error handling
while (!feof (file)) {
char buf[LEN + 1];
char *s = fgets (buf, LEN, file);
if (s) {
int l = strlen (s);
if (s[l - 1] == '\n')
s[l - 1] = 0;
insertPattern (s);
}
}
fclose (file);
}
Hyphenator::~Hyphenator ()
{
delete tree;
}
Hyphenator *Hyphenator::getHyphenator (core::Platform *platform,
const char *language)
{
// TODO Not very efficient. Other key than TypedPair?
// (Keeping the parts of the pair on the stack does not help, since
// ~TypedPair deletes them, so they have to be kept on the heap.)
TypedPair <TypedPointer <core::Platform>, ConstString> *pair =
new TypedPair <TypedPointer <core::Platform>,
ConstString> (new TypedPointer <core::Platform> (platform),
new ConstString (language));
Hyphenator *hyphenator = hyphenators->get (pair);
if (hyphenator)
delete pair;
else
{
// TODO Much hard-coded!
char filename [256];
sprintf (filename, "/usr/local/lib/dillo/hyphenation/%s.pat", language);
//printf ("Loading hyphenation patterns '%s' ...\n", filename);
hyphenator = new Hyphenator (platform, filename);
hyphenators->put (pair, hyphenator);
}
return hyphenator;
}
void Hyphenator::insertPattern (char *s)
{
// Convert the a pattern like 'a1bc3d4' into a string of chars 'abcd'
// and a list of points [ 0, 1, 0, 3, 4 ].
int l = strlen (s);
char chars [l + 1];
Vector <Integer> *points = new Vector <Integer> (1, true);
// TODO numbers consisting of multiple digits?
// TODO Encoding: This implementation works exactly like the Python
// implementation, based on UTF-8. Does this always work?
int numChars = 0;
for (int i = 0; s[i]; i++)
if (s[i] >= '0' && s[i] <= '9')
points->put (new Integer (s[i] - '0'), numChars);
else
chars[numChars++] = s[i];
chars[numChars] = 0;
for (int i = 0; i < numChars + 1; i++) {
Integer *val = points->get (i);
if (val == NULL)
points->put (new Integer (0), i);
}
// Insert the pattern into the tree. Each character finds a dict
// another level down in the tree, and leaf nodes have the list of
// points.
HashTable <Integer, Collection <Integer> > *t = tree;
for (int i = 0; chars[i]; i++) {
Integer c (chars[i]);
if (!t->contains(&c))
t->put (new Integer (chars[i]),
new HashTable <Integer, Collection <Integer> > (true, true));
t = (HashTable <Integer, Collection <Integer> >*) t->get (&c);
}
t->put (new Integer (0), points);
}
/**
* Given a word, returns a list of pieces, broken at the possible
* hyphenation points.
*/
Vector <String> *Hyphenator::hyphenateWord(const char *word)
{
Vector <String> *pieces = new Vector <String> (1, true);
// Short words aren't hyphenated.
if (strlen (word) <= 4) { // TODO UTF-8?
pieces->put (new String (word));
return pieces;
}
// If the word is an exception, get the stored points.
// TODO
char work[strlen (word) + 3];
strcpy (work, ".");
char *wordLc = platform->textToLower (word, strlen (word));
strcat (work, wordLc);
delete wordLc;
strcat (work, ".");
int l = strlen (work);
Vector <Integer> points (l + 1, true);
for (int i = 0; i < l + 1; i++)
points.put (new Integer (0), i);
Integer null (0);
for (int i = 0; i < l; i++) {
HashTable <Integer, Collection <Integer> > *t = tree;
for (int j = i; j < l; j++) {
Integer c (work[j]);
if (t->contains (&c)) {
t = (HashTable <Integer, Collection <Integer> >*) t->get (&c);
if (t->contains (&null)) {
Vector <Integer> *p = (Vector <Integer>*) t->get (&null);
for (int k = 0; k < p->size (); k++) {
Integer *v1 = points.get (i + k);
Integer *v2 = p->get (k);
// TODO Not very efficient, especially here: too much
// calls of "new"
points.put(new Integer (lout::misc::max (v1->getValue (),
v2->getValue ())),
i + k);
}
}
} else
break;
}
}
// No hyphens in the first two chars or the last two.
points.put (new Integer (0), 1);
points.put (new Integer (0), 2);
points.put (new Integer (0), points.size () - 2);
points.put (new Integer (0), points.size () - 3);
// Examine the points to build the pieces list.
char temp[strlen (word) + 1], *ptemp = temp;
int n = lout::misc::min ((int)strlen (word), points.size () - 2);
for (int i = 0; i < n; i++) {
char c = word[i];
int p = points.get(i + 2)->getValue ();
*(ptemp++) = c;
if (p % 2) {
*ptemp = 0;
pieces->put (new String (temp));
ptemp = temp;
}
}
*ptemp = 0;
pieces->put (new String (temp));
return pieces;
}
} // namespace dw
|
