michael@0: /******* BEGIN LICENSE BLOCK *******
michael@0:  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
michael@0:  * 
michael@0:  * The contents of this file are subject to the Mozilla Public License Version
michael@0:  * 1.1 (the "License"); you may not use this file except in compliance with
michael@0:  * the License. You may obtain a copy of the License at
michael@0:  * http://www.mozilla.org/MPL/
michael@0:  * 
michael@0:  * Software distributed under the License is distributed on an "AS IS" basis,
michael@0:  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
michael@0:  * for the specific language governing rights and limitations under the
michael@0:  * License.
michael@0:  * 
michael@0:  * The Initial Developers of the Original Code are Kevin Hendricks (MySpell)
michael@0:  * and László Németh (Hunspell). Portions created by the Initial Developers
michael@0:  * are Copyright (C) 2002-2005 the Initial Developers. All Rights Reserved.
michael@0:  * 
michael@0:  * Contributor(s): László Németh (nemethl@gyorsposta.hu)
michael@0:  *                 Caolan McNamara (caolanm@redhat.com)
michael@0:  * 
michael@0:  * Alternatively, the contents of this file may be used under the terms of
michael@0:  * either the GNU General Public License Version 2 or later (the "GPL"), or
michael@0:  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
michael@0:  * in which case the provisions of the GPL or the LGPL are applicable instead
michael@0:  * of those above. If you wish to allow use of your version of this file only
michael@0:  * under the terms of either the GPL or the LGPL, and not to allow others to
michael@0:  * use your version of this file under the terms of the MPL, indicate your
michael@0:  * decision by deleting the provisions above and replace them with the notice
michael@0:  * and other provisions required by the GPL or the LGPL. If you do not delete
michael@0:  * the provisions above, a recipient may use your version of this file under
michael@0:  * the terms of any one of the MPL, the GPL or the LGPL.
michael@0:  *
michael@0:  ******* END LICENSE BLOCK *******/
michael@0: 
michael@0: #include <stdlib.h>
michael@0: #include <string.h>
michael@0: #include <stdio.h>
michael@0: 
michael@0: #include "replist.hxx"
michael@0: #include "csutil.hxx"
michael@0: 
michael@0: RepList::RepList(int n) {
michael@0:     dat = (replentry **) malloc(sizeof(replentry *) * n);
michael@0:     if (dat == 0) size = 0; else size = n;
michael@0:     pos = 0;
michael@0: }
michael@0: 
michael@0: RepList::~RepList()
michael@0: {
michael@0:     for (int i = 0; i < pos; i++) {
michael@0:         free(dat[i]->pattern);
michael@0:         free(dat[i]->pattern2);
michael@0:         free(dat[i]);
michael@0:     }
michael@0:     free(dat);
michael@0: }
michael@0: 
michael@0: int RepList::get_pos() {
michael@0:     return pos;
michael@0: }
michael@0: 
michael@0: replentry * RepList::item(int n) {
michael@0:     return dat[n];
michael@0: }
michael@0: 
michael@0: int RepList::near(const char * word) {
michael@0:     int p1 = 0;
michael@0:     int p2 = pos;
michael@0:     while ((p2 - p1) > 1) {
michael@0:       int m = (p1 + p2) / 2;
michael@0:       int c = strcmp(word, dat[m]->pattern);
michael@0:       if (c <= 0) {
michael@0:         if (c < 0) p2 = m; else p1 = p2 = m;
michael@0:       } else p1 = m;
michael@0:     }
michael@0:     return p1;
michael@0: }
michael@0: 
michael@0: int RepList::match(const char * word, int n) {
michael@0:     if (strncmp(word, dat[n]->pattern, strlen(dat[n]->pattern)) == 0) return strlen(dat[n]->pattern);
michael@0:     return 0;
michael@0: }
michael@0: 
michael@0: int RepList::add(char * pat1, char * pat2) {
michael@0:     if (pos >= size || pat1 == NULL || pat2 == NULL) return 1;
michael@0:     replentry * r = (replentry *) malloc(sizeof(replentry));
michael@0:     if (r == NULL) return 1;
michael@0:     r->pattern = mystrrep(pat1, "_", " ");
michael@0:     r->pattern2 = mystrrep(pat2, "_", " ");
michael@0:     r->start = false;
michael@0:     r->end = false;
michael@0:     dat[pos++] = r;
michael@0:     for (int i = pos - 1; i > 0; i--) {
michael@0:       r = dat[i];
michael@0:       if (strcmp(r->pattern, dat[i - 1]->pattern) < 0) {
michael@0:           dat[i] = dat[i - 1];
michael@0:           dat[i - 1] = r;
michael@0:       } else break;
michael@0:     }
michael@0:     return 0;
michael@0: }
michael@0: 
michael@0: int RepList::conv(const char * word, char * dest) {
michael@0:     int stl = 0;
michael@0:     int change = 0;
michael@0:     for (size_t i = 0; i < strlen(word); i++) {
michael@0:         int n = near(word + i);
michael@0:         int l = match(word + i, n);
michael@0:         if (l) {
michael@0:           strcpy(dest + stl, dat[n]->pattern2);
michael@0:           stl += strlen(dat[n]->pattern2);
michael@0:           i += l - 1;
michael@0:           change = 1;
michael@0:         } else dest[stl++] = word[i];
michael@0:     }
michael@0:     dest[stl] = '\0';
michael@0:     return change;
michael@0: }