extensions/spellcheck/hunspell/src/suggestmgr.hxx@8bccb770b82d (annotated)
extensions/spellcheck/hunspell/src/suggestmgr.hxx
Wed, 31 Dec 2014 13:27:57 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Wed, 31 Dec 2014 13:27:57 +0100
- branch
- TOR_BUG_3246
- changeset 6
- 8bccb770b82d
- permissions
- -rw-r--r--
Ignore runtime configuration files generated during quality assurance.
| michael@0 | 1 | /******* BEGIN LICENSE BLOCK ******* |
| michael@0 | 2 | * Version: MPL 1.1/GPL 2.0/LGPL 2.1 |
| michael@0 | 3 | * |
| michael@0 | 4 | * The contents of this file are subject to the Mozilla Public License Version |
| michael@0 | 5 | * 1.1 (the "License"); you may not use this file except in compliance with |
| michael@0 | 6 | * the License. You may obtain a copy of the License at |
| michael@0 | 7 | * http://www.mozilla.org/MPL/ |
| michael@0 | 8 | * |
| michael@0 | 9 | * Software distributed under the License is distributed on an "AS IS" basis, |
| michael@0 | 10 | * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License |
| michael@0 | 11 | * for the specific language governing rights and limitations under the |
| michael@0 | 12 | * License. |
| michael@0 | 13 | * |
| michael@0 | 14 | * The Initial Developers of the Original Code are Kevin Hendricks (MySpell) |
| michael@0 | 15 | * and László Németh (Hunspell). Portions created by the Initial Developers |
| michael@0 | 16 | * are Copyright (C) 2002-2005 the Initial Developers. All Rights Reserved. |
| michael@0 | 17 | * |
| michael@0 | 18 | * Contributor(s): Kevin Hendricks (kevin.hendricks@sympatico.ca) |
| michael@0 | 19 | * David Einstein (deinst@world.std.com) |
| michael@0 | 20 | * László Németh (nemethl@gyorsposta.hu) |
| michael@0 | 21 | * Caolan McNamara (caolanm@redhat.com) |
| michael@0 | 22 | * Davide Prina |
| michael@0 | 23 | * Giuseppe Modugno |
| michael@0 | 24 | * Gianluca Turconi |
| michael@0 | 25 | * Simon Brouwer |
| michael@0 | 26 | * Noll Janos |
| michael@0 | 27 | * Biro Arpad |
| michael@0 | 28 | * Goldman Eleonora |
| michael@0 | 29 | * Sarlos Tamas |
| michael@0 | 30 | * Bencsath Boldizsar |
| michael@0 | 31 | * Halacsy Peter |
| michael@0 | 32 | * Dvornik Laszlo |
| michael@0 | 33 | * Gefferth Andras |
| michael@0 | 34 | * Nagy Viktor |
| michael@0 | 35 | * Varga Daniel |
| michael@0 | 36 | * Chris Halls |
| michael@0 | 37 | * Rene Engelhard |
| michael@0 | 38 | * Bram Moolenaar |
| michael@0 | 39 | * Dafydd Jones |
| michael@0 | 40 | * Harri Pitkanen |
| michael@0 | 41 | * Andras Timar |
| michael@0 | 42 | * Tor Lillqvist |
| michael@0 | 43 | * |
| michael@0 | 44 | * Alternatively, the contents of this file may be used under the terms of |
| michael@0 | 45 | * either the GNU General Public License Version 2 or later (the "GPL"), or |
| michael@0 | 46 | * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), |
| michael@0 | 47 | * in which case the provisions of the GPL or the LGPL are applicable instead |
| michael@0 | 48 | * of those above. If you wish to allow use of your version of this file only |
| michael@0 | 49 | * under the terms of either the GPL or the LGPL, and not to allow others to |
| michael@0 | 50 | * use your version of this file under the terms of the MPL, indicate your |
| michael@0 | 51 | * decision by deleting the provisions above and replace them with the notice |
| michael@0 | 52 | * and other provisions required by the GPL or the LGPL. If you do not delete |
| michael@0 | 53 | * the provisions above, a recipient may use your version of this file under |
| michael@0 | 54 | * the terms of any one of the MPL, the GPL or the LGPL. |
| michael@0 | 55 | * |
| michael@0 | 56 | ******* END LICENSE BLOCK *******/ |
| michael@0 | 57 | |
| michael@0 | 58 | #ifndef _SUGGESTMGR_HXX_ |
| michael@0 | 59 | #define _SUGGESTMGR_HXX_ |
| michael@0 | 60 | |
| michael@0 | 61 | #define MAXSWL 100 |
| michael@0 | 62 | #define MAXSWUTF8L (MAXSWL * 4) |
| michael@0 | 63 | #define MAX_ROOTS 100 |
| michael@0 | 64 | #define MAX_WORDS 100 |
| michael@0 | 65 | #define MAX_GUESS 200 |
| michael@0 | 66 | #define MAXNGRAMSUGS 4 |
| michael@0 | 67 | #define MAXPHONSUGS 2 |
| michael@0 | 68 | #define MAXCOMPOUNDSUGS 3 |
| michael@0 | 69 | |
| michael@0 | 70 | // timelimit: max ~1/4 sec (process time on Linux) for a time consuming function |
| michael@0 | 71 | #define TIMELIMIT (CLOCKS_PER_SEC >> 2) |
| michael@0 | 72 | #define MINTIMER 100 |
| michael@0 | 73 | #define MAXPLUSTIMER 100 |
| michael@0 | 74 | |
| michael@0 | 75 | #define NGRAM_LONGER_WORSE (1 << 0) |
| michael@0 | 76 | #define NGRAM_ANY_MISMATCH (1 << 1) |
| michael@0 | 77 | #define NGRAM_LOWERING (1 << 2) |
| michael@0 | 78 | #define NGRAM_WEIGHTED (1 << 3) |
| michael@0 | 79 | |
| michael@0 | 80 | #include "hunvisapi.h" |
| michael@0 | 81 | |
| michael@0 | 82 | #include "atypes.hxx" |
| michael@0 | 83 | #include "affixmgr.hxx" |
| michael@0 | 84 | #include "hashmgr.hxx" |
| michael@0 | 85 | #include "langnum.hxx" |
| michael@0 | 86 | #include <time.h> |
| michael@0 | 87 | |
| michael@0 | 88 | enum { LCS_UP, LCS_LEFT, LCS_UPLEFT }; |
| michael@0 | 89 | |
| michael@0 | 90 | class LIBHUNSPELL_DLL_EXPORTED SuggestMgr |
| michael@0 | 91 | { |
| michael@0 | 92 | char * ckey; |
| michael@0 | 93 | int ckeyl; |
| michael@0 | 94 | w_char * ckey_utf; |
| michael@0 | 95 | |
| michael@0 | 96 | char * ctry; |
| michael@0 | 97 | int ctryl; |
| michael@0 | 98 | w_char * ctry_utf; |
| michael@0 | 99 | |
| michael@0 | 100 | AffixMgr* pAMgr; |
| michael@0 | 101 | int maxSug; |
| michael@0 | 102 | struct cs_info * csconv; |
| michael@0 | 103 | int utf8; |
| michael@0 | 104 | int langnum; |
| michael@0 | 105 | int nosplitsugs; |
| michael@0 | 106 | int maxngramsugs; |
| michael@0 | 107 | int maxcpdsugs; |
| michael@0 | 108 | int complexprefixes; |
| michael@0 | 109 | |
| michael@0 | 110 | |
| michael@0 | 111 | public: |
| michael@0 | 112 | SuggestMgr(const char * tryme, int maxn, AffixMgr *aptr); |
| michael@0 | 113 | ~SuggestMgr(); |
| michael@0 | 114 | |
| michael@0 | 115 | int suggest(char*** slst, const char * word, int nsug, int * onlycmpdsug); |
| michael@0 | 116 | int ngsuggest(char ** wlst, char * word, int ns, HashMgr** pHMgr, int md); |
| michael@0 | 117 | int suggest_auto(char*** slst, const char * word, int nsug); |
| michael@0 | 118 | int suggest_stems(char*** slst, const char * word, int nsug); |
| michael@0 | 119 | int suggest_pos_stems(char*** slst, const char * word, int nsug); |
| michael@0 | 120 | |
| michael@0 | 121 | char * suggest_morph(const char * word); |
| michael@0 | 122 | char * suggest_gen(char ** pl, int pln, char * pattern); |
| michael@0 | 123 | char * suggest_morph_for_spelling_error(const char * word); |
| michael@0 | 124 | |
| michael@0 | 125 | private: |
| michael@0 | 126 | int testsug(char** wlst, const char * candidate, int wl, int ns, int cpdsuggest, |
| michael@0 | 127 | int * timer, clock_t * timelimit); |
| michael@0 | 128 | int checkword(const char *, int, int, int *, clock_t *); |
| michael@0 | 129 | int check_forbidden(const char *, int); |
| michael@0 | 130 | |
| michael@0 | 131 | int capchars(char **, const char *, int, int); |
| michael@0 | 132 | int replchars(char**, const char *, int, int); |
| michael@0 | 133 | int doubletwochars(char**, const char *, int, int); |
| michael@0 | 134 | int forgotchar(char **, const char *, int, int); |
| michael@0 | 135 | int swapchar(char **, const char *, int, int); |
| michael@0 | 136 | int longswapchar(char **, const char *, int, int); |
| michael@0 | 137 | int movechar(char **, const char *, int, int); |
| michael@0 | 138 | int extrachar(char **, const char *, int, int); |
| michael@0 | 139 | int badcharkey(char **, const char *, int, int); |
| michael@0 | 140 | int badchar(char **, const char *, int, int); |
| michael@0 | 141 | int twowords(char **, const char *, int, int); |
| michael@0 | 142 | int fixstems(char **, const char *, int); |
| michael@0 | 143 | |
| michael@0 | 144 | int capchars_utf(char **, const w_char *, int wl, int, int); |
| michael@0 | 145 | int doubletwochars_utf(char**, const w_char *, int wl, int, int); |
| michael@0 | 146 | int forgotchar_utf(char**, const w_char *, int wl, int, int); |
| michael@0 | 147 | int extrachar_utf(char**, const w_char *, int wl, int, int); |
| michael@0 | 148 | int badcharkey_utf(char **, const w_char *, int wl, int, int); |
| michael@0 | 149 | int badchar_utf(char **, const w_char *, int wl, int, int); |
| michael@0 | 150 | int swapchar_utf(char **, const w_char *, int wl, int, int); |
| michael@0 | 151 | int longswapchar_utf(char **, const w_char *, int, int, int); |
| michael@0 | 152 | int movechar_utf(char **, const w_char *, int, int, int); |
| michael@0 | 153 | |
| michael@0 | 154 | int mapchars(char**, const char *, int, int); |
| michael@0 | 155 | int map_related(const char *, char *, int, int, char ** wlst, int, int, const mapentry*, int, int *, clock_t *); |
| michael@0 | 156 | int ngram(int n, char * s1, const char * s2, int opt); |
| michael@0 | 157 | int mystrlen(const char * word); |
| michael@0 | 158 | int leftcommonsubstring(char * s1, const char * s2); |
| michael@0 | 159 | int commoncharacterpositions(char * s1, const char * s2, int * is_swap); |
| michael@0 | 160 | void bubblesort( char ** rwd, char ** rwd2, int * rsc, int n); |
| michael@0 | 161 | void lcs(const char * s, const char * s2, int * l1, int * l2, char ** result); |
| michael@0 | 162 | int lcslen(const char * s, const char* s2); |
| michael@0 | 163 | char * suggest_hentry_gen(hentry * rv, char * pattern); |
| michael@0 | 164 | |
| michael@0 | 165 | }; |
| michael@0 | 166 | |
| michael@0 | 167 | #endif |
| michael@0 | 168 |
