Page MenuHomePhabricator (Chris)
Files F117233

No OneTemporary
Actions

Authored By
Unknown
Size
3 KB
Referenced Files
None
Subscribers
None

View Options

diff --git a/src/HyphenationRule.cpp b/src/HyphenationRule.cpp
index 0018abf..e203f42 100644
--- a/src/HyphenationRule.cpp
+++ b/src/HyphenationRule.cpp
@@ -1,107 +1,108 @@
/* libhyphenate: A TeX-like hyphenation algorithm.
* Copyright (C) 2007 Steve Wolter
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* If you have any questions, feel free to contact me:
* http://swolter.sdf1.org
**/
/* This source file provides code for the HyphenationRule class which
* is documented in HyphenationRule.h */
#include "HyphenationRule.h"
+#include <string.h>
using namespace std;
Hyphenate::HyphenationRule::HyphenationRule(std::string dpattern)
: del_pre(0), skip_post(0)
{
int priority = 0;
unsigned int i;
for (i = 0; i < dpattern.size() && dpattern[i] != '/'; i++)
if (dpattern[i] >= '0' && dpattern[i] <= '9')
priority = 10 * priority + dpattern[i] - '0';
else {
key += dpattern[i];
priorities.push_back(priority);
priority = 0;
}
/* Complete and simplify the array. */
priorities.push_back(priority);
while (priorities.back() == 0) priorities.pop_back();
/* Now check for nonstandard hyphenation. First, parse it. */
if (i < dpattern.size() && dpattern[i] == '/') {
i += 1; /* Ignore the /. */
int field = 1;
unsigned int start = 0, cut = 0;
for (; i < dpattern.size(); i++) {
if (field == 1 && dpattern[i] == '=')
field++;
else if (field >= 2 && field <= 3 && dpattern[i] == ',')
field++;
else if (field == 4 && (dpattern[i] < '0' || dpattern[i] > '9'))
break;
else if (field == 1)
insert_pre += dpattern[i];
else if (field == 2)
insert_post += dpattern[i];
else if (field == 3)
start = start * 10 + dpattern[i] - '0';
else if (field == 4)
cut = cut * 10 + dpattern[i] - '0';
}
if (field < 4) /* There was no fourth field */
cut = key.size() - start;
if (field < 3)
start = 1;
skip_post = cut;
for (unsigned int j = start; j < start + cut && j < priorities.size(); j++) {
if (priorities[j - 1] % 2 == 1) break;
del_pre++; skip_post--;
}
}
}
int Hyphenate::HyphenationRule::apply(string& word, const string &hyph) const
{
apply_first(word, hyph);
return apply_second(word);
}
void Hyphenate::HyphenationRule::apply_first(string& word, const string &hyph)
const
{
if (del_pre > 0) word.erase(word.size() - del_pre);
word += insert_pre;
word += hyph;
}
int Hyphenate::HyphenationRule::apply_second(string& word) const
{
word += insert_post;
return skip_post;
}
auto_ptr<char> Hyphenate::HyphenationRule::replacement_string() const {
string s = (insert_pre + "=" + insert_post);
char *r = (char *)malloc((s.size() + 1) * sizeof(char));
strcpy(r, s.c_str());
return auto_ptr<char>(r);
}

File Metadata

Mime Type
text/x-diff
Expires
Mon, May 11, 9:40 PM (4 d, 17 h ago)
Storage Engine
blob
Storage Format
Raw Data
Storage Handle
62874
Default Alt Text
(3 KB)

Event Timeline