Mercurial > vim
annotate src/spell.c @ 13308:ae312df8d0ab v8.0.1528
patch 8.0.1528: dead code found
commit https://github.com/vim/vim/commit/81226e03102dd00b7cdce0e00775e1e30462f9a6
Author: Bram Moolenaar <Bram@vim.org>
Date: Tue Feb 20 21:44:45 2018 +0100
patch 8.0.1528: dead code found
Problem: Dead code found.
Solution: Remove the useless lines. (CodeAi, closes https://github.com/vim/vim/issues/2656)
| author | Christian Brabandt <cb@256bit.org> |
|---|---|
| date | Tue, 20 Feb 2018 21:45:05 +0100 |
| parents | ac42c4b11dbc |
| children | 69517d67421f |
| rev | line source |
|---|---|
|
10042
4aead6a9b7a9
commit https://github.com/vim/vim/commit/edf3f97ae2af024708ebb4ac614227327033ca47
Christian Brabandt <cb@256bit.org>
parents:
9953
diff
changeset
|
1 /* vi:set ts=8 sts=4 sw=4 noet: |
| 223 | 2 * |
| 3 * VIM - Vi IMproved by Bram Moolenaar | |
| 4 * | |
| 5 * Do ":help uganda" in Vim to read copying and usage conditions. | |
| 6 * Do ":help credits" in Vim to see a list of people who contributed. | |
| 7 * See README.txt for an overview of the Vim source code. | |
| 8 */ | |
| 9 | |
| 10 /* | |
| 11 * spell.c: code for spell checking | |
| 226 | 12 * |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
13 * See spellfile.c for the Vim spell file format. |
|
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
14 * |
| 300 | 15 * The spell checking mechanism uses a tree (aka trie). Each node in the tree |
| 16 * has a list of bytes that can appear (siblings). For each byte there is a | |
| 17 * pointer to the node with the byte that follows in the word (child). | |
| 324 | 18 * |
| 19 * A NUL byte is used where the word may end. The bytes are sorted, so that | |
| 20 * binary searching can be used and the NUL bytes are at the start. The | |
| 21 * number of possible bytes is stored before the list of bytes. | |
| 22 * | |
| 23 * The tree uses two arrays: "byts" stores the characters, "idxs" stores | |
| 24 * either the next index or flags. The tree starts at index 0. For example, | |
| 25 * to lookup "vi" this sequence is followed: | |
| 26 * i = 0 | |
| 27 * len = byts[i] | |
| 28 * n = where "v" appears in byts[i + 1] to byts[i + len] | |
| 29 * i = idxs[n] | |
| 30 * len = byts[i] | |
| 31 * n = where "i" appears in byts[i + 1] to byts[i + len] | |
| 32 * i = idxs[n] | |
| 33 * len = byts[i] | |
| 34 * find that byts[i + 1] is 0, idxs[i + 1] has flags for "vi". | |
| 300 | 35 * |
| 339 | 36 * There are two word trees: one with case-folded words and one with words in |
| 300 | 37 * original case. The second one is only used for keep-case words and is |
| 38 * usually small. | |
| 39 * | |
| 481 | 40 * There is one additional tree for when not all prefixes are applied when |
| 339 | 41 * generating the .spl file. This tree stores all the possible prefixes, as |
| 42 * if they were words. At each word (prefix) end the prefix nr is stored, the | |
| 43 * following word must support this prefix nr. And the condition nr is | |
| 44 * stored, used to lookup the condition that the word must match with. | |
| 45 * | |
| 300 | 46 * Thanks to Olaf Seibert for providing an example implementation of this tree |
| 47 * and the compression mechanism. | |
| 625 | 48 * LZ trie ideas: |
| 49 * http://www.irb.hr/hr/home/ristov/papers/RistovLZtrieRevision1.pdf | |
| 50 * More papers: http://www-igm.univ-mlv.fr/~laporte/publi_en.html | |
| 243 | 51 * |
| 52 * Matching involves checking the caps type: Onecap ALLCAP KeepCap. | |
| 53 * | |
| 236 | 54 * Why doesn't Vim use aspell/ispell/myspell/etc.? |
| 55 * See ":help develop-spell". | |
| 56 */ | |
| 57 | |
| 300 | 58 /* |
| 324 | 59 * Use this to adjust the score after finding suggestions, based on the |
| 60 * suggested word sounding like the bad word. This is much faster than doing | |
| 61 * it for every possible suggestion. | |
| 625 | 62 * Disadvantage: When "the" is typed as "hte" it sounds quite different ("@" |
| 63 * vs "ht") and goes down in the list. | |
| 344 | 64 * Used when 'spellsuggest' is set to "best". |
| 65 */ | |
| 66 #define RESCORE(word_score, sound_score) ((3 * word_score + sound_score) / 4) | |
| 67 | |
| 68 /* | |
| 625 | 69 * Do the opposite: based on a maximum end score and a known sound score, |
| 1705 | 70 * compute the maximum word score that can be used. |
| 625 | 71 */ |
| 72 #define MAXSCORE(word_score, sound_score) ((4 * word_score - sound_score) / 3) | |
| 73 | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
74 #define IN_SPELL_C |
| 223 | 75 #include "vim.h" |
| 76 | |
| 737 | 77 #if defined(FEAT_SPELL) || defined(PROTO) |
| 223 | 78 |
| 625 | 79 #ifndef UNIX /* it's in os_unix.h for Unix */ |
| 80 # include <time.h> /* for time_t */ | |
| 81 #endif | |
| 82 | |
| 633 | 83 /* only used for su_badflags */ |
| 84 #define WF_MIXCAP 0x20 /* mix of upper and lower case: macaRONI */ | |
| 85 | |
| 389 | 86 #define WF_CAPMASK (WF_ONECAP | WF_ALLCAP | WF_KEEPCAP | WF_FIXCAP) |
| 300 | 87 |
| 307 | 88 #define REGION_ALL 0xff /* word valid in all regions */ |
| 89 | |
| 625 | 90 #define VIMSUGMAGIC "VIMsug" /* string at start of Vim .sug file */ |
| 91 #define VIMSUGMAGICL 6 | |
| 92 #define VIMSUGVERSION 1 | |
| 93 | |
| 307 | 94 /* Result values. Lower number is accepted over higher one. */ |
| 95 #define SP_BANNED -1 | |
| 236 | 96 #define SP_OK 0 |
| 307 | 97 #define SP_RARE 1 |
| 98 #define SP_LOCAL 2 | |
| 99 #define SP_BAD 3 | |
| 236 | 100 |
| 625 | 101 typedef struct wordcount_S |
| 102 { | |
| 103 short_u wc_count; /* nr of times word was seen */ | |
| 104 char_u wc_word[1]; /* word, actually longer */ | |
| 105 } wordcount_T; | |
| 106 | |
|
9570
695186e11daa
commit https://github.com/vim/vim/commit/840268400dc8fda62a14f8a084e8b1ea46619454
Christian Brabandt <cb@256bit.org>
parents:
9487
diff
changeset
|
107 #define WC_KEY_OFF offsetof(wordcount_T, wc_word) |
| 625 | 108 #define HI2WC(hi) ((wordcount_T *)((hi)->hi_key - WC_KEY_OFF)) |
| 109 #define MAXWORDCOUNT 0xffff | |
| 110 | |
| 236 | 111 /* |
| 323 | 112 * Information used when looking for suggestions. |
| 113 */ | |
| 114 typedef struct suginfo_S | |
| 115 { | |
| 116 garray_T su_ga; /* suggestions, contains "suggest_T" */ | |
| 344 | 117 int su_maxcount; /* max. number of suggestions displayed */ |
| 323 | 118 int su_maxscore; /* maximum score for adding to su_ga */ |
| 625 | 119 int su_sfmaxscore; /* idem, for when doing soundfold words */ |
| 344 | 120 garray_T su_sga; /* like su_ga, sound-folded scoring */ |
| 323 | 121 char_u *su_badptr; /* start of bad word in line */ |
| 122 int su_badlen; /* length of detected bad word in line */ | |
| 346 | 123 int su_badflags; /* caps flags for bad word */ |
| 323 | 124 char_u su_badword[MAXWLEN]; /* bad word truncated at su_badlen */ |
| 125 char_u su_fbadword[MAXWLEN]; /* su_badword case-folded */ | |
| 534 | 126 char_u su_sal_badword[MAXWLEN]; /* su_badword soundfolded */ |
| 323 | 127 hashtab_T su_banned; /* table with banned words */ |
| 503 | 128 slang_T *su_sallang; /* default language for sound folding */ |
| 323 | 129 } suginfo_T; |
| 130 | |
| 131 /* One word suggestion. Used in "si_ga". */ | |
| 132 typedef struct suggest_S | |
| 133 { | |
| 134 char_u *st_word; /* suggested word, allocated string */ | |
| 625 | 135 int st_wordlen; /* STRLEN(st_word) */ |
| 323 | 136 int st_orglen; /* length of replaced text */ |
| 137 int st_score; /* lower is better */ | |
| 344 | 138 int st_altscore; /* used when st_score compares equal */ |
| 139 int st_salscore; /* st_score is for soundalike */ | |
| 324 | 140 int st_had_bonus; /* bonus already included in score */ |
| 503 | 141 slang_T *st_slang; /* language used for sound folding */ |
| 323 | 142 } suggest_T; |
| 143 | |
| 344 | 144 #define SUG(ga, i) (((suggest_T *)(ga).ga_data)[i]) |
| 323 | 145 |
| 625 | 146 /* TRUE if a word appears in the list of banned words. */ |
| 147 #define WAS_BANNED(su, word) (!HASHITEM_EMPTY(hash_find(&su->su_banned, word))) | |
| 148 | |
| 1705 | 149 /* Number of suggestions kept when cleaning up. We need to keep more than |
| 625 | 150 * what is displayed, because when rescore_suggestions() is called the score |
| 151 * may change and wrong suggestions may be removed later. */ | |
| 152 #define SUG_CLEAN_COUNT(su) ((su)->su_maxcount < 130 ? 150 : (su)->su_maxcount + 20) | |
| 324 | 153 |
| 154 /* Threshold for sorting and cleaning up suggestions. Don't want to keep lots | |
| 155 * of suggestions that are not going to be displayed. */ | |
| 625 | 156 #define SUG_MAX_COUNT(su) (SUG_CLEAN_COUNT(su) + 50) |
| 323 | 157 |
| 158 /* score for various changes */ | |
| 344 | 159 #define SCORE_SPLIT 149 /* split bad word */ |
| 698 | 160 #define SCORE_SPLIT_NO 249 /* split bad word with NOSPLITSUGS */ |
| 323 | 161 #define SCORE_ICASE 52 /* slightly different case */ |
| 483 | 162 #define SCORE_REGION 200 /* word is for different region */ |
| 323 | 163 #define SCORE_RARE 180 /* rare word */ |
| 625 | 164 #define SCORE_SWAP 75 /* swap two characters */ |
| 323 | 165 #define SCORE_SWAP3 110 /* swap two characters in three */ |
| 532 | 166 #define SCORE_REP 65 /* REP replacement */ |
| 323 | 167 #define SCORE_SUBST 93 /* substitute a character */ |
| 168 #define SCORE_SIMILAR 33 /* substitute a similar character */ | |
| 479 | 169 #define SCORE_SUBCOMP 33 /* substitute a composing character */ |
| 324 | 170 #define SCORE_DEL 94 /* delete a character */ |
| 532 | 171 #define SCORE_DELDUP 66 /* delete a duplicated character */ |
| 479 | 172 #define SCORE_DELCOMP 28 /* delete a composing character */ |
| 324 | 173 #define SCORE_INS 96 /* insert a character */ |
| 532 | 174 #define SCORE_INSDUP 67 /* insert a duplicate character */ |
| 475 | 175 #define SCORE_INSCOMP 30 /* insert a composing character */ |
| 366 | 176 #define SCORE_NONWORD 103 /* change non-word to word char */ |
| 323 | 177 |
| 372 | 178 #define SCORE_FILE 30 /* suggestion from a file */ |
| 323 | 179 #define SCORE_MAXINIT 350 /* Initial maximum score: higher == slower. |
| 180 * 350 allows for about three changes. */ | |
| 344 | 181 |
| 625 | 182 #define SCORE_COMMON1 30 /* subtracted for words seen before */ |
| 183 #define SCORE_COMMON2 40 /* subtracted for words often seen */ | |
| 184 #define SCORE_COMMON3 50 /* subtracted for words very often seen */ | |
| 185 #define SCORE_THRES2 10 /* word count threshold for COMMON2 */ | |
| 186 #define SCORE_THRES3 100 /* word count threshold for COMMON3 */ | |
| 187 | |
| 188 /* When trying changed soundfold words it becomes slow when trying more than | |
| 189 * two changes. With less then two changes it's slightly faster but we miss a | |
| 190 * few good suggestions. In rare cases we need to try three of four changes. | |
| 191 */ | |
| 192 #define SCORE_SFMAX1 200 /* maximum score for first try */ | |
| 193 #define SCORE_SFMAX2 300 /* maximum score for second try */ | |
| 194 #define SCORE_SFMAX3 400 /* maximum score for third try */ | |
| 195 | |
| 344 | 196 #define SCORE_BIG SCORE_INS * 3 /* big difference */ |
| 625 | 197 #define SCORE_MAXMAX 999999 /* accept any score */ |
| 198 #define SCORE_LIMITMAX 350 /* for spell_edit_score_limit() */ | |
| 199 | |
| 200 /* for spell_edit_score_limit() we need to know the minimum value of | |
| 201 * SCORE_ICASE, SCORE_SWAP, SCORE_DEL, SCORE_SIMILAR and SCORE_INS */ | |
| 202 #define SCORE_EDIT_MIN SCORE_SIMILAR | |
| 323 | 203 |
| 204 /* | |
| 236 | 205 * Structure to store info for word matching. |
| 206 */ | |
| 207 typedef struct matchinf_S | |
| 208 { | |
| 209 langp_T *mi_lp; /* info for language and region */ | |
| 243 | 210 |
| 211 /* pointers to original text to be checked */ | |
| 236 | 212 char_u *mi_word; /* start of word being checked */ |
| 339 | 213 char_u *mi_end; /* end of matching word so far */ |
| 243 | 214 char_u *mi_fend; /* next char to be added to mi_fword */ |
| 300 | 215 char_u *mi_cend; /* char after what was used for |
| 216 mi_capflags */ | |
| 243 | 217 |
| 218 /* case-folded text */ | |
| 219 char_u mi_fword[MAXWLEN + 1]; /* mi_word case-folded */ | |
| 300 | 220 int mi_fwordlen; /* nr of valid bytes in mi_fword */ |
| 243 | 221 |
| 339 | 222 /* for when checking word after a prefix */ |
| 223 int mi_prefarridx; /* index in sl_pidxs with list of | |
| 481 | 224 affixID/condition */ |
| 339 | 225 int mi_prefcnt; /* number of entries at mi_prefarridx */ |
| 226 int mi_prefixlen; /* byte length of prefix */ | |
| 455 | 227 #ifdef FEAT_MBYTE |
| 228 int mi_cprefixlen; /* byte length of prefix in original | |
| 229 case */ | |
| 230 #else | |
| 231 # define mi_cprefixlen mi_prefixlen /* it's the same value */ | |
| 232 #endif | |
| 339 | 233 |
| 481 | 234 /* for when checking a compound word */ |
| 235 int mi_compoff; /* start of following word offset */ | |
| 483 | 236 char_u mi_compflags[MAXWLEN]; /* flags for compound words used */ |
| 237 int mi_complen; /* nr of compound words used */ | |
| 809 | 238 int mi_compextra; /* nr of COMPOUNDROOT words */ |
| 481 | 239 |
| 243 | 240 /* others */ |
| 236 | 241 int mi_result; /* result so far: SP_BAD, SP_OK, etc. */ |
| 300 | 242 int mi_capflags; /* WF_ONECAP WF_ALLCAP WF_KEEPCAP */ |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
243 win_T *mi_win; /* buffer being checked */ |
| 492 | 244 |
| 245 /* for NOBREAK */ | |
| 246 int mi_result2; /* "mi_resul" without following word */ | |
| 247 char_u *mi_end2; /* "mi_end" without following word */ | |
| 236 | 248 } matchinf_T; |
| 249 | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
250 |
|
7805
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
251 static int spell_iswordp(char_u *p, win_T *wp); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
252 #ifdef FEAT_MBYTE |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
253 static int spell_mb_isword_class(int cl, win_T *wp); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
254 static int spell_iswordp_w(int *p, win_T *wp); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
255 #endif |
| 307 | 256 |
| 257 /* | |
| 344 | 258 * For finding suggestions: At each node in the tree these states are tried: |
| 330 | 259 */ |
| 260 typedef enum | |
| 261 { | |
| 344 | 262 STATE_START = 0, /* At start of node check for NUL bytes (goodword |
| 263 * ends); if badword ends there is a match, otherwise | |
| 264 * try splitting word. */ | |
| 375 | 265 STATE_NOPREFIX, /* try without prefix */ |
| 344 | 266 STATE_SPLITUNDO, /* Undo splitting. */ |
| 330 | 267 STATE_ENDNUL, /* Past NUL bytes at start of the node. */ |
| 268 STATE_PLAIN, /* Use each byte of the node. */ | |
| 269 STATE_DEL, /* Delete a byte from the bad word. */ | |
| 625 | 270 STATE_INS_PREP, /* Prepare for inserting bytes. */ |
| 330 | 271 STATE_INS, /* Insert a byte in the bad word. */ |
| 272 STATE_SWAP, /* Swap two bytes. */ | |
| 344 | 273 STATE_UNSWAP, /* Undo swap two characters. */ |
| 274 STATE_SWAP3, /* Swap two characters over three. */ | |
| 275 STATE_UNSWAP3, /* Undo Swap two characters over three. */ | |
| 276 STATE_UNROT3L, /* Undo rotate three characters left */ | |
| 277 STATE_UNROT3R, /* Undo rotate three characters right */ | |
| 330 | 278 STATE_REP_INI, /* Prepare for using REP items. */ |
| 279 STATE_REP, /* Use matching REP items from the .aff file. */ | |
| 280 STATE_REP_UNDO, /* Undo a REP item replacement. */ | |
| 281 STATE_FINAL /* End of this node. */ | |
| 282 } state_T; | |
| 283 | |
| 284 /* | |
| 346 | 285 * Struct to keep the state at each level in suggest_try_change(). |
| 323 | 286 */ |
| 287 typedef struct trystate_S | |
| 288 { | |
| 330 | 289 state_T ts_state; /* state at this level, STATE_ */ |
| 323 | 290 int ts_score; /* score */ |
| 344 | 291 idx_T ts_arridx; /* index in tree array, start of node */ |
| 330 | 292 short ts_curi; /* index in list of child nodes */ |
| 293 char_u ts_fidx; /* index in fword[], case-folded bad word */ | |
| 294 char_u ts_fidxtry; /* ts_fidx at which bytes may be changed */ | |
| 295 char_u ts_twordlen; /* valid length of tword[] */ | |
| 482 | 296 char_u ts_prefixdepth; /* stack depth for end of prefix or |
| 485 | 297 * PFD_PREFIXTREE or PFD_NOPREFIX */ |
| 298 char_u ts_flags; /* TSF_ flags */ | |
| 330 | 299 #ifdef FEAT_MBYTE |
| 300 char_u ts_tcharlen; /* number of bytes in tword character */ | |
| 301 char_u ts_tcharidx; /* current byte index in tword character */ | |
| 302 char_u ts_isdiff; /* DIFF_ values */ | |
| 303 char_u ts_fcharstart; /* index in fword where badword char started */ | |
| 304 #endif | |
| 483 | 305 char_u ts_prewordlen; /* length of word in "preword[]" */ |
| 306 char_u ts_splitoff; /* index in "tword" after last split */ | |
| 492 | 307 char_u ts_splitfidx; /* "ts_fidx" at word split */ |
| 483 | 308 char_u ts_complen; /* nr of compound words used */ |
| 485 | 309 char_u ts_compsplit; /* index for "compflags" where word was spit */ |
| 346 | 310 char_u ts_save_badflags; /* su_badflags saved here */ |
| 625 | 311 char_u ts_delidx; /* index in fword for char that was deleted, |
| 312 valid when "ts_flags" has TSF_DIDDEL */ | |
| 323 | 313 } trystate_T; |
| 314 | |
| 330 | 315 /* values for ts_isdiff */ |
| 316 #define DIFF_NONE 0 /* no different byte (yet) */ | |
| 317 #define DIFF_YES 1 /* different byte found */ | |
| 318 #define DIFF_INSERT 2 /* inserting character */ | |
| 319 | |
| 485 | 320 /* values for ts_flags */ |
| 321 #define TSF_PREFIXOK 1 /* already checked that prefix is OK */ | |
| 322 #define TSF_DIDSPLIT 2 /* tried split at this point */ | |
| 625 | 323 #define TSF_DIDDEL 4 /* did a delete, "ts_delidx" has index */ |
| 485 | 324 |
| 375 | 325 /* special values ts_prefixdepth */ |
| 485 | 326 #define PFD_NOPREFIX 0xff /* not using prefixes */ |
| 482 | 327 #define PFD_PREFIXTREE 0xfe /* walking through the prefix tree */ |
| 625 | 328 #define PFD_NOTSPECIAL 0xfd /* highest value that's not special */ |
| 375 | 329 |
| 339 | 330 /* mode values for find_word */ |
| 481 | 331 #define FIND_FOLDWORD 0 /* find word case-folded */ |
| 332 #define FIND_KEEPWORD 1 /* find keep-case word */ | |
| 333 #define FIND_PREFIX 2 /* find word after prefix */ | |
| 334 #define FIND_COMPOUND 3 /* find case-folded compound word */ | |
| 335 #define FIND_KEEPCOMPOUND 4 /* find keep-case compound word */ | |
| 339 | 336 |
|
7805
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
337 static void find_word(matchinf_T *mip, int mode); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
338 static int match_checkcompoundpattern(char_u *ptr, int wlen, garray_T *gap); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
339 static int can_compound(slang_T *slang, char_u *word, char_u *flags); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
340 static int can_be_compound(trystate_T *sp, slang_T *slang, char_u *compflags, int flag); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
341 static int match_compoundrule(slang_T *slang, char_u *compflags); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
342 static int valid_word_prefix(int totprefcnt, int arridx, int flags, char_u *word, slang_T *slang, int cond_req); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
343 static void find_prefix(matchinf_T *mip, int mode); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
344 static int fold_more(matchinf_T *mip); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
345 static int spell_valid_case(int wordflags, int treeflags); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
346 static int no_spell_checking(win_T *wp); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
347 static void spell_load_lang(char_u *lang); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
348 static void int_wordlist_spl(char_u *fname); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
349 static void spell_load_cb(char_u *fname, void *cookie); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
350 static int score_wordcount_adj(slang_T *slang, int score, char_u *word, int split); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
351 static int count_syllables(slang_T *slang, char_u *word); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
352 static void clear_midword(win_T *buf); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
353 static void use_midword(slang_T *lp, win_T *buf); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
354 static int find_region(char_u *rp, char_u *region); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
355 static int badword_captype(char_u *word, char_u *end); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
356 static int check_need_cap(linenr_T lnum, colnr_T col); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
357 static void spell_find_suggest(char_u *badptr, int badlen, suginfo_T *su, int maxcount, int banbadword, int need_cap, int interactive); |
| 372 | 358 #ifdef FEAT_EVAL |
|
7805
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
359 static void spell_suggest_expr(suginfo_T *su, char_u *expr); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
360 #endif |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
361 static void spell_suggest_file(suginfo_T *su, char_u *fname); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
362 static void spell_suggest_intern(suginfo_T *su, int interactive); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
363 static void spell_find_cleanup(suginfo_T *su); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
364 static void allcap_copy(char_u *word, char_u *wcopy); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
365 static void suggest_try_special(suginfo_T *su); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
366 static void suggest_try_change(suginfo_T *su); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
367 static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, int soundfold); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
368 static void go_deeper(trystate_T *stack, int depth, int score_add); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
369 #ifdef FEAT_MBYTE |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
370 static int nofold_len(char_u *fword, int flen, char_u *word); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
371 #endif |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
372 static void find_keepcap_word(slang_T *slang, char_u *fword, char_u *kword); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
373 static void score_comp_sal(suginfo_T *su); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
374 static void score_combine(suginfo_T *su); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
375 static int stp_sal_score(suggest_T *stp, suginfo_T *su, slang_T *slang, char_u *badsound); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
376 static void suggest_try_soundalike_prep(void); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
377 static void suggest_try_soundalike(suginfo_T *su); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
378 static void suggest_try_soundalike_finish(void); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
379 static void add_sound_suggest(suginfo_T *su, char_u *goodword, int score, langp_T *lp); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
380 static int soundfold_find(slang_T *slang, char_u *word); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
381 static void make_case_word(char_u *fword, char_u *cword, int flags); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
382 static int similar_chars(slang_T *slang, int c1, int c2); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
383 static void add_suggestion(suginfo_T *su, garray_T *gap, char_u *goodword, int badlen, int score, int altscore, int had_bonus, slang_T *slang, int maxsf); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
384 static void check_suggestions(suginfo_T *su, garray_T *gap); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
385 static void add_banned(suginfo_T *su, char_u *word); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
386 static void rescore_suggestions(suginfo_T *su); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
387 static void rescore_one(suginfo_T *su, suggest_T *stp); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
388 static int cleanup_suggestions(garray_T *gap, int maxscore, int keep); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
389 static void spell_soundfold_sofo(slang_T *slang, char_u *inword, char_u *res); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
390 static void spell_soundfold_sal(slang_T *slang, char_u *inword, char_u *res); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
391 #ifdef FEAT_MBYTE |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
392 static void spell_soundfold_wsal(slang_T *slang, char_u *inword, char_u *res); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
393 #endif |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
394 static int soundalike_score(char_u *goodsound, char_u *badsound); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
395 static int spell_edit_score(slang_T *slang, char_u *badword, char_u *goodword); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
396 static int spell_edit_score_limit(slang_T *slang, char_u *badword, char_u *goodword, int limit); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
397 #ifdef FEAT_MBYTE |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
398 static int spell_edit_score_limit_w(slang_T *slang, char_u *badword, char_u *goodword, int limit); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
399 #endif |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
400 static void dump_word(slang_T *slang, char_u *word, char_u *pat, int *dir, int round, int flags, linenr_T lnum); |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
401 static linenr_T dump_prefixes(slang_T *slang, char_u *word, char_u *pat, int *dir, int round, int flags, linenr_T startlnum); |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
402 |
| 236 | 403 |
| 626 | 404 /* Remember what "z?" replaced. */ |
| 405 static char_u *repl_from = NULL; | |
| 406 static char_u *repl_to = NULL; | |
| 407 | |
| 236 | 408 /* |
| 409 * Main spell-checking function. | |
| 300 | 410 * "ptr" points to a character that could be the start of a word. |
| 534 | 411 * "*attrp" is set to the highlight index for a badly spelled word. For a |
| 412 * non-word or when it's OK it remains unchanged. | |
| 236 | 413 * This must only be called when 'spelllang' is not empty. |
| 323 | 414 * |
| 385 | 415 * "capcol" is used to check for a Capitalised word after the end of a |
| 416 * sentence. If it's zero then perform the check. Return the column where to | |
| 417 * check next, or -1 when no sentence end was found. If it's NULL then don't | |
| 418 * worry. | |
| 323 | 419 * |
| 236 | 420 * Returns the length of the word in bytes, also when it's OK, so that the |
| 421 * caller can skip over the word. | |
| 422 */ | |
| 423 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
424 spell_check( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
425 win_T *wp, /* current window */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
426 char_u *ptr, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
427 hlf_T *attrp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
428 int *capcol, /* column to check for Capital */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
429 int docount) /* count good words */ |
| 236 | 430 { |
| 431 matchinf_T mi; /* Most things are put in "mi" so that it can | |
| 432 be passed to functions quickly. */ | |
| 344 | 433 int nrlen = 0; /* found a number first */ |
| 385 | 434 int c; |
| 483 | 435 int wrongcaplen = 0; |
| 500 | 436 int lpi; |
| 625 | 437 int count_word = docount; |
| 236 | 438 |
| 307 | 439 /* A word never starts at a space or a control character. Return quickly |
| 440 * then, skipping over the character. */ | |
| 441 if (*ptr <= ' ') | |
| 442 return 1; | |
| 690 | 443 |
| 444 /* Return here when loading language files failed. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
445 if (wp->w_s->b_langp.ga_len == 0) |
| 690 | 446 return 1; |
| 447 | |
| 483 | 448 vim_memset(&mi, 0, sizeof(matchinf_T)); |
| 236 | 449 |
| 344 | 450 /* A number is always OK. Also skip hexadecimal numbers 0xFF99 and |
| 584 | 451 * 0X99FF. But always do check spelling to find "3GPP" and "11 |
| 452 * julifeest". */ | |
| 300 | 453 if (*ptr >= '0' && *ptr <= '9') |
| 454 { | |
|
7447
ad432f8f68fb
commit https://github.com/vim/vim/commit/887c1fea4a114e7170091942d0446c8882701b5b
Christian Brabandt <cb@256bit.org>
parents:
6949
diff
changeset
|
455 if (*ptr == '0' && (ptr[1] == 'b' || ptr[1] == 'B')) |
|
ad432f8f68fb
commit https://github.com/vim/vim/commit/887c1fea4a114e7170091942d0446c8882701b5b
Christian Brabandt <cb@256bit.org>
parents:
6949
diff
changeset
|
456 mi.mi_end = skipbin(ptr + 2); |
|
ad432f8f68fb
commit https://github.com/vim/vim/commit/887c1fea4a114e7170091942d0446c8882701b5b
Christian Brabandt <cb@256bit.org>
parents:
6949
diff
changeset
|
457 else if (*ptr == '0' && (ptr[1] == 'x' || ptr[1] == 'X')) |
| 316 | 458 mi.mi_end = skiphex(ptr + 2); |
| 300 | 459 else |
| 344 | 460 mi.mi_end = skipdigits(ptr); |
| 835 | 461 nrlen = (int)(mi.mi_end - ptr); |
| 584 | 462 } |
| 346 | 463 |
| 464 /* Find the normal end of the word (until the next non-word character). */ | |
| 344 | 465 mi.mi_word = ptr; |
| 584 | 466 mi.mi_fend = ptr; |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
467 if (spell_iswordp(mi.mi_fend, wp)) |
| 344 | 468 { |
| 469 do | |
| 470 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
471 MB_PTR_ADV(mi.mi_fend); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
472 } while (*mi.mi_fend != NUL && spell_iswordp(mi.mi_fend, wp)); |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
473 |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
474 if (capcol != NULL && *capcol == 0 && wp->w_s->b_cap_prog != NULL) |
| 385 | 475 { |
| 476 /* Check word starting with capital letter. */ | |
| 455 | 477 c = PTR2CHAR(ptr); |
| 385 | 478 if (!SPELL_ISUPPER(c)) |
| 483 | 479 wrongcaplen = (int)(mi.mi_fend - ptr); |
| 385 | 480 } |
| 481 } | |
| 482 if (capcol != NULL) | |
| 483 *capcol = -1; | |
| 344 | 484 |
| 485 /* We always use the characters up to the next non-word character, | |
| 486 * also for bad words. */ | |
| 487 mi.mi_end = mi.mi_fend; | |
| 488 | |
| 489 /* Check caps type later. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
490 mi.mi_capflags = 0; |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
491 mi.mi_cend = NULL; |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
492 mi.mi_win = wp; |
| 344 | 493 |
| 483 | 494 /* case-fold the word with one non-word character, so that we can check |
| 495 * for the word end. */ | |
| 344 | 496 if (*mi.mi_fend != NUL) |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
497 MB_PTR_ADV(mi.mi_fend); |
| 344 | 498 |
| 499 (void)spell_casefold(ptr, (int)(mi.mi_fend - ptr), mi.mi_fword, | |
| 500 MAXWLEN + 1); | |
| 835 | 501 mi.mi_fwordlen = (int)STRLEN(mi.mi_fword); |
| 344 | 502 |
| 503 /* The word is bad unless we recognize it. */ | |
| 504 mi.mi_result = SP_BAD; | |
| 492 | 505 mi.mi_result2 = SP_BAD; |
| 344 | 506 |
| 507 /* | |
| 508 * Loop over the languages specified in 'spelllang'. | |
| 625 | 509 * We check them all, because a word may be matched longer in another |
| 510 * language. | |
| 344 | 511 */ |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
512 for (lpi = 0; lpi < wp->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
513 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
514 mi.mi_lp = LANGP_ENTRY(wp->w_s->b_langp, lpi); |
| 500 | 515 |
| 516 /* If reloading fails the language is still in the list but everything | |
| 517 * has been cleared. */ | |
| 518 if (mi.mi_lp->lp_slang->sl_fidxs == NULL) | |
| 519 continue; | |
| 520 | |
| 344 | 521 /* Check for a matching word in case-folded words. */ |
| 522 find_word(&mi, FIND_FOLDWORD); | |
| 523 | |
| 524 /* Check for a matching word in keep-case words. */ | |
| 525 find_word(&mi, FIND_KEEPWORD); | |
| 526 | |
| 527 /* Check for matching prefixes. */ | |
| 485 | 528 find_prefix(&mi, FIND_FOLDWORD); |
| 492 | 529 |
| 530 /* For a NOBREAK language, may want to use a word without a following | |
| 531 * word as a backup. */ | |
| 532 if (mi.mi_lp->lp_slang->sl_nobreak && mi.mi_result == SP_BAD | |
| 533 && mi.mi_result2 != SP_BAD) | |
| 534 { | |
| 535 mi.mi_result = mi.mi_result2; | |
| 536 mi.mi_end = mi.mi_end2; | |
| 537 } | |
| 625 | 538 |
| 539 /* Count the word in the first language where it's found to be OK. */ | |
| 540 if (count_word && mi.mi_result == SP_OK) | |
| 541 { | |
| 542 count_common_word(mi.mi_lp->lp_slang, ptr, | |
| 543 (int)(mi.mi_end - ptr), 1); | |
| 544 count_word = FALSE; | |
| 545 } | |
| 344 | 546 } |
| 547 | |
| 548 if (mi.mi_result != SP_OK) | |
| 549 { | |
| 346 | 550 /* If we found a number skip over it. Allows for "42nd". Do flag |
| 551 * rare and local words, e.g., "3GPP". */ | |
| 344 | 552 if (nrlen > 0) |
| 346 | 553 { |
| 554 if (mi.mi_result == SP_BAD || mi.mi_result == SP_BANNED) | |
| 555 return nrlen; | |
| 556 } | |
| 344 | 557 |
| 558 /* When we are at a non-word character there is no error, just | |
| 559 * skip over the character (try looking for a word after it). */ | |
| 5477 | 560 else if (!spell_iswordp_nmw(ptr, wp)) |
| 243 | 561 { |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
562 if (capcol != NULL && wp->w_s->b_cap_prog != NULL) |
| 385 | 563 { |
| 564 regmatch_T regmatch; | |
| 6375 | 565 int r; |
| 385 | 566 |
| 567 /* Check for end of sentence. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
568 regmatch.regprog = wp->w_s->b_cap_prog; |
| 385 | 569 regmatch.rm_ic = FALSE; |
| 6375 | 570 r = vim_regexec(®match, ptr, 0); |
| 571 wp->w_s->b_cap_prog = regmatch.regprog; | |
| 572 if (r) | |
| 385 | 573 *capcol = (int)(regmatch.endp[0] - ptr); |
| 574 } | |
| 575 | |
| 344 | 576 #ifdef FEAT_MBYTE |
| 577 if (has_mbyte) | |
| 474 | 578 return (*mb_ptr2len)(ptr); |
| 344 | 579 #endif |
| 580 return 1; | |
| 300 | 581 } |
| 483 | 582 else if (mi.mi_end == ptr) |
| 583 /* Always include at least one character. Required for when there | |
| 584 * is a mixup in "midword". */ | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
585 MB_PTR_ADV(mi.mi_end); |
| 492 | 586 else if (mi.mi_result == SP_BAD |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
587 && LANGP_ENTRY(wp->w_s->b_langp, 0)->lp_slang->sl_nobreak) |
| 492 | 588 { |
| 589 char_u *p, *fp; | |
| 590 int save_result = mi.mi_result; | |
| 591 | |
| 592 /* First language in 'spelllang' is NOBREAK. Find first position | |
| 593 * at which any word would be valid. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
594 mi.mi_lp = LANGP_ENTRY(wp->w_s->b_langp, 0); |
| 500 | 595 if (mi.mi_lp->lp_slang->sl_fidxs != NULL) |
| 596 { | |
| 597 p = mi.mi_word; | |
| 598 fp = mi.mi_fword; | |
| 599 for (;;) | |
| 600 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
601 MB_PTR_ADV(p); |
|
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
602 MB_PTR_ADV(fp); |
| 500 | 603 if (p >= mi.mi_end) |
| 604 break; | |
| 835 | 605 mi.mi_compoff = (int)(fp - mi.mi_fword); |
| 500 | 606 find_word(&mi, FIND_COMPOUND); |
| 607 if (mi.mi_result != SP_BAD) | |
| 608 { | |
| 609 mi.mi_end = p; | |
| 610 break; | |
| 611 } | |
| 612 } | |
| 613 mi.mi_result = save_result; | |
| 614 } | |
| 492 | 615 } |
| 243 | 616 |
| 344 | 617 if (mi.mi_result == SP_BAD || mi.mi_result == SP_BANNED) |
| 534 | 618 *attrp = HLF_SPB; |
| 344 | 619 else if (mi.mi_result == SP_RARE) |
| 534 | 620 *attrp = HLF_SPR; |
| 344 | 621 else |
| 534 | 622 *attrp = HLF_SPL; |
| 243 | 623 } |
| 624 | |
| 483 | 625 if (wrongcaplen > 0 && (mi.mi_result == SP_OK || mi.mi_result == SP_RARE)) |
| 626 { | |
| 627 /* Report SpellCap only when the word isn't badly spelled. */ | |
| 534 | 628 *attrp = HLF_SPC; |
| 483 | 629 return wrongcaplen; |
| 630 } | |
| 631 | |
| 300 | 632 return (int)(mi.mi_end - ptr); |
| 236 | 633 } |
| 634 | |
| 635 /* | |
| 300 | 636 * Check if the word at "mip->mi_word" is in the tree. |
| 339 | 637 * When "mode" is FIND_FOLDWORD check in fold-case word tree. |
| 638 * When "mode" is FIND_KEEPWORD check in keep-case word tree. | |
| 639 * When "mode" is FIND_PREFIX check for word after prefix in fold-case word | |
| 640 * tree. | |
| 300 | 641 * |
| 642 * For a match mip->mi_result is updated. | |
| 243 | 643 */ |
| 644 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
645 find_word(matchinf_T *mip, int mode) |
| 243 | 646 { |
| 324 | 647 idx_T arridx = 0; |
| 300 | 648 int endlen[MAXWLEN]; /* length at possible word endings */ |
| 324 | 649 idx_T endidx[MAXWLEN]; /* possible word endings */ |
| 300 | 650 int endidxcnt = 0; |
| 651 int len; | |
| 652 int wlen = 0; | |
| 653 int flen; | |
| 654 int c; | |
| 655 char_u *ptr; | |
| 324 | 656 idx_T lo, hi, m; |
| 243 | 657 #ifdef FEAT_MBYTE |
| 300 | 658 char_u *s; |
| 490 | 659 #endif |
| 339 | 660 char_u *p; |
| 307 | 661 int res = SP_BAD; |
| 300 | 662 slang_T *slang = mip->mi_lp->lp_slang; |
| 663 unsigned flags; | |
| 664 char_u *byts; | |
| 324 | 665 idx_T *idxs; |
| 481 | 666 int word_ends; |
| 485 | 667 int prefix_found; |
| 492 | 668 int nobreak_result; |
| 481 | 669 |
| 670 if (mode == FIND_KEEPWORD || mode == FIND_KEEPCOMPOUND) | |
| 236 | 671 { |
| 300 | 672 /* Check for word with matching case in keep-case tree. */ |
| 673 ptr = mip->mi_word; | |
| 674 flen = 9999; /* no case folding, always enough bytes */ | |
| 675 byts = slang->sl_kbyts; | |
| 676 idxs = slang->sl_kidxs; | |
| 481 | 677 |
| 678 if (mode == FIND_KEEPCOMPOUND) | |
| 679 /* Skip over the previously found word(s). */ | |
| 680 wlen += mip->mi_compoff; | |
| 236 | 681 } |
| 682 else | |
| 683 { | |
| 300 | 684 /* Check for case-folded in case-folded tree. */ |
| 685 ptr = mip->mi_fword; | |
| 686 flen = mip->mi_fwordlen; /* available case-folded bytes */ | |
| 687 byts = slang->sl_fbyts; | |
| 688 idxs = slang->sl_fidxs; | |
| 339 | 689 |
| 690 if (mode == FIND_PREFIX) | |
| 691 { | |
| 692 /* Skip over the prefix. */ | |
| 693 wlen = mip->mi_prefixlen; | |
| 694 flen -= mip->mi_prefixlen; | |
| 695 } | |
| 481 | 696 else if (mode == FIND_COMPOUND) |
| 697 { | |
| 698 /* Skip over the previously found word(s). */ | |
| 699 wlen = mip->mi_compoff; | |
| 700 flen -= mip->mi_compoff; | |
| 701 } | |
| 702 | |
| 243 | 703 } |
| 704 | |
| 300 | 705 if (byts == NULL) |
| 706 return; /* array is empty */ | |
| 236 | 707 |
| 708 /* | |
| 307 | 709 * Repeat advancing in the tree until: |
| 710 * - there is a byte that doesn't match, | |
| 711 * - we reach the end of the tree, | |
| 712 * - or we reach the end of the line. | |
| 236 | 713 */ |
| 300 | 714 for (;;) |
| 236 | 715 { |
| 346 | 716 if (flen <= 0 && *mip->mi_fend != NUL) |
| 339 | 717 flen = fold_more(mip); |
| 300 | 718 |
| 719 len = byts[arridx++]; | |
| 720 | |
| 721 /* If the first possible byte is a zero the word could end here. | |
| 722 * Remember this index, we first check for the longest word. */ | |
| 723 if (byts[arridx] == 0) | |
| 724 { | |
| 307 | 725 if (endidxcnt == MAXWLEN) |
| 726 { | |
| 727 /* Must be a corrupted spell file. */ | |
| 728 EMSG(_(e_format)); | |
| 729 return; | |
| 730 } | |
| 300 | 731 endlen[endidxcnt] = wlen; |
| 732 endidx[endidxcnt++] = arridx++; | |
| 733 --len; | |
| 734 | |
| 735 /* Skip over the zeros, there can be several flag/region | |
| 736 * combinations. */ | |
| 737 while (len > 0 && byts[arridx] == 0) | |
| 738 { | |
| 739 ++arridx; | |
| 740 --len; | |
| 741 } | |
| 742 if (len == 0) | |
| 743 break; /* no children, word must end here */ | |
| 744 } | |
| 745 | |
| 746 /* Stop looking at end of the line. */ | |
| 747 if (ptr[wlen] == NUL) | |
| 748 break; | |
| 749 | |
| 750 /* Perform a binary search in the list of accepted bytes. */ | |
| 751 c = ptr[wlen]; | |
| 346 | 752 if (c == TAB) /* <Tab> is handled like <Space> */ |
| 753 c = ' '; | |
| 300 | 754 lo = arridx; |
| 755 hi = arridx + len - 1; | |
| 756 while (lo < hi) | |
| 757 { | |
| 758 m = (lo + hi) / 2; | |
| 759 if (byts[m] > c) | |
| 760 hi = m - 1; | |
| 761 else if (byts[m] < c) | |
| 762 lo = m + 1; | |
| 763 else | |
| 764 { | |
| 765 lo = hi = m; | |
| 766 break; | |
| 236 | 767 } |
| 768 } | |
| 300 | 769 |
| 770 /* Stop if there is no matching byte. */ | |
| 771 if (hi < lo || byts[lo] != c) | |
| 772 break; | |
| 773 | |
| 774 /* Continue at the child (if there is one). */ | |
| 775 arridx = idxs[lo]; | |
| 776 ++wlen; | |
| 777 --flen; | |
| 346 | 778 |
| 779 /* One space in the good word may stand for several spaces in the | |
| 780 * checked word. */ | |
| 781 if (c == ' ') | |
| 782 { | |
| 783 for (;;) | |
| 784 { | |
| 785 if (flen <= 0 && *mip->mi_fend != NUL) | |
| 786 flen = fold_more(mip); | |
| 787 if (ptr[wlen] != ' ' && ptr[wlen] != TAB) | |
| 788 break; | |
| 789 ++wlen; | |
| 790 --flen; | |
| 791 } | |
| 792 } | |
| 236 | 793 } |
| 794 | |
| 300 | 795 /* |
| 796 * Verify that one of the possible endings is valid. Try the longest | |
| 797 * first. | |
| 798 */ | |
| 799 while (endidxcnt > 0) | |
| 800 { | |
| 801 --endidxcnt; | |
| 802 arridx = endidx[endidxcnt]; | |
| 803 wlen = endlen[endidxcnt]; | |
| 236 | 804 |
| 300 | 805 #ifdef FEAT_MBYTE |
| 806 if ((*mb_head_off)(ptr, ptr + wlen) > 0) | |
| 807 continue; /* not at first byte of character */ | |
| 808 #endif | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
809 if (spell_iswordp(ptr + wlen, mip->mi_win)) |
| 481 | 810 { |
| 492 | 811 if (slang->sl_compprog == NULL && !slang->sl_nobreak) |
| 481 | 812 continue; /* next char is a word character */ |
| 813 word_ends = FALSE; | |
| 814 } | |
| 815 else | |
| 816 word_ends = TRUE; | |
| 485 | 817 /* The prefix flag is before compound flags. Once a valid prefix flag |
| 818 * has been found we try compound flags. */ | |
| 819 prefix_found = FALSE; | |
| 300 | 820 |
| 821 #ifdef FEAT_MBYTE | |
| 339 | 822 if (mode != FIND_KEEPWORD && has_mbyte) |
| 300 | 823 { |
| 824 /* Compute byte length in original word, length may change | |
| 339 | 825 * when folding case. This can be slow, take a shortcut when the |
| 826 * case-folded word is equal to the keep-case word. */ | |
| 300 | 827 p = mip->mi_word; |
| 339 | 828 if (STRNCMP(ptr, p, wlen) != 0) |
| 829 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
830 for (s = ptr; s < ptr + wlen; MB_PTR_ADV(s)) |
|
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
831 MB_PTR_ADV(p); |
| 835 | 832 wlen = (int)(p - mip->mi_word); |
| 339 | 833 } |
| 300 | 834 } |
| 835 #endif | |
| 236 | 836 |
| 339 | 837 /* Check flags and region. For FIND_PREFIX check the condition and |
| 838 * prefix ID. | |
| 839 * Repeat this if there are more flags/region alternatives until there | |
| 840 * is a match. */ | |
| 841 res = SP_BAD; | |
| 842 for (len = byts[arridx - 1]; len > 0 && byts[arridx] == 0; | |
| 843 --len, ++arridx) | |
| 300 | 844 { |
| 845 flags = idxs[arridx]; | |
| 324 | 846 |
| 339 | 847 /* For the fold-case tree check that the case of the checked word |
| 848 * matches with what the word in the tree requires. | |
| 849 * For keep-case tree the case is always right. For prefixes we | |
| 850 * don't bother to check. */ | |
| 851 if (mode == FIND_FOLDWORD) | |
| 300 | 852 { |
| 853 if (mip->mi_cend != mip->mi_word + wlen) | |
| 854 { | |
| 323 | 855 /* mi_capflags was set for a different word length, need |
| 856 * to do it again. */ | |
| 300 | 857 mip->mi_cend = mip->mi_word + wlen; |
| 323 | 858 mip->mi_capflags = captype(mip->mi_word, mip->mi_cend); |
| 300 | 859 } |
| 860 | |
| 346 | 861 if (mip->mi_capflags == WF_KEEPCAP |
| 862 || !spell_valid_case(mip->mi_capflags, flags)) | |
| 339 | 863 continue; |
| 300 | 864 } |
| 236 | 865 |
| 339 | 866 /* When mode is FIND_PREFIX the word must support the prefix: |
| 867 * check the prefix ID and the condition. Do that for the list at | |
| 366 | 868 * mip->mi_prefarridx that find_prefix() filled. */ |
| 485 | 869 else if (mode == FIND_PREFIX && !prefix_found) |
| 481 | 870 { |
| 366 | 871 c = valid_word_prefix(mip->mi_prefcnt, mip->mi_prefarridx, |
| 390 | 872 flags, |
| 455 | 873 mip->mi_word + mip->mi_cprefixlen, slang, |
| 874 FALSE); | |
| 366 | 875 if (c == 0) |
| 339 | 876 continue; |
| 366 | 877 |
| 878 /* Use the WF_RARE flag for a rare prefix. */ | |
| 879 if (c & WF_RAREPFX) | |
| 880 flags |= WF_RARE; | |
| 485 | 881 prefix_found = TRUE; |
| 339 | 882 } |
| 883 | |
| 492 | 884 if (slang->sl_nobreak) |
| 885 { | |
| 886 if ((mode == FIND_COMPOUND || mode == FIND_KEEPCOMPOUND) | |
| 887 && (flags & WF_BANNED) == 0) | |
| 888 { | |
| 889 /* NOBREAK: found a valid following word. That's all we | |
| 890 * need to know, so return. */ | |
| 891 mip->mi_result = SP_OK; | |
| 892 break; | |
| 893 } | |
| 894 } | |
| 895 | |
| 896 else if ((mode == FIND_COMPOUND || mode == FIND_KEEPCOMPOUND | |
| 897 || !word_ends)) | |
| 481 | 898 { |
| 974 | 899 /* If there is no compound flag or the word is shorter than |
| 483 | 900 * COMPOUNDMIN reject it quickly. |
| 901 * Makes you wonder why someone puts a compound flag on a word | |
| 481 | 902 * that's too short... Myspell compatibility requires this |
| 903 * anyway. */ | |
| 490 | 904 if (((unsigned)flags >> 24) == 0 |
| 905 || wlen - mip->mi_compoff < slang->sl_compminlen) | |
| 483 | 906 continue; |
| 500 | 907 #ifdef FEAT_MBYTE |
| 908 /* For multi-byte chars check character length against | |
| 909 * COMPOUNDMIN. */ | |
| 910 if (has_mbyte | |
| 501 | 911 && slang->sl_compminlen > 0 |
| 500 | 912 && mb_charlen_len(mip->mi_word + mip->mi_compoff, |
| 913 wlen - mip->mi_compoff) < slang->sl_compminlen) | |
| 914 continue; | |
| 915 #endif | |
| 483 | 916 |
| 809 | 917 /* Limit the number of compound words to COMPOUNDWORDMAX if no |
| 490 | 918 * maximum for syllables is specified. */ |
| 809 | 919 if (!word_ends && mip->mi_complen + mip->mi_compextra + 2 |
| 920 > slang->sl_compmax | |
| 490 | 921 && slang->sl_compsylmax == MAXWLEN) |
| 483 | 922 continue; |
| 923 | |
| 819 | 924 /* Don't allow compounding on a side where an affix was added, |
| 925 * unless COMPOUNDPERMITFLAG was used. */ | |
| 926 if (mip->mi_complen > 0 && (flags & WF_NOCOMPBEF)) | |
| 927 continue; | |
| 928 if (!word_ends && (flags & WF_NOCOMPAFT)) | |
| 929 continue; | |
| 930 | |
| 485 | 931 /* Quickly check if compounding is possible with this flag. */ |
| 495 | 932 if (!byte_in_str(mip->mi_complen == 0 |
| 485 | 933 ? slang->sl_compstartflags |
| 934 : slang->sl_compallflags, | |
| 495 | 935 ((unsigned)flags >> 24))) |
| 481 | 936 continue; |
| 937 | |
| 1762 | 938 /* If there is a match with a CHECKCOMPOUNDPATTERN rule |
| 939 * discard the compound word. */ | |
| 940 if (match_checkcompoundpattern(ptr, wlen, &slang->sl_comppat)) | |
| 941 continue; | |
| 942 | |
| 490 | 943 if (mode == FIND_COMPOUND) |
| 944 { | |
| 945 int capflags; | |
| 946 | |
| 947 /* Need to check the caps type of the appended compound | |
| 948 * word. */ | |
| 949 #ifdef FEAT_MBYTE | |
| 950 if (has_mbyte && STRNCMP(ptr, mip->mi_word, | |
| 951 mip->mi_compoff) != 0) | |
| 952 { | |
| 953 /* case folding may have changed the length */ | |
| 954 p = mip->mi_word; | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
955 for (s = ptr; s < ptr + mip->mi_compoff; MB_PTR_ADV(s)) |
|
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
956 MB_PTR_ADV(p); |
| 490 | 957 } |
| 958 else | |
| 959 #endif | |
| 960 p = mip->mi_word + mip->mi_compoff; | |
| 961 capflags = captype(p, mip->mi_word + wlen); | |
| 962 if (capflags == WF_KEEPCAP || (capflags == WF_ALLCAP | |
| 963 && (flags & WF_FIXCAP) != 0)) | |
| 964 continue; | |
| 965 | |
| 966 if (capflags != WF_ALLCAP) | |
| 967 { | |
| 968 /* When the character before the word is a word | |
| 969 * character we do not accept a Onecap word. We do | |
| 970 * accept a no-caps word, even when the dictionary | |
| 971 * word specifies ONECAP. */ | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
972 MB_PTR_BACK(mip->mi_word, p); |
| 5477 | 973 if (spell_iswordp_nmw(p, mip->mi_win) |
| 490 | 974 ? capflags == WF_ONECAP |
| 975 : (flags & WF_ONECAP) != 0 | |
| 976 && capflags != WF_ONECAP) | |
| 977 continue; | |
| 978 } | |
| 979 } | |
| 980 | |
| 483 | 981 /* If the word ends the sequence of compound flags of the |
| 714 | 982 * words must match with one of the COMPOUNDRULE items and |
| 483 | 983 * the number of syllables must not be too large. */ |
| 984 mip->mi_compflags[mip->mi_complen] = ((unsigned)flags >> 24); | |
| 985 mip->mi_compflags[mip->mi_complen + 1] = NUL; | |
| 986 if (word_ends) | |
| 987 { | |
| 988 char_u fword[MAXWLEN]; | |
| 989 | |
| 990 if (slang->sl_compsylmax < MAXWLEN) | |
| 991 { | |
| 992 /* "fword" is only needed for checking syllables. */ | |
| 993 if (ptr == mip->mi_word) | |
| 994 (void)spell_casefold(ptr, wlen, fword, MAXWLEN); | |
| 995 else | |
| 996 vim_strncpy(fword, ptr, endlen[endidxcnt]); | |
| 997 } | |
| 998 if (!can_compound(slang, fword, mip->mi_compflags)) | |
| 999 continue; | |
| 1000 } | |
| 1762 | 1001 else if (slang->sl_comprules != NULL |
| 1002 && !match_compoundrule(slang, mip->mi_compflags)) | |
| 1003 /* The compound flags collected so far do not match any | |
| 1004 * COMPOUNDRULE, discard the compounded word. */ | |
| 1005 continue; | |
| 481 | 1006 } |
| 1007 | |
| 500 | 1008 /* Check NEEDCOMPOUND: can't use word without compounding. */ |
| 1009 else if (flags & WF_NEEDCOMP) | |
| 1010 continue; | |
| 1011 | |
| 492 | 1012 nobreak_result = SP_OK; |
| 1013 | |
| 481 | 1014 if (!word_ends) |
| 1015 { | |
| 492 | 1016 int save_result = mip->mi_result; |
| 1017 char_u *save_end = mip->mi_end; | |
| 501 | 1018 langp_T *save_lp = mip->mi_lp; |
| 1019 int lpi; | |
| 492 | 1020 |
| 1021 /* Check that a valid word follows. If there is one and we | |
| 1022 * are compounding, it will set "mi_result", thus we are | |
| 1023 * always finished here. For NOBREAK we only check that a | |
| 1024 * valid word follows. | |
| 481 | 1025 * Recursive! */ |
| 492 | 1026 if (slang->sl_nobreak) |
| 1027 mip->mi_result = SP_BAD; | |
| 481 | 1028 |
| 1029 /* Find following word in case-folded tree. */ | |
| 1030 mip->mi_compoff = endlen[endidxcnt]; | |
| 1031 #ifdef FEAT_MBYTE | |
| 1032 if (has_mbyte && mode == FIND_KEEPWORD) | |
| 1033 { | |
| 1034 /* Compute byte length in case-folded word from "wlen": | |
| 1035 * byte length in keep-case word. Length may change when | |
| 1036 * folding case. This can be slow, take a shortcut when | |
| 1037 * the case-folded word is equal to the keep-case word. */ | |
| 1038 p = mip->mi_fword; | |
| 1039 if (STRNCMP(ptr, p, wlen) != 0) | |
| 1040 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
1041 for (s = ptr; s < ptr + wlen; MB_PTR_ADV(s)) |
|
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
1042 MB_PTR_ADV(p); |
| 835 | 1043 mip->mi_compoff = (int)(p - mip->mi_fword); |
| 481 | 1044 } |
| 1045 } | |
| 1046 #endif | |
|
8956
d9e671c5afe6
commit https://github.com/vim/vim/commit/ba53435144f46eaaa53c63a62e748b3feee9742c
Christian Brabandt <cb@256bit.org>
parents:
8524
diff
changeset
|
1047 #if 0 /* Disabled, see below */ |
| 485 | 1048 c = mip->mi_compoff; |
|
8956
d9e671c5afe6
commit https://github.com/vim/vim/commit/ba53435144f46eaaa53c63a62e748b3feee9742c
Christian Brabandt <cb@256bit.org>
parents:
8524
diff
changeset
|
1049 #endif |
| 483 | 1050 ++mip->mi_complen; |
| 809 | 1051 if (flags & WF_COMPROOT) |
| 1052 ++mip->mi_compextra; | |
| 501 | 1053 |
| 1054 /* For NOBREAK we need to try all NOBREAK languages, at least | |
| 1055 * to find the ".add" file(s). */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1056 for (lpi = 0; lpi < mip->mi_win->w_s->b_langp.ga_len; ++lpi) |
| 501 | 1057 { |
| 1058 if (slang->sl_nobreak) | |
| 1059 { | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1060 mip->mi_lp = LANGP_ENTRY(mip->mi_win->w_s->b_langp, lpi); |
| 501 | 1061 if (mip->mi_lp->lp_slang->sl_fidxs == NULL |
| 1062 || !mip->mi_lp->lp_slang->sl_nobreak) | |
| 1063 continue; | |
| 1064 } | |
| 1065 | |
| 1066 find_word(mip, FIND_COMPOUND); | |
| 1067 | |
| 1068 /* When NOBREAK any word that matches is OK. Otherwise we | |
| 1069 * need to find the longest match, thus try with keep-case | |
| 1070 * and prefix too. */ | |
| 492 | 1071 if (!slang->sl_nobreak || mip->mi_result == SP_BAD) |
| 1072 { | |
| 501 | 1073 /* Find following word in keep-case tree. */ |
| 1074 mip->mi_compoff = wlen; | |
| 1075 find_word(mip, FIND_KEEPCOMPOUND); | |
| 1076 | |
| 819 | 1077 #if 0 /* Disabled, a prefix must not appear halfway a compound word, |
| 1078 unless the COMPOUNDPERMITFLAG is used and then it can't be a | |
| 1079 postponed prefix. */ | |
| 501 | 1080 if (!slang->sl_nobreak || mip->mi_result == SP_BAD) |
| 1081 { | |
| 1082 /* Check for following word with prefix. */ | |
| 1083 mip->mi_compoff = c; | |
| 1084 find_prefix(mip, FIND_COMPOUND); | |
| 1085 } | |
| 819 | 1086 #endif |
| 492 | 1087 } |
| 501 | 1088 |
| 1089 if (!slang->sl_nobreak) | |
| 1090 break; | |
| 492 | 1091 } |
| 483 | 1092 --mip->mi_complen; |
| 809 | 1093 if (flags & WF_COMPROOT) |
| 1094 --mip->mi_compextra; | |
| 501 | 1095 mip->mi_lp = save_lp; |
| 485 | 1096 |
| 492 | 1097 if (slang->sl_nobreak) |
| 1098 { | |
| 1099 nobreak_result = mip->mi_result; | |
| 1100 mip->mi_result = save_result; | |
| 1101 mip->mi_end = save_end; | |
| 1102 } | |
| 1103 else | |
| 1104 { | |
| 1105 if (mip->mi_result == SP_OK) | |
| 1106 break; | |
| 1107 continue; | |
| 1108 } | |
| 481 | 1109 } |
| 1110 | |
| 339 | 1111 if (flags & WF_BANNED) |
| 1112 res = SP_BANNED; | |
| 1113 else if (flags & WF_REGION) | |
| 1114 { | |
| 1115 /* Check region. */ | |
| 390 | 1116 if ((mip->mi_lp->lp_region & (flags >> 16)) != 0) |
| 300 | 1117 res = SP_OK; |
| 339 | 1118 else |
| 1119 res = SP_LOCAL; | |
| 300 | 1120 } |
| 339 | 1121 else if (flags & WF_RARE) |
| 1122 res = SP_RARE; | |
| 307 | 1123 else |
| 339 | 1124 res = SP_OK; |
| 1125 | |
| 492 | 1126 /* Always use the longest match and the best result. For NOBREAK |
| 1127 * we separately keep the longest match without a following good | |
| 1128 * word as a fall-back. */ | |
| 1129 if (nobreak_result == SP_BAD) | |
| 1130 { | |
| 1131 if (mip->mi_result2 > res) | |
| 1132 { | |
| 1133 mip->mi_result2 = res; | |
| 1134 mip->mi_end2 = mip->mi_word + wlen; | |
| 1135 } | |
| 1136 else if (mip->mi_result2 == res | |
| 1137 && mip->mi_end2 < mip->mi_word + wlen) | |
| 1138 mip->mi_end2 = mip->mi_word + wlen; | |
| 1139 } | |
| 1140 else if (mip->mi_result > res) | |
| 339 | 1141 { |
| 1142 mip->mi_result = res; | |
| 1143 mip->mi_end = mip->mi_word + wlen; | |
| 1144 } | |
| 351 | 1145 else if (mip->mi_result == res && mip->mi_end < mip->mi_word + wlen) |
| 339 | 1146 mip->mi_end = mip->mi_word + wlen; |
| 1147 | |
| 492 | 1148 if (mip->mi_result == SP_OK) |
| 339 | 1149 break; |
| 300 | 1150 } |
| 1151 | |
| 492 | 1152 if (mip->mi_result == SP_OK) |
| 300 | 1153 break; |
| 1154 } | |
| 236 | 1155 } |
| 1156 | |
| 323 | 1157 /* |
| 1762 | 1158 * Return TRUE if there is a match between the word ptr[wlen] and |
| 1159 * CHECKCOMPOUNDPATTERN rules, assuming that we will concatenate with another | |
| 1160 * word. | |
| 1161 * A match means that the first part of CHECKCOMPOUNDPATTERN matches at the | |
| 1162 * end of ptr[wlen] and the second part matches after it. | |
| 1163 */ | |
| 1164 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1165 match_checkcompoundpattern( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1166 char_u *ptr, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1167 int wlen, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1168 garray_T *gap) /* &sl_comppat */ |
| 1762 | 1169 { |
| 1170 int i; | |
| 1171 char_u *p; | |
| 1172 int len; | |
| 1173 | |
| 1174 for (i = 0; i + 1 < gap->ga_len; i += 2) | |
| 1175 { | |
| 1176 p = ((char_u **)gap->ga_data)[i + 1]; | |
| 1177 if (STRNCMP(ptr + wlen, p, STRLEN(p)) == 0) | |
| 1178 { | |
| 1179 /* Second part matches at start of following compound word, now | |
| 1180 * check if first part matches at end of previous word. */ | |
| 1181 p = ((char_u **)gap->ga_data)[i]; | |
| 1771 | 1182 len = (int)STRLEN(p); |
| 1762 | 1183 if (len <= wlen && STRNCMP(ptr + wlen - len, p, len) == 0) |
| 1184 return TRUE; | |
| 1185 } | |
| 1186 } | |
| 1187 return FALSE; | |
| 1188 } | |
| 1189 | |
| 1190 /* | |
| 626 | 1191 * Return TRUE if "flags" is a valid sequence of compound flags and "word" |
| 1192 * does not have too many syllables. | |
| 482 | 1193 */ |
| 1194 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1195 can_compound(slang_T *slang, char_u *word, char_u *flags) |
| 483 | 1196 { |
| 495 | 1197 #ifdef FEAT_MBYTE |
| 1198 char_u uflags[MAXWLEN * 2]; | |
| 1199 int i; | |
| 1200 #endif | |
| 1201 char_u *p; | |
| 483 | 1202 |
| 1203 if (slang->sl_compprog == NULL) | |
| 1204 return FALSE; | |
| 495 | 1205 #ifdef FEAT_MBYTE |
| 1206 if (enc_utf8) | |
| 1207 { | |
| 1208 /* Need to convert the single byte flags to utf8 characters. */ | |
| 1209 p = uflags; | |
| 1210 for (i = 0; flags[i] != NUL; ++i) | |
|
11269
121d29004998
patch 8.0.0520: using a function pointer while the function is known
Christian Brabandt <cb@256bit.org>
parents:
11129
diff
changeset
|
1211 p += utf_char2bytes(flags[i], p); |
| 495 | 1212 *p = NUL; |
| 1213 p = uflags; | |
| 1214 } | |
| 1215 else | |
| 1216 #endif | |
| 1217 p = flags; | |
| 6375 | 1218 if (!vim_regexec_prog(&slang->sl_compprog, FALSE, p, 0)) |
| 483 | 1219 return FALSE; |
| 1220 | |
| 490 | 1221 /* Count the number of syllables. This may be slow, do it last. If there |
| 1222 * are too many syllables AND the number of compound words is above | |
| 809 | 1223 * COMPOUNDWORDMAX then compounding is not allowed. */ |
| 483 | 1224 if (slang->sl_compsylmax < MAXWLEN |
| 1225 && count_syllables(slang, word) > slang->sl_compsylmax) | |
| 495 | 1226 return (int)STRLEN(flags) < slang->sl_compmax; |
| 483 | 1227 return TRUE; |
| 482 | 1228 } |
| 1229 | |
| 1230 /* | |
| 1762 | 1231 * Return TRUE when the sequence of flags in "compflags" plus "flag" can |
| 1232 * possibly form a valid compounded word. This also checks the COMPOUNDRULE | |
| 1233 * lines if they don't contain wildcards. | |
| 1234 */ | |
| 1235 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1236 can_be_compound( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1237 trystate_T *sp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1238 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1239 char_u *compflags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1240 int flag) |
| 1762 | 1241 { |
| 1242 /* If the flag doesn't appear in sl_compstartflags or sl_compallflags | |
| 1243 * then it can't possibly compound. */ | |
| 1244 if (!byte_in_str(sp->ts_complen == sp->ts_compsplit | |
| 1245 ? slang->sl_compstartflags : slang->sl_compallflags, flag)) | |
| 1246 return FALSE; | |
| 1247 | |
| 1248 /* If there are no wildcards, we can check if the flags collected so far | |
| 1249 * possibly can form a match with COMPOUNDRULE patterns. This only | |
| 1250 * makes sense when we have two or more words. */ | |
| 1251 if (slang->sl_comprules != NULL && sp->ts_complen > sp->ts_compsplit) | |
| 1252 { | |
| 1253 int v; | |
| 1254 | |
| 1255 compflags[sp->ts_complen] = flag; | |
| 1256 compflags[sp->ts_complen + 1] = NUL; | |
| 1257 v = match_compoundrule(slang, compflags + sp->ts_compsplit); | |
| 1258 compflags[sp->ts_complen] = NUL; | |
| 1259 return v; | |
| 1260 } | |
| 1261 | |
| 1262 return TRUE; | |
| 1263 } | |
| 1264 | |
| 1265 | |
| 1266 /* | |
| 1267 * Return TRUE if the compound flags in compflags[] match the start of any | |
| 1268 * compound rule. This is used to stop trying a compound if the flags | |
| 1269 * collected so far can't possibly match any compound rule. | |
| 1270 * Caller must check that slang->sl_comprules is not NULL. | |
| 1271 */ | |
| 1272 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1273 match_compoundrule(slang_T *slang, char_u *compflags) |
| 1762 | 1274 { |
| 1275 char_u *p; | |
| 1276 int i; | |
| 1277 int c; | |
| 1278 | |
| 1279 /* loop over all the COMPOUNDRULE entries */ | |
| 1280 for (p = slang->sl_comprules; *p != NUL; ++p) | |
| 1281 { | |
| 1282 /* loop over the flags in the compound word we have made, match | |
| 1283 * them against the current rule entry */ | |
| 1284 for (i = 0; ; ++i) | |
| 1285 { | |
| 1286 c = compflags[i]; | |
| 1287 if (c == NUL) | |
| 1288 /* found a rule that matches for the flags we have so far */ | |
| 1289 return TRUE; | |
| 1290 if (*p == '/' || *p == NUL) | |
| 1291 break; /* end of rule, it's too short */ | |
| 1292 if (*p == '[') | |
| 1293 { | |
| 1294 int match = FALSE; | |
| 1295 | |
| 1296 /* compare against all the flags in [] */ | |
| 1297 ++p; | |
| 1298 while (*p != ']' && *p != NUL) | |
| 1299 if (*p++ == c) | |
| 1300 match = TRUE; | |
| 1301 if (!match) | |
| 1302 break; /* none matches */ | |
| 1303 } | |
| 1304 else if (*p != c) | |
| 1305 break; /* flag of word doesn't match flag in pattern */ | |
| 1306 ++p; | |
| 1307 } | |
| 1308 | |
| 1309 /* Skip to the next "/", where the next pattern starts. */ | |
| 1310 p = vim_strchr(p, '/'); | |
| 1311 if (p == NULL) | |
| 1312 break; | |
| 1313 } | |
| 1314 | |
| 1315 /* Checked all the rules and none of them match the flags, so there | |
| 1316 * can't possibly be a compound starting with these flags. */ | |
| 1317 return FALSE; | |
| 1318 } | |
| 1319 | |
| 1320 /* | |
| 390 | 1321 * Return non-zero if the prefix indicated by "arridx" matches with the prefix |
| 1322 * ID in "flags" for the word "word". | |
| 366 | 1323 * The WF_RAREPFX flag is included in the return value for a rare prefix. |
| 351 | 1324 */ |
| 1325 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1326 valid_word_prefix( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1327 int totprefcnt, /* nr of prefix IDs */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1328 int arridx, /* idx in sl_pidxs[] */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1329 int flags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1330 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1331 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1332 int cond_req) /* only use prefixes with a condition */ |
| 351 | 1333 { |
| 1334 int prefcnt; | |
| 1335 int pidx; | |
| 6375 | 1336 regprog_T **rp; |
| 390 | 1337 int prefid; |
| 1338 | |
| 1339 prefid = (unsigned)flags >> 24; | |
| 351 | 1340 for (prefcnt = totprefcnt - 1; prefcnt >= 0; --prefcnt) |
| 1341 { | |
| 1342 pidx = slang->sl_pidxs[arridx + prefcnt]; | |
| 1343 | |
| 1344 /* Check the prefix ID. */ | |
| 1345 if (prefid != (pidx & 0xff)) | |
| 1346 continue; | |
| 1347 | |
| 390 | 1348 /* Check if the prefix doesn't combine and the word already has a |
| 1349 * suffix. */ | |
| 1350 if ((flags & WF_HAS_AFF) && (pidx & WF_PFX_NC)) | |
| 1351 continue; | |
| 1352 | |
| 351 | 1353 /* Check the condition, if there is one. The condition index is |
| 366 | 1354 * stored in the two bytes above the prefix ID byte. */ |
| 6375 | 1355 rp = &slang->sl_prefprog[((unsigned)pidx >> 8) & 0xffff]; |
| 1356 if (*rp != NULL) | |
| 1357 { | |
| 1358 if (!vim_regexec_prog(rp, FALSE, word, 0)) | |
| 351 | 1359 continue; |
| 1360 } | |
| 455 | 1361 else if (cond_req) |
| 1362 continue; | |
| 1363 | |
| 1364 /* It's a match! Return the WF_ flags. */ | |
| 366 | 1365 return pidx; |
| 1366 } | |
| 1367 return 0; | |
| 351 | 1368 } |
| 1369 | |
| 1370 /* | |
| 339 | 1371 * Check if the word at "mip->mi_word" has a matching prefix. |
| 1372 * If it does, then check the following word. | |
| 1373 * | |
| 485 | 1374 * If "mode" is "FIND_COMPOUND" then do the same after another word, find a |
| 1375 * prefix in a compound word. | |
| 1376 * | |
| 339 | 1377 * For a match mip->mi_result is updated. |
| 1378 */ | |
| 1379 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1380 find_prefix(matchinf_T *mip, int mode) |
| 339 | 1381 { |
| 1382 idx_T arridx = 0; | |
| 1383 int len; | |
| 1384 int wlen = 0; | |
| 1385 int flen; | |
| 1386 int c; | |
| 1387 char_u *ptr; | |
| 1388 idx_T lo, hi, m; | |
| 1389 slang_T *slang = mip->mi_lp->lp_slang; | |
| 1390 char_u *byts; | |
| 1391 idx_T *idxs; | |
| 1392 | |
| 375 | 1393 byts = slang->sl_pbyts; |
| 1394 if (byts == NULL) | |
| 1395 return; /* array is empty */ | |
| 1396 | |
| 339 | 1397 /* We use the case-folded word here, since prefixes are always |
| 1398 * case-folded. */ | |
| 1399 ptr = mip->mi_fword; | |
| 1400 flen = mip->mi_fwordlen; /* available case-folded bytes */ | |
| 485 | 1401 if (mode == FIND_COMPOUND) |
| 1402 { | |
| 1403 /* Skip over the previously found word(s). */ | |
| 1404 ptr += mip->mi_compoff; | |
| 1405 flen -= mip->mi_compoff; | |
| 1406 } | |
| 339 | 1407 idxs = slang->sl_pidxs; |
| 1408 | |
| 1409 /* | |
| 1410 * Repeat advancing in the tree until: | |
| 1411 * - there is a byte that doesn't match, | |
| 1412 * - we reach the end of the tree, | |
| 1413 * - or we reach the end of the line. | |
| 1414 */ | |
| 1415 for (;;) | |
| 1416 { | |
| 1417 if (flen == 0 && *mip->mi_fend != NUL) | |
| 1418 flen = fold_more(mip); | |
| 1419 | |
| 1420 len = byts[arridx++]; | |
| 1421 | |
| 1422 /* If the first possible byte is a zero the prefix could end here. | |
| 1423 * Check if the following word matches and supports the prefix. */ | |
| 1424 if (byts[arridx] == 0) | |
| 1425 { | |
| 1426 /* There can be several prefixes with different conditions. We | |
| 1427 * try them all, since we don't know which one will give the | |
| 1428 * longest match. The word is the same each time, pass the list | |
| 1429 * of possible prefixes to find_word(). */ | |
| 1430 mip->mi_prefarridx = arridx; | |
| 1431 mip->mi_prefcnt = len; | |
| 1432 while (len > 0 && byts[arridx] == 0) | |
| 1433 { | |
| 1434 ++arridx; | |
| 1435 --len; | |
| 1436 } | |
| 1437 mip->mi_prefcnt -= len; | |
| 1438 | |
| 1439 /* Find the word that comes after the prefix. */ | |
| 1440 mip->mi_prefixlen = wlen; | |
| 485 | 1441 if (mode == FIND_COMPOUND) |
| 1442 /* Skip over the previously found word(s). */ | |
| 1443 mip->mi_prefixlen += mip->mi_compoff; | |
| 1444 | |
| 455 | 1445 #ifdef FEAT_MBYTE |
| 1446 if (has_mbyte) | |
| 1447 { | |
| 1448 /* Case-folded length may differ from original length. */ | |
| 485 | 1449 mip->mi_cprefixlen = nofold_len(mip->mi_fword, |
| 1450 mip->mi_prefixlen, mip->mi_word); | |
| 455 | 1451 } |
| 1452 else | |
| 485 | 1453 mip->mi_cprefixlen = mip->mi_prefixlen; |
| 455 | 1454 #endif |
| 339 | 1455 find_word(mip, FIND_PREFIX); |
| 1456 | |
| 1457 | |
| 1458 if (len == 0) | |
| 1459 break; /* no children, word must end here */ | |
| 1460 } | |
| 1461 | |
| 1462 /* Stop looking at end of the line. */ | |
| 1463 if (ptr[wlen] == NUL) | |
| 1464 break; | |
| 1465 | |
| 1466 /* Perform a binary search in the list of accepted bytes. */ | |
| 1467 c = ptr[wlen]; | |
| 1468 lo = arridx; | |
| 1469 hi = arridx + len - 1; | |
| 1470 while (lo < hi) | |
| 1471 { | |
| 1472 m = (lo + hi) / 2; | |
| 1473 if (byts[m] > c) | |
| 1474 hi = m - 1; | |
| 1475 else if (byts[m] < c) | |
| 1476 lo = m + 1; | |
| 1477 else | |
| 1478 { | |
| 1479 lo = hi = m; | |
| 1480 break; | |
| 1481 } | |
| 1482 } | |
| 1483 | |
| 1484 /* Stop if there is no matching byte. */ | |
| 1485 if (hi < lo || byts[lo] != c) | |
| 1486 break; | |
| 1487 | |
| 1488 /* Continue at the child (if there is one). */ | |
| 1489 arridx = idxs[lo]; | |
| 1490 ++wlen; | |
| 1491 --flen; | |
| 1492 } | |
| 1493 } | |
| 1494 | |
| 1495 /* | |
| 1496 * Need to fold at least one more character. Do until next non-word character | |
| 626 | 1497 * for efficiency. Include the non-word character too. |
| 339 | 1498 * Return the length of the folded chars in bytes. |
| 1499 */ | |
| 1500 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1501 fold_more(matchinf_T *mip) |
| 339 | 1502 { |
| 1503 int flen; | |
| 1504 char_u *p; | |
| 1505 | |
| 1506 p = mip->mi_fend; | |
| 1507 do | |
| 1508 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
1509 MB_PTR_ADV(mip->mi_fend); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1510 } while (*mip->mi_fend != NUL && spell_iswordp(mip->mi_fend, mip->mi_win)); |
| 339 | 1511 |
| 626 | 1512 /* Include the non-word character so that we can check for the word end. */ |
| 339 | 1513 if (*mip->mi_fend != NUL) |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
1514 MB_PTR_ADV(mip->mi_fend); |
| 339 | 1515 |
| 1516 (void)spell_casefold(p, (int)(mip->mi_fend - p), | |
| 1517 mip->mi_fword + mip->mi_fwordlen, | |
| 1518 MAXWLEN - mip->mi_fwordlen); | |
| 835 | 1519 flen = (int)STRLEN(mip->mi_fword + mip->mi_fwordlen); |
| 339 | 1520 mip->mi_fwordlen += flen; |
| 1521 return flen; | |
| 1522 } | |
| 1523 | |
| 1524 /* | |
| 323 | 1525 * Check case flags for a word. Return TRUE if the word has the requested |
| 1526 * case. | |
| 1527 */ | |
| 1528 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1529 spell_valid_case( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1530 int wordflags, /* flags for the checked word. */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1531 int treeflags) /* flags for the word in the spell tree */ |
| 323 | 1532 { |
| 389 | 1533 return ((wordflags == WF_ALLCAP && (treeflags & WF_FIXCAP) == 0) |
| 323 | 1534 || ((treeflags & (WF_ALLCAP | WF_KEEPCAP)) == 0 |
| 474 | 1535 && ((treeflags & WF_ONECAP) == 0 |
| 1536 || (wordflags & WF_ONECAP) != 0))); | |
| 323 | 1537 } |
| 1538 | |
| 351 | 1539 /* |
| 1540 * Return TRUE if spell checking is not enabled. | |
| 1541 */ | |
| 1542 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1543 no_spell_checking(win_T *wp) |
| 498 | 1544 { |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1545 if (!wp->w_p_spell || *wp->w_s->b_p_spl == NUL |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1546 || wp->w_s->b_langp.ga_len == 0) |
| 351 | 1547 { |
| 1548 EMSG(_("E756: Spell checking is not enabled")); | |
| 1549 return TRUE; | |
| 1550 } | |
| 1551 return FALSE; | |
| 1552 } | |
| 300 | 1553 |
| 236 | 1554 /* |
| 1555 * Move to next spell error. | |
| 500 | 1556 * "curline" is FALSE for "[s", "]s", "[S" and "]S". |
| 1557 * "curline" is TRUE to find word under/after cursor in the same line. | |
| 483 | 1558 * For Insert mode completion "dir" is BACKWARD and "curline" is TRUE: move |
| 1559 * to after badly spelled word before the cursor. | |
| 495 | 1560 * Return 0 if not found, length of the badly spelled word otherwise. |
| 236 | 1561 */ |
| 1562 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1563 spell_move_to( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1564 win_T *wp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1565 int dir, /* FORWARD or BACKWARD */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1566 int allwords, /* TRUE for "[s"/"]s", FALSE for "[S"/"]S" */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1567 int curline, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1568 hlf_T *attrp) /* return: attributes of bad word or NULL |
| 534 | 1569 (only when "dir" is FORWARD) */ |
| 236 | 1570 { |
| 249 | 1571 linenr_T lnum; |
| 1572 pos_T found_pos; | |
| 495 | 1573 int found_len = 0; |
| 236 | 1574 char_u *line; |
| 1575 char_u *p; | |
| 346 | 1576 char_u *endp; |
| 534 | 1577 hlf_T attr; |
| 236 | 1578 int len; |
| 5519 | 1579 #ifdef FEAT_SYN_HL |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1580 int has_syntax = syntax_present(wp); |
| 5519 | 1581 #endif |
| 249 | 1582 int col; |
| 1583 int can_spell; | |
| 346 | 1584 char_u *buf = NULL; |
| 1585 int buflen = 0; | |
| 1586 int skip = 0; | |
| 385 | 1587 int capcol = -1; |
| 500 | 1588 int found_one = FALSE; |
| 1589 int wrapped = FALSE; | |
| 236 | 1590 |
| 498 | 1591 if (no_spell_checking(wp)) |
| 495 | 1592 return 0; |
| 236 | 1593 |
| 249 | 1594 /* |
| 1595 * Start looking for bad word at the start of the line, because we can't | |
| 817 | 1596 * start halfway a word, we don't know where it starts or ends. |
| 249 | 1597 * |
| 1598 * When searching backwards, we continue in the line to find the last | |
| 1599 * bad word (in the cursor line: before the cursor). | |
| 346 | 1600 * |
| 1601 * We concatenate the start of the next line, so that wrapped words work | |
| 1602 * (e.g. "et<line-break>cetera"). Doesn't work when searching backwards | |
| 1603 * though... | |
| 249 | 1604 */ |
| 498 | 1605 lnum = wp->w_cursor.lnum; |
|
11121
778c10516955
patch 8.0.0448: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
10950
diff
changeset
|
1606 CLEAR_POS(&found_pos); |
| 236 | 1607 |
| 1608 while (!got_int) | |
| 1609 { | |
| 498 | 1610 line = ml_get_buf(wp->w_buffer, lnum, FALSE); |
| 346 | 1611 |
| 835 | 1612 len = (int)STRLEN(line); |
| 346 | 1613 if (buflen < len + MAXWLEN + 2) |
| 1614 { | |
| 1615 vim_free(buf); | |
| 1616 buflen = len + MAXWLEN + 2; | |
| 1617 buf = alloc(buflen); | |
| 1618 if (buf == NULL) | |
| 1619 break; | |
| 1620 } | |
| 1621 | |
| 385 | 1622 /* In first line check first word for Capital. */ |
| 1623 if (lnum == 1) | |
| 1624 capcol = 0; | |
| 1625 | |
| 1626 /* For checking first word with a capital skip white space. */ | |
| 1627 if (capcol == 0) | |
|
12323
4dba3e4f3b01
patch 8.0.1041: bogus characters when indenting during visual-block append
Christian Brabandt <cb@256bit.org>
parents:
11521
diff
changeset
|
1628 capcol = getwhitecols(line); |
| 835 | 1629 else if (curline && wp == curwin) |
| 1630 { | |
| 1631 /* For spellbadword(): check if first word needs a capital. */ | |
|
12323
4dba3e4f3b01
patch 8.0.1041: bogus characters when indenting during visual-block append
Christian Brabandt <cb@256bit.org>
parents:
11521
diff
changeset
|
1632 col = getwhitecols(line); |
| 835 | 1633 if (check_need_cap(lnum, col)) |
| 1634 capcol = col; | |
| 1635 | |
| 1636 /* Need to get the line again, may have looked at the previous | |
| 1637 * one. */ | |
| 1638 line = ml_get_buf(wp->w_buffer, lnum, FALSE); | |
| 1639 } | |
| 385 | 1640 |
| 346 | 1641 /* Copy the line into "buf" and append the start of the next line if |
| 1642 * possible. */ | |
| 1643 STRCPY(buf, line); | |
| 498 | 1644 if (lnum < wp->w_buffer->b_ml.ml_line_count) |
| 883 | 1645 spell_cat_line(buf + STRLEN(buf), |
| 1646 ml_get_buf(wp->w_buffer, lnum + 1, FALSE), MAXWLEN); | |
| 346 | 1647 |
| 1648 p = buf + skip; | |
| 1649 endp = buf + len; | |
| 1650 while (p < endp) | |
| 236 | 1651 { |
| 500 | 1652 /* When searching backward don't search after the cursor. Unless |
| 1653 * we wrapped around the end of the buffer. */ | |
| 300 | 1654 if (dir == BACKWARD |
| 498 | 1655 && lnum == wp->w_cursor.lnum |
| 500 | 1656 && !wrapped |
| 498 | 1657 && (colnr_T)(p - buf) >= wp->w_cursor.col) |
| 300 | 1658 break; |
| 249 | 1659 |
| 300 | 1660 /* start of word */ |
| 534 | 1661 attr = HLF_COUNT; |
| 625 | 1662 len = spell_check(wp, p, &attr, &capcol, FALSE); |
| 249 | 1663 |
| 534 | 1664 if (attr != HLF_COUNT) |
| 300 | 1665 { |
| 1666 /* We found a bad word. Check the attribute. */ | |
| 534 | 1667 if (allwords || attr == HLF_SPB) |
| 236 | 1668 { |
| 300 | 1669 /* When searching forward only accept a bad word after |
| 1670 * the cursor. */ | |
| 1671 if (dir == BACKWARD | |
| 500 | 1672 || lnum != wp->w_cursor.lnum |
| 498 | 1673 || (lnum == wp->w_cursor.lnum |
| 500 | 1674 && (wrapped |
| 1675 || (colnr_T)(curline ? p - buf + len | |
| 346 | 1676 : p - buf) |
| 500 | 1677 > wp->w_cursor.col))) |
| 236 | 1678 { |
| 5519 | 1679 #ifdef FEAT_SYN_HL |
| 300 | 1680 if (has_syntax) |
| 249 | 1681 { |
| 835 | 1682 col = (int)(p - buf); |
| 498 | 1683 (void)syn_get_id(wp, lnum, (colnr_T)col, |
| 1504 | 1684 FALSE, &can_spell, FALSE); |
| 857 | 1685 if (!can_spell) |
| 1686 attr = HLF_COUNT; | |
| 300 | 1687 } |
| 1688 else | |
| 737 | 1689 #endif |
| 300 | 1690 can_spell = TRUE; |
| 249 | 1691 |
| 300 | 1692 if (can_spell) |
| 1693 { | |
| 857 | 1694 found_one = TRUE; |
| 300 | 1695 found_pos.lnum = lnum; |
| 835 | 1696 found_pos.col = (int)(p - buf); |
| 249 | 1697 #ifdef FEAT_VIRTUALEDIT |
| 300 | 1698 found_pos.coladd = 0; |
| 249 | 1699 #endif |
| 300 | 1700 if (dir == FORWARD) |
| 1701 { | |
| 1702 /* No need to search further. */ | |
| 498 | 1703 wp->w_cursor = found_pos; |
| 346 | 1704 vim_free(buf); |
| 498 | 1705 if (attrp != NULL) |
| 1706 *attrp = attr; | |
| 495 | 1707 return len; |
| 249 | 1708 } |
| 483 | 1709 else if (curline) |
| 1710 /* Insert mode completion: put cursor after | |
| 1711 * the bad word. */ | |
| 1712 found_pos.col += len; | |
| 495 | 1713 found_len = len; |
| 249 | 1714 } |
| 236 | 1715 } |
| 857 | 1716 else |
| 1717 found_one = TRUE; | |
| 236 | 1718 } |
| 1719 } | |
| 1720 | |
| 300 | 1721 /* advance to character after the word */ |
| 1722 p += len; | |
| 385 | 1723 capcol -= len; |
| 236 | 1724 } |
| 1725 | |
| 483 | 1726 if (dir == BACKWARD && found_pos.lnum != 0) |
| 1727 { | |
| 500 | 1728 /* Use the last match in the line (before the cursor). */ |
| 498 | 1729 wp->w_cursor = found_pos; |
| 483 | 1730 vim_free(buf); |
| 495 | 1731 return found_len; |
| 483 | 1732 } |
| 1733 | |
| 323 | 1734 if (curline) |
| 346 | 1735 break; /* only check cursor line */ |
| 323 | 1736 |
|
10950
2297aae8e127
patch 8.0.0364: ]s does not move cursor with two spell errors in one line
Christian Brabandt <cb@256bit.org>
parents:
10359
diff
changeset
|
1737 /* If we are back at the starting line and searched it again there |
|
2297aae8e127
patch 8.0.0364: ]s does not move cursor with two spell errors in one line
Christian Brabandt <cb@256bit.org>
parents:
10359
diff
changeset
|
1738 * is no match, give up. */ |
|
2297aae8e127
patch 8.0.0364: ]s does not move cursor with two spell errors in one line
Christian Brabandt <cb@256bit.org>
parents:
10359
diff
changeset
|
1739 if (lnum == wp->w_cursor.lnum && wrapped) |
|
2297aae8e127
patch 8.0.0364: ]s does not move cursor with two spell errors in one line
Christian Brabandt <cb@256bit.org>
parents:
10359
diff
changeset
|
1740 break; |
|
2297aae8e127
patch 8.0.0364: ]s does not move cursor with two spell errors in one line
Christian Brabandt <cb@256bit.org>
parents:
10359
diff
changeset
|
1741 |
| 236 | 1742 /* Advance to next line. */ |
| 249 | 1743 if (dir == BACKWARD) |
| 1744 { | |
| 500 | 1745 if (lnum > 1) |
| 1746 --lnum; | |
| 1747 else if (!p_ws) | |
| 1748 break; /* at first line and 'nowrapscan' */ | |
| 1749 else | |
| 1750 { | |
| 1751 /* Wrap around to the end of the buffer. May search the | |
| 1752 * starting line again and accept the last match. */ | |
| 1753 lnum = wp->w_buffer->b_ml.ml_line_count; | |
| 1754 wrapped = TRUE; | |
| 503 | 1755 if (!shortmess(SHM_SEARCH)) |
| 1756 give_warning((char_u *)_(top_bot_msg), TRUE); | |
| 500 | 1757 } |
| 385 | 1758 capcol = -1; |
| 249 | 1759 } |
| 1760 else | |
| 1761 { | |
| 500 | 1762 if (lnum < wp->w_buffer->b_ml.ml_line_count) |
| 1763 ++lnum; | |
| 1764 else if (!p_ws) | |
| 1765 break; /* at first line and 'nowrapscan' */ | |
| 1766 else | |
| 1767 { | |
| 1768 /* Wrap around to the start of the buffer. May search the | |
| 1769 * starting line again and accept the first match. */ | |
| 1770 lnum = 1; | |
| 1771 wrapped = TRUE; | |
| 503 | 1772 if (!shortmess(SHM_SEARCH)) |
| 1773 give_warning((char_u *)_(bot_top_msg), TRUE); | |
| 500 | 1774 } |
| 1775 | |
| 1776 /* If we are back at the starting line and there is no match then | |
| 1777 * give up. */ | |
|
10950
2297aae8e127
patch 8.0.0364: ]s does not move cursor with two spell errors in one line
Christian Brabandt <cb@256bit.org>
parents:
10359
diff
changeset
|
1778 if (lnum == wp->w_cursor.lnum && !found_one) |
| 346 | 1779 break; |
| 1780 | |
| 1781 /* Skip the characters at the start of the next line that were | |
| 1782 * included in a match crossing line boundaries. */ | |
| 534 | 1783 if (attr == HLF_COUNT) |
| 835 | 1784 skip = (int)(p - endp); |
| 346 | 1785 else |
| 1786 skip = 0; | |
| 385 | 1787 |
| 835 | 1788 /* Capcol skips over the inserted space. */ |
| 385 | 1789 --capcol; |
| 1790 | |
| 1791 /* But after empty line check first word in next line */ | |
| 1792 if (*skipwhite(line) == NUL) | |
| 1793 capcol = 0; | |
| 249 | 1794 } |
| 236 | 1795 |
| 1796 line_breakcheck(); | |
| 1797 } | |
| 1798 | |
| 346 | 1799 vim_free(buf); |
| 495 | 1800 return 0; |
| 346 | 1801 } |
| 1802 | |
| 1803 /* | |
| 1804 * For spell checking: concatenate the start of the following line "line" into | |
| 1805 * "buf", blanking-out special characters. Copy less then "maxlen" bytes. | |
| 1577 | 1806 * Keep the blanks at the start of the next line, this is used in win_line() |
| 1807 * to skip those bytes if the word was OK. | |
| 346 | 1808 */ |
| 1809 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1810 spell_cat_line(char_u *buf, char_u *line, int maxlen) |
| 346 | 1811 { |
| 1812 char_u *p; | |
| 1813 int n; | |
| 1814 | |
| 1815 p = skipwhite(line); | |
| 1816 while (vim_strchr((char_u *)"*#/\"\t", *p) != NULL) | |
| 1817 p = skipwhite(p + 1); | |
| 1818 | |
| 1819 if (*p != NUL) | |
| 1820 { | |
| 1577 | 1821 /* Only worth concatenating if there is something else than spaces to |
| 1822 * concatenate. */ | |
| 1823 n = (int)(p - line) + 1; | |
| 1824 if (n < maxlen - 1) | |
| 1825 { | |
| 1826 vim_memset(buf, ' ', n); | |
| 1827 vim_strncpy(buf + n, p, maxlen - 1 - n); | |
| 1828 } | |
| 346 | 1829 } |
| 236 | 1830 } |
| 1831 | |
| 626 | 1832 /* |
| 1833 * Structure used for the cookie argument of do_in_runtimepath(). | |
| 1834 */ | |
| 501 | 1835 typedef struct spelload_S |
| 1836 { | |
| 1837 char_u sl_lang[MAXWLEN + 1]; /* language name */ | |
| 1838 slang_T *sl_slang; /* resulting slang_T struct */ | |
| 1839 int sl_nobreak; /* NOBREAK language found */ | |
| 1840 } spelload_T; | |
| 1841 | |
| 236 | 1842 /* |
| 307 | 1843 * Load word list(s) for "lang" from Vim spell file(s). |
| 310 | 1844 * "lang" must be the language without the region: e.g., "en". |
| 236 | 1845 */ |
| 307 | 1846 static void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1847 spell_load_lang(char_u *lang) |
| 236 | 1848 { |
| 310 | 1849 char_u fname_enc[85]; |
| 236 | 1850 int r; |
| 501 | 1851 spelload_T sl; |
| 649 | 1852 #ifdef FEAT_AUTOCMD |
| 1853 int round; | |
| 1854 #endif | |
| 307 | 1855 |
| 310 | 1856 /* Copy the language name to pass it to spell_load_cb() as a cookie. |
| 307 | 1857 * It's truncated when an error is detected. */ |
| 501 | 1858 STRCPY(sl.sl_lang, lang); |
| 1859 sl.sl_slang = NULL; | |
| 1860 sl.sl_nobreak = FALSE; | |
| 307 | 1861 |
| 649 | 1862 #ifdef FEAT_AUTOCMD |
| 1863 /* We may retry when no spell file is found for the language, an | |
| 1864 * autocommand may load it then. */ | |
| 1865 for (round = 1; round <= 2; ++round) | |
| 1866 #endif | |
| 1867 { | |
| 1868 /* | |
| 1869 * Find the first spell file for "lang" in 'runtimepath' and load it. | |
| 1870 */ | |
| 1871 vim_snprintf((char *)fname_enc, sizeof(fname_enc) - 5, | |
| 2660 | 1872 #ifdef VMS |
| 1873 "spell/%s_%s.spl", | |
| 1874 #else | |
| 1875 "spell/%s.%s.spl", | |
| 1876 #endif | |
| 1877 lang, spell_enc()); | |
|
8524
2f57bbe870ea
commit https://github.com/vim/vim/commit/7f8989dd8a627af2185df381195351a913f3777f
Christian Brabandt <cb@256bit.org>
parents:
7835
diff
changeset
|
1878 r = do_in_runtimepath(fname_enc, 0, spell_load_cb, &sl); |
| 649 | 1879 |
| 1880 if (r == FAIL && *sl.sl_lang != NUL) | |
| 1881 { | |
| 1882 /* Try loading the ASCII version. */ | |
| 1883 vim_snprintf((char *)fname_enc, sizeof(fname_enc) - 5, | |
| 2660 | 1884 #ifdef VMS |
| 1885 "spell/%s_ascii.spl", | |
| 1886 #else | |
| 1887 "spell/%s.ascii.spl", | |
| 1888 #endif | |
| 1889 lang); | |
|
8524
2f57bbe870ea
commit https://github.com/vim/vim/commit/7f8989dd8a627af2185df381195351a913f3777f
Christian Brabandt <cb@256bit.org>
parents:
7835
diff
changeset
|
1890 r = do_in_runtimepath(fname_enc, 0, spell_load_cb, &sl); |
| 649 | 1891 |
| 1892 #ifdef FEAT_AUTOCMD | |
| 1893 if (r == FAIL && *sl.sl_lang != NUL && round == 1 | |
| 1894 && apply_autocmds(EVENT_SPELLFILEMISSING, lang, | |
| 1895 curbuf->b_fname, FALSE, curbuf)) | |
| 1896 continue; | |
| 1897 break; | |
| 1898 #endif | |
| 1899 } | |
| 714 | 1900 #ifdef FEAT_AUTOCMD |
| 1901 break; | |
| 1902 #endif | |
| 307 | 1903 } |
| 1904 | |
| 1905 if (r == FAIL) | |
| 649 | 1906 { |
| 2660 | 1907 smsg((char_u *) |
| 1908 #ifdef VMS | |
| 1909 _("Warning: Cannot find word list \"%s_%s.spl\" or \"%s_ascii.spl\""), | |
| 1910 #else | |
| 1911 _("Warning: Cannot find word list \"%s.%s.spl\" or \"%s.ascii.spl\""), | |
| 1912 #endif | |
| 483 | 1913 lang, spell_enc(), lang); |
| 649 | 1914 } |
| 501 | 1915 else if (sl.sl_slang != NULL) |
| 1916 { | |
| 626 | 1917 /* At least one file was loaded, now load ALL the additions. */ |
| 310 | 1918 STRCPY(fname_enc + STRLEN(fname_enc) - 3, "add.spl"); |
|
8524
2f57bbe870ea
commit https://github.com/vim/vim/commit/7f8989dd8a627af2185df381195351a913f3777f
Christian Brabandt <cb@256bit.org>
parents:
7835
diff
changeset
|
1919 do_in_runtimepath(fname_enc, DIP_ALL, spell_load_cb, &sl); |
| 310 | 1920 } |
| 1921 } | |
| 1922 | |
| 1923 /* | |
| 1924 * Return the encoding used for spell checking: Use 'encoding', except that we | |
| 1925 * use "latin1" for "latin9". And limit to 60 characters (just in case). | |
| 1926 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
1927 char_u * |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1928 spell_enc(void) |
| 310 | 1929 { |
| 1930 | |
| 1931 #ifdef FEAT_MBYTE | |
| 1932 if (STRLEN(p_enc) < 60 && STRCMP(p_enc, "iso-8859-15") != 0) | |
| 1933 return p_enc; | |
| 1934 #endif | |
| 1935 return (char_u *)"latin1"; | |
| 236 | 1936 } |
| 1937 | |
| 1938 /* | |
| 385 | 1939 * Get the name of the .spl file for the internal wordlist into |
| 1940 * "fname[MAXPATHL]". | |
| 1941 */ | |
| 1942 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1943 int_wordlist_spl(char_u *fname) |
| 385 | 1944 { |
| 2660 | 1945 vim_snprintf((char *)fname, MAXPATHL, SPL_FNAME_TMPL, |
| 385 | 1946 int_wordlist, spell_enc()); |
| 1947 } | |
| 1948 | |
| 1949 /* | |
| 625 | 1950 * Allocate a new slang_T for language "lang". "lang" can be NULL. |
| 236 | 1951 * Caller must fill "sl_next". |
| 1952 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
1953 slang_T * |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1954 slang_alloc(char_u *lang) |
| 236 | 1955 { |
| 1956 slang_T *lp; | |
| 1957 | |
| 300 | 1958 lp = (slang_T *)alloc_clear(sizeof(slang_T)); |
| 236 | 1959 if (lp != NULL) |
| 1960 { | |
| 625 | 1961 if (lang != NULL) |
| 1962 lp->sl_name = vim_strsave(lang); | |
| 323 | 1963 ga_init2(&lp->sl_rep, sizeof(fromto_T), 10); |
| 625 | 1964 ga_init2(&lp->sl_repsal, sizeof(fromto_T), 10); |
| 483 | 1965 lp->sl_compmax = MAXWLEN; |
| 1966 lp->sl_compsylmax = MAXWLEN; | |
| 625 | 1967 hash_init(&lp->sl_wordcount); |
| 1968 } | |
| 1969 | |
| 236 | 1970 return lp; |
| 1971 } | |
| 1972 | |
| 1973 /* | |
| 1974 * Free the contents of an slang_T and the structure itself. | |
| 1975 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
1976 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1977 slang_free(slang_T *lp) |
| 236 | 1978 { |
| 1979 vim_free(lp->sl_name); | |
| 310 | 1980 vim_free(lp->sl_fname); |
| 1981 slang_clear(lp); | |
| 1982 vim_free(lp); | |
| 1983 } | |
| 1984 | |
| 1985 /* | |
| 1986 * Clear an slang_T so that the file can be reloaded. | |
| 1987 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
1988 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1989 slang_clear(slang_T *lp) |
| 310 | 1990 { |
| 339 | 1991 garray_T *gap; |
| 1992 fromto_T *ftp; | |
| 344 | 1993 salitem_T *smp; |
| 339 | 1994 int i; |
| 625 | 1995 int round; |
| 323 | 1996 |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
1997 VIM_CLEAR(lp->sl_fbyts); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
1998 VIM_CLEAR(lp->sl_kbyts); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
1999 VIM_CLEAR(lp->sl_pbyts); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2000 |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2001 VIM_CLEAR(lp->sl_fidxs); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2002 VIM_CLEAR(lp->sl_kidxs); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2003 VIM_CLEAR(lp->sl_pidxs); |
| 323 | 2004 |
| 625 | 2005 for (round = 1; round <= 2; ++round) |
| 2006 { | |
| 2007 gap = round == 1 ? &lp->sl_rep : &lp->sl_repsal; | |
| 2008 while (gap->ga_len > 0) | |
| 2009 { | |
| 2010 ftp = &((fromto_T *)gap->ga_data)[--gap->ga_len]; | |
| 2011 vim_free(ftp->ft_from); | |
| 2012 vim_free(ftp->ft_to); | |
| 2013 } | |
| 2014 ga_clear(gap); | |
| 2015 } | |
| 344 | 2016 |
| 2017 gap = &lp->sl_sal; | |
| 375 | 2018 if (lp->sl_sofo) |
| 376 | 2019 { |
| 2020 /* "ga_len" is set to 1 without adding an item for latin1 */ | |
| 2021 if (gap->ga_data != NULL) | |
| 2022 /* SOFOFROM and SOFOTO items: free lists of wide characters. */ | |
| 2023 for (i = 0; i < gap->ga_len; ++i) | |
| 2024 vim_free(((int **)gap->ga_data)[i]); | |
| 2025 } | |
| 375 | 2026 else |
| 2027 /* SAL items: free salitem_T items */ | |
| 2028 while (gap->ga_len > 0) | |
| 2029 { | |
| 2030 smp = &((salitem_T *)gap->ga_data)[--gap->ga_len]; | |
| 2031 vim_free(smp->sm_lead); | |
| 2032 /* Don't free sm_oneof and sm_rules, they point into sm_lead. */ | |
| 2033 vim_free(smp->sm_to); | |
| 2034 #ifdef FEAT_MBYTE | |
| 2035 vim_free(smp->sm_lead_w); | |
| 2036 vim_free(smp->sm_oneof_w); | |
| 2037 vim_free(smp->sm_to_w); | |
| 2038 #endif | |
| 2039 } | |
| 344 | 2040 ga_clear(gap); |
| 323 | 2041 |
| 339 | 2042 for (i = 0; i < lp->sl_prefixcnt; ++i) |
|
4805
66803af09906
updated for version 7.3.1149
Bram Moolenaar <bram@vim.org>
parents:
4352
diff
changeset
|
2043 vim_regfree(lp->sl_prefprog[i]); |
| 376 | 2044 lp->sl_prefixcnt = 0; |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2045 VIM_CLEAR(lp->sl_prefprog); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2046 |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2047 VIM_CLEAR(lp->sl_info); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2048 |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2049 VIM_CLEAR(lp->sl_midword); |
| 339 | 2050 |
|
4805
66803af09906
updated for version 7.3.1149
Bram Moolenaar <bram@vim.org>
parents:
4352
diff
changeset
|
2051 vim_regfree(lp->sl_compprog); |
| 483 | 2052 lp->sl_compprog = NULL; |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2053 VIM_CLEAR(lp->sl_comprules); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2054 VIM_CLEAR(lp->sl_compstartflags); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2055 VIM_CLEAR(lp->sl_compallflags); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2056 |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2057 VIM_CLEAR(lp->sl_syllable); |
| 483 | 2058 ga_clear(&lp->sl_syl_items); |
| 481 | 2059 |
| 809 | 2060 ga_clear_strings(&lp->sl_comppat); |
| 2061 | |
| 625 | 2062 hash_clear_all(&lp->sl_wordcount, WC_KEY_OFF); |
| 2063 hash_init(&lp->sl_wordcount); | |
| 2064 | |
| 2065 #ifdef FEAT_MBYTE | |
| 2066 hash_clear_all(&lp->sl_map_hash, 0); | |
| 2067 #endif | |
| 2068 | |
| 2069 /* Clear info from .sug file. */ | |
| 2070 slang_clear_sug(lp); | |
| 483 | 2071 |
| 2072 lp->sl_compmax = MAXWLEN; | |
| 501 | 2073 lp->sl_compminlen = 0; |
| 483 | 2074 lp->sl_compsylmax = MAXWLEN; |
| 2075 lp->sl_regions[0] = NUL; | |
| 236 | 2076 } |
| 2077 | |
| 2078 /* | |
| 625 | 2079 * Clear the info from the .sug file in "lp". |
| 2080 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2081 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2082 slang_clear_sug(slang_T *lp) |
| 625 | 2083 { |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2084 VIM_CLEAR(lp->sl_sbyts); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2085 VIM_CLEAR(lp->sl_sidxs); |
| 625 | 2086 close_spellbuf(lp->sl_sugbuf); |
| 2087 lp->sl_sugbuf = NULL; | |
| 2088 lp->sl_sugloaded = FALSE; | |
| 2089 lp->sl_sugtime = 0; | |
| 2090 } | |
| 2091 | |
| 2092 /* | |
| 307 | 2093 * Load one spell file and store the info into a slang_T. |
| 236 | 2094 * Invoked through do_in_runtimepath(). |
| 2095 */ | |
| 2096 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2097 spell_load_cb(char_u *fname, void *cookie) |
| 501 | 2098 { |
| 2099 spelload_T *slp = (spelload_T *)cookie; | |
| 2100 slang_T *slang; | |
| 2101 | |
| 2102 slang = spell_load_file(fname, slp->sl_lang, NULL, FALSE); | |
| 2103 if (slang != NULL) | |
| 2104 { | |
| 2105 /* When a previously loaded file has NOBREAK also use it for the | |
| 2106 * ".add" files. */ | |
| 2107 if (slp->sl_nobreak && slang->sl_add) | |
| 2108 slang->sl_nobreak = TRUE; | |
| 2109 else if (slang->sl_nobreak) | |
| 2110 slp->sl_nobreak = TRUE; | |
| 2111 | |
| 2112 slp->sl_slang = slang; | |
| 2113 } | |
| 310 | 2114 } |
| 2115 | |
| 625 | 2116 |
| 2117 /* | |
| 2118 * Add a word to the hashtable of common words. | |
| 2119 * If it's already there then the counter is increased. | |
| 2120 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2121 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2122 count_common_word( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2123 slang_T *lp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2124 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2125 int len, /* word length, -1 for upto NUL */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2126 int count) /* 1 to count once, 10 to init */ |
| 625 | 2127 { |
| 2128 hash_T hash; | |
| 2129 hashitem_T *hi; | |
| 2130 wordcount_T *wc; | |
| 2131 char_u buf[MAXWLEN]; | |
| 2132 char_u *p; | |
| 2133 | |
| 2134 if (len == -1) | |
| 2135 p = word; | |
| 2136 else | |
| 2137 { | |
| 2138 vim_strncpy(buf, word, len); | |
| 2139 p = buf; | |
| 2140 } | |
| 2141 | |
| 2142 hash = hash_hash(p); | |
| 2143 hi = hash_lookup(&lp->sl_wordcount, p, hash); | |
| 2144 if (HASHITEM_EMPTY(hi)) | |
| 2145 { | |
| 835 | 2146 wc = (wordcount_T *)alloc((unsigned)(sizeof(wordcount_T) + STRLEN(p))); |
| 625 | 2147 if (wc == NULL) |
| 2148 return; | |
| 2149 STRCPY(wc->wc_word, p); | |
| 2150 wc->wc_count = count; | |
| 2151 hash_add_item(&lp->sl_wordcount, hi, wc->wc_word, hash); | |
| 2152 } | |
| 2153 else | |
| 2154 { | |
| 2155 wc = HI2WC(hi); | |
| 2156 if ((wc->wc_count += count) < (unsigned)count) /* check for overflow */ | |
| 2157 wc->wc_count = MAXWORDCOUNT; | |
| 2158 } | |
| 2159 } | |
| 2160 | |
| 2161 /* | |
| 2162 * Adjust the score of common words. | |
| 2163 */ | |
| 2164 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2165 score_wordcount_adj( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2166 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2167 int score, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2168 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2169 int split) /* word was split, less bonus */ |
| 625 | 2170 { |
| 2171 hashitem_T *hi; | |
| 2172 wordcount_T *wc; | |
| 2173 int bonus; | |
| 2174 int newscore; | |
| 2175 | |
| 2176 hi = hash_find(&slang->sl_wordcount, word); | |
| 2177 if (!HASHITEM_EMPTY(hi)) | |
| 2178 { | |
| 2179 wc = HI2WC(hi); | |
| 2180 if (wc->wc_count < SCORE_THRES2) | |
| 2181 bonus = SCORE_COMMON1; | |
| 2182 else if (wc->wc_count < SCORE_THRES3) | |
| 2183 bonus = SCORE_COMMON2; | |
| 2184 else | |
| 2185 bonus = SCORE_COMMON3; | |
| 2186 if (split) | |
| 2187 newscore = score - bonus / 2; | |
| 2188 else | |
| 2189 newscore = score - bonus; | |
| 2190 if (newscore < 0) | |
| 2191 return 0; | |
| 2192 return newscore; | |
| 2193 } | |
| 2194 return score; | |
| 2195 } | |
| 2196 | |
| 483 | 2197 |
| 495 | 2198 /* |
| 498 | 2199 * Return TRUE if byte "n" appears in "str". |
| 495 | 2200 * Like strchr() but independent of locale. |
| 2201 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2202 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2203 byte_in_str(char_u *str, int n) |
| 495 | 2204 { |
| 2205 char_u *p; | |
| 2206 | |
| 2207 for (p = str; *p != NUL; ++p) | |
| 498 | 2208 if (*p == n) |
| 495 | 2209 return TRUE; |
| 2210 return FALSE; | |
| 2211 } | |
| 2212 | |
| 483 | 2213 #define SY_MAXLEN 30 |
| 2214 typedef struct syl_item_S | |
| 2215 { | |
| 2216 char_u sy_chars[SY_MAXLEN]; /* the sequence of chars */ | |
| 2217 int sy_len; | |
| 2218 } syl_item_T; | |
| 2219 | |
| 2220 /* | |
| 2221 * Truncate "slang->sl_syllable" at the first slash and put the following items | |
| 2222 * in "slang->sl_syl_items". | |
| 2223 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2224 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2225 init_syl_tab(slang_T *slang) |
| 483 | 2226 { |
| 2227 char_u *p; | |
| 2228 char_u *s; | |
| 2229 int l; | |
| 2230 syl_item_T *syl; | |
| 2231 | |
| 2232 ga_init2(&slang->sl_syl_items, sizeof(syl_item_T), 4); | |
| 2233 p = vim_strchr(slang->sl_syllable, '/'); | |
| 2234 while (p != NULL) | |
| 2235 { | |
| 2236 *p++ = NUL; | |
| 495 | 2237 if (*p == NUL) /* trailing slash */ |
| 483 | 2238 break; |
| 2239 s = p; | |
| 2240 p = vim_strchr(p, '/'); | |
| 2241 if (p == NULL) | |
| 835 | 2242 l = (int)STRLEN(s); |
| 483 | 2243 else |
| 835 | 2244 l = (int)(p - s); |
| 483 | 2245 if (l >= SY_MAXLEN) |
| 2246 return SP_FORMERROR; | |
| 2247 if (ga_grow(&slang->sl_syl_items, 1) == FAIL) | |
| 495 | 2248 return SP_OTHERERROR; |
| 483 | 2249 syl = ((syl_item_T *)slang->sl_syl_items.ga_data) |
| 2250 + slang->sl_syl_items.ga_len++; | |
| 2251 vim_strncpy(syl->sy_chars, s, l); | |
| 2252 syl->sy_len = l; | |
| 2253 } | |
| 2254 return OK; | |
| 2255 } | |
| 2256 | |
| 2257 /* | |
| 2258 * Count the number of syllables in "word". | |
| 2259 * When "word" contains spaces the syllables after the last space are counted. | |
| 2260 * Returns zero if syllables are not defines. | |
| 2261 */ | |
| 2262 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2263 count_syllables(slang_T *slang, char_u *word) |
| 483 | 2264 { |
| 2265 int cnt = 0; | |
| 2266 int skip = FALSE; | |
| 2267 char_u *p; | |
| 2268 int len; | |
| 2269 int i; | |
| 2270 syl_item_T *syl; | |
| 2271 int c; | |
| 2272 | |
| 2273 if (slang->sl_syllable == NULL) | |
| 2274 return 0; | |
| 2275 | |
| 2276 for (p = word; *p != NUL; p += len) | |
| 2277 { | |
| 2278 /* When running into a space reset counter. */ | |
| 2279 if (*p == ' ') | |
| 2280 { | |
| 2281 len = 1; | |
| 2282 cnt = 0; | |
| 2283 continue; | |
| 2284 } | |
| 2285 | |
| 2286 /* Find longest match of syllable items. */ | |
| 2287 len = 0; | |
| 2288 for (i = 0; i < slang->sl_syl_items.ga_len; ++i) | |
| 2289 { | |
| 2290 syl = ((syl_item_T *)slang->sl_syl_items.ga_data) + i; | |
| 2291 if (syl->sy_len > len | |
| 2292 && STRNCMP(p, syl->sy_chars, syl->sy_len) == 0) | |
| 2293 len = syl->sy_len; | |
| 2294 } | |
| 2295 if (len != 0) /* found a match, count syllable */ | |
| 2296 { | |
| 2297 ++cnt; | |
| 2298 skip = FALSE; | |
| 2299 } | |
| 2300 else | |
| 2301 { | |
| 2302 /* No recognized syllable item, at least a syllable char then? */ | |
| 2303 #ifdef FEAT_MBYTE | |
| 2304 c = mb_ptr2char(p); | |
| 2305 len = (*mb_ptr2len)(p); | |
| 2306 #else | |
| 2307 c = *p; | |
| 2308 len = 1; | |
| 2309 #endif | |
| 2310 if (vim_strchr(slang->sl_syllable, c) == NULL) | |
| 2311 skip = FALSE; /* No, search for next syllable */ | |
| 2312 else if (!skip) | |
| 2313 { | |
| 2314 ++cnt; /* Yes, count it */ | |
| 2315 skip = TRUE; /* don't count following syllable chars */ | |
| 2316 } | |
| 2317 } | |
| 2318 } | |
| 2319 return cnt; | |
| 376 | 2320 } |
| 2321 | |
| 381 | 2322 /* |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2323 * Parse 'spelllang' and set w_s->b_langp accordingly. |
| 351 | 2324 * Returns NULL if it's OK, an error message otherwise. |
| 236 | 2325 */ |
| 2326 char_u * | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2327 did_set_spelllang(win_T *wp) |
| 236 | 2328 { |
| 2329 garray_T ga; | |
| 351 | 2330 char_u *splp; |
| 236 | 2331 char_u *region; |
| 416 | 2332 char_u region_cp[3]; |
| 355 | 2333 int filename; |
| 236 | 2334 int region_mask; |
| 503 | 2335 slang_T *slang; |
| 236 | 2336 int c; |
| 351 | 2337 char_u lang[MAXWLEN + 1]; |
| 323 | 2338 char_u spf_name[MAXPATHL]; |
| 351 | 2339 int len; |
| 2340 char_u *p; | |
| 381 | 2341 int round; |
| 385 | 2342 char_u *spf; |
| 389 | 2343 char_u *use_region = NULL; |
| 2344 int dont_use_region = FALSE; | |
| 501 | 2345 int nobreak = FALSE; |
| 503 | 2346 int i, j; |
| 2347 langp_T *lp, *lp2; | |
| 1185 | 2348 static int recursive = FALSE; |
| 2349 char_u *ret_msg = NULL; | |
| 2350 char_u *spl_copy; | |
|
9487
69ed2c9d34a6
commit https://github.com/vim/vim/commit/7c0a2f367f2507669560b1a66423155c70d2e75b
Christian Brabandt <cb@256bit.org>
parents:
9387
diff
changeset
|
2351 #ifdef FEAT_AUTOCMD |
|
69ed2c9d34a6
commit https://github.com/vim/vim/commit/7c0a2f367f2507669560b1a66423155c70d2e75b
Christian Brabandt <cb@256bit.org>
parents:
9387
diff
changeset
|
2352 bufref_T bufref; |
|
69ed2c9d34a6
commit https://github.com/vim/vim/commit/7c0a2f367f2507669560b1a66423155c70d2e75b
Christian Brabandt <cb@256bit.org>
parents:
9387
diff
changeset
|
2353 |
|
69ed2c9d34a6
commit https://github.com/vim/vim/commit/7c0a2f367f2507669560b1a66423155c70d2e75b
Christian Brabandt <cb@256bit.org>
parents:
9387
diff
changeset
|
2354 set_bufref(&bufref, wp->w_buffer); |
|
69ed2c9d34a6
commit https://github.com/vim/vim/commit/7c0a2f367f2507669560b1a66423155c70d2e75b
Christian Brabandt <cb@256bit.org>
parents:
9387
diff
changeset
|
2355 #endif |
| 1185 | 2356 |
| 2357 /* We don't want to do this recursively. May happen when a language is | |
| 2358 * not available and the SpellFileMissing autocommand opens a new buffer | |
| 2359 * in which 'spell' is set. */ | |
| 2360 if (recursive) | |
| 2361 return NULL; | |
| 2362 recursive = TRUE; | |
| 236 | 2363 |
| 2364 ga_init2(&ga, sizeof(langp_T), 2); | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2365 clear_midword(wp); |
| 236 | 2366 |
| 4352 | 2367 /* Make a copy of 'spelllang', the SpellFileMissing autocommands may change |
| 1185 | 2368 * it under our fingers. */ |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2369 spl_copy = vim_strsave(wp->w_s->b_p_spl); |
| 1185 | 2370 if (spl_copy == NULL) |
| 2371 goto theend; | |
| 2372 | |
| 5485 | 2373 #ifdef FEAT_MBYTE |
| 5477 | 2374 wp->w_s->b_cjk = 0; |
| 5485 | 2375 #endif |
| 5477 | 2376 |
| 2377 /* Loop over comma separated language names. */ | |
| 1185 | 2378 for (splp = spl_copy; *splp != NUL; ) |
| 351 | 2379 { |
| 2380 /* Get one language name. */ | |
| 2381 copy_option_part(&splp, lang, MAXWLEN, ","); | |
| 240 | 2382 region = NULL; |
| 835 | 2383 len = (int)STRLEN(lang); |
| 355 | 2384 |
| 5477 | 2385 if (STRCMP(lang, "cjk") == 0) |
| 2386 { | |
| 5485 | 2387 #ifdef FEAT_MBYTE |
| 5477 | 2388 wp->w_s->b_cjk = 1; |
| 5485 | 2389 #endif |
| 5477 | 2390 continue; |
| 2391 } | |
| 2392 | |
| 355 | 2393 /* If the name ends in ".spl" use it as the name of the spell file. |
| 2394 * If there is a region name let "region" point to it and remove it | |
| 2395 * from the name. */ | |
| 2396 if (len > 4 && fnamecmp(lang + len - 4, ".spl") == 0) | |
| 236 | 2397 { |
| 355 | 2398 filename = TRUE; |
| 2399 | |
| 416 | 2400 /* Locate a region and remove it from the file name. */ |
| 2401 p = vim_strchr(gettail(lang), '_'); | |
| 2402 if (p != NULL && ASCII_ISALPHA(p[1]) && ASCII_ISALPHA(p[2]) | |
| 2403 && !ASCII_ISALPHA(p[3])) | |
| 2404 { | |
| 2405 vim_strncpy(region_cp, p + 1, 2); | |
| 2406 mch_memmove(p, p + 3, len - (p - lang) - 2); | |
| 2407 region = region_cp; | |
| 2408 } | |
| 2409 else | |
| 2410 dont_use_region = TRUE; | |
| 2411 | |
| 355 | 2412 /* Check if we loaded this language before. */ |
| 503 | 2413 for (slang = first_lang; slang != NULL; slang = slang->sl_next) |
| 2414 if (fullpathcmp(lang, slang->sl_fname, FALSE) == FPC_SAME) | |
| 355 | 2415 break; |
| 236 | 2416 } |
| 355 | 2417 else |
| 2418 { | |
| 2419 filename = FALSE; | |
| 2420 if (len > 3 && lang[len - 3] == '_') | |
| 2421 { | |
| 2422 region = lang + len - 2; | |
| 2423 len -= 3; | |
| 2424 lang[len] = NUL; | |
| 389 | 2425 } |
| 2426 else | |
| 2427 dont_use_region = TRUE; | |
| 355 | 2428 |
| 2429 /* Check if we loaded this language before. */ | |
| 503 | 2430 for (slang = first_lang; slang != NULL; slang = slang->sl_next) |
| 2431 if (STRICMP(lang, slang->sl_name) == 0) | |
| 355 | 2432 break; |
| 2433 } | |
| 236 | 2434 |
| 416 | 2435 if (region != NULL) |
| 2436 { | |
| 2437 /* If the region differs from what was used before then don't | |
| 2438 * use it for 'spellfile'. */ | |
| 2439 if (use_region != NULL && STRCMP(region, use_region) != 0) | |
| 2440 dont_use_region = TRUE; | |
| 2441 use_region = region; | |
| 2442 } | |
| 2443 | |
| 351 | 2444 /* If not found try loading the language now. */ |
| 503 | 2445 if (slang == NULL) |
| 355 | 2446 { |
| 2447 if (filename) | |
| 2448 (void)spell_load_file(lang, lang, NULL, FALSE); | |
| 2449 else | |
| 1185 | 2450 { |
| 355 | 2451 spell_load_lang(lang); |
| 1185 | 2452 #ifdef FEAT_AUTOCMD |
| 2453 /* SpellFileMissing autocommands may do anything, including | |
| 2454 * destroying the buffer we are using... */ | |
|
9487
69ed2c9d34a6
commit https://github.com/vim/vim/commit/7c0a2f367f2507669560b1a66423155c70d2e75b
Christian Brabandt <cb@256bit.org>
parents:
9387
diff
changeset
|
2455 if (!bufref_valid(&bufref)) |
| 1185 | 2456 { |
|
9953
9560a2eb7968
commit https://github.com/vim/vim/commit/5b30291785e6b9be1a607504c14bd03c601b59a6
Christian Brabandt <cb@256bit.org>
parents:
9898
diff
changeset
|
2457 ret_msg = (char_u *)N_("E797: SpellFileMissing autocommand deleted buffer"); |
| 1185 | 2458 goto theend; |
| 2459 } | |
| 2460 #endif | |
| 2461 } | |
| 355 | 2462 } |
| 236 | 2463 |
| 307 | 2464 /* |
| 351 | 2465 * Loop over the languages, there can be several files for "lang". |
| 307 | 2466 */ |
| 503 | 2467 for (slang = first_lang; slang != NULL; slang = slang->sl_next) |
| 2468 if (filename ? fullpathcmp(lang, slang->sl_fname, FALSE) == FPC_SAME | |
| 2469 : STRICMP(lang, slang->sl_name) == 0) | |
| 236 | 2470 { |
| 316 | 2471 region_mask = REGION_ALL; |
| 355 | 2472 if (!filename && region != NULL) |
| 236 | 2473 { |
| 307 | 2474 /* find region in sl_regions */ |
| 503 | 2475 c = find_region(slang->sl_regions, region); |
| 307 | 2476 if (c == REGION_ALL) |
| 2477 { | |
| 503 | 2478 if (slang->sl_add) |
| 389 | 2479 { |
| 503 | 2480 if (*slang->sl_regions != NUL) |
| 389 | 2481 /* This addition file is for other regions. */ |
| 2482 region_mask = 0; | |
| 2483 } | |
| 2484 else | |
| 2485 /* This is probably an error. Give a warning and | |
| 2486 * accept the words anyway. */ | |
| 351 | 2487 smsg((char_u *) |
| 2488 _("Warning: region %s not supported"), | |
| 2489 region); | |
| 307 | 2490 } |
| 2491 else | |
| 2492 region_mask = 1 << c; | |
| 236 | 2493 } |
| 307 | 2494 |
| 389 | 2495 if (region_mask != 0) |
| 307 | 2496 { |
| 389 | 2497 if (ga_grow(&ga, 1) == FAIL) |
| 2498 { | |
| 2499 ga_clear(&ga); | |
| 1185 | 2500 ret_msg = e_outofmem; |
| 2501 goto theend; | |
| 389 | 2502 } |
| 503 | 2503 LANGP_ENTRY(ga, ga.ga_len)->lp_slang = slang; |
| 389 | 2504 LANGP_ENTRY(ga, ga.ga_len)->lp_region = region_mask; |
| 2505 ++ga.ga_len; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2506 use_midword(slang, wp); |
| 503 | 2507 if (slang->sl_nobreak) |
| 501 | 2508 nobreak = TRUE; |
| 307 | 2509 } |
| 385 | 2510 } |
| 2511 } | |
| 2512 | |
| 2513 /* round 0: load int_wordlist, if possible. | |
| 2514 * round 1: load first name in 'spellfile'. | |
| 2515 * round 2: load second name in 'spellfile. | |
| 2516 * etc. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2517 spf = curwin->w_s->b_p_spf; |
| 385 | 2518 for (round = 0; round == 0 || *spf != NUL; ++round) |
| 2519 { | |
| 2520 if (round == 0) | |
| 2521 { | |
| 2522 /* Internal wordlist, if there is one. */ | |
| 2523 if (int_wordlist == NULL) | |
| 381 | 2524 continue; |
| 385 | 2525 int_wordlist_spl(spf_name); |
| 381 | 2526 } |
| 2527 else | |
| 2528 { | |
| 385 | 2529 /* One entry in 'spellfile'. */ |
| 2530 copy_option_part(&spf, spf_name, MAXPATHL - 5, ","); | |
| 2531 STRCAT(spf_name, ".spl"); | |
| 2532 | |
| 2533 /* If it was already found above then skip it. */ | |
| 2534 for (c = 0; c < ga.ga_len; ++c) | |
| 500 | 2535 { |
| 2536 p = LANGP_ENTRY(ga, c)->lp_slang->sl_fname; | |
| 2537 if (p != NULL && fullpathcmp(spf_name, p, FALSE) == FPC_SAME) | |
| 385 | 2538 break; |
| 500 | 2539 } |
| 385 | 2540 if (c < ga.ga_len) |
| 381 | 2541 continue; |
| 2542 } | |
| 2543 | |
| 351 | 2544 /* Check if it was loaded already. */ |
| 503 | 2545 for (slang = first_lang; slang != NULL; slang = slang->sl_next) |
| 2546 if (fullpathcmp(spf_name, slang->sl_fname, FALSE) == FPC_SAME) | |
| 323 | 2547 break; |
| 503 | 2548 if (slang == NULL) |
| 323 | 2549 { |
| 351 | 2550 /* Not loaded, try loading it now. The language name includes the |
| 385 | 2551 * region name, the region is ignored otherwise. for int_wordlist |
| 2552 * use an arbitrary name. */ | |
| 2553 if (round == 0) | |
| 2554 STRCPY(lang, "internal wordlist"); | |
| 2555 else | |
| 2556 { | |
| 2557 vim_strncpy(lang, gettail(spf_name), MAXWLEN); | |
| 381 | 2558 p = vim_strchr(lang, '.'); |
| 2559 if (p != NULL) | |
| 2560 *p = NUL; /* truncate at ".encoding.add" */ | |
| 2561 } | |
| 503 | 2562 slang = spell_load_file(spf_name, lang, NULL, TRUE); |
| 501 | 2563 |
| 2564 /* If one of the languages has NOBREAK we assume the addition | |
| 2565 * files also have this. */ | |
| 503 | 2566 if (slang != NULL && nobreak) |
| 2567 slang->sl_nobreak = TRUE; | |
| 2568 } | |
| 2569 if (slang != NULL && ga_grow(&ga, 1) == OK) | |
| 323 | 2570 { |
| 389 | 2571 region_mask = REGION_ALL; |
| 2572 if (use_region != NULL && !dont_use_region) | |
| 2573 { | |
| 2574 /* find region in sl_regions */ | |
| 503 | 2575 c = find_region(slang->sl_regions, use_region); |
| 389 | 2576 if (c != REGION_ALL) |
| 2577 region_mask = 1 << c; | |
| 503 | 2578 else if (*slang->sl_regions != NUL) |
| 389 | 2579 /* This spell file is for other regions. */ |
| 2580 region_mask = 0; | |
| 2581 } | |
| 2582 | |
| 2583 if (region_mask != 0) | |
| 2584 { | |
| 503 | 2585 LANGP_ENTRY(ga, ga.ga_len)->lp_slang = slang; |
| 2586 LANGP_ENTRY(ga, ga.ga_len)->lp_sallang = NULL; | |
| 2587 LANGP_ENTRY(ga, ga.ga_len)->lp_replang = NULL; | |
| 389 | 2588 LANGP_ENTRY(ga, ga.ga_len)->lp_region = region_mask; |
| 2589 ++ga.ga_len; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2590 use_midword(slang, wp); |
| 389 | 2591 } |
| 323 | 2592 } |
| 2593 } | |
| 2594 | |
| 236 | 2595 /* Everything is fine, store the new b_langp value. */ |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2596 ga_clear(&wp->w_s->b_langp); |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2597 wp->w_s->b_langp = ga; |
| 236 | 2598 |
| 503 | 2599 /* For each language figure out what language to use for sound folding and |
| 2600 * REP items. If the language doesn't support it itself use another one | |
| 2601 * with the same name. E.g. for "en-math" use "en". */ | |
| 2602 for (i = 0; i < ga.ga_len; ++i) | |
| 2603 { | |
| 2604 lp = LANGP_ENTRY(ga, i); | |
| 2605 | |
| 2606 /* sound folding */ | |
| 2607 if (lp->lp_slang->sl_sal.ga_len > 0) | |
| 2608 /* language does sound folding itself */ | |
| 2609 lp->lp_sallang = lp->lp_slang; | |
| 2610 else | |
| 2611 /* find first similar language that does sound folding */ | |
| 2612 for (j = 0; j < ga.ga_len; ++j) | |
| 2613 { | |
| 2614 lp2 = LANGP_ENTRY(ga, j); | |
| 2615 if (lp2->lp_slang->sl_sal.ga_len > 0 | |
| 2616 && STRNCMP(lp->lp_slang->sl_name, | |
| 2617 lp2->lp_slang->sl_name, 2) == 0) | |
| 2618 { | |
| 2619 lp->lp_sallang = lp2->lp_slang; | |
| 2620 break; | |
| 2621 } | |
| 2622 } | |
| 2623 | |
| 2624 /* REP items */ | |
| 2625 if (lp->lp_slang->sl_rep.ga_len > 0) | |
| 2626 /* language has REP items itself */ | |
| 2627 lp->lp_replang = lp->lp_slang; | |
| 2628 else | |
| 625 | 2629 /* find first similar language that has REP items */ |
| 503 | 2630 for (j = 0; j < ga.ga_len; ++j) |
| 2631 { | |
| 2632 lp2 = LANGP_ENTRY(ga, j); | |
| 2633 if (lp2->lp_slang->sl_rep.ga_len > 0 | |
| 2634 && STRNCMP(lp->lp_slang->sl_name, | |
| 2635 lp2->lp_slang->sl_name, 2) == 0) | |
| 2636 { | |
| 2637 lp->lp_replang = lp2->lp_slang; | |
| 2638 break; | |
| 2639 } | |
| 2640 } | |
| 2641 } | |
| 2642 | |
| 1185 | 2643 theend: |
| 2644 vim_free(spl_copy); | |
| 2645 recursive = FALSE; | |
| 5891 | 2646 redraw_win_later(wp, NOT_VALID); |
| 1185 | 2647 return ret_msg; |
| 236 | 2648 } |
| 2649 | |
| 2650 /* | |
| 376 | 2651 * Clear the midword characters for buffer "buf". |
| 2652 */ | |
| 2653 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2654 clear_midword(win_T *wp) |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2655 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2656 vim_memset(wp->w_s->b_spell_ismw, 0, 256); |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2657 #ifdef FEAT_MBYTE |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2658 VIM_CLEAR(wp->w_s->b_spell_ismw_mb); |
| 376 | 2659 #endif |
| 2660 } | |
| 2661 | |
| 2662 /* | |
| 2663 * Use the "sl_midword" field of language "lp" for buffer "buf". | |
| 2664 * They add up to any currently used midword characters. | |
| 2665 */ | |
| 2666 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2667 use_midword(slang_T *lp, win_T *wp) |
| 376 | 2668 { |
| 2669 char_u *p; | |
| 2670 | |
| 389 | 2671 if (lp->sl_midword == NULL) /* there aren't any */ |
| 2672 return; | |
| 2673 | |
| 376 | 2674 for (p = lp->sl_midword; *p != NUL; ) |
| 2675 #ifdef FEAT_MBYTE | |
| 2676 if (has_mbyte) | |
| 2677 { | |
| 2678 int c, l, n; | |
| 2679 char_u *bp; | |
| 2680 | |
| 2681 c = mb_ptr2char(p); | |
| 474 | 2682 l = (*mb_ptr2len)(p); |
| 2683 if (c < 256 && l <= 2) | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2684 wp->w_s->b_spell_ismw[c] = TRUE; |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2685 else if (wp->w_s->b_spell_ismw_mb == NULL) |
| 376 | 2686 /* First multi-byte char in "b_spell_ismw_mb". */ |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2687 wp->w_s->b_spell_ismw_mb = vim_strnsave(p, l); |
| 376 | 2688 else |
| 2689 { | |
| 2690 /* Append multi-byte chars to "b_spell_ismw_mb". */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2691 n = (int)STRLEN(wp->w_s->b_spell_ismw_mb); |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2692 bp = vim_strnsave(wp->w_s->b_spell_ismw_mb, n + l); |
| 376 | 2693 if (bp != NULL) |
| 2694 { | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2695 vim_free(wp->w_s->b_spell_ismw_mb); |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2696 wp->w_s->b_spell_ismw_mb = bp; |
| 376 | 2697 vim_strncpy(bp + n, p, l); |
| 2698 } | |
| 2699 } | |
| 2700 p += l; | |
| 2701 } | |
| 2702 else | |
| 2703 #endif | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2704 wp->w_s->b_spell_ismw[*p++] = TRUE; |
| 376 | 2705 } |
| 2706 | |
| 2707 /* | |
| 236 | 2708 * Find the region "region[2]" in "rp" (points to "sl_regions"). |
| 2709 * Each region is simply stored as the two characters of it's name. | |
| 381 | 2710 * Returns the index if found (first is 0), REGION_ALL if not found. |
| 236 | 2711 */ |
| 2712 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2713 find_region(char_u *rp, char_u *region) |
| 236 | 2714 { |
| 2715 int i; | |
| 2716 | |
| 2717 for (i = 0; ; i += 2) | |
| 2718 { | |
| 2719 if (rp[i] == NUL) | |
| 2720 return REGION_ALL; | |
| 2721 if (rp[i] == region[0] && rp[i + 1] == region[1]) | |
| 2722 break; | |
| 2723 } | |
| 2724 return i / 2; | |
| 2725 } | |
| 2726 | |
| 2727 /* | |
| 323 | 2728 * Return case type of word: |
| 236 | 2729 * w word 0 |
| 300 | 2730 * Word WF_ONECAP |
| 2731 * W WORD WF_ALLCAP | |
| 2732 * WoRd wOrd WF_KEEPCAP | |
| 236 | 2733 */ |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2734 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2735 captype( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2736 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2737 char_u *end) /* When NULL use up to NUL byte. */ |
| 236 | 2738 { |
| 2739 char_u *p; | |
| 2740 int c; | |
| 2741 int firstcap; | |
| 2742 int allcap; | |
| 2743 int past_second = FALSE; /* past second word char */ | |
| 2744 | |
| 2745 /* find first letter */ | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
2746 for (p = word; !spell_iswordp_nmw(p, curwin); MB_PTR_ADV(p)) |
| 323 | 2747 if (end == NULL ? *p == NUL : p >= end) |
| 236 | 2748 return 0; /* only non-word characters, illegal word */ |
| 2749 #ifdef FEAT_MBYTE | |
| 310 | 2750 if (has_mbyte) |
| 2751 c = mb_ptr2char_adv(&p); | |
| 2752 else | |
| 236 | 2753 #endif |
| 310 | 2754 c = *p++; |
| 324 | 2755 firstcap = allcap = SPELL_ISUPPER(c); |
| 236 | 2756 |
| 2757 /* | |
| 2758 * Need to check all letters to find a word with mixed upper/lower. | |
| 2759 * But a word with an upper char only at start is a ONECAP. | |
| 2760 */ | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
2761 for ( ; end == NULL ? *p != NUL : p < end; MB_PTR_ADV(p)) |
| 5477 | 2762 if (spell_iswordp_nmw(p, curwin)) |
| 236 | 2763 { |
| 455 | 2764 c = PTR2CHAR(p); |
| 324 | 2765 if (!SPELL_ISUPPER(c)) |
| 236 | 2766 { |
| 2767 /* UUl -> KEEPCAP */ | |
| 2768 if (past_second && allcap) | |
| 300 | 2769 return WF_KEEPCAP; |
| 236 | 2770 allcap = FALSE; |
| 2771 } | |
| 2772 else if (!allcap) | |
| 2773 /* UlU -> KEEPCAP */ | |
| 300 | 2774 return WF_KEEPCAP; |
| 236 | 2775 past_second = TRUE; |
| 2776 } | |
| 2777 | |
| 2778 if (allcap) | |
| 300 | 2779 return WF_ALLCAP; |
| 236 | 2780 if (firstcap) |
| 300 | 2781 return WF_ONECAP; |
| 236 | 2782 return 0; |
| 2783 } | |
| 2784 | |
| 474 | 2785 /* |
| 2786 * Like captype() but for a KEEPCAP word add ONECAP if the word starts with a | |
| 2787 * capital. So that make_case_word() can turn WOrd into Word. | |
| 2788 * Add ALLCAP for "WOrD". | |
| 2789 */ | |
| 2790 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2791 badword_captype(char_u *word, char_u *end) |
| 474 | 2792 { |
| 2793 int flags = captype(word, end); | |
| 475 | 2794 int c; |
| 474 | 2795 int l, u; |
| 2796 int first; | |
| 2797 char_u *p; | |
| 2798 | |
| 2799 if (flags & WF_KEEPCAP) | |
| 2800 { | |
| 2801 /* Count the number of UPPER and lower case letters. */ | |
| 2802 l = u = 0; | |
| 2803 first = FALSE; | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
2804 for (p = word; p < end; MB_PTR_ADV(p)) |
| 474 | 2805 { |
| 475 | 2806 c = PTR2CHAR(p); |
| 2807 if (SPELL_ISUPPER(c)) | |
| 474 | 2808 { |
| 2809 ++u; | |
| 2810 if (p == word) | |
| 2811 first = TRUE; | |
| 2812 } | |
| 2813 else | |
| 2814 ++l; | |
| 2815 } | |
| 2816 | |
| 2817 /* If there are more UPPER than lower case letters suggest an | |
| 2818 * ALLCAP word. Otherwise, if the first letter is UPPER then | |
| 2819 * suggest ONECAP. Exception: "ALl" most likely should be "All", | |
| 2820 * require three upper case letters. */ | |
| 2821 if (u > l && u > 2) | |
| 2822 flags |= WF_ALLCAP; | |
| 2823 else if (first) | |
| 2824 flags |= WF_ONECAP; | |
| 633 | 2825 |
| 2826 if (u >= 2 && l >= 2) /* maCARONI maCAroni */ | |
| 2827 flags |= WF_MIXCAP; | |
| 474 | 2828 } |
| 2829 return flags; | |
| 2830 } | |
| 2831 | |
| 5519 | 2832 /* |
| 2833 * Delete the internal wordlist and its .spl file. | |
| 2834 */ | |
| 2835 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2836 spell_delete_wordlist(void) |
| 5519 | 2837 { |
| 2838 char_u fname[MAXPATHL]; | |
| 2839 | |
| 2840 if (int_wordlist != NULL) | |
| 2841 { | |
| 2842 mch_remove(int_wordlist); | |
| 2843 int_wordlist_spl(fname); | |
| 2844 mch_remove(fname); | |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2845 VIM_CLEAR(int_wordlist); |
| 5519 | 2846 } |
| 2847 } | |
| 2848 | |
| 2849 #if defined(FEAT_MBYTE) || defined(EXITFREE) || defined(PROTO) | |
| 355 | 2850 /* |
| 2851 * Free all languages. | |
| 2852 */ | |
| 2853 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2854 spell_free_all(void) |
| 355 | 2855 { |
| 503 | 2856 slang_T *slang; |
| 355 | 2857 buf_T *buf; |
| 2858 | |
| 2580 | 2859 /* Go through all buffers and handle 'spelllang'. <VN> */ |
|
9649
fd9727ae3c49
commit https://github.com/vim/vim/commit/2932359000b2f918d5fade79ea4d124d5943cd07
Christian Brabandt <cb@256bit.org>
parents:
9583
diff
changeset
|
2860 FOR_ALL_BUFFERS(buf) |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2861 ga_clear(&buf->b_s.b_langp); |
| 355 | 2862 |
| 2863 while (first_lang != NULL) | |
| 2864 { | |
| 503 | 2865 slang = first_lang; |
| 2866 first_lang = slang->sl_next; | |
| 2867 slang_free(slang); | |
| 355 | 2868 } |
| 366 | 2869 |
| 5519 | 2870 spell_delete_wordlist(); |
| 381 | 2871 |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2872 VIM_CLEAR(repl_to); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2873 VIM_CLEAR(repl_from); |
| 355 | 2874 } |
| 5519 | 2875 #endif |
| 2876 | |
| 2877 #if defined(FEAT_MBYTE) || defined(PROTO) | |
| 236 | 2878 /* |
| 2879 * Clear all spelling tables and reload them. | |
| 307 | 2880 * Used after 'encoding' is set and when ":mkspell" was used. |
| 236 | 2881 */ |
| 2882 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2883 spell_reload(void) |
| 236 | 2884 { |
| 316 | 2885 win_T *wp; |
| 236 | 2886 |
| 358 | 2887 /* Initialize the table for spell_iswordp(). */ |
| 236 | 2888 init_spell_chartab(); |
| 2889 | |
| 2890 /* Unload all allocated memory. */ | |
| 355 | 2891 spell_free_all(); |
| 236 | 2892 |
| 2893 /* Go through all buffers and handle 'spelllang'. */ | |
|
9649
fd9727ae3c49
commit https://github.com/vim/vim/commit/2932359000b2f918d5fade79ea4d124d5943cd07
Christian Brabandt <cb@256bit.org>
parents:
9583
diff
changeset
|
2894 FOR_ALL_WINDOWS(wp) |
| 236 | 2895 { |
| 316 | 2896 /* Only load the wordlists when 'spelllang' is set and there is a |
| 2897 * window for this buffer in which 'spell' is set. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2898 if (*wp->w_s->b_p_spl != NUL) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2899 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2900 if (wp->w_p_spell) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2901 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2902 (void)did_set_spelllang(wp); |
| 316 | 2903 break; |
| 2904 } | |
| 2905 } | |
| 236 | 2906 } |
| 2907 } | |
| 5519 | 2908 #endif |
| 236 | 2909 |
| 310 | 2910 /* |
| 625 | 2911 * Opposite of offset2bytes(). |
| 2912 * "pp" points to the bytes and is advanced over it. | |
| 2913 * Returns the offset. | |
| 2914 */ | |
| 2915 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2916 bytes2offset(char_u **pp) |
| 625 | 2917 { |
| 2918 char_u *p = *pp; | |
| 2919 int nr; | |
| 2920 int c; | |
| 2921 | |
| 2922 c = *p++; | |
| 2923 if ((c & 0x80) == 0x00) /* 1 byte */ | |
| 2924 { | |
| 2925 nr = c - 1; | |
| 2926 } | |
| 2927 else if ((c & 0xc0) == 0x80) /* 2 bytes */ | |
| 2928 { | |
| 2929 nr = (c & 0x3f) - 1; | |
| 2930 nr = nr * 255 + (*p++ - 1); | |
| 2931 } | |
| 2932 else if ((c & 0xe0) == 0xc0) /* 3 bytes */ | |
| 2933 { | |
| 2934 nr = (c & 0x1f) - 1; | |
| 2935 nr = nr * 255 + (*p++ - 1); | |
| 2936 nr = nr * 255 + (*p++ - 1); | |
| 2937 } | |
| 2938 else /* 4 bytes */ | |
| 2939 { | |
| 2940 nr = (c & 0x0f) - 1; | |
| 2941 nr = nr * 255 + (*p++ - 1); | |
| 2942 nr = nr * 255 + (*p++ - 1); | |
| 2943 nr = nr * 255 + (*p++ - 1); | |
| 2944 } | |
| 2945 | |
| 2946 *pp = p; | |
| 2947 return nr; | |
| 2948 } | |
| 2949 | |
| 2950 | |
| 2951 /* | |
| 2952 * Open a spell buffer. This is a nameless buffer that is not in the buffer | |
| 2953 * list and only contains text lines. Can use a swapfile to reduce memory | |
| 2954 * use. | |
| 2955 * Most other fields are invalid! Esp. watch out for string options being | |
| 2956 * NULL and there is no undo info. | |
| 2957 * Returns NULL when out of memory. | |
| 2958 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2959 buf_T * |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2960 open_spellbuf(void) |
| 625 | 2961 { |
| 2962 buf_T *buf; | |
| 2963 | |
| 2964 buf = (buf_T *)alloc_clear(sizeof(buf_T)); | |
| 2965 if (buf != NULL) | |
| 2966 { | |
| 2967 buf->b_spell = TRUE; | |
| 2968 buf->b_p_swf = TRUE; /* may create a swap file */ | |
|
5204
7aca84c0cd37
updated for version 7.4a.028
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
2969 #ifdef FEAT_CRYPT |
|
7aca84c0cd37
updated for version 7.4a.028
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
2970 buf->b_p_key = empty_option; |
|
7aca84c0cd37
updated for version 7.4a.028
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
2971 #endif |
| 625 | 2972 ml_open(buf); |
| 2973 ml_open_file(buf); /* create swap file now */ | |
| 2974 } | |
| 2975 return buf; | |
| 2976 } | |
| 2977 | |
| 2978 /* | |
| 2979 * Close the buffer used for spell info. | |
| 2980 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2981 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2982 close_spellbuf(buf_T *buf) |
| 625 | 2983 { |
| 2984 if (buf != NULL) | |
| 2985 { | |
| 2986 ml_close(buf, TRUE); | |
| 2987 vim_free(buf); | |
| 2988 } | |
| 2989 } | |
| 2990 | |
| 307 | 2991 /* |
| 2992 * Init the chartab used for spelling for ASCII. | |
| 2993 * EBCDIC is not supported! | |
| 2994 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2995 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2996 clear_spell_chartab(spelltab_T *sp) |
| 307 | 2997 { |
| 324 | 2998 int i; |
| 307 | 2999 |
| 3000 /* Init everything to FALSE. */ | |
| 3001 vim_memset(sp->st_isw, FALSE, sizeof(sp->st_isw)); | |
| 3002 vim_memset(sp->st_isu, FALSE, sizeof(sp->st_isu)); | |
| 3003 for (i = 0; i < 256; ++i) | |
| 324 | 3004 { |
| 307 | 3005 sp->st_fold[i] = i; |
| 324 | 3006 sp->st_upper[i] = i; |
| 3007 } | |
| 307 | 3008 |
| 3009 /* We include digits. A word shouldn't start with a digit, but handling | |
| 3010 * that is done separately. */ | |
| 3011 for (i = '0'; i <= '9'; ++i) | |
| 3012 sp->st_isw[i] = TRUE; | |
| 3013 for (i = 'A'; i <= 'Z'; ++i) | |
| 3014 { | |
| 3015 sp->st_isw[i] = TRUE; | |
| 3016 sp->st_isu[i] = TRUE; | |
| 3017 sp->st_fold[i] = i + 0x20; | |
| 3018 } | |
| 3019 for (i = 'a'; i <= 'z'; ++i) | |
| 324 | 3020 { |
| 307 | 3021 sp->st_isw[i] = TRUE; |
| 324 | 3022 sp->st_upper[i] = i - 0x20; |
| 3023 } | |
| 307 | 3024 } |
| 3025 | |
| 3026 /* | |
| 3027 * Init the chartab used for spelling. Only depends on 'encoding'. | |
| 3028 * Called once while starting up and when 'encoding' changes. | |
| 3029 * The default is to use isalpha(), but the spell file should define the word | |
| 3030 * characters to make it possible that 'encoding' differs from the current | |
| 390 | 3031 * locale. For utf-8 we don't use isalpha() but our own functions. |
| 307 | 3032 */ |
| 3033 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3034 init_spell_chartab(void) |
| 307 | 3035 { |
| 3036 int i; | |
| 3037 | |
| 3038 did_set_spelltab = FALSE; | |
| 3039 clear_spell_chartab(&spelltab); | |
| 3040 #ifdef FEAT_MBYTE | |
| 3041 if (enc_dbcs) | |
| 3042 { | |
| 3043 /* DBCS: assume double-wide characters are word characters. */ | |
| 3044 for (i = 128; i <= 255; ++i) | |
| 3045 if (MB_BYTE2LEN(i) == 2) | |
| 3046 spelltab.st_isw[i] = TRUE; | |
| 3047 } | |
| 324 | 3048 else if (enc_utf8) |
| 3049 { | |
| 3050 for (i = 128; i < 256; ++i) | |
| 3051 { | |
|
2140
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
3052 int f = utf_fold(i); |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
3053 int u = utf_toupper(i); |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
3054 |
| 324 | 3055 spelltab.st_isu[i] = utf_isupper(i); |
| 3056 spelltab.st_isw[i] = spelltab.st_isu[i] || utf_islower(i); | |
|
2140
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
3057 /* The folded/upper-cased value is different between latin1 and |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
3058 * utf8 for 0xb5, causing E763 for no good reason. Use the latin1 |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
3059 * value for utf-8 to avoid this. */ |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
3060 spelltab.st_fold[i] = (f < 256) ? f : i; |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
3061 spelltab.st_upper[i] = (u < 256) ? u : i; |
| 324 | 3062 } |
| 3063 } | |
| 307 | 3064 else |
| 3065 #endif | |
| 3066 { | |
| 324 | 3067 /* Rough guess: use locale-dependent library functions. */ |
| 307 | 3068 for (i = 128; i < 256; ++i) |
| 3069 { | |
| 3070 if (MB_ISUPPER(i)) | |
| 3071 { | |
| 324 | 3072 spelltab.st_isw[i] = TRUE; |
| 307 | 3073 spelltab.st_isu[i] = TRUE; |
| 3074 spelltab.st_fold[i] = MB_TOLOWER(i); | |
| 3075 } | |
| 324 | 3076 else if (MB_ISLOWER(i)) |
| 3077 { | |
| 3078 spelltab.st_isw[i] = TRUE; | |
| 3079 spelltab.st_upper[i] = MB_TOUPPER(i); | |
| 3080 } | |
| 307 | 3081 } |
| 3082 } | |
| 3083 } | |
| 3084 | |
| 3085 | |
| 3086 /* | |
| 358 | 3087 * Return TRUE if "p" points to a word character. |
| 366 | 3088 * As a special case we see "midword" characters as word character when it is |
| 358 | 3089 * followed by a word character. This finds they'there but not 'they there'. |
| 366 | 3090 * Thus this only works properly when past the first character of the word. |
| 358 | 3091 */ |
| 3092 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3093 spell_iswordp( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3094 char_u *p, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3095 win_T *wp) /* buffer used */ |
| 358 | 3096 { |
| 366 | 3097 #ifdef FEAT_MBYTE |
| 358 | 3098 char_u *s; |
| 366 | 3099 int l; |
| 3100 int c; | |
| 3101 | |
| 3102 if (has_mbyte) | |
| 3103 { | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
3104 l = MB_PTR2LEN(p); |
| 358 | 3105 s = p; |
| 366 | 3106 if (l == 1) |
| 3107 { | |
| 3108 /* be quick for ASCII */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3109 if (wp->w_s->b_spell_ismw[*p]) |
| 366 | 3110 s = p + 1; /* skip a mid-word character */ |
| 3111 } | |
| 3112 else | |
| 3113 { | |
| 3114 c = mb_ptr2char(p); | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3115 if (c < 256 ? wp->w_s->b_spell_ismw[c] |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3116 : (wp->w_s->b_spell_ismw_mb != NULL |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3117 && vim_strchr(wp->w_s->b_spell_ismw_mb, c) != NULL)) |
| 366 | 3118 s = p + l; |
| 3119 } | |
| 3120 | |
| 390 | 3121 c = mb_ptr2char(s); |
| 3122 if (c > 255) | |
| 5477 | 3123 return spell_mb_isword_class(mb_get_class(s), wp); |
| 390 | 3124 return spelltab.st_isw[c]; |
| 366 | 3125 } |
| 358 | 3126 #endif |
| 366 | 3127 |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3128 return spelltab.st_isw[wp->w_s->b_spell_ismw[*p] ? p[1] : p[0]]; |
| 376 | 3129 } |
| 3130 | |
| 3131 /* | |
| 3132 * Return TRUE if "p" points to a word character. | |
| 3133 * Unlike spell_iswordp() this doesn't check for "midword" characters. | |
| 3134 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
3135 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3136 spell_iswordp_nmw(char_u *p, win_T *wp) |
| 376 | 3137 { |
| 3138 #ifdef FEAT_MBYTE | |
| 390 | 3139 int c; |
| 3140 | |
| 3141 if (has_mbyte) | |
| 3142 { | |
| 3143 c = mb_ptr2char(p); | |
| 3144 if (c > 255) | |
| 5477 | 3145 return spell_mb_isword_class(mb_get_class(p), wp); |
| 390 | 3146 return spelltab.st_isw[c]; |
| 3147 } | |
| 376 | 3148 #endif |
| 3149 return spelltab.st_isw[*p]; | |
| 358 | 3150 } |
| 3151 | |
| 372 | 3152 #ifdef FEAT_MBYTE |
| 3153 /* | |
| 1580 | 3154 * Return TRUE if word class indicates a word character. |
| 3155 * Only for characters above 255. | |
| 3156 * Unicode subscript and superscript are not considered word characters. | |
| 5477 | 3157 * See also dbcs_class() and utf_class() in mbyte.c. |
| 3158 */ | |
| 3159 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3160 spell_mb_isword_class(int cl, win_T *wp) |
| 5477 | 3161 { |
| 3162 if (wp->w_s->b_cjk) | |
| 3163 /* East Asian characters are not considered word characters. */ | |
| 3164 return cl == 2 || cl == 0x2800; | |
| 1580 | 3165 return cl >= 2 && cl != 0x2070 && cl != 0x2080; |
| 3166 } | |
| 3167 | |
| 3168 /* | |
| 372 | 3169 * Return TRUE if "p" points to a word character. |
| 3170 * Wide version of spell_iswordp(). | |
| 3171 */ | |
| 3172 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3173 spell_iswordp_w(int *p, win_T *wp) |
| 372 | 3174 { |
| 3175 int *s; | |
| 3176 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3177 if (*p < 256 ? wp->w_s->b_spell_ismw[*p] |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3178 : (wp->w_s->b_spell_ismw_mb != NULL |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3179 && vim_strchr(wp->w_s->b_spell_ismw_mb, *p) != NULL)) |
| 372 | 3180 s = p + 1; |
| 3181 else | |
| 3182 s = p; | |
| 3183 | |
| 390 | 3184 if (*s > 255) |
| 372 | 3185 { |
| 3186 if (enc_utf8) | |
| 5477 | 3187 return spell_mb_isword_class(utf_class(*s), wp); |
| 372 | 3188 if (enc_dbcs) |
| 5477 | 3189 return spell_mb_isword_class( |
| 3190 dbcs_class((unsigned)*s >> 8, *s & 0xff), wp); | |
| 372 | 3191 return 0; |
| 3192 } | |
| 3193 return spelltab.st_isw[*s]; | |
| 3194 } | |
| 3195 #endif | |
| 3196 | |
| 358 | 3197 /* |
| 324 | 3198 * Case-fold "str[len]" into "buf[buflen]". The result is NUL terminated. |
| 3199 * Uses the character definitions from the .spl file. | |
| 307 | 3200 * When using a multi-byte 'encoding' the length may change! |
| 3201 * Returns FAIL when something wrong. | |
| 3202 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
3203 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3204 spell_casefold( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3205 char_u *str, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3206 int len, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3207 char_u *buf, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3208 int buflen) |
| 307 | 3209 { |
| 3210 int i; | |
| 3211 | |
| 3212 if (len >= buflen) | |
| 3213 { | |
| 3214 buf[0] = NUL; | |
| 3215 return FAIL; /* result will not fit */ | |
| 3216 } | |
| 3217 | |
| 3218 #ifdef FEAT_MBYTE | |
| 3219 if (has_mbyte) | |
| 3220 { | |
| 324 | 3221 int outi = 0; |
| 3222 char_u *p; | |
| 307 | 3223 int c; |
| 3224 | |
| 3225 /* Fold one character at a time. */ | |
| 324 | 3226 for (p = str; p < str + len; ) |
| 307 | 3227 { |
| 3228 if (outi + MB_MAXBYTES > buflen) | |
| 3229 { | |
| 3230 buf[outi] = NUL; | |
| 3231 return FAIL; | |
| 3232 } | |
| 474 | 3233 c = mb_cptr2char_adv(&p); |
| 324 | 3234 outi += mb_char2bytes(SPELL_TOFOLD(c), buf + outi); |
| 307 | 3235 } |
| 3236 buf[outi] = NUL; | |
| 3237 } | |
| 3238 else | |
| 3239 #endif | |
| 3240 { | |
| 3241 /* Be quick for non-multibyte encodings. */ | |
| 3242 for (i = 0; i < len; ++i) | |
| 324 | 3243 buf[i] = spelltab.st_fold[str[i]]; |
| 307 | 3244 buf[i] = NUL; |
| 3245 } | |
| 3246 | |
| 3247 return OK; | |
| 3248 } | |
| 3249 | |
| 625 | 3250 /* values for sps_flags */ |
| 372 | 3251 #define SPS_BEST 1 |
| 3252 #define SPS_FAST 2 | |
| 3253 #define SPS_DOUBLE 4 | |
| 3254 | |
| 625 | 3255 static int sps_flags = SPS_BEST; /* flags from 'spellsuggest' */ |
| 3256 static int sps_limit = 9999; /* max nr of suggestions given */ | |
| 372 | 3257 |
| 3258 /* | |
| 3259 * Check the 'spellsuggest' option. Return FAIL if it's wrong. | |
| 483 | 3260 * Sets "sps_flags" and "sps_limit". |
| 372 | 3261 */ |
| 3262 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3263 spell_check_sps(void) |
| 372 | 3264 { |
| 3265 char_u *p; | |
| 483 | 3266 char_u *s; |
| 372 | 3267 char_u buf[MAXPATHL]; |
| 3268 int f; | |
| 3269 | |
| 3270 sps_flags = 0; | |
| 483 | 3271 sps_limit = 9999; |
| 372 | 3272 |
| 3273 for (p = p_sps; *p != NUL; ) | |
| 3274 { | |
| 3275 copy_option_part(&p, buf, MAXPATHL, ","); | |
| 3276 | |
| 3277 f = 0; | |
| 483 | 3278 if (VIM_ISDIGIT(*buf)) |
| 3279 { | |
| 3280 s = buf; | |
| 3281 sps_limit = getdigits(&s); | |
| 3282 if (*s != NUL && !VIM_ISDIGIT(*s)) | |
| 3283 f = -1; | |
| 3284 } | |
| 3285 else if (STRCMP(buf, "best") == 0) | |
| 372 | 3286 f = SPS_BEST; |
| 3287 else if (STRCMP(buf, "fast") == 0) | |
| 3288 f = SPS_FAST; | |
| 3289 else if (STRCMP(buf, "double") == 0) | |
| 3290 f = SPS_DOUBLE; | |
| 3291 else if (STRNCMP(buf, "expr:", 5) != 0 | |
| 3292 && STRNCMP(buf, "file:", 5) != 0) | |
| 3293 f = -1; | |
| 3294 | |
| 3295 if (f == -1 || (sps_flags != 0 && f != 0)) | |
| 3296 { | |
| 3297 sps_flags = SPS_BEST; | |
| 483 | 3298 sps_limit = 9999; |
| 372 | 3299 return FAIL; |
| 3300 } | |
| 3301 if (f != 0) | |
| 3302 sps_flags = f; | |
| 3303 } | |
| 3304 | |
| 3305 if (sps_flags == 0) | |
| 3306 sps_flags = SPS_BEST; | |
| 3307 | |
| 3308 return OK; | |
| 3309 } | |
| 3310 | |
| 323 | 3311 /* |
| 5374 | 3312 * "z=": Find badly spelled word under or after the cursor. |
| 323 | 3313 * Give suggestions for the properly spelled word. |
| 638 | 3314 * In Visual mode use the highlighted word as the bad word. |
| 485 | 3315 * When "count" is non-zero use that suggestion. |
| 323 | 3316 */ |
| 3317 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3318 spell_suggest(int count) |
| 323 | 3319 { |
| 3320 char_u *line; | |
| 3321 pos_T prev_cursor = curwin->w_cursor; | |
| 3322 char_u wcopy[MAXWLEN + 2]; | |
| 3323 char_u *p; | |
| 3324 int i; | |
| 3325 int c; | |
| 3326 suginfo_T sug; | |
| 3327 suggest_T *stp; | |
| 372 | 3328 int mouse_used; |
| 388 | 3329 int need_cap; |
| 483 | 3330 int limit; |
| 485 | 3331 int selected = count; |
| 638 | 3332 int badlen = 0; |
| 1938 | 3333 int msg_scroll_save = msg_scroll; |
| 638 | 3334 |
| 3335 if (no_spell_checking(curwin)) | |
| 3336 return; | |
| 3337 | |
| 3338 if (VIsual_active) | |
| 3339 { | |
| 3340 /* Use the Visually selected text as the bad word. But reject | |
| 3341 * a multi-line selection. */ | |
| 3342 if (curwin->w_cursor.lnum != VIsual.lnum) | |
| 3343 { | |
| 6949 | 3344 vim_beep(BO_SPELL); |
| 638 | 3345 return; |
| 3346 } | |
| 3347 badlen = (int)curwin->w_cursor.col - (int)VIsual.col; | |
| 3348 if (badlen < 0) | |
| 3349 badlen = -badlen; | |
| 3350 else | |
| 3351 curwin->w_cursor.col = VIsual.col; | |
| 3352 ++badlen; | |
| 3353 end_visual_mode(); | |
| 3354 } | |
| 5735 | 3355 /* Find the start of the badly spelled word. */ |
| 3356 else if (spell_move_to(curwin, FORWARD, TRUE, TRUE, NULL) == 0 | |
| 346 | 3357 || curwin->w_cursor.col > prev_cursor.col) |
| 3358 { | |
| 3359 /* No bad word or it starts after the cursor: use the word under the | |
| 3360 * cursor. */ | |
| 3361 curwin->w_cursor = prev_cursor; | |
| 3362 line = ml_get_curline(); | |
| 3363 p = line + curwin->w_cursor.col; | |
| 3364 /* Backup to before start of word. */ | |
| 5477 | 3365 while (p > line && spell_iswordp_nmw(p, curwin)) |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
3366 MB_PTR_BACK(line, p); |
| 346 | 3367 /* Forward to start of word. */ |
| 5477 | 3368 while (*p != NUL && !spell_iswordp_nmw(p, curwin)) |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
3369 MB_PTR_ADV(p); |
| 346 | 3370 |
| 5477 | 3371 if (!spell_iswordp_nmw(p, curwin)) /* No word found. */ |
| 346 | 3372 { |
| 3373 beep_flush(); | |
| 3374 return; | |
| 3375 } | |
| 835 | 3376 curwin->w_cursor.col = (colnr_T)(p - line); |
| 323 | 3377 } |
| 3378 | |
| 344 | 3379 /* Get the word and its length. */ |
| 3380 | |
| 388 | 3381 /* Figure out if the word should be capitalised. */ |
| 475 | 3382 need_cap = check_need_cap(curwin->w_cursor.lnum, curwin->w_cursor.col); |
| 3383 | |
|
2046
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3384 /* Make a copy of current line since autocommands may free the line. */ |
|
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3385 line = vim_strsave(ml_get_curline()); |
|
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3386 if (line == NULL) |
|
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3387 goto skip; |
| 388 | 3388 |
| 483 | 3389 /* Get the list of suggestions. Limit to 'lines' - 2 or the number in |
| 3390 * 'spellsuggest', whatever is smaller. */ | |
| 3391 if (sps_limit > (int)Rows - 2) | |
| 3392 limit = (int)Rows - 2; | |
| 3393 else | |
| 3394 limit = sps_limit; | |
| 638 | 3395 spell_find_suggest(line + curwin->w_cursor.col, badlen, &sug, limit, |
| 625 | 3396 TRUE, need_cap, TRUE); |
| 323 | 3397 |
| 3398 if (sug.su_ga.ga_len == 0) | |
| 3399 MSG(_("Sorry, no suggestions")); | |
| 485 | 3400 else if (count > 0) |
| 3401 { | |
| 3402 if (count > sug.su_ga.ga_len) | |
| 3403 smsg((char_u *)_("Sorry, only %ld suggestions"), | |
| 3404 (long)sug.su_ga.ga_len); | |
| 3405 } | |
| 323 | 3406 else |
| 3407 { | |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
3408 VIM_CLEAR(repl_from); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
3409 VIM_CLEAR(repl_to); |
| 372 | 3410 |
| 474 | 3411 #ifdef FEAT_RIGHTLEFT |
| 3412 /* When 'rightleft' is set the list is drawn right-left. */ | |
| 3413 cmdmsg_rl = curwin->w_p_rl; | |
| 3414 if (cmdmsg_rl) | |
| 3415 msg_col = Columns - 1; | |
| 3416 #endif | |
| 3417 | |
| 323 | 3418 /* List the suggestions. */ |
| 3419 msg_start(); | |
| 914 | 3420 msg_row = Rows - 1; /* for when 'cmdheight' > 1 */ |
| 372 | 3421 lines_left = Rows; /* avoid more prompt */ |
| 323 | 3422 vim_snprintf((char *)IObuff, IOSIZE, _("Change \"%.*s\" to:"), |
| 3423 sug.su_badlen, sug.su_badptr); | |
| 474 | 3424 #ifdef FEAT_RIGHTLEFT |
| 3425 if (cmdmsg_rl && STRNCMP(IObuff, "Change", 6) == 0) | |
| 3426 { | |
| 3427 /* And now the rabbit from the high hat: Avoid showing the | |
| 3428 * untranslated message rightleft. */ | |
| 3429 vim_snprintf((char *)IObuff, IOSIZE, ":ot \"%.*s\" egnahC", | |
| 3430 sug.su_badlen, sug.su_badptr); | |
| 3431 } | |
| 3432 #endif | |
| 323 | 3433 msg_puts(IObuff); |
| 3434 msg_clr_eos(); | |
| 3435 msg_putchar('\n'); | |
| 346 | 3436 |
| 323 | 3437 msg_scroll = TRUE; |
| 3438 for (i = 0; i < sug.su_ga.ga_len; ++i) | |
| 3439 { | |
| 344 | 3440 stp = &SUG(sug.su_ga, i); |
| 323 | 3441 |
| 3442 /* The suggested word may replace only part of the bad word, add | |
| 3443 * the not replaced part. */ | |
| 2768 | 3444 vim_strncpy(wcopy, stp->st_word, MAXWLEN); |
| 323 | 3445 if (sug.su_badlen > stp->st_orglen) |
| 625 | 3446 vim_strncpy(wcopy + stp->st_wordlen, |
| 323 | 3447 sug.su_badptr + stp->st_orglen, |
| 3448 sug.su_badlen - stp->st_orglen); | |
| 474 | 3449 vim_snprintf((char *)IObuff, IOSIZE, "%2d", i + 1); |
| 3450 #ifdef FEAT_RIGHTLEFT | |
| 3451 if (cmdmsg_rl) | |
| 3452 rl_mirror(IObuff); | |
| 3453 #endif | |
| 3454 msg_puts(IObuff); | |
| 3455 | |
| 3456 vim_snprintf((char *)IObuff, IOSIZE, " \"%s\"", wcopy); | |
| 346 | 3457 msg_puts(IObuff); |
| 3458 | |
| 3459 /* The word may replace more than "su_badlen". */ | |
| 3460 if (sug.su_badlen < stp->st_orglen) | |
| 3461 { | |
| 3462 vim_snprintf((char *)IObuff, IOSIZE, _(" < \"%.*s\""), | |
| 3463 stp->st_orglen, sug.su_badptr); | |
| 3464 msg_puts(IObuff); | |
| 3465 } | |
| 3466 | |
| 324 | 3467 if (p_verbose > 0) |
| 344 | 3468 { |
| 346 | 3469 /* Add the score. */ |
| 351 | 3470 if (sps_flags & (SPS_DOUBLE | SPS_BEST)) |
| 474 | 3471 vim_snprintf((char *)IObuff, IOSIZE, " (%s%d - %d)", |
| 344 | 3472 stp->st_salscore ? "s " : "", |
| 3473 stp->st_score, stp->st_altscore); | |
| 3474 else | |
| 474 | 3475 vim_snprintf((char *)IObuff, IOSIZE, " (%d)", |
| 346 | 3476 stp->st_score); |
| 474 | 3477 #ifdef FEAT_RIGHTLEFT |
| 3478 if (cmdmsg_rl) | |
| 3479 /* Mirror the numbers, but keep the leading space. */ | |
| 3480 rl_mirror(IObuff + 1); | |
| 3481 #endif | |
| 346 | 3482 msg_advance(30); |
| 3483 msg_puts(IObuff); | |
| 344 | 3484 } |
| 323 | 3485 msg_putchar('\n'); |
| 3486 } | |
| 3487 | |
| 474 | 3488 #ifdef FEAT_RIGHTLEFT |
| 3489 cmdmsg_rl = FALSE; | |
| 3490 msg_col = 0; | |
| 3491 #endif | |
| 323 | 3492 /* Ask for choice. */ |
| 485 | 3493 selected = prompt_for_number(&mouse_used); |
| 372 | 3494 if (mouse_used) |
| 485 | 3495 selected -= lines_left; |
| 1938 | 3496 lines_left = Rows; /* avoid more prompt */ |
| 3497 /* don't delay for 'smd' in normal_cmd() */ | |
| 3498 msg_scroll = msg_scroll_save; | |
| 485 | 3499 } |
| 3500 | |
| 3501 if (selected > 0 && selected <= sug.su_ga.ga_len && u_save_cursor() == OK) | |
| 3502 { | |
| 3503 /* Save the from and to text for :spellrepall. */ | |
| 3504 stp = &SUG(sug.su_ga, selected - 1); | |
| 548 | 3505 if (sug.su_badlen > stp->st_orglen) |
| 3506 { | |
| 3507 /* Replacing less than "su_badlen", append the remainder to | |
| 3508 * repl_to. */ | |
| 3509 repl_from = vim_strnsave(sug.su_badptr, sug.su_badlen); | |
| 3510 vim_snprintf((char *)IObuff, IOSIZE, "%s%.*s", stp->st_word, | |
| 3511 sug.su_badlen - stp->st_orglen, | |
| 3512 sug.su_badptr + stp->st_orglen); | |
| 3513 repl_to = vim_strsave(IObuff); | |
| 3514 } | |
| 3515 else | |
| 3516 { | |
| 3517 /* Replacing su_badlen or more, use the whole word. */ | |
| 3518 repl_from = vim_strnsave(sug.su_badptr, stp->st_orglen); | |
| 3519 repl_to = vim_strsave(stp->st_word); | |
| 3520 } | |
| 485 | 3521 |
| 3522 /* Replace the word. */ | |
| 1938 | 3523 p = alloc((unsigned)STRLEN(line) - stp->st_orglen |
| 3524 + stp->st_wordlen + 1); | |
| 485 | 3525 if (p != NULL) |
| 3526 { | |
| 835 | 3527 c = (int)(sug.su_badptr - line); |
| 485 | 3528 mch_memmove(p, line, c); |
| 3529 STRCPY(p + c, stp->st_word); | |
| 3530 STRCAT(p, sug.su_badptr + stp->st_orglen); | |
| 3531 ml_replace(curwin->w_cursor.lnum, p, FALSE); | |
| 3532 curwin->w_cursor.col = c; | |
| 3533 | |
| 3534 /* For redo we use a change-word command. */ | |
| 3535 ResetRedobuff(); | |
| 3536 AppendToRedobuff((char_u *)"ciw"); | |
| 620 | 3537 AppendToRedobuffLit(p + c, |
| 625 | 3538 stp->st_wordlen + sug.su_badlen - stp->st_orglen); |
| 485 | 3539 AppendCharToRedobuff(ESC); |
| 819 | 3540 |
| 3541 /* After this "p" may be invalid. */ | |
| 3542 changed_bytes(curwin->w_cursor.lnum, c); | |
| 485 | 3543 } |
| 3544 } | |
| 3545 else | |
| 3546 curwin->w_cursor = prev_cursor; | |
| 323 | 3547 |
| 344 | 3548 spell_find_cleanup(&sug); |
|
2046
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3549 skip: |
|
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3550 vim_free(line); |
| 344 | 3551 } |
| 3552 | |
| 3553 /* | |
| 475 | 3554 * Check if the word at line "lnum" column "col" is required to start with a |
| 3555 * capital. This uses 'spellcapcheck' of the current buffer. | |
| 3556 */ | |
| 3557 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3558 check_need_cap(linenr_T lnum, colnr_T col) |
| 475 | 3559 { |
| 3560 int need_cap = FALSE; | |
| 3561 char_u *line; | |
| 3562 char_u *line_copy = NULL; | |
| 3563 char_u *p; | |
| 3564 colnr_T endcol; | |
| 3565 regmatch_T regmatch; | |
| 3566 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3567 if (curwin->w_s->b_cap_prog == NULL) |
| 475 | 3568 return FALSE; |
| 3569 | |
| 3570 line = ml_get_curline(); | |
| 3571 endcol = 0; | |
|
12323
4dba3e4f3b01
patch 8.0.1041: bogus characters when indenting during visual-block append
Christian Brabandt <cb@256bit.org>
parents:
11521
diff
changeset
|
3572 if (getwhitecols(line) >= (int)col) |
| 475 | 3573 { |
| 3574 /* At start of line, check if previous line is empty or sentence | |
| 3575 * ends there. */ | |
| 3576 if (lnum == 1) | |
| 3577 need_cap = TRUE; | |
| 3578 else | |
| 3579 { | |
| 3580 line = ml_get(lnum - 1); | |
| 3581 if (*skipwhite(line) == NUL) | |
| 3582 need_cap = TRUE; | |
| 3583 else | |
| 3584 { | |
| 3585 /* Append a space in place of the line break. */ | |
| 3586 line_copy = concat_str(line, (char_u *)" "); | |
| 3587 line = line_copy; | |
| 835 | 3588 endcol = (colnr_T)STRLEN(line); |
| 475 | 3589 } |
| 3590 } | |
| 3591 } | |
| 3592 else | |
| 3593 endcol = col; | |
| 3594 | |
| 3595 if (endcol > 0) | |
| 3596 { | |
| 3597 /* Check if sentence ends before the bad word. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3598 regmatch.regprog = curwin->w_s->b_cap_prog; |
| 475 | 3599 regmatch.rm_ic = FALSE; |
| 3600 p = line + endcol; | |
| 3601 for (;;) | |
| 3602 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
3603 MB_PTR_BACK(line, p); |
| 5477 | 3604 if (p == line || spell_iswordp_nmw(p, curwin)) |
| 475 | 3605 break; |
| 3606 if (vim_regexec(®match, p, 0) | |
| 3607 && regmatch.endp[0] == line + endcol) | |
| 3608 { | |
| 3609 need_cap = TRUE; | |
| 3610 break; | |
| 3611 } | |
| 3612 } | |
| 6375 | 3613 curwin->w_s->b_cap_prog = regmatch.regprog; |
| 475 | 3614 } |
| 3615 | |
| 3616 vim_free(line_copy); | |
| 3617 | |
| 3618 return need_cap; | |
| 3619 } | |
| 3620 | |
| 3621 | |
| 3622 /* | |
| 372 | 3623 * ":spellrepall" |
| 3624 */ | |
| 3625 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3626 ex_spellrepall(exarg_T *eap UNUSED) |
| 372 | 3627 { |
| 3628 pos_T pos = curwin->w_cursor; | |
| 3629 char_u *frompat; | |
| 3630 int addlen; | |
| 3631 char_u *line; | |
| 3632 char_u *p; | |
| 3633 int save_ws = p_ws; | |
| 483 | 3634 linenr_T prev_lnum = 0; |
| 372 | 3635 |
| 3636 if (repl_from == NULL || repl_to == NULL) | |
| 3637 { | |
| 3638 EMSG(_("E752: No previous spell replacement")); | |
| 3639 return; | |
| 3640 } | |
| 835 | 3641 addlen = (int)(STRLEN(repl_to) - STRLEN(repl_from)); |
| 3642 | |
| 3643 frompat = alloc((unsigned)STRLEN(repl_from) + 7); | |
| 372 | 3644 if (frompat == NULL) |
| 3645 return; | |
| 3646 sprintf((char *)frompat, "\\V\\<%s\\>", repl_from); | |
| 3647 p_ws = FALSE; | |
| 3648 | |
| 483 | 3649 sub_nsubs = 0; |
| 3650 sub_nlines = 0; | |
| 372 | 3651 curwin->w_cursor.lnum = 0; |
| 3652 while (!got_int) | |
| 3653 { | |
|
11521
578df034735d
patch 8.0.0643: when a pattern search is slow Vim becomes unusable
Christian Brabandt <cb@256bit.org>
parents:
11394
diff
changeset
|
3654 if (do_search(NULL, '/', frompat, 1L, SEARCH_KEEP, NULL, NULL) == 0 |
| 372 | 3655 || u_save_cursor() == FAIL) |
| 3656 break; | |
| 3657 | |
| 3658 /* Only replace when the right word isn't there yet. This happens | |
| 3659 * when changing "etc" to "etc.". */ | |
| 3660 line = ml_get_curline(); | |
| 3661 if (addlen <= 0 || STRNCMP(line + curwin->w_cursor.col, | |
| 3662 repl_to, STRLEN(repl_to)) != 0) | |
| 3663 { | |
| 835 | 3664 p = alloc((unsigned)STRLEN(line) + addlen + 1); |
| 372 | 3665 if (p == NULL) |
| 3666 break; | |
| 3667 mch_memmove(p, line, curwin->w_cursor.col); | |
| 3668 STRCPY(p + curwin->w_cursor.col, repl_to); | |
| 3669 STRCAT(p, line + curwin->w_cursor.col + STRLEN(repl_from)); | |
| 3670 ml_replace(curwin->w_cursor.lnum, p, FALSE); | |
| 3671 changed_bytes(curwin->w_cursor.lnum, curwin->w_cursor.col); | |
| 483 | 3672 |
| 3673 if (curwin->w_cursor.lnum != prev_lnum) | |
| 3674 { | |
| 3675 ++sub_nlines; | |
| 3676 prev_lnum = curwin->w_cursor.lnum; | |
| 3677 } | |
| 3678 ++sub_nsubs; | |
| 372 | 3679 } |
| 835 | 3680 curwin->w_cursor.col += (colnr_T)STRLEN(repl_to); |
| 372 | 3681 } |
| 3682 | |
| 3683 p_ws = save_ws; | |
| 3684 curwin->w_cursor = pos; | |
| 3685 vim_free(frompat); | |
| 3686 | |
| 483 | 3687 if (sub_nsubs == 0) |
| 372 | 3688 EMSG2(_("E753: Not found: %s"), repl_from); |
| 483 | 3689 else |
| 3690 do_sub_msg(FALSE); | |
| 372 | 3691 } |
| 3692 | |
| 3693 /* | |
| 344 | 3694 * Find spell suggestions for "word". Return them in the growarray "*gap" as |
| 3695 * a list of allocated strings. | |
| 3696 */ | |
| 3697 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3698 spell_suggest_list( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3699 garray_T *gap, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3700 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3701 int maxcount, /* maximum nr of suggestions */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3702 int need_cap, /* 'spellcapcheck' matched */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3703 int interactive) |
| 344 | 3704 { |
| 3705 suginfo_T sug; | |
| 3706 int i; | |
| 3707 suggest_T *stp; | |
| 3708 char_u *wcopy; | |
| 3709 | |
| 638 | 3710 spell_find_suggest(word, 0, &sug, maxcount, FALSE, need_cap, interactive); |
| 344 | 3711 |
| 3712 /* Make room in "gap". */ | |
| 3713 ga_init2(gap, sizeof(char_u *), sug.su_ga.ga_len + 1); | |
| 626 | 3714 if (ga_grow(gap, sug.su_ga.ga_len) == OK) |
| 3715 { | |
| 3716 for (i = 0; i < sug.su_ga.ga_len; ++i) | |
| 3717 { | |
| 3718 stp = &SUG(sug.su_ga, i); | |
| 3719 | |
| 3720 /* The suggested word may replace only part of "word", add the not | |
| 3721 * replaced part. */ | |
| 3722 wcopy = alloc(stp->st_wordlen | |
| 835 | 3723 + (unsigned)STRLEN(sug.su_badptr + stp->st_orglen) + 1); |
| 626 | 3724 if (wcopy == NULL) |
| 3725 break; | |
| 3726 STRCPY(wcopy, stp->st_word); | |
| 3727 STRCPY(wcopy + stp->st_wordlen, sug.su_badptr + stp->st_orglen); | |
| 3728 ((char_u **)gap->ga_data)[gap->ga_len++] = wcopy; | |
| 3729 } | |
| 344 | 3730 } |
| 3731 | |
| 3732 spell_find_cleanup(&sug); | |
| 3733 } | |
| 3734 | |
| 3735 /* | |
| 3736 * Find spell suggestions for the word at the start of "badptr". | |
| 3737 * Return the suggestions in "su->su_ga". | |
| 3738 * The maximum number of suggestions is "maxcount". | |
| 3739 * Note: does use info for the current window. | |
| 3740 * This is based on the mechanisms of Aspell, but completely reimplemented. | |
| 3741 */ | |
| 3742 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3743 spell_find_suggest( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3744 char_u *badptr, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3745 int badlen, /* length of bad word or 0 if unknown */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3746 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3747 int maxcount, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3748 int banbadword, /* don't include badword in suggestions */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3749 int need_cap, /* word should start with capital */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3750 int interactive) |
| 344 | 3751 { |
| 534 | 3752 hlf_T attr = HLF_COUNT; |
| 372 | 3753 char_u buf[MAXPATHL]; |
| 3754 char_u *p; | |
| 3755 int do_combine = FALSE; | |
| 3756 char_u *sps_copy; | |
| 3757 #ifdef FEAT_EVAL | |
| 3758 static int expr_busy = FALSE; | |
| 3759 #endif | |
| 385 | 3760 int c; |
| 503 | 3761 int i; |
| 3762 langp_T *lp; | |
| 344 | 3763 |
| 3764 /* | |
| 3765 * Set the info in "*su". | |
| 3766 */ | |
| 3767 vim_memset(su, 0, sizeof(suginfo_T)); | |
| 3768 ga_init2(&su->su_ga, (int)sizeof(suggest_T), 10); | |
| 3769 ga_init2(&su->su_sga, (int)sizeof(suggest_T), 10); | |
| 355 | 3770 if (*badptr == NUL) |
| 3771 return; | |
| 344 | 3772 hash_init(&su->su_banned); |
| 3773 | |
| 3774 su->su_badptr = badptr; | |
| 638 | 3775 if (badlen != 0) |
| 3776 su->su_badlen = badlen; | |
| 3777 else | |
| 3778 su->su_badlen = spell_check(curwin, su->su_badptr, &attr, NULL, FALSE); | |
| 344 | 3779 su->su_maxcount = maxcount; |
| 372 | 3780 su->su_maxscore = SCORE_MAXINIT; |
| 344 | 3781 |
| 3782 if (su->su_badlen >= MAXWLEN) | |
| 3783 su->su_badlen = MAXWLEN - 1; /* just in case */ | |
| 3784 vim_strncpy(su->su_badword, su->su_badptr, su->su_badlen); | |
| 3785 (void)spell_casefold(su->su_badptr, su->su_badlen, | |
| 3786 su->su_fbadword, MAXWLEN); | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
3787 /* TODO: make this work if the case-folded text is longer than the original |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
3788 * text. Currently an illegal byte causes wrong pointer computations. */ |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
3789 su->su_fbadword[su->su_badlen] = NUL; |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
3790 |
| 346 | 3791 /* get caps flags for bad word */ |
| 474 | 3792 su->su_badflags = badword_captype(su->su_badptr, |
| 3793 su->su_badptr + su->su_badlen); | |
| 388 | 3794 if (need_cap) |
| 3795 su->su_badflags |= WF_ONECAP; | |
| 344 | 3796 |
| 503 | 3797 /* Find the default language for sound folding. We simply use the first |
| 3798 * one in 'spelllang' that supports sound folding. That's good for when | |
| 3799 * using multiple files for one language, it's not that bad when mixing | |
| 3800 * languages (e.g., "pl,en"). */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3801 for (i = 0; i < curbuf->b_s.b_langp.ga_len; ++i) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3802 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3803 lp = LANGP_ENTRY(curbuf->b_s.b_langp, i); |
| 503 | 3804 if (lp->lp_sallang != NULL) |
| 3805 { | |
| 3806 su->su_sallang = lp->lp_sallang; | |
| 3807 break; | |
| 3808 } | |
| 3809 } | |
| 3810 | |
| 534 | 3811 /* Soundfold the bad word with the default sound folding, so that we don't |
| 3812 * have to do this many times. */ | |
| 3813 if (su->su_sallang != NULL) | |
| 3814 spell_soundfold(su->su_sallang, su->su_fbadword, TRUE, | |
| 3815 su->su_sal_badword); | |
| 3816 | |
| 385 | 3817 /* If the word is not capitalised and spell_check() doesn't consider the |
| 3818 * word to be bad then it might need to be capitalised. Add a suggestion | |
| 3819 * for that. */ | |
| 455 | 3820 c = PTR2CHAR(su->su_badptr); |
| 534 | 3821 if (!SPELL_ISUPPER(c) && attr == HLF_COUNT) |
| 385 | 3822 { |
| 3823 make_case_word(su->su_badword, buf, WF_ONECAP); | |
| 3824 add_suggestion(su, &su->su_ga, buf, su->su_badlen, SCORE_ICASE, | |
| 625 | 3825 0, TRUE, su->su_sallang, FALSE); |
| 385 | 3826 } |
| 3827 | |
| 344 | 3828 /* Ban the bad word itself. It may appear in another region. */ |
| 358 | 3829 if (banbadword) |
| 3830 add_banned(su, su->su_badword); | |
| 344 | 3831 |
| 372 | 3832 /* Make a copy of 'spellsuggest', because the expression may change it. */ |
| 3833 sps_copy = vim_strsave(p_sps); | |
| 3834 if (sps_copy == NULL) | |
| 3835 return; | |
| 3836 | |
| 3837 /* Loop over the items in 'spellsuggest'. */ | |
| 3838 for (p = sps_copy; *p != NUL; ) | |
| 3839 { | |
| 3840 copy_option_part(&p, buf, MAXPATHL, ","); | |
| 3841 | |
| 3842 if (STRNCMP(buf, "expr:", 5) == 0) | |
| 3843 { | |
| 3844 #ifdef FEAT_EVAL | |
| 375 | 3845 /* Evaluate an expression. Skip this when called recursively, |
| 3846 * when using spellsuggest() in the expression. */ | |
| 372 | 3847 if (!expr_busy) |
| 3848 { | |
| 3849 expr_busy = TRUE; | |
| 3850 spell_suggest_expr(su, buf + 5); | |
| 3851 expr_busy = FALSE; | |
| 3852 } | |
| 3853 #endif | |
| 3854 } | |
| 3855 else if (STRNCMP(buf, "file:", 5) == 0) | |
| 3856 /* Use list of suggestions in a file. */ | |
| 3857 spell_suggest_file(su, buf + 5); | |
| 3858 else | |
| 3859 { | |
| 3860 /* Use internal method. */ | |
| 625 | 3861 spell_suggest_intern(su, interactive); |
| 372 | 3862 if (sps_flags & SPS_DOUBLE) |
| 3863 do_combine = TRUE; | |
| 3864 } | |
| 3865 } | |
| 3866 | |
| 3867 vim_free(sps_copy); | |
| 3868 | |
| 3869 if (do_combine) | |
| 3870 /* Combine the two list of suggestions. This must be done last, | |
| 3871 * because sorting changes the order again. */ | |
| 3872 score_combine(su); | |
| 3873 } | |
| 3874 | |
| 3875 #ifdef FEAT_EVAL | |
| 3876 /* | |
| 3877 * Find suggestions by evaluating expression "expr". | |
| 3878 */ | |
| 3879 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3880 spell_suggest_expr(suginfo_T *su, char_u *expr) |
| 372 | 3881 { |
| 3882 list_T *list; | |
| 3883 listitem_T *li; | |
| 3884 int score; | |
| 3885 char_u *p; | |
| 3886 | |
| 3887 /* The work is split up in a few parts to avoid having to export | |
| 3888 * suginfo_T. | |
| 3889 * First evaluate the expression and get the resulting list. */ | |
| 3890 list = eval_spell_expr(su->su_badword, expr); | |
| 3891 if (list != NULL) | |
| 3892 { | |
| 3893 /* Loop over the items in the list. */ | |
| 3894 for (li = list->lv_first; li != NULL; li = li->li_next) | |
| 3895 if (li->li_tv.v_type == VAR_LIST) | |
| 3896 { | |
| 3897 /* Get the word and the score from the items. */ | |
| 3898 score = get_spellword(li->li_tv.vval.v_list, &p); | |
| 625 | 3899 if (score >= 0 && score <= su->su_maxscore) |
| 3900 add_suggestion(su, &su->su_ga, p, su->su_badlen, | |
| 3901 score, 0, TRUE, su->su_sallang, FALSE); | |
| 372 | 3902 } |
| 3903 list_unref(list); | |
| 3904 } | |
| 3905 | |
| 625 | 3906 /* Remove bogus suggestions, sort and truncate at "maxcount". */ |
| 3907 check_suggestions(su, &su->su_ga); | |
| 372 | 3908 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, su->su_maxcount); |
| 3909 } | |
| 3910 #endif | |
| 3911 | |
| 3912 /* | |
| 474 | 3913 * Find suggestions in file "fname". Used for "file:" in 'spellsuggest'. |
| 372 | 3914 */ |
| 3915 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3916 spell_suggest_file(suginfo_T *su, char_u *fname) |
| 372 | 3917 { |
| 3918 FILE *fd; | |
| 3919 char_u line[MAXWLEN * 2]; | |
| 3920 char_u *p; | |
| 3921 int len; | |
| 3922 char_u cword[MAXWLEN]; | |
| 3923 | |
| 3924 /* Open the file. */ | |
| 3925 fd = mch_fopen((char *)fname, "r"); | |
| 3926 if (fd == NULL) | |
| 3927 { | |
| 3928 EMSG2(_(e_notopen), fname); | |
| 3929 return; | |
| 3930 } | |
| 3931 | |
| 3932 /* Read it line by line. */ | |
| 3933 while (!vim_fgets(line, MAXWLEN * 2, fd) && !got_int) | |
| 3934 { | |
| 3935 line_breakcheck(); | |
| 3936 | |
| 3937 p = vim_strchr(line, '/'); | |
| 3938 if (p == NULL) | |
| 3939 continue; /* No Tab found, just skip the line. */ | |
| 3940 *p++ = NUL; | |
| 3941 if (STRICMP(su->su_badword, line) == 0) | |
| 3942 { | |
| 3943 /* Match! Isolate the good word, until CR or NL. */ | |
| 3944 for (len = 0; p[len] >= ' '; ++len) | |
| 3945 ; | |
| 3946 p[len] = NUL; | |
| 3947 | |
| 3948 /* If the suggestion doesn't have specific case duplicate the case | |
| 3949 * of the bad word. */ | |
| 3950 if (captype(p, NULL) == 0) | |
| 3951 { | |
| 3952 make_case_word(p, cword, su->su_badflags); | |
| 3953 p = cword; | |
| 3954 } | |
| 3955 | |
| 3956 add_suggestion(su, &su->su_ga, p, su->su_badlen, | |
| 625 | 3957 SCORE_FILE, 0, TRUE, su->su_sallang, FALSE); |
| 372 | 3958 } |
| 3959 } | |
| 3960 | |
| 3961 fclose(fd); | |
| 3962 | |
| 625 | 3963 /* Remove bogus suggestions, sort and truncate at "maxcount". */ |
| 3964 check_suggestions(su, &su->su_ga); | |
| 372 | 3965 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, su->su_maxcount); |
| 3966 } | |
| 3967 | |
| 3968 /* | |
| 3969 * Find suggestions for the internal method indicated by "sps_flags". | |
| 3970 */ | |
| 3971 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3972 spell_suggest_intern(suginfo_T *su, int interactive) |
| 625 | 3973 { |
| 3974 /* | |
| 3975 * Load the .sug file(s) that are available and not done yet. | |
| 3976 */ | |
| 3977 suggest_load_files(); | |
| 3978 | |
| 344 | 3979 /* |
| 346 | 3980 * 1. Try special cases, such as repeating a word: "the the" -> "the". |
| 344 | 3981 * |
| 3982 * Set a maximum score to limit the combination of operations that is | |
| 3983 * tried. | |
| 3984 */ | |
| 346 | 3985 suggest_try_special(su); |
| 3986 | |
| 3987 /* | |
| 3988 * 2. Try inserting/deleting/swapping/changing a letter, use REP entries | |
| 3989 * from the .aff file and inserting a space (split the word). | |
| 3990 */ | |
| 3991 suggest_try_change(su); | |
| 344 | 3992 |
| 3993 /* For the resulting top-scorers compute the sound-a-like score. */ | |
| 3994 if (sps_flags & SPS_DOUBLE) | |
| 3995 score_comp_sal(su); | |
| 3996 | |
| 3997 /* | |
| 346 | 3998 * 3. Try finding sound-a-like words. |
| 344 | 3999 */ |
| 625 | 4000 if ((sps_flags & SPS_FAST) == 0) |
| 4001 { | |
| 4002 if (sps_flags & SPS_BEST) | |
| 4003 /* Adjust the word score for the suggestions found so far for how | |
| 4004 * they sounds like. */ | |
| 4005 rescore_suggestions(su); | |
| 4006 | |
| 4007 /* | |
|
2046
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
4008 * While going through the soundfold tree "su_maxscore" is the score |
| 625 | 4009 * for the soundfold word, limits the changes that are being tried, |
| 4010 * and "su_sfmaxscore" the rescored score, which is set by | |
| 4011 * cleanup_suggestions(). | |
| 4012 * First find words with a small edit distance, because this is much | |
| 4013 * faster and often already finds the top-N suggestions. If we didn't | |
| 4014 * find many suggestions try again with a higher edit distance. | |
| 4015 * "sl_sounddone" is used to avoid doing the same word twice. | |
| 4016 */ | |
| 4017 suggest_try_soundalike_prep(); | |
| 4018 su->su_maxscore = SCORE_SFMAX1; | |
| 4019 su->su_sfmaxscore = SCORE_MAXINIT * 3; | |
| 346 | 4020 suggest_try_soundalike(su); |
| 625 | 4021 if (su->su_ga.ga_len < SUG_CLEAN_COUNT(su)) |
| 4022 { | |
| 4023 /* We didn't find enough matches, try again, allowing more | |
| 4024 * changes to the soundfold word. */ | |
| 4025 su->su_maxscore = SCORE_SFMAX2; | |
| 4026 suggest_try_soundalike(su); | |
| 4027 if (su->su_ga.ga_len < SUG_CLEAN_COUNT(su)) | |
| 4028 { | |
| 4029 /* Still didn't find enough matches, try again, allowing even | |
| 4030 * more changes to the soundfold word. */ | |
| 4031 su->su_maxscore = SCORE_SFMAX3; | |
| 4032 suggest_try_soundalike(su); | |
| 4033 } | |
| 4034 } | |
| 4035 su->su_maxscore = su->su_sfmaxscore; | |
| 4036 suggest_try_soundalike_finish(); | |
| 4037 } | |
| 4038 | |
| 4039 /* When CTRL-C was hit while searching do show the results. Only clear | |
| 4040 * got_int when using a command, not for spellsuggest(). */ | |
| 344 | 4041 ui_breakcheck(); |
| 625 | 4042 if (interactive && got_int) |
| 344 | 4043 { |
| 4044 (void)vgetc(); | |
| 4045 got_int = FALSE; | |
| 4046 } | |
| 4047 | |
| 372 | 4048 if ((sps_flags & SPS_DOUBLE) == 0 && su->su_ga.ga_len != 0) |
| 344 | 4049 { |
| 4050 if (sps_flags & SPS_BEST) | |
| 4051 /* Adjust the word score for how it sounds like. */ | |
| 4052 rescore_suggestions(su); | |
| 4053 | |
| 625 | 4054 /* Remove bogus suggestions, sort and truncate at "maxcount". */ |
| 4055 check_suggestions(su, &su->su_ga); | |
| 372 | 4056 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, su->su_maxcount); |
| 344 | 4057 } |
| 4058 } | |
| 4059 | |
| 4060 /* | |
| 4061 * Free the info put in "*su" by spell_find_suggest(). | |
| 4062 */ | |
| 4063 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4064 spell_find_cleanup(suginfo_T *su) |
| 344 | 4065 { |
| 4066 int i; | |
| 4067 | |
| 4068 /* Free the suggestions. */ | |
| 4069 for (i = 0; i < su->su_ga.ga_len; ++i) | |
| 4070 vim_free(SUG(su->su_ga, i).st_word); | |
| 4071 ga_clear(&su->su_ga); | |
| 4072 for (i = 0; i < su->su_sga.ga_len; ++i) | |
| 4073 vim_free(SUG(su->su_sga, i).st_word); | |
| 4074 ga_clear(&su->su_sga); | |
| 323 | 4075 |
| 4076 /* Free the banned words. */ | |
| 625 | 4077 hash_clear_all(&su->su_banned, 0); |
| 323 | 4078 } |
| 4079 | |
| 4080 /* | |
| 324 | 4081 * Make a copy of "word", with the first letter upper or lower cased, to |
| 4082 * "wcopy[MAXWLEN]". "word" must not be empty. | |
| 4083 * The result is NUL terminated. | |
| 323 | 4084 */ |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
4085 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4086 onecap_copy( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4087 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4088 char_u *wcopy, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4089 int upper) /* TRUE: first letter made upper case */ |
| 323 | 4090 { |
| 4091 char_u *p; | |
| 4092 int c; | |
| 4093 int l; | |
| 4094 | |
| 4095 p = word; | |
| 4096 #ifdef FEAT_MBYTE | |
| 4097 if (has_mbyte) | |
| 474 | 4098 c = mb_cptr2char_adv(&p); |
| 323 | 4099 else |
| 4100 #endif | |
| 4101 c = *p++; | |
| 4102 if (upper) | |
| 324 | 4103 c = SPELL_TOUPPER(c); |
| 323 | 4104 else |
| 324 | 4105 c = SPELL_TOFOLD(c); |
| 323 | 4106 #ifdef FEAT_MBYTE |
| 4107 if (has_mbyte) | |
| 4108 l = mb_char2bytes(c, wcopy); | |
| 4109 else | |
| 4110 #endif | |
| 4111 { | |
| 4112 l = 1; | |
| 4113 wcopy[0] = c; | |
| 4114 } | |
| 376 | 4115 vim_strncpy(wcopy + l, p, MAXWLEN - l - 1); |
| 323 | 4116 } |
| 4117 | |
| 4118 /* | |
| 324 | 4119 * Make a copy of "word" with all the letters upper cased into |
| 4120 * "wcopy[MAXWLEN]". The result is NUL terminated. | |
| 323 | 4121 */ |
| 4122 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4123 allcap_copy(char_u *word, char_u *wcopy) |
| 323 | 4124 { |
| 4125 char_u *s; | |
| 4126 char_u *d; | |
| 4127 int c; | |
| 4128 | |
| 4129 d = wcopy; | |
| 4130 for (s = word; *s != NUL; ) | |
| 4131 { | |
| 4132 #ifdef FEAT_MBYTE | |
| 4133 if (has_mbyte) | |
| 474 | 4134 c = mb_cptr2char_adv(&s); |
| 323 | 4135 else |
| 4136 #endif | |
| 4137 c = *s++; | |
| 492 | 4138 |
| 4139 #ifdef FEAT_MBYTE | |
| 3042 | 4140 /* We only change 0xdf to SS when we are certain latin1 is used. It |
| 492 | 4141 * would cause weird errors in other 8-bit encodings. */ |
| 4142 if (enc_latin1like && c == 0xdf) | |
| 4143 { | |
| 4144 c = 'S'; | |
| 4145 if (d - wcopy >= MAXWLEN - 1) | |
| 4146 break; | |
| 4147 *d++ = c; | |
| 4148 } | |
| 4149 else | |
| 4150 #endif | |
| 4151 c = SPELL_TOUPPER(c); | |
| 323 | 4152 |
| 4153 #ifdef FEAT_MBYTE | |
| 4154 if (has_mbyte) | |
| 4155 { | |
| 4156 if (d - wcopy >= MAXWLEN - MB_MAXBYTES) | |
| 4157 break; | |
| 4158 d += mb_char2bytes(c, d); | |
| 4159 } | |
| 4160 else | |
| 4161 #endif | |
| 4162 { | |
| 4163 if (d - wcopy >= MAXWLEN - 1) | |
| 4164 break; | |
| 4165 *d++ = c; | |
| 4166 } | |
| 4167 } | |
| 4168 *d = NUL; | |
| 4169 } | |
| 4170 | |
| 4171 /* | |
| 346 | 4172 * Try finding suggestions by recognizing specific situations. |
| 4173 */ | |
| 4174 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4175 suggest_try_special(suginfo_T *su) |
| 346 | 4176 { |
| 4177 char_u *p; | |
| 376 | 4178 size_t len; |
| 346 | 4179 int c; |
| 4180 char_u word[MAXWLEN]; | |
| 4181 | |
| 4182 /* | |
| 4183 * Recognize a word that is repeated: "the the". | |
| 4184 */ | |
| 4185 p = skiptowhite(su->su_fbadword); | |
| 4186 len = p - su->su_fbadword; | |
| 4187 p = skipwhite(p); | |
| 4188 if (STRLEN(p) == len && STRNCMP(su->su_fbadword, p, len) == 0) | |
| 4189 { | |
| 4190 /* Include badflags: if the badword is onecap or allcap | |
| 4191 * use that for the goodword too: "The the" -> "The". */ | |
| 4192 c = su->su_fbadword[len]; | |
| 4193 su->su_fbadword[len] = NUL; | |
| 4194 make_case_word(su->su_fbadword, word, su->su_badflags); | |
| 4195 su->su_fbadword[len] = c; | |
| 534 | 4196 |
| 4197 /* Give a soundalike score of 0, compute the score as if deleting one | |
| 4198 * character. */ | |
| 4199 add_suggestion(su, &su->su_ga, word, su->su_badlen, | |
| 625 | 4200 RESCORE(SCORE_REP, 0), 0, TRUE, su->su_sallang, FALSE); |
| 346 | 4201 } |
| 4202 } | |
| 4203 | |
| 4204 /* | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4205 * Change the 0 to 1 to measure how much time is spent in each state. |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4206 * Output is dumped in "suggestprof". |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4207 */ |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4208 #if 0 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4209 # define SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4210 proftime_T current; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4211 proftime_T total; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4212 proftime_T times[STATE_FINAL + 1]; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4213 long counts[STATE_FINAL + 1]; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4214 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4215 static void |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4216 prof_init(void) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4217 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4218 for (int i = 0; i <= STATE_FINAL; ++i) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4219 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4220 profile_zero(×[i]); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4221 counts[i] = 0; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4222 } |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4223 profile_start(¤t); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4224 profile_start(&total); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4225 } |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4226 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4227 /* call before changing state */ |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4228 static void |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4229 prof_store(state_T state) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4230 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4231 profile_end(¤t); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4232 profile_add(×[state], ¤t); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4233 ++counts[state]; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4234 profile_start(¤t); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4235 } |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4236 # define PROF_STORE(state) prof_store(state); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4237 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4238 static void |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4239 prof_report(char *name) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4240 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4241 FILE *fd = fopen("suggestprof", "a"); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4242 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4243 profile_end(&total); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4244 fprintf(fd, "-----------------------\n"); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4245 fprintf(fd, "%s: %s\n", name, profile_msg(&total)); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4246 for (int i = 0; i <= STATE_FINAL; ++i) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4247 fprintf(fd, "%d: %s (%ld)\n", i, profile_msg(×[i]), counts[i]); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4248 fclose(fd); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4249 } |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4250 #else |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4251 # define PROF_STORE(state) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4252 #endif |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4253 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4254 /* |
| 323 | 4255 * Try finding suggestions by adding/removing/swapping letters. |
| 4256 */ | |
| 4257 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4258 suggest_try_change(suginfo_T *su) |
| 323 | 4259 { |
| 4260 char_u fword[MAXWLEN]; /* copy of the bad word, case-folded */ | |
| 625 | 4261 int n; |
| 4262 char_u *p; | |
| 4263 int lpi; | |
| 323 | 4264 langp_T *lp; |
| 4265 | |
| 4266 /* We make a copy of the case-folded bad word, so that we can modify it | |
| 346 | 4267 * to find matches (esp. REP items). Append some more text, changing |
| 4268 * chars after the bad word may help. */ | |
| 323 | 4269 STRCPY(fword, su->su_fbadword); |
| 835 | 4270 n = (int)STRLEN(fword); |
| 346 | 4271 p = su->su_badptr + su->su_badlen; |
| 835 | 4272 (void)spell_casefold(p, (int)STRLEN(p), fword + n, MAXWLEN - n); |
| 323 | 4273 |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4274 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4275 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4276 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 482 | 4277 |
| 500 | 4278 /* If reloading a spell file fails it's still in the list but |
| 4279 * everything has been cleared. */ | |
| 625 | 4280 if (lp->lp_slang->sl_fbyts == NULL) |
| 500 | 4281 continue; |
| 4282 | |
| 625 | 4283 /* Try it for this language. Will add possible suggestions. */ |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4284 #ifdef SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4285 prof_init(); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4286 #endif |
| 625 | 4287 suggest_trie_walk(su, lp, fword, FALSE); |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4288 #ifdef SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4289 prof_report("try_change"); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4290 #endif |
| 625 | 4291 } |
| 4292 } | |
| 4293 | |
| 4294 /* Check the maximum score, if we go over it we won't try this change. */ | |
| 4295 #define TRY_DEEPER(su, stack, depth, add) \ | |
| 4296 (stack[depth].ts_score + (add) < su->su_maxscore) | |
| 4297 | |
| 4298 /* | |
| 4299 * Try finding suggestions by adding/removing/swapping letters. | |
| 4300 * | |
| 4301 * This uses a state machine. At each node in the tree we try various | |
| 4302 * operations. When trying if an operation works "depth" is increased and the | |
| 4303 * stack[] is used to store info. This allows combinations, thus insert one | |
| 4304 * character, replace one and delete another. The number of changes is | |
| 4305 * limited by su->su_maxscore. | |
| 4306 * | |
| 4307 * After implementing this I noticed an article by Kemal Oflazer that | |
| 4308 * describes something similar: "Error-tolerant Finite State Recognition with | |
| 4309 * Applications to Morphological Analysis and Spelling Correction" (1996). | |
| 4310 * The implementation in the article is simplified and requires a stack of | |
| 4311 * unknown depth. The implementation here only needs a stack depth equal to | |
| 4312 * the length of the word. | |
| 4313 * | |
| 4314 * This is also used for the sound-folded word, "soundfold" is TRUE then. | |
| 4315 * The mechanism is the same, but we find a match with a sound-folded word | |
| 4316 * that comes from one or more original words. Each of these words may be | |
| 4317 * added, this is done by add_sound_suggest(). | |
| 4318 * Don't use: | |
| 4319 * the prefix tree or the keep-case tree | |
| 4320 * "su->su_badlen" | |
| 4321 * anything to do with upper and lower case | |
| 4322 * anything to do with word or non-word characters ("spell_iswordp()") | |
| 4323 * banned words | |
| 4324 * word flags (rare, region, compounding) | |
| 4325 * word splitting for now | |
| 4326 * "similar_chars()" | |
| 4327 * use "slang->sl_repsal" instead of "lp->lp_replang->sl_rep" | |
| 4328 */ | |
| 4329 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4330 suggest_trie_walk( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4331 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4332 langp_T *lp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4333 char_u *fword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4334 int soundfold) |
| 625 | 4335 { |
| 4336 char_u tword[MAXWLEN]; /* good word collected so far */ | |
| 4337 trystate_T stack[MAXWLEN]; | |
| 4338 char_u preword[MAXWLEN * 3]; /* word found with proper case; | |
|
2046
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
4339 * concatenation of prefix compound |
| 625 | 4340 * words and split word. NUL terminated |
| 4341 * when going deeper but not when coming | |
| 4342 * back. */ | |
| 4343 char_u compflags[MAXWLEN]; /* compound flags, one for each word */ | |
| 4344 trystate_T *sp; | |
| 4345 int newscore; | |
| 4346 int score; | |
| 4347 char_u *byts, *fbyts, *pbyts; | |
| 4348 idx_T *idxs, *fidxs, *pidxs; | |
| 4349 int depth; | |
| 4350 int c, c2, c3; | |
| 4351 int n = 0; | |
| 4352 int flags; | |
| 4353 garray_T *gap; | |
| 4354 idx_T arridx; | |
| 4355 int len; | |
| 4356 char_u *p; | |
| 4357 fromto_T *ftp; | |
| 4358 int fl = 0, tl; | |
| 4359 int repextra = 0; /* extra bytes in fword[] from REP item */ | |
| 4360 slang_T *slang = lp->lp_slang; | |
| 4361 int fword_ends; | |
| 4362 int goodword_ends; | |
| 4363 #ifdef DEBUG_TRIEWALK | |
| 4364 /* Stores the name of the change made at each level. */ | |
| 4365 char_u changename[MAXWLEN][80]; | |
| 4366 #endif | |
| 4367 int breakcheckcount = 1000; | |
| 4368 int compound_ok; | |
| 4369 | |
| 4370 /* | |
| 4371 * Go through the whole case-fold tree, try changes at each node. | |
| 4372 * "tword[]" contains the word collected from nodes in the tree. | |
| 4373 * "fword[]" the word we are trying to match with (initially the bad | |
| 4374 * word). | |
| 4375 */ | |
| 4376 depth = 0; | |
| 4377 sp = &stack[0]; | |
| 4378 vim_memset(sp, 0, sizeof(trystate_T)); | |
| 4379 sp->ts_curi = 1; | |
| 4380 | |
| 4381 if (soundfold) | |
| 4382 { | |
| 4383 /* Going through the soundfold tree. */ | |
| 4384 byts = fbyts = slang->sl_sbyts; | |
| 4385 idxs = fidxs = slang->sl_sidxs; | |
| 4386 pbyts = NULL; | |
| 4387 pidxs = NULL; | |
| 4388 sp->ts_prefixdepth = PFD_NOPREFIX; | |
| 4389 sp->ts_state = STATE_START; | |
| 4390 } | |
| 4391 else | |
| 4392 { | |
| 330 | 4393 /* |
| 375 | 4394 * When there are postponed prefixes we need to use these first. At |
| 4395 * the end of the prefix we continue in the case-fold tree. | |
| 4396 */ | |
| 482 | 4397 fbyts = slang->sl_fbyts; |
| 4398 fidxs = slang->sl_fidxs; | |
| 4399 pbyts = slang->sl_pbyts; | |
| 4400 pidxs = slang->sl_pidxs; | |
| 375 | 4401 if (pbyts != NULL) |
| 4402 { | |
| 4403 byts = pbyts; | |
| 4404 idxs = pidxs; | |
| 482 | 4405 sp->ts_prefixdepth = PFD_PREFIXTREE; |
| 375 | 4406 sp->ts_state = STATE_NOPREFIX; /* try without prefix first */ |
| 4407 } | |
| 4408 else | |
| 4409 { | |
| 4410 byts = fbyts; | |
| 4411 idxs = fidxs; | |
| 482 | 4412 sp->ts_prefixdepth = PFD_NOPREFIX; |
| 485 | 4413 sp->ts_state = STATE_START; |
| 375 | 4414 } |
| 625 | 4415 } |
| 4416 | |
| 4417 /* | |
| 4418 * Loop to find all suggestions. At each round we either: | |
| 4419 * - For the current state try one operation, advance "ts_curi", | |
| 4420 * increase "depth". | |
| 4421 * - When a state is done go to the next, set "ts_state". | |
| 4422 * - When all states are tried decrease "depth". | |
| 4423 */ | |
| 4424 while (depth >= 0 && !got_int) | |
| 4425 { | |
| 4426 sp = &stack[depth]; | |
| 4427 switch (sp->ts_state) | |
| 4428 { | |
| 4429 case STATE_START: | |
| 4430 case STATE_NOPREFIX: | |
| 4431 /* | |
| 4432 * Start of node: Deal with NUL bytes, which means | |
| 4433 * tword[] may end here. | |
| 4434 */ | |
| 4435 arridx = sp->ts_arridx; /* current node in the tree */ | |
| 4436 len = byts[arridx]; /* bytes in this node */ | |
| 4437 arridx += sp->ts_curi; /* index of current byte */ | |
| 4438 | |
| 4439 if (sp->ts_prefixdepth == PFD_PREFIXTREE) | |
| 4440 { | |
| 4441 /* Skip over the NUL bytes, we use them later. */ | |
| 4442 for (n = 0; n < len && byts[arridx + n] == 0; ++n) | |
| 4443 ; | |
| 4444 sp->ts_curi += n; | |
| 4445 | |
| 4446 /* Always past NUL bytes now. */ | |
| 4447 n = (int)sp->ts_state; | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4448 PROF_STORE(sp->ts_state) |
| 625 | 4449 sp->ts_state = STATE_ENDNUL; |
| 4450 sp->ts_save_badflags = su->su_badflags; | |
| 4451 | |
| 4452 /* At end of a prefix or at start of prefixtree: check for | |
| 4453 * following word. */ | |
| 4454 if (byts[arridx] == 0 || n == (int)STATE_NOPREFIX) | |
| 4455 { | |
| 4456 /* Set su->su_badflags to the caps type at this position. | |
| 4457 * Use the caps type until here for the prefix itself. */ | |
| 4458 #ifdef FEAT_MBYTE | |
| 4459 if (has_mbyte) | |
| 4460 n = nofold_len(fword, sp->ts_fidx, su->su_badptr); | |
| 4461 else | |
| 4462 #endif | |
| 4463 n = sp->ts_fidx; | |
| 4464 flags = badword_captype(su->su_badptr, su->su_badptr + n); | |
| 4465 su->su_badflags = badword_captype(su->su_badptr + n, | |
| 455 | 4466 su->su_badptr + su->su_badlen); |
| 625 | 4467 #ifdef DEBUG_TRIEWALK |
| 4468 sprintf(changename[depth], "prefix"); | |
| 4469 #endif | |
| 4470 go_deeper(stack, depth, 0); | |
| 4471 ++depth; | |
| 4472 sp = &stack[depth]; | |
| 4473 sp->ts_prefixdepth = depth - 1; | |
| 4474 byts = fbyts; | |
| 4475 idxs = fidxs; | |
| 4476 sp->ts_arridx = 0; | |
| 4477 | |
| 4478 /* Move the prefix to preword[] with the right case | |
| 4479 * and make find_keepcap_word() works. */ | |
| 4480 tword[sp->ts_twordlen] = NUL; | |
| 4481 make_case_word(tword + sp->ts_splitoff, | |
| 4482 preword + sp->ts_prewordlen, flags); | |
| 835 | 4483 sp->ts_prewordlen = (char_u)STRLEN(preword); |
| 625 | 4484 sp->ts_splitoff = sp->ts_twordlen; |
| 4485 } | |
| 4486 break; | |
| 4487 } | |
| 4488 | |
| 4489 if (sp->ts_curi > len || byts[arridx] != 0) | |
| 4490 { | |
| 4491 /* Past bytes in node and/or past NUL bytes. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4492 PROF_STORE(sp->ts_state) |
| 625 | 4493 sp->ts_state = STATE_ENDNUL; |
| 4494 sp->ts_save_badflags = su->su_badflags; | |
| 4495 break; | |
| 4496 } | |
| 4497 | |
| 4498 /* | |
| 4499 * End of word in tree. | |
| 4500 */ | |
| 4501 ++sp->ts_curi; /* eat one NUL byte */ | |
| 4502 | |
| 4503 flags = (int)idxs[arridx]; | |
| 698 | 4504 |
| 4505 /* Skip words with the NOSUGGEST flag. */ | |
| 4506 if (flags & WF_NOSUGGEST) | |
| 4507 break; | |
| 4508 | |
| 625 | 4509 fword_ends = (fword[sp->ts_fidx] == NUL |
| 4510 || (soundfold | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
4511 ? VIM_ISWHITE(fword[sp->ts_fidx]) |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4512 : !spell_iswordp(fword + sp->ts_fidx, curwin))); |
| 625 | 4513 tword[sp->ts_twordlen] = NUL; |
| 4514 | |
| 4515 if (sp->ts_prefixdepth <= PFD_NOTSPECIAL | |
| 485 | 4516 && (sp->ts_flags & TSF_PREFIXOK) == 0) |
| 625 | 4517 { |
| 4518 /* There was a prefix before the word. Check that the prefix | |
| 4519 * can be used with this word. */ | |
| 4520 /* Count the length of the NULs in the prefix. If there are | |
| 4521 * none this must be the first try without a prefix. */ | |
| 4522 n = stack[sp->ts_prefixdepth].ts_arridx; | |
| 4523 len = pbyts[n++]; | |
| 4524 for (c = 0; c < len && pbyts[n + c] == 0; ++c) | |
| 4525 ; | |
| 4526 if (c > 0) | |
| 4527 { | |
| 4528 c = valid_word_prefix(c, n, flags, | |
| 483 | 4529 tword + sp->ts_splitoff, slang, FALSE); |
| 625 | 4530 if (c == 0) |
| 4531 break; | |
| 4532 | |
| 4533 /* Use the WF_RARE flag for a rare prefix. */ | |
| 4534 if (c & WF_RAREPFX) | |
| 4535 flags |= WF_RARE; | |
| 4536 | |
| 4537 /* Tricky: when checking for both prefix and compounding | |
| 4538 * we run into the prefix flag first. | |
| 4539 * Remember that it's OK, so that we accept the prefix | |
| 4540 * when arriving at a compound flag. */ | |
| 4541 sp->ts_flags |= TSF_PREFIXOK; | |
| 4542 } | |
| 4543 } | |
| 4544 | |
| 4545 /* Check NEEDCOMPOUND: can't use word without compounding. Do try | |
| 4546 * appending another compound word below. */ | |
| 4547 if (sp->ts_complen == sp->ts_compsplit && fword_ends | |
| 500 | 4548 && (flags & WF_NEEDCOMP)) |
| 625 | 4549 goodword_ends = FALSE; |
| 4550 else | |
| 4551 goodword_ends = TRUE; | |
| 4552 | |
| 4553 p = NULL; | |
| 4554 compound_ok = TRUE; | |
| 4555 if (sp->ts_complen > sp->ts_compsplit) | |
| 4556 { | |
| 4557 if (slang->sl_nobreak) | |
| 4558 { | |
| 4559 /* There was a word before this word. When there was no | |
| 4560 * change in this word (it was correct) add the first word | |
| 4561 * as a suggestion. If this word was corrected too, we | |
| 4562 * need to check if a correct word follows. */ | |
| 4563 if (sp->ts_fidx - sp->ts_splitfidx | |
| 4564 == sp->ts_twordlen - sp->ts_splitoff | |
| 4565 && STRNCMP(fword + sp->ts_splitfidx, | |
| 4566 tword + sp->ts_splitoff, | |
| 4567 sp->ts_fidx - sp->ts_splitfidx) == 0) | |
| 492 | 4568 { |
| 625 | 4569 preword[sp->ts_prewordlen] = NUL; |
| 4570 newscore = score_wordcount_adj(slang, sp->ts_score, | |
| 4571 preword + sp->ts_prewordlen, | |
| 4572 sp->ts_prewordlen > 0); | |
| 4573 /* Add the suggestion if the score isn't too bad. */ | |
| 4574 if (newscore <= su->su_maxscore) | |
| 492 | 4575 add_suggestion(su, &su->su_ga, preword, |
| 503 | 4576 sp->ts_splitfidx - repextra, |
| 625 | 4577 newscore, 0, FALSE, |
| 4578 lp->lp_sallang, FALSE); | |
| 4579 break; | |
| 492 | 4580 } |
| 490 | 4581 } |
| 4582 else | |
| 625 | 4583 { |
| 4584 /* There was a compound word before this word. If this | |
| 4585 * word does not support compounding then give up | |
| 4586 * (splitting is tried for the word without compound | |
| 4587 * flag). */ | |
| 4588 if (((unsigned)flags >> 24) == 0 | |
| 4589 || sp->ts_twordlen - sp->ts_splitoff | |
| 4590 < slang->sl_compminlen) | |
| 4591 break; | |
| 4592 #ifdef FEAT_MBYTE | |
| 4593 /* For multi-byte chars check character length against | |
| 4594 * COMPOUNDMIN. */ | |
| 4595 if (has_mbyte | |
| 4596 && slang->sl_compminlen > 0 | |
| 4597 && mb_charlen(tword + sp->ts_splitoff) | |
| 4598 < slang->sl_compminlen) | |
| 4599 break; | |
| 4600 #endif | |
| 4601 | |
| 4602 compflags[sp->ts_complen] = ((unsigned)flags >> 24); | |
| 4603 compflags[sp->ts_complen + 1] = NUL; | |
| 4604 vim_strncpy(preword + sp->ts_prewordlen, | |
| 4605 tword + sp->ts_splitoff, | |
| 4606 sp->ts_twordlen - sp->ts_splitoff); | |
| 1762 | 4607 |
| 4608 /* Verify CHECKCOMPOUNDPATTERN rules. */ | |
| 4609 if (match_checkcompoundpattern(preword, sp->ts_prewordlen, | |
| 4610 &slang->sl_comppat)) | |
| 4611 compound_ok = FALSE; | |
| 4612 | |
| 4613 if (compound_ok) | |
| 4614 { | |
| 4615 p = preword; | |
| 4616 while (*skiptowhite(p) != NUL) | |
| 4617 p = skipwhite(skiptowhite(p)); | |
| 4618 if (fword_ends && !can_compound(slang, p, | |
| 625 | 4619 compflags + sp->ts_compsplit)) |
| 1762 | 4620 /* Compound is not allowed. But it may still be |
| 4621 * possible if we add another (short) word. */ | |
| 4622 compound_ok = FALSE; | |
| 4623 } | |
| 625 | 4624 |
| 4625 /* Get pointer to last char of previous word. */ | |
| 4626 p = preword + sp->ts_prewordlen; | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
4627 MB_PTR_BACK(preword, p); |
| 625 | 4628 } |
| 4629 } | |
| 4630 | |
| 4631 /* | |
| 4632 * Form the word with proper case in preword. | |
| 4633 * If there is a word from a previous split, append. | |
| 4634 * For the soundfold tree don't change the case, simply append. | |
| 4635 */ | |
| 4636 if (soundfold) | |
| 4637 STRCPY(preword + sp->ts_prewordlen, tword + sp->ts_splitoff); | |
| 4638 else if (flags & WF_KEEPCAP) | |
| 4639 /* Must find the word in the keep-case tree. */ | |
| 4640 find_keepcap_word(slang, tword + sp->ts_splitoff, | |
| 483 | 4641 preword + sp->ts_prewordlen); |
| 625 | 4642 else |
| 4643 { | |
| 4644 /* Include badflags: If the badword is onecap or allcap | |
| 4645 * use that for the goodword too. But if the badword is | |
| 4646 * allcap and it's only one char long use onecap. */ | |
| 4647 c = su->su_badflags; | |
| 4648 if ((c & WF_ALLCAP) | |
| 4649 #ifdef FEAT_MBYTE | |
| 4650 && su->su_badlen == (*mb_ptr2len)(su->su_badptr) | |
| 346 | 4651 #else |
| 625 | 4652 && su->su_badlen == 1 |
| 4653 #endif | |
| 4654 ) | |
| 4655 c = WF_ONECAP; | |
| 4656 c |= flags; | |
| 4657 | |
| 4658 /* When appending a compound word after a word character don't | |
| 4659 * use Onecap. */ | |
| 5477 | 4660 if (p != NULL && spell_iswordp_nmw(p, curwin)) |
| 625 | 4661 c &= ~WF_ONECAP; |
| 4662 make_case_word(tword + sp->ts_splitoff, | |
| 490 | 4663 preword + sp->ts_prewordlen, c); |
| 625 | 4664 } |
| 4665 | |
| 4666 if (!soundfold) | |
| 4667 { | |
| 323 | 4668 /* Don't use a banned word. It may appear again as a good |
| 4669 * word, thus remember it. */ | |
| 4670 if (flags & WF_BANNED) | |
| 4671 { | |
| 483 | 4672 add_banned(su, preword + sp->ts_prewordlen); |
| 323 | 4673 break; |
| 4674 } | |
| 534 | 4675 if ((sp->ts_complen == sp->ts_compsplit |
| 625 | 4676 && WAS_BANNED(su, preword + sp->ts_prewordlen)) |
| 4677 || WAS_BANNED(su, preword)) | |
| 534 | 4678 { |
| 4679 if (slang->sl_compprog == NULL) | |
| 4680 break; | |
| 4681 /* the word so far was banned but we may try compounding */ | |
| 4682 goodword_ends = FALSE; | |
| 4683 } | |
| 625 | 4684 } |
| 4685 | |
| 4686 newscore = 0; | |
| 4687 if (!soundfold) /* soundfold words don't have flags */ | |
| 4688 { | |
| 323 | 4689 if ((flags & WF_REGION) |
| 390 | 4690 && (((unsigned)flags >> 16) & lp->lp_region) == 0) |
| 323 | 4691 newscore += SCORE_REGION; |
| 4692 if (flags & WF_RARE) | |
| 4693 newscore += SCORE_RARE; | |
| 4694 | |
| 346 | 4695 if (!spell_valid_case(su->su_badflags, |
| 483 | 4696 captype(preword + sp->ts_prewordlen, NULL))) |
| 323 | 4697 newscore += SCORE_ICASE; |
| 625 | 4698 } |
| 4699 | |
| 4700 /* TODO: how about splitting in the soundfold tree? */ | |
| 4701 if (fword_ends | |
| 4702 && goodword_ends | |
| 4703 && sp->ts_fidx >= sp->ts_fidxtry | |
| 4704 && compound_ok) | |
| 4705 { | |
| 4706 /* The badword also ends: add suggestions. */ | |
| 4707 #ifdef DEBUG_TRIEWALK | |
| 4708 if (soundfold && STRCMP(preword, "smwrd") == 0) | |
| 4709 { | |
| 4710 int j; | |
| 4711 | |
| 4712 /* print the stack of changes that brought us here */ | |
| 4713 smsg("------ %s -------", fword); | |
| 4714 for (j = 0; j < depth; ++j) | |
| 4715 smsg("%s", changename[j]); | |
| 4716 } | |
| 4717 #endif | |
| 4718 if (soundfold) | |
| 4719 { | |
| 4720 /* For soundfolded words we need to find the original | |
| 1188 | 4721 * words, the edit distance and then add them. */ |
| 625 | 4722 add_sound_suggest(su, preword, sp->ts_score, lp); |
| 4723 } | |
|
2457
6c1d10a85398
Avoid illegal memory access in spell suggestion. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2455
diff
changeset
|
4724 else if (sp->ts_fidx > 0) |
| 625 | 4725 { |
| 4726 /* Give a penalty when changing non-word char to word | |
| 4727 * char, e.g., "thes," -> "these". */ | |
| 366 | 4728 p = fword + sp->ts_fidx; |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
4729 MB_PTR_BACK(fword, p); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4730 if (!spell_iswordp(p, curwin)) |
| 366 | 4731 { |
| 4732 p = preword + STRLEN(preword); | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
4733 MB_PTR_BACK(preword, p); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4734 if (spell_iswordp(p, curwin)) |
| 366 | 4735 newscore += SCORE_NONWORD; |
| 4736 } | |
| 4737 | |
| 625 | 4738 /* Give a bonus to words seen before. */ |
| 4739 score = score_wordcount_adj(slang, | |
| 4740 sp->ts_score + newscore, | |
| 4741 preword + sp->ts_prewordlen, | |
| 4742 sp->ts_prewordlen > 0); | |
| 4743 | |
| 4744 /* Add the suggestion if the score isn't too bad. */ | |
| 4745 if (score <= su->su_maxscore) | |
| 633 | 4746 { |
| 625 | 4747 add_suggestion(su, &su->su_ga, preword, |
| 4748 sp->ts_fidx - repextra, | |
| 4749 score, 0, FALSE, lp->lp_sallang, FALSE); | |
| 633 | 4750 |
| 4751 if (su->su_badflags & WF_MIXCAP) | |
| 4752 { | |
| 4753 /* We really don't know if the word should be | |
| 4754 * upper or lower case, add both. */ | |
| 4755 c = captype(preword, NULL); | |
| 4756 if (c == 0 || c == WF_ALLCAP) | |
| 4757 { | |
| 4758 make_case_word(tword + sp->ts_splitoff, | |
| 4759 preword + sp->ts_prewordlen, | |
| 4760 c == 0 ? WF_ALLCAP : 0); | |
| 4761 | |
| 4762 add_suggestion(su, &su->su_ga, preword, | |
| 4763 sp->ts_fidx - repextra, | |
| 4764 score + SCORE_ICASE, 0, FALSE, | |
| 4765 lp->lp_sallang, FALSE); | |
| 4766 } | |
| 4767 } | |
| 4768 } | |
| 625 | 4769 } |
| 4770 } | |
| 4771 | |
| 4772 /* | |
| 4773 * Try word split and/or compounding. | |
| 4774 */ | |
| 4775 if ((sp->ts_fidx >= sp->ts_fidxtry || fword_ends) | |
| 4776 #ifdef FEAT_MBYTE | |
| 4777 /* Don't split halfway a character. */ | |
| 4778 && (!has_mbyte || sp->ts_tcharlen == 0) | |
| 4779 #endif | |
| 4780 ) | |
| 4781 { | |
| 4782 int try_compound; | |
| 4783 int try_split; | |
| 4784 | |
| 4785 /* If past the end of the bad word don't try a split. | |
| 4786 * Otherwise try changing the next word. E.g., find | |
| 4787 * suggestions for "the the" where the second "the" is | |
| 4788 * different. It's done like a split. | |
| 4789 * TODO: word split for soundfold words */ | |
| 4790 try_split = (sp->ts_fidx - repextra < su->su_badlen) | |
| 4791 && !soundfold; | |
| 4792 | |
| 4793 /* Get here in several situations: | |
| 4794 * 1. The word in the tree ends: | |
| 4795 * If the word allows compounding try that. Otherwise try | |
| 4796 * a split by inserting a space. For both check that a | |
| 4797 * valid words starts at fword[sp->ts_fidx]. | |
| 4798 * For NOBREAK do like compounding to be able to check if | |
| 4799 * the next word is valid. | |
| 4800 * 2. The badword does end, but it was due to a change (e.g., | |
| 4801 * a swap). No need to split, but do check that the | |
| 4802 * following word is valid. | |
| 4803 * 3. The badword and the word in the tree end. It may still | |
| 4804 * be possible to compound another (short) word. | |
| 4805 */ | |
| 4806 try_compound = FALSE; | |
| 4807 if (!soundfold | |
|
7526
08c1f73efcde
commit https://github.com/vim/vim/commit/7b877b360532713dc21a0ff3d55a76ac02eaf573
Christian Brabandt <cb@256bit.org>
parents:
7509
diff
changeset
|
4808 && !slang->sl_nocompoundsugs |
| 625 | 4809 && slang->sl_compprog != NULL |
| 4810 && ((unsigned)flags >> 24) != 0 | |
| 4811 && sp->ts_twordlen - sp->ts_splitoff | |
| 4812 >= slang->sl_compminlen | |
| 4813 #ifdef FEAT_MBYTE | |
| 4814 && (!has_mbyte | |
| 4815 || slang->sl_compminlen == 0 | |
| 4816 || mb_charlen(tword + sp->ts_splitoff) | |
| 4817 >= slang->sl_compminlen) | |
| 4818 #endif | |
| 4819 && (slang->sl_compsylmax < MAXWLEN | |
| 4820 || sp->ts_complen + 1 - sp->ts_compsplit | |
| 4821 < slang->sl_compmax) | |
| 1762 | 4822 && (can_be_compound(sp, slang, |
| 4823 compflags, ((unsigned)flags >> 24)))) | |
| 4824 | |
| 625 | 4825 { |
| 4826 try_compound = TRUE; | |
| 4827 compflags[sp->ts_complen] = ((unsigned)flags >> 24); | |
| 4828 compflags[sp->ts_complen + 1] = NUL; | |
| 4829 } | |
| 4830 | |
| 4831 /* For NOBREAK we never try splitting, it won't make any word | |
| 4832 * valid. */ | |
|
7526
08c1f73efcde
commit https://github.com/vim/vim/commit/7b877b360532713dc21a0ff3d55a76ac02eaf573
Christian Brabandt <cb@256bit.org>
parents:
7509
diff
changeset
|
4833 if (slang->sl_nobreak && !slang->sl_nocompoundsugs) |
| 625 | 4834 try_compound = TRUE; |
| 4835 | |
| 4836 /* If we could add a compound word, and it's also possible to | |
| 4837 * split at this point, do the split first and set | |
| 4838 * TSF_DIDSPLIT to avoid doing it again. */ | |
| 4839 else if (!fword_ends | |
| 4840 && try_compound | |
| 4841 && (sp->ts_flags & TSF_DIDSPLIT) == 0) | |
| 4842 { | |
| 485 | 4843 try_compound = FALSE; |
| 625 | 4844 sp->ts_flags |= TSF_DIDSPLIT; |
| 4845 --sp->ts_curi; /* do the same NUL again */ | |
| 4846 compflags[sp->ts_complen] = NUL; | |
| 4847 } | |
| 4848 else | |
| 4849 sp->ts_flags &= ~TSF_DIDSPLIT; | |
| 4850 | |
| 4851 if (try_split || try_compound) | |
| 4852 { | |
| 534 | 4853 if (!try_compound && (!fword_ends || !goodword_ends)) |
| 485 | 4854 { |
| 4855 /* If we're going to split need to check that the | |
| 501 | 4856 * words so far are valid for compounding. If there |
| 4857 * is only one word it must not have the NEEDCOMPOUND | |
| 4858 * flag. */ | |
| 4859 if (sp->ts_complen == sp->ts_compsplit | |
| 4860 && (flags & WF_NEEDCOMP)) | |
| 4861 break; | |
| 490 | 4862 p = preword; |
| 4863 while (*skiptowhite(p) != NUL) | |
| 4864 p = skipwhite(skiptowhite(p)); | |
| 485 | 4865 if (sp->ts_complen > sp->ts_compsplit |
| 490 | 4866 && !can_compound(slang, p, |
| 485 | 4867 compflags + sp->ts_compsplit)) |
| 4868 break; | |
| 698 | 4869 |
| 4870 if (slang->sl_nosplitsugs) | |
| 4871 newscore += SCORE_SPLIT_NO; | |
| 4872 else | |
| 4873 newscore += SCORE_SPLIT; | |
| 625 | 4874 |
| 4875 /* Give a bonus to words seen before. */ | |
| 4876 newscore = score_wordcount_adj(slang, newscore, | |
| 4877 preword + sp->ts_prewordlen, TRUE); | |
| 482 | 4878 } |
| 4879 | |
| 625 | 4880 if (TRY_DEEPER(su, stack, depth, newscore)) |
| 323 | 4881 { |
| 625 | 4882 go_deeper(stack, depth, newscore); |
| 4883 #ifdef DEBUG_TRIEWALK | |
| 4884 if (!try_compound && !fword_ends) | |
| 4885 sprintf(changename[depth], "%.*s-%s: split", | |
| 4886 sp->ts_twordlen, tword, fword + sp->ts_fidx); | |
| 4887 else | |
| 4888 sprintf(changename[depth], "%.*s-%s: compound", | |
| 4889 sp->ts_twordlen, tword, fword + sp->ts_fidx); | |
| 4890 #endif | |
| 323 | 4891 /* Save things to be restored at STATE_SPLITUNDO. */ |
| 346 | 4892 sp->ts_save_badflags = su->su_badflags; |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4893 PROF_STORE(sp->ts_state) |
| 376 | 4894 sp->ts_state = STATE_SPLITUNDO; |
| 4895 | |
| 4896 ++depth; | |
| 4897 sp = &stack[depth]; | |
| 323 | 4898 |
| 482 | 4899 /* Append a space to preword when splitting. */ |
| 4900 if (!try_compound && !fword_ends) | |
| 4901 STRCAT(preword, " "); | |
| 835 | 4902 sp->ts_prewordlen = (char_u)STRLEN(preword); |
| 483 | 4903 sp->ts_splitoff = sp->ts_twordlen; |
| 492 | 4904 sp->ts_splitfidx = sp->ts_fidx; |
| 376 | 4905 |
| 4906 /* If the badword has a non-word character at this | |
| 4907 * position skip it. That means replacing the | |
| 482 | 4908 * non-word character with a space. Always skip a |
| 534 | 4909 * character when the word ends. But only when the |
| 4910 * good word can end. */ | |
| 625 | 4911 if (((!try_compound && !spell_iswordp_nmw(fword |
| 5477 | 4912 + sp->ts_fidx, |
| 4913 curwin)) | |
| 625 | 4914 || fword_ends) |
| 4915 && fword[sp->ts_fidx] != NUL | |
| 4916 && goodword_ends) | |
| 376 | 4917 { |
| 482 | 4918 int l; |
| 4919 | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
4920 l = MB_PTR2LEN(fword + sp->ts_fidx); |
| 482 | 4921 if (fword_ends) |
| 4922 { | |
| 4923 /* Copy the skipped character to preword. */ | |
| 483 | 4924 mch_memmove(preword + sp->ts_prewordlen, |
| 482 | 4925 fword + sp->ts_fidx, l); |
| 483 | 4926 sp->ts_prewordlen += l; |
| 4927 preword[sp->ts_prewordlen] = NUL; | |
| 482 | 4928 } |
| 4929 else | |
| 4930 sp->ts_score -= SCORE_SPLIT - SCORE_SUBST; | |
| 4931 sp->ts_fidx += l; | |
| 376 | 4932 } |
| 455 | 4933 |
| 485 | 4934 /* When compounding include compound flag in |
| 4935 * compflags[] (already set above). When splitting we | |
| 4936 * may start compounding over again. */ | |
| 482 | 4937 if (try_compound) |
| 483 | 4938 ++sp->ts_complen; |
| 482 | 4939 else |
| 485 | 4940 sp->ts_compsplit = sp->ts_complen; |
| 4941 sp->ts_prefixdepth = PFD_NOPREFIX; | |
| 482 | 4942 |
| 455 | 4943 /* set su->su_badflags to the caps type at this |
| 4944 * position */ | |
| 324 | 4945 #ifdef FEAT_MBYTE |
| 4946 if (has_mbyte) | |
| 455 | 4947 n = nofold_len(fword, sp->ts_fidx, su->su_badptr); |
| 324 | 4948 else |
| 4949 #endif | |
| 455 | 4950 n = sp->ts_fidx; |
| 474 | 4951 su->su_badflags = badword_captype(su->su_badptr + n, |
| 455 | 4952 su->su_badptr + su->su_badlen); |
| 323 | 4953 |
| 4954 /* Restart at top of the tree. */ | |
| 376 | 4955 sp->ts_arridx = 0; |
| 485 | 4956 |
| 4957 /* If there are postponed prefixes, try these too. */ | |
| 4958 if (pbyts != NULL) | |
| 4959 { | |
| 4960 byts = pbyts; | |
| 4961 idxs = pidxs; | |
| 4962 sp->ts_prefixdepth = PFD_PREFIXTREE; | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4963 PROF_STORE(sp->ts_state) |
| 485 | 4964 sp->ts_state = STATE_NOPREFIX; |
| 4965 } | |
| 323 | 4966 } |
| 4967 } | |
| 625 | 4968 } |
| 4969 break; | |
| 4970 | |
| 4971 case STATE_SPLITUNDO: | |
| 4972 /* Undo the changes done for word split or compound word. */ | |
| 4973 su->su_badflags = sp->ts_save_badflags; | |
| 4974 | |
| 4975 /* Continue looking for NUL bytes. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4976 PROF_STORE(sp->ts_state) |
| 625 | 4977 sp->ts_state = STATE_START; |
| 4978 | |
| 4979 /* In case we went into the prefix tree. */ | |
| 4980 byts = fbyts; | |
| 4981 idxs = fidxs; | |
| 4982 break; | |
| 4983 | |
| 4984 case STATE_ENDNUL: | |
| 4985 /* Past the NUL bytes in the node. */ | |
| 4986 su->su_badflags = sp->ts_save_badflags; | |
| 4987 if (fword[sp->ts_fidx] == NUL | |
| 4988 #ifdef FEAT_MBYTE | |
| 4989 && sp->ts_tcharlen == 0 | |
| 4990 #endif | |
| 4991 ) | |
| 4992 { | |
| 4993 /* The badword ends, can't use STATE_PLAIN. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4994 PROF_STORE(sp->ts_state) |
| 625 | 4995 sp->ts_state = STATE_DEL; |
| 323 | 4996 break; |
| 625 | 4997 } |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4998 PROF_STORE(sp->ts_state) |
| 625 | 4999 sp->ts_state = STATE_PLAIN; |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5000 /* FALLTHROUGH */ |
| 625 | 5001 |
| 5002 case STATE_PLAIN: | |
| 5003 /* | |
| 5004 * Go over all possible bytes at this node, add each to tword[] | |
| 5005 * and use child node. "ts_curi" is the index. | |
| 5006 */ | |
| 5007 arridx = sp->ts_arridx; | |
| 5008 if (sp->ts_curi > byts[arridx]) | |
| 5009 { | |
| 5010 /* Done all bytes at this node, do next state. When still at | |
| 5011 * already changed bytes skip the other tricks. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5012 PROF_STORE(sp->ts_state) |
| 625 | 5013 if (sp->ts_fidx >= sp->ts_fidxtry) |
| 323 | 5014 sp->ts_state = STATE_DEL; |
| 5015 else | |
| 625 | 5016 sp->ts_state = STATE_FINAL; |
| 5017 } | |
| 5018 else | |
| 5019 { | |
| 5020 arridx += sp->ts_curi++; | |
| 5021 c = byts[arridx]; | |
| 5022 | |
| 5023 /* Normal byte, go one level deeper. If it's not equal to the | |
| 5024 * byte in the bad word adjust the score. But don't even try | |
| 5025 * when the byte was already changed. And don't try when we | |
| 5695 | 5026 * just deleted this byte, accepting it is always cheaper than |
| 625 | 5027 * delete + substitute. */ |
| 5028 if (c == fword[sp->ts_fidx] | |
| 5029 #ifdef FEAT_MBYTE | |
| 5030 || (sp->ts_tcharlen > 0 && sp->ts_isdiff != DIFF_NONE) | |
| 5031 #endif | |
| 5032 ) | |
| 5033 newscore = 0; | |
| 5034 else | |
| 5035 newscore = SCORE_SUBST; | |
| 5036 if ((newscore == 0 | |
| 5037 || (sp->ts_fidx >= sp->ts_fidxtry | |
| 5038 && ((sp->ts_flags & TSF_DIDDEL) == 0 | |
| 5039 || c != fword[sp->ts_delidx]))) | |
| 5040 && TRY_DEEPER(su, stack, depth, newscore)) | |
| 5041 { | |
| 5042 go_deeper(stack, depth, newscore); | |
| 5043 #ifdef DEBUG_TRIEWALK | |
| 5044 if (newscore > 0) | |
| 5045 sprintf(changename[depth], "%.*s-%s: subst %c to %c", | |
| 5046 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5047 fword[sp->ts_fidx], c); | |
| 323 | 5048 else |
| 625 | 5049 sprintf(changename[depth], "%.*s-%s: accept %c", |
| 5050 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5051 fword[sp->ts_fidx]); | |
| 5052 #endif | |
| 323 | 5053 ++depth; |
| 625 | 5054 sp = &stack[depth]; |
| 5055 ++sp->ts_fidx; | |
| 5056 tword[sp->ts_twordlen++] = c; | |
| 5057 sp->ts_arridx = idxs[arridx]; | |
| 5058 #ifdef FEAT_MBYTE | |
| 5059 if (newscore == SCORE_SUBST) | |
| 5060 sp->ts_isdiff = DIFF_YES; | |
| 330 | 5061 if (has_mbyte) |
| 358 | 5062 { |
| 625 | 5063 /* Multi-byte characters are a bit complicated to |
| 5064 * handle: They differ when any of the bytes differ | |
| 5065 * and then their length may also differ. */ | |
| 5066 if (sp->ts_tcharlen == 0) | |
| 5067 { | |
| 5068 /* First byte. */ | |
| 5069 sp->ts_tcharidx = 0; | |
| 5070 sp->ts_tcharlen = MB_BYTE2LEN(c); | |
| 5071 sp->ts_fcharstart = sp->ts_fidx - 1; | |
| 5072 sp->ts_isdiff = (newscore != 0) | |
| 5073 ? DIFF_YES : DIFF_NONE; | |
| 5074 } | |
| 5075 else if (sp->ts_isdiff == DIFF_INSERT) | |
| 5076 /* When inserting trail bytes don't advance in the | |
| 5077 * bad word. */ | |
| 5078 --sp->ts_fidx; | |
| 5079 if (++sp->ts_tcharidx == sp->ts_tcharlen) | |
| 5080 { | |
| 5081 /* Last byte of character. */ | |
| 5082 if (sp->ts_isdiff == DIFF_YES) | |
| 5083 { | |
| 5084 /* Correct ts_fidx for the byte length of the | |
| 5085 * character (we didn't check that before). */ | |
| 5086 sp->ts_fidx = sp->ts_fcharstart | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5087 + MB_PTR2LEN( |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5088 fword + sp->ts_fcharstart); |
| 625 | 5089 /* For changing a composing character adjust |
| 5090 * the score from SCORE_SUBST to | |
| 5091 * SCORE_SUBCOMP. */ | |
| 5092 if (enc_utf8 | |
| 5093 && utf_iscomposing( | |
|
11269
121d29004998
patch 8.0.0520: using a function pointer while the function is known
Christian Brabandt <cb@256bit.org>
parents:
11129
diff
changeset
|
5094 utf_ptr2char(tword |
| 625 | 5095 + sp->ts_twordlen |
| 5096 - sp->ts_tcharlen)) | |
| 5097 && utf_iscomposing( | |
|
11269
121d29004998
patch 8.0.0520: using a function pointer while the function is known
Christian Brabandt <cb@256bit.org>
parents:
11129
diff
changeset
|
5098 utf_ptr2char(fword |
| 625 | 5099 + sp->ts_fcharstart))) |
| 5100 sp->ts_score -= | |
| 5101 SCORE_SUBST - SCORE_SUBCOMP; | |
| 5102 | |
| 5103 /* For a similar character adjust score from | |
| 5104 * SCORE_SUBST to SCORE_SIMILAR. */ | |
| 5105 else if (!soundfold | |
| 5106 && slang->sl_has_map | |
| 5107 && similar_chars(slang, | |
| 5108 mb_ptr2char(tword | |
| 5109 + sp->ts_twordlen | |
| 5110 - sp->ts_tcharlen), | |
| 5111 mb_ptr2char(fword | |
| 5112 + sp->ts_fcharstart))) | |
| 5113 sp->ts_score -= | |
| 5114 SCORE_SUBST - SCORE_SIMILAR; | |
| 5115 } | |
| 5116 else if (sp->ts_isdiff == DIFF_INSERT | |
| 5117 && sp->ts_twordlen > sp->ts_tcharlen) | |
| 5118 { | |
| 5119 p = tword + sp->ts_twordlen - sp->ts_tcharlen; | |
| 5120 c = mb_ptr2char(p); | |
| 5121 if (enc_utf8 && utf_iscomposing(c)) | |
| 5122 { | |
| 5123 /* Inserting a composing char doesn't | |
| 5124 * count that much. */ | |
| 5125 sp->ts_score -= SCORE_INS - SCORE_INSCOMP; | |
| 5126 } | |
| 5127 else | |
| 5128 { | |
| 5129 /* If the previous character was the same, | |
| 5130 * thus doubling a character, give a bonus | |
| 5131 * to the score. Also for the soundfold | |
| 5132 * tree (might seem illogical but does | |
| 5133 * give better scores). */ | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
5134 MB_PTR_BACK(tword, p); |
| 625 | 5135 if (c == mb_ptr2char(p)) |
| 5136 sp->ts_score -= SCORE_INS | |
| 5137 - SCORE_INSDUP; | |
| 5138 } | |
| 5139 } | |
| 5140 | |
| 5141 /* Starting a new char, reset the length. */ | |
| 5142 sp->ts_tcharlen = 0; | |
| 5143 } | |
| 358 | 5144 } |
| 330 | 5145 else |
| 5146 #endif | |
| 358 | 5147 { |
| 625 | 5148 /* If we found a similar char adjust the score. |
| 5149 * We do this after calling go_deeper() because | |
| 5150 * it's slow. */ | |
| 5151 if (newscore != 0 | |
| 5152 && !soundfold | |
| 5153 && slang->sl_has_map | |
| 5154 && similar_chars(slang, | |
| 5155 c, fword[sp->ts_fidx - 1])) | |
| 5156 sp->ts_score -= SCORE_SUBST - SCORE_SIMILAR; | |
| 358 | 5157 } |
| 625 | 5158 } |
| 5159 } | |
| 5160 break; | |
| 5161 | |
| 5162 case STATE_DEL: | |
| 5163 #ifdef FEAT_MBYTE | |
| 5164 /* When past the first byte of a multi-byte char don't try | |
| 5165 * delete/insert/swap a character. */ | |
| 5166 if (has_mbyte && sp->ts_tcharlen > 0) | |
| 5167 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5168 PROF_STORE(sp->ts_state) |
| 625 | 5169 sp->ts_state = STATE_FINAL; |
| 5170 break; | |
| 5171 } | |
| 5172 #endif | |
| 5173 /* | |
| 5174 * Try skipping one character in the bad word (delete it). | |
| 5175 */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5176 PROF_STORE(sp->ts_state) |
| 625 | 5177 sp->ts_state = STATE_INS_PREP; |
| 5178 sp->ts_curi = 1; | |
| 5179 if (soundfold && sp->ts_fidx == 0 && fword[sp->ts_fidx] == '*') | |
| 5180 /* Deleting a vowel at the start of a word counts less, see | |
| 5181 * soundalike_score(). */ | |
| 5182 newscore = 2 * SCORE_DEL / 3; | |
| 5183 else | |
| 5184 newscore = SCORE_DEL; | |
| 5185 if (fword[sp->ts_fidx] != NUL | |
| 5186 && TRY_DEEPER(su, stack, depth, newscore)) | |
| 5187 { | |
| 5188 go_deeper(stack, depth, newscore); | |
| 5189 #ifdef DEBUG_TRIEWALK | |
| 5190 sprintf(changename[depth], "%.*s-%s: delete %c", | |
| 5191 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5192 fword[sp->ts_fidx]); | |
| 5193 #endif | |
| 5194 ++depth; | |
| 5195 | |
| 5196 /* Remember what character we deleted, so that we can avoid | |
| 5197 * inserting it again. */ | |
| 5198 stack[depth].ts_flags |= TSF_DIDDEL; | |
| 5199 stack[depth].ts_delidx = sp->ts_fidx; | |
| 5200 | |
| 5201 /* Advance over the character in fword[]. Give a bonus to the | |
| 5202 * score if the same character is following "nn" -> "n". It's | |
| 5203 * a bit illogical for soundfold tree but it does give better | |
| 5204 * results. */ | |
| 5205 #ifdef FEAT_MBYTE | |
| 5206 if (has_mbyte) | |
| 5207 { | |
| 5208 c = mb_ptr2char(fword + sp->ts_fidx); | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5209 stack[depth].ts_fidx += MB_PTR2LEN(fword + sp->ts_fidx); |
| 625 | 5210 if (enc_utf8 && utf_iscomposing(c)) |
| 5211 stack[depth].ts_score -= SCORE_DEL - SCORE_DELCOMP; | |
| 5212 else if (c == mb_ptr2char(fword + stack[depth].ts_fidx)) | |
| 5213 stack[depth].ts_score -= SCORE_DEL - SCORE_DELDUP; | |
| 323 | 5214 } |
| 5215 else | |
| 625 | 5216 #endif |
| 5217 { | |
| 5218 ++stack[depth].ts_fidx; | |
| 5219 if (fword[sp->ts_fidx] == fword[sp->ts_fidx + 1]) | |
| 5220 stack[depth].ts_score -= SCORE_DEL - SCORE_DELDUP; | |
| 323 | 5221 } |
| 5222 break; | |
| 625 | 5223 } |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5224 /* FALLTHROUGH */ |
| 625 | 5225 |
| 5226 case STATE_INS_PREP: | |
| 5227 if (sp->ts_flags & TSF_DIDDEL) | |
| 5228 { | |
| 5229 /* If we just deleted a byte then inserting won't make sense, | |
| 5230 * a substitute is always cheaper. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5231 PROF_STORE(sp->ts_state) |
| 625 | 5232 sp->ts_state = STATE_SWAP; |
| 5233 break; | |
| 5234 } | |
| 5235 | |
| 5236 /* skip over NUL bytes */ | |
| 5237 n = sp->ts_arridx; | |
| 5238 for (;;) | |
| 5239 { | |
| 5240 if (sp->ts_curi > byts[n]) | |
| 5241 { | |
| 5242 /* Only NUL bytes at this node, go to next state. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5243 PROF_STORE(sp->ts_state) |
| 625 | 5244 sp->ts_state = STATE_SWAP; |
| 5245 break; | |
| 5246 } | |
| 5247 if (byts[n + sp->ts_curi] != NUL) | |
| 5248 { | |
| 5249 /* Found a byte to insert. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5250 PROF_STORE(sp->ts_state) |
| 625 | 5251 sp->ts_state = STATE_INS; |
| 330 | 5252 break; |
| 5253 } | |
| 625 | 5254 ++sp->ts_curi; |
| 5255 } | |
| 5256 break; | |
| 5257 | |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5258 /* FALLTHROUGH */ |
| 625 | 5259 |
| 5260 case STATE_INS: | |
| 5261 /* Insert one byte. Repeat this for each possible byte at this | |
| 5262 * node. */ | |
| 5263 n = sp->ts_arridx; | |
| 5264 if (sp->ts_curi > byts[n]) | |
| 5265 { | |
| 5266 /* Done all bytes at this node, go to next state. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5267 PROF_STORE(sp->ts_state) |
| 625 | 5268 sp->ts_state = STATE_SWAP; |
| 5269 break; | |
| 5270 } | |
| 5271 | |
| 5272 /* Do one more byte at this node, but: | |
| 5273 * - Skip NUL bytes. | |
| 5274 * - Skip the byte if it's equal to the byte in the word, | |
| 5275 * accepting that byte is always better. | |
| 5276 */ | |
| 5277 n += sp->ts_curi++; | |
| 5278 c = byts[n]; | |
| 5279 if (soundfold && sp->ts_twordlen == 0 && c == '*') | |
| 5280 /* Inserting a vowel at the start of a word counts less, | |
| 5281 * see soundalike_score(). */ | |
| 5282 newscore = 2 * SCORE_INS / 3; | |
| 5283 else | |
| 5284 newscore = SCORE_INS; | |
| 5285 if (c != fword[sp->ts_fidx] | |
| 5286 && TRY_DEEPER(su, stack, depth, newscore)) | |
| 5287 { | |
| 5288 go_deeper(stack, depth, newscore); | |
| 5289 #ifdef DEBUG_TRIEWALK | |
| 5290 sprintf(changename[depth], "%.*s-%s: insert %c", | |
| 5291 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5292 c); | |
| 5293 #endif | |
| 5294 ++depth; | |
| 5295 sp = &stack[depth]; | |
| 5296 tword[sp->ts_twordlen++] = c; | |
| 5297 sp->ts_arridx = idxs[n]; | |
| 330 | 5298 #ifdef FEAT_MBYTE |
| 5299 if (has_mbyte) | |
| 5300 { | |
| 625 | 5301 fl = MB_BYTE2LEN(c); |
| 5302 if (fl > 1) | |
| 330 | 5303 { |
| 625 | 5304 /* There are following bytes for the same character. |
| 5305 * We must find all bytes before trying | |
| 5306 * delete/insert/swap/etc. */ | |
| 5307 sp->ts_tcharlen = fl; | |
| 5308 sp->ts_tcharidx = 1; | |
| 5309 sp->ts_isdiff = DIFF_INSERT; | |
| 330 | 5310 } |
| 323 | 5311 } |
| 5312 else | |
| 625 | 5313 fl = 1; |
| 5314 if (fl == 1) | |
| 5315 #endif | |
| 5316 { | |
| 5317 /* If the previous character was the same, thus doubling a | |
| 5318 * character, give a bonus to the score. Also for | |
| 5319 * soundfold words (illogical but does give a better | |
| 5320 * score). */ | |
| 5321 if (sp->ts_twordlen >= 2 | |
| 5322 && tword[sp->ts_twordlen - 2] == c) | |
| 5323 sp->ts_score -= SCORE_INS - SCORE_INSDUP; | |
| 5324 } | |
| 5325 } | |
| 5326 break; | |
| 5327 | |
| 5328 case STATE_SWAP: | |
| 5329 /* | |
| 5330 * Swap two bytes in the bad word: "12" -> "21". | |
| 5331 * We change "fword" here, it's changed back afterwards at | |
| 5332 * STATE_UNSWAP. | |
| 5333 */ | |
| 5334 p = fword + sp->ts_fidx; | |
| 5335 c = *p; | |
| 5336 if (c == NUL) | |
| 5337 { | |
| 5338 /* End of word, can't swap or replace. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5339 PROF_STORE(sp->ts_state) |
| 625 | 5340 sp->ts_state = STATE_FINAL; |
| 5341 break; | |
| 5342 } | |
| 5343 | |
| 5344 /* Don't swap if the first character is not a word character. | |
| 5345 * SWAP3 etc. also don't make sense then. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5346 if (!soundfold && !spell_iswordp(p, curwin)) |
| 625 | 5347 { |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5348 PROF_STORE(sp->ts_state) |
| 625 | 5349 sp->ts_state = STATE_REP_INI; |
| 323 | 5350 break; |
| 625 | 5351 } |
| 5352 | |
| 5353 #ifdef FEAT_MBYTE | |
| 5354 if (has_mbyte) | |
| 5355 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5356 n = MB_CPTR2LEN(p); |
| 625 | 5357 c = mb_ptr2char(p); |
| 1337 | 5358 if (p[n] == NUL) |
| 5359 c2 = NUL; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5360 else if (!soundfold && !spell_iswordp(p + n, curwin)) |
| 625 | 5361 c2 = c; /* don't swap non-word char */ |
| 5362 else | |
| 5363 c2 = mb_ptr2char(p + n); | |
| 5364 } | |
| 5365 else | |
| 5366 #endif | |
| 5367 { | |
| 1337 | 5368 if (p[1] == NUL) |
| 5369 c2 = NUL; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5370 else if (!soundfold && !spell_iswordp(p + 1, curwin)) |
| 625 | 5371 c2 = c; /* don't swap non-word char */ |
| 5372 else | |
| 5373 c2 = p[1]; | |
| 5374 } | |
| 5375 | |
| 1337 | 5376 /* When the second character is NUL we can't swap. */ |
| 5377 if (c2 == NUL) | |
| 5378 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5379 PROF_STORE(sp->ts_state) |
| 1337 | 5380 sp->ts_state = STATE_REP_INI; |
| 5381 break; | |
| 5382 } | |
| 5383 | |
| 625 | 5384 /* When characters are identical, swap won't do anything. |
| 5385 * Also get here if the second char is not a word character. */ | |
| 5386 if (c == c2) | |
| 5387 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5388 PROF_STORE(sp->ts_state) |
| 625 | 5389 sp->ts_state = STATE_SWAP3; |
| 5390 break; | |
| 5391 } | |
| 5392 if (c2 != NUL && TRY_DEEPER(su, stack, depth, SCORE_SWAP)) | |
| 5393 { | |
| 5394 go_deeper(stack, depth, SCORE_SWAP); | |
| 5395 #ifdef DEBUG_TRIEWALK | |
| 5396 sprintf(changename[depth], "%.*s-%s: swap %c and %c", | |
| 5397 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5398 c, c2); | |
| 5399 #endif | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5400 PROF_STORE(sp->ts_state) |
| 625 | 5401 sp->ts_state = STATE_UNSWAP; |
| 5402 ++depth; | |
| 330 | 5403 #ifdef FEAT_MBYTE |
| 5404 if (has_mbyte) | |
| 5405 { | |
| 625 | 5406 fl = mb_char2len(c2); |
| 5407 mch_memmove(p, p + n, fl); | |
| 5408 mb_char2bytes(c, p + fl); | |
| 5409 stack[depth].ts_fidxtry = sp->ts_fidx + n + fl; | |
| 330 | 5410 } |
| 5411 else | |
| 5412 #endif | |
| 5413 { | |
| 625 | 5414 p[0] = c2; |
| 330 | 5415 p[1] = c; |
| 625 | 5416 stack[depth].ts_fidxtry = sp->ts_fidx + 2; |
| 5417 } | |
| 5418 } | |
| 5419 else | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5420 { |
| 625 | 5421 /* If this swap doesn't work then SWAP3 won't either. */ |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5422 PROF_STORE(sp->ts_state) |
| 625 | 5423 sp->ts_state = STATE_REP_INI; |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5424 } |
| 625 | 5425 break; |
| 5426 | |
| 5427 case STATE_UNSWAP: | |
| 5428 /* Undo the STATE_SWAP swap: "21" -> "12". */ | |
| 5429 p = fword + sp->ts_fidx; | |
| 5430 #ifdef FEAT_MBYTE | |
| 5431 if (has_mbyte) | |
| 5432 { | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5433 n = MB_PTR2LEN(p); |
| 625 | 5434 c = mb_ptr2char(p + n); |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5435 mch_memmove(p + MB_PTR2LEN(p + n), p, n); |
| 625 | 5436 mb_char2bytes(c, p); |
| 5437 } | |
| 5438 else | |
| 5439 #endif | |
| 5440 { | |
| 5441 c = *p; | |
| 5442 *p = p[1]; | |
| 5443 p[1] = c; | |
| 5444 } | |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5445 /* FALLTHROUGH */ |
| 625 | 5446 |
| 5447 case STATE_SWAP3: | |
| 5448 /* Swap two bytes, skipping one: "123" -> "321". We change | |
| 5449 * "fword" here, it's changed back afterwards at STATE_UNSWAP3. */ | |
| 5450 p = fword + sp->ts_fidx; | |
| 5451 #ifdef FEAT_MBYTE | |
| 5452 if (has_mbyte) | |
| 5453 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5454 n = MB_CPTR2LEN(p); |
| 625 | 5455 c = mb_ptr2char(p); |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5456 fl = MB_CPTR2LEN(p + n); |
| 625 | 5457 c2 = mb_ptr2char(p + n); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5458 if (!soundfold && !spell_iswordp(p + n + fl, curwin)) |
| 625 | 5459 c3 = c; /* don't swap non-word char */ |
| 5460 else | |
| 5461 c3 = mb_ptr2char(p + n + fl); | |
| 5462 } | |
| 5463 else | |
| 5464 #endif | |
| 5465 { | |
| 5466 c = *p; | |
| 5467 c2 = p[1]; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5468 if (!soundfold && !spell_iswordp(p + 2, curwin)) |
| 625 | 5469 c3 = c; /* don't swap non-word char */ |
| 5470 else | |
| 5471 c3 = p[2]; | |
| 5472 } | |
| 5473 | |
| 5474 /* When characters are identical: "121" then SWAP3 result is | |
| 5475 * identical, ROT3L result is same as SWAP: "211", ROT3L result is | |
| 5476 * same as SWAP on next char: "112". Thus skip all swapping. | |
| 5477 * Also skip when c3 is NUL. | |
| 5478 * Also get here when the third character is not a word character. | |
| 5479 * Second character may any char: "a.b" -> "b.a" */ | |
| 5480 if (c == c3 || c3 == NUL) | |
| 5481 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5482 PROF_STORE(sp->ts_state) |
| 625 | 5483 sp->ts_state = STATE_REP_INI; |
| 5484 break; | |
| 5485 } | |
| 5486 if (TRY_DEEPER(su, stack, depth, SCORE_SWAP3)) | |
| 5487 { | |
| 5488 go_deeper(stack, depth, SCORE_SWAP3); | |
| 5489 #ifdef DEBUG_TRIEWALK | |
| 5490 sprintf(changename[depth], "%.*s-%s: swap3 %c and %c", | |
| 5491 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5492 c, c3); | |
| 5493 #endif | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5494 PROF_STORE(sp->ts_state) |
| 625 | 5495 sp->ts_state = STATE_UNSWAP3; |
| 5496 ++depth; | |
| 5497 #ifdef FEAT_MBYTE | |
| 5498 if (has_mbyte) | |
| 5499 { | |
| 5500 tl = mb_char2len(c3); | |
| 5501 mch_memmove(p, p + n + fl, tl); | |
| 5502 mb_char2bytes(c2, p + tl); | |
| 5503 mb_char2bytes(c, p + fl + tl); | |
| 5504 stack[depth].ts_fidxtry = sp->ts_fidx + n + fl + tl; | |
| 5505 } | |
| 5506 else | |
| 5507 #endif | |
| 5508 { | |
| 5509 p[0] = p[2]; | |
| 5510 p[2] = c; | |
| 5511 stack[depth].ts_fidxtry = sp->ts_fidx + 3; | |
| 5512 } | |
| 5513 } | |
| 5514 else | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5515 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5516 PROF_STORE(sp->ts_state) |
| 625 | 5517 sp->ts_state = STATE_REP_INI; |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5518 } |
| 625 | 5519 break; |
| 5520 | |
| 5521 case STATE_UNSWAP3: | |
| 5522 /* Undo STATE_SWAP3: "321" -> "123" */ | |
| 5523 p = fword + sp->ts_fidx; | |
| 5524 #ifdef FEAT_MBYTE | |
| 5525 if (has_mbyte) | |
| 5526 { | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5527 n = MB_PTR2LEN(p); |
| 625 | 5528 c2 = mb_ptr2char(p + n); |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5529 fl = MB_PTR2LEN(p + n); |
| 625 | 5530 c = mb_ptr2char(p + n + fl); |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5531 tl = MB_PTR2LEN(p + n + fl); |
| 625 | 5532 mch_memmove(p + fl + tl, p, n); |
| 5533 mb_char2bytes(c, p); | |
| 5534 mb_char2bytes(c2, p + tl); | |
| 5535 p = p + tl; | |
| 5536 } | |
| 5537 else | |
| 5538 #endif | |
| 5539 { | |
| 5540 c = *p; | |
| 5541 *p = p[2]; | |
| 5542 p[2] = c; | |
| 5543 ++p; | |
| 5544 } | |
| 5545 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5546 if (!soundfold && !spell_iswordp(p, curwin)) |
| 625 | 5547 { |
| 5548 /* Middle char is not a word char, skip the rotate. First and | |
| 5549 * third char were already checked at swap and swap3. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5550 PROF_STORE(sp->ts_state) |
| 625 | 5551 sp->ts_state = STATE_REP_INI; |
| 5552 break; | |
| 5553 } | |
| 5554 | |
| 5555 /* Rotate three characters left: "123" -> "231". We change | |
| 5556 * "fword" here, it's changed back afterwards at STATE_UNROT3L. */ | |
| 5557 if (TRY_DEEPER(su, stack, depth, SCORE_SWAP3)) | |
| 5558 { | |
| 5559 go_deeper(stack, depth, SCORE_SWAP3); | |
| 5560 #ifdef DEBUG_TRIEWALK | |
| 5561 p = fword + sp->ts_fidx; | |
| 5562 sprintf(changename[depth], "%.*s-%s: rotate left %c%c%c", | |
| 5563 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5564 p[0], p[1], p[2]); | |
| 5565 #endif | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5566 PROF_STORE(sp->ts_state) |
| 625 | 5567 sp->ts_state = STATE_UNROT3L; |
| 5568 ++depth; | |
| 330 | 5569 p = fword + sp->ts_fidx; |
| 5570 #ifdef FEAT_MBYTE | |
| 5571 if (has_mbyte) | |
| 5572 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5573 n = MB_CPTR2LEN(p); |
| 330 | 5574 c = mb_ptr2char(p); |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5575 fl = MB_CPTR2LEN(p + n); |
|
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5576 fl += MB_CPTR2LEN(p + n + fl); |
| 625 | 5577 mch_memmove(p, p + n, fl); |
| 5578 mb_char2bytes(c, p + fl); | |
| 5579 stack[depth].ts_fidxtry = sp->ts_fidx + n + fl; | |
| 330 | 5580 } |
| 5581 else | |
| 5582 #endif | |
| 323 | 5583 { |
| 330 | 5584 c = *p; |
| 625 | 5585 *p = p[1]; |
| 5586 p[1] = p[2]; | |
| 5587 p[2] = c; | |
| 5588 stack[depth].ts_fidxtry = sp->ts_fidx + 3; | |
| 5589 } | |
| 5590 } | |
| 5591 else | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5592 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5593 PROF_STORE(sp->ts_state) |
| 625 | 5594 sp->ts_state = STATE_REP_INI; |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5595 } |
| 625 | 5596 break; |
| 5597 | |
| 5598 case STATE_UNROT3L: | |
| 5599 /* Undo ROT3L: "231" -> "123" */ | |
| 5600 p = fword + sp->ts_fidx; | |
| 5601 #ifdef FEAT_MBYTE | |
| 5602 if (has_mbyte) | |
| 5603 { | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5604 n = MB_PTR2LEN(p); |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5605 n += MB_PTR2LEN(p + n); |
| 625 | 5606 c = mb_ptr2char(p + n); |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5607 tl = MB_PTR2LEN(p + n); |
| 625 | 5608 mch_memmove(p + tl, p, n); |
| 5609 mb_char2bytes(c, p); | |
| 5610 } | |
| 5611 else | |
| 5612 #endif | |
| 5613 { | |
| 5614 c = p[2]; | |
| 5615 p[2] = p[1]; | |
| 5616 p[1] = *p; | |
| 5617 *p = c; | |
| 5618 } | |
| 5619 | |
| 5620 /* Rotate three bytes right: "123" -> "312". We change "fword" | |
| 5621 * here, it's changed back afterwards at STATE_UNROT3R. */ | |
| 5622 if (TRY_DEEPER(su, stack, depth, SCORE_SWAP3)) | |
| 5623 { | |
| 5624 go_deeper(stack, depth, SCORE_SWAP3); | |
| 5625 #ifdef DEBUG_TRIEWALK | |
| 5626 p = fword + sp->ts_fidx; | |
| 5627 sprintf(changename[depth], "%.*s-%s: rotate right %c%c%c", | |
| 5628 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5629 p[0], p[1], p[2]); | |
| 5630 #endif | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5631 PROF_STORE(sp->ts_state) |
| 625 | 5632 sp->ts_state = STATE_UNROT3R; |
| 5633 ++depth; | |
| 330 | 5634 p = fword + sp->ts_fidx; |
| 5635 #ifdef FEAT_MBYTE | |
| 5636 if (has_mbyte) | |
| 5637 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5638 n = MB_CPTR2LEN(p); |
|
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5639 n += MB_CPTR2LEN(p + n); |
| 330 | 5640 c = mb_ptr2char(p + n); |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5641 tl = MB_CPTR2LEN(p + n); |
| 330 | 5642 mch_memmove(p + tl, p, n); |
| 5643 mb_char2bytes(c, p); | |
| 625 | 5644 stack[depth].ts_fidxtry = sp->ts_fidx + n + tl; |
| 330 | 5645 } |
| 5646 else | |
| 5647 #endif | |
| 5648 { | |
| 5649 c = p[2]; | |
| 5650 p[2] = p[1]; | |
| 5651 p[1] = *p; | |
| 5652 *p = c; | |
| 625 | 5653 stack[depth].ts_fidxtry = sp->ts_fidx + 3; |
| 5654 } | |
| 5655 } | |
| 5656 else | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5657 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5658 PROF_STORE(sp->ts_state) |
| 625 | 5659 sp->ts_state = STATE_REP_INI; |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5660 } |
| 625 | 5661 break; |
| 5662 | |
| 5663 case STATE_UNROT3R: | |
| 5664 /* Undo ROT3R: "312" -> "123" */ | |
| 5665 p = fword + sp->ts_fidx; | |
| 5666 #ifdef FEAT_MBYTE | |
| 5667 if (has_mbyte) | |
| 5668 { | |
| 5669 c = mb_ptr2char(p); | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5670 tl = MB_PTR2LEN(p); |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5671 n = MB_PTR2LEN(p + tl); |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5672 n += MB_PTR2LEN(p + tl + n); |
| 625 | 5673 mch_memmove(p, p + tl, n); |
| 5674 mb_char2bytes(c, p + n); | |
| 5675 } | |
| 5676 else | |
| 5677 #endif | |
| 5678 { | |
| 5679 c = *p; | |
| 5680 *p = p[1]; | |
| 5681 p[1] = p[2]; | |
| 5682 p[2] = c; | |
| 5683 } | |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5684 /* FALLTHROUGH */ |
| 625 | 5685 |
| 5686 case STATE_REP_INI: | |
| 5687 /* Check if matching with REP items from the .aff file would work. | |
| 5688 * Quickly skip if: | |
| 5689 * - there are no REP items and we are not in the soundfold trie | |
| 5690 * - the score is going to be too high anyway | |
| 5691 * - already applied a REP item or swapped here */ | |
| 5692 if ((lp->lp_replang == NULL && !soundfold) | |
| 5693 || sp->ts_score + SCORE_REP >= su->su_maxscore | |
| 5694 || sp->ts_fidx < sp->ts_fidxtry) | |
| 5695 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5696 PROF_STORE(sp->ts_state) |
| 625 | 5697 sp->ts_state = STATE_FINAL; |
| 323 | 5698 break; |
| 625 | 5699 } |
| 5700 | |
| 5701 /* Use the first byte to quickly find the first entry that may | |
| 5702 * match. If the index is -1 there is none. */ | |
| 5703 if (soundfold) | |
| 5704 sp->ts_curi = slang->sl_repsal_first[fword[sp->ts_fidx]]; | |
| 5705 else | |
| 5706 sp->ts_curi = lp->lp_replang->sl_rep_first[fword[sp->ts_fidx]]; | |
| 5707 | |
| 5708 if (sp->ts_curi < 0) | |
| 5709 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5710 PROF_STORE(sp->ts_state) |
| 625 | 5711 sp->ts_state = STATE_FINAL; |
| 5712 break; | |
| 5713 } | |
| 5714 | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5715 PROF_STORE(sp->ts_state) |
| 625 | 5716 sp->ts_state = STATE_REP; |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5717 /* FALLTHROUGH */ |
| 625 | 5718 |
| 5719 case STATE_REP: | |
| 5720 /* Try matching with REP items from the .aff file. For each match | |
| 5721 * replace the characters and check if the resulting word is | |
| 5722 * valid. */ | |
| 5723 p = fword + sp->ts_fidx; | |
| 5724 | |
| 5725 if (soundfold) | |
| 5726 gap = &slang->sl_repsal; | |
| 5727 else | |
| 503 | 5728 gap = &lp->lp_replang->sl_rep; |
| 625 | 5729 while (sp->ts_curi < gap->ga_len) |
| 5730 { | |
| 5731 ftp = (fromto_T *)gap->ga_data + sp->ts_curi++; | |
| 5732 if (*ftp->ft_from != *p) | |
| 5733 { | |
| 5734 /* past possible matching entries */ | |
| 5735 sp->ts_curi = gap->ga_len; | |
| 323 | 5736 break; |
| 5737 } | |
| 625 | 5738 if (STRNCMP(ftp->ft_from, p, STRLEN(ftp->ft_from)) == 0 |
| 5739 && TRY_DEEPER(su, stack, depth, SCORE_REP)) | |
| 5740 { | |
| 5741 go_deeper(stack, depth, SCORE_REP); | |
| 5742 #ifdef DEBUG_TRIEWALK | |
| 5743 sprintf(changename[depth], "%.*s-%s: replace %s with %s", | |
| 5744 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5745 ftp->ft_from, ftp->ft_to); | |
| 5746 #endif | |
| 5747 /* Need to undo this afterwards. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5748 PROF_STORE(sp->ts_state) |
| 625 | 5749 sp->ts_state = STATE_REP_UNDO; |
| 5750 | |
| 5751 /* Change the "from" to the "to" string. */ | |
| 5752 ++depth; | |
| 835 | 5753 fl = (int)STRLEN(ftp->ft_from); |
| 5754 tl = (int)STRLEN(ftp->ft_to); | |
| 625 | 5755 if (fl != tl) |
| 323 | 5756 { |
| 1619 | 5757 STRMOVE(p + tl, p + fl); |
| 625 | 5758 repextra += tl - fl; |
| 323 | 5759 } |
| 625 | 5760 mch_memmove(p, ftp->ft_to, tl); |
| 5761 stack[depth].ts_fidxtry = sp->ts_fidx + tl; | |
| 5762 #ifdef FEAT_MBYTE | |
| 5763 stack[depth].ts_tcharlen = 0; | |
| 5764 #endif | |
| 5765 break; | |
| 5766 } | |
| 5767 } | |
| 5768 | |
| 5769 if (sp->ts_curi >= gap->ga_len && sp->ts_state == STATE_REP) | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5770 { |
| 625 | 5771 /* No (more) matches. */ |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5772 PROF_STORE(sp->ts_state) |
| 625 | 5773 sp->ts_state = STATE_FINAL; |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5774 } |
| 625 | 5775 |
| 5776 break; | |
| 5777 | |
| 5778 case STATE_REP_UNDO: | |
| 5779 /* Undo a REP replacement and continue with the next one. */ | |
| 5780 if (soundfold) | |
| 5781 gap = &slang->sl_repsal; | |
| 5782 else | |
| 5783 gap = &lp->lp_replang->sl_rep; | |
| 5784 ftp = (fromto_T *)gap->ga_data + sp->ts_curi - 1; | |
| 835 | 5785 fl = (int)STRLEN(ftp->ft_from); |
| 5786 tl = (int)STRLEN(ftp->ft_to); | |
| 625 | 5787 p = fword + sp->ts_fidx; |
| 5788 if (fl != tl) | |
| 5789 { | |
| 1619 | 5790 STRMOVE(p + fl, p + tl); |
| 625 | 5791 repextra -= tl - fl; |
| 5792 } | |
| 5793 mch_memmove(p, ftp->ft_from, fl); | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5794 PROF_STORE(sp->ts_state) |
| 625 | 5795 sp->ts_state = STATE_REP; |
| 5796 break; | |
| 5797 | |
| 5798 default: | |
| 5799 /* Did all possible states at this level, go up one level. */ | |
| 5800 --depth; | |
| 5801 | |
| 5802 if (depth >= 0 && stack[depth].ts_prefixdepth == PFD_PREFIXTREE) | |
| 5803 { | |
| 5804 /* Continue in or go back to the prefix tree. */ | |
| 5805 byts = pbyts; | |
| 5806 idxs = pidxs; | |
| 5807 } | |
| 5808 | |
| 5809 /* Don't check for CTRL-C too often, it takes time. */ | |
| 5810 if (--breakcheckcount == 0) | |
| 5811 { | |
| 5812 ui_breakcheck(); | |
| 5813 breakcheckcount = 1000; | |
| 5814 } | |
| 5815 } | |
| 5816 } | |
| 5817 } | |
| 5818 | |
| 5819 | |
| 5820 /* | |
| 5821 * Go one level deeper in the tree. | |
| 5822 */ | |
| 5823 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
5824 go_deeper(trystate_T *stack, int depth, int score_add) |
| 323 | 5825 { |
| 330 | 5826 stack[depth + 1] = stack[depth]; |
| 323 | 5827 stack[depth + 1].ts_state = STATE_START; |
| 625 | 5828 stack[depth + 1].ts_score = stack[depth].ts_score + score_add; |
| 323 | 5829 stack[depth + 1].ts_curi = 1; /* start just after length byte */ |
| 485 | 5830 stack[depth + 1].ts_flags = 0; |
| 323 | 5831 } |
| 5832 | |
| 455 | 5833 #ifdef FEAT_MBYTE |
| 5834 /* | |
| 5835 * Case-folding may change the number of bytes: Count nr of chars in | |
| 5836 * fword[flen] and return the byte length of that many chars in "word". | |
| 5837 */ | |
| 5838 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
5839 nofold_len(char_u *fword, int flen, char_u *word) |
| 455 | 5840 { |
| 5841 char_u *p; | |
| 5842 int i = 0; | |
| 5843 | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
5844 for (p = fword; p < fword + flen; MB_PTR_ADV(p)) |
| 455 | 5845 ++i; |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
5846 for (p = word; i > 0; MB_PTR_ADV(p)) |
| 455 | 5847 --i; |
| 5848 return (int)(p - word); | |
| 5849 } | |
| 5850 #endif | |
| 5851 | |
| 323 | 5852 /* |
| 5853 * "fword" is a good word with case folded. Find the matching keep-case | |
| 5854 * words and put it in "kword". | |
| 5855 * Theoretically there could be several keep-case words that result in the | |
| 5856 * same case-folded word, but we only find one... | |
| 5857 */ | |
| 5858 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
5859 find_keepcap_word(slang_T *slang, char_u *fword, char_u *kword) |
| 323 | 5860 { |
| 5861 char_u uword[MAXWLEN]; /* "fword" in upper-case */ | |
| 5862 int depth; | |
| 324 | 5863 idx_T tryidx; |
| 323 | 5864 |
| 5865 /* The following arrays are used at each depth in the tree. */ | |
| 324 | 5866 idx_T arridx[MAXWLEN]; |
| 323 | 5867 int round[MAXWLEN]; |
| 5868 int fwordidx[MAXWLEN]; | |
| 5869 int uwordidx[MAXWLEN]; | |
| 5870 int kwordlen[MAXWLEN]; | |
| 5871 | |
| 5872 int flen, ulen; | |
| 5873 int l; | |
| 5874 int len; | |
| 5875 int c; | |
| 324 | 5876 idx_T lo, hi, m; |
| 323 | 5877 char_u *p; |
| 5878 char_u *byts = slang->sl_kbyts; /* array with bytes of the words */ | |
| 324 | 5879 idx_T *idxs = slang->sl_kidxs; /* array with indexes */ |
| 323 | 5880 |
| 5881 if (byts == NULL) | |
| 5882 { | |
| 5883 /* array is empty: "cannot happen" */ | |
| 5884 *kword = NUL; | |
| 5885 return; | |
| 5886 } | |
| 5887 | |
| 5888 /* Make an all-cap version of "fword". */ | |
| 5889 allcap_copy(fword, uword); | |
| 5890 | |
| 5891 /* | |
| 5892 * Each character needs to be tried both case-folded and upper-case. | |
| 5893 * All this gets very complicated if we keep in mind that changing case | |
| 5894 * may change the byte length of a multi-byte character... | |
| 5895 */ | |
| 5896 depth = 0; | |
| 5897 arridx[0] = 0; | |
| 5898 round[0] = 0; | |
| 5899 fwordidx[0] = 0; | |
| 5900 uwordidx[0] = 0; | |
| 5901 kwordlen[0] = 0; | |
| 5902 while (depth >= 0) | |
| 5903 { | |
| 5904 if (fword[fwordidx[depth]] == NUL) | |
| 5905 { | |
| 5906 /* We are at the end of "fword". If the tree allows a word to end | |
| 5907 * here we have found a match. */ | |
| 5908 if (byts[arridx[depth] + 1] == 0) | |
| 5909 { | |
| 5910 kword[kwordlen[depth]] = NUL; | |
| 5911 return; | |
| 5912 } | |
| 5913 | |
| 5914 /* kword is getting too long, continue one level up */ | |
| 5915 --depth; | |
| 5916 } | |
| 5917 else if (++round[depth] > 2) | |
| 5918 { | |
| 5919 /* tried both fold-case and upper-case character, continue one | |
| 5920 * level up */ | |
| 5921 --depth; | |
| 5922 } | |
| 5923 else | |
| 5924 { | |
| 5925 /* | |
| 5926 * round[depth] == 1: Try using the folded-case character. | |
| 5927 * round[depth] == 2: Try using the upper-case character. | |
| 5928 */ | |
| 5929 #ifdef FEAT_MBYTE | |
| 5930 if (has_mbyte) | |
| 5931 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5932 flen = MB_CPTR2LEN(fword + fwordidx[depth]); |
|
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5933 ulen = MB_CPTR2LEN(uword + uwordidx[depth]); |
| 323 | 5934 } |
| 5935 else | |
| 5936 #endif | |
| 5937 ulen = flen = 1; | |
| 5938 if (round[depth] == 1) | |
| 5939 { | |
| 5940 p = fword + fwordidx[depth]; | |
| 5941 l = flen; | |
| 5942 } | |
| 5943 else | |
| 5944 { | |
| 5945 p = uword + uwordidx[depth]; | |
| 5946 l = ulen; | |
| 5947 } | |
| 5948 | |
| 5949 for (tryidx = arridx[depth]; l > 0; --l) | |
| 5950 { | |
| 5951 /* Perform a binary search in the list of accepted bytes. */ | |
| 5952 len = byts[tryidx++]; | |
| 5953 c = *p++; | |
| 5954 lo = tryidx; | |
| 5955 hi = tryidx + len - 1; | |
| 5956 while (lo < hi) | |
| 5957 { | |
| 5958 m = (lo + hi) / 2; | |
| 5959 if (byts[m] > c) | |
| 5960 hi = m - 1; | |
| 5961 else if (byts[m] < c) | |
| 5962 lo = m + 1; | |
| 5963 else | |
| 5964 { | |
| 5965 lo = hi = m; | |
| 5966 break; | |
| 5967 } | |
| 5968 } | |
| 5969 | |
| 5970 /* Stop if there is no matching byte. */ | |
| 5971 if (hi < lo || byts[lo] != c) | |
| 5972 break; | |
| 5973 | |
| 5974 /* Continue at the child (if there is one). */ | |
| 5975 tryidx = idxs[lo]; | |
| 5976 } | |
| 5977 | |
| 5978 if (l == 0) | |
| 5979 { | |
| 5980 /* | |
| 5981 * Found the matching char. Copy it to "kword" and go a | |
| 5982 * level deeper. | |
| 5983 */ | |
| 5984 if (round[depth] == 1) | |
| 5985 { | |
| 5986 STRNCPY(kword + kwordlen[depth], fword + fwordidx[depth], | |
| 5987 flen); | |
| 5988 kwordlen[depth + 1] = kwordlen[depth] + flen; | |
| 5989 } | |
| 5990 else | |
| 5991 { | |
| 5992 STRNCPY(kword + kwordlen[depth], uword + uwordidx[depth], | |
| 5993 ulen); | |
| 5994 kwordlen[depth + 1] = kwordlen[depth] + ulen; | |
| 5995 } | |
| 5996 fwordidx[depth + 1] = fwordidx[depth] + flen; | |
| 5997 uwordidx[depth + 1] = uwordidx[depth] + ulen; | |
| 5998 | |
| 5999 ++depth; | |
| 6000 arridx[depth] = tryidx; | |
| 6001 round[depth] = 0; | |
| 6002 } | |
| 6003 } | |
| 6004 } | |
| 6005 | |
| 6006 /* Didn't find it: "cannot happen". */ | |
| 6007 *kword = NUL; | |
| 6008 } | |
| 6009 | |
| 6010 /* | |
| 344 | 6011 * Compute the sound-a-like score for suggestions in su->su_ga and add them to |
| 6012 * su->su_sga. | |
| 6013 */ | |
| 6014 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6015 score_comp_sal(suginfo_T *su) |
| 344 | 6016 { |
| 6017 langp_T *lp; | |
| 6018 char_u badsound[MAXWLEN]; | |
| 6019 int i; | |
| 6020 suggest_T *stp; | |
| 6021 suggest_T *sstp; | |
| 6022 int score; | |
| 500 | 6023 int lpi; |
| 344 | 6024 |
| 6025 if (ga_grow(&su->su_sga, su->su_ga.ga_len) == FAIL) | |
| 6026 return; | |
| 6027 | |
| 6028 /* Use the sound-folding of the first language that supports it. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6029 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6030 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6031 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 344 | 6032 if (lp->lp_slang->sl_sal.ga_len > 0) |
| 6033 { | |
| 6034 /* soundfold the bad word */ | |
| 375 | 6035 spell_soundfold(lp->lp_slang, su->su_fbadword, TRUE, badsound); |
| 344 | 6036 |
| 6037 for (i = 0; i < su->su_ga.ga_len; ++i) | |
| 6038 { | |
| 6039 stp = &SUG(su->su_ga, i); | |
| 6040 | |
| 351 | 6041 /* Case-fold the suggested word, sound-fold it and compute the |
| 6042 * sound-a-like score. */ | |
| 6043 score = stp_sal_score(stp, su, lp->lp_slang, badsound); | |
| 344 | 6044 if (score < SCORE_MAXMAX) |
| 6045 { | |
| 6046 /* Add the suggestion. */ | |
| 6047 sstp = &SUG(su->su_sga, su->su_sga.ga_len); | |
| 6048 sstp->st_word = vim_strsave(stp->st_word); | |
| 6049 if (sstp->st_word != NULL) | |
| 6050 { | |
| 625 | 6051 sstp->st_wordlen = stp->st_wordlen; |
| 344 | 6052 sstp->st_score = score; |
| 6053 sstp->st_altscore = 0; | |
| 6054 sstp->st_orglen = stp->st_orglen; | |
| 6055 ++su->su_sga.ga_len; | |
| 6056 } | |
| 6057 } | |
| 6058 } | |
| 6059 break; | |
| 6060 } | |
| 500 | 6061 } |
| 344 | 6062 } |
| 6063 | |
| 6064 /* | |
| 6065 * Combine the list of suggestions in su->su_ga and su->su_sga. | |
| 4352 | 6066 * They are entwined. |
| 344 | 6067 */ |
| 6068 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6069 score_combine(suginfo_T *su) |
| 344 | 6070 { |
| 6071 int i; | |
| 6072 int j; | |
| 6073 garray_T ga; | |
| 6074 garray_T *gap; | |
| 6075 langp_T *lp; | |
| 6076 suggest_T *stp; | |
| 6077 char_u *p; | |
| 6078 char_u badsound[MAXWLEN]; | |
| 6079 int round; | |
| 500 | 6080 int lpi; |
| 625 | 6081 slang_T *slang = NULL; |
| 344 | 6082 |
| 6083 /* Add the alternate score to su_ga. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6084 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6085 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6086 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 344 | 6087 if (lp->lp_slang->sl_sal.ga_len > 0) |
| 6088 { | |
| 6089 /* soundfold the bad word */ | |
| 625 | 6090 slang = lp->lp_slang; |
| 6091 spell_soundfold(slang, su->su_fbadword, TRUE, badsound); | |
| 344 | 6092 |
| 6093 for (i = 0; i < su->su_ga.ga_len; ++i) | |
| 6094 { | |
| 6095 stp = &SUG(su->su_ga, i); | |
| 625 | 6096 stp->st_altscore = stp_sal_score(stp, su, slang, badsound); |
| 344 | 6097 if (stp->st_altscore == SCORE_MAXMAX) |
| 6098 stp->st_score = (stp->st_score * 3 + SCORE_BIG) / 4; | |
| 6099 else | |
| 6100 stp->st_score = (stp->st_score * 3 | |
| 6101 + stp->st_altscore) / 4; | |
| 6102 stp->st_salscore = FALSE; | |
| 6103 } | |
| 6104 break; | |
| 6105 } | |
| 6106 } | |
| 6107 | |
| 844 | 6108 if (slang == NULL) /* Using "double" without sound folding. */ |
| 6109 { | |
| 6110 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, | |
| 6111 su->su_maxcount); | |
| 625 | 6112 return; |
| 844 | 6113 } |
| 625 | 6114 |
| 344 | 6115 /* Add the alternate score to su_sga. */ |
| 6116 for (i = 0; i < su->su_sga.ga_len; ++i) | |
| 6117 { | |
| 6118 stp = &SUG(su->su_sga, i); | |
| 625 | 6119 stp->st_altscore = spell_edit_score(slang, |
| 6120 su->su_badword, stp->st_word); | |
| 344 | 6121 if (stp->st_score == SCORE_MAXMAX) |
| 6122 stp->st_score = (SCORE_BIG * 7 + stp->st_altscore) / 8; | |
| 6123 else | |
| 6124 stp->st_score = (stp->st_score * 7 + stp->st_altscore) / 8; | |
| 6125 stp->st_salscore = TRUE; | |
| 6126 } | |
| 6127 | |
| 625 | 6128 /* Remove bad suggestions, sort the suggestions and truncate at "maxcount" |
| 6129 * for both lists. */ | |
| 6130 check_suggestions(su, &su->su_ga); | |
| 344 | 6131 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, su->su_maxcount); |
| 625 | 6132 check_suggestions(su, &su->su_sga); |
| 344 | 6133 (void)cleanup_suggestions(&su->su_sga, su->su_maxscore, su->su_maxcount); |
| 6134 | |
| 6135 ga_init2(&ga, (int)sizeof(suginfo_T), 1); | |
| 6136 if (ga_grow(&ga, su->su_ga.ga_len + su->su_sga.ga_len) == FAIL) | |
| 6137 return; | |
| 6138 | |
| 6139 stp = &SUG(ga, 0); | |
| 6140 for (i = 0; i < su->su_ga.ga_len || i < su->su_sga.ga_len; ++i) | |
| 6141 { | |
| 6142 /* round 1: get a suggestion from su_ga | |
| 6143 * round 2: get a suggestion from su_sga */ | |
| 6144 for (round = 1; round <= 2; ++round) | |
| 6145 { | |
| 6146 gap = round == 1 ? &su->su_ga : &su->su_sga; | |
| 6147 if (i < gap->ga_len) | |
| 6148 { | |
| 6149 /* Don't add a word if it's already there. */ | |
| 6150 p = SUG(*gap, i).st_word; | |
| 6151 for (j = 0; j < ga.ga_len; ++j) | |
| 6152 if (STRCMP(stp[j].st_word, p) == 0) | |
| 6153 break; | |
| 6154 if (j == ga.ga_len) | |
| 6155 stp[ga.ga_len++] = SUG(*gap, i); | |
| 6156 else | |
| 6157 vim_free(p); | |
| 6158 } | |
| 6159 } | |
| 6160 } | |
| 6161 | |
| 6162 ga_clear(&su->su_ga); | |
| 6163 ga_clear(&su->su_sga); | |
| 6164 | |
| 6165 /* Truncate the list to the number of suggestions that will be displayed. */ | |
| 6166 if (ga.ga_len > su->su_maxcount) | |
| 6167 { | |
| 6168 for (i = su->su_maxcount; i < ga.ga_len; ++i) | |
| 6169 vim_free(stp[i].st_word); | |
| 6170 ga.ga_len = su->su_maxcount; | |
| 6171 } | |
| 6172 | |
| 6173 su->su_ga = ga; | |
| 6174 } | |
| 6175 | |
| 6176 /* | |
| 351 | 6177 * For the goodword in "stp" compute the soundalike score compared to the |
| 6178 * badword. | |
| 6179 */ | |
| 6180 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6181 stp_sal_score( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6182 suggest_T *stp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6183 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6184 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6185 char_u *badsound) /* sound-folded badword */ |
| 351 | 6186 { |
| 6187 char_u *p; | |
| 534 | 6188 char_u *pbad; |
| 6189 char_u *pgood; | |
| 351 | 6190 char_u badsound2[MAXWLEN]; |
| 6191 char_u fword[MAXWLEN]; | |
| 6192 char_u goodsound[MAXWLEN]; | |
| 534 | 6193 char_u goodword[MAXWLEN]; |
| 6194 int lendiff; | |
| 6195 | |
| 6196 lendiff = (int)(su->su_badlen - stp->st_orglen); | |
| 6197 if (lendiff >= 0) | |
| 6198 pbad = badsound; | |
| 351 | 6199 else |
| 6200 { | |
| 6201 /* soundfold the bad word with more characters following */ | |
| 6202 (void)spell_casefold(su->su_badptr, stp->st_orglen, fword, MAXWLEN); | |
| 6203 | |
| 6204 /* When joining two words the sound often changes a lot. E.g., "t he" | |
| 6205 * sounds like "t h" while "the" sounds like "@". Avoid that by | |
| 6206 * removing the space. Don't do it when the good word also contains a | |
| 6207 * space. */ | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
6208 if (VIM_ISWHITE(su->su_badptr[su->su_badlen]) |
| 351 | 6209 && *skiptowhite(stp->st_word) == NUL) |
| 6210 for (p = fword; *(p = skiptowhite(p)) != NUL; ) | |
| 1619 | 6211 STRMOVE(p, p + 1); |
| 351 | 6212 |
| 375 | 6213 spell_soundfold(slang, fword, TRUE, badsound2); |
| 534 | 6214 pbad = badsound2; |
| 6215 } | |
| 6216 | |
| 2768 | 6217 if (lendiff > 0 && stp->st_wordlen + lendiff < MAXWLEN) |
| 534 | 6218 { |
| 6219 /* Add part of the bad word to the good word, so that we soundfold | |
| 6220 * what replaces the bad word. */ | |
| 6221 STRCPY(goodword, stp->st_word); | |
| 625 | 6222 vim_strncpy(goodword + stp->st_wordlen, |
| 6223 su->su_badptr + su->su_badlen - lendiff, lendiff); | |
| 534 | 6224 pgood = goodword; |
| 6225 } | |
| 6226 else | |
| 6227 pgood = stp->st_word; | |
| 351 | 6228 |
| 375 | 6229 /* Sound-fold the word and compute the score for the difference. */ |
| 534 | 6230 spell_soundfold(slang, pgood, FALSE, goodsound); |
| 6231 | |
| 6232 return soundalike_score(goodsound, pbad); | |
| 351 | 6233 } |
| 6234 | |
| 625 | 6235 /* structure used to store soundfolded words that add_sound_suggest() has |
| 6236 * handled already. */ | |
| 6237 typedef struct | |
| 6238 { | |
| 6239 short sft_score; /* lowest score used */ | |
| 6240 char_u sft_word[1]; /* soundfolded word, actually longer */ | |
| 6241 } sftword_T; | |
| 6242 | |
| 6243 static sftword_T dumsft; | |
| 6244 #define HIKEY2SFT(p) ((sftword_T *)(p - (dumsft.sft_word - (char_u *)&dumsft))) | |
| 6245 #define HI2SFT(hi) HIKEY2SFT((hi)->hi_key) | |
| 6246 | |
| 6247 /* | |
| 6248 * Prepare for calling suggest_try_soundalike(). | |
| 6249 */ | |
| 6250 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6251 suggest_try_soundalike_prep(void) |
| 625 | 6252 { |
| 6253 langp_T *lp; | |
| 6254 int lpi; | |
| 6255 slang_T *slang; | |
| 6256 | |
| 6257 /* Do this for all languages that support sound folding and for which a | |
| 6258 * .sug file has been loaded. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6259 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6260 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6261 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 625 | 6262 slang = lp->lp_slang; |
| 6263 if (slang->sl_sal.ga_len > 0 && slang->sl_sbyts != NULL) | |
| 6264 /* prepare the hashtable used by add_sound_suggest() */ | |
| 6265 hash_init(&slang->sl_sounddone); | |
| 6266 } | |
| 6267 } | |
| 6268 | |
| 351 | 6269 /* |
| 323 | 6270 * Find suggestions by comparing the word in a sound-a-like form. |
| 503 | 6271 * Note: This doesn't support postponed prefixes. |
| 323 | 6272 */ |
| 6273 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6274 suggest_try_soundalike(suginfo_T *su) |
| 323 | 6275 { |
| 6276 char_u salword[MAXWLEN]; | |
| 6277 langp_T *lp; | |
| 500 | 6278 int lpi; |
| 503 | 6279 slang_T *slang; |
| 344 | 6280 |
| 625 | 6281 /* Do this for all languages that support sound folding and for which a |
| 6282 * .sug file has been loaded. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6283 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6284 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6285 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 625 | 6286 slang = lp->lp_slang; |
| 6287 if (slang->sl_sal.ga_len > 0 && slang->sl_sbyts != NULL) | |
| 6288 { | |
| 6289 /* soundfold the bad word */ | |
| 6290 spell_soundfold(slang, su->su_fbadword, TRUE, salword); | |
| 6291 | |
| 6292 /* try all kinds of inserts/deletes/swaps/etc. */ | |
| 6293 /* TODO: also soundfold the next words, so that we can try joining | |
| 6294 * and splitting */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6295 #ifdef SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6296 prof_init(); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6297 #endif |
| 625 | 6298 suggest_trie_walk(su, lp, salword, TRUE); |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6299 #ifdef SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6300 prof_report("soundalike"); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6301 #endif |
| 625 | 6302 } |
| 6303 } | |
| 6304 } | |
| 6305 | |
| 6306 /* | |
| 6307 * Finish up after calling suggest_try_soundalike(). | |
| 6308 */ | |
| 6309 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6310 suggest_try_soundalike_finish(void) |
| 625 | 6311 { |
| 6312 langp_T *lp; | |
| 6313 int lpi; | |
| 6314 slang_T *slang; | |
| 6315 int todo; | |
| 6316 hashitem_T *hi; | |
| 6317 | |
| 6318 /* Do this for all languages that support sound folding and for which a | |
| 6319 * .sug file has been loaded. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6320 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6321 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6322 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 503 | 6323 slang = lp->lp_slang; |
| 625 | 6324 if (slang->sl_sal.ga_len > 0 && slang->sl_sbyts != NULL) |
| 6325 { | |
| 6326 /* Free the info about handled words. */ | |
| 835 | 6327 todo = (int)slang->sl_sounddone.ht_used; |
| 625 | 6328 for (hi = slang->sl_sounddone.ht_array; todo > 0; ++hi) |
| 6329 if (!HASHITEM_EMPTY(hi)) | |
| 6330 { | |
| 6331 vim_free(HI2SFT(hi)); | |
| 6332 --todo; | |
| 6333 } | |
| 1087 | 6334 |
| 6335 /* Clear the hashtable, it may also be used by another region. */ | |
| 625 | 6336 hash_clear(&slang->sl_sounddone); |
| 1087 | 6337 hash_init(&slang->sl_sounddone); |
| 625 | 6338 } |
| 6339 } | |
| 6340 } | |
| 6341 | |
| 6342 /* | |
| 6343 * A match with a soundfolded word is found. Add the good word(s) that | |
| 6344 * produce this soundfolded word. | |
| 6345 */ | |
| 6346 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6347 add_sound_suggest( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6348 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6349 char_u *goodword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6350 int score, /* soundfold score */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6351 langp_T *lp) |
| 625 | 6352 { |
| 6353 slang_T *slang = lp->lp_slang; /* language for sound folding */ | |
| 6354 int sfwordnr; | |
| 6355 char_u *nrline; | |
| 6356 int orgnr; | |
| 6357 char_u theword[MAXWLEN]; | |
| 6358 int i; | |
| 6359 int wlen; | |
| 6360 char_u *byts; | |
| 6361 idx_T *idxs; | |
| 6362 int n; | |
| 6363 int wordcount; | |
| 6364 int wc; | |
| 6365 int goodscore; | |
| 6366 hash_T hash; | |
| 6367 hashitem_T *hi; | |
| 6368 sftword_T *sft; | |
| 6369 int bc, gc; | |
| 6370 int limit; | |
| 6371 | |
| 6372 /* | |
| 6373 * It's very well possible that the same soundfold word is found several | |
| 6374 * times with different scores. Since the following is quite slow only do | |
| 6375 * the words that have a better score than before. Use a hashtable to | |
| 6376 * remember the words that have been done. | |
| 6377 */ | |
| 6378 hash = hash_hash(goodword); | |
| 6379 hi = hash_lookup(&slang->sl_sounddone, goodword, hash); | |
| 6380 if (HASHITEM_EMPTY(hi)) | |
| 6381 { | |
| 844 | 6382 sft = (sftword_T *)alloc((unsigned)(sizeof(sftword_T) |
| 6383 + STRLEN(goodword))); | |
| 625 | 6384 if (sft != NULL) |
| 6385 { | |
| 6386 sft->sft_score = score; | |
| 6387 STRCPY(sft->sft_word, goodword); | |
| 6388 hash_add_item(&slang->sl_sounddone, hi, sft->sft_word, hash); | |
| 6389 } | |
| 6390 } | |
| 6391 else | |
| 6392 { | |
| 6393 sft = HI2SFT(hi); | |
| 6394 if (score >= sft->sft_score) | |
| 6395 return; | |
| 6396 sft->sft_score = score; | |
| 6397 } | |
| 6398 | |
| 6399 /* | |
| 6400 * Find the word nr in the soundfold tree. | |
| 6401 */ | |
| 6402 sfwordnr = soundfold_find(slang, goodword); | |
| 6403 if (sfwordnr < 0) | |
| 6404 { | |
|
10359
66f1b5bf3fa6
commit https://github.com/vim/vim/commit/95f096030ed1a8afea028f2ea295d6f6a70f466f
Christian Brabandt <cb@256bit.org>
parents:
10277
diff
changeset
|
6405 internal_error("add_sound_suggest()"); |
| 625 | 6406 return; |
| 6407 } | |
| 6408 | |
| 6409 /* | |
| 6410 * go over the list of good words that produce this soundfold word | |
| 6411 */ | |
| 6412 nrline = ml_get_buf(slang->sl_sugbuf, (linenr_T)(sfwordnr + 1), FALSE); | |
| 6413 orgnr = 0; | |
| 6414 while (*nrline != NUL) | |
| 6415 { | |
| 6416 /* The wordnr was stored in a minimal nr of bytes as an offset to the | |
| 6417 * previous wordnr. */ | |
| 6418 orgnr += bytes2offset(&nrline); | |
| 6419 | |
| 6420 byts = slang->sl_fbyts; | |
| 6421 idxs = slang->sl_fidxs; | |
| 6422 | |
| 6423 /* Lookup the word "orgnr" one of the two tries. */ | |
| 6424 n = 0; | |
| 6425 wordcount = 0; | |
| 5506 | 6426 for (wlen = 0; wlen < MAXWLEN - 3; ++wlen) |
| 625 | 6427 { |
| 6428 i = 1; | |
| 6429 if (wordcount == orgnr && byts[n + 1] == NUL) | |
| 6430 break; /* found end of word */ | |
| 6431 | |
| 6432 if (byts[n + 1] == NUL) | |
| 6433 ++wordcount; | |
| 6434 | |
| 6435 /* skip over the NUL bytes */ | |
| 6436 for ( ; byts[n + i] == NUL; ++i) | |
| 6437 if (i > byts[n]) /* safety check */ | |
| 6438 { | |
| 6439 STRCPY(theword + wlen, "BAD"); | |
| 5506 | 6440 wlen += 3; |
| 625 | 6441 goto badword; |
| 6442 } | |
| 6443 | |
| 6444 /* One of the siblings must have the word. */ | |
| 6445 for ( ; i < byts[n]; ++i) | |
| 6446 { | |
| 6447 wc = idxs[idxs[n + i]]; /* nr of words under this byte */ | |
| 6448 if (wordcount + wc > orgnr) | |
| 6449 break; | |
| 6450 wordcount += wc; | |
| 6451 } | |
| 6452 | |
| 5506 | 6453 theword[wlen] = byts[n + i]; |
| 625 | 6454 n = idxs[n + i]; |
| 6455 } | |
| 6456 badword: | |
| 6457 theword[wlen] = NUL; | |
| 6458 | |
| 6459 /* Go over the possible flags and regions. */ | |
| 6460 for (; i <= byts[n] && byts[n + i] == NUL; ++i) | |
| 6461 { | |
| 6462 char_u cword[MAXWLEN]; | |
| 6463 char_u *p; | |
| 6464 int flags = (int)idxs[n + i]; | |
| 6465 | |
| 698 | 6466 /* Skip words with the NOSUGGEST flag */ |
| 6467 if (flags & WF_NOSUGGEST) | |
| 6468 continue; | |
| 6469 | |
| 625 | 6470 if (flags & WF_KEEPCAP) |
| 6471 { | |
| 6472 /* Must find the word in the keep-case tree. */ | |
| 6473 find_keepcap_word(slang, theword, cword); | |
| 6474 p = cword; | |
| 6475 } | |
| 6476 else | |
| 6477 { | |
| 6478 flags |= su->su_badflags; | |
| 6479 if ((flags & WF_CAPMASK) != 0) | |
| 6480 { | |
| 6481 /* Need to fix case according to "flags". */ | |
| 6482 make_case_word(theword, cword, flags); | |
| 6483 p = cword; | |
| 323 | 6484 } |
| 6485 else | |
| 625 | 6486 p = theword; |
| 6487 } | |
| 6488 | |
| 6489 /* Add the suggestion. */ | |
| 6490 if (sps_flags & SPS_DOUBLE) | |
| 6491 { | |
| 6492 /* Add the suggestion if the score isn't too bad. */ | |
| 6493 if (score <= su->su_maxscore) | |
| 6494 add_suggestion(su, &su->su_sga, p, su->su_badlen, | |
| 6495 score, 0, FALSE, slang, FALSE); | |
| 6496 } | |
| 6497 else | |
| 6498 { | |
| 6499 /* Add a penalty for words in another region. */ | |
| 6500 if ((flags & WF_REGION) | |
| 6501 && (((unsigned)flags >> 16) & lp->lp_region) == 0) | |
| 6502 goodscore = SCORE_REGION; | |
| 6503 else | |
| 6504 goodscore = 0; | |
| 6505 | |
| 6506 /* Add a small penalty for changing the first letter from | |
| 6507 * lower to upper case. Helps for "tath" -> "Kath", which is | |
| 4352 | 6508 * less common than "tath" -> "path". Don't do it when the |
| 625 | 6509 * letter is the same, that has already been counted. */ |
| 6510 gc = PTR2CHAR(p); | |
| 6511 if (SPELL_ISUPPER(gc)) | |
| 6512 { | |
| 6513 bc = PTR2CHAR(su->su_badword); | |
| 6514 if (!SPELL_ISUPPER(bc) | |
| 6515 && SPELL_TOFOLD(bc) != SPELL_TOFOLD(gc)) | |
| 6516 goodscore += SCORE_ICASE / 2; | |
| 6517 } | |
| 6518 | |
| 6519 /* Compute the score for the good word. This only does letter | |
| 6520 * insert/delete/swap/replace. REP items are not considered, | |
| 6521 * which may make the score a bit higher. | |
| 6522 * Use a limit for the score to make it work faster. Use | |
| 6523 * MAXSCORE(), because RESCORE() will change the score. | |
| 6524 * If the limit is very high then the iterative method is | |
| 6525 * inefficient, using an array is quicker. */ | |
| 6526 limit = MAXSCORE(su->su_sfmaxscore - goodscore, score); | |
| 6527 if (limit > SCORE_LIMITMAX) | |
| 6528 goodscore += spell_edit_score(slang, su->su_badword, p); | |
| 6529 else | |
| 6530 goodscore += spell_edit_score_limit(slang, su->su_badword, | |
| 6531 p, limit); | |
| 6532 | |
| 6533 /* When going over the limit don't bother to do the rest. */ | |
| 6534 if (goodscore < SCORE_MAXMAX) | |
| 6535 { | |
| 6536 /* Give a bonus to words seen before. */ | |
| 6537 goodscore = score_wordcount_adj(slang, goodscore, p, FALSE); | |
| 6538 | |
| 6539 /* Add the suggestion if the score isn't too bad. */ | |
| 6540 goodscore = RESCORE(goodscore, score); | |
| 6541 if (goodscore <= su->su_sfmaxscore) | |
| 6542 add_suggestion(su, &su->su_ga, p, su->su_badlen, | |
| 6543 goodscore, score, TRUE, slang, TRUE); | |
| 6544 } | |
| 6545 } | |
| 6546 } | |
| 6547 /* smsg("word %s (%d): %s (%d)", sftword, sftnr, theword, orgnr); */ | |
| 6548 } | |
| 6549 } | |
| 6550 | |
| 6551 /* | |
| 6552 * Find word "word" in fold-case tree for "slang" and return the word number. | |
| 6553 */ | |
| 6554 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6555 soundfold_find(slang_T *slang, char_u *word) |
| 625 | 6556 { |
| 6557 idx_T arridx = 0; | |
| 6558 int len; | |
| 6559 int wlen = 0; | |
| 6560 int c; | |
| 6561 char_u *ptr = word; | |
| 6562 char_u *byts; | |
| 6563 idx_T *idxs; | |
| 6564 int wordnr = 0; | |
| 6565 | |
| 6566 byts = slang->sl_sbyts; | |
| 6567 idxs = slang->sl_sidxs; | |
| 6568 | |
| 6569 for (;;) | |
| 6570 { | |
| 6571 /* First byte is the number of possible bytes. */ | |
| 6572 len = byts[arridx++]; | |
| 6573 | |
| 6574 /* If the first possible byte is a zero the word could end here. | |
| 6575 * If the word ends we found the word. If not skip the NUL bytes. */ | |
| 6576 c = ptr[wlen]; | |
| 6577 if (byts[arridx] == NUL) | |
| 6578 { | |
| 6579 if (c == NUL) | |
| 6580 break; | |
| 6581 | |
| 6582 /* Skip over the zeros, there can be several. */ | |
| 6583 while (len > 0 && byts[arridx] == NUL) | |
| 6584 { | |
| 6585 ++arridx; | |
| 6586 --len; | |
| 6587 } | |
| 6588 if (len == 0) | |
| 6589 return -1; /* no children, word should have ended here */ | |
| 6590 ++wordnr; | |
| 6591 } | |
| 6592 | |
| 6593 /* If the word ends we didn't find it. */ | |
| 6594 if (c == NUL) | |
| 6595 return -1; | |
| 6596 | |
| 6597 /* Perform a binary search in the list of accepted bytes. */ | |
| 6598 if (c == TAB) /* <Tab> is handled like <Space> */ | |
| 6599 c = ' '; | |
| 6600 while (byts[arridx] < c) | |
| 6601 { | |
| 6602 /* The word count is in the first idxs[] entry of the child. */ | |
| 6603 wordnr += idxs[idxs[arridx]]; | |
| 6604 ++arridx; | |
| 6605 if (--len == 0) /* end of the bytes, didn't find it */ | |
| 6606 return -1; | |
| 6607 } | |
| 6608 if (byts[arridx] != c) /* didn't find the byte */ | |
| 6609 return -1; | |
| 6610 | |
| 6611 /* Continue at the child (if there is one). */ | |
| 6612 arridx = idxs[arridx]; | |
| 6613 ++wlen; | |
| 6614 | |
| 6615 /* One space in the good word may stand for several spaces in the | |
| 6616 * checked word. */ | |
| 6617 if (c == ' ') | |
| 6618 while (ptr[wlen] == ' ' || ptr[wlen] == TAB) | |
| 6619 ++wlen; | |
| 6620 } | |
| 6621 | |
| 6622 return wordnr; | |
| 323 | 6623 } |
| 6624 | |
| 6625 /* | |
| 324 | 6626 * Copy "fword" to "cword", fixing case according to "flags". |
| 323 | 6627 */ |
| 6628 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6629 make_case_word(char_u *fword, char_u *cword, int flags) |
| 323 | 6630 { |
| 6631 if (flags & WF_ALLCAP) | |
| 6632 /* Make it all upper-case */ | |
| 6633 allcap_copy(fword, cword); | |
| 6634 else if (flags & WF_ONECAP) | |
| 6635 /* Make the first letter upper-case */ | |
| 324 | 6636 onecap_copy(fword, cword, TRUE); |
| 323 | 6637 else |
| 6638 /* Use goodword as-is. */ | |
| 6639 STRCPY(cword, fword); | |
| 6640 } | |
| 6641 | |
| 330 | 6642 |
| 323 | 6643 /* |
| 6644 * Return TRUE if "c1" and "c2" are similar characters according to the MAP | |
| 6645 * lines in the .aff file. | |
| 6646 */ | |
| 6647 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6648 similar_chars(slang_T *slang, int c1, int c2) |
| 323 | 6649 { |
| 330 | 6650 int m1, m2; |
| 6651 #ifdef FEAT_MBYTE | |
| 3549 | 6652 char_u buf[MB_MAXBYTES + 1]; |
| 330 | 6653 hashitem_T *hi; |
| 6654 | |
| 6655 if (c1 >= 256) | |
| 6656 { | |
| 6657 buf[mb_char2bytes(c1, buf)] = 0; | |
| 6658 hi = hash_find(&slang->sl_map_hash, buf); | |
| 6659 if (HASHITEM_EMPTY(hi)) | |
| 6660 m1 = 0; | |
| 6661 else | |
| 6662 m1 = mb_ptr2char(hi->hi_key + STRLEN(hi->hi_key) + 1); | |
| 6663 } | |
| 6664 else | |
| 6665 #endif | |
| 6666 m1 = slang->sl_map_array[c1]; | |
| 6667 if (m1 == 0) | |
| 323 | 6668 return FALSE; |
| 330 | 6669 |
| 6670 | |
| 6671 #ifdef FEAT_MBYTE | |
| 6672 if (c2 >= 256) | |
| 6673 { | |
| 6674 buf[mb_char2bytes(c2, buf)] = 0; | |
| 6675 hi = hash_find(&slang->sl_map_hash, buf); | |
| 6676 if (HASHITEM_EMPTY(hi)) | |
| 6677 m2 = 0; | |
| 6678 else | |
| 6679 m2 = mb_ptr2char(hi->hi_key + STRLEN(hi->hi_key) + 1); | |
| 6680 } | |
| 6681 else | |
| 6682 #endif | |
| 6683 m2 = slang->sl_map_array[c2]; | |
| 6684 | |
| 6685 return m1 == m2; | |
| 323 | 6686 } |
| 6687 | |
| 6688 /* | |
| 6689 * Add a suggestion to the list of suggestions. | |
| 625 | 6690 * For a suggestion that is already in the list the lowest score is remembered. |
| 6691 */ | |
| 6692 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6693 add_suggestion( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6694 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6695 garray_T *gap, /* either su_ga or su_sga */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6696 char_u *goodword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6697 int badlenarg, /* len of bad word replaced with "goodword" */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6698 int score, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6699 int altscore, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6700 int had_bonus, /* value for st_had_bonus */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6701 slang_T *slang, /* language for sound folding */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6702 int maxsf) /* su_maxscore applies to soundfold score, |
| 625 | 6703 su_sfmaxscore to the total score. */ |
| 6704 { | |
| 6705 int goodlen; /* len of goodword changed */ | |
| 6706 int badlen; /* len of bad word changed */ | |
| 323 | 6707 suggest_T *stp; |
| 534 | 6708 suggest_T new_sug; |
| 323 | 6709 int i; |
| 534 | 6710 char_u *pgood, *pbad; |
| 532 | 6711 |
| 534 | 6712 /* Minimize "badlen" for consistency. Avoids that changing "the the" to |
| 6713 * "thee the" is added next to changing the first "the" the "thee". */ | |
| 6714 pgood = goodword + STRLEN(goodword); | |
| 625 | 6715 pbad = su->su_badptr + badlenarg; |
| 6716 for (;;) | |
| 6717 { | |
| 835 | 6718 goodlen = (int)(pgood - goodword); |
| 6719 badlen = (int)(pbad - su->su_badptr); | |
| 625 | 6720 if (goodlen <= 0 || badlen <= 0) |
| 6721 break; | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
6722 MB_PTR_BACK(goodword, pgood); |
|
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
6723 MB_PTR_BACK(su->su_badptr, pbad); |
| 534 | 6724 #ifdef FEAT_MBYTE |
| 6725 if (has_mbyte) | |
| 6726 { | |
| 6727 if (mb_ptr2char(pgood) != mb_ptr2char(pbad)) | |
| 6728 break; | |
| 346 | 6729 } |
| 6730 else | |
| 534 | 6731 #endif |
| 6732 if (*pgood != *pbad) | |
| 6733 break; | |
| 625 | 6734 } |
| 6735 | |
| 534 | 6736 if (badlen == 0 && goodlen == 0) |
| 6737 /* goodword doesn't change anything; may happen for "the the" changing | |
| 6738 * the first "the" to itself. */ | |
| 6739 return; | |
| 346 | 6740 |
| 944 | 6741 if (gap->ga_len == 0) |
| 6742 i = -1; | |
| 6743 else | |
| 6744 { | |
| 6745 /* Check if the word is already there. Also check the length that is | |
| 6746 * being replaced "thes," -> "these" is a different suggestion from | |
| 6747 * "thes" -> "these". */ | |
| 6748 stp = &SUG(*gap, 0); | |
| 6749 for (i = gap->ga_len; --i >= 0; ++stp) | |
| 6750 if (stp->st_wordlen == goodlen | |
| 6751 && stp->st_orglen == badlen | |
| 6752 && STRNCMP(stp->st_word, goodword, goodlen) == 0) | |
| 6753 { | |
| 6754 /* | |
| 6755 * Found it. Remember the word with the lowest score. | |
| 6756 */ | |
| 6757 if (stp->st_slang == NULL) | |
| 6758 stp->st_slang = slang; | |
| 6759 | |
| 6760 new_sug.st_score = score; | |
| 6761 new_sug.st_altscore = altscore; | |
| 6762 new_sug.st_had_bonus = had_bonus; | |
| 6763 | |
| 6764 if (stp->st_had_bonus != had_bonus) | |
| 6765 { | |
| 6766 /* Only one of the two had the soundalike score computed. | |
| 6767 * Need to do that for the other one now, otherwise the | |
| 6768 * scores can't be compared. This happens because | |
| 6769 * suggest_try_change() doesn't compute the soundalike | |
| 6770 * word to keep it fast, while some special methods set | |
| 6771 * the soundalike score to zero. */ | |
| 6772 if (had_bonus) | |
| 6773 rescore_one(su, stp); | |
| 6774 else | |
| 6775 { | |
| 6776 new_sug.st_word = stp->st_word; | |
| 6777 new_sug.st_wordlen = stp->st_wordlen; | |
| 6778 new_sug.st_slang = stp->st_slang; | |
| 6779 new_sug.st_orglen = badlen; | |
| 6780 rescore_one(su, &new_sug); | |
| 6781 } | |
| 6782 } | |
| 6783 | |
| 6784 if (stp->st_score > new_sug.st_score) | |
| 6785 { | |
| 6786 stp->st_score = new_sug.st_score; | |
| 6787 stp->st_altscore = new_sug.st_altscore; | |
| 6788 stp->st_had_bonus = new_sug.st_had_bonus; | |
| 6789 } | |
| 6790 break; | |
| 6791 } | |
| 6792 } | |
| 625 | 6793 |
| 6794 if (i < 0 && ga_grow(gap, 1) == OK) | |
| 6795 { | |
| 6796 /* Add a suggestion. */ | |
| 6797 stp = &SUG(*gap, gap->ga_len); | |
| 6798 stp->st_word = vim_strnsave(goodword, goodlen); | |
| 6799 if (stp->st_word != NULL) | |
| 6800 { | |
| 6801 stp->st_wordlen = goodlen; | |
| 6802 stp->st_score = score; | |
| 6803 stp->st_altscore = altscore; | |
| 6804 stp->st_had_bonus = had_bonus; | |
| 6805 stp->st_orglen = badlen; | |
| 6806 stp->st_slang = slang; | |
| 6807 ++gap->ga_len; | |
| 6808 | |
| 6809 /* If we have too many suggestions now, sort the list and keep | |
| 6810 * the best suggestions. */ | |
| 6811 if (gap->ga_len > SUG_MAX_COUNT(su)) | |
| 6812 { | |
| 6813 if (maxsf) | |
| 6814 su->su_sfmaxscore = cleanup_suggestions(gap, | |
| 6815 su->su_sfmaxscore, SUG_CLEAN_COUNT(su)); | |
| 6816 else | |
| 6817 su->su_maxscore = cleanup_suggestions(gap, | |
| 6818 su->su_maxscore, SUG_CLEAN_COUNT(su)); | |
| 6819 } | |
| 6820 } | |
| 6821 } | |
| 6822 } | |
| 6823 | |
| 6824 /* | |
| 6825 * Suggestions may in fact be flagged as errors. Esp. for banned words and | |
| 6826 * for split words, such as "the the". Remove these from the list here. | |
| 6827 */ | |
| 6828 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6829 check_suggestions( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6830 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6831 garray_T *gap) /* either su_ga or su_sga */ |
| 625 | 6832 { |
| 6833 suggest_T *stp; | |
| 6834 int i; | |
| 6835 char_u longword[MAXWLEN + 1]; | |
| 6836 int len; | |
| 6837 hlf_T attr; | |
| 6838 | |
| 6839 stp = &SUG(*gap, 0); | |
| 6840 for (i = gap->ga_len - 1; i >= 0; --i) | |
| 6841 { | |
| 6842 /* Need to append what follows to check for "the the". */ | |
| 2768 | 6843 vim_strncpy(longword, stp[i].st_word, MAXWLEN); |
| 625 | 6844 len = stp[i].st_wordlen; |
| 6845 vim_strncpy(longword + len, su->su_badptr + stp[i].st_orglen, | |
| 6846 MAXWLEN - len); | |
| 6847 attr = HLF_COUNT; | |
| 6848 (void)spell_check(curwin, longword, &attr, NULL, FALSE); | |
| 6849 if (attr != HLF_COUNT) | |
| 6850 { | |
| 6851 /* Remove this entry. */ | |
| 6852 vim_free(stp[i].st_word); | |
| 6853 --gap->ga_len; | |
| 6854 if (i < gap->ga_len) | |
| 6855 mch_memmove(stp + i, stp + i + 1, | |
| 6856 sizeof(suggest_T) * (gap->ga_len - i)); | |
| 6857 } | |
| 6858 } | |
| 6859 } | |
| 6860 | |
| 323 | 6861 |
| 6862 /* | |
| 6863 * Add a word to be banned. | |
| 6864 */ | |
| 6865 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6866 add_banned( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6867 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6868 char_u *word) |
| 323 | 6869 { |
| 626 | 6870 char_u *s; |
| 323 | 6871 hash_T hash; |
| 6872 hashitem_T *hi; | |
| 6873 | |
| 625 | 6874 hash = hash_hash(word); |
| 6875 hi = hash_lookup(&su->su_banned, word, hash); | |
| 6876 if (HASHITEM_EMPTY(hi)) | |
| 6877 { | |
| 6878 s = vim_strsave(word); | |
| 6879 if (s != NULL) | |
| 323 | 6880 hash_add_item(&su->su_banned, hi, s, hash); |
| 625 | 6881 } |
| 323 | 6882 } |
| 6883 | |
| 324 | 6884 /* |
| 534 | 6885 * Recompute the score for all suggestions if sound-folding is possible. This |
| 6886 * is slow, thus only done for the final results. | |
| 324 | 6887 */ |
| 6888 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6889 rescore_suggestions(suginfo_T *su) |
| 324 | 6890 { |
| 6891 int i; | |
| 534 | 6892 |
| 6893 if (su->su_sallang != NULL) | |
| 503 | 6894 for (i = 0; i < su->su_ga.ga_len; ++i) |
| 534 | 6895 rescore_one(su, &SUG(su->su_ga, i)); |
| 6896 } | |
| 6897 | |
| 6898 /* | |
| 6899 * Recompute the score for one suggestion if sound-folding is possible. | |
| 6900 */ | |
| 6901 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6902 rescore_one(suginfo_T *su, suggest_T *stp) |
| 534 | 6903 { |
| 6904 slang_T *slang = stp->st_slang; | |
| 6905 char_u sal_badword[MAXWLEN]; | |
| 535 | 6906 char_u *p; |
| 534 | 6907 |
| 6908 /* Only rescore suggestions that have no sal score yet and do have a | |
| 6909 * language. */ | |
| 6910 if (slang != NULL && slang->sl_sal.ga_len > 0 && !stp->st_had_bonus) | |
| 6911 { | |
| 6912 if (slang == su->su_sallang) | |
| 535 | 6913 p = su->su_sal_badword; |
| 534 | 6914 else |
| 6915 { | |
| 6916 spell_soundfold(slang, su->su_fbadword, TRUE, sal_badword); | |
| 535 | 6917 p = sal_badword; |
| 6918 } | |
| 6919 | |
| 6920 stp->st_altscore = stp_sal_score(stp, su, slang, p); | |
| 534 | 6921 if (stp->st_altscore == SCORE_MAXMAX) |
| 6922 stp->st_altscore = SCORE_BIG; | |
| 6923 stp->st_score = RESCORE(stp->st_score, stp->st_altscore); | |
| 6924 stp->st_had_bonus = TRUE; | |
| 324 | 6925 } |
| 6926 } | |
| 6927 | |
| 323 | 6928 static int |
| 6929 #ifdef __BORLANDC__ | |
| 6930 _RTLENTRYF | |
| 6931 #endif | |
|
7805
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
6932 sug_compare(const void *s1, const void *s2); |
| 323 | 6933 |
| 6934 /* | |
| 6935 * Function given to qsort() to sort the suggestions on st_score. | |
| 529 | 6936 * First on "st_score", then "st_altscore" then alphabetically. |
| 323 | 6937 */ |
| 6938 static int | |
| 6939 #ifdef __BORLANDC__ | |
| 6940 _RTLENTRYF | |
| 6941 #endif | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6942 sug_compare(const void *s1, const void *s2) |
| 323 | 6943 { |
| 6944 suggest_T *p1 = (suggest_T *)s1; | |
| 6945 suggest_T *p2 = (suggest_T *)s2; | |
| 344 | 6946 int n = p1->st_score - p2->st_score; |
| 6947 | |
| 6948 if (n == 0) | |
| 529 | 6949 { |
| 6950 n = p1->st_altscore - p2->st_altscore; | |
| 6951 if (n == 0) | |
| 6952 n = STRICMP(p1->st_word, p2->st_word); | |
| 6953 } | |
| 344 | 6954 return n; |
| 323 | 6955 } |
| 6956 | |
| 6957 /* | |
| 6958 * Cleanup the suggestions: | |
| 6959 * - Sort on score. | |
| 6960 * - Remove words that won't be displayed. | |
| 344 | 6961 * Returns the maximum score in the list or "maxscore" unmodified. |
| 323 | 6962 */ |
| 344 | 6963 static int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6964 cleanup_suggestions( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6965 garray_T *gap, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6966 int maxscore, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6967 int keep) /* nr of suggestions to keep */ |
| 323 | 6968 { |
| 344 | 6969 suggest_T *stp = &SUG(*gap, 0); |
| 323 | 6970 int i; |
| 6971 | |
| 6972 /* Sort the list. */ | |
| 344 | 6973 qsort(gap->ga_data, (size_t)gap->ga_len, sizeof(suggest_T), sug_compare); |
| 323 | 6974 |
| 6975 /* Truncate the list to the number of suggestions that will be displayed. */ | |
| 344 | 6976 if (gap->ga_len > keep) |
| 323 | 6977 { |
| 344 | 6978 for (i = keep; i < gap->ga_len; ++i) |
| 323 | 6979 vim_free(stp[i].st_word); |
| 344 | 6980 gap->ga_len = keep; |
| 6981 return stp[keep - 1].st_score; | |
| 323 | 6982 } |
| 344 | 6983 return maxscore; |
| 323 | 6984 } |
| 6985 | |
| 372 | 6986 #if defined(FEAT_EVAL) || defined(PROTO) |
| 6987 /* | |
| 6988 * Soundfold a string, for soundfold(). | |
| 6989 * Result is in allocated memory, NULL for an error. | |
| 6990 */ | |
| 6991 char_u * | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6992 eval_soundfold(char_u *word) |
| 372 | 6993 { |
| 6994 langp_T *lp; | |
| 6995 char_u sound[MAXWLEN]; | |
| 500 | 6996 int lpi; |
| 372 | 6997 |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6998 if (curwin->w_p_spell && *curwin->w_s->b_p_spl != NUL) |
| 372 | 6999 /* Use the sound-folding of the first language that supports it. */ |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7000 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7001 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7002 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 372 | 7003 if (lp->lp_slang->sl_sal.ga_len > 0) |
| 7004 { | |
| 7005 /* soundfold the word */ | |
| 375 | 7006 spell_soundfold(lp->lp_slang, word, FALSE, sound); |
| 372 | 7007 return vim_strsave(sound); |
| 7008 } | |
| 500 | 7009 } |
| 372 | 7010 |
| 7011 /* No language with sound folding, return word as-is. */ | |
| 7012 return vim_strsave(word); | |
| 7013 } | |
| 7014 #endif | |
| 7015 | |
| 323 | 7016 /* |
| 7017 * Turn "inword" into its sound-a-like equivalent in "res[MAXWLEN]". | |
| 485 | 7018 * |
| 7019 * There are many ways to turn a word into a sound-a-like representation. The | |
| 7020 * oldest is Soundex (1918!). A nice overview can be found in "Approximate | |
| 7021 * swedish name matching - survey and test of different algorithms" by Klas | |
| 7022 * Erikson. | |
| 7023 * | |
| 7024 * We support two methods: | |
| 7025 * 1. SOFOFROM/SOFOTO do a simple character mapping. | |
| 7026 * 2. SAL items define a more advanced sound-folding (and much slower). | |
| 323 | 7027 */ |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
7028 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7029 spell_soundfold( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7030 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7031 char_u *inword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7032 int folded, /* "inword" is already case-folded */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7033 char_u *res) |
| 375 | 7034 { |
| 7035 char_u fword[MAXWLEN]; | |
| 7036 char_u *word; | |
| 7037 | |
| 7038 if (slang->sl_sofo) | |
| 7039 /* SOFOFROM and SOFOTO used */ | |
| 7040 spell_soundfold_sofo(slang, inword, res); | |
| 7041 else | |
| 7042 { | |
| 7043 /* SAL items used. Requires the word to be case-folded. */ | |
| 7044 if (folded) | |
| 7045 word = inword; | |
| 7046 else | |
| 7047 { | |
| 835 | 7048 (void)spell_casefold(inword, (int)STRLEN(inword), fword, MAXWLEN); |
| 375 | 7049 word = fword; |
| 7050 } | |
| 7051 | |
| 7052 #ifdef FEAT_MBYTE | |
| 7053 if (has_mbyte) | |
| 7054 spell_soundfold_wsal(slang, word, res); | |
| 7055 else | |
| 7056 #endif | |
| 7057 spell_soundfold_sal(slang, word, res); | |
| 7058 } | |
| 7059 } | |
| 7060 | |
| 7061 /* | |
| 7062 * Perform sound folding of "inword" into "res" according to SOFOFROM and | |
| 7063 * SOFOTO lines. | |
| 7064 */ | |
| 7065 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7066 spell_soundfold_sofo(slang_T *slang, char_u *inword, char_u *res) |
| 375 | 7067 { |
| 7068 char_u *s; | |
| 7069 int ri = 0; | |
| 7070 int c; | |
| 7071 | |
| 7072 #ifdef FEAT_MBYTE | |
| 7073 if (has_mbyte) | |
| 7074 { | |
| 7075 int prevc = 0; | |
| 7076 int *ip; | |
| 7077 | |
| 7078 /* The sl_sal_first[] table contains the translation for chars up to | |
| 7079 * 255, sl_sal the rest. */ | |
| 7080 for (s = inword; *s != NUL; ) | |
| 7081 { | |
| 474 | 7082 c = mb_cptr2char_adv(&s); |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
7083 if (enc_utf8 ? utf_class(c) == 0 : VIM_ISWHITE(c)) |
| 375 | 7084 c = ' '; |
| 7085 else if (c < 256) | |
| 7086 c = slang->sl_sal_first[c]; | |
| 7087 else | |
| 7088 { | |
| 7089 ip = ((int **)slang->sl_sal.ga_data)[c & 0xff]; | |
| 7090 if (ip == NULL) /* empty list, can't match */ | |
| 7091 c = NUL; | |
| 7092 else | |
| 7093 for (;;) /* find "c" in the list */ | |
| 7094 { | |
| 7095 if (*ip == 0) /* not found */ | |
| 7096 { | |
| 7097 c = NUL; | |
| 7098 break; | |
| 7099 } | |
| 7100 if (*ip == c) /* match! */ | |
| 7101 { | |
| 7102 c = ip[1]; | |
| 7103 break; | |
| 7104 } | |
| 7105 ip += 2; | |
| 7106 } | |
| 7107 } | |
| 7108 | |
| 7109 if (c != NUL && c != prevc) | |
| 7110 { | |
| 7111 ri += mb_char2bytes(c, res + ri); | |
| 7112 if (ri + MB_MAXBYTES > MAXWLEN) | |
| 7113 break; | |
| 7114 prevc = c; | |
| 7115 } | |
| 7116 } | |
| 7117 } | |
| 7118 else | |
| 7119 #endif | |
| 7120 { | |
| 7121 /* The sl_sal_first[] table contains the translation. */ | |
| 7122 for (s = inword; (c = *s) != NUL; ++s) | |
| 7123 { | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
7124 if (VIM_ISWHITE(c)) |
| 375 | 7125 c = ' '; |
| 7126 else | |
| 7127 c = slang->sl_sal_first[c]; | |
| 7128 if (c != NUL && (ri == 0 || res[ri - 1] != c)) | |
| 7129 res[ri++] = c; | |
| 7130 } | |
| 7131 } | |
| 7132 | |
| 7133 res[ri] = NUL; | |
| 7134 } | |
| 7135 | |
| 7136 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7137 spell_soundfold_sal(slang_T *slang, char_u *inword, char_u *res) |
| 323 | 7138 { |
| 344 | 7139 salitem_T *smp; |
| 323 | 7140 char_u word[MAXWLEN]; |
| 375 | 7141 char_u *s = inword; |
| 323 | 7142 char_u *t; |
| 344 | 7143 char_u *pf; |
| 323 | 7144 int i, j, z; |
| 344 | 7145 int reslen; |
| 323 | 7146 int n, k = 0; |
| 7147 int z0; | |
| 7148 int k0; | |
| 7149 int n0; | |
| 7150 int c; | |
| 7151 int pri; | |
| 7152 int p0 = -333; | |
| 7153 int c0; | |
| 7154 | |
| 324 | 7155 /* Remove accents, if wanted. We actually remove all non-word characters. |
| 375 | 7156 * But keep white space. We need a copy, the word may be changed here. */ |
| 323 | 7157 if (slang->sl_rem_accents) |
| 7158 { | |
| 7159 t = word; | |
| 375 | 7160 while (*s != NUL) |
| 323 | 7161 { |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
7162 if (VIM_ISWHITE(*s)) |
| 344 | 7163 { |
| 7164 *t++ = ' '; | |
| 7165 s = skipwhite(s); | |
| 7166 } | |
| 323 | 7167 else |
| 7168 { | |
| 5477 | 7169 if (spell_iswordp_nmw(s, curwin)) |
| 323 | 7170 *t++ = *s; |
| 7171 ++s; | |
| 7172 } | |
| 7173 } | |
| 7174 *t = NUL; | |
| 7175 } | |
| 7176 else | |
| 2768 | 7177 vim_strncpy(word, s, MAXWLEN - 1); |
| 323 | 7178 |
| 344 | 7179 smp = (salitem_T *)slang->sl_sal.ga_data; |
| 323 | 7180 |
| 7181 /* | |
| 7182 * This comes from Aspell phonet.cpp. Converted from C++ to C. | |
| 324 | 7183 * Changed to keep spaces. |
| 323 | 7184 */ |
| 344 | 7185 i = reslen = z = 0; |
| 323 | 7186 while ((c = word[i]) != NUL) |
| 7187 { | |
| 344 | 7188 /* Start with the first rule that has the character in the word. */ |
| 323 | 7189 n = slang->sl_sal_first[c]; |
| 7190 z0 = 0; | |
| 7191 | |
| 7192 if (n >= 0) | |
| 7193 { | |
| 7194 /* check all rules for the same letter */ | |
| 344 | 7195 for (; (s = smp[n].sm_lead)[0] == c; ++n) |
| 323 | 7196 { |
| 344 | 7197 /* Quickly skip entries that don't match the word. Most |
| 7198 * entries are less then three chars, optimize for that. */ | |
| 7199 k = smp[n].sm_leadlen; | |
| 7200 if (k > 1) | |
| 323 | 7201 { |
| 344 | 7202 if (word[i + 1] != s[1]) |
| 7203 continue; | |
| 7204 if (k > 2) | |
| 7205 { | |
| 7206 for (j = 2; j < k; ++j) | |
| 7207 if (word[i + j] != s[j]) | |
| 7208 break; | |
| 7209 if (j < k) | |
| 7210 continue; | |
| 7211 } | |
| 323 | 7212 } |
| 7213 | |
| 375 | 7214 if ((pf = smp[n].sm_oneof) != NULL) |
| 323 | 7215 { |
| 375 | 7216 /* Check for match with one of the chars in "sm_oneof". */ |
| 344 | 7217 while (*pf != NUL && *pf != word[i + k]) |
| 7218 ++pf; | |
| 7219 if (*pf == NUL) | |
| 7220 continue; | |
| 7221 ++k; | |
| 323 | 7222 } |
| 344 | 7223 s = smp[n].sm_rules; |
| 7224 pri = 5; /* default priority */ | |
| 323 | 7225 |
| 7226 p0 = *s; | |
| 7227 k0 = k; | |
| 7228 while (*s == '-' && k > 1) | |
| 7229 { | |
| 7230 k--; | |
| 7231 s++; | |
| 7232 } | |
| 7233 if (*s == '<') | |
| 7234 s++; | |
| 344 | 7235 if (VIM_ISDIGIT(*s)) |
| 323 | 7236 { |
| 7237 /* determine priority */ | |
| 7238 pri = *s - '0'; | |
| 7239 s++; | |
| 7240 } | |
| 7241 if (*s == '^' && *(s + 1) == '^') | |
| 7242 s++; | |
| 7243 | |
| 7244 if (*s == NUL | |
| 7245 || (*s == '^' | |
| 324 | 7246 && (i == 0 || !(word[i - 1] == ' ' |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7247 || spell_iswordp(word + i - 1, curwin))) |
| 323 | 7248 && (*(s + 1) != '$' |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7249 || (!spell_iswordp(word + i + k0, curwin)))) |
| 323 | 7250 || (*s == '$' && i > 0 |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7251 && spell_iswordp(word + i - 1, curwin) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7252 && (!spell_iswordp(word + i + k0, curwin)))) |
| 323 | 7253 { |
| 7254 /* search for followup rules, if: */ | |
| 7255 /* followup and k > 1 and NO '-' in searchstring */ | |
| 7256 c0 = word[i + k - 1]; | |
| 7257 n0 = slang->sl_sal_first[c0]; | |
| 7258 | |
| 7259 if (slang->sl_followup && k > 1 && n0 >= 0 | |
| 344 | 7260 && p0 != '-' && word[i + k] != NUL) |
| 323 | 7261 { |
| 7262 /* test follow-up rule for "word[i + k]" */ | |
| 344 | 7263 for ( ; (s = smp[n0].sm_lead)[0] == c0; ++n0) |
| 323 | 7264 { |
| 344 | 7265 /* Quickly skip entries that don't match the word. |
| 7266 * */ | |
| 7267 k0 = smp[n0].sm_leadlen; | |
| 7268 if (k0 > 1) | |
| 323 | 7269 { |
| 344 | 7270 if (word[i + k] != s[1]) |
| 7271 continue; | |
| 7272 if (k0 > 2) | |
| 7273 { | |
| 7274 pf = word + i + k + 1; | |
| 7275 for (j = 2; j < k0; ++j) | |
| 7276 if (*pf++ != s[j]) | |
| 7277 break; | |
| 7278 if (j < k0) | |
| 7279 continue; | |
| 7280 } | |
| 323 | 7281 } |
| 344 | 7282 k0 += k - 1; |
| 7283 | |
| 375 | 7284 if ((pf = smp[n0].sm_oneof) != NULL) |
| 323 | 7285 { |
| 344 | 7286 /* Check for match with one of the chars in |
| 375 | 7287 * "sm_oneof". */ |
| 344 | 7288 while (*pf != NUL && *pf != word[i + k0]) |
| 7289 ++pf; | |
| 7290 if (*pf == NUL) | |
| 7291 continue; | |
| 7292 ++k0; | |
| 323 | 7293 } |
| 344 | 7294 |
| 7295 p0 = 5; | |
| 7296 s = smp[n0].sm_rules; | |
| 323 | 7297 while (*s == '-') |
| 7298 { | |
| 344 | 7299 /* "k0" gets NOT reduced because |
| 7300 * "if (k0 == k)" */ | |
| 323 | 7301 s++; |
| 7302 } | |
| 7303 if (*s == '<') | |
| 7304 s++; | |
| 344 | 7305 if (VIM_ISDIGIT(*s)) |
| 323 | 7306 { |
| 7307 p0 = *s - '0'; | |
| 7308 s++; | |
| 7309 } | |
| 7310 | |
| 7311 if (*s == NUL | |
| 7312 /* *s == '^' cuts */ | |
| 7313 || (*s == '$' | |
| 376 | 7314 && !spell_iswordp(word + i + k0, |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7315 curwin))) |
| 323 | 7316 { |
| 7317 if (k0 == k) | |
| 7318 /* this is just a piece of the string */ | |
| 7319 continue; | |
| 7320 | |
| 7321 if (p0 < pri) | |
| 7322 /* priority too low */ | |
| 7323 continue; | |
| 7324 /* rule fits; stop search */ | |
| 7325 break; | |
| 7326 } | |
| 7327 } | |
| 7328 | |
| 344 | 7329 if (p0 >= pri && smp[n0].sm_lead[0] == c0) |
| 323 | 7330 continue; |
| 7331 } | |
| 7332 | |
| 7333 /* replace string */ | |
| 344 | 7334 s = smp[n].sm_to; |
| 389 | 7335 if (s == NULL) |
| 7336 s = (char_u *)""; | |
| 344 | 7337 pf = smp[n].sm_rules; |
| 7338 p0 = (vim_strchr(pf, '<') != NULL) ? 1 : 0; | |
| 323 | 7339 if (p0 == 1 && z == 0) |
| 7340 { | |
| 7341 /* rule with '<' is used */ | |
| 344 | 7342 if (reslen > 0 && *s != NUL && (res[reslen - 1] == c |
| 7343 || res[reslen - 1] == *s)) | |
| 7344 reslen--; | |
| 323 | 7345 z0 = 1; |
| 7346 z = 1; | |
| 7347 k0 = 0; | |
| 372 | 7348 while (*s != NUL && word[i + k0] != NUL) |
| 323 | 7349 { |
| 7350 word[i + k0] = *s; | |
| 7351 k0++; | |
| 7352 s++; | |
| 7353 } | |
| 7354 if (k > k0) | |
| 1619 | 7355 STRMOVE(word + i + k0, word + i + k); |
| 323 | 7356 |
| 7357 /* new "actual letter" */ | |
| 7358 c = word[i]; | |
| 7359 } | |
| 7360 else | |
| 7361 { | |
| 7362 /* no '<' rule used */ | |
| 7363 i += k - 1; | |
| 7364 z = 0; | |
| 344 | 7365 while (*s != NUL && s[1] != NUL && reslen < MAXWLEN) |
| 323 | 7366 { |
| 344 | 7367 if (reslen == 0 || res[reslen - 1] != *s) |
| 372 | 7368 res[reslen++] = *s; |
| 323 | 7369 s++; |
| 7370 } | |
| 7371 /* new "actual letter" */ | |
| 7372 c = *s; | |
| 344 | 7373 if (strstr((char *)pf, "^^") != NULL) |
| 323 | 7374 { |
| 7375 if (c != NUL) | |
| 372 | 7376 res[reslen++] = c; |
| 1619 | 7377 STRMOVE(word, word + i + 1); |
| 323 | 7378 i = 0; |
| 7379 z0 = 1; | |
| 7380 } | |
| 7381 } | |
| 7382 break; | |
| 7383 } | |
| 7384 } | |
| 7385 } | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
7386 else if (VIM_ISWHITE(c)) |
| 324 | 7387 { |
| 7388 c = ' '; | |
| 7389 k = 1; | |
| 7390 } | |
| 323 | 7391 |
| 7392 if (z0 == 0) | |
| 7393 { | |
| 344 | 7394 if (k && !p0 && reslen < MAXWLEN && c != NUL |
| 7395 && (!slang->sl_collapse || reslen == 0 | |
| 7396 || res[reslen - 1] != c)) | |
| 323 | 7397 /* condense only double letters */ |
| 372 | 7398 res[reslen++] = c; |
| 323 | 7399 |
| 7400 i++; | |
| 7401 z = 0; | |
| 7402 k = 0; | |
| 7403 } | |
| 7404 } | |
| 7405 | |
| 344 | 7406 res[reslen] = NUL; |
| 323 | 7407 } |
| 7408 | |
| 372 | 7409 #ifdef FEAT_MBYTE |
| 7410 /* | |
| 7411 * Turn "inword" into its sound-a-like equivalent in "res[MAXWLEN]". | |
| 7412 * Multi-byte version of spell_soundfold(). | |
| 7413 */ | |
| 7414 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7415 spell_soundfold_wsal(slang_T *slang, char_u *inword, char_u *res) |
| 372 | 7416 { |
| 375 | 7417 salitem_T *smp = (salitem_T *)slang->sl_sal.ga_data; |
| 372 | 7418 int word[MAXWLEN]; |
| 7419 int wres[MAXWLEN]; | |
| 7420 int l; | |
| 7421 char_u *s; | |
| 7422 int *ws; | |
| 7423 char_u *t; | |
| 7424 int *pf; | |
| 7425 int i, j, z; | |
| 7426 int reslen; | |
| 7427 int n, k = 0; | |
| 7428 int z0; | |
| 7429 int k0; | |
| 7430 int n0; | |
| 7431 int c; | |
| 7432 int pri; | |
| 7433 int p0 = -333; | |
| 7434 int c0; | |
| 7435 int did_white = FALSE; | |
| 3520 | 7436 int wordlen; |
| 7437 | |
| 372 | 7438 |
| 7439 /* | |
| 7440 * Convert the multi-byte string to a wide-character string. | |
| 7441 * Remove accents, if wanted. We actually remove all non-word characters. | |
| 7442 * But keep white space. | |
| 7443 */ | |
| 3520 | 7444 wordlen = 0; |
| 372 | 7445 for (s = inword; *s != NUL; ) |
| 7446 { | |
| 7447 t = s; | |
| 474 | 7448 c = mb_cptr2char_adv(&s); |
| 372 | 7449 if (slang->sl_rem_accents) |
| 7450 { | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
7451 if (enc_utf8 ? utf_class(c) == 0 : VIM_ISWHITE(c)) |
| 372 | 7452 { |
| 7453 if (did_white) | |
| 7454 continue; | |
| 7455 c = ' '; | |
| 7456 did_white = TRUE; | |
| 7457 } | |
| 7458 else | |
| 7459 { | |
| 7460 did_white = FALSE; | |
| 5477 | 7461 if (!spell_iswordp_nmw(t, curwin)) |
| 372 | 7462 continue; |
| 7463 } | |
| 7464 } | |
| 3520 | 7465 word[wordlen++] = c; |
| 7466 } | |
| 7467 word[wordlen] = NUL; | |
| 372 | 7468 |
| 7469 /* | |
| 3520 | 7470 * This algorithm comes from Aspell phonet.cpp. |
| 372 | 7471 * Converted from C++ to C. Added support for multi-byte chars. |
| 7472 * Changed to keep spaces. | |
| 7473 */ | |
| 7474 i = reslen = z = 0; | |
| 7475 while ((c = word[i]) != NUL) | |
| 7476 { | |
| 7477 /* Start with the first rule that has the character in the word. */ | |
| 7478 n = slang->sl_sal_first[c & 0xff]; | |
| 7479 z0 = 0; | |
| 7480 | |
| 7481 if (n >= 0) | |
| 7482 { | |
|
2455
9367de3e2e1b
Fix: crash in spell checking with a 0x300 character.
Bram Moolenaar <bram@vim.org>
parents:
2454
diff
changeset
|
7483 /* Check all rules for the same index byte. |
|
9367de3e2e1b
Fix: crash in spell checking with a 0x300 character.
Bram Moolenaar <bram@vim.org>
parents:
2454
diff
changeset
|
7484 * If c is 0x300 need extra check for the end of the array, as |
|
9367de3e2e1b
Fix: crash in spell checking with a 0x300 character.
Bram Moolenaar <bram@vim.org>
parents:
2454
diff
changeset
|
7485 * (c & 0xff) is NUL. */ |
|
9367de3e2e1b
Fix: crash in spell checking with a 0x300 character.
Bram Moolenaar <bram@vim.org>
parents:
2454
diff
changeset
|
7486 for (; ((ws = smp[n].sm_lead_w)[0] & 0xff) == (c & 0xff) |
|
9367de3e2e1b
Fix: crash in spell checking with a 0x300 character.
Bram Moolenaar <bram@vim.org>
parents:
2454
diff
changeset
|
7487 && ws[0] != NUL; ++n) |
| 372 | 7488 { |
| 7489 /* Quickly skip entries that don't match the word. Most | |
| 7490 * entries are less then three chars, optimize for that. */ | |
| 375 | 7491 if (c != ws[0]) |
| 7492 continue; | |
| 372 | 7493 k = smp[n].sm_leadlen; |
| 7494 if (k > 1) | |
| 7495 { | |
| 7496 if (word[i + 1] != ws[1]) | |
| 7497 continue; | |
| 7498 if (k > 2) | |
| 7499 { | |
| 7500 for (j = 2; j < k; ++j) | |
| 7501 if (word[i + j] != ws[j]) | |
| 7502 break; | |
| 7503 if (j < k) | |
| 7504 continue; | |
| 7505 } | |
| 7506 } | |
| 7507 | |
| 375 | 7508 if ((pf = smp[n].sm_oneof_w) != NULL) |
| 372 | 7509 { |
| 375 | 7510 /* Check for match with one of the chars in "sm_oneof". */ |
| 372 | 7511 while (*pf != NUL && *pf != word[i + k]) |
| 7512 ++pf; | |
| 7513 if (*pf == NUL) | |
| 7514 continue; | |
| 7515 ++k; | |
| 7516 } | |
| 7517 s = smp[n].sm_rules; | |
| 7518 pri = 5; /* default priority */ | |
| 7519 | |
| 7520 p0 = *s; | |
| 7521 k0 = k; | |
| 7522 while (*s == '-' && k > 1) | |
| 7523 { | |
| 7524 k--; | |
| 7525 s++; | |
| 7526 } | |
| 7527 if (*s == '<') | |
| 7528 s++; | |
| 7529 if (VIM_ISDIGIT(*s)) | |
| 7530 { | |
| 7531 /* determine priority */ | |
| 7532 pri = *s - '0'; | |
| 7533 s++; | |
| 7534 } | |
| 7535 if (*s == '^' && *(s + 1) == '^') | |
| 7536 s++; | |
| 7537 | |
| 7538 if (*s == NUL | |
| 7539 || (*s == '^' | |
| 7540 && (i == 0 || !(word[i - 1] == ' ' | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7541 || spell_iswordp_w(word + i - 1, curwin))) |
| 372 | 7542 && (*(s + 1) != '$' |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7543 || (!spell_iswordp_w(word + i + k0, curwin)))) |
| 372 | 7544 || (*s == '$' && i > 0 |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7545 && spell_iswordp_w(word + i - 1, curwin) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7546 && (!spell_iswordp_w(word + i + k0, curwin)))) |
| 372 | 7547 { |
| 7548 /* search for followup rules, if: */ | |
| 7549 /* followup and k > 1 and NO '-' in searchstring */ | |
| 7550 c0 = word[i + k - 1]; | |
| 7551 n0 = slang->sl_sal_first[c0 & 0xff]; | |
| 7552 | |
| 7553 if (slang->sl_followup && k > 1 && n0 >= 0 | |
| 7554 && p0 != '-' && word[i + k] != NUL) | |
| 7555 { | |
| 375 | 7556 /* Test follow-up rule for "word[i + k]"; loop over |
| 7557 * all entries with the same index byte. */ | |
| 372 | 7558 for ( ; ((ws = smp[n0].sm_lead_w)[0] & 0xff) |
| 7559 == (c0 & 0xff); ++n0) | |
| 7560 { | |
| 7561 /* Quickly skip entries that don't match the word. | |
| 375 | 7562 */ |
| 7563 if (c0 != ws[0]) | |
| 7564 continue; | |
| 372 | 7565 k0 = smp[n0].sm_leadlen; |
| 7566 if (k0 > 1) | |
| 7567 { | |
| 7568 if (word[i + k] != ws[1]) | |
| 7569 continue; | |
| 7570 if (k0 > 2) | |
| 7571 { | |
| 7572 pf = word + i + k + 1; | |
| 7573 for (j = 2; j < k0; ++j) | |
| 7574 if (*pf++ != ws[j]) | |
| 7575 break; | |
| 7576 if (j < k0) | |
| 7577 continue; | |
| 7578 } | |
| 7579 } | |
| 7580 k0 += k - 1; | |
| 7581 | |
| 375 | 7582 if ((pf = smp[n0].sm_oneof_w) != NULL) |
| 372 | 7583 { |
| 7584 /* Check for match with one of the chars in | |
| 375 | 7585 * "sm_oneof". */ |
| 372 | 7586 while (*pf != NUL && *pf != word[i + k0]) |
| 7587 ++pf; | |
| 7588 if (*pf == NUL) | |
| 7589 continue; | |
| 7590 ++k0; | |
| 7591 } | |
| 7592 | |
| 7593 p0 = 5; | |
| 7594 s = smp[n0].sm_rules; | |
| 7595 while (*s == '-') | |
| 7596 { | |
| 7597 /* "k0" gets NOT reduced because | |
| 7598 * "if (k0 == k)" */ | |
| 7599 s++; | |
| 7600 } | |
| 7601 if (*s == '<') | |
| 7602 s++; | |
| 7603 if (VIM_ISDIGIT(*s)) | |
| 7604 { | |
| 7605 p0 = *s - '0'; | |
| 7606 s++; | |
| 7607 } | |
| 7608 | |
| 7609 if (*s == NUL | |
| 7610 /* *s == '^' cuts */ | |
| 7611 || (*s == '$' | |
| 376 | 7612 && !spell_iswordp_w(word + i + k0, |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7613 curwin))) |
| 372 | 7614 { |
| 7615 if (k0 == k) | |
| 7616 /* this is just a piece of the string */ | |
| 7617 continue; | |
| 7618 | |
| 7619 if (p0 < pri) | |
| 7620 /* priority too low */ | |
| 7621 continue; | |
| 7622 /* rule fits; stop search */ | |
| 7623 break; | |
| 7624 } | |
| 7625 } | |
| 7626 | |
| 7627 if (p0 >= pri && (smp[n0].sm_lead_w[0] & 0xff) | |
| 7628 == (c0 & 0xff)) | |
| 7629 continue; | |
| 7630 } | |
| 7631 | |
| 7632 /* replace string */ | |
| 7633 ws = smp[n].sm_to_w; | |
| 7634 s = smp[n].sm_rules; | |
| 7635 p0 = (vim_strchr(s, '<') != NULL) ? 1 : 0; | |
| 7636 if (p0 == 1 && z == 0) | |
| 7637 { | |
| 7638 /* rule with '<' is used */ | |
| 389 | 7639 if (reslen > 0 && ws != NULL && *ws != NUL |
| 7640 && (wres[reslen - 1] == c | |
| 372 | 7641 || wres[reslen - 1] == *ws)) |
| 7642 reslen--; | |
| 7643 z0 = 1; | |
| 7644 z = 1; | |
| 7645 k0 = 0; | |
| 389 | 7646 if (ws != NULL) |
| 7647 while (*ws != NUL && word[i + k0] != NUL) | |
| 7648 { | |
| 7649 word[i + k0] = *ws; | |
| 7650 k0++; | |
| 7651 ws++; | |
| 7652 } | |
| 372 | 7653 if (k > k0) |
| 7654 mch_memmove(word + i + k0, word + i + k, | |
| 3520 | 7655 sizeof(int) * (wordlen - (i + k) + 1)); |
| 372 | 7656 |
| 7657 /* new "actual letter" */ | |
| 7658 c = word[i]; | |
| 7659 } | |
| 7660 else | |
| 7661 { | |
| 7662 /* no '<' rule used */ | |
| 7663 i += k - 1; | |
| 7664 z = 0; | |
| 389 | 7665 if (ws != NULL) |
| 7666 while (*ws != NUL && ws[1] != NUL | |
| 7667 && reslen < MAXWLEN) | |
| 7668 { | |
| 7669 if (reslen == 0 || wres[reslen - 1] != *ws) | |
| 7670 wres[reslen++] = *ws; | |
| 7671 ws++; | |
| 7672 } | |
| 372 | 7673 /* new "actual letter" */ |
| 389 | 7674 if (ws == NULL) |
| 7675 c = NUL; | |
| 7676 else | |
| 7677 c = *ws; | |
| 372 | 7678 if (strstr((char *)s, "^^") != NULL) |
| 7679 { | |
| 7680 if (c != NUL) | |
| 7681 wres[reslen++] = c; | |
| 7682 mch_memmove(word, word + i + 1, | |
| 3520 | 7683 sizeof(int) * (wordlen - (i + 1) + 1)); |
| 372 | 7684 i = 0; |
| 7685 z0 = 1; | |
| 7686 } | |
| 7687 } | |
| 7688 break; | |
| 7689 } | |
| 7690 } | |
| 7691 } | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
7692 else if (VIM_ISWHITE(c)) |
| 372 | 7693 { |
| 7694 c = ' '; | |
| 7695 k = 1; | |
| 7696 } | |
| 7697 | |
| 7698 if (z0 == 0) | |
| 7699 { | |
| 7700 if (k && !p0 && reslen < MAXWLEN && c != NUL | |
| 7701 && (!slang->sl_collapse || reslen == 0 | |
| 7702 || wres[reslen - 1] != c)) | |
| 7703 /* condense only double letters */ | |
| 7704 wres[reslen++] = c; | |
| 7705 | |
| 7706 i++; | |
| 7707 z = 0; | |
| 7708 k = 0; | |
| 7709 } | |
| 7710 } | |
| 7711 | |
| 7712 /* Convert wide characters in "wres" to a multi-byte string in "res". */ | |
| 7713 l = 0; | |
| 7714 for (n = 0; n < reslen; ++n) | |
| 7715 { | |
| 7716 l += mb_char2bytes(wres[n], res + l); | |
| 7717 if (l + MB_MAXBYTES > MAXWLEN) | |
| 7718 break; | |
| 7719 } | |
| 7720 res[l] = NUL; | |
| 7721 } | |
| 7722 #endif | |
| 7723 | |
| 324 | 7724 /* |
| 344 | 7725 * Compute a score for two sound-a-like words. |
| 7726 * This permits up to two inserts/deletes/swaps/etc. to keep things fast. | |
| 7727 * Instead of a generic loop we write out the code. That keeps it fast by | |
| 7728 * avoiding checks that will not be possible. | |
| 7729 */ | |
| 7730 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7731 soundalike_score( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7732 char_u *goodstart, /* sound-folded good word */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7733 char_u *badstart) /* sound-folded bad word */ |
| 344 | 7734 { |
| 351 | 7735 char_u *goodsound = goodstart; |
| 7736 char_u *badsound = badstart; | |
| 7737 int goodlen; | |
| 7738 int badlen; | |
| 344 | 7739 int n; |
| 7740 char_u *pl, *ps; | |
| 7741 char_u *pl2, *ps2; | |
| 351 | 7742 int score = 0; |
| 7743 | |
|
2454
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7744 /* Adding/inserting "*" at the start (word starts with vowel) shouldn't be |
| 351 | 7745 * counted so much, vowels halfway the word aren't counted at all. */ |
| 7746 if ((*badsound == '*' || *goodsound == '*') && *badsound != *goodsound) | |
| 7747 { | |
|
2454
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7748 if ((badsound[0] == NUL && goodsound[1] == NUL) |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7749 || (goodsound[0] == NUL && badsound[1] == NUL)) |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7750 /* changing word with vowel to word without a sound */ |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7751 return SCORE_DEL; |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7752 if (badsound[0] == NUL || goodsound[0] == NUL) |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7753 /* more than two changes */ |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7754 return SCORE_MAXMAX; |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7755 |
| 625 | 7756 if (badsound[1] == goodsound[1] |
| 7757 || (badsound[1] != NUL | |
| 7758 && goodsound[1] != NUL | |
| 7759 && badsound[2] == goodsound[2])) | |
| 7760 { | |
| 7761 /* handle like a substitute */ | |
| 7762 } | |
| 351 | 7763 else |
| 625 | 7764 { |
| 7765 score = 2 * SCORE_DEL / 3; | |
| 7766 if (*badsound == '*') | |
| 7767 ++badsound; | |
| 7768 else | |
| 7769 ++goodsound; | |
| 7770 } | |
| 351 | 7771 } |
| 7772 | |
| 835 | 7773 goodlen = (int)STRLEN(goodsound); |
| 7774 badlen = (int)STRLEN(badsound); | |
| 344 | 7775 |
| 1188 | 7776 /* Return quickly if the lengths are too different to be fixed by two |
| 344 | 7777 * changes. */ |
| 7778 n = goodlen - badlen; | |
| 7779 if (n < -2 || n > 2) | |
| 7780 return SCORE_MAXMAX; | |
| 7781 | |
| 7782 if (n > 0) | |
| 7783 { | |
| 351 | 7784 pl = goodsound; /* goodsound is longest */ |
| 344 | 7785 ps = badsound; |
| 7786 } | |
| 7787 else | |
| 7788 { | |
| 351 | 7789 pl = badsound; /* badsound is longest */ |
| 344 | 7790 ps = goodsound; |
| 7791 } | |
| 7792 | |
| 7793 /* Skip over the identical part. */ | |
| 7794 while (*pl == *ps && *pl != NUL) | |
| 7795 { | |
| 7796 ++pl; | |
| 7797 ++ps; | |
| 7798 } | |
| 7799 | |
| 7800 switch (n) | |
| 7801 { | |
| 7802 case -2: | |
| 7803 case 2: | |
| 7804 /* | |
| 7805 * Must delete two characters from "pl". | |
| 7806 */ | |
| 7807 ++pl; /* first delete */ | |
| 7808 while (*pl == *ps) | |
| 7809 { | |
| 7810 ++pl; | |
| 7811 ++ps; | |
| 7812 } | |
| 7813 /* strings must be equal after second delete */ | |
| 7814 if (STRCMP(pl + 1, ps) == 0) | |
| 351 | 7815 return score + SCORE_DEL * 2; |
| 344 | 7816 |
| 7817 /* Failed to compare. */ | |
| 7818 break; | |
| 7819 | |
| 7820 case -1: | |
| 7821 case 1: | |
| 7822 /* | |
| 7823 * Minimal one delete from "pl" required. | |
| 7824 */ | |
| 7825 | |
| 7826 /* 1: delete */ | |
| 7827 pl2 = pl + 1; | |
| 7828 ps2 = ps; | |
| 7829 while (*pl2 == *ps2) | |
| 7830 { | |
| 7831 if (*pl2 == NUL) /* reached the end */ | |
| 351 | 7832 return score + SCORE_DEL; |
| 344 | 7833 ++pl2; |
| 7834 ++ps2; | |
| 7835 } | |
| 7836 | |
| 7837 /* 2: delete then swap, then rest must be equal */ | |
| 7838 if (pl2[0] == ps2[1] && pl2[1] == ps2[0] | |
| 7839 && STRCMP(pl2 + 2, ps2 + 2) == 0) | |
| 351 | 7840 return score + SCORE_DEL + SCORE_SWAP; |
| 344 | 7841 |
| 7842 /* 3: delete then substitute, then the rest must be equal */ | |
| 7843 if (STRCMP(pl2 + 1, ps2 + 1) == 0) | |
| 351 | 7844 return score + SCORE_DEL + SCORE_SUBST; |
| 344 | 7845 |
| 7846 /* 4: first swap then delete */ | |
| 7847 if (pl[0] == ps[1] && pl[1] == ps[0]) | |
| 7848 { | |
| 7849 pl2 = pl + 2; /* swap, skip two chars */ | |
| 7850 ps2 = ps + 2; | |
| 7851 while (*pl2 == *ps2) | |
| 7852 { | |
| 7853 ++pl2; | |
| 7854 ++ps2; | |
| 7855 } | |
| 7856 /* delete a char and then strings must be equal */ | |
| 7857 if (STRCMP(pl2 + 1, ps2) == 0) | |
| 351 | 7858 return score + SCORE_SWAP + SCORE_DEL; |
| 344 | 7859 } |
| 7860 | |
| 7861 /* 5: first substitute then delete */ | |
| 7862 pl2 = pl + 1; /* substitute, skip one char */ | |
| 7863 ps2 = ps + 1; | |
| 7864 while (*pl2 == *ps2) | |
| 7865 { | |
| 7866 ++pl2; | |
| 7867 ++ps2; | |
| 7868 } | |
| 7869 /* delete a char and then strings must be equal */ | |
| 7870 if (STRCMP(pl2 + 1, ps2) == 0) | |
| 351 | 7871 return score + SCORE_SUBST + SCORE_DEL; |
| 344 | 7872 |
| 7873 /* Failed to compare. */ | |
| 7874 break; | |
| 7875 | |
| 7876 case 0: | |
| 7877 /* | |
| 1808 | 7878 * Lengths are equal, thus changes must result in same length: An |
| 344 | 7879 * insert is only possible in combination with a delete. |
| 7880 * 1: check if for identical strings | |
| 7881 */ | |
| 7882 if (*pl == NUL) | |
| 351 | 7883 return score; |
| 344 | 7884 |
| 7885 /* 2: swap */ | |
| 7886 if (pl[0] == ps[1] && pl[1] == ps[0]) | |
| 7887 { | |
| 7888 pl2 = pl + 2; /* swap, skip two chars */ | |
| 7889 ps2 = ps + 2; | |
| 7890 while (*pl2 == *ps2) | |
| 7891 { | |
| 7892 if (*pl2 == NUL) /* reached the end */ | |
| 351 | 7893 return score + SCORE_SWAP; |
| 344 | 7894 ++pl2; |
| 7895 ++ps2; | |
| 7896 } | |
| 7897 /* 3: swap and swap again */ | |
| 7898 if (pl2[0] == ps2[1] && pl2[1] == ps2[0] | |
| 7899 && STRCMP(pl2 + 2, ps2 + 2) == 0) | |
| 351 | 7900 return score + SCORE_SWAP + SCORE_SWAP; |
| 344 | 7901 |
| 7902 /* 4: swap and substitute */ | |
| 7903 if (STRCMP(pl2 + 1, ps2 + 1) == 0) | |
| 351 | 7904 return score + SCORE_SWAP + SCORE_SUBST; |
| 344 | 7905 } |
| 7906 | |
| 7907 /* 5: substitute */ | |
| 7908 pl2 = pl + 1; | |
| 7909 ps2 = ps + 1; | |
| 7910 while (*pl2 == *ps2) | |
| 7911 { | |
| 7912 if (*pl2 == NUL) /* reached the end */ | |
| 351 | 7913 return score + SCORE_SUBST; |
| 344 | 7914 ++pl2; |
| 7915 ++ps2; | |
| 7916 } | |
| 7917 | |
| 7918 /* 6: substitute and swap */ | |
| 7919 if (pl2[0] == ps2[1] && pl2[1] == ps2[0] | |
| 7920 && STRCMP(pl2 + 2, ps2 + 2) == 0) | |
| 351 | 7921 return score + SCORE_SUBST + SCORE_SWAP; |
| 344 | 7922 |
| 7923 /* 7: substitute and substitute */ | |
| 7924 if (STRCMP(pl2 + 1, ps2 + 1) == 0) | |
| 351 | 7925 return score + SCORE_SUBST + SCORE_SUBST; |
| 344 | 7926 |
| 7927 /* 8: insert then delete */ | |
| 7928 pl2 = pl; | |
| 7929 ps2 = ps + 1; | |
| 7930 while (*pl2 == *ps2) | |
| 7931 { | |
| 7932 ++pl2; | |
| 7933 ++ps2; | |
| 7934 } | |
| 7935 if (STRCMP(pl2 + 1, ps2) == 0) | |
| 351 | 7936 return score + SCORE_INS + SCORE_DEL; |
| 344 | 7937 |
| 7938 /* 9: delete then insert */ | |
| 7939 pl2 = pl + 1; | |
| 7940 ps2 = ps; | |
| 7941 while (*pl2 == *ps2) | |
| 7942 { | |
| 7943 ++pl2; | |
| 7944 ++ps2; | |
| 7945 } | |
| 7946 if (STRCMP(pl2, ps2 + 1) == 0) | |
| 351 | 7947 return score + SCORE_INS + SCORE_DEL; |
| 344 | 7948 |
| 7949 /* Failed to compare. */ | |
| 7950 break; | |
| 7951 } | |
| 7952 | |
| 7953 return SCORE_MAXMAX; | |
| 7954 } | |
| 324 | 7955 |
| 323 | 7956 /* |
| 7957 * Compute the "edit distance" to turn "badword" into "goodword". The less | |
| 344 | 7958 * deletes/inserts/substitutes/swaps are required the lower the score. |
| 324 | 7959 * |
| 485 | 7960 * The algorithm is described by Du and Chang, 1992. |
| 7961 * The implementation of the algorithm comes from Aspell editdist.cpp, | |
| 7962 * edit_distance(). It has been converted from C++ to C and modified to | |
| 7963 * support multi-byte characters. | |
| 323 | 7964 */ |
| 7965 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7966 spell_edit_score( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7967 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7968 char_u *badword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7969 char_u *goodword) |
| 323 | 7970 { |
| 7971 int *cnt; | |
| 1188 | 7972 int badlen, goodlen; /* lengths including NUL */ |
| 323 | 7973 int j, i; |
| 7974 int t; | |
| 7975 int bc, gc; | |
| 324 | 7976 int pbc, pgc; |
| 7977 #ifdef FEAT_MBYTE | |
| 7978 char_u *p; | |
| 7979 int wbadword[MAXWLEN]; | |
| 7980 int wgoodword[MAXWLEN]; | |
| 7981 | |
| 7982 if (has_mbyte) | |
| 7983 { | |
| 7984 /* Get the characters from the multi-byte strings and put them in an | |
| 7985 * int array for easy access. */ | |
| 7986 for (p = badword, badlen = 0; *p != NUL; ) | |
| 474 | 7987 wbadword[badlen++] = mb_cptr2char_adv(&p); |
| 398 | 7988 wbadword[badlen++] = 0; |
| 324 | 7989 for (p = goodword, goodlen = 0; *p != NUL; ) |
| 474 | 7990 wgoodword[goodlen++] = mb_cptr2char_adv(&p); |
| 398 | 7991 wgoodword[goodlen++] = 0; |
| 324 | 7992 } |
| 7993 else | |
| 7994 #endif | |
| 7995 { | |
| 835 | 7996 badlen = (int)STRLEN(badword) + 1; |
| 7997 goodlen = (int)STRLEN(goodword) + 1; | |
| 324 | 7998 } |
| 323 | 7999 |
| 8000 /* We use "cnt" as an array: CNT(badword_idx, goodword_idx). */ | |
| 8001 #define CNT(a, b) cnt[(a) + (b) * (badlen + 1)] | |
| 8002 cnt = (int *)lalloc((long_u)(sizeof(int) * (badlen + 1) * (goodlen + 1)), | |
| 8003 TRUE); | |
| 324 | 8004 if (cnt == NULL) |
| 8005 return 0; /* out of memory */ | |
| 323 | 8006 |
| 8007 CNT(0, 0) = 0; | |
| 8008 for (j = 1; j <= goodlen; ++j) | |
| 625 | 8009 CNT(0, j) = CNT(0, j - 1) + SCORE_INS; |
| 323 | 8010 |
| 8011 for (i = 1; i <= badlen; ++i) | |
| 8012 { | |
| 625 | 8013 CNT(i, 0) = CNT(i - 1, 0) + SCORE_DEL; |
| 323 | 8014 for (j = 1; j <= goodlen; ++j) |
| 8015 { | |
| 324 | 8016 #ifdef FEAT_MBYTE |
| 8017 if (has_mbyte) | |
| 8018 { | |
| 8019 bc = wbadword[i - 1]; | |
| 8020 gc = wgoodword[j - 1]; | |
| 8021 } | |
| 8022 else | |
| 8023 #endif | |
| 8024 { | |
| 8025 bc = badword[i - 1]; | |
| 8026 gc = goodword[j - 1]; | |
| 8027 } | |
| 323 | 8028 if (bc == gc) |
| 8029 CNT(i, j) = CNT(i - 1, j - 1); | |
| 8030 else | |
| 8031 { | |
| 8032 /* Use a better score when there is only a case difference. */ | |
| 324 | 8033 if (SPELL_TOFOLD(bc) == SPELL_TOFOLD(gc)) |
| 323 | 8034 CNT(i, j) = SCORE_ICASE + CNT(i - 1, j - 1); |
| 8035 else | |
| 625 | 8036 { |
| 8037 /* For a similar character use SCORE_SIMILAR. */ | |
| 8038 if (slang != NULL | |
| 8039 && slang->sl_has_map | |
| 8040 && similar_chars(slang, gc, bc)) | |
| 8041 CNT(i, j) = SCORE_SIMILAR + CNT(i - 1, j - 1); | |
| 8042 else | |
| 8043 CNT(i, j) = SCORE_SUBST + CNT(i - 1, j - 1); | |
| 8044 } | |
| 323 | 8045 |
| 324 | 8046 if (i > 1 && j > 1) |
| 323 | 8047 { |
| 324 | 8048 #ifdef FEAT_MBYTE |
| 8049 if (has_mbyte) | |
| 8050 { | |
| 8051 pbc = wbadword[i - 2]; | |
| 8052 pgc = wgoodword[j - 2]; | |
| 8053 } | |
| 8054 else | |
| 8055 #endif | |
| 8056 { | |
| 8057 pbc = badword[i - 2]; | |
| 8058 pgc = goodword[j - 2]; | |
| 8059 } | |
| 8060 if (bc == pgc && pbc == gc) | |
| 8061 { | |
| 8062 t = SCORE_SWAP + CNT(i - 2, j - 2); | |
| 8063 if (t < CNT(i, j)) | |
| 8064 CNT(i, j) = t; | |
| 8065 } | |
| 323 | 8066 } |
| 8067 t = SCORE_DEL + CNT(i - 1, j); | |
| 8068 if (t < CNT(i, j)) | |
| 8069 CNT(i, j) = t; | |
| 8070 t = SCORE_INS + CNT(i, j - 1); | |
| 8071 if (t < CNT(i, j)) | |
| 8072 CNT(i, j) = t; | |
| 8073 } | |
| 8074 } | |
| 8075 } | |
| 344 | 8076 |
| 8077 i = CNT(badlen - 1, goodlen - 1); | |
| 8078 vim_free(cnt); | |
| 8079 return i; | |
| 323 | 8080 } |
| 307 | 8081 |
| 625 | 8082 typedef struct |
| 8083 { | |
| 8084 int badi; | |
| 8085 int goodi; | |
| 8086 int score; | |
| 8087 } limitscore_T; | |
| 8088 | |
| 8089 /* | |
| 8090 * Like spell_edit_score(), but with a limit on the score to make it faster. | |
| 8091 * May return SCORE_MAXMAX when the score is higher than "limit". | |
| 8092 * | |
| 8093 * This uses a stack for the edits still to be tried. | |
| 8094 * The idea comes from Aspell leditdist.cpp. Rewritten in C and added support | |
| 8095 * for multi-byte characters. | |
| 8096 */ | |
| 8097 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8098 spell_edit_score_limit( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8099 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8100 char_u *badword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8101 char_u *goodword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8102 int limit) |
| 625 | 8103 { |
| 8104 limitscore_T stack[10]; /* allow for over 3 * 2 edits */ | |
| 8105 int stackidx; | |
| 8106 int bi, gi; | |
| 8107 int bi2, gi2; | |
| 8108 int bc, gc; | |
| 8109 int score; | |
| 8110 int score_off; | |
| 8111 int minscore; | |
| 8112 int round; | |
| 8113 | |
| 8114 #ifdef FEAT_MBYTE | |
| 8115 /* Multi-byte characters require a bit more work, use a different function | |
| 8116 * to avoid testing "has_mbyte" quite often. */ | |
| 8117 if (has_mbyte) | |
| 8118 return spell_edit_score_limit_w(slang, badword, goodword, limit); | |
| 8119 #endif | |
| 8120 | |
| 8121 /* | |
| 8122 * The idea is to go from start to end over the words. So long as | |
| 8123 * characters are equal just continue, this always gives the lowest score. | |
| 8124 * When there is a difference try several alternatives. Each alternative | |
| 8125 * increases "score" for the edit distance. Some of the alternatives are | |
| 8126 * pushed unto a stack and tried later, some are tried right away. At the | |
| 8127 * end of the word the score for one alternative is known. The lowest | |
| 8128 * possible score is stored in "minscore". | |
| 8129 */ | |
| 8130 stackidx = 0; | |
| 8131 bi = 0; | |
| 8132 gi = 0; | |
| 8133 score = 0; | |
| 8134 minscore = limit + 1; | |
| 8135 | |
| 8136 for (;;) | |
| 8137 { | |
| 8138 /* Skip over an equal part, score remains the same. */ | |
| 8139 for (;;) | |
| 8140 { | |
| 8141 bc = badword[bi]; | |
| 8142 gc = goodword[gi]; | |
| 8143 if (bc != gc) /* stop at a char that's different */ | |
| 8144 break; | |
| 8145 if (bc == NUL) /* both words end */ | |
| 8146 { | |
| 8147 if (score < minscore) | |
| 8148 minscore = score; | |
| 8149 goto pop; /* do next alternative */ | |
| 8150 } | |
| 8151 ++bi; | |
| 8152 ++gi; | |
| 8153 } | |
| 8154 | |
| 8155 if (gc == NUL) /* goodword ends, delete badword chars */ | |
| 8156 { | |
| 8157 do | |
| 8158 { | |
| 8159 if ((score += SCORE_DEL) >= minscore) | |
| 8160 goto pop; /* do next alternative */ | |
| 8161 } while (badword[++bi] != NUL); | |
| 8162 minscore = score; | |
| 8163 } | |
| 8164 else if (bc == NUL) /* badword ends, insert badword chars */ | |
| 8165 { | |
| 8166 do | |
| 8167 { | |
| 8168 if ((score += SCORE_INS) >= minscore) | |
| 8169 goto pop; /* do next alternative */ | |
| 8170 } while (goodword[++gi] != NUL); | |
| 8171 minscore = score; | |
| 8172 } | |
| 8173 else /* both words continue */ | |
| 8174 { | |
| 8175 /* If not close to the limit, perform a change. Only try changes | |
| 8176 * that may lead to a lower score than "minscore". | |
| 8177 * round 0: try deleting a char from badword | |
| 8178 * round 1: try inserting a char in badword */ | |
| 8179 for (round = 0; round <= 1; ++round) | |
| 8180 { | |
| 8181 score_off = score + (round == 0 ? SCORE_DEL : SCORE_INS); | |
| 8182 if (score_off < minscore) | |
| 8183 { | |
| 8184 if (score_off + SCORE_EDIT_MIN >= minscore) | |
| 8185 { | |
| 8186 /* Near the limit, rest of the words must match. We | |
| 8187 * can check that right now, no need to push an item | |
| 8188 * onto the stack. */ | |
| 8189 bi2 = bi + 1 - round; | |
| 8190 gi2 = gi + round; | |
| 8191 while (goodword[gi2] == badword[bi2]) | |
| 8192 { | |
| 8193 if (goodword[gi2] == NUL) | |
| 8194 { | |
| 8195 minscore = score_off; | |
| 8196 break; | |
| 8197 } | |
| 8198 ++bi2; | |
| 8199 ++gi2; | |
| 8200 } | |
| 8201 } | |
| 8202 else | |
| 8203 { | |
| 8204 /* try deleting/inserting a character later */ | |
| 8205 stack[stackidx].badi = bi + 1 - round; | |
| 8206 stack[stackidx].goodi = gi + round; | |
| 8207 stack[stackidx].score = score_off; | |
| 8208 ++stackidx; | |
| 8209 } | |
| 8210 } | |
| 8211 } | |
| 8212 | |
| 8213 if (score + SCORE_SWAP < minscore) | |
| 8214 { | |
| 8215 /* If swapping two characters makes a match then the | |
| 8216 * substitution is more expensive, thus there is no need to | |
| 8217 * try both. */ | |
| 8218 if (gc == badword[bi + 1] && bc == goodword[gi + 1]) | |
| 8219 { | |
| 8220 /* Swap two characters, that is: skip them. */ | |
| 8221 gi += 2; | |
| 8222 bi += 2; | |
| 8223 score += SCORE_SWAP; | |
| 8224 continue; | |
| 8225 } | |
| 8226 } | |
| 8227 | |
| 8228 /* Substitute one character for another which is the same | |
| 8229 * thing as deleting a character from both goodword and badword. | |
| 8230 * Use a better score when there is only a case difference. */ | |
| 8231 if (SPELL_TOFOLD(bc) == SPELL_TOFOLD(gc)) | |
| 8232 score += SCORE_ICASE; | |
| 8233 else | |
| 8234 { | |
| 8235 /* For a similar character use SCORE_SIMILAR. */ | |
| 8236 if (slang != NULL | |
| 8237 && slang->sl_has_map | |
| 8238 && similar_chars(slang, gc, bc)) | |
| 8239 score += SCORE_SIMILAR; | |
| 8240 else | |
| 8241 score += SCORE_SUBST; | |
| 8242 } | |
| 8243 | |
| 8244 if (score < minscore) | |
| 8245 { | |
| 8246 /* Do the substitution. */ | |
| 8247 ++gi; | |
| 8248 ++bi; | |
| 8249 continue; | |
| 8250 } | |
| 8251 } | |
| 8252 pop: | |
| 8253 /* | |
| 8254 * Get here to try the next alternative, pop it from the stack. | |
| 8255 */ | |
| 8256 if (stackidx == 0) /* stack is empty, finished */ | |
| 8257 break; | |
| 8258 | |
| 8259 /* pop an item from the stack */ | |
| 8260 --stackidx; | |
| 8261 gi = stack[stackidx].goodi; | |
| 8262 bi = stack[stackidx].badi; | |
| 8263 score = stack[stackidx].score; | |
| 8264 } | |
| 8265 | |
| 8266 /* When the score goes over "limit" it may actually be much higher. | |
| 8267 * Return a very large number to avoid going below the limit when giving a | |
| 8268 * bonus. */ | |
| 8269 if (minscore > limit) | |
| 8270 return SCORE_MAXMAX; | |
| 8271 return minscore; | |
| 8272 } | |
| 8273 | |
| 8274 #ifdef FEAT_MBYTE | |
| 8275 /* | |
| 8276 * Multi-byte version of spell_edit_score_limit(). | |
| 8277 * Keep it in sync with the above! | |
| 8278 */ | |
| 8279 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8280 spell_edit_score_limit_w( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8281 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8282 char_u *badword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8283 char_u *goodword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8284 int limit) |
| 625 | 8285 { |
| 8286 limitscore_T stack[10]; /* allow for over 3 * 2 edits */ | |
| 8287 int stackidx; | |
| 8288 int bi, gi; | |
| 8289 int bi2, gi2; | |
| 8290 int bc, gc; | |
| 8291 int score; | |
| 8292 int score_off; | |
| 8293 int minscore; | |
| 8294 int round; | |
| 8295 char_u *p; | |
| 8296 int wbadword[MAXWLEN]; | |
| 8297 int wgoodword[MAXWLEN]; | |
| 8298 | |
| 8299 /* Get the characters from the multi-byte strings and put them in an | |
| 8300 * int array for easy access. */ | |
| 8301 bi = 0; | |
| 8302 for (p = badword; *p != NUL; ) | |
| 8303 wbadword[bi++] = mb_cptr2char_adv(&p); | |
| 8304 wbadword[bi++] = 0; | |
| 8305 gi = 0; | |
| 8306 for (p = goodword; *p != NUL; ) | |
| 8307 wgoodword[gi++] = mb_cptr2char_adv(&p); | |
| 8308 wgoodword[gi++] = 0; | |
| 8309 | |
| 8310 /* | |
| 8311 * The idea is to go from start to end over the words. So long as | |
| 8312 * characters are equal just continue, this always gives the lowest score. | |
| 8313 * When there is a difference try several alternatives. Each alternative | |
| 8314 * increases "score" for the edit distance. Some of the alternatives are | |
| 8315 * pushed unto a stack and tried later, some are tried right away. At the | |
| 8316 * end of the word the score for one alternative is known. The lowest | |
| 8317 * possible score is stored in "minscore". | |
| 8318 */ | |
| 8319 stackidx = 0; | |
| 8320 bi = 0; | |
| 8321 gi = 0; | |
| 8322 score = 0; | |
| 8323 minscore = limit + 1; | |
| 8324 | |
| 8325 for (;;) | |
| 8326 { | |
| 8327 /* Skip over an equal part, score remains the same. */ | |
| 8328 for (;;) | |
| 8329 { | |
| 8330 bc = wbadword[bi]; | |
| 8331 gc = wgoodword[gi]; | |
| 8332 | |
| 8333 if (bc != gc) /* stop at a char that's different */ | |
| 8334 break; | |
| 8335 if (bc == NUL) /* both words end */ | |
| 8336 { | |
| 8337 if (score < minscore) | |
| 8338 minscore = score; | |
| 8339 goto pop; /* do next alternative */ | |
| 8340 } | |
| 8341 ++bi; | |
| 8342 ++gi; | |
| 8343 } | |
| 8344 | |
| 8345 if (gc == NUL) /* goodword ends, delete badword chars */ | |
| 8346 { | |
| 8347 do | |
| 8348 { | |
| 8349 if ((score += SCORE_DEL) >= minscore) | |
| 8350 goto pop; /* do next alternative */ | |
| 8351 } while (wbadword[++bi] != NUL); | |
| 8352 minscore = score; | |
| 8353 } | |
| 8354 else if (bc == NUL) /* badword ends, insert badword chars */ | |
| 8355 { | |
| 8356 do | |
| 8357 { | |
| 8358 if ((score += SCORE_INS) >= minscore) | |
| 8359 goto pop; /* do next alternative */ | |
| 8360 } while (wgoodword[++gi] != NUL); | |
| 8361 minscore = score; | |
| 8362 } | |
| 8363 else /* both words continue */ | |
| 8364 { | |
| 8365 /* If not close to the limit, perform a change. Only try changes | |
| 8366 * that may lead to a lower score than "minscore". | |
| 8367 * round 0: try deleting a char from badword | |
| 8368 * round 1: try inserting a char in badword */ | |
| 8369 for (round = 0; round <= 1; ++round) | |
| 8370 { | |
| 8371 score_off = score + (round == 0 ? SCORE_DEL : SCORE_INS); | |
| 8372 if (score_off < minscore) | |
| 8373 { | |
| 8374 if (score_off + SCORE_EDIT_MIN >= minscore) | |
| 8375 { | |
| 8376 /* Near the limit, rest of the words must match. We | |
| 8377 * can check that right now, no need to push an item | |
| 8378 * onto the stack. */ | |
| 8379 bi2 = bi + 1 - round; | |
| 8380 gi2 = gi + round; | |
| 8381 while (wgoodword[gi2] == wbadword[bi2]) | |
| 8382 { | |
| 8383 if (wgoodword[gi2] == NUL) | |
| 8384 { | |
| 8385 minscore = score_off; | |
| 8386 break; | |
| 8387 } | |
| 8388 ++bi2; | |
| 8389 ++gi2; | |
| 8390 } | |
| 8391 } | |
| 8392 else | |
| 8393 { | |
| 8394 /* try deleting a character from badword later */ | |
| 8395 stack[stackidx].badi = bi + 1 - round; | |
| 8396 stack[stackidx].goodi = gi + round; | |
| 8397 stack[stackidx].score = score_off; | |
| 8398 ++stackidx; | |
| 8399 } | |
| 8400 } | |
| 8401 } | |
| 8402 | |
| 8403 if (score + SCORE_SWAP < minscore) | |
| 8404 { | |
| 8405 /* If swapping two characters makes a match then the | |
| 8406 * substitution is more expensive, thus there is no need to | |
| 8407 * try both. */ | |
| 8408 if (gc == wbadword[bi + 1] && bc == wgoodword[gi + 1]) | |
| 8409 { | |
| 8410 /* Swap two characters, that is: skip them. */ | |
| 8411 gi += 2; | |
| 8412 bi += 2; | |
| 8413 score += SCORE_SWAP; | |
| 8414 continue; | |
| 8415 } | |
| 8416 } | |
| 8417 | |
| 8418 /* Substitute one character for another which is the same | |
| 8419 * thing as deleting a character from both goodword and badword. | |
| 8420 * Use a better score when there is only a case difference. */ | |
| 8421 if (SPELL_TOFOLD(bc) == SPELL_TOFOLD(gc)) | |
| 8422 score += SCORE_ICASE; | |
| 8423 else | |
| 8424 { | |
| 8425 /* For a similar character use SCORE_SIMILAR. */ | |
| 8426 if (slang != NULL | |
| 8427 && slang->sl_has_map | |
| 8428 && similar_chars(slang, gc, bc)) | |
| 8429 score += SCORE_SIMILAR; | |
| 8430 else | |
| 8431 score += SCORE_SUBST; | |
| 8432 } | |
| 8433 | |
| 8434 if (score < minscore) | |
| 8435 { | |
| 8436 /* Do the substitution. */ | |
| 8437 ++gi; | |
| 8438 ++bi; | |
| 8439 continue; | |
| 8440 } | |
| 8441 } | |
| 8442 pop: | |
| 8443 /* | |
| 8444 * Get here to try the next alternative, pop it from the stack. | |
| 8445 */ | |
| 8446 if (stackidx == 0) /* stack is empty, finished */ | |
| 8447 break; | |
| 8448 | |
| 8449 /* pop an item from the stack */ | |
| 8450 --stackidx; | |
| 8451 gi = stack[stackidx].goodi; | |
| 8452 bi = stack[stackidx].badi; | |
| 8453 score = stack[stackidx].score; | |
| 8454 } | |
| 8455 | |
| 8456 /* When the score goes over "limit" it may actually be much higher. | |
| 8457 * Return a very large number to avoid going below the limit when giving a | |
| 8458 * bonus. */ | |
| 8459 if (minscore > limit) | |
| 8460 return SCORE_MAXMAX; | |
| 8461 return minscore; | |
| 8462 } | |
| 8463 #endif | |
| 8464 | |
| 714 | 8465 /* |
| 8466 * ":spellinfo" | |
| 8467 */ | |
| 8468 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8469 ex_spellinfo(exarg_T *eap UNUSED) |
| 714 | 8470 { |
| 8471 int lpi; | |
| 8472 langp_T *lp; | |
| 8473 char_u *p; | |
| 8474 | |
| 8475 if (no_spell_checking(curwin)) | |
| 8476 return; | |
| 8477 | |
| 8478 msg_start(); | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8479 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len && !got_int; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8480 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8481 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 714 | 8482 msg_puts((char_u *)"file: "); |
| 8483 msg_puts(lp->lp_slang->sl_fname); | |
| 8484 msg_putchar('\n'); | |
| 8485 p = lp->lp_slang->sl_info; | |
| 8486 if (p != NULL) | |
| 8487 { | |
| 8488 msg_puts(p); | |
| 8489 msg_putchar('\n'); | |
| 8490 } | |
| 8491 } | |
| 8492 msg_end(); | |
| 8493 } | |
| 8494 | |
| 625 | 8495 #define DUMPFLAG_KEEPCASE 1 /* round 2: keep-case tree */ |
| 8496 #define DUMPFLAG_COUNT 2 /* include word count */ | |
| 701 | 8497 #define DUMPFLAG_ICASE 4 /* ignore case when finding matches */ |
| 710 | 8498 #define DUMPFLAG_ONECAP 8 /* pattern starts with capital */ |
| 8499 #define DUMPFLAG_ALLCAP 16 /* pattern is all capitals */ | |
| 625 | 8500 |
| 351 | 8501 /* |
| 8502 * ":spelldump" | |
| 8503 */ | |
| 8504 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8505 ex_spelldump(exarg_T *eap) |
| 351 | 8506 { |
| 5382 | 8507 char_u *spl; |
| 8508 long dummy; | |
| 8509 | |
| 701 | 8510 if (no_spell_checking(curwin)) |
| 8511 return; | |
| 5382 | 8512 get_option_value((char_u*)"spl", &dummy, &spl, OPT_LOCAL); |
| 8513 | |
| 8514 /* Create a new empty buffer in a new window. */ | |
| 701 | 8515 do_cmdline_cmd((char_u *)"new"); |
| 5382 | 8516 |
| 8517 /* enable spelling locally in the new window */ | |
| 8518 set_option_value((char_u*)"spell", TRUE, (char_u*)"", OPT_LOCAL); | |
|
7447
ad432f8f68fb
commit https://github.com/vim/vim/commit/887c1fea4a114e7170091942d0446c8882701b5b
Christian Brabandt <cb@256bit.org>
parents:
6949
diff
changeset
|
8519 set_option_value((char_u*)"spl", dummy, spl, OPT_LOCAL); |
| 5382 | 8520 vim_free(spl); |
| 8521 | |
|
11121
778c10516955
patch 8.0.0448: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
10950
diff
changeset
|
8522 if (!BUFEMPTY()) |
| 701 | 8523 return; |
| 8524 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8525 spell_dump_compl(NULL, 0, NULL, eap->forceit ? DUMPFLAG_COUNT : 0); |
| 701 | 8526 |
| 8527 /* Delete the empty line that we started with. */ | |
| 8528 if (curbuf->b_ml.ml_line_count > 1) | |
| 8529 ml_delete(curbuf->b_ml.ml_line_count, FALSE); | |
| 8530 | |
| 8531 redraw_later(NOT_VALID); | |
| 8532 } | |
| 8533 | |
| 8534 /* | |
| 8535 * Go through all possible words and: | |
| 8536 * 1. When "pat" is NULL: dump a list of all words in the current buffer. | |
| 8537 * "ic" and "dir" are not used. | |
| 8538 * 2. When "pat" is not NULL: add matching words to insert mode completion. | |
| 8539 */ | |
| 8540 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8541 spell_dump_compl( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8542 char_u *pat, /* leading part of the word */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8543 int ic, /* ignore case */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8544 int *dir, /* direction for adding matches */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8545 int dumpflags_arg) /* DUMPFLAG_* */ |
| 701 | 8546 { |
| 351 | 8547 langp_T *lp; |
| 8548 slang_T *slang; | |
| 8549 idx_T arridx[MAXWLEN]; | |
| 8550 int curi[MAXWLEN]; | |
| 8551 char_u word[MAXWLEN]; | |
| 8552 int c; | |
| 8553 char_u *byts; | |
| 8554 idx_T *idxs; | |
| 8555 linenr_T lnum = 0; | |
| 8556 int round; | |
| 8557 int depth; | |
| 8558 int n; | |
| 8559 int flags; | |
| 381 | 8560 char_u *region_names = NULL; /* region names being used */ |
| 8561 int do_region = TRUE; /* dump region names and numbers */ | |
| 8562 char_u *p; | |
| 500 | 8563 int lpi; |
| 701 | 8564 int dumpflags = dumpflags_arg; |
| 8565 int patlen; | |
| 8566 | |
| 710 | 8567 /* When ignoring case or when the pattern starts with capital pass this on |
| 8568 * to dump_word(). */ | |
| 8569 if (pat != NULL) | |
| 8570 { | |
| 8571 if (ic) | |
| 8572 dumpflags |= DUMPFLAG_ICASE; | |
| 8573 else | |
| 8574 { | |
| 8575 n = captype(pat, NULL); | |
| 8576 if (n == WF_ONECAP) | |
| 8577 dumpflags |= DUMPFLAG_ONECAP; | |
| 8578 else if (n == WF_ALLCAP | |
| 8579 #ifdef FEAT_MBYTE | |
| 714 | 8580 && (int)STRLEN(pat) > mb_ptr2len(pat) |
| 710 | 8581 #else |
| 714 | 8582 && (int)STRLEN(pat) > 1 |
| 710 | 8583 #endif |
| 8584 ) | |
| 8585 dumpflags |= DUMPFLAG_ALLCAP; | |
| 8586 } | |
| 8587 } | |
| 351 | 8588 |
| 381 | 8589 /* Find out if we can support regions: All languages must support the same |
| 8590 * regions or none at all. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8591 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8592 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8593 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 381 | 8594 p = lp->lp_slang->sl_regions; |
| 8595 if (p[0] != 0) | |
| 8596 { | |
| 8597 if (region_names == NULL) /* first language with regions */ | |
| 8598 region_names = p; | |
| 8599 else if (STRCMP(region_names, p) != 0) | |
| 8600 { | |
| 8601 do_region = FALSE; /* region names are different */ | |
| 8602 break; | |
| 8603 } | |
| 8604 } | |
| 8605 } | |
| 8606 | |
| 8607 if (do_region && region_names != NULL) | |
| 8608 { | |
| 701 | 8609 if (pat == NULL) |
| 8610 { | |
| 8611 vim_snprintf((char *)IObuff, IOSIZE, "/regions=%s", region_names); | |
| 8612 ml_append(lnum++, IObuff, (colnr_T)0, FALSE); | |
| 8613 } | |
| 381 | 8614 } |
| 8615 else | |
| 8616 do_region = FALSE; | |
| 8617 | |
| 8618 /* | |
| 8619 * Loop over all files loaded for the entries in 'spelllang'. | |
| 8620 */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8621 for (lpi = 0; lpi < curwin->w_s->b_langp.ga_len; ++lpi) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8622 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8623 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 351 | 8624 slang = lp->lp_slang; |
| 500 | 8625 if (slang->sl_fbyts == NULL) /* reloading failed */ |
| 8626 continue; | |
| 351 | 8627 |
| 701 | 8628 if (pat == NULL) |
| 8629 { | |
| 8630 vim_snprintf((char *)IObuff, IOSIZE, "# file: %s", slang->sl_fname); | |
| 8631 ml_append(lnum++, IObuff, (colnr_T)0, FALSE); | |
| 8632 } | |
| 8633 | |
| 8634 /* When matching with a pattern and there are no prefixes only use | |
| 8635 * parts of the tree that match "pat". */ | |
| 8636 if (pat != NULL && slang->sl_pbyts == NULL) | |
| 835 | 8637 patlen = (int)STRLEN(pat); |
| 701 | 8638 else |
| 840 | 8639 patlen = -1; |
| 351 | 8640 |
| 8641 /* round 1: case-folded tree | |
| 8642 * round 2: keep-case tree */ | |
| 8643 for (round = 1; round <= 2; ++round) | |
| 8644 { | |
| 8645 if (round == 1) | |
| 8646 { | |
| 701 | 8647 dumpflags &= ~DUMPFLAG_KEEPCASE; |
| 351 | 8648 byts = slang->sl_fbyts; |
| 8649 idxs = slang->sl_fidxs; | |
| 8650 } | |
| 8651 else | |
| 8652 { | |
| 701 | 8653 dumpflags |= DUMPFLAG_KEEPCASE; |
| 351 | 8654 byts = slang->sl_kbyts; |
| 8655 idxs = slang->sl_kidxs; | |
| 8656 } | |
| 8657 if (byts == NULL) | |
| 8658 continue; /* array is empty */ | |
| 8659 | |
| 8660 depth = 0; | |
| 8661 arridx[0] = 0; | |
| 8662 curi[0] = 1; | |
| 701 | 8663 while (depth >= 0 && !got_int |
| 8664 && (pat == NULL || !compl_interrupted)) | |
| 351 | 8665 { |
| 8666 if (curi[depth] > byts[arridx[depth]]) | |
| 8667 { | |
| 8668 /* Done all bytes at this node, go up one level. */ | |
| 8669 --depth; | |
| 8670 line_breakcheck(); | |
|
10277
154d5a2e7395
commit https://github.com/vim/vim/commit/472e85970ee3a80abd824bef510df12e9cfe9e96
Christian Brabandt <cb@256bit.org>
parents:
10042
diff
changeset
|
8671 ins_compl_check_keys(50, FALSE); |
| 351 | 8672 } |
| 8673 else | |
| 8674 { | |
| 8675 /* Do one more byte at this node. */ | |
| 8676 n = arridx[depth] + curi[depth]; | |
| 8677 ++curi[depth]; | |
| 8678 c = byts[n]; | |
| 8679 if (c == 0) | |
| 8680 { | |
| 8681 /* End of word, deal with the word. | |
| 8682 * Don't use keep-case words in the fold-case tree, | |
| 8683 * they will appear in the keep-case tree. | |
| 8684 * Only use the word when the region matches. */ | |
| 8685 flags = (int)idxs[n]; | |
| 8686 if ((round == 2 || (flags & WF_KEEPCAP) == 0) | |
| 500 | 8687 && (flags & WF_NEEDCOMP) == 0 |
| 381 | 8688 && (do_region |
| 8689 || (flags & WF_REGION) == 0 | |
| 390 | 8690 || (((unsigned)flags >> 16) |
| 351 | 8691 & lp->lp_region) != 0)) |
| 8692 { | |
| 8693 word[depth] = NUL; | |
| 381 | 8694 if (!do_region) |
| 8695 flags &= ~WF_REGION; | |
| 355 | 8696 |
| 8697 /* Dump the basic word if there is no prefix or | |
| 8698 * when it's the first one. */ | |
| 390 | 8699 c = (unsigned)flags >> 24; |
| 355 | 8700 if (c == 0 || curi[depth] == 2) |
| 701 | 8701 { |
| 8702 dump_word(slang, word, pat, dir, | |
| 8703 dumpflags, flags, lnum); | |
| 8704 if (pat == NULL) | |
| 8705 ++lnum; | |
| 8706 } | |
| 351 | 8707 |
| 8708 /* Apply the prefix, if there is one. */ | |
| 355 | 8709 if (c != 0) |
| 701 | 8710 lnum = dump_prefixes(slang, word, pat, dir, |
| 8711 dumpflags, flags, lnum); | |
| 351 | 8712 } |
| 8713 } | |
| 8714 else | |
| 8715 { | |
| 8716 /* Normal char, go one level deeper. */ | |
| 8717 word[depth++] = c; | |
| 8718 arridx[depth] = idxs[n]; | |
| 8719 curi[depth] = 1; | |
| 701 | 8720 |
| 8721 /* Check if this characters matches with the pattern. | |
| 8722 * If not skip the whole tree below it. | |
| 710 | 8723 * Always ignore case here, dump_word() will check |
| 8724 * proper case later. This isn't exactly right when | |
| 8725 * length changes for multi-byte characters with | |
| 8726 * ignore case... */ | |
| 8727 if (depth <= patlen | |
| 8728 && MB_STRNICMP(word, pat, depth) != 0) | |
| 701 | 8729 --depth; |
| 351 | 8730 } |
| 8731 } | |
| 8732 } | |
| 8733 } | |
| 8734 } | |
| 8735 } | |
| 8736 | |
| 8737 /* | |
| 8738 * Dump one word: apply case modifications and append a line to the buffer. | |
| 701 | 8739 * When "lnum" is zero add insert mode completion. |
| 8740 */ | |
| 8741 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8742 dump_word( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8743 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8744 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8745 char_u *pat, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8746 int *dir, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8747 int dumpflags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8748 int wordflags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8749 linenr_T lnum) |
| 351 | 8750 { |
| 8751 int keepcap = FALSE; | |
| 8752 char_u *p; | |
| 625 | 8753 char_u *tw; |
| 351 | 8754 char_u cword[MAXWLEN]; |
| 381 | 8755 char_u badword[MAXWLEN + 10]; |
| 8756 int i; | |
| 710 | 8757 int flags = wordflags; |
| 8758 | |
| 8759 if (dumpflags & DUMPFLAG_ONECAP) | |
| 8760 flags |= WF_ONECAP; | |
| 8761 if (dumpflags & DUMPFLAG_ALLCAP) | |
| 8762 flags |= WF_ALLCAP; | |
| 351 | 8763 |
| 625 | 8764 if ((dumpflags & DUMPFLAG_KEEPCASE) == 0 && (flags & WF_CAPMASK) != 0) |
| 351 | 8765 { |
| 8766 /* Need to fix case according to "flags". */ | |
| 8767 make_case_word(word, cword, flags); | |
| 8768 p = cword; | |
| 8769 } | |
| 8770 else | |
| 8771 { | |
| 8772 p = word; | |
| 625 | 8773 if ((dumpflags & DUMPFLAG_KEEPCASE) |
| 8774 && ((captype(word, NULL) & WF_KEEPCAP) == 0 | |
| 389 | 8775 || (flags & WF_FIXCAP) != 0)) |
| 351 | 8776 keepcap = TRUE; |
| 8777 } | |
| 625 | 8778 tw = p; |
| 351 | 8779 |
| 701 | 8780 if (pat == NULL) |
| 8781 { | |
| 8782 /* Add flags and regions after a slash. */ | |
| 8783 if ((flags & (WF_BANNED | WF_RARE | WF_REGION)) || keepcap) | |
| 8784 { | |
| 8785 STRCPY(badword, p); | |
| 8786 STRCAT(badword, "/"); | |
| 8787 if (keepcap) | |
| 8788 STRCAT(badword, "="); | |
| 8789 if (flags & WF_BANNED) | |
| 8790 STRCAT(badword, "!"); | |
| 8791 else if (flags & WF_RARE) | |
| 8792 STRCAT(badword, "?"); | |
| 8793 if (flags & WF_REGION) | |
| 8794 for (i = 0; i < 7; ++i) | |
| 8795 if (flags & (0x10000 << i)) | |
| 8796 sprintf((char *)badword + STRLEN(badword), "%d", i + 1); | |
| 8797 p = badword; | |
| 8798 } | |
| 8799 | |
| 8800 if (dumpflags & DUMPFLAG_COUNT) | |
| 8801 { | |
| 8802 hashitem_T *hi; | |
| 8803 | |
| 8804 /* Include the word count for ":spelldump!". */ | |
| 8805 hi = hash_find(&slang->sl_wordcount, tw); | |
| 8806 if (!HASHITEM_EMPTY(hi)) | |
| 8807 { | |
| 8808 vim_snprintf((char *)IObuff, IOSIZE, "%s\t%d", | |
| 625 | 8809 tw, HI2WC(hi)->wc_count); |
| 701 | 8810 p = IObuff; |
| 8811 } | |
| 8812 } | |
| 8813 | |
| 8814 ml_append(lnum, p, (colnr_T)0, FALSE); | |
| 8815 } | |
| 710 | 8816 else if (((dumpflags & DUMPFLAG_ICASE) |
| 8817 ? MB_STRNICMP(p, pat, STRLEN(pat)) == 0 | |
| 8818 : STRNCMP(p, pat, STRLEN(pat)) == 0) | |
| 701 | 8819 && ins_compl_add_infercase(p, (int)STRLEN(p), |
| 942 | 8820 p_ic, NULL, *dir, 0) == OK) |
| 710 | 8821 /* if dir was BACKWARD then honor it just once */ |
| 8822 *dir = FORWARD; | |
| 351 | 8823 } |
| 8824 | |
| 8825 /* | |
| 372 | 8826 * For ":spelldump": Find matching prefixes for "word". Prepend each to |
| 8827 * "word" and append a line to the buffer. | |
| 701 | 8828 * When "lnum" is zero add insert mode completion. |
| 351 | 8829 * Return the updated line number. |
| 8830 */ | |
| 8831 static linenr_T | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8832 dump_prefixes( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8833 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8834 char_u *word, /* case-folded word */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8835 char_u *pat, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8836 int *dir, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8837 int dumpflags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8838 int flags, /* flags with prefix ID */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8839 linenr_T startlnum) |
| 351 | 8840 { |
| 8841 idx_T arridx[MAXWLEN]; | |
| 8842 int curi[MAXWLEN]; | |
| 8843 char_u prefix[MAXWLEN]; | |
| 455 | 8844 char_u word_up[MAXWLEN]; |
| 8845 int has_word_up = FALSE; | |
| 351 | 8846 int c; |
| 8847 char_u *byts; | |
| 8848 idx_T *idxs; | |
| 8849 linenr_T lnum = startlnum; | |
| 8850 int depth; | |
| 8851 int n; | |
| 8852 int len; | |
| 8853 int i; | |
| 8854 | |
| 626 | 8855 /* If the word starts with a lower-case letter make the word with an |
| 455 | 8856 * upper-case letter in word_up[]. */ |
| 8857 c = PTR2CHAR(word); | |
| 8858 if (SPELL_TOUPPER(c) != c) | |
| 8859 { | |
| 8860 onecap_copy(word, word_up, TRUE); | |
| 8861 has_word_up = TRUE; | |
| 8862 } | |
| 8863 | |
| 351 | 8864 byts = slang->sl_pbyts; |
| 8865 idxs = slang->sl_pidxs; | |
| 8866 if (byts != NULL) /* array not is empty */ | |
| 8867 { | |
| 8868 /* | |
| 8869 * Loop over all prefixes, building them byte-by-byte in prefix[]. | |
| 390 | 8870 * When at the end of a prefix check that it supports "flags". |
| 351 | 8871 */ |
| 8872 depth = 0; | |
| 8873 arridx[0] = 0; | |
| 8874 curi[0] = 1; | |
| 8875 while (depth >= 0 && !got_int) | |
| 8876 { | |
| 390 | 8877 n = arridx[depth]; |
| 8878 len = byts[n]; | |
| 8879 if (curi[depth] > len) | |
| 351 | 8880 { |
| 8881 /* Done all bytes at this node, go up one level. */ | |
| 8882 --depth; | |
| 8883 line_breakcheck(); | |
| 8884 } | |
| 8885 else | |
| 8886 { | |
| 8887 /* Do one more byte at this node. */ | |
| 390 | 8888 n += curi[depth]; |
| 351 | 8889 ++curi[depth]; |
| 8890 c = byts[n]; | |
| 8891 if (c == 0) | |
| 8892 { | |
| 8893 /* End of prefix, find out how many IDs there are. */ | |
| 8894 for (i = 1; i < len; ++i) | |
| 8895 if (byts[n + i] != 0) | |
| 8896 break; | |
| 8897 curi[depth] += i - 1; | |
| 8898 | |
| 455 | 8899 c = valid_word_prefix(i, n, flags, word, slang, FALSE); |
| 8900 if (c != 0) | |
| 351 | 8901 { |
| 376 | 8902 vim_strncpy(prefix + depth, word, MAXWLEN - depth - 1); |
| 701 | 8903 dump_word(slang, prefix, pat, dir, dumpflags, |
| 455 | 8904 (c & WF_RAREPFX) ? (flags | WF_RARE) |
| 701 | 8905 : flags, lnum); |
| 8906 if (lnum != 0) | |
| 8907 ++lnum; | |
| 351 | 8908 } |
| 455 | 8909 |
| 8910 /* Check for prefix that matches the word when the | |
| 8911 * first letter is upper-case, but only if the prefix has | |
| 8912 * a condition. */ | |
| 8913 if (has_word_up) | |
| 8914 { | |
| 8915 c = valid_word_prefix(i, n, flags, word_up, slang, | |
| 8916 TRUE); | |
| 8917 if (c != 0) | |
| 8918 { | |
| 8919 vim_strncpy(prefix + depth, word_up, | |
| 8920 MAXWLEN - depth - 1); | |
| 701 | 8921 dump_word(slang, prefix, pat, dir, dumpflags, |
| 455 | 8922 (c & WF_RAREPFX) ? (flags | WF_RARE) |
| 701 | 8923 : flags, lnum); |
| 8924 if (lnum != 0) | |
| 8925 ++lnum; | |
| 455 | 8926 } |
| 8927 } | |
| 351 | 8928 } |
| 8929 else | |
| 8930 { | |
| 8931 /* Normal char, go one level deeper. */ | |
| 8932 prefix[depth++] = c; | |
| 8933 arridx[depth] = idxs[n]; | |
| 8934 curi[depth] = 1; | |
| 8935 } | |
| 8936 } | |
| 8937 } | |
| 8938 } | |
| 8939 | |
| 8940 return lnum; | |
| 8941 } | |
| 8942 | |
| 498 | 8943 /* |
| 626 | 8944 * Move "p" to the end of word "start". |
| 8945 * Uses the spell-checking word characters. | |
| 498 | 8946 */ |
| 8947 char_u * | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8948 spell_to_word_end(char_u *start, win_T *win) |
| 498 | 8949 { |
| 8950 char_u *p = start; | |
| 8951 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8952 while (*p != NUL && spell_iswordp(p, win)) |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
8953 MB_PTR_ADV(p); |
| 498 | 8954 return p; |
| 8955 } | |
| 8956 | |
| 475 | 8957 #if defined(FEAT_INS_EXPAND) || defined(PROTO) |
| 8958 /* | |
| 626 | 8959 * For Insert mode completion CTRL-X s: |
| 8960 * Find start of the word in front of column "startcol". | |
| 8961 * We don't check if it is badly spelled, with completion we can only change | |
| 8962 * the word in front of the cursor. | |
| 475 | 8963 * Returns the column number of the word. |
| 8964 */ | |
| 8965 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8966 spell_word_start(int startcol) |
| 475 | 8967 { |
| 8968 char_u *line; | |
| 8969 char_u *p; | |
| 8970 int col = 0; | |
| 8971 | |
| 498 | 8972 if (no_spell_checking(curwin)) |
| 475 | 8973 return startcol; |
| 8974 | |
| 8975 /* Find a word character before "startcol". */ | |
| 8976 line = ml_get_curline(); | |
| 8977 for (p = line + startcol; p > line; ) | |
| 8978 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
8979 MB_PTR_BACK(line, p); |
| 5477 | 8980 if (spell_iswordp_nmw(p, curwin)) |
| 475 | 8981 break; |
| 8982 } | |
| 8983 | |
| 8984 /* Go back to start of the word. */ | |
| 8985 while (p > line) | |
| 8986 { | |
| 835 | 8987 col = (int)(p - line); |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
8988 MB_PTR_BACK(line, p); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8989 if (!spell_iswordp(p, curwin)) |
| 475 | 8990 break; |
| 8991 col = 0; | |
| 8992 } | |
| 8993 | |
| 535 | 8994 return col; |
| 8995 } | |
| 8996 | |
| 8997 /* | |
| 8998 * Need to check for 'spellcapcheck' now, the word is removed before | |
| 8999 * expand_spelling() is called. Therefore the ugly global variable. | |
| 9000 */ | |
| 9001 static int spell_expand_need_cap; | |
| 9002 | |
| 9003 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
9004 spell_expand_check_cap(colnr_T col) |
| 535 | 9005 { |
| 475 | 9006 spell_expand_need_cap = check_need_cap(curwin->w_cursor.lnum, col); |
| 9007 } | |
| 9008 | |
| 9009 /* | |
| 9010 * Get list of spelling suggestions. | |
| 9011 * Used for Insert mode completion CTRL-X ?. | |
| 9012 * Returns the number of matches. The matches are in "matchp[]", array of | |
| 9013 * allocated strings. | |
| 9014 */ | |
| 9015 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
9016 expand_spelling( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
9017 linenr_T lnum UNUSED, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
9018 char_u *pat, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
9019 char_u ***matchp) |
| 475 | 9020 { |
| 9021 garray_T ga; | |
| 9022 | |
| 625 | 9023 spell_suggest_list(&ga, pat, 100, spell_expand_need_cap, TRUE); |
| 475 | 9024 *matchp = ga.ga_data; |
| 9025 return ga.ga_len; | |
| 9026 } | |
| 9027 #endif | |
| 9028 | |
| 737 | 9029 #endif /* FEAT_SPELL */ |