Mercurial > vim
annotate src/spell.c @ 16764:ef00b6bc186b v8.1.1384
patch 8.1.1384: using "int" for alloc() often results in compiler warnings
commit https://github.com/vim/vim/commit/964b3746b9c81e65887e2ac9a335f181db2bb592
Author: Bram Moolenaar <Bram@vim.org>
Date: Fri May 24 18:54:09 2019 +0200
patch 8.1.1384: using "int" for alloc() often results in compiler warnings
Problem: Using "int" for alloc() often results in compiler warnings.
Solution: Use "size_t" and remove type casts. Remove alloc_check(), Vim
only works with 32 bit ints anyway.
| author | Bram Moolenaar <Bram@vim.org> |
|---|---|
| date | Fri, 24 May 2019 19:00:07 +0200 |
| parents | b52ea9c5f1db |
| children | 695d9ef00b03 |
| 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 int mi_cprefixlen; /* byte length of prefix in original |
| 228 case */ | |
| 339 | 229 |
| 481 | 230 /* for when checking a compound word */ |
| 231 int mi_compoff; /* start of following word offset */ | |
| 483 | 232 char_u mi_compflags[MAXWLEN]; /* flags for compound words used */ |
| 233 int mi_complen; /* nr of compound words used */ | |
| 809 | 234 int mi_compextra; /* nr of COMPOUNDROOT words */ |
| 481 | 235 |
| 243 | 236 /* others */ |
| 236 | 237 int mi_result; /* result so far: SP_BAD, SP_OK, etc. */ |
| 300 | 238 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
|
239 win_T *mi_win; /* buffer being checked */ |
| 492 | 240 |
| 241 /* for NOBREAK */ | |
| 242 int mi_result2; /* "mi_resul" without following word */ | |
| 243 char_u *mi_end2; /* "mi_end" without following word */ | |
| 236 | 244 } matchinf_T; |
| 245 | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
246 |
|
7805
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
247 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
|
248 static int spell_mb_isword_class(int cl, win_T *wp); |
| 307 | 249 |
| 250 /* | |
| 344 | 251 * For finding suggestions: At each node in the tree these states are tried: |
| 330 | 252 */ |
| 253 typedef enum | |
| 254 { | |
| 344 | 255 STATE_START = 0, /* At start of node check for NUL bytes (goodword |
| 256 * ends); if badword ends there is a match, otherwise | |
| 257 * try splitting word. */ | |
| 375 | 258 STATE_NOPREFIX, /* try without prefix */ |
| 344 | 259 STATE_SPLITUNDO, /* Undo splitting. */ |
| 330 | 260 STATE_ENDNUL, /* Past NUL bytes at start of the node. */ |
| 261 STATE_PLAIN, /* Use each byte of the node. */ | |
| 262 STATE_DEL, /* Delete a byte from the bad word. */ | |
| 625 | 263 STATE_INS_PREP, /* Prepare for inserting bytes. */ |
| 330 | 264 STATE_INS, /* Insert a byte in the bad word. */ |
| 265 STATE_SWAP, /* Swap two bytes. */ | |
| 344 | 266 STATE_UNSWAP, /* Undo swap two characters. */ |
| 267 STATE_SWAP3, /* Swap two characters over three. */ | |
| 268 STATE_UNSWAP3, /* Undo Swap two characters over three. */ | |
| 269 STATE_UNROT3L, /* Undo rotate three characters left */ | |
| 270 STATE_UNROT3R, /* Undo rotate three characters right */ | |
| 330 | 271 STATE_REP_INI, /* Prepare for using REP items. */ |
| 272 STATE_REP, /* Use matching REP items from the .aff file. */ | |
| 273 STATE_REP_UNDO, /* Undo a REP item replacement. */ | |
| 274 STATE_FINAL /* End of this node. */ | |
| 275 } state_T; | |
| 276 | |
| 277 /* | |
| 346 | 278 * Struct to keep the state at each level in suggest_try_change(). |
| 323 | 279 */ |
| 280 typedef struct trystate_S | |
| 281 { | |
| 330 | 282 state_T ts_state; /* state at this level, STATE_ */ |
| 323 | 283 int ts_score; /* score */ |
| 344 | 284 idx_T ts_arridx; /* index in tree array, start of node */ |
| 330 | 285 short ts_curi; /* index in list of child nodes */ |
| 286 char_u ts_fidx; /* index in fword[], case-folded bad word */ | |
| 287 char_u ts_fidxtry; /* ts_fidx at which bytes may be changed */ | |
| 288 char_u ts_twordlen; /* valid length of tword[] */ | |
| 482 | 289 char_u ts_prefixdepth; /* stack depth for end of prefix or |
| 485 | 290 * PFD_PREFIXTREE or PFD_NOPREFIX */ |
| 291 char_u ts_flags; /* TSF_ flags */ | |
| 330 | 292 char_u ts_tcharlen; /* number of bytes in tword character */ |
| 293 char_u ts_tcharidx; /* current byte index in tword character */ | |
| 294 char_u ts_isdiff; /* DIFF_ values */ | |
| 295 char_u ts_fcharstart; /* index in fword where badword char started */ | |
| 483 | 296 char_u ts_prewordlen; /* length of word in "preword[]" */ |
| 297 char_u ts_splitoff; /* index in "tword" after last split */ | |
| 492 | 298 char_u ts_splitfidx; /* "ts_fidx" at word split */ |
| 483 | 299 char_u ts_complen; /* nr of compound words used */ |
| 485 | 300 char_u ts_compsplit; /* index for "compflags" where word was spit */ |
| 346 | 301 char_u ts_save_badflags; /* su_badflags saved here */ |
| 625 | 302 char_u ts_delidx; /* index in fword for char that was deleted, |
| 303 valid when "ts_flags" has TSF_DIDDEL */ | |
| 323 | 304 } trystate_T; |
| 305 | |
| 330 | 306 /* values for ts_isdiff */ |
| 307 #define DIFF_NONE 0 /* no different byte (yet) */ | |
| 308 #define DIFF_YES 1 /* different byte found */ | |
| 309 #define DIFF_INSERT 2 /* inserting character */ | |
| 310 | |
| 485 | 311 /* values for ts_flags */ |
| 312 #define TSF_PREFIXOK 1 /* already checked that prefix is OK */ | |
| 313 #define TSF_DIDSPLIT 2 /* tried split at this point */ | |
| 625 | 314 #define TSF_DIDDEL 4 /* did a delete, "ts_delidx" has index */ |
| 485 | 315 |
| 375 | 316 /* special values ts_prefixdepth */ |
| 485 | 317 #define PFD_NOPREFIX 0xff /* not using prefixes */ |
| 482 | 318 #define PFD_PREFIXTREE 0xfe /* walking through the prefix tree */ |
| 625 | 319 #define PFD_NOTSPECIAL 0xfd /* highest value that's not special */ |
| 375 | 320 |
| 339 | 321 /* mode values for find_word */ |
| 481 | 322 #define FIND_FOLDWORD 0 /* find word case-folded */ |
| 323 #define FIND_KEEPWORD 1 /* find keep-case word */ | |
| 324 #define FIND_PREFIX 2 /* find word after prefix */ | |
| 325 #define FIND_COMPOUND 3 /* find case-folded compound word */ | |
| 326 #define FIND_KEEPCOMPOUND 4 /* find keep-case compound word */ | |
| 339 | 327 |
|
7805
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
328 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
|
329 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
|
330 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
|
331 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
|
332 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
|
333 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
|
334 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
|
335 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
|
336 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
|
337 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
|
338 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
|
339 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
|
340 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
|
341 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
|
342 static void spell_find_suggest(char_u *badptr, int badlen, suginfo_T *su, int maxcount, int banbadword, int need_cap, int interactive); |
| 372 | 343 #ifdef FEAT_EVAL |
|
7805
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
344 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
|
345 #endif |
|
0b6c37dd858d
commit https://github.com/vim/vim/commit/baaa7e9ec7398a813e21285c272fa99792642077
Christian Brabandt <cb@256bit.org>
parents:
7526
diff
changeset
|
346 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
|
347 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
|
348 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
|
349 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
|
350 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
|
351 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
|
352 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
|
353 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
|
354 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
|
355 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
|
356 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
|
357 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
|
358 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
|
359 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
|
360 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
|
361 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
|
362 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
|
363 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
|
364 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
|
365 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
|
366 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
|
367 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
|
368 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
|
369 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
|
370 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
|
371 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
|
372 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
|
373 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
|
374 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
|
375 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
|
376 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
|
377 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
|
378 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
|
379 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
|
380 |
| 236 | 381 |
| 626 | 382 /* Remember what "z?" replaced. */ |
| 383 static char_u *repl_from = NULL; | |
| 384 static char_u *repl_to = NULL; | |
| 385 | |
| 236 | 386 /* |
| 387 * Main spell-checking function. | |
| 300 | 388 * "ptr" points to a character that could be the start of a word. |
| 534 | 389 * "*attrp" is set to the highlight index for a badly spelled word. For a |
| 390 * non-word or when it's OK it remains unchanged. | |
| 236 | 391 * This must only be called when 'spelllang' is not empty. |
| 323 | 392 * |
| 385 | 393 * "capcol" is used to check for a Capitalised word after the end of a |
| 394 * sentence. If it's zero then perform the check. Return the column where to | |
| 395 * check next, or -1 when no sentence end was found. If it's NULL then don't | |
| 396 * worry. | |
| 323 | 397 * |
| 236 | 398 * Returns the length of the word in bytes, also when it's OK, so that the |
| 399 * caller can skip over the word. | |
| 400 */ | |
| 401 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
402 spell_check( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
403 win_T *wp, /* current window */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
404 char_u *ptr, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
405 hlf_T *attrp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
406 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
|
407 int docount) /* count good words */ |
| 236 | 408 { |
| 409 matchinf_T mi; /* Most things are put in "mi" so that it can | |
| 410 be passed to functions quickly. */ | |
| 344 | 411 int nrlen = 0; /* found a number first */ |
| 385 | 412 int c; |
| 483 | 413 int wrongcaplen = 0; |
| 500 | 414 int lpi; |
| 625 | 415 int count_word = docount; |
| 236 | 416 |
| 307 | 417 /* A word never starts at a space or a control character. Return quickly |
| 418 * then, skipping over the character. */ | |
| 419 if (*ptr <= ' ') | |
| 420 return 1; | |
| 690 | 421 |
| 422 /* 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
|
423 if (wp->w_s->b_langp.ga_len == 0) |
| 690 | 424 return 1; |
| 425 | |
| 483 | 426 vim_memset(&mi, 0, sizeof(matchinf_T)); |
| 236 | 427 |
| 344 | 428 /* A number is always OK. Also skip hexadecimal numbers 0xFF99 and |
| 584 | 429 * 0X99FF. But always do check spelling to find "3GPP" and "11 |
| 430 * julifeest". */ | |
| 300 | 431 if (*ptr >= '0' && *ptr <= '9') |
| 432 { | |
|
7447
ad432f8f68fb
commit https://github.com/vim/vim/commit/887c1fea4a114e7170091942d0446c8882701b5b
Christian Brabandt <cb@256bit.org>
parents:
6949
diff
changeset
|
433 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
|
434 mi.mi_end = skipbin(ptr + 2); |
|
ad432f8f68fb
commit https://github.com/vim/vim/commit/887c1fea4a114e7170091942d0446c8882701b5b
Christian Brabandt <cb@256bit.org>
parents:
6949
diff
changeset
|
435 else if (*ptr == '0' && (ptr[1] == 'x' || ptr[1] == 'X')) |
| 316 | 436 mi.mi_end = skiphex(ptr + 2); |
| 300 | 437 else |
| 344 | 438 mi.mi_end = skipdigits(ptr); |
| 835 | 439 nrlen = (int)(mi.mi_end - ptr); |
| 584 | 440 } |
| 346 | 441 |
| 442 /* Find the normal end of the word (until the next non-word character). */ | |
| 344 | 443 mi.mi_word = ptr; |
| 584 | 444 mi.mi_fend = ptr; |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
445 if (spell_iswordp(mi.mi_fend, wp)) |
| 344 | 446 { |
| 447 do | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
448 MB_PTR_ADV(mi.mi_fend); |
|
16162
cd5c83115ec6
patch 8.1.1086: too many curly braces
Bram Moolenaar <Bram@vim.org>
parents:
16142
diff
changeset
|
449 while (*mi.mi_fend != NUL && spell_iswordp(mi.mi_fend, wp)); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
450 |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
451 if (capcol != NULL && *capcol == 0 && wp->w_s->b_cap_prog != NULL) |
| 385 | 452 { |
| 453 /* Check word starting with capital letter. */ | |
| 455 | 454 c = PTR2CHAR(ptr); |
| 385 | 455 if (!SPELL_ISUPPER(c)) |
| 483 | 456 wrongcaplen = (int)(mi.mi_fend - ptr); |
| 385 | 457 } |
| 458 } | |
| 459 if (capcol != NULL) | |
| 460 *capcol = -1; | |
| 344 | 461 |
| 462 /* We always use the characters up to the next non-word character, | |
| 463 * also for bad words. */ | |
| 464 mi.mi_end = mi.mi_fend; | |
| 465 | |
| 466 /* Check caps type later. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
467 mi.mi_capflags = 0; |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
468 mi.mi_cend = NULL; |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
469 mi.mi_win = wp; |
| 344 | 470 |
| 483 | 471 /* case-fold the word with one non-word character, so that we can check |
| 472 * for the word end. */ | |
| 344 | 473 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
|
474 MB_PTR_ADV(mi.mi_fend); |
| 344 | 475 |
| 476 (void)spell_casefold(ptr, (int)(mi.mi_fend - ptr), mi.mi_fword, | |
| 477 MAXWLEN + 1); | |
| 835 | 478 mi.mi_fwordlen = (int)STRLEN(mi.mi_fword); |
| 344 | 479 |
| 480 /* The word is bad unless we recognize it. */ | |
| 481 mi.mi_result = SP_BAD; | |
| 492 | 482 mi.mi_result2 = SP_BAD; |
| 344 | 483 |
| 484 /* | |
| 485 * Loop over the languages specified in 'spelllang'. | |
| 625 | 486 * We check them all, because a word may be matched longer in another |
| 487 * language. | |
| 344 | 488 */ |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
489 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
|
490 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
491 mi.mi_lp = LANGP_ENTRY(wp->w_s->b_langp, lpi); |
| 500 | 492 |
| 493 /* If reloading fails the language is still in the list but everything | |
| 494 * has been cleared. */ | |
| 495 if (mi.mi_lp->lp_slang->sl_fidxs == NULL) | |
| 496 continue; | |
| 497 | |
| 344 | 498 /* Check for a matching word in case-folded words. */ |
| 499 find_word(&mi, FIND_FOLDWORD); | |
| 500 | |
| 501 /* Check for a matching word in keep-case words. */ | |
| 502 find_word(&mi, FIND_KEEPWORD); | |
| 503 | |
| 504 /* Check for matching prefixes. */ | |
| 485 | 505 find_prefix(&mi, FIND_FOLDWORD); |
| 492 | 506 |
| 507 /* For a NOBREAK language, may want to use a word without a following | |
| 508 * word as a backup. */ | |
| 509 if (mi.mi_lp->lp_slang->sl_nobreak && mi.mi_result == SP_BAD | |
| 510 && mi.mi_result2 != SP_BAD) | |
| 511 { | |
| 512 mi.mi_result = mi.mi_result2; | |
| 513 mi.mi_end = mi.mi_end2; | |
| 514 } | |
| 625 | 515 |
| 516 /* Count the word in the first language where it's found to be OK. */ | |
| 517 if (count_word && mi.mi_result == SP_OK) | |
| 518 { | |
| 519 count_common_word(mi.mi_lp->lp_slang, ptr, | |
| 520 (int)(mi.mi_end - ptr), 1); | |
| 521 count_word = FALSE; | |
| 522 } | |
| 344 | 523 } |
| 524 | |
| 525 if (mi.mi_result != SP_OK) | |
| 526 { | |
| 346 | 527 /* If we found a number skip over it. Allows for "42nd". Do flag |
| 528 * rare and local words, e.g., "3GPP". */ | |
| 344 | 529 if (nrlen > 0) |
| 346 | 530 { |
| 531 if (mi.mi_result == SP_BAD || mi.mi_result == SP_BANNED) | |
| 532 return nrlen; | |
| 533 } | |
| 344 | 534 |
| 535 /* When we are at a non-word character there is no error, just | |
| 536 * skip over the character (try looking for a word after it). */ | |
| 5477 | 537 else if (!spell_iswordp_nmw(ptr, wp)) |
| 243 | 538 { |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
539 if (capcol != NULL && wp->w_s->b_cap_prog != NULL) |
| 385 | 540 { |
| 541 regmatch_T regmatch; | |
| 6375 | 542 int r; |
| 385 | 543 |
| 544 /* Check for end of sentence. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
545 regmatch.regprog = wp->w_s->b_cap_prog; |
| 385 | 546 regmatch.rm_ic = FALSE; |
| 6375 | 547 r = vim_regexec(®match, ptr, 0); |
| 548 wp->w_s->b_cap_prog = regmatch.regprog; | |
| 549 if (r) | |
| 385 | 550 *capcol = (int)(regmatch.endp[0] - ptr); |
| 551 } | |
| 552 | |
| 344 | 553 if (has_mbyte) |
| 474 | 554 return (*mb_ptr2len)(ptr); |
| 344 | 555 return 1; |
| 300 | 556 } |
| 483 | 557 else if (mi.mi_end == ptr) |
| 558 /* Always include at least one character. Required for when there | |
| 559 * 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
|
560 MB_PTR_ADV(mi.mi_end); |
| 492 | 561 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
|
562 && LANGP_ENTRY(wp->w_s->b_langp, 0)->lp_slang->sl_nobreak) |
| 492 | 563 { |
| 564 char_u *p, *fp; | |
| 565 int save_result = mi.mi_result; | |
| 566 | |
| 567 /* First language in 'spelllang' is NOBREAK. Find first position | |
| 568 * 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
|
569 mi.mi_lp = LANGP_ENTRY(wp->w_s->b_langp, 0); |
| 500 | 570 if (mi.mi_lp->lp_slang->sl_fidxs != NULL) |
| 571 { | |
| 572 p = mi.mi_word; | |
| 573 fp = mi.mi_fword; | |
| 574 for (;;) | |
| 575 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
576 MB_PTR_ADV(p); |
|
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
577 MB_PTR_ADV(fp); |
| 500 | 578 if (p >= mi.mi_end) |
| 579 break; | |
| 835 | 580 mi.mi_compoff = (int)(fp - mi.mi_fword); |
| 500 | 581 find_word(&mi, FIND_COMPOUND); |
| 582 if (mi.mi_result != SP_BAD) | |
| 583 { | |
| 584 mi.mi_end = p; | |
| 585 break; | |
| 586 } | |
| 587 } | |
| 588 mi.mi_result = save_result; | |
| 589 } | |
| 492 | 590 } |
| 243 | 591 |
| 344 | 592 if (mi.mi_result == SP_BAD || mi.mi_result == SP_BANNED) |
| 534 | 593 *attrp = HLF_SPB; |
| 344 | 594 else if (mi.mi_result == SP_RARE) |
| 534 | 595 *attrp = HLF_SPR; |
| 344 | 596 else |
| 534 | 597 *attrp = HLF_SPL; |
| 243 | 598 } |
| 599 | |
| 483 | 600 if (wrongcaplen > 0 && (mi.mi_result == SP_OK || mi.mi_result == SP_RARE)) |
| 601 { | |
| 602 /* Report SpellCap only when the word isn't badly spelled. */ | |
| 534 | 603 *attrp = HLF_SPC; |
| 483 | 604 return wrongcaplen; |
| 605 } | |
| 606 | |
| 300 | 607 return (int)(mi.mi_end - ptr); |
| 236 | 608 } |
| 609 | |
| 610 /* | |
| 300 | 611 * Check if the word at "mip->mi_word" is in the tree. |
| 339 | 612 * When "mode" is FIND_FOLDWORD check in fold-case word tree. |
| 613 * When "mode" is FIND_KEEPWORD check in keep-case word tree. | |
| 614 * When "mode" is FIND_PREFIX check for word after prefix in fold-case word | |
| 615 * tree. | |
| 300 | 616 * |
| 617 * For a match mip->mi_result is updated. | |
| 243 | 618 */ |
| 619 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
620 find_word(matchinf_T *mip, int mode) |
| 243 | 621 { |
| 324 | 622 idx_T arridx = 0; |
| 300 | 623 int endlen[MAXWLEN]; /* length at possible word endings */ |
| 324 | 624 idx_T endidx[MAXWLEN]; /* possible word endings */ |
| 300 | 625 int endidxcnt = 0; |
| 626 int len; | |
| 627 int wlen = 0; | |
| 628 int flen; | |
| 629 int c; | |
| 630 char_u *ptr; | |
| 324 | 631 idx_T lo, hi, m; |
| 300 | 632 char_u *s; |
| 339 | 633 char_u *p; |
| 307 | 634 int res = SP_BAD; |
| 300 | 635 slang_T *slang = mip->mi_lp->lp_slang; |
| 636 unsigned flags; | |
| 637 char_u *byts; | |
| 324 | 638 idx_T *idxs; |
| 481 | 639 int word_ends; |
| 485 | 640 int prefix_found; |
| 492 | 641 int nobreak_result; |
| 481 | 642 |
| 643 if (mode == FIND_KEEPWORD || mode == FIND_KEEPCOMPOUND) | |
| 236 | 644 { |
| 300 | 645 /* Check for word with matching case in keep-case tree. */ |
| 646 ptr = mip->mi_word; | |
| 647 flen = 9999; /* no case folding, always enough bytes */ | |
| 648 byts = slang->sl_kbyts; | |
| 649 idxs = slang->sl_kidxs; | |
| 481 | 650 |
| 651 if (mode == FIND_KEEPCOMPOUND) | |
| 652 /* Skip over the previously found word(s). */ | |
| 653 wlen += mip->mi_compoff; | |
| 236 | 654 } |
| 655 else | |
| 656 { | |
| 300 | 657 /* Check for case-folded in case-folded tree. */ |
| 658 ptr = mip->mi_fword; | |
| 659 flen = mip->mi_fwordlen; /* available case-folded bytes */ | |
| 660 byts = slang->sl_fbyts; | |
| 661 idxs = slang->sl_fidxs; | |
| 339 | 662 |
| 663 if (mode == FIND_PREFIX) | |
| 664 { | |
| 665 /* Skip over the prefix. */ | |
| 666 wlen = mip->mi_prefixlen; | |
| 667 flen -= mip->mi_prefixlen; | |
| 668 } | |
| 481 | 669 else if (mode == FIND_COMPOUND) |
| 670 { | |
| 671 /* Skip over the previously found word(s). */ | |
| 672 wlen = mip->mi_compoff; | |
| 673 flen -= mip->mi_compoff; | |
| 674 } | |
| 675 | |
| 243 | 676 } |
| 677 | |
| 300 | 678 if (byts == NULL) |
| 679 return; /* array is empty */ | |
| 236 | 680 |
| 681 /* | |
| 307 | 682 * Repeat advancing in the tree until: |
| 683 * - there is a byte that doesn't match, | |
| 684 * - we reach the end of the tree, | |
| 685 * - or we reach the end of the line. | |
| 236 | 686 */ |
| 300 | 687 for (;;) |
| 236 | 688 { |
| 346 | 689 if (flen <= 0 && *mip->mi_fend != NUL) |
| 339 | 690 flen = fold_more(mip); |
| 300 | 691 |
| 692 len = byts[arridx++]; | |
| 693 | |
| 694 /* If the first possible byte is a zero the word could end here. | |
| 695 * Remember this index, we first check for the longest word. */ | |
| 696 if (byts[arridx] == 0) | |
| 697 { | |
| 307 | 698 if (endidxcnt == MAXWLEN) |
| 699 { | |
| 700 /* Must be a corrupted spell file. */ | |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
701 emsg(_(e_format)); |
| 307 | 702 return; |
| 703 } | |
| 300 | 704 endlen[endidxcnt] = wlen; |
| 705 endidx[endidxcnt++] = arridx++; | |
| 706 --len; | |
| 707 | |
| 708 /* Skip over the zeros, there can be several flag/region | |
| 709 * combinations. */ | |
| 710 while (len > 0 && byts[arridx] == 0) | |
| 711 { | |
| 712 ++arridx; | |
| 713 --len; | |
| 714 } | |
| 715 if (len == 0) | |
| 716 break; /* no children, word must end here */ | |
| 717 } | |
| 718 | |
| 719 /* Stop looking at end of the line. */ | |
| 720 if (ptr[wlen] == NUL) | |
| 721 break; | |
| 722 | |
| 723 /* Perform a binary search in the list of accepted bytes. */ | |
| 724 c = ptr[wlen]; | |
| 346 | 725 if (c == TAB) /* <Tab> is handled like <Space> */ |
| 726 c = ' '; | |
| 300 | 727 lo = arridx; |
| 728 hi = arridx + len - 1; | |
| 729 while (lo < hi) | |
| 730 { | |
| 731 m = (lo + hi) / 2; | |
| 732 if (byts[m] > c) | |
| 733 hi = m - 1; | |
| 734 else if (byts[m] < c) | |
| 735 lo = m + 1; | |
| 736 else | |
| 737 { | |
| 738 lo = hi = m; | |
| 739 break; | |
| 236 | 740 } |
| 741 } | |
| 300 | 742 |
| 743 /* Stop if there is no matching byte. */ | |
| 744 if (hi < lo || byts[lo] != c) | |
| 745 break; | |
| 746 | |
| 747 /* Continue at the child (if there is one). */ | |
| 748 arridx = idxs[lo]; | |
| 749 ++wlen; | |
| 750 --flen; | |
| 346 | 751 |
| 752 /* One space in the good word may stand for several spaces in the | |
| 753 * checked word. */ | |
| 754 if (c == ' ') | |
| 755 { | |
| 756 for (;;) | |
| 757 { | |
| 758 if (flen <= 0 && *mip->mi_fend != NUL) | |
| 759 flen = fold_more(mip); | |
| 760 if (ptr[wlen] != ' ' && ptr[wlen] != TAB) | |
| 761 break; | |
| 762 ++wlen; | |
| 763 --flen; | |
| 764 } | |
| 765 } | |
| 236 | 766 } |
| 767 | |
| 300 | 768 /* |
| 769 * Verify that one of the possible endings is valid. Try the longest | |
| 770 * first. | |
| 771 */ | |
| 772 while (endidxcnt > 0) | |
| 773 { | |
| 774 --endidxcnt; | |
| 775 arridx = endidx[endidxcnt]; | |
| 776 wlen = endlen[endidxcnt]; | |
| 236 | 777 |
| 300 | 778 if ((*mb_head_off)(ptr, ptr + wlen) > 0) |
| 779 continue; /* not at first byte of character */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
780 if (spell_iswordp(ptr + wlen, mip->mi_win)) |
| 481 | 781 { |
| 492 | 782 if (slang->sl_compprog == NULL && !slang->sl_nobreak) |
| 481 | 783 continue; /* next char is a word character */ |
| 784 word_ends = FALSE; | |
| 785 } | |
| 786 else | |
| 787 word_ends = TRUE; | |
| 485 | 788 /* The prefix flag is before compound flags. Once a valid prefix flag |
| 789 * has been found we try compound flags. */ | |
| 790 prefix_found = FALSE; | |
| 300 | 791 |
| 339 | 792 if (mode != FIND_KEEPWORD && has_mbyte) |
| 300 | 793 { |
| 794 /* Compute byte length in original word, length may change | |
| 339 | 795 * when folding case. This can be slow, take a shortcut when the |
| 796 * case-folded word is equal to the keep-case word. */ | |
| 300 | 797 p = mip->mi_word; |
| 339 | 798 if (STRNCMP(ptr, p, wlen) != 0) |
| 799 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
800 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
|
801 MB_PTR_ADV(p); |
| 835 | 802 wlen = (int)(p - mip->mi_word); |
| 339 | 803 } |
| 300 | 804 } |
| 236 | 805 |
| 339 | 806 /* Check flags and region. For FIND_PREFIX check the condition and |
| 807 * prefix ID. | |
| 808 * Repeat this if there are more flags/region alternatives until there | |
| 809 * is a match. */ | |
| 810 res = SP_BAD; | |
| 811 for (len = byts[arridx - 1]; len > 0 && byts[arridx] == 0; | |
| 812 --len, ++arridx) | |
| 300 | 813 { |
| 814 flags = idxs[arridx]; | |
| 324 | 815 |
| 339 | 816 /* For the fold-case tree check that the case of the checked word |
| 817 * matches with what the word in the tree requires. | |
| 818 * For keep-case tree the case is always right. For prefixes we | |
| 819 * don't bother to check. */ | |
| 820 if (mode == FIND_FOLDWORD) | |
| 300 | 821 { |
| 822 if (mip->mi_cend != mip->mi_word + wlen) | |
| 823 { | |
| 323 | 824 /* mi_capflags was set for a different word length, need |
| 825 * to do it again. */ | |
| 300 | 826 mip->mi_cend = mip->mi_word + wlen; |
| 323 | 827 mip->mi_capflags = captype(mip->mi_word, mip->mi_cend); |
| 300 | 828 } |
| 829 | |
| 346 | 830 if (mip->mi_capflags == WF_KEEPCAP |
| 831 || !spell_valid_case(mip->mi_capflags, flags)) | |
| 339 | 832 continue; |
| 300 | 833 } |
| 236 | 834 |
| 339 | 835 /* When mode is FIND_PREFIX the word must support the prefix: |
| 836 * check the prefix ID and the condition. Do that for the list at | |
| 366 | 837 * mip->mi_prefarridx that find_prefix() filled. */ |
| 485 | 838 else if (mode == FIND_PREFIX && !prefix_found) |
| 481 | 839 { |
| 366 | 840 c = valid_word_prefix(mip->mi_prefcnt, mip->mi_prefarridx, |
| 390 | 841 flags, |
| 455 | 842 mip->mi_word + mip->mi_cprefixlen, slang, |
| 843 FALSE); | |
| 366 | 844 if (c == 0) |
| 339 | 845 continue; |
| 366 | 846 |
| 847 /* Use the WF_RARE flag for a rare prefix. */ | |
| 848 if (c & WF_RAREPFX) | |
| 849 flags |= WF_RARE; | |
| 485 | 850 prefix_found = TRUE; |
| 339 | 851 } |
| 852 | |
| 492 | 853 if (slang->sl_nobreak) |
| 854 { | |
| 855 if ((mode == FIND_COMPOUND || mode == FIND_KEEPCOMPOUND) | |
| 856 && (flags & WF_BANNED) == 0) | |
| 857 { | |
| 858 /* NOBREAK: found a valid following word. That's all we | |
| 859 * need to know, so return. */ | |
| 860 mip->mi_result = SP_OK; | |
| 861 break; | |
| 862 } | |
| 863 } | |
| 864 | |
| 865 else if ((mode == FIND_COMPOUND || mode == FIND_KEEPCOMPOUND | |
| 866 || !word_ends)) | |
| 481 | 867 { |
| 974 | 868 /* If there is no compound flag or the word is shorter than |
| 483 | 869 * COMPOUNDMIN reject it quickly. |
| 870 * Makes you wonder why someone puts a compound flag on a word | |
| 481 | 871 * that's too short... Myspell compatibility requires this |
| 872 * anyway. */ | |
| 490 | 873 if (((unsigned)flags >> 24) == 0 |
| 874 || wlen - mip->mi_compoff < slang->sl_compminlen) | |
| 483 | 875 continue; |
| 500 | 876 /* For multi-byte chars check character length against |
| 877 * COMPOUNDMIN. */ | |
| 878 if (has_mbyte | |
| 501 | 879 && slang->sl_compminlen > 0 |
| 500 | 880 && mb_charlen_len(mip->mi_word + mip->mi_compoff, |
| 881 wlen - mip->mi_compoff) < slang->sl_compminlen) | |
| 882 continue; | |
| 483 | 883 |
| 809 | 884 /* Limit the number of compound words to COMPOUNDWORDMAX if no |
| 490 | 885 * maximum for syllables is specified. */ |
| 809 | 886 if (!word_ends && mip->mi_complen + mip->mi_compextra + 2 |
| 887 > slang->sl_compmax | |
| 490 | 888 && slang->sl_compsylmax == MAXWLEN) |
| 483 | 889 continue; |
| 890 | |
| 819 | 891 /* Don't allow compounding on a side where an affix was added, |
| 892 * unless COMPOUNDPERMITFLAG was used. */ | |
| 893 if (mip->mi_complen > 0 && (flags & WF_NOCOMPBEF)) | |
| 894 continue; | |
| 895 if (!word_ends && (flags & WF_NOCOMPAFT)) | |
| 896 continue; | |
| 897 | |
| 485 | 898 /* Quickly check if compounding is possible with this flag. */ |
| 495 | 899 if (!byte_in_str(mip->mi_complen == 0 |
| 485 | 900 ? slang->sl_compstartflags |
| 901 : slang->sl_compallflags, | |
| 495 | 902 ((unsigned)flags >> 24))) |
| 481 | 903 continue; |
| 904 | |
| 1762 | 905 /* If there is a match with a CHECKCOMPOUNDPATTERN rule |
| 906 * discard the compound word. */ | |
| 907 if (match_checkcompoundpattern(ptr, wlen, &slang->sl_comppat)) | |
| 908 continue; | |
| 909 | |
| 490 | 910 if (mode == FIND_COMPOUND) |
| 911 { | |
| 912 int capflags; | |
| 913 | |
| 914 /* Need to check the caps type of the appended compound | |
| 915 * word. */ | |
| 916 if (has_mbyte && STRNCMP(ptr, mip->mi_word, | |
| 917 mip->mi_compoff) != 0) | |
| 918 { | |
| 919 /* case folding may have changed the length */ | |
| 920 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
|
921 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
|
922 MB_PTR_ADV(p); |
| 490 | 923 } |
| 924 else | |
| 925 p = mip->mi_word + mip->mi_compoff; | |
| 926 capflags = captype(p, mip->mi_word + wlen); | |
| 927 if (capflags == WF_KEEPCAP || (capflags == WF_ALLCAP | |
| 928 && (flags & WF_FIXCAP) != 0)) | |
| 929 continue; | |
| 930 | |
| 931 if (capflags != WF_ALLCAP) | |
| 932 { | |
| 933 /* When the character before the word is a word | |
| 934 * character we do not accept a Onecap word. We do | |
| 935 * accept a no-caps word, even when the dictionary | |
| 936 * word specifies ONECAP. */ | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
937 MB_PTR_BACK(mip->mi_word, p); |
| 5477 | 938 if (spell_iswordp_nmw(p, mip->mi_win) |
| 490 | 939 ? capflags == WF_ONECAP |
| 940 : (flags & WF_ONECAP) != 0 | |
| 941 && capflags != WF_ONECAP) | |
| 942 continue; | |
| 943 } | |
| 944 } | |
| 945 | |
| 483 | 946 /* If the word ends the sequence of compound flags of the |
| 714 | 947 * words must match with one of the COMPOUNDRULE items and |
| 483 | 948 * the number of syllables must not be too large. */ |
| 949 mip->mi_compflags[mip->mi_complen] = ((unsigned)flags >> 24); | |
| 950 mip->mi_compflags[mip->mi_complen + 1] = NUL; | |
| 951 if (word_ends) | |
| 952 { | |
| 953 char_u fword[MAXWLEN]; | |
| 954 | |
| 955 if (slang->sl_compsylmax < MAXWLEN) | |
| 956 { | |
| 957 /* "fword" is only needed for checking syllables. */ | |
| 958 if (ptr == mip->mi_word) | |
| 959 (void)spell_casefold(ptr, wlen, fword, MAXWLEN); | |
| 960 else | |
| 961 vim_strncpy(fword, ptr, endlen[endidxcnt]); | |
| 962 } | |
| 963 if (!can_compound(slang, fword, mip->mi_compflags)) | |
| 964 continue; | |
| 965 } | |
| 1762 | 966 else if (slang->sl_comprules != NULL |
| 967 && !match_compoundrule(slang, mip->mi_compflags)) | |
| 968 /* The compound flags collected so far do not match any | |
| 969 * COMPOUNDRULE, discard the compounded word. */ | |
| 970 continue; | |
| 481 | 971 } |
| 972 | |
| 500 | 973 /* Check NEEDCOMPOUND: can't use word without compounding. */ |
| 974 else if (flags & WF_NEEDCOMP) | |
| 975 continue; | |
| 976 | |
| 492 | 977 nobreak_result = SP_OK; |
| 978 | |
| 481 | 979 if (!word_ends) |
| 980 { | |
| 492 | 981 int save_result = mip->mi_result; |
| 982 char_u *save_end = mip->mi_end; | |
| 501 | 983 langp_T *save_lp = mip->mi_lp; |
| 984 int lpi; | |
| 492 | 985 |
| 986 /* Check that a valid word follows. If there is one and we | |
| 987 * are compounding, it will set "mi_result", thus we are | |
| 988 * always finished here. For NOBREAK we only check that a | |
| 989 * valid word follows. | |
| 481 | 990 * Recursive! */ |
| 492 | 991 if (slang->sl_nobreak) |
| 992 mip->mi_result = SP_BAD; | |
| 481 | 993 |
| 994 /* Find following word in case-folded tree. */ | |
| 995 mip->mi_compoff = endlen[endidxcnt]; | |
| 996 if (has_mbyte && mode == FIND_KEEPWORD) | |
| 997 { | |
| 998 /* Compute byte length in case-folded word from "wlen": | |
| 999 * byte length in keep-case word. Length may change when | |
| 1000 * folding case. This can be slow, take a shortcut when | |
| 1001 * the case-folded word is equal to the keep-case word. */ | |
| 1002 p = mip->mi_fword; | |
| 1003 if (STRNCMP(ptr, p, wlen) != 0) | |
| 1004 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
1005 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
|
1006 MB_PTR_ADV(p); |
| 835 | 1007 mip->mi_compoff = (int)(p - mip->mi_fword); |
| 481 | 1008 } |
| 1009 } | |
|
8956
d9e671c5afe6
commit https://github.com/vim/vim/commit/ba53435144f46eaaa53c63a62e748b3feee9742c
Christian Brabandt <cb@256bit.org>
parents:
8524
diff
changeset
|
1010 #if 0 /* Disabled, see below */ |
| 485 | 1011 c = mip->mi_compoff; |
|
8956
d9e671c5afe6
commit https://github.com/vim/vim/commit/ba53435144f46eaaa53c63a62e748b3feee9742c
Christian Brabandt <cb@256bit.org>
parents:
8524
diff
changeset
|
1012 #endif |
| 483 | 1013 ++mip->mi_complen; |
| 809 | 1014 if (flags & WF_COMPROOT) |
| 1015 ++mip->mi_compextra; | |
| 501 | 1016 |
| 1017 /* For NOBREAK we need to try all NOBREAK languages, at least | |
| 1018 * to find the ".add" file(s). */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1019 for (lpi = 0; lpi < mip->mi_win->w_s->b_langp.ga_len; ++lpi) |
| 501 | 1020 { |
| 1021 if (slang->sl_nobreak) | |
| 1022 { | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1023 mip->mi_lp = LANGP_ENTRY(mip->mi_win->w_s->b_langp, lpi); |
| 501 | 1024 if (mip->mi_lp->lp_slang->sl_fidxs == NULL |
| 1025 || !mip->mi_lp->lp_slang->sl_nobreak) | |
| 1026 continue; | |
| 1027 } | |
| 1028 | |
| 1029 find_word(mip, FIND_COMPOUND); | |
| 1030 | |
| 1031 /* When NOBREAK any word that matches is OK. Otherwise we | |
| 1032 * need to find the longest match, thus try with keep-case | |
| 1033 * and prefix too. */ | |
| 492 | 1034 if (!slang->sl_nobreak || mip->mi_result == SP_BAD) |
| 1035 { | |
| 501 | 1036 /* Find following word in keep-case tree. */ |
| 1037 mip->mi_compoff = wlen; | |
| 1038 find_word(mip, FIND_KEEPCOMPOUND); | |
| 1039 | |
| 819 | 1040 #if 0 /* Disabled, a prefix must not appear halfway a compound word, |
| 1041 unless the COMPOUNDPERMITFLAG is used and then it can't be a | |
| 1042 postponed prefix. */ | |
| 501 | 1043 if (!slang->sl_nobreak || mip->mi_result == SP_BAD) |
| 1044 { | |
| 1045 /* Check for following word with prefix. */ | |
| 1046 mip->mi_compoff = c; | |
| 1047 find_prefix(mip, FIND_COMPOUND); | |
| 1048 } | |
| 819 | 1049 #endif |
| 492 | 1050 } |
| 501 | 1051 |
| 1052 if (!slang->sl_nobreak) | |
| 1053 break; | |
| 492 | 1054 } |
| 483 | 1055 --mip->mi_complen; |
| 809 | 1056 if (flags & WF_COMPROOT) |
| 1057 --mip->mi_compextra; | |
| 501 | 1058 mip->mi_lp = save_lp; |
| 485 | 1059 |
| 492 | 1060 if (slang->sl_nobreak) |
| 1061 { | |
| 1062 nobreak_result = mip->mi_result; | |
| 1063 mip->mi_result = save_result; | |
| 1064 mip->mi_end = save_end; | |
| 1065 } | |
| 1066 else | |
| 1067 { | |
| 1068 if (mip->mi_result == SP_OK) | |
| 1069 break; | |
| 1070 continue; | |
| 1071 } | |
| 481 | 1072 } |
| 1073 | |
| 339 | 1074 if (flags & WF_BANNED) |
| 1075 res = SP_BANNED; | |
| 1076 else if (flags & WF_REGION) | |
| 1077 { | |
| 1078 /* Check region. */ | |
| 390 | 1079 if ((mip->mi_lp->lp_region & (flags >> 16)) != 0) |
| 300 | 1080 res = SP_OK; |
| 339 | 1081 else |
| 1082 res = SP_LOCAL; | |
| 300 | 1083 } |
| 339 | 1084 else if (flags & WF_RARE) |
| 1085 res = SP_RARE; | |
| 307 | 1086 else |
| 339 | 1087 res = SP_OK; |
| 1088 | |
| 492 | 1089 /* Always use the longest match and the best result. For NOBREAK |
| 1090 * we separately keep the longest match without a following good | |
| 1091 * word as a fall-back. */ | |
| 1092 if (nobreak_result == SP_BAD) | |
| 1093 { | |
| 1094 if (mip->mi_result2 > res) | |
| 1095 { | |
| 1096 mip->mi_result2 = res; | |
| 1097 mip->mi_end2 = mip->mi_word + wlen; | |
| 1098 } | |
| 1099 else if (mip->mi_result2 == res | |
| 1100 && mip->mi_end2 < mip->mi_word + wlen) | |
| 1101 mip->mi_end2 = mip->mi_word + wlen; | |
| 1102 } | |
| 1103 else if (mip->mi_result > res) | |
| 339 | 1104 { |
| 1105 mip->mi_result = res; | |
| 1106 mip->mi_end = mip->mi_word + wlen; | |
| 1107 } | |
| 351 | 1108 else if (mip->mi_result == res && mip->mi_end < mip->mi_word + wlen) |
| 339 | 1109 mip->mi_end = mip->mi_word + wlen; |
| 1110 | |
| 492 | 1111 if (mip->mi_result == SP_OK) |
| 339 | 1112 break; |
| 300 | 1113 } |
| 1114 | |
| 492 | 1115 if (mip->mi_result == SP_OK) |
| 300 | 1116 break; |
| 1117 } | |
| 236 | 1118 } |
| 1119 | |
| 323 | 1120 /* |
| 1762 | 1121 * Return TRUE if there is a match between the word ptr[wlen] and |
| 1122 * CHECKCOMPOUNDPATTERN rules, assuming that we will concatenate with another | |
| 1123 * word. | |
| 1124 * A match means that the first part of CHECKCOMPOUNDPATTERN matches at the | |
| 1125 * end of ptr[wlen] and the second part matches after it. | |
| 1126 */ | |
| 1127 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1128 match_checkcompoundpattern( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1129 char_u *ptr, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1130 int wlen, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1131 garray_T *gap) /* &sl_comppat */ |
| 1762 | 1132 { |
| 1133 int i; | |
| 1134 char_u *p; | |
| 1135 int len; | |
| 1136 | |
| 1137 for (i = 0; i + 1 < gap->ga_len; i += 2) | |
| 1138 { | |
| 1139 p = ((char_u **)gap->ga_data)[i + 1]; | |
| 1140 if (STRNCMP(ptr + wlen, p, STRLEN(p)) == 0) | |
| 1141 { | |
| 1142 /* Second part matches at start of following compound word, now | |
| 1143 * check if first part matches at end of previous word. */ | |
| 1144 p = ((char_u **)gap->ga_data)[i]; | |
| 1771 | 1145 len = (int)STRLEN(p); |
| 1762 | 1146 if (len <= wlen && STRNCMP(ptr + wlen - len, p, len) == 0) |
| 1147 return TRUE; | |
| 1148 } | |
| 1149 } | |
| 1150 return FALSE; | |
| 1151 } | |
| 1152 | |
| 1153 /* | |
| 626 | 1154 * Return TRUE if "flags" is a valid sequence of compound flags and "word" |
| 1155 * does not have too many syllables. | |
| 482 | 1156 */ |
| 1157 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1158 can_compound(slang_T *slang, char_u *word, char_u *flags) |
| 483 | 1159 { |
| 495 | 1160 char_u uflags[MAXWLEN * 2]; |
| 1161 int i; | |
| 1162 char_u *p; | |
| 483 | 1163 |
| 1164 if (slang->sl_compprog == NULL) | |
| 1165 return FALSE; | |
| 495 | 1166 if (enc_utf8) |
| 1167 { | |
| 1168 /* Need to convert the single byte flags to utf8 characters. */ | |
| 1169 p = uflags; | |
| 1170 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
|
1171 p += utf_char2bytes(flags[i], p); |
| 495 | 1172 *p = NUL; |
| 1173 p = uflags; | |
| 1174 } | |
| 1175 else | |
| 1176 p = flags; | |
| 6375 | 1177 if (!vim_regexec_prog(&slang->sl_compprog, FALSE, p, 0)) |
| 483 | 1178 return FALSE; |
| 1179 | |
| 490 | 1180 /* Count the number of syllables. This may be slow, do it last. If there |
| 1181 * are too many syllables AND the number of compound words is above | |
| 809 | 1182 * COMPOUNDWORDMAX then compounding is not allowed. */ |
| 483 | 1183 if (slang->sl_compsylmax < MAXWLEN |
| 1184 && count_syllables(slang, word) > slang->sl_compsylmax) | |
| 495 | 1185 return (int)STRLEN(flags) < slang->sl_compmax; |
| 483 | 1186 return TRUE; |
| 482 | 1187 } |
| 1188 | |
| 1189 /* | |
| 1762 | 1190 * Return TRUE when the sequence of flags in "compflags" plus "flag" can |
| 1191 * possibly form a valid compounded word. This also checks the COMPOUNDRULE | |
| 1192 * lines if they don't contain wildcards. | |
| 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_be_compound( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1196 trystate_T *sp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1197 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1198 char_u *compflags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1199 int flag) |
| 1762 | 1200 { |
| 1201 /* If the flag doesn't appear in sl_compstartflags or sl_compallflags | |
| 1202 * then it can't possibly compound. */ | |
| 1203 if (!byte_in_str(sp->ts_complen == sp->ts_compsplit | |
| 1204 ? slang->sl_compstartflags : slang->sl_compallflags, flag)) | |
| 1205 return FALSE; | |
| 1206 | |
| 1207 /* If there are no wildcards, we can check if the flags collected so far | |
| 1208 * possibly can form a match with COMPOUNDRULE patterns. This only | |
| 1209 * makes sense when we have two or more words. */ | |
| 1210 if (slang->sl_comprules != NULL && sp->ts_complen > sp->ts_compsplit) | |
| 1211 { | |
| 1212 int v; | |
| 1213 | |
| 1214 compflags[sp->ts_complen] = flag; | |
| 1215 compflags[sp->ts_complen + 1] = NUL; | |
| 1216 v = match_compoundrule(slang, compflags + sp->ts_compsplit); | |
| 1217 compflags[sp->ts_complen] = NUL; | |
| 1218 return v; | |
| 1219 } | |
| 1220 | |
| 1221 return TRUE; | |
| 1222 } | |
| 1223 | |
| 1224 | |
| 1225 /* | |
| 1226 * Return TRUE if the compound flags in compflags[] match the start of any | |
| 1227 * compound rule. This is used to stop trying a compound if the flags | |
| 1228 * collected so far can't possibly match any compound rule. | |
| 1229 * Caller must check that slang->sl_comprules is not NULL. | |
| 1230 */ | |
| 1231 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1232 match_compoundrule(slang_T *slang, char_u *compflags) |
| 1762 | 1233 { |
| 1234 char_u *p; | |
| 1235 int i; | |
| 1236 int c; | |
| 1237 | |
| 1238 /* loop over all the COMPOUNDRULE entries */ | |
| 1239 for (p = slang->sl_comprules; *p != NUL; ++p) | |
| 1240 { | |
| 1241 /* loop over the flags in the compound word we have made, match | |
| 1242 * them against the current rule entry */ | |
| 1243 for (i = 0; ; ++i) | |
| 1244 { | |
| 1245 c = compflags[i]; | |
| 1246 if (c == NUL) | |
| 1247 /* found a rule that matches for the flags we have so far */ | |
| 1248 return TRUE; | |
| 1249 if (*p == '/' || *p == NUL) | |
| 1250 break; /* end of rule, it's too short */ | |
| 1251 if (*p == '[') | |
| 1252 { | |
| 1253 int match = FALSE; | |
| 1254 | |
| 1255 /* compare against all the flags in [] */ | |
| 1256 ++p; | |
| 1257 while (*p != ']' && *p != NUL) | |
| 1258 if (*p++ == c) | |
| 1259 match = TRUE; | |
| 1260 if (!match) | |
| 1261 break; /* none matches */ | |
| 1262 } | |
| 1263 else if (*p != c) | |
| 1264 break; /* flag of word doesn't match flag in pattern */ | |
| 1265 ++p; | |
| 1266 } | |
| 1267 | |
| 1268 /* Skip to the next "/", where the next pattern starts. */ | |
| 1269 p = vim_strchr(p, '/'); | |
| 1270 if (p == NULL) | |
| 1271 break; | |
| 1272 } | |
| 1273 | |
| 1274 /* Checked all the rules and none of them match the flags, so there | |
| 1275 * can't possibly be a compound starting with these flags. */ | |
| 1276 return FALSE; | |
| 1277 } | |
| 1278 | |
| 1279 /* | |
| 390 | 1280 * Return non-zero if the prefix indicated by "arridx" matches with the prefix |
| 1281 * ID in "flags" for the word "word". | |
| 366 | 1282 * The WF_RAREPFX flag is included in the return value for a rare prefix. |
| 351 | 1283 */ |
| 1284 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1285 valid_word_prefix( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1286 int totprefcnt, /* nr of prefix IDs */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1287 int arridx, /* idx in sl_pidxs[] */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1288 int flags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1289 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1290 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1291 int cond_req) /* only use prefixes with a condition */ |
| 351 | 1292 { |
| 1293 int prefcnt; | |
| 1294 int pidx; | |
| 6375 | 1295 regprog_T **rp; |
| 390 | 1296 int prefid; |
| 1297 | |
| 1298 prefid = (unsigned)flags >> 24; | |
| 351 | 1299 for (prefcnt = totprefcnt - 1; prefcnt >= 0; --prefcnt) |
| 1300 { | |
| 1301 pidx = slang->sl_pidxs[arridx + prefcnt]; | |
| 1302 | |
| 1303 /* Check the prefix ID. */ | |
| 1304 if (prefid != (pidx & 0xff)) | |
| 1305 continue; | |
| 1306 | |
| 390 | 1307 /* Check if the prefix doesn't combine and the word already has a |
| 1308 * suffix. */ | |
| 1309 if ((flags & WF_HAS_AFF) && (pidx & WF_PFX_NC)) | |
| 1310 continue; | |
| 1311 | |
| 351 | 1312 /* Check the condition, if there is one. The condition index is |
| 366 | 1313 * stored in the two bytes above the prefix ID byte. */ |
| 6375 | 1314 rp = &slang->sl_prefprog[((unsigned)pidx >> 8) & 0xffff]; |
| 1315 if (*rp != NULL) | |
| 1316 { | |
| 1317 if (!vim_regexec_prog(rp, FALSE, word, 0)) | |
| 351 | 1318 continue; |
| 1319 } | |
| 455 | 1320 else if (cond_req) |
| 1321 continue; | |
| 1322 | |
| 1323 /* It's a match! Return the WF_ flags. */ | |
| 366 | 1324 return pidx; |
| 1325 } | |
| 1326 return 0; | |
| 351 | 1327 } |
| 1328 | |
| 1329 /* | |
| 339 | 1330 * Check if the word at "mip->mi_word" has a matching prefix. |
| 1331 * If it does, then check the following word. | |
| 1332 * | |
| 485 | 1333 * If "mode" is "FIND_COMPOUND" then do the same after another word, find a |
| 1334 * prefix in a compound word. | |
| 1335 * | |
| 339 | 1336 * For a match mip->mi_result is updated. |
| 1337 */ | |
| 1338 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1339 find_prefix(matchinf_T *mip, int mode) |
| 339 | 1340 { |
| 1341 idx_T arridx = 0; | |
| 1342 int len; | |
| 1343 int wlen = 0; | |
| 1344 int flen; | |
| 1345 int c; | |
| 1346 char_u *ptr; | |
| 1347 idx_T lo, hi, m; | |
| 1348 slang_T *slang = mip->mi_lp->lp_slang; | |
| 1349 char_u *byts; | |
| 1350 idx_T *idxs; | |
| 1351 | |
| 375 | 1352 byts = slang->sl_pbyts; |
| 1353 if (byts == NULL) | |
| 1354 return; /* array is empty */ | |
| 1355 | |
| 339 | 1356 /* We use the case-folded word here, since prefixes are always |
| 1357 * case-folded. */ | |
| 1358 ptr = mip->mi_fword; | |
| 1359 flen = mip->mi_fwordlen; /* available case-folded bytes */ | |
| 485 | 1360 if (mode == FIND_COMPOUND) |
| 1361 { | |
| 1362 /* Skip over the previously found word(s). */ | |
| 1363 ptr += mip->mi_compoff; | |
| 1364 flen -= mip->mi_compoff; | |
| 1365 } | |
| 339 | 1366 idxs = slang->sl_pidxs; |
| 1367 | |
| 1368 /* | |
| 1369 * Repeat advancing in the tree until: | |
| 1370 * - there is a byte that doesn't match, | |
| 1371 * - we reach the end of the tree, | |
| 1372 * - or we reach the end of the line. | |
| 1373 */ | |
| 1374 for (;;) | |
| 1375 { | |
| 1376 if (flen == 0 && *mip->mi_fend != NUL) | |
| 1377 flen = fold_more(mip); | |
| 1378 | |
| 1379 len = byts[arridx++]; | |
| 1380 | |
| 1381 /* If the first possible byte is a zero the prefix could end here. | |
| 1382 * Check if the following word matches and supports the prefix. */ | |
| 1383 if (byts[arridx] == 0) | |
| 1384 { | |
| 1385 /* There can be several prefixes with different conditions. We | |
| 1386 * try them all, since we don't know which one will give the | |
| 1387 * longest match. The word is the same each time, pass the list | |
| 1388 * of possible prefixes to find_word(). */ | |
| 1389 mip->mi_prefarridx = arridx; | |
| 1390 mip->mi_prefcnt = len; | |
| 1391 while (len > 0 && byts[arridx] == 0) | |
| 1392 { | |
| 1393 ++arridx; | |
| 1394 --len; | |
| 1395 } | |
| 1396 mip->mi_prefcnt -= len; | |
| 1397 | |
| 1398 /* Find the word that comes after the prefix. */ | |
| 1399 mip->mi_prefixlen = wlen; | |
| 485 | 1400 if (mode == FIND_COMPOUND) |
| 1401 /* Skip over the previously found word(s). */ | |
| 1402 mip->mi_prefixlen += mip->mi_compoff; | |
| 1403 | |
| 455 | 1404 if (has_mbyte) |
| 1405 { | |
| 1406 /* Case-folded length may differ from original length. */ | |
| 485 | 1407 mip->mi_cprefixlen = nofold_len(mip->mi_fword, |
| 1408 mip->mi_prefixlen, mip->mi_word); | |
| 455 | 1409 } |
| 1410 else | |
| 485 | 1411 mip->mi_cprefixlen = mip->mi_prefixlen; |
| 339 | 1412 find_word(mip, FIND_PREFIX); |
| 1413 | |
| 1414 | |
| 1415 if (len == 0) | |
| 1416 break; /* no children, word must end here */ | |
| 1417 } | |
| 1418 | |
| 1419 /* Stop looking at end of the line. */ | |
| 1420 if (ptr[wlen] == NUL) | |
| 1421 break; | |
| 1422 | |
| 1423 /* Perform a binary search in the list of accepted bytes. */ | |
| 1424 c = ptr[wlen]; | |
| 1425 lo = arridx; | |
| 1426 hi = arridx + len - 1; | |
| 1427 while (lo < hi) | |
| 1428 { | |
| 1429 m = (lo + hi) / 2; | |
| 1430 if (byts[m] > c) | |
| 1431 hi = m - 1; | |
| 1432 else if (byts[m] < c) | |
| 1433 lo = m + 1; | |
| 1434 else | |
| 1435 { | |
| 1436 lo = hi = m; | |
| 1437 break; | |
| 1438 } | |
| 1439 } | |
| 1440 | |
| 1441 /* Stop if there is no matching byte. */ | |
| 1442 if (hi < lo || byts[lo] != c) | |
| 1443 break; | |
| 1444 | |
| 1445 /* Continue at the child (if there is one). */ | |
| 1446 arridx = idxs[lo]; | |
| 1447 ++wlen; | |
| 1448 --flen; | |
| 1449 } | |
| 1450 } | |
| 1451 | |
| 1452 /* | |
| 1453 * Need to fold at least one more character. Do until next non-word character | |
| 626 | 1454 * for efficiency. Include the non-word character too. |
| 339 | 1455 * Return the length of the folded chars in bytes. |
| 1456 */ | |
| 1457 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1458 fold_more(matchinf_T *mip) |
| 339 | 1459 { |
| 1460 int flen; | |
| 1461 char_u *p; | |
| 1462 | |
| 1463 p = mip->mi_fend; | |
| 1464 do | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
1465 MB_PTR_ADV(mip->mi_fend); |
|
16162
cd5c83115ec6
patch 8.1.1086: too many curly braces
Bram Moolenaar <Bram@vim.org>
parents:
16142
diff
changeset
|
1466 while (*mip->mi_fend != NUL && spell_iswordp(mip->mi_fend, mip->mi_win)); |
| 339 | 1467 |
| 626 | 1468 /* Include the non-word character so that we can check for the word end. */ |
| 339 | 1469 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
|
1470 MB_PTR_ADV(mip->mi_fend); |
| 339 | 1471 |
| 1472 (void)spell_casefold(p, (int)(mip->mi_fend - p), | |
| 1473 mip->mi_fword + mip->mi_fwordlen, | |
| 1474 MAXWLEN - mip->mi_fwordlen); | |
| 835 | 1475 flen = (int)STRLEN(mip->mi_fword + mip->mi_fwordlen); |
| 339 | 1476 mip->mi_fwordlen += flen; |
| 1477 return flen; | |
| 1478 } | |
| 1479 | |
| 1480 /* | |
| 323 | 1481 * Check case flags for a word. Return TRUE if the word has the requested |
| 1482 * case. | |
| 1483 */ | |
| 1484 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1485 spell_valid_case( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1486 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
|
1487 int treeflags) /* flags for the word in the spell tree */ |
| 323 | 1488 { |
| 389 | 1489 return ((wordflags == WF_ALLCAP && (treeflags & WF_FIXCAP) == 0) |
| 323 | 1490 || ((treeflags & (WF_ALLCAP | WF_KEEPCAP)) == 0 |
| 474 | 1491 && ((treeflags & WF_ONECAP) == 0 |
| 1492 || (wordflags & WF_ONECAP) != 0))); | |
| 323 | 1493 } |
| 1494 | |
| 351 | 1495 /* |
| 1496 * Return TRUE if spell checking is not enabled. | |
| 1497 */ | |
| 1498 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1499 no_spell_checking(win_T *wp) |
| 498 | 1500 { |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1501 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
|
1502 || wp->w_s->b_langp.ga_len == 0) |
| 351 | 1503 { |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
1504 emsg(_("E756: Spell checking is not enabled")); |
| 351 | 1505 return TRUE; |
| 1506 } | |
| 1507 return FALSE; | |
| 1508 } | |
| 300 | 1509 |
| 236 | 1510 /* |
| 1511 * Move to next spell error. | |
| 500 | 1512 * "curline" is FALSE for "[s", "]s", "[S" and "]S". |
| 1513 * "curline" is TRUE to find word under/after cursor in the same line. | |
| 483 | 1514 * For Insert mode completion "dir" is BACKWARD and "curline" is TRUE: move |
| 1515 * to after badly spelled word before the cursor. | |
| 495 | 1516 * Return 0 if not found, length of the badly spelled word otherwise. |
| 236 | 1517 */ |
| 1518 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1519 spell_move_to( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1520 win_T *wp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1521 int dir, /* FORWARD or BACKWARD */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1522 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
|
1523 int curline, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1524 hlf_T *attrp) /* return: attributes of bad word or NULL |
| 534 | 1525 (only when "dir" is FORWARD) */ |
| 236 | 1526 { |
| 249 | 1527 linenr_T lnum; |
| 1528 pos_T found_pos; | |
| 495 | 1529 int found_len = 0; |
| 236 | 1530 char_u *line; |
| 1531 char_u *p; | |
| 346 | 1532 char_u *endp; |
| 534 | 1533 hlf_T attr; |
| 236 | 1534 int len; |
| 5519 | 1535 #ifdef FEAT_SYN_HL |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
1536 int has_syntax = syntax_present(wp); |
| 5519 | 1537 #endif |
| 249 | 1538 int col; |
| 1539 int can_spell; | |
| 346 | 1540 char_u *buf = NULL; |
| 1541 int buflen = 0; | |
| 1542 int skip = 0; | |
| 385 | 1543 int capcol = -1; |
| 500 | 1544 int found_one = FALSE; |
| 1545 int wrapped = FALSE; | |
| 236 | 1546 |
| 498 | 1547 if (no_spell_checking(wp)) |
| 495 | 1548 return 0; |
| 236 | 1549 |
| 249 | 1550 /* |
| 1551 * Start looking for bad word at the start of the line, because we can't | |
| 817 | 1552 * start halfway a word, we don't know where it starts or ends. |
| 249 | 1553 * |
| 1554 * When searching backwards, we continue in the line to find the last | |
| 1555 * bad word (in the cursor line: before the cursor). | |
| 346 | 1556 * |
| 1557 * We concatenate the start of the next line, so that wrapped words work | |
| 1558 * (e.g. "et<line-break>cetera"). Doesn't work when searching backwards | |
| 1559 * though... | |
| 249 | 1560 */ |
| 498 | 1561 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
|
1562 CLEAR_POS(&found_pos); |
| 236 | 1563 |
| 1564 while (!got_int) | |
| 1565 { | |
| 498 | 1566 line = ml_get_buf(wp->w_buffer, lnum, FALSE); |
| 346 | 1567 |
| 835 | 1568 len = (int)STRLEN(line); |
| 346 | 1569 if (buflen < len + MAXWLEN + 2) |
| 1570 { | |
| 1571 vim_free(buf); | |
| 1572 buflen = len + MAXWLEN + 2; | |
| 1573 buf = alloc(buflen); | |
| 1574 if (buf == NULL) | |
| 1575 break; | |
| 1576 } | |
| 1577 | |
| 385 | 1578 /* In first line check first word for Capital. */ |
| 1579 if (lnum == 1) | |
| 1580 capcol = 0; | |
| 1581 | |
| 1582 /* For checking first word with a capital skip white space. */ | |
| 1583 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
|
1584 capcol = getwhitecols(line); |
| 835 | 1585 else if (curline && wp == curwin) |
| 1586 { | |
| 1587 /* 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
|
1588 col = getwhitecols(line); |
| 835 | 1589 if (check_need_cap(lnum, col)) |
| 1590 capcol = col; | |
| 1591 | |
| 1592 /* Need to get the line again, may have looked at the previous | |
| 1593 * one. */ | |
| 1594 line = ml_get_buf(wp->w_buffer, lnum, FALSE); | |
| 1595 } | |
| 385 | 1596 |
| 346 | 1597 /* Copy the line into "buf" and append the start of the next line if |
| 1598 * possible. */ | |
| 1599 STRCPY(buf, line); | |
| 498 | 1600 if (lnum < wp->w_buffer->b_ml.ml_line_count) |
| 883 | 1601 spell_cat_line(buf + STRLEN(buf), |
| 1602 ml_get_buf(wp->w_buffer, lnum + 1, FALSE), MAXWLEN); | |
| 346 | 1603 |
| 1604 p = buf + skip; | |
| 1605 endp = buf + len; | |
| 1606 while (p < endp) | |
| 236 | 1607 { |
| 500 | 1608 /* When searching backward don't search after the cursor. Unless |
| 1609 * we wrapped around the end of the buffer. */ | |
| 300 | 1610 if (dir == BACKWARD |
| 498 | 1611 && lnum == wp->w_cursor.lnum |
| 500 | 1612 && !wrapped |
| 498 | 1613 && (colnr_T)(p - buf) >= wp->w_cursor.col) |
| 300 | 1614 break; |
| 249 | 1615 |
| 300 | 1616 /* start of word */ |
| 534 | 1617 attr = HLF_COUNT; |
| 625 | 1618 len = spell_check(wp, p, &attr, &capcol, FALSE); |
| 249 | 1619 |
| 534 | 1620 if (attr != HLF_COUNT) |
| 300 | 1621 { |
| 1622 /* We found a bad word. Check the attribute. */ | |
| 534 | 1623 if (allwords || attr == HLF_SPB) |
| 236 | 1624 { |
| 300 | 1625 /* When searching forward only accept a bad word after |
| 1626 * the cursor. */ | |
| 1627 if (dir == BACKWARD | |
| 500 | 1628 || lnum != wp->w_cursor.lnum |
| 498 | 1629 || (lnum == wp->w_cursor.lnum |
| 500 | 1630 && (wrapped |
| 1631 || (colnr_T)(curline ? p - buf + len | |
| 346 | 1632 : p - buf) |
| 500 | 1633 > wp->w_cursor.col))) |
| 236 | 1634 { |
| 5519 | 1635 #ifdef FEAT_SYN_HL |
| 300 | 1636 if (has_syntax) |
| 249 | 1637 { |
| 835 | 1638 col = (int)(p - buf); |
| 498 | 1639 (void)syn_get_id(wp, lnum, (colnr_T)col, |
| 1504 | 1640 FALSE, &can_spell, FALSE); |
| 857 | 1641 if (!can_spell) |
| 1642 attr = HLF_COUNT; | |
| 300 | 1643 } |
| 1644 else | |
| 737 | 1645 #endif |
| 300 | 1646 can_spell = TRUE; |
| 249 | 1647 |
| 300 | 1648 if (can_spell) |
| 1649 { | |
| 857 | 1650 found_one = TRUE; |
| 300 | 1651 found_pos.lnum = lnum; |
| 835 | 1652 found_pos.col = (int)(p - buf); |
| 300 | 1653 found_pos.coladd = 0; |
| 1654 if (dir == FORWARD) | |
| 1655 { | |
| 1656 /* No need to search further. */ | |
| 498 | 1657 wp->w_cursor = found_pos; |
| 346 | 1658 vim_free(buf); |
| 498 | 1659 if (attrp != NULL) |
| 1660 *attrp = attr; | |
| 495 | 1661 return len; |
| 249 | 1662 } |
| 483 | 1663 else if (curline) |
| 1664 /* Insert mode completion: put cursor after | |
| 1665 * the bad word. */ | |
| 1666 found_pos.col += len; | |
| 495 | 1667 found_len = len; |
| 249 | 1668 } |
| 236 | 1669 } |
| 857 | 1670 else |
| 1671 found_one = TRUE; | |
| 236 | 1672 } |
| 1673 } | |
| 1674 | |
| 300 | 1675 /* advance to character after the word */ |
| 1676 p += len; | |
| 385 | 1677 capcol -= len; |
| 236 | 1678 } |
| 1679 | |
| 483 | 1680 if (dir == BACKWARD && found_pos.lnum != 0) |
| 1681 { | |
| 500 | 1682 /* Use the last match in the line (before the cursor). */ |
| 498 | 1683 wp->w_cursor = found_pos; |
| 483 | 1684 vim_free(buf); |
| 495 | 1685 return found_len; |
| 483 | 1686 } |
| 1687 | |
| 323 | 1688 if (curline) |
| 346 | 1689 break; /* only check cursor line */ |
| 323 | 1690 |
|
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
|
1691 /* 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
|
1692 * 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
|
1693 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
|
1694 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
|
1695 |
| 236 | 1696 /* Advance to next line. */ |
| 249 | 1697 if (dir == BACKWARD) |
| 1698 { | |
| 500 | 1699 if (lnum > 1) |
| 1700 --lnum; | |
| 1701 else if (!p_ws) | |
| 1702 break; /* at first line and 'nowrapscan' */ | |
| 1703 else | |
| 1704 { | |
| 1705 /* Wrap around to the end of the buffer. May search the | |
| 1706 * starting line again and accept the last match. */ | |
| 1707 lnum = wp->w_buffer->b_ml.ml_line_count; | |
| 1708 wrapped = TRUE; | |
| 503 | 1709 if (!shortmess(SHM_SEARCH)) |
| 1710 give_warning((char_u *)_(top_bot_msg), TRUE); | |
| 500 | 1711 } |
| 385 | 1712 capcol = -1; |
| 249 | 1713 } |
| 1714 else | |
| 1715 { | |
| 500 | 1716 if (lnum < wp->w_buffer->b_ml.ml_line_count) |
| 1717 ++lnum; | |
| 1718 else if (!p_ws) | |
| 1719 break; /* at first line and 'nowrapscan' */ | |
| 1720 else | |
| 1721 { | |
| 1722 /* Wrap around to the start of the buffer. May search the | |
| 1723 * starting line again and accept the first match. */ | |
| 1724 lnum = 1; | |
| 1725 wrapped = TRUE; | |
| 503 | 1726 if (!shortmess(SHM_SEARCH)) |
| 1727 give_warning((char_u *)_(bot_top_msg), TRUE); | |
| 500 | 1728 } |
| 1729 | |
| 1730 /* If we are back at the starting line and there is no match then | |
| 1731 * 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
|
1732 if (lnum == wp->w_cursor.lnum && !found_one) |
| 346 | 1733 break; |
| 1734 | |
| 1735 /* Skip the characters at the start of the next line that were | |
| 1736 * included in a match crossing line boundaries. */ | |
| 534 | 1737 if (attr == HLF_COUNT) |
| 835 | 1738 skip = (int)(p - endp); |
| 346 | 1739 else |
| 1740 skip = 0; | |
| 385 | 1741 |
| 835 | 1742 /* Capcol skips over the inserted space. */ |
| 385 | 1743 --capcol; |
| 1744 | |
| 1745 /* But after empty line check first word in next line */ | |
| 1746 if (*skipwhite(line) == NUL) | |
| 1747 capcol = 0; | |
| 249 | 1748 } |
| 236 | 1749 |
| 1750 line_breakcheck(); | |
| 1751 } | |
| 1752 | |
| 346 | 1753 vim_free(buf); |
| 495 | 1754 return 0; |
| 346 | 1755 } |
| 1756 | |
| 1757 /* | |
| 1758 * For spell checking: concatenate the start of the following line "line" into | |
| 1759 * "buf", blanking-out special characters. Copy less then "maxlen" bytes. | |
| 1577 | 1760 * Keep the blanks at the start of the next line, this is used in win_line() |
| 1761 * to skip those bytes if the word was OK. | |
| 346 | 1762 */ |
| 1763 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1764 spell_cat_line(char_u *buf, char_u *line, int maxlen) |
| 346 | 1765 { |
| 1766 char_u *p; | |
| 1767 int n; | |
| 1768 | |
| 1769 p = skipwhite(line); | |
| 1770 while (vim_strchr((char_u *)"*#/\"\t", *p) != NULL) | |
| 1771 p = skipwhite(p + 1); | |
| 1772 | |
| 1773 if (*p != NUL) | |
| 1774 { | |
| 1577 | 1775 /* Only worth concatenating if there is something else than spaces to |
| 1776 * concatenate. */ | |
| 1777 n = (int)(p - line) + 1; | |
| 1778 if (n < maxlen - 1) | |
| 1779 { | |
| 1780 vim_memset(buf, ' ', n); | |
| 1781 vim_strncpy(buf + n, p, maxlen - 1 - n); | |
| 1782 } | |
| 346 | 1783 } |
| 236 | 1784 } |
| 1785 | |
| 626 | 1786 /* |
| 1787 * Structure used for the cookie argument of do_in_runtimepath(). | |
| 1788 */ | |
| 501 | 1789 typedef struct spelload_S |
| 1790 { | |
| 1791 char_u sl_lang[MAXWLEN + 1]; /* language name */ | |
| 1792 slang_T *sl_slang; /* resulting slang_T struct */ | |
| 1793 int sl_nobreak; /* NOBREAK language found */ | |
| 1794 } spelload_T; | |
| 1795 | |
| 236 | 1796 /* |
| 307 | 1797 * Load word list(s) for "lang" from Vim spell file(s). |
| 310 | 1798 * "lang" must be the language without the region: e.g., "en". |
| 236 | 1799 */ |
| 307 | 1800 static void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1801 spell_load_lang(char_u *lang) |
| 236 | 1802 { |
| 310 | 1803 char_u fname_enc[85]; |
| 236 | 1804 int r; |
| 501 | 1805 spelload_T sl; |
| 649 | 1806 int round; |
| 307 | 1807 |
| 310 | 1808 /* Copy the language name to pass it to spell_load_cb() as a cookie. |
| 307 | 1809 * It's truncated when an error is detected. */ |
| 501 | 1810 STRCPY(sl.sl_lang, lang); |
| 1811 sl.sl_slang = NULL; | |
| 1812 sl.sl_nobreak = FALSE; | |
| 307 | 1813 |
| 649 | 1814 /* We may retry when no spell file is found for the language, an |
| 1815 * autocommand may load it then. */ | |
| 1816 for (round = 1; round <= 2; ++round) | |
| 1817 { | |
| 1818 /* | |
| 1819 * Find the first spell file for "lang" in 'runtimepath' and load it. | |
| 1820 */ | |
| 1821 vim_snprintf((char *)fname_enc, sizeof(fname_enc) - 5, | |
| 2660 | 1822 #ifdef VMS |
| 1823 "spell/%s_%s.spl", | |
| 1824 #else | |
| 1825 "spell/%s.%s.spl", | |
| 1826 #endif | |
| 1827 lang, spell_enc()); | |
|
8524
2f57bbe870ea
commit https://github.com/vim/vim/commit/7f8989dd8a627af2185df381195351a913f3777f
Christian Brabandt <cb@256bit.org>
parents:
7835
diff
changeset
|
1828 r = do_in_runtimepath(fname_enc, 0, spell_load_cb, &sl); |
| 649 | 1829 |
| 1830 if (r == FAIL && *sl.sl_lang != NUL) | |
| 1831 { | |
| 1832 /* Try loading the ASCII version. */ | |
| 1833 vim_snprintf((char *)fname_enc, sizeof(fname_enc) - 5, | |
| 2660 | 1834 #ifdef VMS |
| 1835 "spell/%s_ascii.spl", | |
| 1836 #else | |
| 1837 "spell/%s.ascii.spl", | |
| 1838 #endif | |
| 1839 lang); | |
|
8524
2f57bbe870ea
commit https://github.com/vim/vim/commit/7f8989dd8a627af2185df381195351a913f3777f
Christian Brabandt <cb@256bit.org>
parents:
7835
diff
changeset
|
1840 r = do_in_runtimepath(fname_enc, 0, spell_load_cb, &sl); |
| 649 | 1841 |
| 1842 if (r == FAIL && *sl.sl_lang != NUL && round == 1 | |
| 1843 && apply_autocmds(EVENT_SPELLFILEMISSING, lang, | |
| 1844 curbuf->b_fname, FALSE, curbuf)) | |
| 1845 continue; | |
| 1846 break; | |
|
13380
69517d67421f
patch 8.0.1564: too many #ifdefs
Christian Brabandt <cb@256bit.org>
parents:
13308
diff
changeset
|
1847 } |
| 714 | 1848 break; |
| 307 | 1849 } |
| 1850 | |
| 1851 if (r == FAIL) | |
| 649 | 1852 { |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
1853 smsg( |
| 2660 | 1854 #ifdef VMS |
| 1855 _("Warning: Cannot find word list \"%s_%s.spl\" or \"%s_ascii.spl\""), | |
| 1856 #else | |
| 1857 _("Warning: Cannot find word list \"%s.%s.spl\" or \"%s.ascii.spl\""), | |
| 1858 #endif | |
| 483 | 1859 lang, spell_enc(), lang); |
| 649 | 1860 } |
| 501 | 1861 else if (sl.sl_slang != NULL) |
| 1862 { | |
| 626 | 1863 /* At least one file was loaded, now load ALL the additions. */ |
| 310 | 1864 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
|
1865 do_in_runtimepath(fname_enc, DIP_ALL, spell_load_cb, &sl); |
| 310 | 1866 } |
| 1867 } | |
| 1868 | |
| 1869 /* | |
| 1870 * Return the encoding used for spell checking: Use 'encoding', except that we | |
| 1871 * use "latin1" for "latin9". And limit to 60 characters (just in case). | |
| 1872 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
1873 char_u * |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1874 spell_enc(void) |
| 310 | 1875 { |
| 1876 | |
| 1877 if (STRLEN(p_enc) < 60 && STRCMP(p_enc, "iso-8859-15") != 0) | |
| 1878 return p_enc; | |
| 1879 return (char_u *)"latin1"; | |
| 236 | 1880 } |
| 1881 | |
| 1882 /* | |
| 385 | 1883 * Get the name of the .spl file for the internal wordlist into |
| 1884 * "fname[MAXPATHL]". | |
| 1885 */ | |
| 1886 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1887 int_wordlist_spl(char_u *fname) |
| 385 | 1888 { |
| 2660 | 1889 vim_snprintf((char *)fname, MAXPATHL, SPL_FNAME_TMPL, |
| 385 | 1890 int_wordlist, spell_enc()); |
| 1891 } | |
| 1892 | |
| 1893 /* | |
| 625 | 1894 * Allocate a new slang_T for language "lang". "lang" can be NULL. |
| 236 | 1895 * Caller must fill "sl_next". |
| 1896 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
1897 slang_T * |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1898 slang_alloc(char_u *lang) |
| 236 | 1899 { |
| 1900 slang_T *lp; | |
| 1901 | |
| 300 | 1902 lp = (slang_T *)alloc_clear(sizeof(slang_T)); |
| 236 | 1903 if (lp != NULL) |
| 1904 { | |
| 625 | 1905 if (lang != NULL) |
| 1906 lp->sl_name = vim_strsave(lang); | |
| 323 | 1907 ga_init2(&lp->sl_rep, sizeof(fromto_T), 10); |
| 625 | 1908 ga_init2(&lp->sl_repsal, sizeof(fromto_T), 10); |
| 483 | 1909 lp->sl_compmax = MAXWLEN; |
| 1910 lp->sl_compsylmax = MAXWLEN; | |
| 625 | 1911 hash_init(&lp->sl_wordcount); |
| 1912 } | |
| 1913 | |
| 236 | 1914 return lp; |
| 1915 } | |
| 1916 | |
| 1917 /* | |
| 1918 * Free the contents of an slang_T and the structure itself. | |
| 1919 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
1920 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1921 slang_free(slang_T *lp) |
| 236 | 1922 { |
| 1923 vim_free(lp->sl_name); | |
| 310 | 1924 vim_free(lp->sl_fname); |
| 1925 slang_clear(lp); | |
| 1926 vim_free(lp); | |
| 1927 } | |
| 1928 | |
| 1929 /* | |
| 1930 * Clear an slang_T so that the file can be reloaded. | |
| 1931 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
1932 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
1933 slang_clear(slang_T *lp) |
| 310 | 1934 { |
| 339 | 1935 garray_T *gap; |
| 1936 fromto_T *ftp; | |
| 344 | 1937 salitem_T *smp; |
| 339 | 1938 int i; |
| 625 | 1939 int round; |
| 323 | 1940 |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
1941 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
|
1942 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
|
1943 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
|
1944 |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
1945 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
|
1946 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
|
1947 VIM_CLEAR(lp->sl_pidxs); |
| 323 | 1948 |
| 625 | 1949 for (round = 1; round <= 2; ++round) |
| 1950 { | |
| 1951 gap = round == 1 ? &lp->sl_rep : &lp->sl_repsal; | |
| 1952 while (gap->ga_len > 0) | |
| 1953 { | |
| 1954 ftp = &((fromto_T *)gap->ga_data)[--gap->ga_len]; | |
| 1955 vim_free(ftp->ft_from); | |
| 1956 vim_free(ftp->ft_to); | |
| 1957 } | |
| 1958 ga_clear(gap); | |
| 1959 } | |
| 344 | 1960 |
| 1961 gap = &lp->sl_sal; | |
| 375 | 1962 if (lp->sl_sofo) |
| 376 | 1963 { |
| 1964 /* "ga_len" is set to 1 without adding an item for latin1 */ | |
| 1965 if (gap->ga_data != NULL) | |
| 1966 /* SOFOFROM and SOFOTO items: free lists of wide characters. */ | |
| 1967 for (i = 0; i < gap->ga_len; ++i) | |
| 1968 vim_free(((int **)gap->ga_data)[i]); | |
| 1969 } | |
| 375 | 1970 else |
| 1971 /* SAL items: free salitem_T items */ | |
| 1972 while (gap->ga_len > 0) | |
| 1973 { | |
| 1974 smp = &((salitem_T *)gap->ga_data)[--gap->ga_len]; | |
| 1975 vim_free(smp->sm_lead); | |
| 1976 /* Don't free sm_oneof and sm_rules, they point into sm_lead. */ | |
| 1977 vim_free(smp->sm_to); | |
| 1978 vim_free(smp->sm_lead_w); | |
| 1979 vim_free(smp->sm_oneof_w); | |
| 1980 vim_free(smp->sm_to_w); | |
| 1981 } | |
| 344 | 1982 ga_clear(gap); |
| 323 | 1983 |
| 339 | 1984 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
|
1985 vim_regfree(lp->sl_prefprog[i]); |
| 376 | 1986 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
|
1987 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
|
1988 |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
1989 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
|
1990 |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
1991 VIM_CLEAR(lp->sl_midword); |
| 339 | 1992 |
|
4805
66803af09906
updated for version 7.3.1149
Bram Moolenaar <bram@vim.org>
parents:
4352
diff
changeset
|
1993 vim_regfree(lp->sl_compprog); |
| 483 | 1994 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
|
1995 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
|
1996 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
|
1997 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
|
1998 |
|
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_syllable); |
| 483 | 2000 ga_clear(&lp->sl_syl_items); |
| 481 | 2001 |
| 809 | 2002 ga_clear_strings(&lp->sl_comppat); |
| 2003 | |
| 625 | 2004 hash_clear_all(&lp->sl_wordcount, WC_KEY_OFF); |
| 2005 hash_init(&lp->sl_wordcount); | |
| 2006 | |
| 2007 hash_clear_all(&lp->sl_map_hash, 0); | |
| 2008 | |
| 2009 /* Clear info from .sug file. */ | |
| 2010 slang_clear_sug(lp); | |
| 483 | 2011 |
| 2012 lp->sl_compmax = MAXWLEN; | |
| 501 | 2013 lp->sl_compminlen = 0; |
| 483 | 2014 lp->sl_compsylmax = MAXWLEN; |
| 2015 lp->sl_regions[0] = NUL; | |
| 236 | 2016 } |
| 2017 | |
| 2018 /* | |
| 625 | 2019 * Clear the info from the .sug file in "lp". |
| 2020 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2021 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2022 slang_clear_sug(slang_T *lp) |
| 625 | 2023 { |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2024 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
|
2025 VIM_CLEAR(lp->sl_sidxs); |
| 625 | 2026 close_spellbuf(lp->sl_sugbuf); |
| 2027 lp->sl_sugbuf = NULL; | |
| 2028 lp->sl_sugloaded = FALSE; | |
| 2029 lp->sl_sugtime = 0; | |
| 2030 } | |
| 2031 | |
| 2032 /* | |
| 307 | 2033 * Load one spell file and store the info into a slang_T. |
| 236 | 2034 * Invoked through do_in_runtimepath(). |
| 2035 */ | |
| 2036 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2037 spell_load_cb(char_u *fname, void *cookie) |
| 501 | 2038 { |
| 2039 spelload_T *slp = (spelload_T *)cookie; | |
| 2040 slang_T *slang; | |
| 2041 | |
| 2042 slang = spell_load_file(fname, slp->sl_lang, NULL, FALSE); | |
| 2043 if (slang != NULL) | |
| 2044 { | |
| 2045 /* When a previously loaded file has NOBREAK also use it for the | |
| 2046 * ".add" files. */ | |
| 2047 if (slp->sl_nobreak && slang->sl_add) | |
| 2048 slang->sl_nobreak = TRUE; | |
| 2049 else if (slang->sl_nobreak) | |
| 2050 slp->sl_nobreak = TRUE; | |
| 2051 | |
| 2052 slp->sl_slang = slang; | |
| 2053 } | |
| 310 | 2054 } |
| 2055 | |
| 625 | 2056 |
| 2057 /* | |
| 2058 * Add a word to the hashtable of common words. | |
| 2059 * If it's already there then the counter is increased. | |
| 2060 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2061 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2062 count_common_word( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2063 slang_T *lp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2064 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2065 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
|
2066 int count) /* 1 to count once, 10 to init */ |
| 625 | 2067 { |
| 2068 hash_T hash; | |
| 2069 hashitem_T *hi; | |
| 2070 wordcount_T *wc; | |
| 2071 char_u buf[MAXWLEN]; | |
| 2072 char_u *p; | |
| 2073 | |
| 2074 if (len == -1) | |
| 2075 p = word; | |
| 2076 else | |
| 2077 { | |
| 2078 vim_strncpy(buf, word, len); | |
| 2079 p = buf; | |
| 2080 } | |
| 2081 | |
| 2082 hash = hash_hash(p); | |
| 2083 hi = hash_lookup(&lp->sl_wordcount, p, hash); | |
| 2084 if (HASHITEM_EMPTY(hi)) | |
| 2085 { | |
|
16764
ef00b6bc186b
patch 8.1.1384: using "int" for alloc() often results in compiler warnings
Bram Moolenaar <Bram@vim.org>
parents:
16738
diff
changeset
|
2086 wc = (wordcount_T *)alloc(sizeof(wordcount_T) + STRLEN(p)); |
| 625 | 2087 if (wc == NULL) |
| 2088 return; | |
| 2089 STRCPY(wc->wc_word, p); | |
| 2090 wc->wc_count = count; | |
| 2091 hash_add_item(&lp->sl_wordcount, hi, wc->wc_word, hash); | |
| 2092 } | |
| 2093 else | |
| 2094 { | |
| 2095 wc = HI2WC(hi); | |
| 2096 if ((wc->wc_count += count) < (unsigned)count) /* check for overflow */ | |
| 2097 wc->wc_count = MAXWORDCOUNT; | |
| 2098 } | |
| 2099 } | |
| 2100 | |
| 2101 /* | |
| 2102 * Adjust the score of common words. | |
| 2103 */ | |
| 2104 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2105 score_wordcount_adj( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2106 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2107 int score, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2108 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2109 int split) /* word was split, less bonus */ |
| 625 | 2110 { |
| 2111 hashitem_T *hi; | |
| 2112 wordcount_T *wc; | |
| 2113 int bonus; | |
| 2114 int newscore; | |
| 2115 | |
| 2116 hi = hash_find(&slang->sl_wordcount, word); | |
| 2117 if (!HASHITEM_EMPTY(hi)) | |
| 2118 { | |
| 2119 wc = HI2WC(hi); | |
| 2120 if (wc->wc_count < SCORE_THRES2) | |
| 2121 bonus = SCORE_COMMON1; | |
| 2122 else if (wc->wc_count < SCORE_THRES3) | |
| 2123 bonus = SCORE_COMMON2; | |
| 2124 else | |
| 2125 bonus = SCORE_COMMON3; | |
| 2126 if (split) | |
| 2127 newscore = score - bonus / 2; | |
| 2128 else | |
| 2129 newscore = score - bonus; | |
| 2130 if (newscore < 0) | |
| 2131 return 0; | |
| 2132 return newscore; | |
| 2133 } | |
| 2134 return score; | |
| 2135 } | |
| 2136 | |
| 483 | 2137 |
| 495 | 2138 /* |
| 498 | 2139 * Return TRUE if byte "n" appears in "str". |
| 495 | 2140 * Like strchr() but independent of locale. |
| 2141 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2142 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2143 byte_in_str(char_u *str, int n) |
| 495 | 2144 { |
| 2145 char_u *p; | |
| 2146 | |
| 2147 for (p = str; *p != NUL; ++p) | |
| 498 | 2148 if (*p == n) |
| 495 | 2149 return TRUE; |
| 2150 return FALSE; | |
| 2151 } | |
| 2152 | |
| 483 | 2153 #define SY_MAXLEN 30 |
| 2154 typedef struct syl_item_S | |
| 2155 { | |
| 2156 char_u sy_chars[SY_MAXLEN]; /* the sequence of chars */ | |
| 2157 int sy_len; | |
| 2158 } syl_item_T; | |
| 2159 | |
| 2160 /* | |
| 2161 * Truncate "slang->sl_syllable" at the first slash and put the following items | |
| 2162 * in "slang->sl_syl_items". | |
| 2163 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2164 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2165 init_syl_tab(slang_T *slang) |
| 483 | 2166 { |
| 2167 char_u *p; | |
| 2168 char_u *s; | |
| 2169 int l; | |
| 2170 syl_item_T *syl; | |
| 2171 | |
| 2172 ga_init2(&slang->sl_syl_items, sizeof(syl_item_T), 4); | |
| 2173 p = vim_strchr(slang->sl_syllable, '/'); | |
| 2174 while (p != NULL) | |
| 2175 { | |
| 2176 *p++ = NUL; | |
| 495 | 2177 if (*p == NUL) /* trailing slash */ |
| 483 | 2178 break; |
| 2179 s = p; | |
| 2180 p = vim_strchr(p, '/'); | |
| 2181 if (p == NULL) | |
| 835 | 2182 l = (int)STRLEN(s); |
| 483 | 2183 else |
| 835 | 2184 l = (int)(p - s); |
| 483 | 2185 if (l >= SY_MAXLEN) |
| 2186 return SP_FORMERROR; | |
| 2187 if (ga_grow(&slang->sl_syl_items, 1) == FAIL) | |
| 495 | 2188 return SP_OTHERERROR; |
| 483 | 2189 syl = ((syl_item_T *)slang->sl_syl_items.ga_data) |
| 2190 + slang->sl_syl_items.ga_len++; | |
| 2191 vim_strncpy(syl->sy_chars, s, l); | |
| 2192 syl->sy_len = l; | |
| 2193 } | |
| 2194 return OK; | |
| 2195 } | |
| 2196 | |
| 2197 /* | |
| 2198 * Count the number of syllables in "word". | |
| 2199 * When "word" contains spaces the syllables after the last space are counted. | |
| 2200 * Returns zero if syllables are not defines. | |
| 2201 */ | |
| 2202 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2203 count_syllables(slang_T *slang, char_u *word) |
| 483 | 2204 { |
| 2205 int cnt = 0; | |
| 2206 int skip = FALSE; | |
| 2207 char_u *p; | |
| 2208 int len; | |
| 2209 int i; | |
| 2210 syl_item_T *syl; | |
| 2211 int c; | |
| 2212 | |
| 2213 if (slang->sl_syllable == NULL) | |
| 2214 return 0; | |
| 2215 | |
| 2216 for (p = word; *p != NUL; p += len) | |
| 2217 { | |
| 2218 /* When running into a space reset counter. */ | |
| 2219 if (*p == ' ') | |
| 2220 { | |
| 2221 len = 1; | |
| 2222 cnt = 0; | |
| 2223 continue; | |
| 2224 } | |
| 2225 | |
| 2226 /* Find longest match of syllable items. */ | |
| 2227 len = 0; | |
| 2228 for (i = 0; i < slang->sl_syl_items.ga_len; ++i) | |
| 2229 { | |
| 2230 syl = ((syl_item_T *)slang->sl_syl_items.ga_data) + i; | |
| 2231 if (syl->sy_len > len | |
| 2232 && STRNCMP(p, syl->sy_chars, syl->sy_len) == 0) | |
| 2233 len = syl->sy_len; | |
| 2234 } | |
| 2235 if (len != 0) /* found a match, count syllable */ | |
| 2236 { | |
| 2237 ++cnt; | |
| 2238 skip = FALSE; | |
| 2239 } | |
| 2240 else | |
| 2241 { | |
| 2242 /* No recognized syllable item, at least a syllable char then? */ | |
| 2243 c = mb_ptr2char(p); | |
| 2244 len = (*mb_ptr2len)(p); | |
| 2245 if (vim_strchr(slang->sl_syllable, c) == NULL) | |
| 2246 skip = FALSE; /* No, search for next syllable */ | |
| 2247 else if (!skip) | |
| 2248 { | |
| 2249 ++cnt; /* Yes, count it */ | |
| 2250 skip = TRUE; /* don't count following syllable chars */ | |
| 2251 } | |
| 2252 } | |
| 2253 } | |
| 2254 return cnt; | |
| 376 | 2255 } |
| 2256 | |
| 381 | 2257 /* |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2258 * Parse 'spelllang' and set w_s->b_langp accordingly. |
| 351 | 2259 * Returns NULL if it's OK, an error message otherwise. |
| 236 | 2260 */ |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
2261 char * |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2262 did_set_spelllang(win_T *wp) |
| 236 | 2263 { |
| 2264 garray_T ga; | |
| 351 | 2265 char_u *splp; |
| 236 | 2266 char_u *region; |
| 416 | 2267 char_u region_cp[3]; |
| 355 | 2268 int filename; |
| 236 | 2269 int region_mask; |
| 503 | 2270 slang_T *slang; |
| 236 | 2271 int c; |
| 351 | 2272 char_u lang[MAXWLEN + 1]; |
| 323 | 2273 char_u spf_name[MAXPATHL]; |
| 351 | 2274 int len; |
| 2275 char_u *p; | |
| 381 | 2276 int round; |
| 385 | 2277 char_u *spf; |
| 389 | 2278 char_u *use_region = NULL; |
| 2279 int dont_use_region = FALSE; | |
| 501 | 2280 int nobreak = FALSE; |
| 503 | 2281 int i, j; |
| 2282 langp_T *lp, *lp2; | |
| 1185 | 2283 static int recursive = FALSE; |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
2284 char *ret_msg = NULL; |
| 1185 | 2285 char_u *spl_copy; |
|
9487
69ed2c9d34a6
commit https://github.com/vim/vim/commit/7c0a2f367f2507669560b1a66423155c70d2e75b
Christian Brabandt <cb@256bit.org>
parents:
9387
diff
changeset
|
2286 bufref_T bufref; |
|
69ed2c9d34a6
commit https://github.com/vim/vim/commit/7c0a2f367f2507669560b1a66423155c70d2e75b
Christian Brabandt <cb@256bit.org>
parents:
9387
diff
changeset
|
2287 |
|
69ed2c9d34a6
commit https://github.com/vim/vim/commit/7c0a2f367f2507669560b1a66423155c70d2e75b
Christian Brabandt <cb@256bit.org>
parents:
9387
diff
changeset
|
2288 set_bufref(&bufref, wp->w_buffer); |
| 1185 | 2289 |
| 2290 /* We don't want to do this recursively. May happen when a language is | |
| 2291 * not available and the SpellFileMissing autocommand opens a new buffer | |
| 2292 * in which 'spell' is set. */ | |
| 2293 if (recursive) | |
| 2294 return NULL; | |
| 2295 recursive = TRUE; | |
| 236 | 2296 |
| 2297 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
|
2298 clear_midword(wp); |
| 236 | 2299 |
| 4352 | 2300 /* Make a copy of 'spelllang', the SpellFileMissing autocommands may change |
| 1185 | 2301 * it under our fingers. */ |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2302 spl_copy = vim_strsave(wp->w_s->b_p_spl); |
| 1185 | 2303 if (spl_copy == NULL) |
| 2304 goto theend; | |
| 2305 | |
| 5477 | 2306 wp->w_s->b_cjk = 0; |
| 2307 | |
| 2308 /* Loop over comma separated language names. */ | |
| 1185 | 2309 for (splp = spl_copy; *splp != NUL; ) |
| 351 | 2310 { |
|
16277
5ef25fa57f71
patch 8.1.1143: may pass weird strings to file name expansion
Bram Moolenaar <Bram@vim.org>
parents:
16239
diff
changeset
|
2311 // Get one language name. |
| 351 | 2312 copy_option_part(&splp, lang, MAXWLEN, ","); |
| 240 | 2313 region = NULL; |
| 835 | 2314 len = (int)STRLEN(lang); |
| 355 | 2315 |
|
16277
5ef25fa57f71
patch 8.1.1143: may pass weird strings to file name expansion
Bram Moolenaar <Bram@vim.org>
parents:
16239
diff
changeset
|
2316 if (!valid_spellang(lang)) |
|
5ef25fa57f71
patch 8.1.1143: may pass weird strings to file name expansion
Bram Moolenaar <Bram@vim.org>
parents:
16239
diff
changeset
|
2317 continue; |
|
5ef25fa57f71
patch 8.1.1143: may pass weird strings to file name expansion
Bram Moolenaar <Bram@vim.org>
parents:
16239
diff
changeset
|
2318 |
| 5477 | 2319 if (STRCMP(lang, "cjk") == 0) |
| 2320 { | |
| 2321 wp->w_s->b_cjk = 1; | |
| 2322 continue; | |
| 2323 } | |
| 2324 | |
| 355 | 2325 /* If the name ends in ".spl" use it as the name of the spell file. |
| 2326 * If there is a region name let "region" point to it and remove it | |
| 2327 * from the name. */ | |
| 2328 if (len > 4 && fnamecmp(lang + len - 4, ".spl") == 0) | |
| 236 | 2329 { |
| 355 | 2330 filename = TRUE; |
| 2331 | |
| 416 | 2332 /* Locate a region and remove it from the file name. */ |
| 2333 p = vim_strchr(gettail(lang), '_'); | |
| 2334 if (p != NULL && ASCII_ISALPHA(p[1]) && ASCII_ISALPHA(p[2]) | |
| 2335 && !ASCII_ISALPHA(p[3])) | |
| 2336 { | |
| 2337 vim_strncpy(region_cp, p + 1, 2); | |
| 2338 mch_memmove(p, p + 3, len - (p - lang) - 2); | |
| 2339 region = region_cp; | |
| 2340 } | |
| 2341 else | |
| 2342 dont_use_region = TRUE; | |
| 2343 | |
| 355 | 2344 /* Check if we loaded this language before. */ |
| 503 | 2345 for (slang = first_lang; slang != NULL; slang = slang->sl_next) |
|
16738
b52ea9c5f1db
patch 8.1.1371: cannot recover from a swap file
Bram Moolenaar <Bram@vim.org>
parents:
16606
diff
changeset
|
2346 if (fullpathcmp(lang, slang->sl_fname, FALSE, TRUE) == FPC_SAME) |
| 355 | 2347 break; |
| 236 | 2348 } |
| 355 | 2349 else |
| 2350 { | |
| 2351 filename = FALSE; | |
| 2352 if (len > 3 && lang[len - 3] == '_') | |
| 2353 { | |
| 2354 region = lang + len - 2; | |
| 2355 len -= 3; | |
| 2356 lang[len] = NUL; | |
| 389 | 2357 } |
| 2358 else | |
| 2359 dont_use_region = TRUE; | |
| 355 | 2360 |
| 2361 /* Check if we loaded this language before. */ | |
| 503 | 2362 for (slang = first_lang; slang != NULL; slang = slang->sl_next) |
| 2363 if (STRICMP(lang, slang->sl_name) == 0) | |
| 355 | 2364 break; |
| 2365 } | |
| 236 | 2366 |
| 416 | 2367 if (region != NULL) |
| 2368 { | |
| 2369 /* If the region differs from what was used before then don't | |
| 2370 * use it for 'spellfile'. */ | |
| 2371 if (use_region != NULL && STRCMP(region, use_region) != 0) | |
| 2372 dont_use_region = TRUE; | |
| 2373 use_region = region; | |
| 2374 } | |
| 2375 | |
| 351 | 2376 /* If not found try loading the language now. */ |
| 503 | 2377 if (slang == NULL) |
| 355 | 2378 { |
| 2379 if (filename) | |
| 2380 (void)spell_load_file(lang, lang, NULL, FALSE); | |
| 2381 else | |
| 1185 | 2382 { |
| 355 | 2383 spell_load_lang(lang); |
| 1185 | 2384 /* SpellFileMissing autocommands may do anything, including |
| 2385 * 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
|
2386 if (!bufref_valid(&bufref)) |
| 1185 | 2387 { |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
2388 ret_msg = N_("E797: SpellFileMissing autocommand deleted buffer"); |
| 1185 | 2389 goto theend; |
| 2390 } | |
| 2391 } | |
| 355 | 2392 } |
| 236 | 2393 |
| 307 | 2394 /* |
| 351 | 2395 * Loop over the languages, there can be several files for "lang". |
| 307 | 2396 */ |
| 503 | 2397 for (slang = first_lang; slang != NULL; slang = slang->sl_next) |
|
16738
b52ea9c5f1db
patch 8.1.1371: cannot recover from a swap file
Bram Moolenaar <Bram@vim.org>
parents:
16606
diff
changeset
|
2398 if (filename ? fullpathcmp(lang, slang->sl_fname, FALSE, TRUE) |
|
b52ea9c5f1db
patch 8.1.1371: cannot recover from a swap file
Bram Moolenaar <Bram@vim.org>
parents:
16606
diff
changeset
|
2399 == FPC_SAME |
| 503 | 2400 : STRICMP(lang, slang->sl_name) == 0) |
| 236 | 2401 { |
| 316 | 2402 region_mask = REGION_ALL; |
| 355 | 2403 if (!filename && region != NULL) |
| 236 | 2404 { |
| 307 | 2405 /* find region in sl_regions */ |
| 503 | 2406 c = find_region(slang->sl_regions, region); |
| 307 | 2407 if (c == REGION_ALL) |
| 2408 { | |
| 503 | 2409 if (slang->sl_add) |
| 389 | 2410 { |
| 503 | 2411 if (*slang->sl_regions != NUL) |
| 389 | 2412 /* This addition file is for other regions. */ |
| 2413 region_mask = 0; | |
| 2414 } | |
| 2415 else | |
| 2416 /* This is probably an error. Give a warning and | |
| 2417 * accept the words anyway. */ | |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
2418 smsg(_("Warning: region %s not supported"), |
| 351 | 2419 region); |
| 307 | 2420 } |
| 2421 else | |
| 2422 region_mask = 1 << c; | |
| 236 | 2423 } |
| 307 | 2424 |
| 389 | 2425 if (region_mask != 0) |
| 307 | 2426 { |
| 389 | 2427 if (ga_grow(&ga, 1) == FAIL) |
| 2428 { | |
| 2429 ga_clear(&ga); | |
| 1185 | 2430 ret_msg = e_outofmem; |
| 2431 goto theend; | |
| 389 | 2432 } |
| 503 | 2433 LANGP_ENTRY(ga, ga.ga_len)->lp_slang = slang; |
| 389 | 2434 LANGP_ENTRY(ga, ga.ga_len)->lp_region = region_mask; |
| 2435 ++ga.ga_len; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2436 use_midword(slang, wp); |
| 503 | 2437 if (slang->sl_nobreak) |
| 501 | 2438 nobreak = TRUE; |
| 307 | 2439 } |
| 385 | 2440 } |
| 2441 } | |
| 2442 | |
| 2443 /* round 0: load int_wordlist, if possible. | |
| 2444 * round 1: load first name in 'spellfile'. | |
| 2445 * round 2: load second name in 'spellfile. | |
| 2446 * etc. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2447 spf = curwin->w_s->b_p_spf; |
| 385 | 2448 for (round = 0; round == 0 || *spf != NUL; ++round) |
| 2449 { | |
| 2450 if (round == 0) | |
| 2451 { | |
| 2452 /* Internal wordlist, if there is one. */ | |
| 2453 if (int_wordlist == NULL) | |
| 381 | 2454 continue; |
| 385 | 2455 int_wordlist_spl(spf_name); |
| 381 | 2456 } |
| 2457 else | |
| 2458 { | |
| 385 | 2459 /* One entry in 'spellfile'. */ |
| 2460 copy_option_part(&spf, spf_name, MAXPATHL - 5, ","); | |
| 2461 STRCAT(spf_name, ".spl"); | |
| 2462 | |
| 2463 /* If it was already found above then skip it. */ | |
| 2464 for (c = 0; c < ga.ga_len; ++c) | |
| 500 | 2465 { |
| 2466 p = LANGP_ENTRY(ga, c)->lp_slang->sl_fname; | |
|
16738
b52ea9c5f1db
patch 8.1.1371: cannot recover from a swap file
Bram Moolenaar <Bram@vim.org>
parents:
16606
diff
changeset
|
2467 if (p != NULL && fullpathcmp(spf_name, p, FALSE, TRUE) |
|
b52ea9c5f1db
patch 8.1.1371: cannot recover from a swap file
Bram Moolenaar <Bram@vim.org>
parents:
16606
diff
changeset
|
2468 == FPC_SAME) |
| 385 | 2469 break; |
| 500 | 2470 } |
| 385 | 2471 if (c < ga.ga_len) |
| 381 | 2472 continue; |
| 2473 } | |
| 2474 | |
| 351 | 2475 /* Check if it was loaded already. */ |
| 503 | 2476 for (slang = first_lang; slang != NULL; slang = slang->sl_next) |
|
16738
b52ea9c5f1db
patch 8.1.1371: cannot recover from a swap file
Bram Moolenaar <Bram@vim.org>
parents:
16606
diff
changeset
|
2477 if (fullpathcmp(spf_name, slang->sl_fname, FALSE, TRUE) |
|
b52ea9c5f1db
patch 8.1.1371: cannot recover from a swap file
Bram Moolenaar <Bram@vim.org>
parents:
16606
diff
changeset
|
2478 == FPC_SAME) |
| 323 | 2479 break; |
| 503 | 2480 if (slang == NULL) |
| 323 | 2481 { |
| 351 | 2482 /* Not loaded, try loading it now. The language name includes the |
| 385 | 2483 * region name, the region is ignored otherwise. for int_wordlist |
| 2484 * use an arbitrary name. */ | |
| 2485 if (round == 0) | |
| 2486 STRCPY(lang, "internal wordlist"); | |
| 2487 else | |
| 2488 { | |
| 2489 vim_strncpy(lang, gettail(spf_name), MAXWLEN); | |
| 381 | 2490 p = vim_strchr(lang, '.'); |
| 2491 if (p != NULL) | |
| 2492 *p = NUL; /* truncate at ".encoding.add" */ | |
| 2493 } | |
| 503 | 2494 slang = spell_load_file(spf_name, lang, NULL, TRUE); |
| 501 | 2495 |
| 2496 /* If one of the languages has NOBREAK we assume the addition | |
| 2497 * files also have this. */ | |
| 503 | 2498 if (slang != NULL && nobreak) |
| 2499 slang->sl_nobreak = TRUE; | |
| 2500 } | |
| 2501 if (slang != NULL && ga_grow(&ga, 1) == OK) | |
| 323 | 2502 { |
| 389 | 2503 region_mask = REGION_ALL; |
| 2504 if (use_region != NULL && !dont_use_region) | |
| 2505 { | |
| 2506 /* find region in sl_regions */ | |
| 503 | 2507 c = find_region(slang->sl_regions, use_region); |
| 389 | 2508 if (c != REGION_ALL) |
| 2509 region_mask = 1 << c; | |
| 503 | 2510 else if (*slang->sl_regions != NUL) |
| 389 | 2511 /* This spell file is for other regions. */ |
| 2512 region_mask = 0; | |
| 2513 } | |
| 2514 | |
| 2515 if (region_mask != 0) | |
| 2516 { | |
| 503 | 2517 LANGP_ENTRY(ga, ga.ga_len)->lp_slang = slang; |
| 2518 LANGP_ENTRY(ga, ga.ga_len)->lp_sallang = NULL; | |
| 2519 LANGP_ENTRY(ga, ga.ga_len)->lp_replang = NULL; | |
| 389 | 2520 LANGP_ENTRY(ga, ga.ga_len)->lp_region = region_mask; |
| 2521 ++ga.ga_len; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2522 use_midword(slang, wp); |
| 389 | 2523 } |
| 323 | 2524 } |
| 2525 } | |
| 2526 | |
| 236 | 2527 /* 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
|
2528 ga_clear(&wp->w_s->b_langp); |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2529 wp->w_s->b_langp = ga; |
| 236 | 2530 |
| 503 | 2531 /* For each language figure out what language to use for sound folding and |
| 2532 * REP items. If the language doesn't support it itself use another one | |
| 2533 * with the same name. E.g. for "en-math" use "en". */ | |
| 2534 for (i = 0; i < ga.ga_len; ++i) | |
| 2535 { | |
| 2536 lp = LANGP_ENTRY(ga, i); | |
| 2537 | |
| 2538 /* sound folding */ | |
| 2539 if (lp->lp_slang->sl_sal.ga_len > 0) | |
| 2540 /* language does sound folding itself */ | |
| 2541 lp->lp_sallang = lp->lp_slang; | |
| 2542 else | |
| 2543 /* find first similar language that does sound folding */ | |
| 2544 for (j = 0; j < ga.ga_len; ++j) | |
| 2545 { | |
| 2546 lp2 = LANGP_ENTRY(ga, j); | |
| 2547 if (lp2->lp_slang->sl_sal.ga_len > 0 | |
| 2548 && STRNCMP(lp->lp_slang->sl_name, | |
| 2549 lp2->lp_slang->sl_name, 2) == 0) | |
| 2550 { | |
| 2551 lp->lp_sallang = lp2->lp_slang; | |
| 2552 break; | |
| 2553 } | |
| 2554 } | |
| 2555 | |
| 2556 /* REP items */ | |
| 2557 if (lp->lp_slang->sl_rep.ga_len > 0) | |
| 2558 /* language has REP items itself */ | |
| 2559 lp->lp_replang = lp->lp_slang; | |
| 2560 else | |
| 625 | 2561 /* find first similar language that has REP items */ |
| 503 | 2562 for (j = 0; j < ga.ga_len; ++j) |
| 2563 { | |
| 2564 lp2 = LANGP_ENTRY(ga, j); | |
| 2565 if (lp2->lp_slang->sl_rep.ga_len > 0 | |
| 2566 && STRNCMP(lp->lp_slang->sl_name, | |
| 2567 lp2->lp_slang->sl_name, 2) == 0) | |
| 2568 { | |
| 2569 lp->lp_replang = lp2->lp_slang; | |
| 2570 break; | |
| 2571 } | |
| 2572 } | |
| 2573 } | |
| 2574 | |
| 1185 | 2575 theend: |
| 2576 vim_free(spl_copy); | |
| 2577 recursive = FALSE; | |
| 5891 | 2578 redraw_win_later(wp, NOT_VALID); |
| 1185 | 2579 return ret_msg; |
| 236 | 2580 } |
| 2581 | |
| 2582 /* | |
| 376 | 2583 * Clear the midword characters for buffer "buf". |
| 2584 */ | |
| 2585 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2586 clear_midword(win_T *wp) |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2587 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2588 vim_memset(wp->w_s->b_spell_ismw, 0, 256); |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2589 VIM_CLEAR(wp->w_s->b_spell_ismw_mb); |
| 376 | 2590 } |
| 2591 | |
| 2592 /* | |
| 2593 * Use the "sl_midword" field of language "lp" for buffer "buf". | |
| 2594 * They add up to any currently used midword characters. | |
| 2595 */ | |
| 2596 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2597 use_midword(slang_T *lp, win_T *wp) |
| 376 | 2598 { |
| 2599 char_u *p; | |
| 2600 | |
| 389 | 2601 if (lp->sl_midword == NULL) /* there aren't any */ |
| 2602 return; | |
| 2603 | |
| 376 | 2604 for (p = lp->sl_midword; *p != NUL; ) |
| 2605 if (has_mbyte) | |
| 2606 { | |
| 2607 int c, l, n; | |
| 2608 char_u *bp; | |
| 2609 | |
| 2610 c = mb_ptr2char(p); | |
| 474 | 2611 l = (*mb_ptr2len)(p); |
| 2612 if (c < 256 && l <= 2) | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2613 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
|
2614 else if (wp->w_s->b_spell_ismw_mb == NULL) |
| 376 | 2615 /* 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
|
2616 wp->w_s->b_spell_ismw_mb = vim_strnsave(p, l); |
| 376 | 2617 else |
| 2618 { | |
| 2619 /* 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
|
2620 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
|
2621 bp = vim_strnsave(wp->w_s->b_spell_ismw_mb, n + l); |
| 376 | 2622 if (bp != NULL) |
| 2623 { | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2624 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
|
2625 wp->w_s->b_spell_ismw_mb = bp; |
| 376 | 2626 vim_strncpy(bp + n, p, l); |
| 2627 } | |
| 2628 } | |
| 2629 p += l; | |
| 2630 } | |
| 2631 else | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2632 wp->w_s->b_spell_ismw[*p++] = TRUE; |
| 376 | 2633 } |
| 2634 | |
| 2635 /* | |
| 236 | 2636 * Find the region "region[2]" in "rp" (points to "sl_regions"). |
|
15034
6e4e0d43b20b
patch 8.1.0528: various typos in comments
Bram Moolenaar <Bram@vim.org>
parents:
14862
diff
changeset
|
2637 * Each region is simply stored as the two characters of its name. |
| 381 | 2638 * Returns the index if found (first is 0), REGION_ALL if not found. |
| 236 | 2639 */ |
| 2640 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2641 find_region(char_u *rp, char_u *region) |
| 236 | 2642 { |
| 2643 int i; | |
| 2644 | |
| 2645 for (i = 0; ; i += 2) | |
| 2646 { | |
| 2647 if (rp[i] == NUL) | |
| 2648 return REGION_ALL; | |
| 2649 if (rp[i] == region[0] && rp[i + 1] == region[1]) | |
| 2650 break; | |
| 2651 } | |
| 2652 return i / 2; | |
| 2653 } | |
| 2654 | |
| 2655 /* | |
| 323 | 2656 * Return case type of word: |
| 236 | 2657 * w word 0 |
| 300 | 2658 * Word WF_ONECAP |
| 2659 * W WORD WF_ALLCAP | |
| 2660 * WoRd wOrd WF_KEEPCAP | |
| 236 | 2661 */ |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2662 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2663 captype( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2664 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2665 char_u *end) /* When NULL use up to NUL byte. */ |
| 236 | 2666 { |
| 2667 char_u *p; | |
| 2668 int c; | |
| 2669 int firstcap; | |
| 2670 int allcap; | |
| 2671 int past_second = FALSE; /* past second word char */ | |
| 2672 | |
| 2673 /* find first letter */ | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
2674 for (p = word; !spell_iswordp_nmw(p, curwin); MB_PTR_ADV(p)) |
| 323 | 2675 if (end == NULL ? *p == NUL : p >= end) |
| 236 | 2676 return 0; /* only non-word characters, illegal word */ |
| 310 | 2677 if (has_mbyte) |
| 2678 c = mb_ptr2char_adv(&p); | |
| 2679 else | |
| 2680 c = *p++; | |
| 324 | 2681 firstcap = allcap = SPELL_ISUPPER(c); |
| 236 | 2682 |
| 2683 /* | |
| 2684 * Need to check all letters to find a word with mixed upper/lower. | |
| 2685 * But a word with an upper char only at start is a ONECAP. | |
| 2686 */ | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
2687 for ( ; end == NULL ? *p != NUL : p < end; MB_PTR_ADV(p)) |
| 5477 | 2688 if (spell_iswordp_nmw(p, curwin)) |
| 236 | 2689 { |
| 455 | 2690 c = PTR2CHAR(p); |
| 324 | 2691 if (!SPELL_ISUPPER(c)) |
| 236 | 2692 { |
| 2693 /* UUl -> KEEPCAP */ | |
| 2694 if (past_second && allcap) | |
| 300 | 2695 return WF_KEEPCAP; |
| 236 | 2696 allcap = FALSE; |
| 2697 } | |
| 2698 else if (!allcap) | |
| 2699 /* UlU -> KEEPCAP */ | |
| 300 | 2700 return WF_KEEPCAP; |
| 236 | 2701 past_second = TRUE; |
| 2702 } | |
| 2703 | |
| 2704 if (allcap) | |
| 300 | 2705 return WF_ALLCAP; |
| 236 | 2706 if (firstcap) |
| 300 | 2707 return WF_ONECAP; |
| 236 | 2708 return 0; |
| 2709 } | |
| 2710 | |
| 474 | 2711 /* |
| 2712 * Like captype() but for a KEEPCAP word add ONECAP if the word starts with a | |
| 2713 * capital. So that make_case_word() can turn WOrd into Word. | |
| 2714 * Add ALLCAP for "WOrD". | |
| 2715 */ | |
| 2716 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2717 badword_captype(char_u *word, char_u *end) |
| 474 | 2718 { |
| 2719 int flags = captype(word, end); | |
| 475 | 2720 int c; |
| 474 | 2721 int l, u; |
| 2722 int first; | |
| 2723 char_u *p; | |
| 2724 | |
| 2725 if (flags & WF_KEEPCAP) | |
| 2726 { | |
| 2727 /* Count the number of UPPER and lower case letters. */ | |
| 2728 l = u = 0; | |
| 2729 first = FALSE; | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
2730 for (p = word; p < end; MB_PTR_ADV(p)) |
| 474 | 2731 { |
| 475 | 2732 c = PTR2CHAR(p); |
| 2733 if (SPELL_ISUPPER(c)) | |
| 474 | 2734 { |
| 2735 ++u; | |
| 2736 if (p == word) | |
| 2737 first = TRUE; | |
| 2738 } | |
| 2739 else | |
| 2740 ++l; | |
| 2741 } | |
| 2742 | |
| 2743 /* If there are more UPPER than lower case letters suggest an | |
| 2744 * ALLCAP word. Otherwise, if the first letter is UPPER then | |
| 2745 * suggest ONECAP. Exception: "ALl" most likely should be "All", | |
| 2746 * require three upper case letters. */ | |
| 2747 if (u > l && u > 2) | |
| 2748 flags |= WF_ALLCAP; | |
| 2749 else if (first) | |
| 2750 flags |= WF_ONECAP; | |
| 633 | 2751 |
| 2752 if (u >= 2 && l >= 2) /* maCARONI maCAroni */ | |
| 2753 flags |= WF_MIXCAP; | |
| 474 | 2754 } |
| 2755 return flags; | |
| 2756 } | |
| 2757 | |
| 5519 | 2758 /* |
| 2759 * Delete the internal wordlist and its .spl file. | |
| 2760 */ | |
| 2761 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2762 spell_delete_wordlist(void) |
| 5519 | 2763 { |
| 2764 char_u fname[MAXPATHL]; | |
| 2765 | |
| 2766 if (int_wordlist != NULL) | |
| 2767 { | |
| 2768 mch_remove(int_wordlist); | |
| 2769 int_wordlist_spl(fname); | |
| 2770 mch_remove(fname); | |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2771 VIM_CLEAR(int_wordlist); |
| 5519 | 2772 } |
| 2773 } | |
| 2774 | |
| 355 | 2775 /* |
| 2776 * Free all languages. | |
| 2777 */ | |
| 2778 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2779 spell_free_all(void) |
| 355 | 2780 { |
| 503 | 2781 slang_T *slang; |
| 355 | 2782 buf_T *buf; |
| 2783 | |
| 2580 | 2784 /* 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
|
2785 FOR_ALL_BUFFERS(buf) |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2786 ga_clear(&buf->b_s.b_langp); |
| 355 | 2787 |
| 2788 while (first_lang != NULL) | |
| 2789 { | |
| 503 | 2790 slang = first_lang; |
| 2791 first_lang = slang->sl_next; | |
| 2792 slang_free(slang); | |
| 355 | 2793 } |
| 366 | 2794 |
| 5519 | 2795 spell_delete_wordlist(); |
| 381 | 2796 |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2797 VIM_CLEAR(repl_to); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
2798 VIM_CLEAR(repl_from); |
| 355 | 2799 } |
|
15605
62b3805506b3
patch 8.1.0810: too many #ifdefs
Bram Moolenaar <Bram@vim.org>
parents:
15543
diff
changeset
|
2800 |
| 236 | 2801 /* |
| 2802 * Clear all spelling tables and reload them. | |
| 307 | 2803 * Used after 'encoding' is set and when ":mkspell" was used. |
| 236 | 2804 */ |
| 2805 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2806 spell_reload(void) |
| 236 | 2807 { |
| 316 | 2808 win_T *wp; |
| 236 | 2809 |
| 358 | 2810 /* Initialize the table for spell_iswordp(). */ |
| 236 | 2811 init_spell_chartab(); |
| 2812 | |
| 2813 /* Unload all allocated memory. */ | |
| 355 | 2814 spell_free_all(); |
| 236 | 2815 |
| 2816 /* 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
|
2817 FOR_ALL_WINDOWS(wp) |
| 236 | 2818 { |
| 316 | 2819 /* Only load the wordlists when 'spelllang' is set and there is a |
| 2820 * 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
|
2821 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
|
2822 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2823 if (wp->w_p_spell) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2824 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
2825 (void)did_set_spelllang(wp); |
| 316 | 2826 break; |
| 2827 } | |
| 2828 } | |
| 236 | 2829 } |
| 2830 } | |
| 2831 | |
| 310 | 2832 /* |
| 625 | 2833 * Opposite of offset2bytes(). |
| 2834 * "pp" points to the bytes and is advanced over it. | |
| 2835 * Returns the offset. | |
| 2836 */ | |
| 2837 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2838 bytes2offset(char_u **pp) |
| 625 | 2839 { |
| 2840 char_u *p = *pp; | |
| 2841 int nr; | |
| 2842 int c; | |
| 2843 | |
| 2844 c = *p++; | |
| 2845 if ((c & 0x80) == 0x00) /* 1 byte */ | |
| 2846 { | |
| 2847 nr = c - 1; | |
| 2848 } | |
| 2849 else if ((c & 0xc0) == 0x80) /* 2 bytes */ | |
| 2850 { | |
| 2851 nr = (c & 0x3f) - 1; | |
| 2852 nr = nr * 255 + (*p++ - 1); | |
| 2853 } | |
| 2854 else if ((c & 0xe0) == 0xc0) /* 3 bytes */ | |
| 2855 { | |
| 2856 nr = (c & 0x1f) - 1; | |
| 2857 nr = nr * 255 + (*p++ - 1); | |
| 2858 nr = nr * 255 + (*p++ - 1); | |
| 2859 } | |
| 2860 else /* 4 bytes */ | |
| 2861 { | |
| 2862 nr = (c & 0x0f) - 1; | |
| 2863 nr = nr * 255 + (*p++ - 1); | |
| 2864 nr = nr * 255 + (*p++ - 1); | |
| 2865 nr = nr * 255 + (*p++ - 1); | |
| 2866 } | |
| 2867 | |
| 2868 *pp = p; | |
| 2869 return nr; | |
| 2870 } | |
| 2871 | |
| 2872 | |
| 2873 /* | |
| 2874 * Open a spell buffer. This is a nameless buffer that is not in the buffer | |
| 2875 * list and only contains text lines. Can use a swapfile to reduce memory | |
| 2876 * use. | |
| 2877 * Most other fields are invalid! Esp. watch out for string options being | |
| 2878 * NULL and there is no undo info. | |
| 2879 * Returns NULL when out of memory. | |
| 2880 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2881 buf_T * |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2882 open_spellbuf(void) |
| 625 | 2883 { |
| 2884 buf_T *buf; | |
| 2885 | |
| 2886 buf = (buf_T *)alloc_clear(sizeof(buf_T)); | |
| 2887 if (buf != NULL) | |
| 2888 { | |
| 2889 buf->b_spell = TRUE; | |
| 2890 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
|
2891 #ifdef FEAT_CRYPT |
|
7aca84c0cd37
updated for version 7.4a.028
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
2892 buf->b_p_key = empty_option; |
|
7aca84c0cd37
updated for version 7.4a.028
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
2893 #endif |
| 625 | 2894 ml_open(buf); |
| 2895 ml_open_file(buf); /* create swap file now */ | |
| 2896 } | |
| 2897 return buf; | |
| 2898 } | |
| 2899 | |
| 2900 /* | |
| 2901 * Close the buffer used for spell info. | |
| 2902 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2903 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2904 close_spellbuf(buf_T *buf) |
| 625 | 2905 { |
| 2906 if (buf != NULL) | |
| 2907 { | |
| 2908 ml_close(buf, TRUE); | |
| 2909 vim_free(buf); | |
| 2910 } | |
| 2911 } | |
| 2912 | |
| 307 | 2913 /* |
| 2914 * Init the chartab used for spelling for ASCII. | |
| 2915 * EBCDIC is not supported! | |
| 2916 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
2917 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2918 clear_spell_chartab(spelltab_T *sp) |
| 307 | 2919 { |
| 324 | 2920 int i; |
| 307 | 2921 |
| 2922 /* Init everything to FALSE. */ | |
| 2923 vim_memset(sp->st_isw, FALSE, sizeof(sp->st_isw)); | |
| 2924 vim_memset(sp->st_isu, FALSE, sizeof(sp->st_isu)); | |
| 2925 for (i = 0; i < 256; ++i) | |
| 324 | 2926 { |
| 307 | 2927 sp->st_fold[i] = i; |
| 324 | 2928 sp->st_upper[i] = i; |
| 2929 } | |
| 307 | 2930 |
| 2931 /* We include digits. A word shouldn't start with a digit, but handling | |
| 2932 * that is done separately. */ | |
| 2933 for (i = '0'; i <= '9'; ++i) | |
| 2934 sp->st_isw[i] = TRUE; | |
| 2935 for (i = 'A'; i <= 'Z'; ++i) | |
| 2936 { | |
| 2937 sp->st_isw[i] = TRUE; | |
| 2938 sp->st_isu[i] = TRUE; | |
| 2939 sp->st_fold[i] = i + 0x20; | |
| 2940 } | |
| 2941 for (i = 'a'; i <= 'z'; ++i) | |
| 324 | 2942 { |
| 307 | 2943 sp->st_isw[i] = TRUE; |
| 324 | 2944 sp->st_upper[i] = i - 0x20; |
| 2945 } | |
| 307 | 2946 } |
| 2947 | |
| 2948 /* | |
| 2949 * Init the chartab used for spelling. Only depends on 'encoding'. | |
| 2950 * Called once while starting up and when 'encoding' changes. | |
| 2951 * The default is to use isalpha(), but the spell file should define the word | |
| 2952 * characters to make it possible that 'encoding' differs from the current | |
| 390 | 2953 * locale. For utf-8 we don't use isalpha() but our own functions. |
| 307 | 2954 */ |
| 2955 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
2956 init_spell_chartab(void) |
| 307 | 2957 { |
| 2958 int i; | |
| 2959 | |
| 2960 did_set_spelltab = FALSE; | |
| 2961 clear_spell_chartab(&spelltab); | |
| 2962 if (enc_dbcs) | |
| 2963 { | |
| 2964 /* DBCS: assume double-wide characters are word characters. */ | |
| 2965 for (i = 128; i <= 255; ++i) | |
| 2966 if (MB_BYTE2LEN(i) == 2) | |
| 2967 spelltab.st_isw[i] = TRUE; | |
| 2968 } | |
| 324 | 2969 else if (enc_utf8) |
| 2970 { | |
| 2971 for (i = 128; i < 256; ++i) | |
| 2972 { | |
|
2140
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
2973 int f = utf_fold(i); |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
2974 int u = utf_toupper(i); |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
2975 |
| 324 | 2976 spelltab.st_isu[i] = utf_isupper(i); |
| 2977 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
|
2978 /* 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
|
2979 * 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
|
2980 * value for utf-8 to avoid this. */ |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
2981 spelltab.st_fold[i] = (f < 256) ? f : i; |
|
12aba62fa7c6
updated for version 7.2.422
Bram Moolenaar <bram@zimbu.org>
parents:
2046
diff
changeset
|
2982 spelltab.st_upper[i] = (u < 256) ? u : i; |
| 324 | 2983 } |
| 2984 } | |
| 307 | 2985 else |
| 2986 { | |
| 324 | 2987 /* Rough guess: use locale-dependent library functions. */ |
| 307 | 2988 for (i = 128; i < 256; ++i) |
| 2989 { | |
| 2990 if (MB_ISUPPER(i)) | |
| 2991 { | |
| 324 | 2992 spelltab.st_isw[i] = TRUE; |
| 307 | 2993 spelltab.st_isu[i] = TRUE; |
| 2994 spelltab.st_fold[i] = MB_TOLOWER(i); | |
| 2995 } | |
| 324 | 2996 else if (MB_ISLOWER(i)) |
| 2997 { | |
| 2998 spelltab.st_isw[i] = TRUE; | |
| 2999 spelltab.st_upper[i] = MB_TOUPPER(i); | |
| 3000 } | |
| 307 | 3001 } |
| 3002 } | |
| 3003 } | |
| 3004 | |
| 3005 | |
| 3006 /* | |
| 358 | 3007 * Return TRUE if "p" points to a word character. |
| 366 | 3008 * As a special case we see "midword" characters as word character when it is |
| 358 | 3009 * followed by a word character. This finds they'there but not 'they there'. |
| 366 | 3010 * Thus this only works properly when past the first character of the word. |
| 358 | 3011 */ |
| 3012 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3013 spell_iswordp( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3014 char_u *p, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3015 win_T *wp) /* buffer used */ |
| 358 | 3016 { |
| 3017 char_u *s; | |
| 366 | 3018 int l; |
| 3019 int c; | |
| 3020 | |
| 3021 if (has_mbyte) | |
| 3022 { | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
3023 l = MB_PTR2LEN(p); |
| 358 | 3024 s = p; |
| 366 | 3025 if (l == 1) |
| 3026 { | |
| 3027 /* be quick for ASCII */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3028 if (wp->w_s->b_spell_ismw[*p]) |
| 366 | 3029 s = p + 1; /* skip a mid-word character */ |
| 3030 } | |
| 3031 else | |
| 3032 { | |
| 3033 c = mb_ptr2char(p); | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3034 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
|
3035 : (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
|
3036 && vim_strchr(wp->w_s->b_spell_ismw_mb, c) != NULL)) |
| 366 | 3037 s = p + l; |
| 3038 } | |
| 3039 | |
| 390 | 3040 c = mb_ptr2char(s); |
| 3041 if (c > 255) | |
| 5477 | 3042 return spell_mb_isword_class(mb_get_class(s), wp); |
| 390 | 3043 return spelltab.st_isw[c]; |
| 366 | 3044 } |
| 3045 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3046 return spelltab.st_isw[wp->w_s->b_spell_ismw[*p] ? p[1] : p[0]]; |
| 376 | 3047 } |
| 3048 | |
| 3049 /* | |
| 3050 * Return TRUE if "p" points to a word character. | |
| 3051 * Unlike spell_iswordp() this doesn't check for "midword" characters. | |
| 3052 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
3053 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3054 spell_iswordp_nmw(char_u *p, win_T *wp) |
| 376 | 3055 { |
| 390 | 3056 int c; |
| 3057 | |
| 3058 if (has_mbyte) | |
| 3059 { | |
| 3060 c = mb_ptr2char(p); | |
| 3061 if (c > 255) | |
| 5477 | 3062 return spell_mb_isword_class(mb_get_class(p), wp); |
| 390 | 3063 return spelltab.st_isw[c]; |
| 3064 } | |
| 376 | 3065 return spelltab.st_isw[*p]; |
| 358 | 3066 } |
| 3067 | |
| 372 | 3068 /* |
| 1580 | 3069 * Return TRUE if word class indicates a word character. |
| 3070 * Only for characters above 255. | |
| 3071 * Unicode subscript and superscript are not considered word characters. | |
| 5477 | 3072 * See also dbcs_class() and utf_class() in mbyte.c. |
| 3073 */ | |
| 3074 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3075 spell_mb_isword_class(int cl, win_T *wp) |
| 5477 | 3076 { |
| 3077 if (wp->w_s->b_cjk) | |
| 3078 /* East Asian characters are not considered word characters. */ | |
| 3079 return cl == 2 || cl == 0x2800; | |
| 1580 | 3080 return cl >= 2 && cl != 0x2070 && cl != 0x2080; |
| 3081 } | |
| 3082 | |
| 3083 /* | |
| 372 | 3084 * Return TRUE if "p" points to a word character. |
| 3085 * Wide version of spell_iswordp(). | |
| 3086 */ | |
| 3087 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3088 spell_iswordp_w(int *p, win_T *wp) |
| 372 | 3089 { |
| 3090 int *s; | |
| 3091 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3092 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
|
3093 : (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
|
3094 && vim_strchr(wp->w_s->b_spell_ismw_mb, *p) != NULL)) |
| 372 | 3095 s = p + 1; |
| 3096 else | |
| 3097 s = p; | |
| 3098 | |
| 390 | 3099 if (*s > 255) |
| 372 | 3100 { |
| 3101 if (enc_utf8) | |
| 5477 | 3102 return spell_mb_isword_class(utf_class(*s), wp); |
| 372 | 3103 if (enc_dbcs) |
| 5477 | 3104 return spell_mb_isword_class( |
| 3105 dbcs_class((unsigned)*s >> 8, *s & 0xff), wp); | |
| 372 | 3106 return 0; |
| 3107 } | |
| 3108 return spelltab.st_isw[*s]; | |
| 3109 } | |
| 3110 | |
| 358 | 3111 /* |
| 324 | 3112 * Case-fold "str[len]" into "buf[buflen]". The result is NUL terminated. |
| 3113 * Uses the character definitions from the .spl file. | |
| 307 | 3114 * When using a multi-byte 'encoding' the length may change! |
| 3115 * Returns FAIL when something wrong. | |
| 3116 */ | |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
3117 int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3118 spell_casefold( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3119 char_u *str, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3120 int len, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3121 char_u *buf, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3122 int buflen) |
| 307 | 3123 { |
| 3124 int i; | |
| 3125 | |
| 3126 if (len >= buflen) | |
| 3127 { | |
| 3128 buf[0] = NUL; | |
| 3129 return FAIL; /* result will not fit */ | |
| 3130 } | |
| 3131 | |
| 3132 if (has_mbyte) | |
| 3133 { | |
| 324 | 3134 int outi = 0; |
| 3135 char_u *p; | |
| 307 | 3136 int c; |
| 3137 | |
| 3138 /* Fold one character at a time. */ | |
| 324 | 3139 for (p = str; p < str + len; ) |
| 307 | 3140 { |
| 3141 if (outi + MB_MAXBYTES > buflen) | |
| 3142 { | |
| 3143 buf[outi] = NUL; | |
| 3144 return FAIL; | |
| 3145 } | |
| 474 | 3146 c = mb_cptr2char_adv(&p); |
| 324 | 3147 outi += mb_char2bytes(SPELL_TOFOLD(c), buf + outi); |
| 307 | 3148 } |
| 3149 buf[outi] = NUL; | |
| 3150 } | |
| 3151 else | |
| 3152 { | |
| 3153 /* Be quick for non-multibyte encodings. */ | |
| 3154 for (i = 0; i < len; ++i) | |
| 324 | 3155 buf[i] = spelltab.st_fold[str[i]]; |
| 307 | 3156 buf[i] = NUL; |
| 3157 } | |
| 3158 | |
| 3159 return OK; | |
| 3160 } | |
| 3161 | |
| 625 | 3162 /* values for sps_flags */ |
| 372 | 3163 #define SPS_BEST 1 |
| 3164 #define SPS_FAST 2 | |
| 3165 #define SPS_DOUBLE 4 | |
| 3166 | |
| 625 | 3167 static int sps_flags = SPS_BEST; /* flags from 'spellsuggest' */ |
| 3168 static int sps_limit = 9999; /* max nr of suggestions given */ | |
| 372 | 3169 |
| 3170 /* | |
| 3171 * Check the 'spellsuggest' option. Return FAIL if it's wrong. | |
| 483 | 3172 * Sets "sps_flags" and "sps_limit". |
| 372 | 3173 */ |
| 3174 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3175 spell_check_sps(void) |
| 372 | 3176 { |
| 3177 char_u *p; | |
| 483 | 3178 char_u *s; |
| 372 | 3179 char_u buf[MAXPATHL]; |
| 3180 int f; | |
| 3181 | |
| 3182 sps_flags = 0; | |
| 483 | 3183 sps_limit = 9999; |
| 372 | 3184 |
| 3185 for (p = p_sps; *p != NUL; ) | |
| 3186 { | |
| 3187 copy_option_part(&p, buf, MAXPATHL, ","); | |
| 3188 | |
| 3189 f = 0; | |
| 483 | 3190 if (VIM_ISDIGIT(*buf)) |
| 3191 { | |
| 3192 s = buf; | |
| 3193 sps_limit = getdigits(&s); | |
| 3194 if (*s != NUL && !VIM_ISDIGIT(*s)) | |
| 3195 f = -1; | |
| 3196 } | |
| 3197 else if (STRCMP(buf, "best") == 0) | |
| 372 | 3198 f = SPS_BEST; |
| 3199 else if (STRCMP(buf, "fast") == 0) | |
| 3200 f = SPS_FAST; | |
| 3201 else if (STRCMP(buf, "double") == 0) | |
| 3202 f = SPS_DOUBLE; | |
| 3203 else if (STRNCMP(buf, "expr:", 5) != 0 | |
| 3204 && STRNCMP(buf, "file:", 5) != 0) | |
| 3205 f = -1; | |
| 3206 | |
| 3207 if (f == -1 || (sps_flags != 0 && f != 0)) | |
| 3208 { | |
| 3209 sps_flags = SPS_BEST; | |
| 483 | 3210 sps_limit = 9999; |
| 372 | 3211 return FAIL; |
| 3212 } | |
| 3213 if (f != 0) | |
| 3214 sps_flags = f; | |
| 3215 } | |
| 3216 | |
| 3217 if (sps_flags == 0) | |
| 3218 sps_flags = SPS_BEST; | |
| 3219 | |
| 3220 return OK; | |
| 3221 } | |
| 3222 | |
| 323 | 3223 /* |
| 5374 | 3224 * "z=": Find badly spelled word under or after the cursor. |
| 323 | 3225 * Give suggestions for the properly spelled word. |
| 638 | 3226 * In Visual mode use the highlighted word as the bad word. |
| 485 | 3227 * When "count" is non-zero use that suggestion. |
| 323 | 3228 */ |
| 3229 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3230 spell_suggest(int count) |
| 323 | 3231 { |
| 3232 char_u *line; | |
| 3233 pos_T prev_cursor = curwin->w_cursor; | |
| 3234 char_u wcopy[MAXWLEN + 2]; | |
| 3235 char_u *p; | |
| 3236 int i; | |
| 3237 int c; | |
| 3238 suginfo_T sug; | |
| 3239 suggest_T *stp; | |
| 372 | 3240 int mouse_used; |
| 388 | 3241 int need_cap; |
| 483 | 3242 int limit; |
| 485 | 3243 int selected = count; |
| 638 | 3244 int badlen = 0; |
| 1938 | 3245 int msg_scroll_save = msg_scroll; |
| 638 | 3246 |
| 3247 if (no_spell_checking(curwin)) | |
| 3248 return; | |
| 3249 | |
| 3250 if (VIsual_active) | |
| 3251 { | |
| 3252 /* Use the Visually selected text as the bad word. But reject | |
| 3253 * a multi-line selection. */ | |
| 3254 if (curwin->w_cursor.lnum != VIsual.lnum) | |
| 3255 { | |
| 6949 | 3256 vim_beep(BO_SPELL); |
| 638 | 3257 return; |
| 3258 } | |
| 3259 badlen = (int)curwin->w_cursor.col - (int)VIsual.col; | |
| 3260 if (badlen < 0) | |
| 3261 badlen = -badlen; | |
| 3262 else | |
| 3263 curwin->w_cursor.col = VIsual.col; | |
| 3264 ++badlen; | |
| 3265 end_visual_mode(); | |
| 3266 } | |
| 5735 | 3267 /* Find the start of the badly spelled word. */ |
| 3268 else if (spell_move_to(curwin, FORWARD, TRUE, TRUE, NULL) == 0 | |
| 346 | 3269 || curwin->w_cursor.col > prev_cursor.col) |
| 3270 { | |
| 3271 /* No bad word or it starts after the cursor: use the word under the | |
| 3272 * cursor. */ | |
| 3273 curwin->w_cursor = prev_cursor; | |
| 3274 line = ml_get_curline(); | |
| 3275 p = line + curwin->w_cursor.col; | |
| 3276 /* Backup to before start of word. */ | |
| 5477 | 3277 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
|
3278 MB_PTR_BACK(line, p); |
| 346 | 3279 /* Forward to start of word. */ |
| 5477 | 3280 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
|
3281 MB_PTR_ADV(p); |
| 346 | 3282 |
| 5477 | 3283 if (!spell_iswordp_nmw(p, curwin)) /* No word found. */ |
| 346 | 3284 { |
| 3285 beep_flush(); | |
| 3286 return; | |
| 3287 } | |
| 835 | 3288 curwin->w_cursor.col = (colnr_T)(p - line); |
| 323 | 3289 } |
| 3290 | |
| 344 | 3291 /* Get the word and its length. */ |
| 3292 | |
| 388 | 3293 /* Figure out if the word should be capitalised. */ |
| 475 | 3294 need_cap = check_need_cap(curwin->w_cursor.lnum, curwin->w_cursor.col); |
| 3295 | |
|
2046
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3296 /* 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
|
3297 line = vim_strsave(ml_get_curline()); |
|
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3298 if (line == NULL) |
|
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3299 goto skip; |
| 388 | 3300 |
| 483 | 3301 /* Get the list of suggestions. Limit to 'lines' - 2 or the number in |
| 3302 * 'spellsuggest', whatever is smaller. */ | |
| 3303 if (sps_limit > (int)Rows - 2) | |
| 3304 limit = (int)Rows - 2; | |
| 3305 else | |
| 3306 limit = sps_limit; | |
| 638 | 3307 spell_find_suggest(line + curwin->w_cursor.col, badlen, &sug, limit, |
| 625 | 3308 TRUE, need_cap, TRUE); |
| 323 | 3309 |
| 3310 if (sug.su_ga.ga_len == 0) | |
|
15543
dd725a8ab112
patch 8.1.0779: argument for message functions is inconsistent
Bram Moolenaar <Bram@vim.org>
parents:
15470
diff
changeset
|
3311 msg(_("Sorry, no suggestions")); |
| 485 | 3312 else if (count > 0) |
| 3313 { | |
| 3314 if (count > sug.su_ga.ga_len) | |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
3315 smsg(_("Sorry, only %ld suggestions"), |
| 485 | 3316 (long)sug.su_ga.ga_len); |
| 3317 } | |
| 323 | 3318 else |
| 3319 { | |
|
13244
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
3320 VIM_CLEAR(repl_from); |
|
ac42c4b11dbc
patch 8.0.1496: clearing a pointer takes two lines
Christian Brabandt <cb@256bit.org>
parents:
12674
diff
changeset
|
3321 VIM_CLEAR(repl_to); |
| 372 | 3322 |
| 474 | 3323 #ifdef FEAT_RIGHTLEFT |
| 3324 /* When 'rightleft' is set the list is drawn right-left. */ | |
| 3325 cmdmsg_rl = curwin->w_p_rl; | |
| 3326 if (cmdmsg_rl) | |
| 3327 msg_col = Columns - 1; | |
| 3328 #endif | |
| 3329 | |
| 323 | 3330 /* List the suggestions. */ |
| 3331 msg_start(); | |
| 914 | 3332 msg_row = Rows - 1; /* for when 'cmdheight' > 1 */ |
| 372 | 3333 lines_left = Rows; /* avoid more prompt */ |
| 323 | 3334 vim_snprintf((char *)IObuff, IOSIZE, _("Change \"%.*s\" to:"), |
| 3335 sug.su_badlen, sug.su_badptr); | |
| 474 | 3336 #ifdef FEAT_RIGHTLEFT |
| 3337 if (cmdmsg_rl && STRNCMP(IObuff, "Change", 6) == 0) | |
| 3338 { | |
| 3339 /* And now the rabbit from the high hat: Avoid showing the | |
| 3340 * untranslated message rightleft. */ | |
| 3341 vim_snprintf((char *)IObuff, IOSIZE, ":ot \"%.*s\" egnahC", | |
| 3342 sug.su_badlen, sug.su_badptr); | |
| 3343 } | |
| 3344 #endif | |
|
15543
dd725a8ab112
patch 8.1.0779: argument for message functions is inconsistent
Bram Moolenaar <Bram@vim.org>
parents:
15470
diff
changeset
|
3345 msg_puts((char *)IObuff); |
| 323 | 3346 msg_clr_eos(); |
| 3347 msg_putchar('\n'); | |
| 346 | 3348 |
| 323 | 3349 msg_scroll = TRUE; |
| 3350 for (i = 0; i < sug.su_ga.ga_len; ++i) | |
| 3351 { | |
| 344 | 3352 stp = &SUG(sug.su_ga, i); |
| 323 | 3353 |
| 3354 /* The suggested word may replace only part of the bad word, add | |
| 3355 * the not replaced part. */ | |
| 2768 | 3356 vim_strncpy(wcopy, stp->st_word, MAXWLEN); |
| 323 | 3357 if (sug.su_badlen > stp->st_orglen) |
| 625 | 3358 vim_strncpy(wcopy + stp->st_wordlen, |
| 323 | 3359 sug.su_badptr + stp->st_orglen, |
| 3360 sug.su_badlen - stp->st_orglen); | |
| 474 | 3361 vim_snprintf((char *)IObuff, IOSIZE, "%2d", i + 1); |
| 3362 #ifdef FEAT_RIGHTLEFT | |
| 3363 if (cmdmsg_rl) | |
| 3364 rl_mirror(IObuff); | |
| 3365 #endif | |
|
15543
dd725a8ab112
patch 8.1.0779: argument for message functions is inconsistent
Bram Moolenaar <Bram@vim.org>
parents:
15470
diff
changeset
|
3366 msg_puts((char *)IObuff); |
| 474 | 3367 |
| 3368 vim_snprintf((char *)IObuff, IOSIZE, " \"%s\"", wcopy); | |
|
15543
dd725a8ab112
patch 8.1.0779: argument for message functions is inconsistent
Bram Moolenaar <Bram@vim.org>
parents:
15470
diff
changeset
|
3369 msg_puts((char *)IObuff); |
| 346 | 3370 |
| 3371 /* The word may replace more than "su_badlen". */ | |
| 3372 if (sug.su_badlen < stp->st_orglen) | |
| 3373 { | |
| 3374 vim_snprintf((char *)IObuff, IOSIZE, _(" < \"%.*s\""), | |
| 3375 stp->st_orglen, sug.su_badptr); | |
|
15543
dd725a8ab112
patch 8.1.0779: argument for message functions is inconsistent
Bram Moolenaar <Bram@vim.org>
parents:
15470
diff
changeset
|
3376 msg_puts((char *)IObuff); |
| 346 | 3377 } |
| 3378 | |
| 324 | 3379 if (p_verbose > 0) |
| 344 | 3380 { |
| 346 | 3381 /* Add the score. */ |
| 351 | 3382 if (sps_flags & (SPS_DOUBLE | SPS_BEST)) |
| 474 | 3383 vim_snprintf((char *)IObuff, IOSIZE, " (%s%d - %d)", |
| 344 | 3384 stp->st_salscore ? "s " : "", |
| 3385 stp->st_score, stp->st_altscore); | |
| 3386 else | |
| 474 | 3387 vim_snprintf((char *)IObuff, IOSIZE, " (%d)", |
| 346 | 3388 stp->st_score); |
| 474 | 3389 #ifdef FEAT_RIGHTLEFT |
| 3390 if (cmdmsg_rl) | |
| 3391 /* Mirror the numbers, but keep the leading space. */ | |
| 3392 rl_mirror(IObuff + 1); | |
| 3393 #endif | |
| 346 | 3394 msg_advance(30); |
|
15543
dd725a8ab112
patch 8.1.0779: argument for message functions is inconsistent
Bram Moolenaar <Bram@vim.org>
parents:
15470
diff
changeset
|
3395 msg_puts((char *)IObuff); |
| 344 | 3396 } |
| 323 | 3397 msg_putchar('\n'); |
| 3398 } | |
| 3399 | |
| 474 | 3400 #ifdef FEAT_RIGHTLEFT |
| 3401 cmdmsg_rl = FALSE; | |
| 3402 msg_col = 0; | |
| 3403 #endif | |
| 323 | 3404 /* Ask for choice. */ |
| 485 | 3405 selected = prompt_for_number(&mouse_used); |
| 372 | 3406 if (mouse_used) |
| 485 | 3407 selected -= lines_left; |
| 1938 | 3408 lines_left = Rows; /* avoid more prompt */ |
| 3409 /* don't delay for 'smd' in normal_cmd() */ | |
| 3410 msg_scroll = msg_scroll_save; | |
| 485 | 3411 } |
| 3412 | |
| 3413 if (selected > 0 && selected <= sug.su_ga.ga_len && u_save_cursor() == OK) | |
| 3414 { | |
| 3415 /* Save the from and to text for :spellrepall. */ | |
| 3416 stp = &SUG(sug.su_ga, selected - 1); | |
| 548 | 3417 if (sug.su_badlen > stp->st_orglen) |
| 3418 { | |
| 3419 /* Replacing less than "su_badlen", append the remainder to | |
| 3420 * repl_to. */ | |
| 3421 repl_from = vim_strnsave(sug.su_badptr, sug.su_badlen); | |
| 3422 vim_snprintf((char *)IObuff, IOSIZE, "%s%.*s", stp->st_word, | |
| 3423 sug.su_badlen - stp->st_orglen, | |
| 3424 sug.su_badptr + stp->st_orglen); | |
| 3425 repl_to = vim_strsave(IObuff); | |
| 3426 } | |
| 3427 else | |
| 3428 { | |
| 3429 /* Replacing su_badlen or more, use the whole word. */ | |
| 3430 repl_from = vim_strnsave(sug.su_badptr, stp->st_orglen); | |
| 3431 repl_to = vim_strsave(stp->st_word); | |
| 3432 } | |
| 485 | 3433 |
| 3434 /* Replace the word. */ | |
|
16764
ef00b6bc186b
patch 8.1.1384: using "int" for alloc() often results in compiler warnings
Bram Moolenaar <Bram@vim.org>
parents:
16738
diff
changeset
|
3435 p = alloc(STRLEN(line) - stp->st_orglen + stp->st_wordlen + 1); |
| 485 | 3436 if (p != NULL) |
| 3437 { | |
| 835 | 3438 c = (int)(sug.su_badptr - line); |
| 485 | 3439 mch_memmove(p, line, c); |
| 3440 STRCPY(p + c, stp->st_word); | |
| 3441 STRCAT(p, sug.su_badptr + stp->st_orglen); | |
| 3442 ml_replace(curwin->w_cursor.lnum, p, FALSE); | |
| 3443 curwin->w_cursor.col = c; | |
| 3444 | |
| 3445 /* For redo we use a change-word command. */ | |
| 3446 ResetRedobuff(); | |
| 3447 AppendToRedobuff((char_u *)"ciw"); | |
| 620 | 3448 AppendToRedobuffLit(p + c, |
| 625 | 3449 stp->st_wordlen + sug.su_badlen - stp->st_orglen); |
| 485 | 3450 AppendCharToRedobuff(ESC); |
| 819 | 3451 |
| 3452 /* After this "p" may be invalid. */ | |
| 3453 changed_bytes(curwin->w_cursor.lnum, c); | |
| 485 | 3454 } |
| 3455 } | |
| 3456 else | |
| 3457 curwin->w_cursor = prev_cursor; | |
| 323 | 3458 |
| 344 | 3459 spell_find_cleanup(&sug); |
|
2046
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3460 skip: |
|
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3461 vim_free(line); |
| 344 | 3462 } |
| 3463 | |
| 3464 /* | |
| 475 | 3465 * Check if the word at line "lnum" column "col" is required to start with a |
| 3466 * capital. This uses 'spellcapcheck' of the current buffer. | |
| 3467 */ | |
| 3468 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3469 check_need_cap(linenr_T lnum, colnr_T col) |
| 475 | 3470 { |
| 3471 int need_cap = FALSE; | |
| 3472 char_u *line; | |
| 3473 char_u *line_copy = NULL; | |
| 3474 char_u *p; | |
| 3475 colnr_T endcol; | |
| 3476 regmatch_T regmatch; | |
| 3477 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3478 if (curwin->w_s->b_cap_prog == NULL) |
| 475 | 3479 return FALSE; |
| 3480 | |
| 3481 line = ml_get_curline(); | |
| 3482 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
|
3483 if (getwhitecols(line) >= (int)col) |
| 475 | 3484 { |
| 3485 /* At start of line, check if previous line is empty or sentence | |
| 3486 * ends there. */ | |
| 3487 if (lnum == 1) | |
| 3488 need_cap = TRUE; | |
| 3489 else | |
| 3490 { | |
| 3491 line = ml_get(lnum - 1); | |
| 3492 if (*skipwhite(line) == NUL) | |
| 3493 need_cap = TRUE; | |
| 3494 else | |
| 3495 { | |
| 3496 /* Append a space in place of the line break. */ | |
| 3497 line_copy = concat_str(line, (char_u *)" "); | |
| 3498 line = line_copy; | |
| 835 | 3499 endcol = (colnr_T)STRLEN(line); |
| 475 | 3500 } |
| 3501 } | |
| 3502 } | |
| 3503 else | |
| 3504 endcol = col; | |
| 3505 | |
| 3506 if (endcol > 0) | |
| 3507 { | |
| 3508 /* 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
|
3509 regmatch.regprog = curwin->w_s->b_cap_prog; |
| 475 | 3510 regmatch.rm_ic = FALSE; |
| 3511 p = line + endcol; | |
| 3512 for (;;) | |
| 3513 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
3514 MB_PTR_BACK(line, p); |
| 5477 | 3515 if (p == line || spell_iswordp_nmw(p, curwin)) |
| 475 | 3516 break; |
| 3517 if (vim_regexec(®match, p, 0) | |
| 3518 && regmatch.endp[0] == line + endcol) | |
| 3519 { | |
| 3520 need_cap = TRUE; | |
| 3521 break; | |
| 3522 } | |
| 3523 } | |
| 6375 | 3524 curwin->w_s->b_cap_prog = regmatch.regprog; |
| 475 | 3525 } |
| 3526 | |
| 3527 vim_free(line_copy); | |
| 3528 | |
| 3529 return need_cap; | |
| 3530 } | |
| 3531 | |
| 3532 | |
| 3533 /* | |
| 372 | 3534 * ":spellrepall" |
| 3535 */ | |
| 3536 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3537 ex_spellrepall(exarg_T *eap UNUSED) |
| 372 | 3538 { |
| 3539 pos_T pos = curwin->w_cursor; | |
| 3540 char_u *frompat; | |
| 3541 int addlen; | |
| 3542 char_u *line; | |
| 3543 char_u *p; | |
| 3544 int save_ws = p_ws; | |
| 483 | 3545 linenr_T prev_lnum = 0; |
| 372 | 3546 |
| 3547 if (repl_from == NULL || repl_to == NULL) | |
| 3548 { | |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
3549 emsg(_("E752: No previous spell replacement")); |
| 372 | 3550 return; |
| 3551 } | |
| 835 | 3552 addlen = (int)(STRLEN(repl_to) - STRLEN(repl_from)); |
| 3553 | |
|
16764
ef00b6bc186b
patch 8.1.1384: using "int" for alloc() often results in compiler warnings
Bram Moolenaar <Bram@vim.org>
parents:
16738
diff
changeset
|
3554 frompat = alloc(STRLEN(repl_from) + 7); |
| 372 | 3555 if (frompat == NULL) |
| 3556 return; | |
| 3557 sprintf((char *)frompat, "\\V\\<%s\\>", repl_from); | |
| 3558 p_ws = FALSE; | |
| 3559 | |
| 483 | 3560 sub_nsubs = 0; |
| 3561 sub_nlines = 0; | |
| 372 | 3562 curwin->w_cursor.lnum = 0; |
| 3563 while (!got_int) | |
| 3564 { | |
|
11521
578df034735d
patch 8.0.0643: when a pattern search is slow Vim becomes unusable
Christian Brabandt <cb@256bit.org>
parents:
11394
diff
changeset
|
3565 if (do_search(NULL, '/', frompat, 1L, SEARCH_KEEP, NULL, NULL) == 0 |
| 372 | 3566 || u_save_cursor() == FAIL) |
| 3567 break; | |
| 3568 | |
| 3569 /* Only replace when the right word isn't there yet. This happens | |
| 3570 * when changing "etc" to "etc.". */ | |
| 3571 line = ml_get_curline(); | |
| 3572 if (addlen <= 0 || STRNCMP(line + curwin->w_cursor.col, | |
| 3573 repl_to, STRLEN(repl_to)) != 0) | |
| 3574 { | |
|
16764
ef00b6bc186b
patch 8.1.1384: using "int" for alloc() often results in compiler warnings
Bram Moolenaar <Bram@vim.org>
parents:
16738
diff
changeset
|
3575 p = alloc(STRLEN(line) + addlen + 1); |
| 372 | 3576 if (p == NULL) |
| 3577 break; | |
| 3578 mch_memmove(p, line, curwin->w_cursor.col); | |
| 3579 STRCPY(p + curwin->w_cursor.col, repl_to); | |
| 3580 STRCAT(p, line + curwin->w_cursor.col + STRLEN(repl_from)); | |
| 3581 ml_replace(curwin->w_cursor.lnum, p, FALSE); | |
| 3582 changed_bytes(curwin->w_cursor.lnum, curwin->w_cursor.col); | |
| 483 | 3583 |
| 3584 if (curwin->w_cursor.lnum != prev_lnum) | |
| 3585 { | |
| 3586 ++sub_nlines; | |
| 3587 prev_lnum = curwin->w_cursor.lnum; | |
| 3588 } | |
| 3589 ++sub_nsubs; | |
| 372 | 3590 } |
| 835 | 3591 curwin->w_cursor.col += (colnr_T)STRLEN(repl_to); |
| 372 | 3592 } |
| 3593 | |
| 3594 p_ws = save_ws; | |
| 3595 curwin->w_cursor = pos; | |
| 3596 vim_free(frompat); | |
| 3597 | |
| 483 | 3598 if (sub_nsubs == 0) |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
3599 semsg(_("E753: Not found: %s"), repl_from); |
| 483 | 3600 else |
| 3601 do_sub_msg(FALSE); | |
| 372 | 3602 } |
| 3603 | |
| 3604 /* | |
| 344 | 3605 * Find spell suggestions for "word". Return them in the growarray "*gap" as |
| 3606 * a list of allocated strings. | |
| 3607 */ | |
| 3608 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3609 spell_suggest_list( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3610 garray_T *gap, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3611 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3612 int maxcount, /* maximum nr of suggestions */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3613 int need_cap, /* 'spellcapcheck' matched */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3614 int interactive) |
| 344 | 3615 { |
| 3616 suginfo_T sug; | |
| 3617 int i; | |
| 3618 suggest_T *stp; | |
| 3619 char_u *wcopy; | |
| 3620 | |
| 638 | 3621 spell_find_suggest(word, 0, &sug, maxcount, FALSE, need_cap, interactive); |
| 344 | 3622 |
| 3623 /* Make room in "gap". */ | |
| 3624 ga_init2(gap, sizeof(char_u *), sug.su_ga.ga_len + 1); | |
| 626 | 3625 if (ga_grow(gap, sug.su_ga.ga_len) == OK) |
| 3626 { | |
| 3627 for (i = 0; i < sug.su_ga.ga_len; ++i) | |
| 3628 { | |
| 3629 stp = &SUG(sug.su_ga, i); | |
| 3630 | |
| 3631 /* The suggested word may replace only part of "word", add the not | |
| 3632 * replaced part. */ | |
| 3633 wcopy = alloc(stp->st_wordlen | |
| 835 | 3634 + (unsigned)STRLEN(sug.su_badptr + stp->st_orglen) + 1); |
| 626 | 3635 if (wcopy == NULL) |
| 3636 break; | |
| 3637 STRCPY(wcopy, stp->st_word); | |
| 3638 STRCPY(wcopy + stp->st_wordlen, sug.su_badptr + stp->st_orglen); | |
| 3639 ((char_u **)gap->ga_data)[gap->ga_len++] = wcopy; | |
| 3640 } | |
| 344 | 3641 } |
| 3642 | |
| 3643 spell_find_cleanup(&sug); | |
| 3644 } | |
| 3645 | |
| 3646 /* | |
| 3647 * Find spell suggestions for the word at the start of "badptr". | |
| 3648 * Return the suggestions in "su->su_ga". | |
| 3649 * The maximum number of suggestions is "maxcount". | |
| 3650 * Note: does use info for the current window. | |
| 3651 * This is based on the mechanisms of Aspell, but completely reimplemented. | |
| 3652 */ | |
| 3653 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3654 spell_find_suggest( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3655 char_u *badptr, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3656 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
|
3657 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3658 int maxcount, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3659 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
|
3660 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
|
3661 int interactive) |
| 344 | 3662 { |
| 534 | 3663 hlf_T attr = HLF_COUNT; |
| 372 | 3664 char_u buf[MAXPATHL]; |
| 3665 char_u *p; | |
| 3666 int do_combine = FALSE; | |
| 3667 char_u *sps_copy; | |
| 3668 #ifdef FEAT_EVAL | |
| 3669 static int expr_busy = FALSE; | |
| 3670 #endif | |
| 385 | 3671 int c; |
| 503 | 3672 int i; |
| 3673 langp_T *lp; | |
| 344 | 3674 |
| 3675 /* | |
| 3676 * Set the info in "*su". | |
| 3677 */ | |
| 3678 vim_memset(su, 0, sizeof(suginfo_T)); | |
| 3679 ga_init2(&su->su_ga, (int)sizeof(suggest_T), 10); | |
| 3680 ga_init2(&su->su_sga, (int)sizeof(suggest_T), 10); | |
| 355 | 3681 if (*badptr == NUL) |
| 3682 return; | |
| 344 | 3683 hash_init(&su->su_banned); |
| 3684 | |
| 3685 su->su_badptr = badptr; | |
| 638 | 3686 if (badlen != 0) |
| 3687 su->su_badlen = badlen; | |
| 3688 else | |
| 3689 su->su_badlen = spell_check(curwin, su->su_badptr, &attr, NULL, FALSE); | |
| 344 | 3690 su->su_maxcount = maxcount; |
| 372 | 3691 su->su_maxscore = SCORE_MAXINIT; |
| 344 | 3692 |
| 3693 if (su->su_badlen >= MAXWLEN) | |
| 3694 su->su_badlen = MAXWLEN - 1; /* just in case */ | |
| 3695 vim_strncpy(su->su_badword, su->su_badptr, su->su_badlen); | |
| 3696 (void)spell_casefold(su->su_badptr, su->su_badlen, | |
| 3697 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
|
3698 /* 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
|
3699 * 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
|
3700 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
|
3701 |
| 346 | 3702 /* get caps flags for bad word */ |
| 474 | 3703 su->su_badflags = badword_captype(su->su_badptr, |
| 3704 su->su_badptr + su->su_badlen); | |
| 388 | 3705 if (need_cap) |
| 3706 su->su_badflags |= WF_ONECAP; | |
| 344 | 3707 |
| 503 | 3708 /* Find the default language for sound folding. We simply use the first |
| 3709 * one in 'spelllang' that supports sound folding. That's good for when | |
| 3710 * using multiple files for one language, it's not that bad when mixing | |
| 3711 * languages (e.g., "pl,en"). */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3712 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
|
3713 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
3714 lp = LANGP_ENTRY(curbuf->b_s.b_langp, i); |
| 503 | 3715 if (lp->lp_sallang != NULL) |
| 3716 { | |
| 3717 su->su_sallang = lp->lp_sallang; | |
| 3718 break; | |
| 3719 } | |
| 3720 } | |
| 3721 | |
| 534 | 3722 /* Soundfold the bad word with the default sound folding, so that we don't |
| 3723 * have to do this many times. */ | |
| 3724 if (su->su_sallang != NULL) | |
| 3725 spell_soundfold(su->su_sallang, su->su_fbadword, TRUE, | |
| 3726 su->su_sal_badword); | |
| 3727 | |
| 385 | 3728 /* If the word is not capitalised and spell_check() doesn't consider the |
| 3729 * word to be bad then it might need to be capitalised. Add a suggestion | |
| 3730 * for that. */ | |
| 455 | 3731 c = PTR2CHAR(su->su_badptr); |
| 534 | 3732 if (!SPELL_ISUPPER(c) && attr == HLF_COUNT) |
| 385 | 3733 { |
| 3734 make_case_word(su->su_badword, buf, WF_ONECAP); | |
| 3735 add_suggestion(su, &su->su_ga, buf, su->su_badlen, SCORE_ICASE, | |
| 625 | 3736 0, TRUE, su->su_sallang, FALSE); |
| 385 | 3737 } |
| 3738 | |
| 344 | 3739 /* Ban the bad word itself. It may appear in another region. */ |
| 358 | 3740 if (banbadword) |
| 3741 add_banned(su, su->su_badword); | |
| 344 | 3742 |
| 372 | 3743 /* Make a copy of 'spellsuggest', because the expression may change it. */ |
| 3744 sps_copy = vim_strsave(p_sps); | |
| 3745 if (sps_copy == NULL) | |
| 3746 return; | |
| 3747 | |
| 3748 /* Loop over the items in 'spellsuggest'. */ | |
| 3749 for (p = sps_copy; *p != NUL; ) | |
| 3750 { | |
| 3751 copy_option_part(&p, buf, MAXPATHL, ","); | |
| 3752 | |
| 3753 if (STRNCMP(buf, "expr:", 5) == 0) | |
| 3754 { | |
| 3755 #ifdef FEAT_EVAL | |
| 375 | 3756 /* Evaluate an expression. Skip this when called recursively, |
| 3757 * when using spellsuggest() in the expression. */ | |
| 372 | 3758 if (!expr_busy) |
| 3759 { | |
| 3760 expr_busy = TRUE; | |
| 3761 spell_suggest_expr(su, buf + 5); | |
| 3762 expr_busy = FALSE; | |
| 3763 } | |
| 3764 #endif | |
| 3765 } | |
| 3766 else if (STRNCMP(buf, "file:", 5) == 0) | |
| 3767 /* Use list of suggestions in a file. */ | |
| 3768 spell_suggest_file(su, buf + 5); | |
| 3769 else | |
| 3770 { | |
| 3771 /* Use internal method. */ | |
| 625 | 3772 spell_suggest_intern(su, interactive); |
| 372 | 3773 if (sps_flags & SPS_DOUBLE) |
| 3774 do_combine = TRUE; | |
| 3775 } | |
| 3776 } | |
| 3777 | |
| 3778 vim_free(sps_copy); | |
| 3779 | |
| 3780 if (do_combine) | |
| 3781 /* Combine the two list of suggestions. This must be done last, | |
| 3782 * because sorting changes the order again. */ | |
| 3783 score_combine(su); | |
| 3784 } | |
| 3785 | |
| 3786 #ifdef FEAT_EVAL | |
| 3787 /* | |
| 3788 * Find suggestions by evaluating expression "expr". | |
| 3789 */ | |
| 3790 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3791 spell_suggest_expr(suginfo_T *su, char_u *expr) |
| 372 | 3792 { |
| 3793 list_T *list; | |
| 3794 listitem_T *li; | |
| 3795 int score; | |
| 3796 char_u *p; | |
| 3797 | |
| 3798 /* The work is split up in a few parts to avoid having to export | |
| 3799 * suginfo_T. | |
| 3800 * First evaluate the expression and get the resulting list. */ | |
| 3801 list = eval_spell_expr(su->su_badword, expr); | |
| 3802 if (list != NULL) | |
| 3803 { | |
| 3804 /* Loop over the items in the list. */ | |
| 3805 for (li = list->lv_first; li != NULL; li = li->li_next) | |
| 3806 if (li->li_tv.v_type == VAR_LIST) | |
| 3807 { | |
| 3808 /* Get the word and the score from the items. */ | |
| 3809 score = get_spellword(li->li_tv.vval.v_list, &p); | |
| 625 | 3810 if (score >= 0 && score <= su->su_maxscore) |
| 3811 add_suggestion(su, &su->su_ga, p, su->su_badlen, | |
| 3812 score, 0, TRUE, su->su_sallang, FALSE); | |
| 372 | 3813 } |
| 3814 list_unref(list); | |
| 3815 } | |
| 3816 | |
| 625 | 3817 /* Remove bogus suggestions, sort and truncate at "maxcount". */ |
| 3818 check_suggestions(su, &su->su_ga); | |
| 372 | 3819 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, su->su_maxcount); |
| 3820 } | |
| 3821 #endif | |
| 3822 | |
| 3823 /* | |
| 474 | 3824 * Find suggestions in file "fname". Used for "file:" in 'spellsuggest'. |
| 372 | 3825 */ |
| 3826 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3827 spell_suggest_file(suginfo_T *su, char_u *fname) |
| 372 | 3828 { |
| 3829 FILE *fd; | |
| 3830 char_u line[MAXWLEN * 2]; | |
| 3831 char_u *p; | |
| 3832 int len; | |
| 3833 char_u cword[MAXWLEN]; | |
| 3834 | |
| 3835 /* Open the file. */ | |
| 3836 fd = mch_fopen((char *)fname, "r"); | |
| 3837 if (fd == NULL) | |
| 3838 { | |
|
15470
55ccc2d353bd
patch 8.1.0743: giving error messages is not flexible
Bram Moolenaar <Bram@vim.org>
parents:
15034
diff
changeset
|
3839 semsg(_(e_notopen), fname); |
| 372 | 3840 return; |
| 3841 } | |
| 3842 | |
| 3843 /* Read it line by line. */ | |
| 3844 while (!vim_fgets(line, MAXWLEN * 2, fd) && !got_int) | |
| 3845 { | |
| 3846 line_breakcheck(); | |
| 3847 | |
| 3848 p = vim_strchr(line, '/'); | |
| 3849 if (p == NULL) | |
| 3850 continue; /* No Tab found, just skip the line. */ | |
| 3851 *p++ = NUL; | |
| 3852 if (STRICMP(su->su_badword, line) == 0) | |
| 3853 { | |
| 3854 /* Match! Isolate the good word, until CR or NL. */ | |
| 3855 for (len = 0; p[len] >= ' '; ++len) | |
| 3856 ; | |
| 3857 p[len] = NUL; | |
| 3858 | |
| 3859 /* If the suggestion doesn't have specific case duplicate the case | |
| 3860 * of the bad word. */ | |
| 3861 if (captype(p, NULL) == 0) | |
| 3862 { | |
| 3863 make_case_word(p, cword, su->su_badflags); | |
| 3864 p = cword; | |
| 3865 } | |
| 3866 | |
| 3867 add_suggestion(su, &su->su_ga, p, su->su_badlen, | |
| 625 | 3868 SCORE_FILE, 0, TRUE, su->su_sallang, FALSE); |
| 372 | 3869 } |
| 3870 } | |
| 3871 | |
| 3872 fclose(fd); | |
| 3873 | |
| 625 | 3874 /* Remove bogus suggestions, sort and truncate at "maxcount". */ |
| 3875 check_suggestions(su, &su->su_ga); | |
| 372 | 3876 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, su->su_maxcount); |
| 3877 } | |
| 3878 | |
| 3879 /* | |
| 3880 * Find suggestions for the internal method indicated by "sps_flags". | |
| 3881 */ | |
| 3882 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3883 spell_suggest_intern(suginfo_T *su, int interactive) |
| 625 | 3884 { |
| 3885 /* | |
| 3886 * Load the .sug file(s) that are available and not done yet. | |
| 3887 */ | |
| 3888 suggest_load_files(); | |
| 3889 | |
| 344 | 3890 /* |
| 346 | 3891 * 1. Try special cases, such as repeating a word: "the the" -> "the". |
| 344 | 3892 * |
| 3893 * Set a maximum score to limit the combination of operations that is | |
| 3894 * tried. | |
| 3895 */ | |
| 346 | 3896 suggest_try_special(su); |
| 3897 | |
| 3898 /* | |
| 3899 * 2. Try inserting/deleting/swapping/changing a letter, use REP entries | |
| 3900 * from the .aff file and inserting a space (split the word). | |
| 3901 */ | |
| 3902 suggest_try_change(su); | |
| 344 | 3903 |
| 3904 /* For the resulting top-scorers compute the sound-a-like score. */ | |
| 3905 if (sps_flags & SPS_DOUBLE) | |
| 3906 score_comp_sal(su); | |
| 3907 | |
| 3908 /* | |
| 346 | 3909 * 3. Try finding sound-a-like words. |
| 344 | 3910 */ |
| 625 | 3911 if ((sps_flags & SPS_FAST) == 0) |
| 3912 { | |
| 3913 if (sps_flags & SPS_BEST) | |
| 3914 /* Adjust the word score for the suggestions found so far for how | |
| 3915 * they sounds like. */ | |
| 3916 rescore_suggestions(su); | |
| 3917 | |
| 3918 /* | |
|
2046
d433f43849ba
updated for version 7.2.332
Bram Moolenaar <bram@zimbu.org>
parents:
1938
diff
changeset
|
3919 * While going through the soundfold tree "su_maxscore" is the score |
| 625 | 3920 * for the soundfold word, limits the changes that are being tried, |
| 3921 * and "su_sfmaxscore" the rescored score, which is set by | |
| 3922 * cleanup_suggestions(). | |
| 3923 * First find words with a small edit distance, because this is much | |
| 3924 * faster and often already finds the top-N suggestions. If we didn't | |
| 3925 * find many suggestions try again with a higher edit distance. | |
| 3926 * "sl_sounddone" is used to avoid doing the same word twice. | |
| 3927 */ | |
| 3928 suggest_try_soundalike_prep(); | |
| 3929 su->su_maxscore = SCORE_SFMAX1; | |
| 3930 su->su_sfmaxscore = SCORE_MAXINIT * 3; | |
| 346 | 3931 suggest_try_soundalike(su); |
| 625 | 3932 if (su->su_ga.ga_len < SUG_CLEAN_COUNT(su)) |
| 3933 { | |
| 3934 /* We didn't find enough matches, try again, allowing more | |
| 3935 * changes to the soundfold word. */ | |
| 3936 su->su_maxscore = SCORE_SFMAX2; | |
| 3937 suggest_try_soundalike(su); | |
| 3938 if (su->su_ga.ga_len < SUG_CLEAN_COUNT(su)) | |
| 3939 { | |
| 3940 /* Still didn't find enough matches, try again, allowing even | |
| 3941 * more changes to the soundfold word. */ | |
| 3942 su->su_maxscore = SCORE_SFMAX3; | |
| 3943 suggest_try_soundalike(su); | |
| 3944 } | |
| 3945 } | |
| 3946 su->su_maxscore = su->su_sfmaxscore; | |
| 3947 suggest_try_soundalike_finish(); | |
| 3948 } | |
| 3949 | |
| 3950 /* When CTRL-C was hit while searching do show the results. Only clear | |
| 3951 * got_int when using a command, not for spellsuggest(). */ | |
| 344 | 3952 ui_breakcheck(); |
| 625 | 3953 if (interactive && got_int) |
| 344 | 3954 { |
| 3955 (void)vgetc(); | |
| 3956 got_int = FALSE; | |
| 3957 } | |
| 3958 | |
| 372 | 3959 if ((sps_flags & SPS_DOUBLE) == 0 && su->su_ga.ga_len != 0) |
| 344 | 3960 { |
| 3961 if (sps_flags & SPS_BEST) | |
| 3962 /* Adjust the word score for how it sounds like. */ | |
| 3963 rescore_suggestions(su); | |
| 3964 | |
| 625 | 3965 /* Remove bogus suggestions, sort and truncate at "maxcount". */ |
| 3966 check_suggestions(su, &su->su_ga); | |
| 372 | 3967 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, su->su_maxcount); |
| 344 | 3968 } |
| 3969 } | |
| 3970 | |
| 3971 /* | |
| 3972 * Free the info put in "*su" by spell_find_suggest(). | |
| 3973 */ | |
| 3974 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3975 spell_find_cleanup(suginfo_T *su) |
| 344 | 3976 { |
| 3977 int i; | |
| 3978 | |
| 3979 /* Free the suggestions. */ | |
| 3980 for (i = 0; i < su->su_ga.ga_len; ++i) | |
| 3981 vim_free(SUG(su->su_ga, i).st_word); | |
| 3982 ga_clear(&su->su_ga); | |
| 3983 for (i = 0; i < su->su_sga.ga_len; ++i) | |
| 3984 vim_free(SUG(su->su_sga, i).st_word); | |
| 3985 ga_clear(&su->su_sga); | |
| 323 | 3986 |
| 3987 /* Free the banned words. */ | |
| 625 | 3988 hash_clear_all(&su->su_banned, 0); |
| 323 | 3989 } |
| 3990 | |
| 3991 /* | |
| 324 | 3992 * Make a copy of "word", with the first letter upper or lower cased, to |
| 3993 * "wcopy[MAXWLEN]". "word" must not be empty. | |
| 3994 * The result is NUL terminated. | |
| 323 | 3995 */ |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
3996 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3997 onecap_copy( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3998 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
3999 char_u *wcopy, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4000 int upper) /* TRUE: first letter made upper case */ |
| 323 | 4001 { |
| 4002 char_u *p; | |
| 4003 int c; | |
| 4004 int l; | |
| 4005 | |
| 4006 p = word; | |
| 4007 if (has_mbyte) | |
| 474 | 4008 c = mb_cptr2char_adv(&p); |
| 323 | 4009 else |
| 4010 c = *p++; | |
| 4011 if (upper) | |
| 324 | 4012 c = SPELL_TOUPPER(c); |
| 323 | 4013 else |
| 324 | 4014 c = SPELL_TOFOLD(c); |
| 323 | 4015 if (has_mbyte) |
| 4016 l = mb_char2bytes(c, wcopy); | |
| 4017 else | |
| 4018 { | |
| 4019 l = 1; | |
| 4020 wcopy[0] = c; | |
| 4021 } | |
| 376 | 4022 vim_strncpy(wcopy + l, p, MAXWLEN - l - 1); |
| 323 | 4023 } |
| 4024 | |
| 4025 /* | |
| 324 | 4026 * Make a copy of "word" with all the letters upper cased into |
| 4027 * "wcopy[MAXWLEN]". The result is NUL terminated. | |
| 323 | 4028 */ |
| 4029 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4030 allcap_copy(char_u *word, char_u *wcopy) |
| 323 | 4031 { |
| 4032 char_u *s; | |
| 4033 char_u *d; | |
| 4034 int c; | |
| 4035 | |
| 4036 d = wcopy; | |
| 4037 for (s = word; *s != NUL; ) | |
| 4038 { | |
| 4039 if (has_mbyte) | |
| 474 | 4040 c = mb_cptr2char_adv(&s); |
| 323 | 4041 else |
| 4042 c = *s++; | |
| 492 | 4043 |
| 3042 | 4044 /* We only change 0xdf to SS when we are certain latin1 is used. It |
| 492 | 4045 * would cause weird errors in other 8-bit encodings. */ |
| 4046 if (enc_latin1like && c == 0xdf) | |
| 4047 { | |
| 4048 c = 'S'; | |
| 4049 if (d - wcopy >= MAXWLEN - 1) | |
| 4050 break; | |
| 4051 *d++ = c; | |
| 4052 } | |
| 4053 else | |
| 4054 c = SPELL_TOUPPER(c); | |
| 323 | 4055 |
| 4056 if (has_mbyte) | |
| 4057 { | |
| 4058 if (d - wcopy >= MAXWLEN - MB_MAXBYTES) | |
| 4059 break; | |
| 4060 d += mb_char2bytes(c, d); | |
| 4061 } | |
| 4062 else | |
| 4063 { | |
| 4064 if (d - wcopy >= MAXWLEN - 1) | |
| 4065 break; | |
| 4066 *d++ = c; | |
| 4067 } | |
| 4068 } | |
| 4069 *d = NUL; | |
| 4070 } | |
| 4071 | |
| 4072 /* | |
| 346 | 4073 * Try finding suggestions by recognizing specific situations. |
| 4074 */ | |
| 4075 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4076 suggest_try_special(suginfo_T *su) |
| 346 | 4077 { |
| 4078 char_u *p; | |
| 376 | 4079 size_t len; |
| 346 | 4080 int c; |
| 4081 char_u word[MAXWLEN]; | |
| 4082 | |
| 4083 /* | |
| 4084 * Recognize a word that is repeated: "the the". | |
| 4085 */ | |
| 4086 p = skiptowhite(su->su_fbadword); | |
| 4087 len = p - su->su_fbadword; | |
| 4088 p = skipwhite(p); | |
| 4089 if (STRLEN(p) == len && STRNCMP(su->su_fbadword, p, len) == 0) | |
| 4090 { | |
| 4091 /* Include badflags: if the badword is onecap or allcap | |
| 4092 * use that for the goodword too: "The the" -> "The". */ | |
| 4093 c = su->su_fbadword[len]; | |
| 4094 su->su_fbadword[len] = NUL; | |
| 4095 make_case_word(su->su_fbadword, word, su->su_badflags); | |
| 4096 su->su_fbadword[len] = c; | |
| 534 | 4097 |
| 4098 /* Give a soundalike score of 0, compute the score as if deleting one | |
| 4099 * character. */ | |
| 4100 add_suggestion(su, &su->su_ga, word, su->su_badlen, | |
| 625 | 4101 RESCORE(SCORE_REP, 0), 0, TRUE, su->su_sallang, FALSE); |
| 346 | 4102 } |
| 4103 } | |
| 4104 | |
| 4105 /* | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4106 * 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
|
4107 * Output is dumped in "suggestprof". |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4108 */ |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4109 #if 0 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4110 # define SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4111 proftime_T current; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4112 proftime_T total; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4113 proftime_T times[STATE_FINAL + 1]; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4114 long counts[STATE_FINAL + 1]; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4115 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4116 static void |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4117 prof_init(void) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4118 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4119 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
|
4120 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4121 profile_zero(×[i]); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4122 counts[i] = 0; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4123 } |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4124 profile_start(¤t); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4125 profile_start(&total); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4126 } |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4127 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4128 /* call before changing state */ |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4129 static void |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4130 prof_store(state_T state) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4131 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4132 profile_end(¤t); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4133 profile_add(×[state], ¤t); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4134 ++counts[state]; |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4135 profile_start(¤t); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4136 } |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4137 # 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
|
4138 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4139 static void |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4140 prof_report(char *name) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4141 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4142 FILE *fd = fopen("suggestprof", "a"); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4143 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4144 profile_end(&total); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4145 fprintf(fd, "-----------------------\n"); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4146 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
|
4147 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
|
4148 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
|
4149 fclose(fd); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4150 } |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4151 #else |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4152 # define PROF_STORE(state) |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4153 #endif |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4154 |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4155 /* |
| 323 | 4156 * Try finding suggestions by adding/removing/swapping letters. |
| 4157 */ | |
| 4158 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4159 suggest_try_change(suginfo_T *su) |
| 323 | 4160 { |
| 4161 char_u fword[MAXWLEN]; /* copy of the bad word, case-folded */ | |
| 625 | 4162 int n; |
| 4163 char_u *p; | |
| 4164 int lpi; | |
| 323 | 4165 langp_T *lp; |
| 4166 | |
| 4167 /* We make a copy of the case-folded bad word, so that we can modify it | |
| 346 | 4168 * to find matches (esp. REP items). Append some more text, changing |
| 4169 * chars after the bad word may help. */ | |
| 323 | 4170 STRCPY(fword, su->su_fbadword); |
| 835 | 4171 n = (int)STRLEN(fword); |
| 346 | 4172 p = su->su_badptr + su->su_badlen; |
| 835 | 4173 (void)spell_casefold(p, (int)STRLEN(p), fword + n, MAXWLEN - n); |
| 323 | 4174 |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4175 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
|
4176 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4177 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 482 | 4178 |
| 500 | 4179 /* If reloading a spell file fails it's still in the list but |
| 4180 * everything has been cleared. */ | |
| 625 | 4181 if (lp->lp_slang->sl_fbyts == NULL) |
| 500 | 4182 continue; |
| 4183 | |
| 625 | 4184 /* 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
|
4185 #ifdef SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4186 prof_init(); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4187 #endif |
| 625 | 4188 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
|
4189 #ifdef SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4190 prof_report("try_change"); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4191 #endif |
| 625 | 4192 } |
| 4193 } | |
| 4194 | |
| 4195 /* Check the maximum score, if we go over it we won't try this change. */ | |
| 4196 #define TRY_DEEPER(su, stack, depth, add) \ | |
| 4197 (stack[depth].ts_score + (add) < su->su_maxscore) | |
| 4198 | |
| 4199 /* | |
| 4200 * Try finding suggestions by adding/removing/swapping letters. | |
| 4201 * | |
| 4202 * This uses a state machine. At each node in the tree we try various | |
| 4203 * operations. When trying if an operation works "depth" is increased and the | |
| 4204 * stack[] is used to store info. This allows combinations, thus insert one | |
| 4205 * character, replace one and delete another. The number of changes is | |
| 4206 * limited by su->su_maxscore. | |
| 4207 * | |
| 4208 * After implementing this I noticed an article by Kemal Oflazer that | |
| 4209 * describes something similar: "Error-tolerant Finite State Recognition with | |
| 4210 * Applications to Morphological Analysis and Spelling Correction" (1996). | |
| 4211 * The implementation in the article is simplified and requires a stack of | |
| 4212 * unknown depth. The implementation here only needs a stack depth equal to | |
| 4213 * the length of the word. | |
| 4214 * | |
| 4215 * This is also used for the sound-folded word, "soundfold" is TRUE then. | |
| 4216 * The mechanism is the same, but we find a match with a sound-folded word | |
| 4217 * that comes from one or more original words. Each of these words may be | |
| 4218 * added, this is done by add_sound_suggest(). | |
| 4219 * Don't use: | |
| 4220 * the prefix tree or the keep-case tree | |
| 4221 * "su->su_badlen" | |
| 4222 * anything to do with upper and lower case | |
| 4223 * anything to do with word or non-word characters ("spell_iswordp()") | |
| 4224 * banned words | |
| 4225 * word flags (rare, region, compounding) | |
| 4226 * word splitting for now | |
| 4227 * "similar_chars()" | |
| 4228 * use "slang->sl_repsal" instead of "lp->lp_replang->sl_rep" | |
| 4229 */ | |
| 4230 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4231 suggest_trie_walk( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4232 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4233 langp_T *lp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4234 char_u *fword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
4235 int soundfold) |
| 625 | 4236 { |
| 4237 char_u tword[MAXWLEN]; /* good word collected so far */ | |
| 4238 trystate_T stack[MAXWLEN]; | |
| 4239 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
|
4240 * concatenation of prefix compound |
| 625 | 4241 * words and split word. NUL terminated |
| 4242 * when going deeper but not when coming | |
| 4243 * back. */ | |
| 4244 char_u compflags[MAXWLEN]; /* compound flags, one for each word */ | |
| 4245 trystate_T *sp; | |
| 4246 int newscore; | |
| 4247 int score; | |
| 4248 char_u *byts, *fbyts, *pbyts; | |
| 4249 idx_T *idxs, *fidxs, *pidxs; | |
| 4250 int depth; | |
| 4251 int c, c2, c3; | |
| 4252 int n = 0; | |
| 4253 int flags; | |
| 4254 garray_T *gap; | |
| 4255 idx_T arridx; | |
| 4256 int len; | |
| 4257 char_u *p; | |
| 4258 fromto_T *ftp; | |
| 4259 int fl = 0, tl; | |
| 4260 int repextra = 0; /* extra bytes in fword[] from REP item */ | |
| 4261 slang_T *slang = lp->lp_slang; | |
| 4262 int fword_ends; | |
| 4263 int goodword_ends; | |
| 4264 #ifdef DEBUG_TRIEWALK | |
| 4265 /* Stores the name of the change made at each level. */ | |
| 4266 char_u changename[MAXWLEN][80]; | |
| 4267 #endif | |
| 4268 int breakcheckcount = 1000; | |
| 4269 int compound_ok; | |
| 4270 | |
| 4271 /* | |
| 4272 * Go through the whole case-fold tree, try changes at each node. | |
| 4273 * "tword[]" contains the word collected from nodes in the tree. | |
| 4274 * "fword[]" the word we are trying to match with (initially the bad | |
| 4275 * word). | |
| 4276 */ | |
| 4277 depth = 0; | |
| 4278 sp = &stack[0]; | |
| 4279 vim_memset(sp, 0, sizeof(trystate_T)); | |
| 4280 sp->ts_curi = 1; | |
| 4281 | |
| 4282 if (soundfold) | |
| 4283 { | |
| 4284 /* Going through the soundfold tree. */ | |
| 4285 byts = fbyts = slang->sl_sbyts; | |
| 4286 idxs = fidxs = slang->sl_sidxs; | |
| 4287 pbyts = NULL; | |
| 4288 pidxs = NULL; | |
| 4289 sp->ts_prefixdepth = PFD_NOPREFIX; | |
| 4290 sp->ts_state = STATE_START; | |
| 4291 } | |
| 4292 else | |
| 4293 { | |
| 330 | 4294 /* |
| 375 | 4295 * When there are postponed prefixes we need to use these first. At |
| 4296 * the end of the prefix we continue in the case-fold tree. | |
| 4297 */ | |
| 482 | 4298 fbyts = slang->sl_fbyts; |
| 4299 fidxs = slang->sl_fidxs; | |
| 4300 pbyts = slang->sl_pbyts; | |
| 4301 pidxs = slang->sl_pidxs; | |
| 375 | 4302 if (pbyts != NULL) |
| 4303 { | |
| 4304 byts = pbyts; | |
| 4305 idxs = pidxs; | |
| 482 | 4306 sp->ts_prefixdepth = PFD_PREFIXTREE; |
| 375 | 4307 sp->ts_state = STATE_NOPREFIX; /* try without prefix first */ |
| 4308 } | |
| 4309 else | |
| 4310 { | |
| 4311 byts = fbyts; | |
| 4312 idxs = fidxs; | |
| 482 | 4313 sp->ts_prefixdepth = PFD_NOPREFIX; |
| 485 | 4314 sp->ts_state = STATE_START; |
| 375 | 4315 } |
| 625 | 4316 } |
| 4317 | |
| 4318 /* | |
| 4319 * Loop to find all suggestions. At each round we either: | |
| 4320 * - For the current state try one operation, advance "ts_curi", | |
| 4321 * increase "depth". | |
| 4322 * - When a state is done go to the next, set "ts_state". | |
| 4323 * - When all states are tried decrease "depth". | |
| 4324 */ | |
| 4325 while (depth >= 0 && !got_int) | |
| 4326 { | |
| 4327 sp = &stack[depth]; | |
| 4328 switch (sp->ts_state) | |
| 4329 { | |
| 4330 case STATE_START: | |
| 4331 case STATE_NOPREFIX: | |
| 4332 /* | |
| 4333 * Start of node: Deal with NUL bytes, which means | |
| 4334 * tword[] may end here. | |
| 4335 */ | |
| 4336 arridx = sp->ts_arridx; /* current node in the tree */ | |
| 4337 len = byts[arridx]; /* bytes in this node */ | |
| 4338 arridx += sp->ts_curi; /* index of current byte */ | |
| 4339 | |
| 4340 if (sp->ts_prefixdepth == PFD_PREFIXTREE) | |
| 4341 { | |
| 4342 /* Skip over the NUL bytes, we use them later. */ | |
| 4343 for (n = 0; n < len && byts[arridx + n] == 0; ++n) | |
| 4344 ; | |
| 4345 sp->ts_curi += n; | |
| 4346 | |
| 4347 /* Always past NUL bytes now. */ | |
| 4348 n = (int)sp->ts_state; | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4349 PROF_STORE(sp->ts_state) |
| 625 | 4350 sp->ts_state = STATE_ENDNUL; |
| 4351 sp->ts_save_badflags = su->su_badflags; | |
| 4352 | |
| 4353 /* At end of a prefix or at start of prefixtree: check for | |
| 4354 * following word. */ | |
| 4355 if (byts[arridx] == 0 || n == (int)STATE_NOPREFIX) | |
| 4356 { | |
| 4357 /* Set su->su_badflags to the caps type at this position. | |
| 4358 * Use the caps type until here for the prefix itself. */ | |
| 4359 if (has_mbyte) | |
| 4360 n = nofold_len(fword, sp->ts_fidx, su->su_badptr); | |
| 4361 else | |
| 4362 n = sp->ts_fidx; | |
| 4363 flags = badword_captype(su->su_badptr, su->su_badptr + n); | |
| 4364 su->su_badflags = badword_captype(su->su_badptr + n, | |
| 455 | 4365 su->su_badptr + su->su_badlen); |
| 625 | 4366 #ifdef DEBUG_TRIEWALK |
| 4367 sprintf(changename[depth], "prefix"); | |
| 4368 #endif | |
| 4369 go_deeper(stack, depth, 0); | |
| 4370 ++depth; | |
| 4371 sp = &stack[depth]; | |
| 4372 sp->ts_prefixdepth = depth - 1; | |
| 4373 byts = fbyts; | |
| 4374 idxs = fidxs; | |
| 4375 sp->ts_arridx = 0; | |
| 4376 | |
| 4377 /* Move the prefix to preword[] with the right case | |
| 4378 * and make find_keepcap_word() works. */ | |
| 4379 tword[sp->ts_twordlen] = NUL; | |
| 4380 make_case_word(tword + sp->ts_splitoff, | |
| 4381 preword + sp->ts_prewordlen, flags); | |
| 835 | 4382 sp->ts_prewordlen = (char_u)STRLEN(preword); |
| 625 | 4383 sp->ts_splitoff = sp->ts_twordlen; |
| 4384 } | |
| 4385 break; | |
| 4386 } | |
| 4387 | |
| 4388 if (sp->ts_curi > len || byts[arridx] != 0) | |
| 4389 { | |
| 4390 /* 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
|
4391 PROF_STORE(sp->ts_state) |
| 625 | 4392 sp->ts_state = STATE_ENDNUL; |
| 4393 sp->ts_save_badflags = su->su_badflags; | |
| 4394 break; | |
| 4395 } | |
| 4396 | |
| 4397 /* | |
| 4398 * End of word in tree. | |
| 4399 */ | |
| 4400 ++sp->ts_curi; /* eat one NUL byte */ | |
| 4401 | |
| 4402 flags = (int)idxs[arridx]; | |
| 698 | 4403 |
| 4404 /* Skip words with the NOSUGGEST flag. */ | |
| 4405 if (flags & WF_NOSUGGEST) | |
| 4406 break; | |
| 4407 | |
| 625 | 4408 fword_ends = (fword[sp->ts_fidx] == NUL |
| 4409 || (soundfold | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
4410 ? VIM_ISWHITE(fword[sp->ts_fidx]) |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4411 : !spell_iswordp(fword + sp->ts_fidx, curwin))); |
| 625 | 4412 tword[sp->ts_twordlen] = NUL; |
| 4413 | |
| 4414 if (sp->ts_prefixdepth <= PFD_NOTSPECIAL | |
| 485 | 4415 && (sp->ts_flags & TSF_PREFIXOK) == 0) |
| 625 | 4416 { |
| 4417 /* There was a prefix before the word. Check that the prefix | |
| 4418 * can be used with this word. */ | |
| 4419 /* Count the length of the NULs in the prefix. If there are | |
| 4420 * none this must be the first try without a prefix. */ | |
| 4421 n = stack[sp->ts_prefixdepth].ts_arridx; | |
| 4422 len = pbyts[n++]; | |
| 4423 for (c = 0; c < len && pbyts[n + c] == 0; ++c) | |
| 4424 ; | |
| 4425 if (c > 0) | |
| 4426 { | |
| 4427 c = valid_word_prefix(c, n, flags, | |
| 483 | 4428 tword + sp->ts_splitoff, slang, FALSE); |
| 625 | 4429 if (c == 0) |
| 4430 break; | |
| 4431 | |
| 4432 /* Use the WF_RARE flag for a rare prefix. */ | |
| 4433 if (c & WF_RAREPFX) | |
| 4434 flags |= WF_RARE; | |
| 4435 | |
| 4436 /* Tricky: when checking for both prefix and compounding | |
| 4437 * we run into the prefix flag first. | |
| 4438 * Remember that it's OK, so that we accept the prefix | |
| 4439 * when arriving at a compound flag. */ | |
| 4440 sp->ts_flags |= TSF_PREFIXOK; | |
| 4441 } | |
| 4442 } | |
| 4443 | |
| 4444 /* Check NEEDCOMPOUND: can't use word without compounding. Do try | |
| 4445 * appending another compound word below. */ | |
| 4446 if (sp->ts_complen == sp->ts_compsplit && fword_ends | |
| 500 | 4447 && (flags & WF_NEEDCOMP)) |
| 625 | 4448 goodword_ends = FALSE; |
| 4449 else | |
| 4450 goodword_ends = TRUE; | |
| 4451 | |
| 4452 p = NULL; | |
| 4453 compound_ok = TRUE; | |
| 4454 if (sp->ts_complen > sp->ts_compsplit) | |
| 4455 { | |
| 4456 if (slang->sl_nobreak) | |
| 4457 { | |
| 4458 /* There was a word before this word. When there was no | |
| 4459 * change in this word (it was correct) add the first word | |
| 4460 * as a suggestion. If this word was corrected too, we | |
| 4461 * need to check if a correct word follows. */ | |
| 4462 if (sp->ts_fidx - sp->ts_splitfidx | |
| 4463 == sp->ts_twordlen - sp->ts_splitoff | |
| 4464 && STRNCMP(fword + sp->ts_splitfidx, | |
| 4465 tword + sp->ts_splitoff, | |
| 4466 sp->ts_fidx - sp->ts_splitfidx) == 0) | |
| 492 | 4467 { |
| 625 | 4468 preword[sp->ts_prewordlen] = NUL; |
| 4469 newscore = score_wordcount_adj(slang, sp->ts_score, | |
| 4470 preword + sp->ts_prewordlen, | |
| 4471 sp->ts_prewordlen > 0); | |
| 4472 /* Add the suggestion if the score isn't too bad. */ | |
| 4473 if (newscore <= su->su_maxscore) | |
| 492 | 4474 add_suggestion(su, &su->su_ga, preword, |
| 503 | 4475 sp->ts_splitfidx - repextra, |
| 625 | 4476 newscore, 0, FALSE, |
| 4477 lp->lp_sallang, FALSE); | |
| 4478 break; | |
| 492 | 4479 } |
| 490 | 4480 } |
| 4481 else | |
| 625 | 4482 { |
| 4483 /* There was a compound word before this word. If this | |
| 4484 * word does not support compounding then give up | |
| 4485 * (splitting is tried for the word without compound | |
| 4486 * flag). */ | |
| 4487 if (((unsigned)flags >> 24) == 0 | |
| 4488 || sp->ts_twordlen - sp->ts_splitoff | |
| 4489 < slang->sl_compminlen) | |
| 4490 break; | |
| 4491 /* For multi-byte chars check character length against | |
| 4492 * COMPOUNDMIN. */ | |
| 4493 if (has_mbyte | |
| 4494 && slang->sl_compminlen > 0 | |
| 4495 && mb_charlen(tword + sp->ts_splitoff) | |
| 4496 < slang->sl_compminlen) | |
| 4497 break; | |
| 4498 | |
| 4499 compflags[sp->ts_complen] = ((unsigned)flags >> 24); | |
| 4500 compflags[sp->ts_complen + 1] = NUL; | |
| 4501 vim_strncpy(preword + sp->ts_prewordlen, | |
| 4502 tword + sp->ts_splitoff, | |
| 4503 sp->ts_twordlen - sp->ts_splitoff); | |
| 1762 | 4504 |
| 4505 /* Verify CHECKCOMPOUNDPATTERN rules. */ | |
| 4506 if (match_checkcompoundpattern(preword, sp->ts_prewordlen, | |
| 4507 &slang->sl_comppat)) | |
| 4508 compound_ok = FALSE; | |
| 4509 | |
| 4510 if (compound_ok) | |
| 4511 { | |
| 4512 p = preword; | |
| 4513 while (*skiptowhite(p) != NUL) | |
| 4514 p = skipwhite(skiptowhite(p)); | |
| 4515 if (fword_ends && !can_compound(slang, p, | |
| 625 | 4516 compflags + sp->ts_compsplit)) |
| 1762 | 4517 /* Compound is not allowed. But it may still be |
| 4518 * possible if we add another (short) word. */ | |
| 4519 compound_ok = FALSE; | |
| 4520 } | |
| 625 | 4521 |
| 4522 /* Get pointer to last char of previous word. */ | |
| 4523 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
|
4524 MB_PTR_BACK(preword, p); |
| 625 | 4525 } |
| 4526 } | |
| 4527 | |
| 4528 /* | |
| 4529 * Form the word with proper case in preword. | |
| 4530 * If there is a word from a previous split, append. | |
| 4531 * For the soundfold tree don't change the case, simply append. | |
| 4532 */ | |
| 4533 if (soundfold) | |
| 4534 STRCPY(preword + sp->ts_prewordlen, tword + sp->ts_splitoff); | |
| 4535 else if (flags & WF_KEEPCAP) | |
| 4536 /* Must find the word in the keep-case tree. */ | |
| 4537 find_keepcap_word(slang, tword + sp->ts_splitoff, | |
| 483 | 4538 preword + sp->ts_prewordlen); |
| 625 | 4539 else |
| 4540 { | |
| 4541 /* Include badflags: If the badword is onecap or allcap | |
| 4542 * use that for the goodword too. But if the badword is | |
| 4543 * allcap and it's only one char long use onecap. */ | |
| 4544 c = su->su_badflags; | |
| 4545 if ((c & WF_ALLCAP) | |
|
15605
62b3805506b3
patch 8.1.0810: too many #ifdefs
Bram Moolenaar <Bram@vim.org>
parents:
15543
diff
changeset
|
4546 && su->su_badlen == (*mb_ptr2len)(su->su_badptr)) |
| 625 | 4547 c = WF_ONECAP; |
| 4548 c |= flags; | |
| 4549 | |
| 4550 /* When appending a compound word after a word character don't | |
| 4551 * use Onecap. */ | |
| 5477 | 4552 if (p != NULL && spell_iswordp_nmw(p, curwin)) |
| 625 | 4553 c &= ~WF_ONECAP; |
| 4554 make_case_word(tword + sp->ts_splitoff, | |
| 490 | 4555 preword + sp->ts_prewordlen, c); |
| 625 | 4556 } |
| 4557 | |
| 4558 if (!soundfold) | |
| 4559 { | |
| 323 | 4560 /* Don't use a banned word. It may appear again as a good |
| 4561 * word, thus remember it. */ | |
| 4562 if (flags & WF_BANNED) | |
| 4563 { | |
| 483 | 4564 add_banned(su, preword + sp->ts_prewordlen); |
| 323 | 4565 break; |
| 4566 } | |
| 534 | 4567 if ((sp->ts_complen == sp->ts_compsplit |
| 625 | 4568 && WAS_BANNED(su, preword + sp->ts_prewordlen)) |
| 4569 || WAS_BANNED(su, preword)) | |
| 534 | 4570 { |
| 4571 if (slang->sl_compprog == NULL) | |
| 4572 break; | |
| 4573 /* the word so far was banned but we may try compounding */ | |
| 4574 goodword_ends = FALSE; | |
| 4575 } | |
| 625 | 4576 } |
| 4577 | |
| 4578 newscore = 0; | |
| 4579 if (!soundfold) /* soundfold words don't have flags */ | |
| 4580 { | |
| 323 | 4581 if ((flags & WF_REGION) |
| 390 | 4582 && (((unsigned)flags >> 16) & lp->lp_region) == 0) |
| 323 | 4583 newscore += SCORE_REGION; |
| 4584 if (flags & WF_RARE) | |
| 4585 newscore += SCORE_RARE; | |
| 4586 | |
| 346 | 4587 if (!spell_valid_case(su->su_badflags, |
| 483 | 4588 captype(preword + sp->ts_prewordlen, NULL))) |
| 323 | 4589 newscore += SCORE_ICASE; |
| 625 | 4590 } |
| 4591 | |
| 4592 /* TODO: how about splitting in the soundfold tree? */ | |
| 4593 if (fword_ends | |
| 4594 && goodword_ends | |
| 4595 && sp->ts_fidx >= sp->ts_fidxtry | |
| 4596 && compound_ok) | |
| 4597 { | |
| 4598 /* The badword also ends: add suggestions. */ | |
| 4599 #ifdef DEBUG_TRIEWALK | |
| 4600 if (soundfold && STRCMP(preword, "smwrd") == 0) | |
| 4601 { | |
| 4602 int j; | |
| 4603 | |
| 4604 /* print the stack of changes that brought us here */ | |
| 4605 smsg("------ %s -------", fword); | |
| 4606 for (j = 0; j < depth; ++j) | |
| 4607 smsg("%s", changename[j]); | |
| 4608 } | |
| 4609 #endif | |
| 4610 if (soundfold) | |
| 4611 { | |
| 4612 /* For soundfolded words we need to find the original | |
| 1188 | 4613 * words, the edit distance and then add them. */ |
| 625 | 4614 add_sound_suggest(su, preword, sp->ts_score, lp); |
| 4615 } | |
|
2457
6c1d10a85398
Avoid illegal memory access in spell suggestion. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2455
diff
changeset
|
4616 else if (sp->ts_fidx > 0) |
| 625 | 4617 { |
| 4618 /* Give a penalty when changing non-word char to word | |
| 4619 * char, e.g., "thes," -> "these". */ | |
| 366 | 4620 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
|
4621 MB_PTR_BACK(fword, p); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4622 if (!spell_iswordp(p, curwin)) |
| 366 | 4623 { |
| 4624 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
|
4625 MB_PTR_BACK(preword, p); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
4626 if (spell_iswordp(p, curwin)) |
| 366 | 4627 newscore += SCORE_NONWORD; |
| 4628 } | |
| 4629 | |
| 625 | 4630 /* Give a bonus to words seen before. */ |
| 4631 score = score_wordcount_adj(slang, | |
| 4632 sp->ts_score + newscore, | |
| 4633 preword + sp->ts_prewordlen, | |
| 4634 sp->ts_prewordlen > 0); | |
| 4635 | |
| 4636 /* Add the suggestion if the score isn't too bad. */ | |
| 4637 if (score <= su->su_maxscore) | |
| 633 | 4638 { |
| 625 | 4639 add_suggestion(su, &su->su_ga, preword, |
| 4640 sp->ts_fidx - repextra, | |
| 4641 score, 0, FALSE, lp->lp_sallang, FALSE); | |
| 633 | 4642 |
| 4643 if (su->su_badflags & WF_MIXCAP) | |
| 4644 { | |
| 4645 /* We really don't know if the word should be | |
| 4646 * upper or lower case, add both. */ | |
| 4647 c = captype(preword, NULL); | |
| 4648 if (c == 0 || c == WF_ALLCAP) | |
| 4649 { | |
| 4650 make_case_word(tword + sp->ts_splitoff, | |
| 4651 preword + sp->ts_prewordlen, | |
| 4652 c == 0 ? WF_ALLCAP : 0); | |
| 4653 | |
| 4654 add_suggestion(su, &su->su_ga, preword, | |
| 4655 sp->ts_fidx - repextra, | |
| 4656 score + SCORE_ICASE, 0, FALSE, | |
| 4657 lp->lp_sallang, FALSE); | |
| 4658 } | |
| 4659 } | |
| 4660 } | |
| 625 | 4661 } |
| 4662 } | |
| 4663 | |
| 4664 /* | |
| 4665 * Try word split and/or compounding. | |
| 4666 */ | |
| 4667 if ((sp->ts_fidx >= sp->ts_fidxtry || fword_ends) | |
| 4668 /* Don't split halfway a character. */ | |
|
15605
62b3805506b3
patch 8.1.0810: too many #ifdefs
Bram Moolenaar <Bram@vim.org>
parents:
15543
diff
changeset
|
4669 && (!has_mbyte || sp->ts_tcharlen == 0)) |
| 625 | 4670 { |
| 4671 int try_compound; | |
| 4672 int try_split; | |
| 4673 | |
| 4674 /* If past the end of the bad word don't try a split. | |
| 4675 * Otherwise try changing the next word. E.g., find | |
| 4676 * suggestions for "the the" where the second "the" is | |
| 4677 * different. It's done like a split. | |
| 4678 * TODO: word split for soundfold words */ | |
| 4679 try_split = (sp->ts_fidx - repextra < su->su_badlen) | |
| 4680 && !soundfold; | |
| 4681 | |
| 4682 /* Get here in several situations: | |
| 4683 * 1. The word in the tree ends: | |
| 4684 * If the word allows compounding try that. Otherwise try | |
| 4685 * a split by inserting a space. For both check that a | |
| 4686 * valid words starts at fword[sp->ts_fidx]. | |
| 4687 * For NOBREAK do like compounding to be able to check if | |
| 4688 * the next word is valid. | |
| 4689 * 2. The badword does end, but it was due to a change (e.g., | |
| 4690 * a swap). No need to split, but do check that the | |
| 4691 * following word is valid. | |
| 4692 * 3. The badword and the word in the tree end. It may still | |
| 4693 * be possible to compound another (short) word. | |
| 4694 */ | |
| 4695 try_compound = FALSE; | |
| 4696 if (!soundfold | |
|
7526
08c1f73efcde
commit https://github.com/vim/vim/commit/7b877b360532713dc21a0ff3d55a76ac02eaf573
Christian Brabandt <cb@256bit.org>
parents:
7509
diff
changeset
|
4697 && !slang->sl_nocompoundsugs |
| 625 | 4698 && slang->sl_compprog != NULL |
| 4699 && ((unsigned)flags >> 24) != 0 | |
| 4700 && sp->ts_twordlen - sp->ts_splitoff | |
| 4701 >= slang->sl_compminlen | |
| 4702 && (!has_mbyte | |
| 4703 || slang->sl_compminlen == 0 | |
| 4704 || mb_charlen(tword + sp->ts_splitoff) | |
| 4705 >= slang->sl_compminlen) | |
| 4706 && (slang->sl_compsylmax < MAXWLEN | |
| 4707 || sp->ts_complen + 1 - sp->ts_compsplit | |
| 4708 < slang->sl_compmax) | |
| 1762 | 4709 && (can_be_compound(sp, slang, |
| 4710 compflags, ((unsigned)flags >> 24)))) | |
| 4711 | |
| 625 | 4712 { |
| 4713 try_compound = TRUE; | |
| 4714 compflags[sp->ts_complen] = ((unsigned)flags >> 24); | |
| 4715 compflags[sp->ts_complen + 1] = NUL; | |
| 4716 } | |
| 4717 | |
| 4718 /* For NOBREAK we never try splitting, it won't make any word | |
| 4719 * valid. */ | |
|
7526
08c1f73efcde
commit https://github.com/vim/vim/commit/7b877b360532713dc21a0ff3d55a76ac02eaf573
Christian Brabandt <cb@256bit.org>
parents:
7509
diff
changeset
|
4720 if (slang->sl_nobreak && !slang->sl_nocompoundsugs) |
| 625 | 4721 try_compound = TRUE; |
| 4722 | |
| 4723 /* If we could add a compound word, and it's also possible to | |
| 4724 * split at this point, do the split first and set | |
| 4725 * TSF_DIDSPLIT to avoid doing it again. */ | |
| 4726 else if (!fword_ends | |
| 4727 && try_compound | |
| 4728 && (sp->ts_flags & TSF_DIDSPLIT) == 0) | |
| 4729 { | |
| 485 | 4730 try_compound = FALSE; |
| 625 | 4731 sp->ts_flags |= TSF_DIDSPLIT; |
| 4732 --sp->ts_curi; /* do the same NUL again */ | |
| 4733 compflags[sp->ts_complen] = NUL; | |
| 4734 } | |
| 4735 else | |
| 4736 sp->ts_flags &= ~TSF_DIDSPLIT; | |
| 4737 | |
| 4738 if (try_split || try_compound) | |
| 4739 { | |
| 534 | 4740 if (!try_compound && (!fword_ends || !goodword_ends)) |
| 485 | 4741 { |
| 4742 /* If we're going to split need to check that the | |
| 501 | 4743 * words so far are valid for compounding. If there |
| 4744 * is only one word it must not have the NEEDCOMPOUND | |
| 4745 * flag. */ | |
| 4746 if (sp->ts_complen == sp->ts_compsplit | |
| 4747 && (flags & WF_NEEDCOMP)) | |
| 4748 break; | |
| 490 | 4749 p = preword; |
| 4750 while (*skiptowhite(p) != NUL) | |
| 4751 p = skipwhite(skiptowhite(p)); | |
| 485 | 4752 if (sp->ts_complen > sp->ts_compsplit |
| 490 | 4753 && !can_compound(slang, p, |
| 485 | 4754 compflags + sp->ts_compsplit)) |
| 4755 break; | |
| 698 | 4756 |
| 4757 if (slang->sl_nosplitsugs) | |
| 4758 newscore += SCORE_SPLIT_NO; | |
| 4759 else | |
| 4760 newscore += SCORE_SPLIT; | |
| 625 | 4761 |
| 4762 /* Give a bonus to words seen before. */ | |
| 4763 newscore = score_wordcount_adj(slang, newscore, | |
| 4764 preword + sp->ts_prewordlen, TRUE); | |
| 482 | 4765 } |
| 4766 | |
| 625 | 4767 if (TRY_DEEPER(su, stack, depth, newscore)) |
| 323 | 4768 { |
| 625 | 4769 go_deeper(stack, depth, newscore); |
| 4770 #ifdef DEBUG_TRIEWALK | |
| 4771 if (!try_compound && !fword_ends) | |
| 4772 sprintf(changename[depth], "%.*s-%s: split", | |
| 4773 sp->ts_twordlen, tword, fword + sp->ts_fidx); | |
| 4774 else | |
| 4775 sprintf(changename[depth], "%.*s-%s: compound", | |
| 4776 sp->ts_twordlen, tword, fword + sp->ts_fidx); | |
| 4777 #endif | |
| 323 | 4778 /* Save things to be restored at STATE_SPLITUNDO. */ |
| 346 | 4779 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
|
4780 PROF_STORE(sp->ts_state) |
| 376 | 4781 sp->ts_state = STATE_SPLITUNDO; |
| 4782 | |
| 4783 ++depth; | |
| 4784 sp = &stack[depth]; | |
| 323 | 4785 |
| 482 | 4786 /* Append a space to preword when splitting. */ |
| 4787 if (!try_compound && !fword_ends) | |
| 4788 STRCAT(preword, " "); | |
| 835 | 4789 sp->ts_prewordlen = (char_u)STRLEN(preword); |
| 483 | 4790 sp->ts_splitoff = sp->ts_twordlen; |
| 492 | 4791 sp->ts_splitfidx = sp->ts_fidx; |
| 376 | 4792 |
| 4793 /* If the badword has a non-word character at this | |
| 4794 * position skip it. That means replacing the | |
| 482 | 4795 * non-word character with a space. Always skip a |
| 534 | 4796 * character when the word ends. But only when the |
| 4797 * good word can end. */ | |
| 625 | 4798 if (((!try_compound && !spell_iswordp_nmw(fword |
| 5477 | 4799 + sp->ts_fidx, |
| 4800 curwin)) | |
| 625 | 4801 || fword_ends) |
| 4802 && fword[sp->ts_fidx] != NUL | |
| 4803 && goodword_ends) | |
| 376 | 4804 { |
| 482 | 4805 int l; |
| 4806 | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
4807 l = MB_PTR2LEN(fword + sp->ts_fidx); |
| 482 | 4808 if (fword_ends) |
| 4809 { | |
| 4810 /* Copy the skipped character to preword. */ | |
| 483 | 4811 mch_memmove(preword + sp->ts_prewordlen, |
| 482 | 4812 fword + sp->ts_fidx, l); |
| 483 | 4813 sp->ts_prewordlen += l; |
| 4814 preword[sp->ts_prewordlen] = NUL; | |
| 482 | 4815 } |
| 4816 else | |
| 4817 sp->ts_score -= SCORE_SPLIT - SCORE_SUBST; | |
| 4818 sp->ts_fidx += l; | |
| 376 | 4819 } |
| 455 | 4820 |
| 485 | 4821 /* When compounding include compound flag in |
| 4822 * compflags[] (already set above). When splitting we | |
| 4823 * may start compounding over again. */ | |
| 482 | 4824 if (try_compound) |
| 483 | 4825 ++sp->ts_complen; |
| 482 | 4826 else |
| 485 | 4827 sp->ts_compsplit = sp->ts_complen; |
| 4828 sp->ts_prefixdepth = PFD_NOPREFIX; | |
| 482 | 4829 |
| 455 | 4830 /* set su->su_badflags to the caps type at this |
| 4831 * position */ | |
| 324 | 4832 if (has_mbyte) |
| 455 | 4833 n = nofold_len(fword, sp->ts_fidx, su->su_badptr); |
| 324 | 4834 else |
| 455 | 4835 n = sp->ts_fidx; |
| 474 | 4836 su->su_badflags = badword_captype(su->su_badptr + n, |
| 455 | 4837 su->su_badptr + su->su_badlen); |
| 323 | 4838 |
| 4839 /* Restart at top of the tree. */ | |
| 376 | 4840 sp->ts_arridx = 0; |
| 485 | 4841 |
| 4842 /* If there are postponed prefixes, try these too. */ | |
| 4843 if (pbyts != NULL) | |
| 4844 { | |
| 4845 byts = pbyts; | |
| 4846 idxs = pidxs; | |
| 4847 sp->ts_prefixdepth = PFD_PREFIXTREE; | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4848 PROF_STORE(sp->ts_state) |
| 485 | 4849 sp->ts_state = STATE_NOPREFIX; |
| 4850 } | |
| 323 | 4851 } |
| 4852 } | |
| 625 | 4853 } |
| 4854 break; | |
| 4855 | |
| 4856 case STATE_SPLITUNDO: | |
| 4857 /* Undo the changes done for word split or compound word. */ | |
| 4858 su->su_badflags = sp->ts_save_badflags; | |
| 4859 | |
| 4860 /* Continue looking for NUL bytes. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4861 PROF_STORE(sp->ts_state) |
| 625 | 4862 sp->ts_state = STATE_START; |
| 4863 | |
| 4864 /* In case we went into the prefix tree. */ | |
| 4865 byts = fbyts; | |
| 4866 idxs = fidxs; | |
| 4867 break; | |
| 4868 | |
| 4869 case STATE_ENDNUL: | |
| 4870 /* Past the NUL bytes in the node. */ | |
| 4871 su->su_badflags = sp->ts_save_badflags; | |
|
15605
62b3805506b3
patch 8.1.0810: too many #ifdefs
Bram Moolenaar <Bram@vim.org>
parents:
15543
diff
changeset
|
4872 if (fword[sp->ts_fidx] == NUL && sp->ts_tcharlen == 0) |
| 625 | 4873 { |
| 4874 /* 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
|
4875 PROF_STORE(sp->ts_state) |
| 625 | 4876 sp->ts_state = STATE_DEL; |
| 323 | 4877 break; |
| 625 | 4878 } |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
4879 PROF_STORE(sp->ts_state) |
| 625 | 4880 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
|
4881 /* FALLTHROUGH */ |
| 625 | 4882 |
| 4883 case STATE_PLAIN: | |
| 4884 /* | |
| 4885 * Go over all possible bytes at this node, add each to tword[] | |
| 4886 * and use child node. "ts_curi" is the index. | |
| 4887 */ | |
| 4888 arridx = sp->ts_arridx; | |
| 4889 if (sp->ts_curi > byts[arridx]) | |
| 4890 { | |
| 4891 /* Done all bytes at this node, do next state. When still at | |
| 4892 * 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
|
4893 PROF_STORE(sp->ts_state) |
| 625 | 4894 if (sp->ts_fidx >= sp->ts_fidxtry) |
| 323 | 4895 sp->ts_state = STATE_DEL; |
| 4896 else | |
| 625 | 4897 sp->ts_state = STATE_FINAL; |
| 4898 } | |
| 4899 else | |
| 4900 { | |
| 4901 arridx += sp->ts_curi++; | |
| 4902 c = byts[arridx]; | |
| 4903 | |
| 4904 /* Normal byte, go one level deeper. If it's not equal to the | |
| 4905 * byte in the bad word adjust the score. But don't even try | |
| 4906 * when the byte was already changed. And don't try when we | |
| 5695 | 4907 * just deleted this byte, accepting it is always cheaper than |
| 625 | 4908 * delete + substitute. */ |
| 4909 if (c == fword[sp->ts_fidx] | |
|
15605
62b3805506b3
patch 8.1.0810: too many #ifdefs
Bram Moolenaar <Bram@vim.org>
parents:
15543
diff
changeset
|
4910 || (sp->ts_tcharlen > 0 && sp->ts_isdiff != DIFF_NONE)) |
| 625 | 4911 newscore = 0; |
| 4912 else | |
| 4913 newscore = SCORE_SUBST; | |
| 4914 if ((newscore == 0 | |
| 4915 || (sp->ts_fidx >= sp->ts_fidxtry | |
| 4916 && ((sp->ts_flags & TSF_DIDDEL) == 0 | |
| 4917 || c != fword[sp->ts_delidx]))) | |
| 4918 && TRY_DEEPER(su, stack, depth, newscore)) | |
| 4919 { | |
| 4920 go_deeper(stack, depth, newscore); | |
| 4921 #ifdef DEBUG_TRIEWALK | |
| 4922 if (newscore > 0) | |
| 4923 sprintf(changename[depth], "%.*s-%s: subst %c to %c", | |
| 4924 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 4925 fword[sp->ts_fidx], c); | |
| 323 | 4926 else |
| 625 | 4927 sprintf(changename[depth], "%.*s-%s: accept %c", |
| 4928 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 4929 fword[sp->ts_fidx]); | |
| 4930 #endif | |
| 323 | 4931 ++depth; |
| 625 | 4932 sp = &stack[depth]; |
| 4933 ++sp->ts_fidx; | |
| 4934 tword[sp->ts_twordlen++] = c; | |
| 4935 sp->ts_arridx = idxs[arridx]; | |
| 4936 if (newscore == SCORE_SUBST) | |
| 4937 sp->ts_isdiff = DIFF_YES; | |
| 330 | 4938 if (has_mbyte) |
| 358 | 4939 { |
| 625 | 4940 /* Multi-byte characters are a bit complicated to |
| 4941 * handle: They differ when any of the bytes differ | |
| 4942 * and then their length may also differ. */ | |
| 4943 if (sp->ts_tcharlen == 0) | |
| 4944 { | |
| 4945 /* First byte. */ | |
| 4946 sp->ts_tcharidx = 0; | |
| 4947 sp->ts_tcharlen = MB_BYTE2LEN(c); | |
| 4948 sp->ts_fcharstart = sp->ts_fidx - 1; | |
| 4949 sp->ts_isdiff = (newscore != 0) | |
| 4950 ? DIFF_YES : DIFF_NONE; | |
| 4951 } | |
| 4952 else if (sp->ts_isdiff == DIFF_INSERT) | |
| 4953 /* When inserting trail bytes don't advance in the | |
| 4954 * bad word. */ | |
| 4955 --sp->ts_fidx; | |
| 4956 if (++sp->ts_tcharidx == sp->ts_tcharlen) | |
| 4957 { | |
| 4958 /* Last byte of character. */ | |
| 4959 if (sp->ts_isdiff == DIFF_YES) | |
| 4960 { | |
| 4961 /* Correct ts_fidx for the byte length of the | |
| 4962 * character (we didn't check that before). */ | |
| 4963 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
|
4964 + MB_PTR2LEN( |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
4965 fword + sp->ts_fcharstart); |
| 625 | 4966 /* For changing a composing character adjust |
| 4967 * the score from SCORE_SUBST to | |
| 4968 * SCORE_SUBCOMP. */ | |
| 4969 if (enc_utf8 | |
| 4970 && 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
|
4971 utf_ptr2char(tword |
| 625 | 4972 + sp->ts_twordlen |
| 4973 - sp->ts_tcharlen)) | |
| 4974 && 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
|
4975 utf_ptr2char(fword |
| 625 | 4976 + sp->ts_fcharstart))) |
| 4977 sp->ts_score -= | |
| 4978 SCORE_SUBST - SCORE_SUBCOMP; | |
| 4979 | |
| 4980 /* For a similar character adjust score from | |
| 4981 * SCORE_SUBST to SCORE_SIMILAR. */ | |
| 4982 else if (!soundfold | |
| 4983 && slang->sl_has_map | |
| 4984 && similar_chars(slang, | |
| 4985 mb_ptr2char(tword | |
| 4986 + sp->ts_twordlen | |
| 4987 - sp->ts_tcharlen), | |
| 4988 mb_ptr2char(fword | |
| 4989 + sp->ts_fcharstart))) | |
| 4990 sp->ts_score -= | |
| 4991 SCORE_SUBST - SCORE_SIMILAR; | |
| 4992 } | |
| 4993 else if (sp->ts_isdiff == DIFF_INSERT | |
| 4994 && sp->ts_twordlen > sp->ts_tcharlen) | |
| 4995 { | |
| 4996 p = tword + sp->ts_twordlen - sp->ts_tcharlen; | |
| 4997 c = mb_ptr2char(p); | |
| 4998 if (enc_utf8 && utf_iscomposing(c)) | |
| 4999 { | |
| 5000 /* Inserting a composing char doesn't | |
| 5001 * count that much. */ | |
| 5002 sp->ts_score -= SCORE_INS - SCORE_INSCOMP; | |
| 5003 } | |
| 5004 else | |
| 5005 { | |
| 5006 /* If the previous character was the same, | |
| 5007 * thus doubling a character, give a bonus | |
| 5008 * to the score. Also for the soundfold | |
| 5009 * tree (might seem illogical but does | |
| 5010 * give better scores). */ | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
5011 MB_PTR_BACK(tword, p); |
| 625 | 5012 if (c == mb_ptr2char(p)) |
| 5013 sp->ts_score -= SCORE_INS | |
| 5014 - SCORE_INSDUP; | |
| 5015 } | |
| 5016 } | |
| 5017 | |
| 5018 /* Starting a new char, reset the length. */ | |
| 5019 sp->ts_tcharlen = 0; | |
| 5020 } | |
| 358 | 5021 } |
| 330 | 5022 else |
| 358 | 5023 { |
| 625 | 5024 /* If we found a similar char adjust the score. |
| 5025 * We do this after calling go_deeper() because | |
| 5026 * it's slow. */ | |
| 5027 if (newscore != 0 | |
| 5028 && !soundfold | |
| 5029 && slang->sl_has_map | |
| 5030 && similar_chars(slang, | |
| 5031 c, fword[sp->ts_fidx - 1])) | |
| 5032 sp->ts_score -= SCORE_SUBST - SCORE_SIMILAR; | |
| 358 | 5033 } |
| 625 | 5034 } |
| 5035 } | |
| 5036 break; | |
| 5037 | |
| 5038 case STATE_DEL: | |
| 5039 /* When past the first byte of a multi-byte char don't try | |
| 5040 * delete/insert/swap a character. */ | |
| 5041 if (has_mbyte && sp->ts_tcharlen > 0) | |
| 5042 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5043 PROF_STORE(sp->ts_state) |
| 625 | 5044 sp->ts_state = STATE_FINAL; |
| 5045 break; | |
| 5046 } | |
| 5047 /* | |
| 5048 * Try skipping one character in the bad word (delete it). | |
| 5049 */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5050 PROF_STORE(sp->ts_state) |
| 625 | 5051 sp->ts_state = STATE_INS_PREP; |
| 5052 sp->ts_curi = 1; | |
| 5053 if (soundfold && sp->ts_fidx == 0 && fword[sp->ts_fidx] == '*') | |
| 5054 /* Deleting a vowel at the start of a word counts less, see | |
| 5055 * soundalike_score(). */ | |
| 5056 newscore = 2 * SCORE_DEL / 3; | |
| 5057 else | |
| 5058 newscore = SCORE_DEL; | |
| 5059 if (fword[sp->ts_fidx] != NUL | |
| 5060 && TRY_DEEPER(su, stack, depth, newscore)) | |
| 5061 { | |
| 5062 go_deeper(stack, depth, newscore); | |
| 5063 #ifdef DEBUG_TRIEWALK | |
| 5064 sprintf(changename[depth], "%.*s-%s: delete %c", | |
| 5065 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5066 fword[sp->ts_fidx]); | |
| 5067 #endif | |
| 5068 ++depth; | |
| 5069 | |
| 5070 /* Remember what character we deleted, so that we can avoid | |
| 5071 * inserting it again. */ | |
| 5072 stack[depth].ts_flags |= TSF_DIDDEL; | |
| 5073 stack[depth].ts_delidx = sp->ts_fidx; | |
| 5074 | |
| 5075 /* Advance over the character in fword[]. Give a bonus to the | |
| 5076 * score if the same character is following "nn" -> "n". It's | |
| 5077 * a bit illogical for soundfold tree but it does give better | |
| 5078 * results. */ | |
| 5079 if (has_mbyte) | |
| 5080 { | |
| 5081 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
|
5082 stack[depth].ts_fidx += MB_PTR2LEN(fword + sp->ts_fidx); |
| 625 | 5083 if (enc_utf8 && utf_iscomposing(c)) |
| 5084 stack[depth].ts_score -= SCORE_DEL - SCORE_DELCOMP; | |
| 5085 else if (c == mb_ptr2char(fword + stack[depth].ts_fidx)) | |
| 5086 stack[depth].ts_score -= SCORE_DEL - SCORE_DELDUP; | |
| 323 | 5087 } |
| 5088 else | |
| 625 | 5089 { |
| 5090 ++stack[depth].ts_fidx; | |
| 5091 if (fword[sp->ts_fidx] == fword[sp->ts_fidx + 1]) | |
| 5092 stack[depth].ts_score -= SCORE_DEL - SCORE_DELDUP; | |
| 323 | 5093 } |
| 5094 break; | |
| 625 | 5095 } |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5096 /* FALLTHROUGH */ |
| 625 | 5097 |
| 5098 case STATE_INS_PREP: | |
| 5099 if (sp->ts_flags & TSF_DIDDEL) | |
| 5100 { | |
| 5101 /* If we just deleted a byte then inserting won't make sense, | |
| 5102 * a substitute is always cheaper. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5103 PROF_STORE(sp->ts_state) |
| 625 | 5104 sp->ts_state = STATE_SWAP; |
| 5105 break; | |
| 5106 } | |
| 5107 | |
| 5108 /* skip over NUL bytes */ | |
| 5109 n = sp->ts_arridx; | |
| 5110 for (;;) | |
| 5111 { | |
| 5112 if (sp->ts_curi > byts[n]) | |
| 5113 { | |
| 5114 /* 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
|
5115 PROF_STORE(sp->ts_state) |
| 625 | 5116 sp->ts_state = STATE_SWAP; |
| 5117 break; | |
| 5118 } | |
| 5119 if (byts[n + sp->ts_curi] != NUL) | |
| 5120 { | |
| 5121 /* Found a byte to insert. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5122 PROF_STORE(sp->ts_state) |
| 625 | 5123 sp->ts_state = STATE_INS; |
| 330 | 5124 break; |
| 5125 } | |
| 625 | 5126 ++sp->ts_curi; |
| 5127 } | |
| 5128 break; | |
| 5129 | |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5130 /* FALLTHROUGH */ |
| 625 | 5131 |
| 5132 case STATE_INS: | |
| 5133 /* Insert one byte. Repeat this for each possible byte at this | |
| 5134 * node. */ | |
| 5135 n = sp->ts_arridx; | |
| 5136 if (sp->ts_curi > byts[n]) | |
| 5137 { | |
| 5138 /* 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
|
5139 PROF_STORE(sp->ts_state) |
| 625 | 5140 sp->ts_state = STATE_SWAP; |
| 5141 break; | |
| 5142 } | |
| 5143 | |
| 5144 /* Do one more byte at this node, but: | |
| 5145 * - Skip NUL bytes. | |
| 5146 * - Skip the byte if it's equal to the byte in the word, | |
| 5147 * accepting that byte is always better. | |
| 5148 */ | |
| 5149 n += sp->ts_curi++; | |
| 5150 c = byts[n]; | |
| 5151 if (soundfold && sp->ts_twordlen == 0 && c == '*') | |
| 5152 /* Inserting a vowel at the start of a word counts less, | |
| 5153 * see soundalike_score(). */ | |
| 5154 newscore = 2 * SCORE_INS / 3; | |
| 5155 else | |
| 5156 newscore = SCORE_INS; | |
| 5157 if (c != fword[sp->ts_fidx] | |
| 5158 && TRY_DEEPER(su, stack, depth, newscore)) | |
| 5159 { | |
| 5160 go_deeper(stack, depth, newscore); | |
| 5161 #ifdef DEBUG_TRIEWALK | |
| 5162 sprintf(changename[depth], "%.*s-%s: insert %c", | |
| 5163 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5164 c); | |
| 5165 #endif | |
| 5166 ++depth; | |
| 5167 sp = &stack[depth]; | |
| 5168 tword[sp->ts_twordlen++] = c; | |
| 5169 sp->ts_arridx = idxs[n]; | |
| 330 | 5170 if (has_mbyte) |
| 5171 { | |
| 625 | 5172 fl = MB_BYTE2LEN(c); |
| 5173 if (fl > 1) | |
| 330 | 5174 { |
| 625 | 5175 /* There are following bytes for the same character. |
| 5176 * We must find all bytes before trying | |
| 5177 * delete/insert/swap/etc. */ | |
| 5178 sp->ts_tcharlen = fl; | |
| 5179 sp->ts_tcharidx = 1; | |
| 5180 sp->ts_isdiff = DIFF_INSERT; | |
| 330 | 5181 } |
| 323 | 5182 } |
| 5183 else | |
| 625 | 5184 fl = 1; |
| 5185 if (fl == 1) | |
| 5186 { | |
| 5187 /* If the previous character was the same, thus doubling a | |
| 5188 * character, give a bonus to the score. Also for | |
| 5189 * soundfold words (illogical but does give a better | |
| 5190 * score). */ | |
| 5191 if (sp->ts_twordlen >= 2 | |
| 5192 && tword[sp->ts_twordlen - 2] == c) | |
| 5193 sp->ts_score -= SCORE_INS - SCORE_INSDUP; | |
| 5194 } | |
| 5195 } | |
| 5196 break; | |
| 5197 | |
| 5198 case STATE_SWAP: | |
| 5199 /* | |
| 5200 * Swap two bytes in the bad word: "12" -> "21". | |
| 5201 * We change "fword" here, it's changed back afterwards at | |
| 5202 * STATE_UNSWAP. | |
| 5203 */ | |
| 5204 p = fword + sp->ts_fidx; | |
| 5205 c = *p; | |
| 5206 if (c == NUL) | |
| 5207 { | |
| 5208 /* 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
|
5209 PROF_STORE(sp->ts_state) |
| 625 | 5210 sp->ts_state = STATE_FINAL; |
| 5211 break; | |
| 5212 } | |
| 5213 | |
| 5214 /* Don't swap if the first character is not a word character. | |
| 5215 * 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
|
5216 if (!soundfold && !spell_iswordp(p, curwin)) |
| 625 | 5217 { |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5218 PROF_STORE(sp->ts_state) |
| 625 | 5219 sp->ts_state = STATE_REP_INI; |
| 323 | 5220 break; |
| 625 | 5221 } |
| 5222 | |
| 5223 if (has_mbyte) | |
| 5224 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5225 n = MB_CPTR2LEN(p); |
| 625 | 5226 c = mb_ptr2char(p); |
| 1337 | 5227 if (p[n] == NUL) |
| 5228 c2 = NUL; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5229 else if (!soundfold && !spell_iswordp(p + n, curwin)) |
| 625 | 5230 c2 = c; /* don't swap non-word char */ |
| 5231 else | |
| 5232 c2 = mb_ptr2char(p + n); | |
| 5233 } | |
| 5234 else | |
| 5235 { | |
| 1337 | 5236 if (p[1] == NUL) |
| 5237 c2 = NUL; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5238 else if (!soundfold && !spell_iswordp(p + 1, curwin)) |
| 625 | 5239 c2 = c; /* don't swap non-word char */ |
| 5240 else | |
| 5241 c2 = p[1]; | |
| 5242 } | |
| 5243 | |
| 1337 | 5244 /* When the second character is NUL we can't swap. */ |
| 5245 if (c2 == NUL) | |
| 5246 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5247 PROF_STORE(sp->ts_state) |
| 1337 | 5248 sp->ts_state = STATE_REP_INI; |
| 5249 break; | |
| 5250 } | |
| 5251 | |
| 625 | 5252 /* When characters are identical, swap won't do anything. |
| 5253 * Also get here if the second char is not a word character. */ | |
| 5254 if (c == c2) | |
| 5255 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5256 PROF_STORE(sp->ts_state) |
| 625 | 5257 sp->ts_state = STATE_SWAP3; |
| 5258 break; | |
| 5259 } | |
| 5260 if (c2 != NUL && TRY_DEEPER(su, stack, depth, SCORE_SWAP)) | |
| 5261 { | |
| 5262 go_deeper(stack, depth, SCORE_SWAP); | |
| 5263 #ifdef DEBUG_TRIEWALK | |
| 5264 sprintf(changename[depth], "%.*s-%s: swap %c and %c", | |
| 5265 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5266 c, c2); | |
| 5267 #endif | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5268 PROF_STORE(sp->ts_state) |
| 625 | 5269 sp->ts_state = STATE_UNSWAP; |
| 5270 ++depth; | |
| 330 | 5271 if (has_mbyte) |
| 5272 { | |
| 625 | 5273 fl = mb_char2len(c2); |
| 5274 mch_memmove(p, p + n, fl); | |
| 5275 mb_char2bytes(c, p + fl); | |
| 5276 stack[depth].ts_fidxtry = sp->ts_fidx + n + fl; | |
| 330 | 5277 } |
| 5278 else | |
| 5279 { | |
| 625 | 5280 p[0] = c2; |
| 330 | 5281 p[1] = c; |
| 625 | 5282 stack[depth].ts_fidxtry = sp->ts_fidx + 2; |
| 5283 } | |
| 5284 } | |
| 5285 else | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5286 { |
| 625 | 5287 /* 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
|
5288 PROF_STORE(sp->ts_state) |
| 625 | 5289 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
|
5290 } |
| 625 | 5291 break; |
| 5292 | |
| 5293 case STATE_UNSWAP: | |
| 5294 /* Undo the STATE_SWAP swap: "21" -> "12". */ | |
| 5295 p = fword + sp->ts_fidx; | |
| 5296 if (has_mbyte) | |
| 5297 { | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5298 n = MB_PTR2LEN(p); |
| 625 | 5299 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
|
5300 mch_memmove(p + MB_PTR2LEN(p + n), p, n); |
| 625 | 5301 mb_char2bytes(c, p); |
| 5302 } | |
| 5303 else | |
| 5304 { | |
| 5305 c = *p; | |
| 5306 *p = p[1]; | |
| 5307 p[1] = c; | |
| 5308 } | |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5309 /* FALLTHROUGH */ |
| 625 | 5310 |
| 5311 case STATE_SWAP3: | |
| 5312 /* Swap two bytes, skipping one: "123" -> "321". We change | |
| 5313 * "fword" here, it's changed back afterwards at STATE_UNSWAP3. */ | |
| 5314 p = fword + sp->ts_fidx; | |
| 5315 if (has_mbyte) | |
| 5316 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5317 n = MB_CPTR2LEN(p); |
| 625 | 5318 c = mb_ptr2char(p); |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5319 fl = MB_CPTR2LEN(p + n); |
| 625 | 5320 c2 = mb_ptr2char(p + n); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5321 if (!soundfold && !spell_iswordp(p + n + fl, curwin)) |
| 625 | 5322 c3 = c; /* don't swap non-word char */ |
| 5323 else | |
| 5324 c3 = mb_ptr2char(p + n + fl); | |
| 5325 } | |
| 5326 else | |
| 5327 { | |
| 5328 c = *p; | |
| 5329 c2 = p[1]; | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5330 if (!soundfold && !spell_iswordp(p + 2, curwin)) |
| 625 | 5331 c3 = c; /* don't swap non-word char */ |
| 5332 else | |
| 5333 c3 = p[2]; | |
| 5334 } | |
| 5335 | |
| 5336 /* When characters are identical: "121" then SWAP3 result is | |
| 5337 * identical, ROT3L result is same as SWAP: "211", ROT3L result is | |
| 5338 * same as SWAP on next char: "112". Thus skip all swapping. | |
| 5339 * Also skip when c3 is NUL. | |
| 5340 * Also get here when the third character is not a word character. | |
| 5341 * Second character may any char: "a.b" -> "b.a" */ | |
| 5342 if (c == c3 || c3 == NUL) | |
| 5343 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5344 PROF_STORE(sp->ts_state) |
| 625 | 5345 sp->ts_state = STATE_REP_INI; |
| 5346 break; | |
| 5347 } | |
| 5348 if (TRY_DEEPER(su, stack, depth, SCORE_SWAP3)) | |
| 5349 { | |
| 5350 go_deeper(stack, depth, SCORE_SWAP3); | |
| 5351 #ifdef DEBUG_TRIEWALK | |
| 5352 sprintf(changename[depth], "%.*s-%s: swap3 %c and %c", | |
| 5353 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5354 c, c3); | |
| 5355 #endif | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5356 PROF_STORE(sp->ts_state) |
| 625 | 5357 sp->ts_state = STATE_UNSWAP3; |
| 5358 ++depth; | |
| 5359 if (has_mbyte) | |
| 5360 { | |
| 5361 tl = mb_char2len(c3); | |
| 5362 mch_memmove(p, p + n + fl, tl); | |
| 5363 mb_char2bytes(c2, p + tl); | |
| 5364 mb_char2bytes(c, p + fl + tl); | |
| 5365 stack[depth].ts_fidxtry = sp->ts_fidx + n + fl + tl; | |
| 5366 } | |
| 5367 else | |
| 5368 { | |
| 5369 p[0] = p[2]; | |
| 5370 p[2] = c; | |
| 5371 stack[depth].ts_fidxtry = sp->ts_fidx + 3; | |
| 5372 } | |
| 5373 } | |
| 5374 else | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5375 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5376 PROF_STORE(sp->ts_state) |
| 625 | 5377 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
|
5378 } |
| 625 | 5379 break; |
| 5380 | |
| 5381 case STATE_UNSWAP3: | |
| 5382 /* Undo STATE_SWAP3: "321" -> "123" */ | |
| 5383 p = fword + sp->ts_fidx; | |
| 5384 if (has_mbyte) | |
| 5385 { | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5386 n = MB_PTR2LEN(p); |
| 625 | 5387 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
|
5388 fl = MB_PTR2LEN(p + n); |
| 625 | 5389 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
|
5390 tl = MB_PTR2LEN(p + n + fl); |
| 625 | 5391 mch_memmove(p + fl + tl, p, n); |
| 5392 mb_char2bytes(c, p); | |
| 5393 mb_char2bytes(c2, p + tl); | |
| 5394 p = p + tl; | |
| 5395 } | |
| 5396 else | |
| 5397 { | |
| 5398 c = *p; | |
| 5399 *p = p[2]; | |
| 5400 p[2] = c; | |
| 5401 ++p; | |
| 5402 } | |
| 5403 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5404 if (!soundfold && !spell_iswordp(p, curwin)) |
| 625 | 5405 { |
| 5406 /* Middle char is not a word char, skip the rotate. First and | |
| 5407 * 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
|
5408 PROF_STORE(sp->ts_state) |
| 625 | 5409 sp->ts_state = STATE_REP_INI; |
| 5410 break; | |
| 5411 } | |
| 5412 | |
| 5413 /* Rotate three characters left: "123" -> "231". We change | |
| 5414 * "fword" here, it's changed back afterwards at STATE_UNROT3L. */ | |
| 5415 if (TRY_DEEPER(su, stack, depth, SCORE_SWAP3)) | |
| 5416 { | |
| 5417 go_deeper(stack, depth, SCORE_SWAP3); | |
| 5418 #ifdef DEBUG_TRIEWALK | |
| 5419 p = fword + sp->ts_fidx; | |
| 5420 sprintf(changename[depth], "%.*s-%s: rotate left %c%c%c", | |
| 5421 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5422 p[0], p[1], p[2]); | |
| 5423 #endif | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5424 PROF_STORE(sp->ts_state) |
| 625 | 5425 sp->ts_state = STATE_UNROT3L; |
| 5426 ++depth; | |
| 330 | 5427 p = fword + sp->ts_fidx; |
| 5428 if (has_mbyte) | |
| 5429 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5430 n = MB_CPTR2LEN(p); |
| 330 | 5431 c = mb_ptr2char(p); |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5432 fl = MB_CPTR2LEN(p + n); |
|
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5433 fl += MB_CPTR2LEN(p + n + fl); |
| 625 | 5434 mch_memmove(p, p + n, fl); |
| 5435 mb_char2bytes(c, p + fl); | |
| 5436 stack[depth].ts_fidxtry = sp->ts_fidx + n + fl; | |
| 330 | 5437 } |
| 5438 else | |
| 323 | 5439 { |
| 330 | 5440 c = *p; |
| 625 | 5441 *p = p[1]; |
| 5442 p[1] = p[2]; | |
| 5443 p[2] = c; | |
| 5444 stack[depth].ts_fidxtry = sp->ts_fidx + 3; | |
| 5445 } | |
| 5446 } | |
| 5447 else | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5448 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5449 PROF_STORE(sp->ts_state) |
| 625 | 5450 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
|
5451 } |
| 625 | 5452 break; |
| 5453 | |
| 5454 case STATE_UNROT3L: | |
| 5455 /* Undo ROT3L: "231" -> "123" */ | |
| 5456 p = fword + sp->ts_fidx; | |
| 5457 if (has_mbyte) | |
| 5458 { | |
|
11394
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5459 n = MB_PTR2LEN(p); |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5460 n += MB_PTR2LEN(p + n); |
| 625 | 5461 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
|
5462 tl = MB_PTR2LEN(p + n); |
| 625 | 5463 mch_memmove(p + tl, p, n); |
| 5464 mb_char2bytes(c, p); | |
| 5465 } | |
| 5466 else | |
| 5467 { | |
| 5468 c = p[2]; | |
| 5469 p[2] = p[1]; | |
| 5470 p[1] = *p; | |
| 5471 *p = c; | |
| 5472 } | |
| 5473 | |
| 5474 /* Rotate three bytes right: "123" -> "312". We change "fword" | |
| 5475 * here, it's changed back afterwards at STATE_UNROT3R. */ | |
| 5476 if (TRY_DEEPER(su, stack, depth, SCORE_SWAP3)) | |
| 5477 { | |
| 5478 go_deeper(stack, depth, SCORE_SWAP3); | |
| 5479 #ifdef DEBUG_TRIEWALK | |
| 5480 p = fword + sp->ts_fidx; | |
| 5481 sprintf(changename[depth], "%.*s-%s: rotate right %c%c%c", | |
| 5482 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5483 p[0], p[1], p[2]); | |
| 5484 #endif | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5485 PROF_STORE(sp->ts_state) |
| 625 | 5486 sp->ts_state = STATE_UNROT3R; |
| 5487 ++depth; | |
| 330 | 5488 p = fword + sp->ts_fidx; |
| 5489 if (has_mbyte) | |
| 5490 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5491 n = MB_CPTR2LEN(p); |
|
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5492 n += MB_CPTR2LEN(p + n); |
| 330 | 5493 c = mb_ptr2char(p + n); |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5494 tl = MB_CPTR2LEN(p + n); |
| 330 | 5495 mch_memmove(p + tl, p, n); |
| 5496 mb_char2bytes(c, p); | |
| 625 | 5497 stack[depth].ts_fidxtry = sp->ts_fidx + n + tl; |
| 330 | 5498 } |
| 5499 else | |
| 5500 { | |
| 5501 c = p[2]; | |
| 5502 p[2] = p[1]; | |
| 5503 p[1] = *p; | |
| 5504 *p = c; | |
| 625 | 5505 stack[depth].ts_fidxtry = sp->ts_fidx + 3; |
| 5506 } | |
| 5507 } | |
| 5508 else | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5509 { |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5510 PROF_STORE(sp->ts_state) |
| 625 | 5511 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
|
5512 } |
| 625 | 5513 break; |
| 5514 | |
| 5515 case STATE_UNROT3R: | |
| 5516 /* Undo ROT3R: "312" -> "123" */ | |
| 5517 p = fword + sp->ts_fidx; | |
| 5518 if (has_mbyte) | |
| 5519 { | |
| 5520 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
|
5521 tl = MB_PTR2LEN(p); |
|
a2124e9bbb6a
patch 8.0.0582: illegal memory access with z= command
Christian Brabandt <cb@256bit.org>
parents:
11269
diff
changeset
|
5522 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
|
5523 n += MB_PTR2LEN(p + tl + n); |
| 625 | 5524 mch_memmove(p, p + tl, n); |
| 5525 mb_char2bytes(c, p + n); | |
| 5526 } | |
| 5527 else | |
| 5528 { | |
| 5529 c = *p; | |
| 5530 *p = p[1]; | |
| 5531 p[1] = p[2]; | |
| 5532 p[2] = c; | |
| 5533 } | |
|
12674
e769c912fcd9
patch 8.0.1215: newer gcc warns for implicit fallthrough
Christian Brabandt <cb@256bit.org>
parents:
12477
diff
changeset
|
5534 /* FALLTHROUGH */ |
| 625 | 5535 |
| 5536 case STATE_REP_INI: | |
| 5537 /* Check if matching with REP items from the .aff file would work. | |
| 5538 * Quickly skip if: | |
| 5539 * - there are no REP items and we are not in the soundfold trie | |
| 5540 * - the score is going to be too high anyway | |
| 5541 * - already applied a REP item or swapped here */ | |
| 5542 if ((lp->lp_replang == NULL && !soundfold) | |
| 5543 || sp->ts_score + SCORE_REP >= su->su_maxscore | |
| 5544 || sp->ts_fidx < sp->ts_fidxtry) | |
| 5545 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5546 PROF_STORE(sp->ts_state) |
| 625 | 5547 sp->ts_state = STATE_FINAL; |
| 323 | 5548 break; |
| 625 | 5549 } |
| 5550 | |
| 5551 /* Use the first byte to quickly find the first entry that may | |
| 5552 * match. If the index is -1 there is none. */ | |
| 5553 if (soundfold) | |
| 5554 sp->ts_curi = slang->sl_repsal_first[fword[sp->ts_fidx]]; | |
| 5555 else | |
| 5556 sp->ts_curi = lp->lp_replang->sl_rep_first[fword[sp->ts_fidx]]; | |
| 5557 | |
| 5558 if (sp->ts_curi < 0) | |
| 5559 { | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5560 PROF_STORE(sp->ts_state) |
| 625 | 5561 sp->ts_state = STATE_FINAL; |
| 5562 break; | |
| 5563 } | |
| 5564 | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5565 PROF_STORE(sp->ts_state) |
| 625 | 5566 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
|
5567 /* FALLTHROUGH */ |
| 625 | 5568 |
| 5569 case STATE_REP: | |
| 5570 /* Try matching with REP items from the .aff file. For each match | |
| 5571 * replace the characters and check if the resulting word is | |
| 5572 * valid. */ | |
| 5573 p = fword + sp->ts_fidx; | |
| 5574 | |
| 5575 if (soundfold) | |
| 5576 gap = &slang->sl_repsal; | |
| 5577 else | |
| 503 | 5578 gap = &lp->lp_replang->sl_rep; |
| 625 | 5579 while (sp->ts_curi < gap->ga_len) |
| 5580 { | |
| 5581 ftp = (fromto_T *)gap->ga_data + sp->ts_curi++; | |
| 5582 if (*ftp->ft_from != *p) | |
| 5583 { | |
| 5584 /* past possible matching entries */ | |
| 5585 sp->ts_curi = gap->ga_len; | |
| 323 | 5586 break; |
| 5587 } | |
| 625 | 5588 if (STRNCMP(ftp->ft_from, p, STRLEN(ftp->ft_from)) == 0 |
| 5589 && TRY_DEEPER(su, stack, depth, SCORE_REP)) | |
| 5590 { | |
| 5591 go_deeper(stack, depth, SCORE_REP); | |
| 5592 #ifdef DEBUG_TRIEWALK | |
| 5593 sprintf(changename[depth], "%.*s-%s: replace %s with %s", | |
| 5594 sp->ts_twordlen, tword, fword + sp->ts_fidx, | |
| 5595 ftp->ft_from, ftp->ft_to); | |
| 5596 #endif | |
| 5597 /* Need to undo this afterwards. */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5598 PROF_STORE(sp->ts_state) |
| 625 | 5599 sp->ts_state = STATE_REP_UNDO; |
| 5600 | |
| 5601 /* Change the "from" to the "to" string. */ | |
| 5602 ++depth; | |
| 835 | 5603 fl = (int)STRLEN(ftp->ft_from); |
| 5604 tl = (int)STRLEN(ftp->ft_to); | |
| 625 | 5605 if (fl != tl) |
| 323 | 5606 { |
| 1619 | 5607 STRMOVE(p + tl, p + fl); |
| 625 | 5608 repextra += tl - fl; |
| 323 | 5609 } |
| 625 | 5610 mch_memmove(p, ftp->ft_to, tl); |
| 5611 stack[depth].ts_fidxtry = sp->ts_fidx + tl; | |
| 5612 stack[depth].ts_tcharlen = 0; | |
| 5613 break; | |
| 5614 } | |
| 5615 } | |
| 5616 | |
| 5617 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
|
5618 { |
| 625 | 5619 /* No (more) matches. */ |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5620 PROF_STORE(sp->ts_state) |
| 625 | 5621 sp->ts_state = STATE_FINAL; |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
5622 } |
| 625 | 5623 |
| 5624 break; | |
| 5625 | |
| 5626 case STATE_REP_UNDO: | |
| 5627 /* Undo a REP replacement and continue with the next one. */ | |
| 5628 if (soundfold) | |
| 5629 gap = &slang->sl_repsal; | |
| 5630 else | |
| 5631 gap = &lp->lp_replang->sl_rep; | |
| 5632 ftp = (fromto_T *)gap->ga_data + sp->ts_curi - 1; | |
| 835 | 5633 fl = (int)STRLEN(ftp->ft_from); |
| 5634 tl = (int)STRLEN(ftp->ft_to); | |
| 625 | 5635 p = fword + sp->ts_fidx; |
| 5636 if (fl != tl) | |
| 5637 { | |
| 1619 | 5638 STRMOVE(p + fl, p + tl); |
| 625 | 5639 repextra -= tl - fl; |
| 5640 } | |
| 5641 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
|
5642 PROF_STORE(sp->ts_state) |
| 625 | 5643 sp->ts_state = STATE_REP; |
| 5644 break; | |
| 5645 | |
| 5646 default: | |
| 5647 /* Did all possible states at this level, go up one level. */ | |
| 5648 --depth; | |
| 5649 | |
| 5650 if (depth >= 0 && stack[depth].ts_prefixdepth == PFD_PREFIXTREE) | |
| 5651 { | |
| 5652 /* Continue in or go back to the prefix tree. */ | |
| 5653 byts = pbyts; | |
| 5654 idxs = pidxs; | |
| 5655 } | |
| 5656 | |
| 5657 /* Don't check for CTRL-C too often, it takes time. */ | |
| 5658 if (--breakcheckcount == 0) | |
| 5659 { | |
| 5660 ui_breakcheck(); | |
| 5661 breakcheckcount = 1000; | |
| 5662 } | |
| 5663 } | |
| 5664 } | |
| 5665 } | |
| 5666 | |
| 5667 | |
| 5668 /* | |
| 5669 * Go one level deeper in the tree. | |
| 5670 */ | |
| 5671 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
5672 go_deeper(trystate_T *stack, int depth, int score_add) |
| 323 | 5673 { |
| 330 | 5674 stack[depth + 1] = stack[depth]; |
| 323 | 5675 stack[depth + 1].ts_state = STATE_START; |
| 625 | 5676 stack[depth + 1].ts_score = stack[depth].ts_score + score_add; |
| 323 | 5677 stack[depth + 1].ts_curi = 1; /* start just after length byte */ |
| 485 | 5678 stack[depth + 1].ts_flags = 0; |
| 323 | 5679 } |
| 5680 | |
| 455 | 5681 /* |
| 5682 * Case-folding may change the number of bytes: Count nr of chars in | |
| 5683 * fword[flen] and return the byte length of that many chars in "word". | |
| 5684 */ | |
| 5685 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
5686 nofold_len(char_u *fword, int flen, char_u *word) |
| 455 | 5687 { |
| 5688 char_u *p; | |
| 5689 int i = 0; | |
| 5690 | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
5691 for (p = fword; p < fword + flen; MB_PTR_ADV(p)) |
| 455 | 5692 ++i; |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
5693 for (p = word; i > 0; MB_PTR_ADV(p)) |
| 455 | 5694 --i; |
| 5695 return (int)(p - word); | |
| 5696 } | |
| 5697 | |
| 323 | 5698 /* |
| 5699 * "fword" is a good word with case folded. Find the matching keep-case | |
| 5700 * words and put it in "kword". | |
| 5701 * Theoretically there could be several keep-case words that result in the | |
| 5702 * same case-folded word, but we only find one... | |
| 5703 */ | |
| 5704 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
5705 find_keepcap_word(slang_T *slang, char_u *fword, char_u *kword) |
| 323 | 5706 { |
| 5707 char_u uword[MAXWLEN]; /* "fword" in upper-case */ | |
| 5708 int depth; | |
| 324 | 5709 idx_T tryidx; |
| 323 | 5710 |
| 5711 /* The following arrays are used at each depth in the tree. */ | |
| 324 | 5712 idx_T arridx[MAXWLEN]; |
| 323 | 5713 int round[MAXWLEN]; |
| 5714 int fwordidx[MAXWLEN]; | |
| 5715 int uwordidx[MAXWLEN]; | |
| 5716 int kwordlen[MAXWLEN]; | |
| 5717 | |
| 5718 int flen, ulen; | |
| 5719 int l; | |
| 5720 int len; | |
| 5721 int c; | |
| 324 | 5722 idx_T lo, hi, m; |
| 323 | 5723 char_u *p; |
| 5724 char_u *byts = slang->sl_kbyts; /* array with bytes of the words */ | |
| 324 | 5725 idx_T *idxs = slang->sl_kidxs; /* array with indexes */ |
| 323 | 5726 |
| 5727 if (byts == NULL) | |
| 5728 { | |
| 5729 /* array is empty: "cannot happen" */ | |
| 5730 *kword = NUL; | |
| 5731 return; | |
| 5732 } | |
| 5733 | |
| 5734 /* Make an all-cap version of "fword". */ | |
| 5735 allcap_copy(fword, uword); | |
| 5736 | |
| 5737 /* | |
| 5738 * Each character needs to be tried both case-folded and upper-case. | |
| 5739 * All this gets very complicated if we keep in mind that changing case | |
| 5740 * may change the byte length of a multi-byte character... | |
| 5741 */ | |
| 5742 depth = 0; | |
| 5743 arridx[0] = 0; | |
| 5744 round[0] = 0; | |
| 5745 fwordidx[0] = 0; | |
| 5746 uwordidx[0] = 0; | |
| 5747 kwordlen[0] = 0; | |
| 5748 while (depth >= 0) | |
| 5749 { | |
| 5750 if (fword[fwordidx[depth]] == NUL) | |
| 5751 { | |
| 5752 /* We are at the end of "fword". If the tree allows a word to end | |
| 5753 * here we have found a match. */ | |
| 5754 if (byts[arridx[depth] + 1] == 0) | |
| 5755 { | |
| 5756 kword[kwordlen[depth]] = NUL; | |
| 5757 return; | |
| 5758 } | |
| 5759 | |
| 5760 /* kword is getting too long, continue one level up */ | |
| 5761 --depth; | |
| 5762 } | |
| 5763 else if (++round[depth] > 2) | |
| 5764 { | |
| 5765 /* tried both fold-case and upper-case character, continue one | |
| 5766 * level up */ | |
| 5767 --depth; | |
| 5768 } | |
| 5769 else | |
| 5770 { | |
| 5771 /* | |
| 5772 * round[depth] == 1: Try using the folded-case character. | |
| 5773 * round[depth] == 2: Try using the upper-case character. | |
| 5774 */ | |
| 5775 if (has_mbyte) | |
| 5776 { | |
|
9898
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5777 flen = MB_CPTR2LEN(fword + fwordidx[depth]); |
|
bff8a09016a5
commit https://github.com/vim/vim/commit/d3c907b5d2b352482b580a0cf687cbbea4c19ea1
Christian Brabandt <cb@256bit.org>
parents:
9649
diff
changeset
|
5778 ulen = MB_CPTR2LEN(uword + uwordidx[depth]); |
| 323 | 5779 } |
| 5780 else | |
| 5781 ulen = flen = 1; | |
| 5782 if (round[depth] == 1) | |
| 5783 { | |
| 5784 p = fword + fwordidx[depth]; | |
| 5785 l = flen; | |
| 5786 } | |
| 5787 else | |
| 5788 { | |
| 5789 p = uword + uwordidx[depth]; | |
| 5790 l = ulen; | |
| 5791 } | |
| 5792 | |
| 5793 for (tryidx = arridx[depth]; l > 0; --l) | |
| 5794 { | |
| 5795 /* Perform a binary search in the list of accepted bytes. */ | |
| 5796 len = byts[tryidx++]; | |
| 5797 c = *p++; | |
| 5798 lo = tryidx; | |
| 5799 hi = tryidx + len - 1; | |
| 5800 while (lo < hi) | |
| 5801 { | |
| 5802 m = (lo + hi) / 2; | |
| 5803 if (byts[m] > c) | |
| 5804 hi = m - 1; | |
| 5805 else if (byts[m] < c) | |
| 5806 lo = m + 1; | |
| 5807 else | |
| 5808 { | |
| 5809 lo = hi = m; | |
| 5810 break; | |
| 5811 } | |
| 5812 } | |
| 5813 | |
| 5814 /* Stop if there is no matching byte. */ | |
| 5815 if (hi < lo || byts[lo] != c) | |
| 5816 break; | |
| 5817 | |
| 5818 /* Continue at the child (if there is one). */ | |
| 5819 tryidx = idxs[lo]; | |
| 5820 } | |
| 5821 | |
| 5822 if (l == 0) | |
| 5823 { | |
| 5824 /* | |
| 5825 * Found the matching char. Copy it to "kword" and go a | |
| 5826 * level deeper. | |
| 5827 */ | |
| 5828 if (round[depth] == 1) | |
| 5829 { | |
| 5830 STRNCPY(kword + kwordlen[depth], fword + fwordidx[depth], | |
| 5831 flen); | |
| 5832 kwordlen[depth + 1] = kwordlen[depth] + flen; | |
| 5833 } | |
| 5834 else | |
| 5835 { | |
| 5836 STRNCPY(kword + kwordlen[depth], uword + uwordidx[depth], | |
| 5837 ulen); | |
| 5838 kwordlen[depth + 1] = kwordlen[depth] + ulen; | |
| 5839 } | |
| 5840 fwordidx[depth + 1] = fwordidx[depth] + flen; | |
| 5841 uwordidx[depth + 1] = uwordidx[depth] + ulen; | |
| 5842 | |
| 5843 ++depth; | |
| 5844 arridx[depth] = tryidx; | |
| 5845 round[depth] = 0; | |
| 5846 } | |
| 5847 } | |
| 5848 } | |
| 5849 | |
| 5850 /* Didn't find it: "cannot happen". */ | |
| 5851 *kword = NUL; | |
| 5852 } | |
| 5853 | |
| 5854 /* | |
| 344 | 5855 * Compute the sound-a-like score for suggestions in su->su_ga and add them to |
| 5856 * su->su_sga. | |
| 5857 */ | |
| 5858 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
5859 score_comp_sal(suginfo_T *su) |
| 344 | 5860 { |
| 5861 langp_T *lp; | |
| 5862 char_u badsound[MAXWLEN]; | |
| 5863 int i; | |
| 5864 suggest_T *stp; | |
| 5865 suggest_T *sstp; | |
| 5866 int score; | |
| 500 | 5867 int lpi; |
| 344 | 5868 |
| 5869 if (ga_grow(&su->su_sga, su->su_ga.ga_len) == FAIL) | |
| 5870 return; | |
| 5871 | |
| 5872 /* 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
|
5873 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
|
5874 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5875 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 344 | 5876 if (lp->lp_slang->sl_sal.ga_len > 0) |
| 5877 { | |
| 5878 /* soundfold the bad word */ | |
| 375 | 5879 spell_soundfold(lp->lp_slang, su->su_fbadword, TRUE, badsound); |
| 344 | 5880 |
| 5881 for (i = 0; i < su->su_ga.ga_len; ++i) | |
| 5882 { | |
| 5883 stp = &SUG(su->su_ga, i); | |
| 5884 | |
| 351 | 5885 /* Case-fold the suggested word, sound-fold it and compute the |
| 5886 * sound-a-like score. */ | |
| 5887 score = stp_sal_score(stp, su, lp->lp_slang, badsound); | |
| 344 | 5888 if (score < SCORE_MAXMAX) |
| 5889 { | |
| 5890 /* Add the suggestion. */ | |
| 5891 sstp = &SUG(su->su_sga, su->su_sga.ga_len); | |
| 5892 sstp->st_word = vim_strsave(stp->st_word); | |
| 5893 if (sstp->st_word != NULL) | |
| 5894 { | |
| 625 | 5895 sstp->st_wordlen = stp->st_wordlen; |
| 344 | 5896 sstp->st_score = score; |
| 5897 sstp->st_altscore = 0; | |
| 5898 sstp->st_orglen = stp->st_orglen; | |
| 5899 ++su->su_sga.ga_len; | |
| 5900 } | |
| 5901 } | |
| 5902 } | |
| 5903 break; | |
| 5904 } | |
| 500 | 5905 } |
| 344 | 5906 } |
| 5907 | |
| 5908 /* | |
| 5909 * Combine the list of suggestions in su->su_ga and su->su_sga. | |
| 4352 | 5910 * They are entwined. |
| 344 | 5911 */ |
| 5912 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
5913 score_combine(suginfo_T *su) |
| 344 | 5914 { |
| 5915 int i; | |
| 5916 int j; | |
| 5917 garray_T ga; | |
| 5918 garray_T *gap; | |
| 5919 langp_T *lp; | |
| 5920 suggest_T *stp; | |
| 5921 char_u *p; | |
| 5922 char_u badsound[MAXWLEN]; | |
| 5923 int round; | |
| 500 | 5924 int lpi; |
| 625 | 5925 slang_T *slang = NULL; |
| 344 | 5926 |
| 5927 /* 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
|
5928 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
|
5929 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
5930 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 344 | 5931 if (lp->lp_slang->sl_sal.ga_len > 0) |
| 5932 { | |
| 5933 /* soundfold the bad word */ | |
| 625 | 5934 slang = lp->lp_slang; |
| 5935 spell_soundfold(slang, su->su_fbadword, TRUE, badsound); | |
| 344 | 5936 |
| 5937 for (i = 0; i < su->su_ga.ga_len; ++i) | |
| 5938 { | |
| 5939 stp = &SUG(su->su_ga, i); | |
| 625 | 5940 stp->st_altscore = stp_sal_score(stp, su, slang, badsound); |
| 344 | 5941 if (stp->st_altscore == SCORE_MAXMAX) |
| 5942 stp->st_score = (stp->st_score * 3 + SCORE_BIG) / 4; | |
| 5943 else | |
| 5944 stp->st_score = (stp->st_score * 3 | |
| 5945 + stp->st_altscore) / 4; | |
| 5946 stp->st_salscore = FALSE; | |
| 5947 } | |
| 5948 break; | |
| 5949 } | |
| 5950 } | |
| 5951 | |
| 844 | 5952 if (slang == NULL) /* Using "double" without sound folding. */ |
| 5953 { | |
| 5954 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, | |
| 5955 su->su_maxcount); | |
| 625 | 5956 return; |
| 844 | 5957 } |
| 625 | 5958 |
| 344 | 5959 /* Add the alternate score to su_sga. */ |
| 5960 for (i = 0; i < su->su_sga.ga_len; ++i) | |
| 5961 { | |
| 5962 stp = &SUG(su->su_sga, i); | |
| 625 | 5963 stp->st_altscore = spell_edit_score(slang, |
| 5964 su->su_badword, stp->st_word); | |
| 344 | 5965 if (stp->st_score == SCORE_MAXMAX) |
| 5966 stp->st_score = (SCORE_BIG * 7 + stp->st_altscore) / 8; | |
| 5967 else | |
| 5968 stp->st_score = (stp->st_score * 7 + stp->st_altscore) / 8; | |
| 5969 stp->st_salscore = TRUE; | |
| 5970 } | |
| 5971 | |
| 625 | 5972 /* Remove bad suggestions, sort the suggestions and truncate at "maxcount" |
| 5973 * for both lists. */ | |
| 5974 check_suggestions(su, &su->su_ga); | |
| 344 | 5975 (void)cleanup_suggestions(&su->su_ga, su->su_maxscore, su->su_maxcount); |
| 625 | 5976 check_suggestions(su, &su->su_sga); |
| 344 | 5977 (void)cleanup_suggestions(&su->su_sga, su->su_maxscore, su->su_maxcount); |
| 5978 | |
| 5979 ga_init2(&ga, (int)sizeof(suginfo_T), 1); | |
| 5980 if (ga_grow(&ga, su->su_ga.ga_len + su->su_sga.ga_len) == FAIL) | |
| 5981 return; | |
| 5982 | |
| 5983 stp = &SUG(ga, 0); | |
| 5984 for (i = 0; i < su->su_ga.ga_len || i < su->su_sga.ga_len; ++i) | |
| 5985 { | |
| 5986 /* round 1: get a suggestion from su_ga | |
| 5987 * round 2: get a suggestion from su_sga */ | |
| 5988 for (round = 1; round <= 2; ++round) | |
| 5989 { | |
| 5990 gap = round == 1 ? &su->su_ga : &su->su_sga; | |
| 5991 if (i < gap->ga_len) | |
| 5992 { | |
| 5993 /* Don't add a word if it's already there. */ | |
| 5994 p = SUG(*gap, i).st_word; | |
| 5995 for (j = 0; j < ga.ga_len; ++j) | |
| 5996 if (STRCMP(stp[j].st_word, p) == 0) | |
| 5997 break; | |
| 5998 if (j == ga.ga_len) | |
| 5999 stp[ga.ga_len++] = SUG(*gap, i); | |
| 6000 else | |
| 6001 vim_free(p); | |
| 6002 } | |
| 6003 } | |
| 6004 } | |
| 6005 | |
| 6006 ga_clear(&su->su_ga); | |
| 6007 ga_clear(&su->su_sga); | |
| 6008 | |
| 6009 /* Truncate the list to the number of suggestions that will be displayed. */ | |
| 6010 if (ga.ga_len > su->su_maxcount) | |
| 6011 { | |
| 6012 for (i = su->su_maxcount; i < ga.ga_len; ++i) | |
| 6013 vim_free(stp[i].st_word); | |
| 6014 ga.ga_len = su->su_maxcount; | |
| 6015 } | |
| 6016 | |
| 6017 su->su_ga = ga; | |
| 6018 } | |
| 6019 | |
| 6020 /* | |
| 351 | 6021 * For the goodword in "stp" compute the soundalike score compared to the |
| 6022 * badword. | |
| 6023 */ | |
| 6024 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6025 stp_sal_score( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6026 suggest_T *stp, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6027 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6028 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6029 char_u *badsound) /* sound-folded badword */ |
| 351 | 6030 { |
| 6031 char_u *p; | |
| 534 | 6032 char_u *pbad; |
| 6033 char_u *pgood; | |
| 351 | 6034 char_u badsound2[MAXWLEN]; |
| 6035 char_u fword[MAXWLEN]; | |
| 6036 char_u goodsound[MAXWLEN]; | |
| 534 | 6037 char_u goodword[MAXWLEN]; |
| 6038 int lendiff; | |
| 6039 | |
| 6040 lendiff = (int)(su->su_badlen - stp->st_orglen); | |
| 6041 if (lendiff >= 0) | |
| 6042 pbad = badsound; | |
| 351 | 6043 else |
| 6044 { | |
| 6045 /* soundfold the bad word with more characters following */ | |
| 6046 (void)spell_casefold(su->su_badptr, stp->st_orglen, fword, MAXWLEN); | |
| 6047 | |
| 6048 /* When joining two words the sound often changes a lot. E.g., "t he" | |
| 6049 * sounds like "t h" while "the" sounds like "@". Avoid that by | |
| 6050 * removing the space. Don't do it when the good word also contains a | |
| 6051 * space. */ | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
6052 if (VIM_ISWHITE(su->su_badptr[su->su_badlen]) |
| 351 | 6053 && *skiptowhite(stp->st_word) == NUL) |
| 6054 for (p = fword; *(p = skiptowhite(p)) != NUL; ) | |
| 1619 | 6055 STRMOVE(p, p + 1); |
| 351 | 6056 |
| 375 | 6057 spell_soundfold(slang, fword, TRUE, badsound2); |
| 534 | 6058 pbad = badsound2; |
| 6059 } | |
| 6060 | |
| 2768 | 6061 if (lendiff > 0 && stp->st_wordlen + lendiff < MAXWLEN) |
| 534 | 6062 { |
| 6063 /* Add part of the bad word to the good word, so that we soundfold | |
| 6064 * what replaces the bad word. */ | |
| 6065 STRCPY(goodword, stp->st_word); | |
| 625 | 6066 vim_strncpy(goodword + stp->st_wordlen, |
| 6067 su->su_badptr + su->su_badlen - lendiff, lendiff); | |
| 534 | 6068 pgood = goodword; |
| 6069 } | |
| 6070 else | |
| 6071 pgood = stp->st_word; | |
| 351 | 6072 |
| 375 | 6073 /* Sound-fold the word and compute the score for the difference. */ |
| 534 | 6074 spell_soundfold(slang, pgood, FALSE, goodsound); |
| 6075 | |
| 6076 return soundalike_score(goodsound, pbad); | |
| 351 | 6077 } |
| 6078 | |
| 625 | 6079 /* structure used to store soundfolded words that add_sound_suggest() has |
| 6080 * handled already. */ | |
| 6081 typedef struct | |
| 6082 { | |
| 6083 short sft_score; /* lowest score used */ | |
| 6084 char_u sft_word[1]; /* soundfolded word, actually longer */ | |
| 6085 } sftword_T; | |
| 6086 | |
| 6087 static sftword_T dumsft; | |
| 6088 #define HIKEY2SFT(p) ((sftword_T *)(p - (dumsft.sft_word - (char_u *)&dumsft))) | |
| 6089 #define HI2SFT(hi) HIKEY2SFT((hi)->hi_key) | |
| 6090 | |
| 6091 /* | |
| 6092 * Prepare for calling suggest_try_soundalike(). | |
| 6093 */ | |
| 6094 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6095 suggest_try_soundalike_prep(void) |
| 625 | 6096 { |
| 6097 langp_T *lp; | |
| 6098 int lpi; | |
| 6099 slang_T *slang; | |
| 6100 | |
| 6101 /* Do this for all languages that support sound folding and for which a | |
| 6102 * .sug file has been loaded. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6103 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
|
6104 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6105 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 625 | 6106 slang = lp->lp_slang; |
| 6107 if (slang->sl_sal.ga_len > 0 && slang->sl_sbyts != NULL) | |
| 6108 /* prepare the hashtable used by add_sound_suggest() */ | |
| 6109 hash_init(&slang->sl_sounddone); | |
| 6110 } | |
| 6111 } | |
| 6112 | |
| 351 | 6113 /* |
| 323 | 6114 * Find suggestions by comparing the word in a sound-a-like form. |
| 503 | 6115 * Note: This doesn't support postponed prefixes. |
| 323 | 6116 */ |
| 6117 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6118 suggest_try_soundalike(suginfo_T *su) |
| 323 | 6119 { |
| 6120 char_u salword[MAXWLEN]; | |
| 6121 langp_T *lp; | |
| 500 | 6122 int lpi; |
| 503 | 6123 slang_T *slang; |
| 344 | 6124 |
| 625 | 6125 /* Do this for all languages that support sound folding and for which a |
| 6126 * .sug file has been loaded. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6127 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
|
6128 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6129 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 625 | 6130 slang = lp->lp_slang; |
| 6131 if (slang->sl_sal.ga_len > 0 && slang->sl_sbyts != NULL) | |
| 6132 { | |
| 6133 /* soundfold the bad word */ | |
| 6134 spell_soundfold(slang, su->su_fbadword, TRUE, salword); | |
| 6135 | |
| 6136 /* try all kinds of inserts/deletes/swaps/etc. */ | |
| 6137 /* TODO: also soundfold the next words, so that we can try joining | |
| 6138 * and splitting */ | |
|
7509
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6139 #ifdef SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6140 prof_init(); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6141 #endif |
| 625 | 6142 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
|
6143 #ifdef SUGGEST_PROFILE |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6144 prof_report("soundalike"); |
|
a64793340689
commit https://github.com/vim/vim/commit/ca1fe985175385c609f8e06672a1014729aba05c
Christian Brabandt <cb@256bit.org>
parents:
7447
diff
changeset
|
6145 #endif |
| 625 | 6146 } |
| 6147 } | |
| 6148 } | |
| 6149 | |
| 6150 /* | |
| 6151 * Finish up after calling suggest_try_soundalike(). | |
| 6152 */ | |
| 6153 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6154 suggest_try_soundalike_finish(void) |
| 625 | 6155 { |
| 6156 langp_T *lp; | |
| 6157 int lpi; | |
| 6158 slang_T *slang; | |
| 6159 int todo; | |
| 6160 hashitem_T *hi; | |
| 6161 | |
| 6162 /* Do this for all languages that support sound folding and for which a | |
| 6163 * .sug file has been loaded. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6164 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
|
6165 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6166 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 503 | 6167 slang = lp->lp_slang; |
| 625 | 6168 if (slang->sl_sal.ga_len > 0 && slang->sl_sbyts != NULL) |
| 6169 { | |
| 6170 /* Free the info about handled words. */ | |
| 835 | 6171 todo = (int)slang->sl_sounddone.ht_used; |
| 625 | 6172 for (hi = slang->sl_sounddone.ht_array; todo > 0; ++hi) |
| 6173 if (!HASHITEM_EMPTY(hi)) | |
| 6174 { | |
| 6175 vim_free(HI2SFT(hi)); | |
| 6176 --todo; | |
| 6177 } | |
| 1087 | 6178 |
| 6179 /* Clear the hashtable, it may also be used by another region. */ | |
| 625 | 6180 hash_clear(&slang->sl_sounddone); |
| 1087 | 6181 hash_init(&slang->sl_sounddone); |
| 625 | 6182 } |
| 6183 } | |
| 6184 } | |
| 6185 | |
| 6186 /* | |
| 6187 * A match with a soundfolded word is found. Add the good word(s) that | |
| 6188 * produce this soundfolded word. | |
| 6189 */ | |
| 6190 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6191 add_sound_suggest( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6192 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6193 char_u *goodword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6194 int score, /* soundfold score */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6195 langp_T *lp) |
| 625 | 6196 { |
| 6197 slang_T *slang = lp->lp_slang; /* language for sound folding */ | |
| 6198 int sfwordnr; | |
| 6199 char_u *nrline; | |
| 6200 int orgnr; | |
| 6201 char_u theword[MAXWLEN]; | |
| 6202 int i; | |
| 6203 int wlen; | |
| 6204 char_u *byts; | |
| 6205 idx_T *idxs; | |
| 6206 int n; | |
| 6207 int wordcount; | |
| 6208 int wc; | |
| 6209 int goodscore; | |
| 6210 hash_T hash; | |
| 6211 hashitem_T *hi; | |
| 6212 sftword_T *sft; | |
| 6213 int bc, gc; | |
| 6214 int limit; | |
| 6215 | |
| 6216 /* | |
| 6217 * It's very well possible that the same soundfold word is found several | |
| 6218 * times with different scores. Since the following is quite slow only do | |
| 6219 * the words that have a better score than before. Use a hashtable to | |
| 6220 * remember the words that have been done. | |
| 6221 */ | |
| 6222 hash = hash_hash(goodword); | |
| 6223 hi = hash_lookup(&slang->sl_sounddone, goodword, hash); | |
| 6224 if (HASHITEM_EMPTY(hi)) | |
| 6225 { | |
|
16764
ef00b6bc186b
patch 8.1.1384: using "int" for alloc() often results in compiler warnings
Bram Moolenaar <Bram@vim.org>
parents:
16738
diff
changeset
|
6226 sft = (sftword_T *)alloc(sizeof(sftword_T) + STRLEN(goodword)); |
| 625 | 6227 if (sft != NULL) |
| 6228 { | |
| 6229 sft->sft_score = score; | |
| 6230 STRCPY(sft->sft_word, goodword); | |
| 6231 hash_add_item(&slang->sl_sounddone, hi, sft->sft_word, hash); | |
| 6232 } | |
| 6233 } | |
| 6234 else | |
| 6235 { | |
| 6236 sft = HI2SFT(hi); | |
| 6237 if (score >= sft->sft_score) | |
| 6238 return; | |
| 6239 sft->sft_score = score; | |
| 6240 } | |
| 6241 | |
| 6242 /* | |
| 6243 * Find the word nr in the soundfold tree. | |
| 6244 */ | |
| 6245 sfwordnr = soundfold_find(slang, goodword); | |
| 6246 if (sfwordnr < 0) | |
| 6247 { | |
|
10359
66f1b5bf3fa6
commit https://github.com/vim/vim/commit/95f096030ed1a8afea028f2ea295d6f6a70f466f
Christian Brabandt <cb@256bit.org>
parents:
10277
diff
changeset
|
6248 internal_error("add_sound_suggest()"); |
| 625 | 6249 return; |
| 6250 } | |
| 6251 | |
| 6252 /* | |
| 6253 * go over the list of good words that produce this soundfold word | |
| 6254 */ | |
| 6255 nrline = ml_get_buf(slang->sl_sugbuf, (linenr_T)(sfwordnr + 1), FALSE); | |
| 6256 orgnr = 0; | |
| 6257 while (*nrline != NUL) | |
| 6258 { | |
| 6259 /* The wordnr was stored in a minimal nr of bytes as an offset to the | |
| 6260 * previous wordnr. */ | |
| 6261 orgnr += bytes2offset(&nrline); | |
| 6262 | |
| 6263 byts = slang->sl_fbyts; | |
| 6264 idxs = slang->sl_fidxs; | |
| 6265 | |
| 6266 /* Lookup the word "orgnr" one of the two tries. */ | |
| 6267 n = 0; | |
| 6268 wordcount = 0; | |
| 5506 | 6269 for (wlen = 0; wlen < MAXWLEN - 3; ++wlen) |
| 625 | 6270 { |
| 6271 i = 1; | |
| 6272 if (wordcount == orgnr && byts[n + 1] == NUL) | |
| 6273 break; /* found end of word */ | |
| 6274 | |
| 6275 if (byts[n + 1] == NUL) | |
| 6276 ++wordcount; | |
| 6277 | |
| 6278 /* skip over the NUL bytes */ | |
| 6279 for ( ; byts[n + i] == NUL; ++i) | |
| 6280 if (i > byts[n]) /* safety check */ | |
| 6281 { | |
| 6282 STRCPY(theword + wlen, "BAD"); | |
| 5506 | 6283 wlen += 3; |
| 625 | 6284 goto badword; |
| 6285 } | |
| 6286 | |
| 6287 /* One of the siblings must have the word. */ | |
| 6288 for ( ; i < byts[n]; ++i) | |
| 6289 { | |
| 6290 wc = idxs[idxs[n + i]]; /* nr of words under this byte */ | |
| 6291 if (wordcount + wc > orgnr) | |
| 6292 break; | |
| 6293 wordcount += wc; | |
| 6294 } | |
| 6295 | |
| 5506 | 6296 theword[wlen] = byts[n + i]; |
| 625 | 6297 n = idxs[n + i]; |
| 6298 } | |
| 6299 badword: | |
| 6300 theword[wlen] = NUL; | |
| 6301 | |
| 6302 /* Go over the possible flags and regions. */ | |
| 6303 for (; i <= byts[n] && byts[n + i] == NUL; ++i) | |
| 6304 { | |
| 6305 char_u cword[MAXWLEN]; | |
| 6306 char_u *p; | |
| 6307 int flags = (int)idxs[n + i]; | |
| 6308 | |
| 698 | 6309 /* Skip words with the NOSUGGEST flag */ |
| 6310 if (flags & WF_NOSUGGEST) | |
| 6311 continue; | |
| 6312 | |
| 625 | 6313 if (flags & WF_KEEPCAP) |
| 6314 { | |
| 6315 /* Must find the word in the keep-case tree. */ | |
| 6316 find_keepcap_word(slang, theword, cword); | |
| 6317 p = cword; | |
| 6318 } | |
| 6319 else | |
| 6320 { | |
| 6321 flags |= su->su_badflags; | |
| 6322 if ((flags & WF_CAPMASK) != 0) | |
| 6323 { | |
| 6324 /* Need to fix case according to "flags". */ | |
| 6325 make_case_word(theword, cword, flags); | |
| 6326 p = cword; | |
| 323 | 6327 } |
| 6328 else | |
| 625 | 6329 p = theword; |
| 6330 } | |
| 6331 | |
| 6332 /* Add the suggestion. */ | |
| 6333 if (sps_flags & SPS_DOUBLE) | |
| 6334 { | |
| 6335 /* Add the suggestion if the score isn't too bad. */ | |
| 6336 if (score <= su->su_maxscore) | |
| 6337 add_suggestion(su, &su->su_sga, p, su->su_badlen, | |
| 6338 score, 0, FALSE, slang, FALSE); | |
| 6339 } | |
| 6340 else | |
| 6341 { | |
| 6342 /* Add a penalty for words in another region. */ | |
| 6343 if ((flags & WF_REGION) | |
| 6344 && (((unsigned)flags >> 16) & lp->lp_region) == 0) | |
| 6345 goodscore = SCORE_REGION; | |
| 6346 else | |
| 6347 goodscore = 0; | |
| 6348 | |
| 6349 /* Add a small penalty for changing the first letter from | |
| 6350 * lower to upper case. Helps for "tath" -> "Kath", which is | |
| 4352 | 6351 * less common than "tath" -> "path". Don't do it when the |
| 625 | 6352 * letter is the same, that has already been counted. */ |
| 6353 gc = PTR2CHAR(p); | |
| 6354 if (SPELL_ISUPPER(gc)) | |
| 6355 { | |
| 6356 bc = PTR2CHAR(su->su_badword); | |
| 6357 if (!SPELL_ISUPPER(bc) | |
| 6358 && SPELL_TOFOLD(bc) != SPELL_TOFOLD(gc)) | |
| 6359 goodscore += SCORE_ICASE / 2; | |
| 6360 } | |
| 6361 | |
| 6362 /* Compute the score for the good word. This only does letter | |
| 6363 * insert/delete/swap/replace. REP items are not considered, | |
| 6364 * which may make the score a bit higher. | |
| 6365 * Use a limit for the score to make it work faster. Use | |
| 6366 * MAXSCORE(), because RESCORE() will change the score. | |
| 6367 * If the limit is very high then the iterative method is | |
| 6368 * inefficient, using an array is quicker. */ | |
| 6369 limit = MAXSCORE(su->su_sfmaxscore - goodscore, score); | |
| 6370 if (limit > SCORE_LIMITMAX) | |
| 6371 goodscore += spell_edit_score(slang, su->su_badword, p); | |
| 6372 else | |
| 6373 goodscore += spell_edit_score_limit(slang, su->su_badword, | |
| 6374 p, limit); | |
| 6375 | |
| 6376 /* When going over the limit don't bother to do the rest. */ | |
| 6377 if (goodscore < SCORE_MAXMAX) | |
| 6378 { | |
| 6379 /* Give a bonus to words seen before. */ | |
| 6380 goodscore = score_wordcount_adj(slang, goodscore, p, FALSE); | |
| 6381 | |
| 6382 /* Add the suggestion if the score isn't too bad. */ | |
| 6383 goodscore = RESCORE(goodscore, score); | |
| 6384 if (goodscore <= su->su_sfmaxscore) | |
| 6385 add_suggestion(su, &su->su_ga, p, su->su_badlen, | |
| 6386 goodscore, score, TRUE, slang, TRUE); | |
| 6387 } | |
| 6388 } | |
| 6389 } | |
| 6390 /* smsg("word %s (%d): %s (%d)", sftword, sftnr, theword, orgnr); */ | |
| 6391 } | |
| 6392 } | |
| 6393 | |
| 6394 /* | |
| 6395 * Find word "word" in fold-case tree for "slang" and return the word number. | |
| 6396 */ | |
| 6397 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6398 soundfold_find(slang_T *slang, char_u *word) |
| 625 | 6399 { |
| 6400 idx_T arridx = 0; | |
| 6401 int len; | |
| 6402 int wlen = 0; | |
| 6403 int c; | |
| 6404 char_u *ptr = word; | |
| 6405 char_u *byts; | |
| 6406 idx_T *idxs; | |
| 6407 int wordnr = 0; | |
| 6408 | |
| 6409 byts = slang->sl_sbyts; | |
| 6410 idxs = slang->sl_sidxs; | |
| 6411 | |
| 6412 for (;;) | |
| 6413 { | |
| 6414 /* First byte is the number of possible bytes. */ | |
| 6415 len = byts[arridx++]; | |
| 6416 | |
| 6417 /* If the first possible byte is a zero the word could end here. | |
| 6418 * If the word ends we found the word. If not skip the NUL bytes. */ | |
| 6419 c = ptr[wlen]; | |
| 6420 if (byts[arridx] == NUL) | |
| 6421 { | |
| 6422 if (c == NUL) | |
| 6423 break; | |
| 6424 | |
| 6425 /* Skip over the zeros, there can be several. */ | |
| 6426 while (len > 0 && byts[arridx] == NUL) | |
| 6427 { | |
| 6428 ++arridx; | |
| 6429 --len; | |
| 6430 } | |
| 6431 if (len == 0) | |
| 6432 return -1; /* no children, word should have ended here */ | |
| 6433 ++wordnr; | |
| 6434 } | |
| 6435 | |
| 6436 /* If the word ends we didn't find it. */ | |
| 6437 if (c == NUL) | |
| 6438 return -1; | |
| 6439 | |
| 6440 /* Perform a binary search in the list of accepted bytes. */ | |
| 6441 if (c == TAB) /* <Tab> is handled like <Space> */ | |
| 6442 c = ' '; | |
| 6443 while (byts[arridx] < c) | |
| 6444 { | |
| 6445 /* The word count is in the first idxs[] entry of the child. */ | |
| 6446 wordnr += idxs[idxs[arridx]]; | |
| 6447 ++arridx; | |
| 6448 if (--len == 0) /* end of the bytes, didn't find it */ | |
| 6449 return -1; | |
| 6450 } | |
| 6451 if (byts[arridx] != c) /* didn't find the byte */ | |
| 6452 return -1; | |
| 6453 | |
| 6454 /* Continue at the child (if there is one). */ | |
| 6455 arridx = idxs[arridx]; | |
| 6456 ++wlen; | |
| 6457 | |
| 6458 /* One space in the good word may stand for several spaces in the | |
| 6459 * checked word. */ | |
| 6460 if (c == ' ') | |
| 6461 while (ptr[wlen] == ' ' || ptr[wlen] == TAB) | |
| 6462 ++wlen; | |
| 6463 } | |
| 6464 | |
| 6465 return wordnr; | |
| 323 | 6466 } |
| 6467 | |
| 6468 /* | |
| 324 | 6469 * Copy "fword" to "cword", fixing case according to "flags". |
| 323 | 6470 */ |
| 6471 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6472 make_case_word(char_u *fword, char_u *cword, int flags) |
| 323 | 6473 { |
| 6474 if (flags & WF_ALLCAP) | |
| 6475 /* Make it all upper-case */ | |
| 6476 allcap_copy(fword, cword); | |
| 6477 else if (flags & WF_ONECAP) | |
| 6478 /* Make the first letter upper-case */ | |
| 324 | 6479 onecap_copy(fword, cword, TRUE); |
| 323 | 6480 else |
| 6481 /* Use goodword as-is. */ | |
| 6482 STRCPY(cword, fword); | |
| 6483 } | |
| 6484 | |
| 330 | 6485 |
| 323 | 6486 /* |
| 6487 * Return TRUE if "c1" and "c2" are similar characters according to the MAP | |
| 6488 * lines in the .aff file. | |
| 6489 */ | |
| 6490 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6491 similar_chars(slang_T *slang, int c1, int c2) |
| 323 | 6492 { |
| 330 | 6493 int m1, m2; |
| 3549 | 6494 char_u buf[MB_MAXBYTES + 1]; |
| 330 | 6495 hashitem_T *hi; |
| 6496 | |
| 6497 if (c1 >= 256) | |
| 6498 { | |
| 6499 buf[mb_char2bytes(c1, buf)] = 0; | |
| 6500 hi = hash_find(&slang->sl_map_hash, buf); | |
| 6501 if (HASHITEM_EMPTY(hi)) | |
| 6502 m1 = 0; | |
| 6503 else | |
| 6504 m1 = mb_ptr2char(hi->hi_key + STRLEN(hi->hi_key) + 1); | |
| 6505 } | |
| 6506 else | |
| 6507 m1 = slang->sl_map_array[c1]; | |
| 6508 if (m1 == 0) | |
| 323 | 6509 return FALSE; |
| 330 | 6510 |
| 6511 | |
| 6512 if (c2 >= 256) | |
| 6513 { | |
| 6514 buf[mb_char2bytes(c2, buf)] = 0; | |
| 6515 hi = hash_find(&slang->sl_map_hash, buf); | |
| 6516 if (HASHITEM_EMPTY(hi)) | |
| 6517 m2 = 0; | |
| 6518 else | |
| 6519 m2 = mb_ptr2char(hi->hi_key + STRLEN(hi->hi_key) + 1); | |
| 6520 } | |
| 6521 else | |
| 6522 m2 = slang->sl_map_array[c2]; | |
| 6523 | |
| 6524 return m1 == m2; | |
| 323 | 6525 } |
| 6526 | |
| 6527 /* | |
| 6528 * Add a suggestion to the list of suggestions. | |
| 625 | 6529 * For a suggestion that is already in the list the lowest score is remembered. |
| 6530 */ | |
| 6531 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6532 add_suggestion( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6533 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6534 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
|
6535 char_u *goodword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6536 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
|
6537 int score, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6538 int altscore, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6539 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
|
6540 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
|
6541 int maxsf) /* su_maxscore applies to soundfold score, |
| 625 | 6542 su_sfmaxscore to the total score. */ |
| 6543 { | |
| 6544 int goodlen; /* len of goodword changed */ | |
| 6545 int badlen; /* len of bad word changed */ | |
| 323 | 6546 suggest_T *stp; |
| 534 | 6547 suggest_T new_sug; |
| 323 | 6548 int i; |
| 534 | 6549 char_u *pgood, *pbad; |
| 532 | 6550 |
| 534 | 6551 /* Minimize "badlen" for consistency. Avoids that changing "the the" to |
| 6552 * "thee the" is added next to changing the first "the" the "thee". */ | |
| 6553 pgood = goodword + STRLEN(goodword); | |
| 625 | 6554 pbad = su->su_badptr + badlenarg; |
| 6555 for (;;) | |
| 6556 { | |
| 835 | 6557 goodlen = (int)(pgood - goodword); |
| 6558 badlen = (int)(pbad - su->su_badptr); | |
| 625 | 6559 if (goodlen <= 0 || badlen <= 0) |
| 6560 break; | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
6561 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
|
6562 MB_PTR_BACK(su->su_badptr, pbad); |
| 534 | 6563 if (has_mbyte) |
| 6564 { | |
| 6565 if (mb_ptr2char(pgood) != mb_ptr2char(pbad)) | |
| 6566 break; | |
| 346 | 6567 } |
|
15605
62b3805506b3
patch 8.1.0810: too many #ifdefs
Bram Moolenaar <Bram@vim.org>
parents:
15543
diff
changeset
|
6568 else if (*pgood != *pbad) |
| 534 | 6569 break; |
| 625 | 6570 } |
| 6571 | |
| 534 | 6572 if (badlen == 0 && goodlen == 0) |
| 6573 /* goodword doesn't change anything; may happen for "the the" changing | |
| 6574 * the first "the" to itself. */ | |
| 6575 return; | |
| 346 | 6576 |
| 944 | 6577 if (gap->ga_len == 0) |
| 6578 i = -1; | |
| 6579 else | |
| 6580 { | |
| 6581 /* Check if the word is already there. Also check the length that is | |
| 6582 * being replaced "thes," -> "these" is a different suggestion from | |
| 6583 * "thes" -> "these". */ | |
| 6584 stp = &SUG(*gap, 0); | |
| 6585 for (i = gap->ga_len; --i >= 0; ++stp) | |
| 6586 if (stp->st_wordlen == goodlen | |
| 6587 && stp->st_orglen == badlen | |
| 6588 && STRNCMP(stp->st_word, goodword, goodlen) == 0) | |
| 6589 { | |
| 6590 /* | |
| 6591 * Found it. Remember the word with the lowest score. | |
| 6592 */ | |
| 6593 if (stp->st_slang == NULL) | |
| 6594 stp->st_slang = slang; | |
| 6595 | |
| 6596 new_sug.st_score = score; | |
| 6597 new_sug.st_altscore = altscore; | |
| 6598 new_sug.st_had_bonus = had_bonus; | |
| 6599 | |
| 6600 if (stp->st_had_bonus != had_bonus) | |
| 6601 { | |
| 6602 /* Only one of the two had the soundalike score computed. | |
| 6603 * Need to do that for the other one now, otherwise the | |
| 6604 * scores can't be compared. This happens because | |
| 6605 * suggest_try_change() doesn't compute the soundalike | |
| 6606 * word to keep it fast, while some special methods set | |
| 6607 * the soundalike score to zero. */ | |
| 6608 if (had_bonus) | |
| 6609 rescore_one(su, stp); | |
| 6610 else | |
| 6611 { | |
| 6612 new_sug.st_word = stp->st_word; | |
| 6613 new_sug.st_wordlen = stp->st_wordlen; | |
| 6614 new_sug.st_slang = stp->st_slang; | |
| 6615 new_sug.st_orglen = badlen; | |
| 6616 rescore_one(su, &new_sug); | |
| 6617 } | |
| 6618 } | |
| 6619 | |
| 6620 if (stp->st_score > new_sug.st_score) | |
| 6621 { | |
| 6622 stp->st_score = new_sug.st_score; | |
| 6623 stp->st_altscore = new_sug.st_altscore; | |
| 6624 stp->st_had_bonus = new_sug.st_had_bonus; | |
| 6625 } | |
| 6626 break; | |
| 6627 } | |
| 6628 } | |
| 625 | 6629 |
| 6630 if (i < 0 && ga_grow(gap, 1) == OK) | |
| 6631 { | |
| 6632 /* Add a suggestion. */ | |
| 6633 stp = &SUG(*gap, gap->ga_len); | |
| 6634 stp->st_word = vim_strnsave(goodword, goodlen); | |
| 6635 if (stp->st_word != NULL) | |
| 6636 { | |
| 6637 stp->st_wordlen = goodlen; | |
| 6638 stp->st_score = score; | |
| 6639 stp->st_altscore = altscore; | |
| 6640 stp->st_had_bonus = had_bonus; | |
| 6641 stp->st_orglen = badlen; | |
| 6642 stp->st_slang = slang; | |
| 6643 ++gap->ga_len; | |
| 6644 | |
| 6645 /* If we have too many suggestions now, sort the list and keep | |
| 6646 * the best suggestions. */ | |
| 6647 if (gap->ga_len > SUG_MAX_COUNT(su)) | |
| 6648 { | |
| 6649 if (maxsf) | |
| 6650 su->su_sfmaxscore = cleanup_suggestions(gap, | |
| 6651 su->su_sfmaxscore, SUG_CLEAN_COUNT(su)); | |
| 6652 else | |
| 6653 su->su_maxscore = cleanup_suggestions(gap, | |
| 6654 su->su_maxscore, SUG_CLEAN_COUNT(su)); | |
| 6655 } | |
| 6656 } | |
| 6657 } | |
| 6658 } | |
| 6659 | |
| 6660 /* | |
| 6661 * Suggestions may in fact be flagged as errors. Esp. for banned words and | |
| 6662 * for split words, such as "the the". Remove these from the list here. | |
| 6663 */ | |
| 6664 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6665 check_suggestions( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6666 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6667 garray_T *gap) /* either su_ga or su_sga */ |
| 625 | 6668 { |
| 6669 suggest_T *stp; | |
| 6670 int i; | |
| 6671 char_u longword[MAXWLEN + 1]; | |
| 6672 int len; | |
| 6673 hlf_T attr; | |
| 6674 | |
| 6675 stp = &SUG(*gap, 0); | |
| 6676 for (i = gap->ga_len - 1; i >= 0; --i) | |
| 6677 { | |
| 6678 /* Need to append what follows to check for "the the". */ | |
| 2768 | 6679 vim_strncpy(longword, stp[i].st_word, MAXWLEN); |
| 625 | 6680 len = stp[i].st_wordlen; |
| 6681 vim_strncpy(longword + len, su->su_badptr + stp[i].st_orglen, | |
| 6682 MAXWLEN - len); | |
| 6683 attr = HLF_COUNT; | |
| 6684 (void)spell_check(curwin, longword, &attr, NULL, FALSE); | |
| 6685 if (attr != HLF_COUNT) | |
| 6686 { | |
| 6687 /* Remove this entry. */ | |
| 6688 vim_free(stp[i].st_word); | |
| 6689 --gap->ga_len; | |
| 6690 if (i < gap->ga_len) | |
| 6691 mch_memmove(stp + i, stp + i + 1, | |
| 6692 sizeof(suggest_T) * (gap->ga_len - i)); | |
| 6693 } | |
| 6694 } | |
| 6695 } | |
| 6696 | |
| 323 | 6697 |
| 6698 /* | |
| 6699 * Add a word to be banned. | |
| 6700 */ | |
| 6701 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6702 add_banned( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6703 suginfo_T *su, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6704 char_u *word) |
| 323 | 6705 { |
| 626 | 6706 char_u *s; |
| 323 | 6707 hash_T hash; |
| 6708 hashitem_T *hi; | |
| 6709 | |
| 625 | 6710 hash = hash_hash(word); |
| 6711 hi = hash_lookup(&su->su_banned, word, hash); | |
| 6712 if (HASHITEM_EMPTY(hi)) | |
| 6713 { | |
| 6714 s = vim_strsave(word); | |
| 6715 if (s != NULL) | |
| 323 | 6716 hash_add_item(&su->su_banned, hi, s, hash); |
| 625 | 6717 } |
| 323 | 6718 } |
| 6719 | |
| 324 | 6720 /* |
| 534 | 6721 * Recompute the score for all suggestions if sound-folding is possible. This |
| 6722 * is slow, thus only done for the final results. | |
| 324 | 6723 */ |
| 6724 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6725 rescore_suggestions(suginfo_T *su) |
| 324 | 6726 { |
| 6727 int i; | |
| 534 | 6728 |
| 6729 if (su->su_sallang != NULL) | |
| 503 | 6730 for (i = 0; i < su->su_ga.ga_len; ++i) |
| 534 | 6731 rescore_one(su, &SUG(su->su_ga, i)); |
| 6732 } | |
| 6733 | |
| 6734 /* | |
| 6735 * Recompute the score for one suggestion if sound-folding is possible. | |
| 6736 */ | |
| 6737 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6738 rescore_one(suginfo_T *su, suggest_T *stp) |
| 534 | 6739 { |
| 6740 slang_T *slang = stp->st_slang; | |
| 6741 char_u sal_badword[MAXWLEN]; | |
| 535 | 6742 char_u *p; |
| 534 | 6743 |
| 6744 /* Only rescore suggestions that have no sal score yet and do have a | |
| 6745 * language. */ | |
| 6746 if (slang != NULL && slang->sl_sal.ga_len > 0 && !stp->st_had_bonus) | |
| 6747 { | |
| 6748 if (slang == su->su_sallang) | |
| 535 | 6749 p = su->su_sal_badword; |
| 534 | 6750 else |
| 6751 { | |
| 6752 spell_soundfold(slang, su->su_fbadword, TRUE, sal_badword); | |
| 535 | 6753 p = sal_badword; |
| 6754 } | |
| 6755 | |
| 6756 stp->st_altscore = stp_sal_score(stp, su, slang, p); | |
| 534 | 6757 if (stp->st_altscore == SCORE_MAXMAX) |
| 6758 stp->st_altscore = SCORE_BIG; | |
| 6759 stp->st_score = RESCORE(stp->st_score, stp->st_altscore); | |
| 6760 stp->st_had_bonus = TRUE; | |
| 324 | 6761 } |
| 6762 } | |
| 6763 | |
|
16606
7e733046db1d
patch 8.1.1306: Borland support is outdated and doesn't work
Bram Moolenaar <Bram@vim.org>
parents:
16277
diff
changeset
|
6764 static int sug_compare(const void *s1, const void *s2); |
| 323 | 6765 |
| 6766 /* | |
| 6767 * Function given to qsort() to sort the suggestions on st_score. | |
| 529 | 6768 * First on "st_score", then "st_altscore" then alphabetically. |
| 323 | 6769 */ |
| 6770 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6771 sug_compare(const void *s1, const void *s2) |
| 323 | 6772 { |
| 6773 suggest_T *p1 = (suggest_T *)s1; | |
| 6774 suggest_T *p2 = (suggest_T *)s2; | |
| 344 | 6775 int n = p1->st_score - p2->st_score; |
| 6776 | |
| 6777 if (n == 0) | |
| 529 | 6778 { |
| 6779 n = p1->st_altscore - p2->st_altscore; | |
| 6780 if (n == 0) | |
| 6781 n = STRICMP(p1->st_word, p2->st_word); | |
| 6782 } | |
| 344 | 6783 return n; |
| 323 | 6784 } |
| 6785 | |
| 6786 /* | |
| 6787 * Cleanup the suggestions: | |
| 6788 * - Sort on score. | |
| 6789 * - Remove words that won't be displayed. | |
| 344 | 6790 * Returns the maximum score in the list or "maxscore" unmodified. |
| 323 | 6791 */ |
| 344 | 6792 static int |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6793 cleanup_suggestions( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6794 garray_T *gap, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6795 int maxscore, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6796 int keep) /* nr of suggestions to keep */ |
| 323 | 6797 { |
| 344 | 6798 suggest_T *stp = &SUG(*gap, 0); |
| 323 | 6799 int i; |
| 6800 | |
| 6801 /* Sort the list. */ | |
| 344 | 6802 qsort(gap->ga_data, (size_t)gap->ga_len, sizeof(suggest_T), sug_compare); |
| 323 | 6803 |
| 6804 /* Truncate the list to the number of suggestions that will be displayed. */ | |
| 344 | 6805 if (gap->ga_len > keep) |
| 323 | 6806 { |
| 344 | 6807 for (i = keep; i < gap->ga_len; ++i) |
| 323 | 6808 vim_free(stp[i].st_word); |
| 344 | 6809 gap->ga_len = keep; |
| 6810 return stp[keep - 1].st_score; | |
| 323 | 6811 } |
| 344 | 6812 return maxscore; |
| 323 | 6813 } |
| 6814 | |
| 372 | 6815 #if defined(FEAT_EVAL) || defined(PROTO) |
| 6816 /* | |
| 6817 * Soundfold a string, for soundfold(). | |
| 6818 * Result is in allocated memory, NULL for an error. | |
| 6819 */ | |
| 6820 char_u * | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6821 eval_soundfold(char_u *word) |
| 372 | 6822 { |
| 6823 langp_T *lp; | |
| 6824 char_u sound[MAXWLEN]; | |
| 500 | 6825 int lpi; |
| 372 | 6826 |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6827 if (curwin->w_p_spell && *curwin->w_s->b_p_spl != NUL) |
| 372 | 6828 /* 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
|
6829 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
|
6830 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6831 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 372 | 6832 if (lp->lp_slang->sl_sal.ga_len > 0) |
| 6833 { | |
| 6834 /* soundfold the word */ | |
| 375 | 6835 spell_soundfold(lp->lp_slang, word, FALSE, sound); |
| 372 | 6836 return vim_strsave(sound); |
| 6837 } | |
| 500 | 6838 } |
| 372 | 6839 |
| 6840 /* No language with sound folding, return word as-is. */ | |
| 6841 return vim_strsave(word); | |
| 6842 } | |
| 6843 #endif | |
| 6844 | |
| 323 | 6845 /* |
| 6846 * Turn "inword" into its sound-a-like equivalent in "res[MAXWLEN]". | |
| 485 | 6847 * |
| 6848 * There are many ways to turn a word into a sound-a-like representation. The | |
| 6849 * oldest is Soundex (1918!). A nice overview can be found in "Approximate | |
| 6850 * swedish name matching - survey and test of different algorithms" by Klas | |
| 6851 * Erikson. | |
| 6852 * | |
| 6853 * We support two methods: | |
| 6854 * 1. SOFOFROM/SOFOTO do a simple character mapping. | |
| 6855 * 2. SAL items define a more advanced sound-folding (and much slower). | |
| 323 | 6856 */ |
|
9583
b0c7061d6439
commit https://github.com/vim/vim/commit/9ccfebddc3ff2a3c2853cf706fd4c26f639bf381
Christian Brabandt <cb@256bit.org>
parents:
9570
diff
changeset
|
6857 void |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6858 spell_soundfold( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6859 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6860 char_u *inword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6861 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
|
6862 char_u *res) |
| 375 | 6863 { |
| 6864 char_u fword[MAXWLEN]; | |
| 6865 char_u *word; | |
| 6866 | |
| 6867 if (slang->sl_sofo) | |
| 6868 /* SOFOFROM and SOFOTO used */ | |
| 6869 spell_soundfold_sofo(slang, inword, res); | |
| 6870 else | |
| 6871 { | |
| 6872 /* SAL items used. Requires the word to be case-folded. */ | |
| 6873 if (folded) | |
| 6874 word = inword; | |
| 6875 else | |
| 6876 { | |
| 835 | 6877 (void)spell_casefold(inword, (int)STRLEN(inword), fword, MAXWLEN); |
| 375 | 6878 word = fword; |
| 6879 } | |
| 6880 | |
| 6881 if (has_mbyte) | |
| 6882 spell_soundfold_wsal(slang, word, res); | |
| 6883 else | |
| 6884 spell_soundfold_sal(slang, word, res); | |
| 6885 } | |
| 6886 } | |
| 6887 | |
| 6888 /* | |
| 6889 * Perform sound folding of "inword" into "res" according to SOFOFROM and | |
| 6890 * SOFOTO lines. | |
| 6891 */ | |
| 6892 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6893 spell_soundfold_sofo(slang_T *slang, char_u *inword, char_u *res) |
| 375 | 6894 { |
| 6895 char_u *s; | |
| 6896 int ri = 0; | |
| 6897 int c; | |
| 6898 | |
| 6899 if (has_mbyte) | |
| 6900 { | |
| 6901 int prevc = 0; | |
| 6902 int *ip; | |
| 6903 | |
| 6904 /* The sl_sal_first[] table contains the translation for chars up to | |
| 6905 * 255, sl_sal the rest. */ | |
| 6906 for (s = inword; *s != NUL; ) | |
| 6907 { | |
| 474 | 6908 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
|
6909 if (enc_utf8 ? utf_class(c) == 0 : VIM_ISWHITE(c)) |
| 375 | 6910 c = ' '; |
| 6911 else if (c < 256) | |
| 6912 c = slang->sl_sal_first[c]; | |
| 6913 else | |
| 6914 { | |
| 6915 ip = ((int **)slang->sl_sal.ga_data)[c & 0xff]; | |
| 6916 if (ip == NULL) /* empty list, can't match */ | |
| 6917 c = NUL; | |
| 6918 else | |
| 6919 for (;;) /* find "c" in the list */ | |
| 6920 { | |
| 6921 if (*ip == 0) /* not found */ | |
| 6922 { | |
| 6923 c = NUL; | |
| 6924 break; | |
| 6925 } | |
| 6926 if (*ip == c) /* match! */ | |
| 6927 { | |
| 6928 c = ip[1]; | |
| 6929 break; | |
| 6930 } | |
| 6931 ip += 2; | |
| 6932 } | |
| 6933 } | |
| 6934 | |
| 6935 if (c != NUL && c != prevc) | |
| 6936 { | |
| 6937 ri += mb_char2bytes(c, res + ri); | |
| 6938 if (ri + MB_MAXBYTES > MAXWLEN) | |
| 6939 break; | |
| 6940 prevc = c; | |
| 6941 } | |
| 6942 } | |
| 6943 } | |
| 6944 else | |
| 6945 { | |
| 6946 /* The sl_sal_first[] table contains the translation. */ | |
| 6947 for (s = inword; (c = *s) != NUL; ++s) | |
| 6948 { | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
6949 if (VIM_ISWHITE(c)) |
| 375 | 6950 c = ' '; |
| 6951 else | |
| 6952 c = slang->sl_sal_first[c]; | |
| 6953 if (c != NUL && (ri == 0 || res[ri - 1] != c)) | |
| 6954 res[ri++] = c; | |
| 6955 } | |
| 6956 } | |
| 6957 | |
| 6958 res[ri] = NUL; | |
| 6959 } | |
| 6960 | |
| 6961 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
6962 spell_soundfold_sal(slang_T *slang, char_u *inword, char_u *res) |
| 323 | 6963 { |
| 344 | 6964 salitem_T *smp; |
| 323 | 6965 char_u word[MAXWLEN]; |
| 375 | 6966 char_u *s = inword; |
| 323 | 6967 char_u *t; |
| 344 | 6968 char_u *pf; |
| 323 | 6969 int i, j, z; |
| 344 | 6970 int reslen; |
| 323 | 6971 int n, k = 0; |
| 6972 int z0; | |
| 6973 int k0; | |
| 6974 int n0; | |
| 6975 int c; | |
| 6976 int pri; | |
| 6977 int p0 = -333; | |
| 6978 int c0; | |
| 6979 | |
| 324 | 6980 /* Remove accents, if wanted. We actually remove all non-word characters. |
| 375 | 6981 * But keep white space. We need a copy, the word may be changed here. */ |
| 323 | 6982 if (slang->sl_rem_accents) |
| 6983 { | |
| 6984 t = word; | |
| 375 | 6985 while (*s != NUL) |
| 323 | 6986 { |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
6987 if (VIM_ISWHITE(*s)) |
| 344 | 6988 { |
| 6989 *t++ = ' '; | |
| 6990 s = skipwhite(s); | |
| 6991 } | |
| 323 | 6992 else |
| 6993 { | |
| 5477 | 6994 if (spell_iswordp_nmw(s, curwin)) |
| 323 | 6995 *t++ = *s; |
| 6996 ++s; | |
| 6997 } | |
| 6998 } | |
| 6999 *t = NUL; | |
| 7000 } | |
| 7001 else | |
| 2768 | 7002 vim_strncpy(word, s, MAXWLEN - 1); |
| 323 | 7003 |
| 344 | 7004 smp = (salitem_T *)slang->sl_sal.ga_data; |
| 323 | 7005 |
| 7006 /* | |
| 7007 * This comes from Aspell phonet.cpp. Converted from C++ to C. | |
| 324 | 7008 * Changed to keep spaces. |
| 323 | 7009 */ |
| 344 | 7010 i = reslen = z = 0; |
| 323 | 7011 while ((c = word[i]) != NUL) |
| 7012 { | |
| 344 | 7013 /* Start with the first rule that has the character in the word. */ |
| 323 | 7014 n = slang->sl_sal_first[c]; |
| 7015 z0 = 0; | |
| 7016 | |
| 7017 if (n >= 0) | |
| 7018 { | |
| 7019 /* check all rules for the same letter */ | |
| 344 | 7020 for (; (s = smp[n].sm_lead)[0] == c; ++n) |
| 323 | 7021 { |
| 344 | 7022 /* Quickly skip entries that don't match the word. Most |
| 7023 * entries are less then three chars, optimize for that. */ | |
| 7024 k = smp[n].sm_leadlen; | |
| 7025 if (k > 1) | |
| 323 | 7026 { |
| 344 | 7027 if (word[i + 1] != s[1]) |
| 7028 continue; | |
| 7029 if (k > 2) | |
| 7030 { | |
| 7031 for (j = 2; j < k; ++j) | |
| 7032 if (word[i + j] != s[j]) | |
| 7033 break; | |
| 7034 if (j < k) | |
| 7035 continue; | |
| 7036 } | |
| 323 | 7037 } |
| 7038 | |
| 375 | 7039 if ((pf = smp[n].sm_oneof) != NULL) |
| 323 | 7040 { |
| 375 | 7041 /* Check for match with one of the chars in "sm_oneof". */ |
| 344 | 7042 while (*pf != NUL && *pf != word[i + k]) |
| 7043 ++pf; | |
| 7044 if (*pf == NUL) | |
| 7045 continue; | |
| 7046 ++k; | |
| 323 | 7047 } |
| 344 | 7048 s = smp[n].sm_rules; |
| 7049 pri = 5; /* default priority */ | |
| 323 | 7050 |
| 7051 p0 = *s; | |
| 7052 k0 = k; | |
| 7053 while (*s == '-' && k > 1) | |
| 7054 { | |
| 7055 k--; | |
| 7056 s++; | |
| 7057 } | |
| 7058 if (*s == '<') | |
| 7059 s++; | |
| 344 | 7060 if (VIM_ISDIGIT(*s)) |
| 323 | 7061 { |
| 7062 /* determine priority */ | |
| 7063 pri = *s - '0'; | |
| 7064 s++; | |
| 7065 } | |
| 7066 if (*s == '^' && *(s + 1) == '^') | |
| 7067 s++; | |
| 7068 | |
| 7069 if (*s == NUL | |
| 7070 || (*s == '^' | |
| 324 | 7071 && (i == 0 || !(word[i - 1] == ' ' |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7072 || spell_iswordp(word + i - 1, curwin))) |
| 323 | 7073 && (*(s + 1) != '$' |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7074 || (!spell_iswordp(word + i + k0, curwin)))) |
| 323 | 7075 || (*s == '$' && i > 0 |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7076 && spell_iswordp(word + i - 1, curwin) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7077 && (!spell_iswordp(word + i + k0, curwin)))) |
| 323 | 7078 { |
| 7079 /* search for followup rules, if: */ | |
| 7080 /* followup and k > 1 and NO '-' in searchstring */ | |
| 7081 c0 = word[i + k - 1]; | |
| 7082 n0 = slang->sl_sal_first[c0]; | |
| 7083 | |
| 7084 if (slang->sl_followup && k > 1 && n0 >= 0 | |
| 344 | 7085 && p0 != '-' && word[i + k] != NUL) |
| 323 | 7086 { |
| 7087 /* test follow-up rule for "word[i + k]" */ | |
| 344 | 7088 for ( ; (s = smp[n0].sm_lead)[0] == c0; ++n0) |
| 323 | 7089 { |
| 344 | 7090 /* Quickly skip entries that don't match the word. |
| 7091 * */ | |
| 7092 k0 = smp[n0].sm_leadlen; | |
| 7093 if (k0 > 1) | |
| 323 | 7094 { |
| 344 | 7095 if (word[i + k] != s[1]) |
| 7096 continue; | |
| 7097 if (k0 > 2) | |
| 7098 { | |
| 7099 pf = word + i + k + 1; | |
| 7100 for (j = 2; j < k0; ++j) | |
| 7101 if (*pf++ != s[j]) | |
| 7102 break; | |
| 7103 if (j < k0) | |
| 7104 continue; | |
| 7105 } | |
| 323 | 7106 } |
| 344 | 7107 k0 += k - 1; |
| 7108 | |
| 375 | 7109 if ((pf = smp[n0].sm_oneof) != NULL) |
| 323 | 7110 { |
| 344 | 7111 /* Check for match with one of the chars in |
| 375 | 7112 * "sm_oneof". */ |
| 344 | 7113 while (*pf != NUL && *pf != word[i + k0]) |
| 7114 ++pf; | |
| 7115 if (*pf == NUL) | |
| 7116 continue; | |
| 7117 ++k0; | |
| 323 | 7118 } |
| 344 | 7119 |
| 7120 p0 = 5; | |
| 7121 s = smp[n0].sm_rules; | |
| 323 | 7122 while (*s == '-') |
| 7123 { | |
| 344 | 7124 /* "k0" gets NOT reduced because |
| 7125 * "if (k0 == k)" */ | |
| 323 | 7126 s++; |
| 7127 } | |
| 7128 if (*s == '<') | |
| 7129 s++; | |
| 344 | 7130 if (VIM_ISDIGIT(*s)) |
| 323 | 7131 { |
| 7132 p0 = *s - '0'; | |
| 7133 s++; | |
| 7134 } | |
| 7135 | |
| 7136 if (*s == NUL | |
| 7137 /* *s == '^' cuts */ | |
| 7138 || (*s == '$' | |
| 376 | 7139 && !spell_iswordp(word + i + k0, |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7140 curwin))) |
| 323 | 7141 { |
| 7142 if (k0 == k) | |
| 7143 /* this is just a piece of the string */ | |
| 7144 continue; | |
| 7145 | |
| 7146 if (p0 < pri) | |
| 7147 /* priority too low */ | |
| 7148 continue; | |
| 7149 /* rule fits; stop search */ | |
| 7150 break; | |
| 7151 } | |
| 7152 } | |
| 7153 | |
| 344 | 7154 if (p0 >= pri && smp[n0].sm_lead[0] == c0) |
| 323 | 7155 continue; |
| 7156 } | |
| 7157 | |
| 7158 /* replace string */ | |
| 344 | 7159 s = smp[n].sm_to; |
| 389 | 7160 if (s == NULL) |
| 7161 s = (char_u *)""; | |
| 344 | 7162 pf = smp[n].sm_rules; |
| 7163 p0 = (vim_strchr(pf, '<') != NULL) ? 1 : 0; | |
| 323 | 7164 if (p0 == 1 && z == 0) |
| 7165 { | |
| 7166 /* rule with '<' is used */ | |
| 344 | 7167 if (reslen > 0 && *s != NUL && (res[reslen - 1] == c |
| 7168 || res[reslen - 1] == *s)) | |
| 7169 reslen--; | |
| 323 | 7170 z0 = 1; |
| 7171 z = 1; | |
| 7172 k0 = 0; | |
| 372 | 7173 while (*s != NUL && word[i + k0] != NUL) |
| 323 | 7174 { |
| 7175 word[i + k0] = *s; | |
| 7176 k0++; | |
| 7177 s++; | |
| 7178 } | |
| 7179 if (k > k0) | |
| 1619 | 7180 STRMOVE(word + i + k0, word + i + k); |
| 323 | 7181 |
| 7182 /* new "actual letter" */ | |
| 7183 c = word[i]; | |
| 7184 } | |
| 7185 else | |
| 7186 { | |
| 7187 /* no '<' rule used */ | |
| 7188 i += k - 1; | |
| 7189 z = 0; | |
| 344 | 7190 while (*s != NUL && s[1] != NUL && reslen < MAXWLEN) |
| 323 | 7191 { |
| 344 | 7192 if (reslen == 0 || res[reslen - 1] != *s) |
| 372 | 7193 res[reslen++] = *s; |
| 323 | 7194 s++; |
| 7195 } | |
| 7196 /* new "actual letter" */ | |
| 7197 c = *s; | |
| 344 | 7198 if (strstr((char *)pf, "^^") != NULL) |
| 323 | 7199 { |
| 7200 if (c != NUL) | |
| 372 | 7201 res[reslen++] = c; |
| 1619 | 7202 STRMOVE(word, word + i + 1); |
| 323 | 7203 i = 0; |
| 7204 z0 = 1; | |
| 7205 } | |
| 7206 } | |
| 7207 break; | |
| 7208 } | |
| 7209 } | |
| 7210 } | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
7211 else if (VIM_ISWHITE(c)) |
| 324 | 7212 { |
| 7213 c = ' '; | |
| 7214 k = 1; | |
| 7215 } | |
| 323 | 7216 |
| 7217 if (z0 == 0) | |
| 7218 { | |
| 344 | 7219 if (k && !p0 && reslen < MAXWLEN && c != NUL |
| 7220 && (!slang->sl_collapse || reslen == 0 | |
| 7221 || res[reslen - 1] != c)) | |
| 323 | 7222 /* condense only double letters */ |
| 372 | 7223 res[reslen++] = c; |
| 323 | 7224 |
| 7225 i++; | |
| 7226 z = 0; | |
| 7227 k = 0; | |
| 7228 } | |
| 7229 } | |
| 7230 | |
| 344 | 7231 res[reslen] = NUL; |
| 323 | 7232 } |
| 7233 | |
| 372 | 7234 /* |
| 7235 * Turn "inword" into its sound-a-like equivalent in "res[MAXWLEN]". | |
| 7236 * Multi-byte version of spell_soundfold(). | |
| 7237 */ | |
| 7238 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7239 spell_soundfold_wsal(slang_T *slang, char_u *inword, char_u *res) |
| 372 | 7240 { |
| 375 | 7241 salitem_T *smp = (salitem_T *)slang->sl_sal.ga_data; |
| 372 | 7242 int word[MAXWLEN]; |
| 7243 int wres[MAXWLEN]; | |
| 7244 int l; | |
| 7245 char_u *s; | |
| 7246 int *ws; | |
| 7247 char_u *t; | |
| 7248 int *pf; | |
| 7249 int i, j, z; | |
| 7250 int reslen; | |
| 7251 int n, k = 0; | |
| 7252 int z0; | |
| 7253 int k0; | |
| 7254 int n0; | |
| 7255 int c; | |
| 7256 int pri; | |
| 7257 int p0 = -333; | |
| 7258 int c0; | |
| 7259 int did_white = FALSE; | |
| 3520 | 7260 int wordlen; |
| 7261 | |
| 372 | 7262 |
| 7263 /* | |
| 7264 * Convert the multi-byte string to a wide-character string. | |
| 7265 * Remove accents, if wanted. We actually remove all non-word characters. | |
| 7266 * But keep white space. | |
| 7267 */ | |
| 3520 | 7268 wordlen = 0; |
| 372 | 7269 for (s = inword; *s != NUL; ) |
| 7270 { | |
| 7271 t = s; | |
| 474 | 7272 c = mb_cptr2char_adv(&s); |
| 372 | 7273 if (slang->sl_rem_accents) |
| 7274 { | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
7275 if (enc_utf8 ? utf_class(c) == 0 : VIM_ISWHITE(c)) |
| 372 | 7276 { |
| 7277 if (did_white) | |
| 7278 continue; | |
| 7279 c = ' '; | |
| 7280 did_white = TRUE; | |
| 7281 } | |
| 7282 else | |
| 7283 { | |
| 7284 did_white = FALSE; | |
| 5477 | 7285 if (!spell_iswordp_nmw(t, curwin)) |
| 372 | 7286 continue; |
| 7287 } | |
| 7288 } | |
| 3520 | 7289 word[wordlen++] = c; |
| 7290 } | |
| 7291 word[wordlen] = NUL; | |
| 372 | 7292 |
| 7293 /* | |
| 3520 | 7294 * This algorithm comes from Aspell phonet.cpp. |
| 372 | 7295 * Converted from C++ to C. Added support for multi-byte chars. |
| 7296 * Changed to keep spaces. | |
| 7297 */ | |
| 7298 i = reslen = z = 0; | |
| 7299 while ((c = word[i]) != NUL) | |
| 7300 { | |
| 7301 /* Start with the first rule that has the character in the word. */ | |
| 7302 n = slang->sl_sal_first[c & 0xff]; | |
| 7303 z0 = 0; | |
| 7304 | |
| 7305 if (n >= 0) | |
| 7306 { | |
|
2455
9367de3e2e1b
Fix: crash in spell checking with a 0x300 character.
Bram Moolenaar <bram@vim.org>
parents:
2454
diff
changeset
|
7307 /* 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
|
7308 * 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
|
7309 * (c & 0xff) is NUL. */ |
|
9367de3e2e1b
Fix: crash in spell checking with a 0x300 character.
Bram Moolenaar <bram@vim.org>
parents:
2454
diff
changeset
|
7310 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
|
7311 && ws[0] != NUL; ++n) |
| 372 | 7312 { |
| 7313 /* Quickly skip entries that don't match the word. Most | |
| 7314 * entries are less then three chars, optimize for that. */ | |
| 375 | 7315 if (c != ws[0]) |
| 7316 continue; | |
| 372 | 7317 k = smp[n].sm_leadlen; |
| 7318 if (k > 1) | |
| 7319 { | |
| 7320 if (word[i + 1] != ws[1]) | |
| 7321 continue; | |
| 7322 if (k > 2) | |
| 7323 { | |
| 7324 for (j = 2; j < k; ++j) | |
| 7325 if (word[i + j] != ws[j]) | |
| 7326 break; | |
| 7327 if (j < k) | |
| 7328 continue; | |
| 7329 } | |
| 7330 } | |
| 7331 | |
| 375 | 7332 if ((pf = smp[n].sm_oneof_w) != NULL) |
| 372 | 7333 { |
| 375 | 7334 /* Check for match with one of the chars in "sm_oneof". */ |
| 372 | 7335 while (*pf != NUL && *pf != word[i + k]) |
| 7336 ++pf; | |
| 7337 if (*pf == NUL) | |
| 7338 continue; | |
| 7339 ++k; | |
| 7340 } | |
| 7341 s = smp[n].sm_rules; | |
| 7342 pri = 5; /* default priority */ | |
| 7343 | |
| 7344 p0 = *s; | |
| 7345 k0 = k; | |
| 7346 while (*s == '-' && k > 1) | |
| 7347 { | |
| 7348 k--; | |
| 7349 s++; | |
| 7350 } | |
| 7351 if (*s == '<') | |
| 7352 s++; | |
| 7353 if (VIM_ISDIGIT(*s)) | |
| 7354 { | |
| 7355 /* determine priority */ | |
| 7356 pri = *s - '0'; | |
| 7357 s++; | |
| 7358 } | |
| 7359 if (*s == '^' && *(s + 1) == '^') | |
| 7360 s++; | |
| 7361 | |
| 7362 if (*s == NUL | |
| 7363 || (*s == '^' | |
| 7364 && (i == 0 || !(word[i - 1] == ' ' | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7365 || spell_iswordp_w(word + i - 1, curwin))) |
| 372 | 7366 && (*(s + 1) != '$' |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7367 || (!spell_iswordp_w(word + i + k0, curwin)))) |
| 372 | 7368 || (*s == '$' && i > 0 |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7369 && spell_iswordp_w(word + i - 1, curwin) |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7370 && (!spell_iswordp_w(word + i + k0, curwin)))) |
| 372 | 7371 { |
| 7372 /* search for followup rules, if: */ | |
| 7373 /* followup and k > 1 and NO '-' in searchstring */ | |
| 7374 c0 = word[i + k - 1]; | |
| 7375 n0 = slang->sl_sal_first[c0 & 0xff]; | |
| 7376 | |
| 7377 if (slang->sl_followup && k > 1 && n0 >= 0 | |
| 7378 && p0 != '-' && word[i + k] != NUL) | |
| 7379 { | |
| 375 | 7380 /* Test follow-up rule for "word[i + k]"; loop over |
| 7381 * all entries with the same index byte. */ | |
| 372 | 7382 for ( ; ((ws = smp[n0].sm_lead_w)[0] & 0xff) |
| 7383 == (c0 & 0xff); ++n0) | |
| 7384 { | |
| 7385 /* Quickly skip entries that don't match the word. | |
| 375 | 7386 */ |
| 7387 if (c0 != ws[0]) | |
| 7388 continue; | |
| 372 | 7389 k0 = smp[n0].sm_leadlen; |
| 7390 if (k0 > 1) | |
| 7391 { | |
| 7392 if (word[i + k] != ws[1]) | |
| 7393 continue; | |
| 7394 if (k0 > 2) | |
| 7395 { | |
| 7396 pf = word + i + k + 1; | |
| 7397 for (j = 2; j < k0; ++j) | |
| 7398 if (*pf++ != ws[j]) | |
| 7399 break; | |
| 7400 if (j < k0) | |
| 7401 continue; | |
| 7402 } | |
| 7403 } | |
| 7404 k0 += k - 1; | |
| 7405 | |
| 375 | 7406 if ((pf = smp[n0].sm_oneof_w) != NULL) |
| 372 | 7407 { |
| 7408 /* Check for match with one of the chars in | |
| 375 | 7409 * "sm_oneof". */ |
| 372 | 7410 while (*pf != NUL && *pf != word[i + k0]) |
| 7411 ++pf; | |
| 7412 if (*pf == NUL) | |
| 7413 continue; | |
| 7414 ++k0; | |
| 7415 } | |
| 7416 | |
| 7417 p0 = 5; | |
| 7418 s = smp[n0].sm_rules; | |
| 7419 while (*s == '-') | |
| 7420 { | |
| 7421 /* "k0" gets NOT reduced because | |
| 7422 * "if (k0 == k)" */ | |
| 7423 s++; | |
| 7424 } | |
| 7425 if (*s == '<') | |
| 7426 s++; | |
| 7427 if (VIM_ISDIGIT(*s)) | |
| 7428 { | |
| 7429 p0 = *s - '0'; | |
| 7430 s++; | |
| 7431 } | |
| 7432 | |
| 7433 if (*s == NUL | |
| 7434 /* *s == '^' cuts */ | |
| 7435 || (*s == '$' | |
| 376 | 7436 && !spell_iswordp_w(word + i + k0, |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
7437 curwin))) |
| 372 | 7438 { |
| 7439 if (k0 == k) | |
| 7440 /* this is just a piece of the string */ | |
| 7441 continue; | |
| 7442 | |
| 7443 if (p0 < pri) | |
| 7444 /* priority too low */ | |
| 7445 continue; | |
| 7446 /* rule fits; stop search */ | |
| 7447 break; | |
| 7448 } | |
| 7449 } | |
| 7450 | |
| 7451 if (p0 >= pri && (smp[n0].sm_lead_w[0] & 0xff) | |
| 7452 == (c0 & 0xff)) | |
| 7453 continue; | |
| 7454 } | |
| 7455 | |
| 7456 /* replace string */ | |
| 7457 ws = smp[n].sm_to_w; | |
| 7458 s = smp[n].sm_rules; | |
| 7459 p0 = (vim_strchr(s, '<') != NULL) ? 1 : 0; | |
| 7460 if (p0 == 1 && z == 0) | |
| 7461 { | |
| 7462 /* rule with '<' is used */ | |
| 389 | 7463 if (reslen > 0 && ws != NULL && *ws != NUL |
| 7464 && (wres[reslen - 1] == c | |
| 372 | 7465 || wres[reslen - 1] == *ws)) |
| 7466 reslen--; | |
| 7467 z0 = 1; | |
| 7468 z = 1; | |
| 7469 k0 = 0; | |
| 389 | 7470 if (ws != NULL) |
| 7471 while (*ws != NUL && word[i + k0] != NUL) | |
| 7472 { | |
| 7473 word[i + k0] = *ws; | |
| 7474 k0++; | |
| 7475 ws++; | |
| 7476 } | |
| 372 | 7477 if (k > k0) |
| 7478 mch_memmove(word + i + k0, word + i + k, | |
| 3520 | 7479 sizeof(int) * (wordlen - (i + k) + 1)); |
| 372 | 7480 |
| 7481 /* new "actual letter" */ | |
| 7482 c = word[i]; | |
| 7483 } | |
| 7484 else | |
| 7485 { | |
| 7486 /* no '<' rule used */ | |
| 7487 i += k - 1; | |
| 7488 z = 0; | |
| 389 | 7489 if (ws != NULL) |
| 7490 while (*ws != NUL && ws[1] != NUL | |
| 7491 && reslen < MAXWLEN) | |
| 7492 { | |
| 7493 if (reslen == 0 || wres[reslen - 1] != *ws) | |
| 7494 wres[reslen++] = *ws; | |
| 7495 ws++; | |
| 7496 } | |
| 372 | 7497 /* new "actual letter" */ |
| 389 | 7498 if (ws == NULL) |
| 7499 c = NUL; | |
| 7500 else | |
| 7501 c = *ws; | |
| 372 | 7502 if (strstr((char *)s, "^^") != NULL) |
| 7503 { | |
| 7504 if (c != NUL) | |
| 7505 wres[reslen++] = c; | |
| 7506 mch_memmove(word, word + i + 1, | |
| 3520 | 7507 sizeof(int) * (wordlen - (i + 1) + 1)); |
| 372 | 7508 i = 0; |
| 7509 z0 = 1; | |
| 7510 } | |
| 7511 } | |
| 7512 break; | |
| 7513 } | |
| 7514 } | |
| 7515 } | |
|
11129
f4ea50924c6d
patch 8.0.0452: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11127
diff
changeset
|
7516 else if (VIM_ISWHITE(c)) |
| 372 | 7517 { |
| 7518 c = ' '; | |
| 7519 k = 1; | |
| 7520 } | |
| 7521 | |
| 7522 if (z0 == 0) | |
| 7523 { | |
| 7524 if (k && !p0 && reslen < MAXWLEN && c != NUL | |
| 7525 && (!slang->sl_collapse || reslen == 0 | |
| 7526 || wres[reslen - 1] != c)) | |
| 7527 /* condense only double letters */ | |
| 7528 wres[reslen++] = c; | |
| 7529 | |
| 7530 i++; | |
| 7531 z = 0; | |
| 7532 k = 0; | |
| 7533 } | |
| 7534 } | |
| 7535 | |
| 7536 /* Convert wide characters in "wres" to a multi-byte string in "res". */ | |
| 7537 l = 0; | |
| 7538 for (n = 0; n < reslen; ++n) | |
| 7539 { | |
| 7540 l += mb_char2bytes(wres[n], res + l); | |
| 7541 if (l + MB_MAXBYTES > MAXWLEN) | |
| 7542 break; | |
| 7543 } | |
| 7544 res[l] = NUL; | |
| 7545 } | |
| 7546 | |
| 324 | 7547 /* |
| 344 | 7548 * Compute a score for two sound-a-like words. |
| 7549 * This permits up to two inserts/deletes/swaps/etc. to keep things fast. | |
| 7550 * Instead of a generic loop we write out the code. That keeps it fast by | |
| 7551 * avoiding checks that will not be possible. | |
| 7552 */ | |
| 7553 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7554 soundalike_score( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7555 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
|
7556 char_u *badstart) /* sound-folded bad word */ |
| 344 | 7557 { |
| 351 | 7558 char_u *goodsound = goodstart; |
| 7559 char_u *badsound = badstart; | |
| 7560 int goodlen; | |
| 7561 int badlen; | |
| 344 | 7562 int n; |
| 7563 char_u *pl, *ps; | |
| 7564 char_u *pl2, *ps2; | |
| 351 | 7565 int score = 0; |
| 7566 | |
|
2454
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7567 /* Adding/inserting "*" at the start (word starts with vowel) shouldn't be |
| 351 | 7568 * counted so much, vowels halfway the word aren't counted at all. */ |
| 7569 if ((*badsound == '*' || *goodsound == '*') && *badsound != *goodsound) | |
| 7570 { | |
|
2454
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7571 if ((badsound[0] == NUL && goodsound[1] == NUL) |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7572 || (goodsound[0] == NUL && badsound[1] == NUL)) |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7573 /* 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
|
7574 return SCORE_DEL; |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7575 if (badsound[0] == NUL || goodsound[0] == NUL) |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7576 /* more than two changes */ |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7577 return SCORE_MAXMAX; |
|
91fec91a522c
Fix: uninitialized memory access. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
7578 |
| 625 | 7579 if (badsound[1] == goodsound[1] |
| 7580 || (badsound[1] != NUL | |
| 7581 && goodsound[1] != NUL | |
| 7582 && badsound[2] == goodsound[2])) | |
| 7583 { | |
| 7584 /* handle like a substitute */ | |
| 7585 } | |
| 351 | 7586 else |
| 625 | 7587 { |
| 7588 score = 2 * SCORE_DEL / 3; | |
| 7589 if (*badsound == '*') | |
| 7590 ++badsound; | |
| 7591 else | |
| 7592 ++goodsound; | |
| 7593 } | |
| 351 | 7594 } |
| 7595 | |
| 835 | 7596 goodlen = (int)STRLEN(goodsound); |
| 7597 badlen = (int)STRLEN(badsound); | |
| 344 | 7598 |
| 1188 | 7599 /* Return quickly if the lengths are too different to be fixed by two |
| 344 | 7600 * changes. */ |
| 7601 n = goodlen - badlen; | |
| 7602 if (n < -2 || n > 2) | |
| 7603 return SCORE_MAXMAX; | |
| 7604 | |
| 7605 if (n > 0) | |
| 7606 { | |
| 351 | 7607 pl = goodsound; /* goodsound is longest */ |
| 344 | 7608 ps = badsound; |
| 7609 } | |
| 7610 else | |
| 7611 { | |
| 351 | 7612 pl = badsound; /* badsound is longest */ |
| 344 | 7613 ps = goodsound; |
| 7614 } | |
| 7615 | |
| 7616 /* Skip over the identical part. */ | |
| 7617 while (*pl == *ps && *pl != NUL) | |
| 7618 { | |
| 7619 ++pl; | |
| 7620 ++ps; | |
| 7621 } | |
| 7622 | |
| 7623 switch (n) | |
| 7624 { | |
| 7625 case -2: | |
| 7626 case 2: | |
| 7627 /* | |
| 7628 * Must delete two characters from "pl". | |
| 7629 */ | |
| 7630 ++pl; /* first delete */ | |
| 7631 while (*pl == *ps) | |
| 7632 { | |
| 7633 ++pl; | |
| 7634 ++ps; | |
| 7635 } | |
| 7636 /* strings must be equal after second delete */ | |
| 7637 if (STRCMP(pl + 1, ps) == 0) | |
| 351 | 7638 return score + SCORE_DEL * 2; |
| 344 | 7639 |
| 7640 /* Failed to compare. */ | |
| 7641 break; | |
| 7642 | |
| 7643 case -1: | |
| 7644 case 1: | |
| 7645 /* | |
| 7646 * Minimal one delete from "pl" required. | |
| 7647 */ | |
| 7648 | |
| 7649 /* 1: delete */ | |
| 7650 pl2 = pl + 1; | |
| 7651 ps2 = ps; | |
| 7652 while (*pl2 == *ps2) | |
| 7653 { | |
| 7654 if (*pl2 == NUL) /* reached the end */ | |
| 351 | 7655 return score + SCORE_DEL; |
| 344 | 7656 ++pl2; |
| 7657 ++ps2; | |
| 7658 } | |
| 7659 | |
| 7660 /* 2: delete then swap, then rest must be equal */ | |
| 7661 if (pl2[0] == ps2[1] && pl2[1] == ps2[0] | |
| 7662 && STRCMP(pl2 + 2, ps2 + 2) == 0) | |
| 351 | 7663 return score + SCORE_DEL + SCORE_SWAP; |
| 344 | 7664 |
| 7665 /* 3: delete then substitute, then the rest must be equal */ | |
| 7666 if (STRCMP(pl2 + 1, ps2 + 1) == 0) | |
| 351 | 7667 return score + SCORE_DEL + SCORE_SUBST; |
| 344 | 7668 |
| 7669 /* 4: first swap then delete */ | |
| 7670 if (pl[0] == ps[1] && pl[1] == ps[0]) | |
| 7671 { | |
| 7672 pl2 = pl + 2; /* swap, skip two chars */ | |
| 7673 ps2 = ps + 2; | |
| 7674 while (*pl2 == *ps2) | |
| 7675 { | |
| 7676 ++pl2; | |
| 7677 ++ps2; | |
| 7678 } | |
| 7679 /* delete a char and then strings must be equal */ | |
| 7680 if (STRCMP(pl2 + 1, ps2) == 0) | |
| 351 | 7681 return score + SCORE_SWAP + SCORE_DEL; |
| 344 | 7682 } |
| 7683 | |
| 7684 /* 5: first substitute then delete */ | |
| 7685 pl2 = pl + 1; /* substitute, skip one char */ | |
| 7686 ps2 = ps + 1; | |
| 7687 while (*pl2 == *ps2) | |
| 7688 { | |
| 7689 ++pl2; | |
| 7690 ++ps2; | |
| 7691 } | |
| 7692 /* delete a char and then strings must be equal */ | |
| 7693 if (STRCMP(pl2 + 1, ps2) == 0) | |
| 351 | 7694 return score + SCORE_SUBST + SCORE_DEL; |
| 344 | 7695 |
| 7696 /* Failed to compare. */ | |
| 7697 break; | |
| 7698 | |
| 7699 case 0: | |
| 7700 /* | |
| 1808 | 7701 * Lengths are equal, thus changes must result in same length: An |
| 344 | 7702 * insert is only possible in combination with a delete. |
| 7703 * 1: check if for identical strings | |
| 7704 */ | |
| 7705 if (*pl == NUL) | |
| 351 | 7706 return score; |
| 344 | 7707 |
| 7708 /* 2: swap */ | |
| 7709 if (pl[0] == ps[1] && pl[1] == ps[0]) | |
| 7710 { | |
| 7711 pl2 = pl + 2; /* swap, skip two chars */ | |
| 7712 ps2 = ps + 2; | |
| 7713 while (*pl2 == *ps2) | |
| 7714 { | |
| 7715 if (*pl2 == NUL) /* reached the end */ | |
| 351 | 7716 return score + SCORE_SWAP; |
| 344 | 7717 ++pl2; |
| 7718 ++ps2; | |
| 7719 } | |
| 7720 /* 3: swap and swap again */ | |
| 7721 if (pl2[0] == ps2[1] && pl2[1] == ps2[0] | |
| 7722 && STRCMP(pl2 + 2, ps2 + 2) == 0) | |
| 351 | 7723 return score + SCORE_SWAP + SCORE_SWAP; |
| 344 | 7724 |
| 7725 /* 4: swap and substitute */ | |
| 7726 if (STRCMP(pl2 + 1, ps2 + 1) == 0) | |
| 351 | 7727 return score + SCORE_SWAP + SCORE_SUBST; |
| 344 | 7728 } |
| 7729 | |
| 7730 /* 5: substitute */ | |
| 7731 pl2 = pl + 1; | |
| 7732 ps2 = ps + 1; | |
| 7733 while (*pl2 == *ps2) | |
| 7734 { | |
| 7735 if (*pl2 == NUL) /* reached the end */ | |
| 351 | 7736 return score + SCORE_SUBST; |
| 344 | 7737 ++pl2; |
| 7738 ++ps2; | |
| 7739 } | |
| 7740 | |
| 7741 /* 6: substitute and swap */ | |
| 7742 if (pl2[0] == ps2[1] && pl2[1] == ps2[0] | |
| 7743 && STRCMP(pl2 + 2, ps2 + 2) == 0) | |
| 351 | 7744 return score + SCORE_SUBST + SCORE_SWAP; |
| 344 | 7745 |
| 7746 /* 7: substitute and substitute */ | |
| 7747 if (STRCMP(pl2 + 1, ps2 + 1) == 0) | |
| 351 | 7748 return score + SCORE_SUBST + SCORE_SUBST; |
| 344 | 7749 |
| 7750 /* 8: insert then delete */ | |
| 7751 pl2 = pl; | |
| 7752 ps2 = ps + 1; | |
| 7753 while (*pl2 == *ps2) | |
| 7754 { | |
| 7755 ++pl2; | |
| 7756 ++ps2; | |
| 7757 } | |
| 7758 if (STRCMP(pl2 + 1, ps2) == 0) | |
| 351 | 7759 return score + SCORE_INS + SCORE_DEL; |
| 344 | 7760 |
| 7761 /* 9: delete then insert */ | |
| 7762 pl2 = pl + 1; | |
| 7763 ps2 = ps; | |
| 7764 while (*pl2 == *ps2) | |
| 7765 { | |
| 7766 ++pl2; | |
| 7767 ++ps2; | |
| 7768 } | |
| 7769 if (STRCMP(pl2, ps2 + 1) == 0) | |
| 351 | 7770 return score + SCORE_INS + SCORE_DEL; |
| 344 | 7771 |
| 7772 /* Failed to compare. */ | |
| 7773 break; | |
| 7774 } | |
| 7775 | |
| 7776 return SCORE_MAXMAX; | |
| 7777 } | |
| 324 | 7778 |
| 323 | 7779 /* |
| 7780 * Compute the "edit distance" to turn "badword" into "goodword". The less | |
| 344 | 7781 * deletes/inserts/substitutes/swaps are required the lower the score. |
| 324 | 7782 * |
| 485 | 7783 * The algorithm is described by Du and Chang, 1992. |
| 7784 * The implementation of the algorithm comes from Aspell editdist.cpp, | |
| 7785 * edit_distance(). It has been converted from C++ to C and modified to | |
| 7786 * support multi-byte characters. | |
| 323 | 7787 */ |
| 7788 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7789 spell_edit_score( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7790 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7791 char_u *badword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7792 char_u *goodword) |
| 323 | 7793 { |
| 7794 int *cnt; | |
| 1188 | 7795 int badlen, goodlen; /* lengths including NUL */ |
| 323 | 7796 int j, i; |
| 7797 int t; | |
| 7798 int bc, gc; | |
| 324 | 7799 int pbc, pgc; |
| 7800 char_u *p; | |
| 7801 int wbadword[MAXWLEN]; | |
| 7802 int wgoodword[MAXWLEN]; | |
| 7803 | |
| 7804 if (has_mbyte) | |
| 7805 { | |
| 7806 /* Get the characters from the multi-byte strings and put them in an | |
| 7807 * int array for easy access. */ | |
| 7808 for (p = badword, badlen = 0; *p != NUL; ) | |
| 474 | 7809 wbadword[badlen++] = mb_cptr2char_adv(&p); |
| 398 | 7810 wbadword[badlen++] = 0; |
| 324 | 7811 for (p = goodword, goodlen = 0; *p != NUL; ) |
| 474 | 7812 wgoodword[goodlen++] = mb_cptr2char_adv(&p); |
| 398 | 7813 wgoodword[goodlen++] = 0; |
| 324 | 7814 } |
| 7815 else | |
| 7816 { | |
| 835 | 7817 badlen = (int)STRLEN(badword) + 1; |
| 7818 goodlen = (int)STRLEN(goodword) + 1; | |
| 324 | 7819 } |
| 323 | 7820 |
| 7821 /* We use "cnt" as an array: CNT(badword_idx, goodword_idx). */ | |
| 7822 #define CNT(a, b) cnt[(a) + (b) * (badlen + 1)] | |
| 7823 cnt = (int *)lalloc((long_u)(sizeof(int) * (badlen + 1) * (goodlen + 1)), | |
| 7824 TRUE); | |
| 324 | 7825 if (cnt == NULL) |
| 7826 return 0; /* out of memory */ | |
| 323 | 7827 |
| 7828 CNT(0, 0) = 0; | |
| 7829 for (j = 1; j <= goodlen; ++j) | |
| 625 | 7830 CNT(0, j) = CNT(0, j - 1) + SCORE_INS; |
| 323 | 7831 |
| 7832 for (i = 1; i <= badlen; ++i) | |
| 7833 { | |
| 625 | 7834 CNT(i, 0) = CNT(i - 1, 0) + SCORE_DEL; |
| 323 | 7835 for (j = 1; j <= goodlen; ++j) |
| 7836 { | |
| 324 | 7837 if (has_mbyte) |
| 7838 { | |
| 7839 bc = wbadword[i - 1]; | |
| 7840 gc = wgoodword[j - 1]; | |
| 7841 } | |
| 7842 else | |
| 7843 { | |
| 7844 bc = badword[i - 1]; | |
| 7845 gc = goodword[j - 1]; | |
| 7846 } | |
| 323 | 7847 if (bc == gc) |
| 7848 CNT(i, j) = CNT(i - 1, j - 1); | |
| 7849 else | |
| 7850 { | |
| 7851 /* Use a better score when there is only a case difference. */ | |
| 324 | 7852 if (SPELL_TOFOLD(bc) == SPELL_TOFOLD(gc)) |
| 323 | 7853 CNT(i, j) = SCORE_ICASE + CNT(i - 1, j - 1); |
| 7854 else | |
| 625 | 7855 { |
| 7856 /* For a similar character use SCORE_SIMILAR. */ | |
| 7857 if (slang != NULL | |
| 7858 && slang->sl_has_map | |
| 7859 && similar_chars(slang, gc, bc)) | |
| 7860 CNT(i, j) = SCORE_SIMILAR + CNT(i - 1, j - 1); | |
| 7861 else | |
| 7862 CNT(i, j) = SCORE_SUBST + CNT(i - 1, j - 1); | |
| 7863 } | |
| 323 | 7864 |
| 324 | 7865 if (i > 1 && j > 1) |
| 323 | 7866 { |
| 324 | 7867 if (has_mbyte) |
| 7868 { | |
| 7869 pbc = wbadword[i - 2]; | |
| 7870 pgc = wgoodword[j - 2]; | |
| 7871 } | |
| 7872 else | |
| 7873 { | |
| 7874 pbc = badword[i - 2]; | |
| 7875 pgc = goodword[j - 2]; | |
| 7876 } | |
| 7877 if (bc == pgc && pbc == gc) | |
| 7878 { | |
| 7879 t = SCORE_SWAP + CNT(i - 2, j - 2); | |
| 7880 if (t < CNT(i, j)) | |
| 7881 CNT(i, j) = t; | |
| 7882 } | |
| 323 | 7883 } |
| 7884 t = SCORE_DEL + CNT(i - 1, j); | |
| 7885 if (t < CNT(i, j)) | |
| 7886 CNT(i, j) = t; | |
| 7887 t = SCORE_INS + CNT(i, j - 1); | |
| 7888 if (t < CNT(i, j)) | |
| 7889 CNT(i, j) = t; | |
| 7890 } | |
| 7891 } | |
| 7892 } | |
| 344 | 7893 |
| 7894 i = CNT(badlen - 1, goodlen - 1); | |
| 7895 vim_free(cnt); | |
| 7896 return i; | |
| 323 | 7897 } |
| 307 | 7898 |
| 625 | 7899 typedef struct |
| 7900 { | |
| 7901 int badi; | |
| 7902 int goodi; | |
| 7903 int score; | |
| 7904 } limitscore_T; | |
| 7905 | |
| 7906 /* | |
| 7907 * Like spell_edit_score(), but with a limit on the score to make it faster. | |
| 7908 * May return SCORE_MAXMAX when the score is higher than "limit". | |
| 7909 * | |
| 7910 * This uses a stack for the edits still to be tried. | |
| 7911 * The idea comes from Aspell leditdist.cpp. Rewritten in C and added support | |
| 7912 * for multi-byte characters. | |
| 7913 */ | |
| 7914 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7915 spell_edit_score_limit( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7916 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7917 char_u *badword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7918 char_u *goodword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
7919 int limit) |
| 625 | 7920 { |
| 7921 limitscore_T stack[10]; /* allow for over 3 * 2 edits */ | |
| 7922 int stackidx; | |
| 7923 int bi, gi; | |
| 7924 int bi2, gi2; | |
| 7925 int bc, gc; | |
| 7926 int score; | |
| 7927 int score_off; | |
| 7928 int minscore; | |
| 7929 int round; | |
| 7930 | |
| 7931 /* Multi-byte characters require a bit more work, use a different function | |
| 7932 * to avoid testing "has_mbyte" quite often. */ | |
| 7933 if (has_mbyte) | |
| 7934 return spell_edit_score_limit_w(slang, badword, goodword, limit); | |
| 7935 | |
| 7936 /* | |
| 7937 * The idea is to go from start to end over the words. So long as | |
| 7938 * characters are equal just continue, this always gives the lowest score. | |
| 7939 * When there is a difference try several alternatives. Each alternative | |
| 7940 * increases "score" for the edit distance. Some of the alternatives are | |
| 7941 * pushed unto a stack and tried later, some are tried right away. At the | |
| 7942 * end of the word the score for one alternative is known. The lowest | |
| 7943 * possible score is stored in "minscore". | |
| 7944 */ | |
| 7945 stackidx = 0; | |
| 7946 bi = 0; | |
| 7947 gi = 0; | |
| 7948 score = 0; | |
| 7949 minscore = limit + 1; | |
| 7950 | |
| 7951 for (;;) | |
| 7952 { | |
| 7953 /* Skip over an equal part, score remains the same. */ | |
| 7954 for (;;) | |
| 7955 { | |
| 7956 bc = badword[bi]; | |
| 7957 gc = goodword[gi]; | |
| 7958 if (bc != gc) /* stop at a char that's different */ | |
| 7959 break; | |
| 7960 if (bc == NUL) /* both words end */ | |
| 7961 { | |
| 7962 if (score < minscore) | |
| 7963 minscore = score; | |
| 7964 goto pop; /* do next alternative */ | |
| 7965 } | |
| 7966 ++bi; | |
| 7967 ++gi; | |
| 7968 } | |
| 7969 | |
| 7970 if (gc == NUL) /* goodword ends, delete badword chars */ | |
| 7971 { | |
| 7972 do | |
| 7973 { | |
| 7974 if ((score += SCORE_DEL) >= minscore) | |
| 7975 goto pop; /* do next alternative */ | |
| 7976 } while (badword[++bi] != NUL); | |
| 7977 minscore = score; | |
| 7978 } | |
| 7979 else if (bc == NUL) /* badword ends, insert badword chars */ | |
| 7980 { | |
| 7981 do | |
| 7982 { | |
| 7983 if ((score += SCORE_INS) >= minscore) | |
| 7984 goto pop; /* do next alternative */ | |
| 7985 } while (goodword[++gi] != NUL); | |
| 7986 minscore = score; | |
| 7987 } | |
| 7988 else /* both words continue */ | |
| 7989 { | |
| 7990 /* If not close to the limit, perform a change. Only try changes | |
| 7991 * that may lead to a lower score than "minscore". | |
| 7992 * round 0: try deleting a char from badword | |
| 7993 * round 1: try inserting a char in badword */ | |
| 7994 for (round = 0; round <= 1; ++round) | |
| 7995 { | |
| 7996 score_off = score + (round == 0 ? SCORE_DEL : SCORE_INS); | |
| 7997 if (score_off < minscore) | |
| 7998 { | |
| 7999 if (score_off + SCORE_EDIT_MIN >= minscore) | |
| 8000 { | |
| 8001 /* Near the limit, rest of the words must match. We | |
| 8002 * can check that right now, no need to push an item | |
| 8003 * onto the stack. */ | |
| 8004 bi2 = bi + 1 - round; | |
| 8005 gi2 = gi + round; | |
| 8006 while (goodword[gi2] == badword[bi2]) | |
| 8007 { | |
| 8008 if (goodword[gi2] == NUL) | |
| 8009 { | |
| 8010 minscore = score_off; | |
| 8011 break; | |
| 8012 } | |
| 8013 ++bi2; | |
| 8014 ++gi2; | |
| 8015 } | |
| 8016 } | |
| 8017 else | |
| 8018 { | |
| 8019 /* try deleting/inserting a character later */ | |
| 8020 stack[stackidx].badi = bi + 1 - round; | |
| 8021 stack[stackidx].goodi = gi + round; | |
| 8022 stack[stackidx].score = score_off; | |
| 8023 ++stackidx; | |
| 8024 } | |
| 8025 } | |
| 8026 } | |
| 8027 | |
| 8028 if (score + SCORE_SWAP < minscore) | |
| 8029 { | |
| 8030 /* If swapping two characters makes a match then the | |
| 8031 * substitution is more expensive, thus there is no need to | |
| 8032 * try both. */ | |
| 8033 if (gc == badword[bi + 1] && bc == goodword[gi + 1]) | |
| 8034 { | |
| 8035 /* Swap two characters, that is: skip them. */ | |
| 8036 gi += 2; | |
| 8037 bi += 2; | |
| 8038 score += SCORE_SWAP; | |
| 8039 continue; | |
| 8040 } | |
| 8041 } | |
| 8042 | |
| 8043 /* Substitute one character for another which is the same | |
| 8044 * thing as deleting a character from both goodword and badword. | |
| 8045 * Use a better score when there is only a case difference. */ | |
| 8046 if (SPELL_TOFOLD(bc) == SPELL_TOFOLD(gc)) | |
| 8047 score += SCORE_ICASE; | |
| 8048 else | |
| 8049 { | |
| 8050 /* For a similar character use SCORE_SIMILAR. */ | |
| 8051 if (slang != NULL | |
| 8052 && slang->sl_has_map | |
| 8053 && similar_chars(slang, gc, bc)) | |
| 8054 score += SCORE_SIMILAR; | |
| 8055 else | |
| 8056 score += SCORE_SUBST; | |
| 8057 } | |
| 8058 | |
| 8059 if (score < minscore) | |
| 8060 { | |
| 8061 /* Do the substitution. */ | |
| 8062 ++gi; | |
| 8063 ++bi; | |
| 8064 continue; | |
| 8065 } | |
| 8066 } | |
| 8067 pop: | |
| 8068 /* | |
| 8069 * Get here to try the next alternative, pop it from the stack. | |
| 8070 */ | |
| 8071 if (stackidx == 0) /* stack is empty, finished */ | |
| 8072 break; | |
| 8073 | |
| 8074 /* pop an item from the stack */ | |
| 8075 --stackidx; | |
| 8076 gi = stack[stackidx].goodi; | |
| 8077 bi = stack[stackidx].badi; | |
| 8078 score = stack[stackidx].score; | |
| 8079 } | |
| 8080 | |
| 8081 /* When the score goes over "limit" it may actually be much higher. | |
| 8082 * Return a very large number to avoid going below the limit when giving a | |
| 8083 * bonus. */ | |
| 8084 if (minscore > limit) | |
| 8085 return SCORE_MAXMAX; | |
| 8086 return minscore; | |
| 8087 } | |
| 8088 | |
| 8089 /* | |
| 8090 * Multi-byte version of spell_edit_score_limit(). | |
| 8091 * Keep it in sync with the above! | |
| 8092 */ | |
| 8093 static int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8094 spell_edit_score_limit_w( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8095 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8096 char_u *badword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8097 char_u *goodword, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8098 int limit) |
| 625 | 8099 { |
| 8100 limitscore_T stack[10]; /* allow for over 3 * 2 edits */ | |
| 8101 int stackidx; | |
| 8102 int bi, gi; | |
| 8103 int bi2, gi2; | |
| 8104 int bc, gc; | |
| 8105 int score; | |
| 8106 int score_off; | |
| 8107 int minscore; | |
| 8108 int round; | |
| 8109 char_u *p; | |
| 8110 int wbadword[MAXWLEN]; | |
| 8111 int wgoodword[MAXWLEN]; | |
| 8112 | |
| 8113 /* Get the characters from the multi-byte strings and put them in an | |
| 8114 * int array for easy access. */ | |
| 8115 bi = 0; | |
| 8116 for (p = badword; *p != NUL; ) | |
| 8117 wbadword[bi++] = mb_cptr2char_adv(&p); | |
| 8118 wbadword[bi++] = 0; | |
| 8119 gi = 0; | |
| 8120 for (p = goodword; *p != NUL; ) | |
| 8121 wgoodword[gi++] = mb_cptr2char_adv(&p); | |
| 8122 wgoodword[gi++] = 0; | |
| 8123 | |
| 8124 /* | |
| 8125 * The idea is to go from start to end over the words. So long as | |
| 8126 * characters are equal just continue, this always gives the lowest score. | |
| 8127 * When there is a difference try several alternatives. Each alternative | |
| 8128 * increases "score" for the edit distance. Some of the alternatives are | |
| 8129 * pushed unto a stack and tried later, some are tried right away. At the | |
| 8130 * end of the word the score for one alternative is known. The lowest | |
| 8131 * possible score is stored in "minscore". | |
| 8132 */ | |
| 8133 stackidx = 0; | |
| 8134 bi = 0; | |
| 8135 gi = 0; | |
| 8136 score = 0; | |
| 8137 minscore = limit + 1; | |
| 8138 | |
| 8139 for (;;) | |
| 8140 { | |
| 8141 /* Skip over an equal part, score remains the same. */ | |
| 8142 for (;;) | |
| 8143 { | |
| 8144 bc = wbadword[bi]; | |
| 8145 gc = wgoodword[gi]; | |
| 8146 | |
| 8147 if (bc != gc) /* stop at a char that's different */ | |
| 8148 break; | |
| 8149 if (bc == NUL) /* both words end */ | |
| 8150 { | |
| 8151 if (score < minscore) | |
| 8152 minscore = score; | |
| 8153 goto pop; /* do next alternative */ | |
| 8154 } | |
| 8155 ++bi; | |
| 8156 ++gi; | |
| 8157 } | |
| 8158 | |
| 8159 if (gc == NUL) /* goodword ends, delete badword chars */ | |
| 8160 { | |
| 8161 do | |
| 8162 { | |
| 8163 if ((score += SCORE_DEL) >= minscore) | |
| 8164 goto pop; /* do next alternative */ | |
| 8165 } while (wbadword[++bi] != NUL); | |
| 8166 minscore = score; | |
| 8167 } | |
| 8168 else if (bc == NUL) /* badword ends, insert badword chars */ | |
| 8169 { | |
| 8170 do | |
| 8171 { | |
| 8172 if ((score += SCORE_INS) >= minscore) | |
| 8173 goto pop; /* do next alternative */ | |
| 8174 } while (wgoodword[++gi] != NUL); | |
| 8175 minscore = score; | |
| 8176 } | |
| 8177 else /* both words continue */ | |
| 8178 { | |
| 8179 /* If not close to the limit, perform a change. Only try changes | |
| 8180 * that may lead to a lower score than "minscore". | |
| 8181 * round 0: try deleting a char from badword | |
| 8182 * round 1: try inserting a char in badword */ | |
| 8183 for (round = 0; round <= 1; ++round) | |
| 8184 { | |
| 8185 score_off = score + (round == 0 ? SCORE_DEL : SCORE_INS); | |
| 8186 if (score_off < minscore) | |
| 8187 { | |
| 8188 if (score_off + SCORE_EDIT_MIN >= minscore) | |
| 8189 { | |
| 8190 /* Near the limit, rest of the words must match. We | |
| 8191 * can check that right now, no need to push an item | |
| 8192 * onto the stack. */ | |
| 8193 bi2 = bi + 1 - round; | |
| 8194 gi2 = gi + round; | |
| 8195 while (wgoodword[gi2] == wbadword[bi2]) | |
| 8196 { | |
| 8197 if (wgoodword[gi2] == NUL) | |
| 8198 { | |
| 8199 minscore = score_off; | |
| 8200 break; | |
| 8201 } | |
| 8202 ++bi2; | |
| 8203 ++gi2; | |
| 8204 } | |
| 8205 } | |
| 8206 else | |
| 8207 { | |
| 8208 /* try deleting a character from badword later */ | |
| 8209 stack[stackidx].badi = bi + 1 - round; | |
| 8210 stack[stackidx].goodi = gi + round; | |
| 8211 stack[stackidx].score = score_off; | |
| 8212 ++stackidx; | |
| 8213 } | |
| 8214 } | |
| 8215 } | |
| 8216 | |
| 8217 if (score + SCORE_SWAP < minscore) | |
| 8218 { | |
| 8219 /* If swapping two characters makes a match then the | |
| 8220 * substitution is more expensive, thus there is no need to | |
| 8221 * try both. */ | |
| 8222 if (gc == wbadword[bi + 1] && bc == wgoodword[gi + 1]) | |
| 8223 { | |
| 8224 /* Swap two characters, that is: skip them. */ | |
| 8225 gi += 2; | |
| 8226 bi += 2; | |
| 8227 score += SCORE_SWAP; | |
| 8228 continue; | |
| 8229 } | |
| 8230 } | |
| 8231 | |
| 8232 /* Substitute one character for another which is the same | |
| 8233 * thing as deleting a character from both goodword and badword. | |
| 8234 * Use a better score when there is only a case difference. */ | |
| 8235 if (SPELL_TOFOLD(bc) == SPELL_TOFOLD(gc)) | |
| 8236 score += SCORE_ICASE; | |
| 8237 else | |
| 8238 { | |
| 8239 /* For a similar character use SCORE_SIMILAR. */ | |
| 8240 if (slang != NULL | |
| 8241 && slang->sl_has_map | |
| 8242 && similar_chars(slang, gc, bc)) | |
| 8243 score += SCORE_SIMILAR; | |
| 8244 else | |
| 8245 score += SCORE_SUBST; | |
| 8246 } | |
| 8247 | |
| 8248 if (score < minscore) | |
| 8249 { | |
| 8250 /* Do the substitution. */ | |
| 8251 ++gi; | |
| 8252 ++bi; | |
| 8253 continue; | |
| 8254 } | |
| 8255 } | |
| 8256 pop: | |
| 8257 /* | |
| 8258 * Get here to try the next alternative, pop it from the stack. | |
| 8259 */ | |
| 8260 if (stackidx == 0) /* stack is empty, finished */ | |
| 8261 break; | |
| 8262 | |
| 8263 /* pop an item from the stack */ | |
| 8264 --stackidx; | |
| 8265 gi = stack[stackidx].goodi; | |
| 8266 bi = stack[stackidx].badi; | |
| 8267 score = stack[stackidx].score; | |
| 8268 } | |
| 8269 | |
| 8270 /* When the score goes over "limit" it may actually be much higher. | |
| 8271 * Return a very large number to avoid going below the limit when giving a | |
| 8272 * bonus. */ | |
| 8273 if (minscore > limit) | |
| 8274 return SCORE_MAXMAX; | |
| 8275 return minscore; | |
| 8276 } | |
| 8277 | |
| 714 | 8278 /* |
| 8279 * ":spellinfo" | |
| 8280 */ | |
| 8281 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8282 ex_spellinfo(exarg_T *eap UNUSED) |
| 714 | 8283 { |
| 8284 int lpi; | |
| 8285 langp_T *lp; | |
| 8286 char_u *p; | |
| 8287 | |
| 8288 if (no_spell_checking(curwin)) | |
| 8289 return; | |
| 8290 | |
| 8291 msg_start(); | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8292 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
|
8293 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8294 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
|
15543
dd725a8ab112
patch 8.1.0779: argument for message functions is inconsistent
Bram Moolenaar <Bram@vim.org>
parents:
15470
diff
changeset
|
8295 msg_puts("file: "); |
|
dd725a8ab112
patch 8.1.0779: argument for message functions is inconsistent
Bram Moolenaar <Bram@vim.org>
parents:
15470
diff
changeset
|
8296 msg_puts((char *)lp->lp_slang->sl_fname); |
| 714 | 8297 msg_putchar('\n'); |
| 8298 p = lp->lp_slang->sl_info; | |
| 8299 if (p != NULL) | |
| 8300 { | |
|
15543
dd725a8ab112
patch 8.1.0779: argument for message functions is inconsistent
Bram Moolenaar <Bram@vim.org>
parents:
15470
diff
changeset
|
8301 msg_puts((char *)p); |
| 714 | 8302 msg_putchar('\n'); |
| 8303 } | |
| 8304 } | |
| 8305 msg_end(); | |
| 8306 } | |
| 8307 | |
| 625 | 8308 #define DUMPFLAG_KEEPCASE 1 /* round 2: keep-case tree */ |
| 8309 #define DUMPFLAG_COUNT 2 /* include word count */ | |
| 701 | 8310 #define DUMPFLAG_ICASE 4 /* ignore case when finding matches */ |
| 710 | 8311 #define DUMPFLAG_ONECAP 8 /* pattern starts with capital */ |
| 8312 #define DUMPFLAG_ALLCAP 16 /* pattern is all capitals */ | |
| 625 | 8313 |
| 351 | 8314 /* |
| 8315 * ":spelldump" | |
| 8316 */ | |
| 8317 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8318 ex_spelldump(exarg_T *eap) |
| 351 | 8319 { |
| 5382 | 8320 char_u *spl; |
| 8321 long dummy; | |
| 8322 | |
| 701 | 8323 if (no_spell_checking(curwin)) |
| 8324 return; | |
| 5382 | 8325 get_option_value((char_u*)"spl", &dummy, &spl, OPT_LOCAL); |
| 8326 | |
| 8327 /* Create a new empty buffer in a new window. */ | |
| 701 | 8328 do_cmdline_cmd((char_u *)"new"); |
| 5382 | 8329 |
| 8330 /* enable spelling locally in the new window */ | |
| 8331 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
|
8332 set_option_value((char_u*)"spl", dummy, spl, OPT_LOCAL); |
| 5382 | 8333 vim_free(spl); |
| 8334 | |
|
11121
778c10516955
patch 8.0.0448: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
10950
diff
changeset
|
8335 if (!BUFEMPTY()) |
| 701 | 8336 return; |
| 8337 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8338 spell_dump_compl(NULL, 0, NULL, eap->forceit ? DUMPFLAG_COUNT : 0); |
| 701 | 8339 |
| 8340 /* Delete the empty line that we started with. */ | |
| 8341 if (curbuf->b_ml.ml_line_count > 1) | |
| 8342 ml_delete(curbuf->b_ml.ml_line_count, FALSE); | |
| 8343 | |
| 8344 redraw_later(NOT_VALID); | |
| 8345 } | |
| 8346 | |
| 8347 /* | |
| 8348 * Go through all possible words and: | |
| 8349 * 1. When "pat" is NULL: dump a list of all words in the current buffer. | |
| 8350 * "ic" and "dir" are not used. | |
| 8351 * 2. When "pat" is not NULL: add matching words to insert mode completion. | |
| 8352 */ | |
| 8353 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8354 spell_dump_compl( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8355 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
|
8356 int ic, /* ignore case */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8357 int *dir, /* direction for adding matches */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8358 int dumpflags_arg) /* DUMPFLAG_* */ |
| 701 | 8359 { |
| 351 | 8360 langp_T *lp; |
| 8361 slang_T *slang; | |
| 8362 idx_T arridx[MAXWLEN]; | |
| 8363 int curi[MAXWLEN]; | |
| 8364 char_u word[MAXWLEN]; | |
| 8365 int c; | |
| 8366 char_u *byts; | |
| 8367 idx_T *idxs; | |
| 8368 linenr_T lnum = 0; | |
| 8369 int round; | |
| 8370 int depth; | |
| 8371 int n; | |
| 8372 int flags; | |
| 381 | 8373 char_u *region_names = NULL; /* region names being used */ |
| 8374 int do_region = TRUE; /* dump region names and numbers */ | |
| 8375 char_u *p; | |
| 500 | 8376 int lpi; |
| 701 | 8377 int dumpflags = dumpflags_arg; |
| 8378 int patlen; | |
| 8379 | |
| 710 | 8380 /* When ignoring case or when the pattern starts with capital pass this on |
| 8381 * to dump_word(). */ | |
| 8382 if (pat != NULL) | |
| 8383 { | |
| 8384 if (ic) | |
| 8385 dumpflags |= DUMPFLAG_ICASE; | |
| 8386 else | |
| 8387 { | |
| 8388 n = captype(pat, NULL); | |
| 8389 if (n == WF_ONECAP) | |
| 8390 dumpflags |= DUMPFLAG_ONECAP; | |
|
15605
62b3805506b3
patch 8.1.0810: too many #ifdefs
Bram Moolenaar <Bram@vim.org>
parents:
15543
diff
changeset
|
8391 else if (n == WF_ALLCAP && (int)STRLEN(pat) > mb_ptr2len(pat)) |
| 710 | 8392 dumpflags |= DUMPFLAG_ALLCAP; |
| 8393 } | |
| 8394 } | |
| 351 | 8395 |
| 381 | 8396 /* Find out if we can support regions: All languages must support the same |
| 8397 * regions or none at all. */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8398 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
|
8399 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8400 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 381 | 8401 p = lp->lp_slang->sl_regions; |
| 8402 if (p[0] != 0) | |
| 8403 { | |
| 8404 if (region_names == NULL) /* first language with regions */ | |
| 8405 region_names = p; | |
| 8406 else if (STRCMP(region_names, p) != 0) | |
| 8407 { | |
| 8408 do_region = FALSE; /* region names are different */ | |
| 8409 break; | |
| 8410 } | |
| 8411 } | |
| 8412 } | |
| 8413 | |
| 8414 if (do_region && region_names != NULL) | |
| 8415 { | |
| 701 | 8416 if (pat == NULL) |
| 8417 { | |
| 8418 vim_snprintf((char *)IObuff, IOSIZE, "/regions=%s", region_names); | |
| 8419 ml_append(lnum++, IObuff, (colnr_T)0, FALSE); | |
| 8420 } | |
| 381 | 8421 } |
| 8422 else | |
| 8423 do_region = FALSE; | |
| 8424 | |
| 8425 /* | |
| 8426 * Loop over all files loaded for the entries in 'spelllang'. | |
| 8427 */ | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8428 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
|
8429 { |
|
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8430 lp = LANGP_ENTRY(curwin->w_s->b_langp, lpi); |
| 351 | 8431 slang = lp->lp_slang; |
| 500 | 8432 if (slang->sl_fbyts == NULL) /* reloading failed */ |
| 8433 continue; | |
| 351 | 8434 |
| 701 | 8435 if (pat == NULL) |
| 8436 { | |
| 8437 vim_snprintf((char *)IObuff, IOSIZE, "# file: %s", slang->sl_fname); | |
| 8438 ml_append(lnum++, IObuff, (colnr_T)0, FALSE); | |
| 8439 } | |
| 8440 | |
| 8441 /* When matching with a pattern and there are no prefixes only use | |
| 8442 * parts of the tree that match "pat". */ | |
| 8443 if (pat != NULL && slang->sl_pbyts == NULL) | |
| 835 | 8444 patlen = (int)STRLEN(pat); |
| 701 | 8445 else |
| 840 | 8446 patlen = -1; |
| 351 | 8447 |
| 8448 /* round 1: case-folded tree | |
| 8449 * round 2: keep-case tree */ | |
| 8450 for (round = 1; round <= 2; ++round) | |
| 8451 { | |
| 8452 if (round == 1) | |
| 8453 { | |
| 701 | 8454 dumpflags &= ~DUMPFLAG_KEEPCASE; |
| 351 | 8455 byts = slang->sl_fbyts; |
| 8456 idxs = slang->sl_fidxs; | |
| 8457 } | |
| 8458 else | |
| 8459 { | |
| 701 | 8460 dumpflags |= DUMPFLAG_KEEPCASE; |
| 351 | 8461 byts = slang->sl_kbyts; |
| 8462 idxs = slang->sl_kidxs; | |
| 8463 } | |
| 8464 if (byts == NULL) | |
| 8465 continue; /* array is empty */ | |
| 8466 | |
| 8467 depth = 0; | |
| 8468 arridx[0] = 0; | |
| 8469 curi[0] = 1; | |
| 701 | 8470 while (depth >= 0 && !got_int |
|
16142
570a296aa0b4
patch 8.1.1076: file for Insert mode is much too big
Bram Moolenaar <Bram@vim.org>
parents:
15636
diff
changeset
|
8471 && (pat == NULL || !ins_compl_interrupted())) |
| 351 | 8472 { |
| 8473 if (curi[depth] > byts[arridx[depth]]) | |
| 8474 { | |
| 8475 /* Done all bytes at this node, go up one level. */ | |
| 8476 --depth; | |
| 8477 line_breakcheck(); | |
|
10277
154d5a2e7395
commit https://github.com/vim/vim/commit/472e85970ee3a80abd824bef510df12e9cfe9e96
Christian Brabandt <cb@256bit.org>
parents:
10042
diff
changeset
|
8478 ins_compl_check_keys(50, FALSE); |
| 351 | 8479 } |
| 8480 else | |
| 8481 { | |
| 8482 /* Do one more byte at this node. */ | |
| 8483 n = arridx[depth] + curi[depth]; | |
| 8484 ++curi[depth]; | |
| 8485 c = byts[n]; | |
| 8486 if (c == 0) | |
| 8487 { | |
| 8488 /* End of word, deal with the word. | |
| 8489 * Don't use keep-case words in the fold-case tree, | |
| 8490 * they will appear in the keep-case tree. | |
| 8491 * Only use the word when the region matches. */ | |
| 8492 flags = (int)idxs[n]; | |
| 8493 if ((round == 2 || (flags & WF_KEEPCAP) == 0) | |
| 500 | 8494 && (flags & WF_NEEDCOMP) == 0 |
| 381 | 8495 && (do_region |
| 8496 || (flags & WF_REGION) == 0 | |
| 390 | 8497 || (((unsigned)flags >> 16) |
| 351 | 8498 & lp->lp_region) != 0)) |
| 8499 { | |
| 8500 word[depth] = NUL; | |
| 381 | 8501 if (!do_region) |
| 8502 flags &= ~WF_REGION; | |
| 355 | 8503 |
| 8504 /* Dump the basic word if there is no prefix or | |
| 8505 * when it's the first one. */ | |
| 390 | 8506 c = (unsigned)flags >> 24; |
| 355 | 8507 if (c == 0 || curi[depth] == 2) |
| 701 | 8508 { |
| 8509 dump_word(slang, word, pat, dir, | |
| 8510 dumpflags, flags, lnum); | |
| 8511 if (pat == NULL) | |
| 8512 ++lnum; | |
| 8513 } | |
| 351 | 8514 |
| 8515 /* Apply the prefix, if there is one. */ | |
| 355 | 8516 if (c != 0) |
| 701 | 8517 lnum = dump_prefixes(slang, word, pat, dir, |
| 8518 dumpflags, flags, lnum); | |
| 351 | 8519 } |
| 8520 } | |
| 8521 else | |
| 8522 { | |
| 8523 /* Normal char, go one level deeper. */ | |
| 8524 word[depth++] = c; | |
| 8525 arridx[depth] = idxs[n]; | |
| 8526 curi[depth] = 1; | |
| 701 | 8527 |
| 8528 /* Check if this characters matches with the pattern. | |
| 8529 * If not skip the whole tree below it. | |
| 710 | 8530 * Always ignore case here, dump_word() will check |
| 8531 * proper case later. This isn't exactly right when | |
| 8532 * length changes for multi-byte characters with | |
| 8533 * ignore case... */ | |
| 8534 if (depth <= patlen | |
| 8535 && MB_STRNICMP(word, pat, depth) != 0) | |
| 701 | 8536 --depth; |
| 351 | 8537 } |
| 8538 } | |
| 8539 } | |
| 8540 } | |
| 8541 } | |
| 8542 } | |
| 8543 | |
| 8544 /* | |
| 8545 * Dump one word: apply case modifications and append a line to the buffer. | |
| 701 | 8546 * When "lnum" is zero add insert mode completion. |
| 8547 */ | |
| 8548 static void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8549 dump_word( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8550 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8551 char_u *word, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8552 char_u *pat, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8553 int *dir, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8554 int dumpflags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8555 int wordflags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8556 linenr_T lnum) |
| 351 | 8557 { |
| 8558 int keepcap = FALSE; | |
| 8559 char_u *p; | |
| 625 | 8560 char_u *tw; |
| 351 | 8561 char_u cword[MAXWLEN]; |
| 381 | 8562 char_u badword[MAXWLEN + 10]; |
| 8563 int i; | |
| 710 | 8564 int flags = wordflags; |
| 8565 | |
| 8566 if (dumpflags & DUMPFLAG_ONECAP) | |
| 8567 flags |= WF_ONECAP; | |
| 8568 if (dumpflags & DUMPFLAG_ALLCAP) | |
| 8569 flags |= WF_ALLCAP; | |
| 351 | 8570 |
| 625 | 8571 if ((dumpflags & DUMPFLAG_KEEPCASE) == 0 && (flags & WF_CAPMASK) != 0) |
| 351 | 8572 { |
| 8573 /* Need to fix case according to "flags". */ | |
| 8574 make_case_word(word, cword, flags); | |
| 8575 p = cword; | |
| 8576 } | |
| 8577 else | |
| 8578 { | |
| 8579 p = word; | |
| 625 | 8580 if ((dumpflags & DUMPFLAG_KEEPCASE) |
| 8581 && ((captype(word, NULL) & WF_KEEPCAP) == 0 | |
| 389 | 8582 || (flags & WF_FIXCAP) != 0)) |
| 351 | 8583 keepcap = TRUE; |
| 8584 } | |
| 625 | 8585 tw = p; |
| 351 | 8586 |
| 701 | 8587 if (pat == NULL) |
| 8588 { | |
| 8589 /* Add flags and regions after a slash. */ | |
| 8590 if ((flags & (WF_BANNED | WF_RARE | WF_REGION)) || keepcap) | |
| 8591 { | |
| 8592 STRCPY(badword, p); | |
| 8593 STRCAT(badword, "/"); | |
| 8594 if (keepcap) | |
| 8595 STRCAT(badword, "="); | |
| 8596 if (flags & WF_BANNED) | |
| 8597 STRCAT(badword, "!"); | |
| 8598 else if (flags & WF_RARE) | |
| 8599 STRCAT(badword, "?"); | |
| 8600 if (flags & WF_REGION) | |
| 8601 for (i = 0; i < 7; ++i) | |
| 8602 if (flags & (0x10000 << i)) | |
| 8603 sprintf((char *)badword + STRLEN(badword), "%d", i + 1); | |
| 8604 p = badword; | |
| 8605 } | |
| 8606 | |
| 8607 if (dumpflags & DUMPFLAG_COUNT) | |
| 8608 { | |
| 8609 hashitem_T *hi; | |
| 8610 | |
| 8611 /* Include the word count for ":spelldump!". */ | |
| 8612 hi = hash_find(&slang->sl_wordcount, tw); | |
| 8613 if (!HASHITEM_EMPTY(hi)) | |
| 8614 { | |
| 8615 vim_snprintf((char *)IObuff, IOSIZE, "%s\t%d", | |
| 625 | 8616 tw, HI2WC(hi)->wc_count); |
| 701 | 8617 p = IObuff; |
| 8618 } | |
| 8619 } | |
| 8620 | |
| 8621 ml_append(lnum, p, (colnr_T)0, FALSE); | |
| 8622 } | |
| 710 | 8623 else if (((dumpflags & DUMPFLAG_ICASE) |
| 8624 ? MB_STRNICMP(p, pat, STRLEN(pat)) == 0 | |
| 8625 : STRNCMP(p, pat, STRLEN(pat)) == 0) | |
| 701 | 8626 && ins_compl_add_infercase(p, (int)STRLEN(p), |
|
16239
5df26b29e809
patch 8.1.1124: insert completion flags are mixed up
Bram Moolenaar <Bram@vim.org>
parents:
16162
diff
changeset
|
8627 p_ic, NULL, *dir, FALSE) == OK) |
| 710 | 8628 /* if dir was BACKWARD then honor it just once */ |
| 8629 *dir = FORWARD; | |
| 351 | 8630 } |
| 8631 | |
| 8632 /* | |
| 372 | 8633 * For ":spelldump": Find matching prefixes for "word". Prepend each to |
| 8634 * "word" and append a line to the buffer. | |
| 701 | 8635 * When "lnum" is zero add insert mode completion. |
| 351 | 8636 * Return the updated line number. |
| 8637 */ | |
| 8638 static linenr_T | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8639 dump_prefixes( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8640 slang_T *slang, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8641 char_u *word, /* case-folded word */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8642 char_u *pat, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8643 int *dir, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8644 int dumpflags, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8645 int flags, /* flags with prefix ID */ |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8646 linenr_T startlnum) |
| 351 | 8647 { |
| 8648 idx_T arridx[MAXWLEN]; | |
| 8649 int curi[MAXWLEN]; | |
| 8650 char_u prefix[MAXWLEN]; | |
| 455 | 8651 char_u word_up[MAXWLEN]; |
| 8652 int has_word_up = FALSE; | |
| 351 | 8653 int c; |
| 8654 char_u *byts; | |
| 8655 idx_T *idxs; | |
| 8656 linenr_T lnum = startlnum; | |
| 8657 int depth; | |
| 8658 int n; | |
| 8659 int len; | |
| 8660 int i; | |
| 8661 | |
| 626 | 8662 /* If the word starts with a lower-case letter make the word with an |
| 455 | 8663 * upper-case letter in word_up[]. */ |
| 8664 c = PTR2CHAR(word); | |
| 8665 if (SPELL_TOUPPER(c) != c) | |
| 8666 { | |
| 8667 onecap_copy(word, word_up, TRUE); | |
| 8668 has_word_up = TRUE; | |
| 8669 } | |
| 8670 | |
| 351 | 8671 byts = slang->sl_pbyts; |
| 8672 idxs = slang->sl_pidxs; | |
| 8673 if (byts != NULL) /* array not is empty */ | |
| 8674 { | |
| 8675 /* | |
| 8676 * Loop over all prefixes, building them byte-by-byte in prefix[]. | |
| 390 | 8677 * When at the end of a prefix check that it supports "flags". |
| 351 | 8678 */ |
| 8679 depth = 0; | |
| 8680 arridx[0] = 0; | |
| 8681 curi[0] = 1; | |
| 8682 while (depth >= 0 && !got_int) | |
| 8683 { | |
| 390 | 8684 n = arridx[depth]; |
| 8685 len = byts[n]; | |
| 8686 if (curi[depth] > len) | |
| 351 | 8687 { |
| 8688 /* Done all bytes at this node, go up one level. */ | |
| 8689 --depth; | |
| 8690 line_breakcheck(); | |
| 8691 } | |
| 8692 else | |
| 8693 { | |
| 8694 /* Do one more byte at this node. */ | |
| 390 | 8695 n += curi[depth]; |
| 351 | 8696 ++curi[depth]; |
| 8697 c = byts[n]; | |
| 8698 if (c == 0) | |
| 8699 { | |
| 8700 /* End of prefix, find out how many IDs there are. */ | |
| 8701 for (i = 1; i < len; ++i) | |
| 8702 if (byts[n + i] != 0) | |
| 8703 break; | |
| 8704 curi[depth] += i - 1; | |
| 8705 | |
| 455 | 8706 c = valid_word_prefix(i, n, flags, word, slang, FALSE); |
| 8707 if (c != 0) | |
| 351 | 8708 { |
| 376 | 8709 vim_strncpy(prefix + depth, word, MAXWLEN - depth - 1); |
| 701 | 8710 dump_word(slang, prefix, pat, dir, dumpflags, |
| 455 | 8711 (c & WF_RAREPFX) ? (flags | WF_RARE) |
| 701 | 8712 : flags, lnum); |
| 8713 if (lnum != 0) | |
| 8714 ++lnum; | |
| 351 | 8715 } |
| 455 | 8716 |
| 8717 /* Check for prefix that matches the word when the | |
| 8718 * first letter is upper-case, but only if the prefix has | |
| 8719 * a condition. */ | |
| 8720 if (has_word_up) | |
| 8721 { | |
| 8722 c = valid_word_prefix(i, n, flags, word_up, slang, | |
| 8723 TRUE); | |
| 8724 if (c != 0) | |
| 8725 { | |
| 8726 vim_strncpy(prefix + depth, word_up, | |
| 8727 MAXWLEN - depth - 1); | |
| 701 | 8728 dump_word(slang, prefix, pat, dir, dumpflags, |
| 455 | 8729 (c & WF_RAREPFX) ? (flags | WF_RARE) |
| 701 | 8730 : flags, lnum); |
| 8731 if (lnum != 0) | |
| 8732 ++lnum; | |
| 455 | 8733 } |
| 8734 } | |
| 351 | 8735 } |
| 8736 else | |
| 8737 { | |
| 8738 /* Normal char, go one level deeper. */ | |
| 8739 prefix[depth++] = c; | |
| 8740 arridx[depth] = idxs[n]; | |
| 8741 curi[depth] = 1; | |
| 8742 } | |
| 8743 } | |
| 8744 } | |
| 8745 } | |
| 8746 | |
| 8747 return lnum; | |
| 8748 } | |
| 8749 | |
| 498 | 8750 /* |
| 626 | 8751 * Move "p" to the end of word "start". |
| 8752 * Uses the spell-checking word characters. | |
| 498 | 8753 */ |
| 8754 char_u * | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8755 spell_to_word_end(char_u *start, win_T *win) |
| 498 | 8756 { |
| 8757 char_u *p = start; | |
| 8758 | |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8759 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
|
8760 MB_PTR_ADV(p); |
| 498 | 8761 return p; |
| 8762 } | |
| 8763 | |
| 475 | 8764 #if defined(FEAT_INS_EXPAND) || defined(PROTO) |
| 8765 /* | |
| 626 | 8766 * For Insert mode completion CTRL-X s: |
| 8767 * Find start of the word in front of column "startcol". | |
| 8768 * We don't check if it is badly spelled, with completion we can only change | |
| 8769 * the word in front of the cursor. | |
| 475 | 8770 * Returns the column number of the word. |
| 8771 */ | |
| 8772 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8773 spell_word_start(int startcol) |
| 475 | 8774 { |
| 8775 char_u *line; | |
| 8776 char_u *p; | |
| 8777 int col = 0; | |
| 8778 | |
| 498 | 8779 if (no_spell_checking(curwin)) |
| 475 | 8780 return startcol; |
| 8781 | |
| 8782 /* Find a word character before "startcol". */ | |
| 8783 line = ml_get_curline(); | |
| 8784 for (p = line + startcol; p > line; ) | |
| 8785 { | |
|
11127
506f5d8b7d8b
patch 8.0.0451: some macros are in lower case
Christian Brabandt <cb@256bit.org>
parents:
11121
diff
changeset
|
8786 MB_PTR_BACK(line, p); |
| 5477 | 8787 if (spell_iswordp_nmw(p, curwin)) |
| 475 | 8788 break; |
| 8789 } | |
| 8790 | |
| 8791 /* Go back to start of the word. */ | |
| 8792 while (p > line) | |
| 8793 { | |
| 835 | 8794 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
|
8795 MB_PTR_BACK(line, p); |
|
2250
1bac28a53fae
Add the conceal patch from Vince Negri.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
8796 if (!spell_iswordp(p, curwin)) |
| 475 | 8797 break; |
| 8798 col = 0; | |
| 8799 } | |
| 8800 | |
| 535 | 8801 return col; |
| 8802 } | |
| 8803 | |
| 8804 /* | |
| 8805 * Need to check for 'spellcapcheck' now, the word is removed before | |
| 8806 * expand_spelling() is called. Therefore the ugly global variable. | |
| 8807 */ | |
| 8808 static int spell_expand_need_cap; | |
| 8809 | |
| 8810 void | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8811 spell_expand_check_cap(colnr_T col) |
| 535 | 8812 { |
| 475 | 8813 spell_expand_need_cap = check_need_cap(curwin->w_cursor.lnum, col); |
| 8814 } | |
| 8815 | |
| 8816 /* | |
| 8817 * Get list of spelling suggestions. | |
| 8818 * Used for Insert mode completion CTRL-X ?. | |
| 8819 * Returns the number of matches. The matches are in "matchp[]", array of | |
| 8820 * allocated strings. | |
| 8821 */ | |
| 8822 int | |
|
7835
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8823 expand_spelling( |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8824 linenr_T lnum UNUSED, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8825 char_u *pat, |
|
4d7ce6c03fda
commit https://github.com/vim/vim/commit/764b23c8fd3369cb05ae9122abf3ca16fec539d7
Christian Brabandt <cb@256bit.org>
parents:
7805
diff
changeset
|
8826 char_u ***matchp) |
| 475 | 8827 { |
| 8828 garray_T ga; | |
| 8829 | |
| 625 | 8830 spell_suggest_list(&ga, pat, 100, spell_expand_need_cap, TRUE); |
| 475 | 8831 *matchp = ga.ga_data; |
| 8832 return ga.ga_len; | |
| 8833 } | |
| 8834 #endif | |
| 8835 | |
| 737 | 8836 #endif /* FEAT_SPELL */ |