[transliteration] Using revisit strings instead of keeping a backtrack count so we don't have to later map logical characters to the actual string, removing any duplicate keys in the table builder so that if any rules happen to overlap within a step, the first will take precedence

This commit is contained in:
Al
2015-05-29 16:53:28 -04:00
parent a9d5b91ac0
commit a278cfd12c
5 changed files with 6801 additions and 6763 deletions

View File

@@ -29,7 +29,8 @@ typedef struct transliteration_rule_source {
char *replacement;
size_t replacement_len;
int move;
char *revisit;
size_t revisit_len;
char *group_regex_str;
size_t group_regex_len;