Home
last modified time | relevance | path

Searched refs:arridx (Results 1 – 4 of 4) sorted by relevance

/vim-8.2.3635/src/
H A Dspell.c402 idx_T arridx = 0; in find_word() local
472 len = byts[arridx++]; in find_word()
492 ++arridx; in find_word()
507 lo = arridx; in find_word()
528 arridx = idxs[lo]; in find_word()
591 for (len = byts[arridx - 1]; len > 0 && byts[arridx] == 0; in find_word()
1138 ++arridx; in find_prefix()
1170 lo = arridx; in find_prefix()
1191 arridx = idxs[lo]; in find_prefix()
3976 arridx[0] = 0; in spell_dump_compl()
[all …]
H A Dspellsuggest.c1266 idx_T arridx; in suggest_trie_walk() local
1897 c = byts[arridx]; in suggest_trie_walk()
2714 arridx[0] = 0; in find_keepcap_word()
2811 arridx[depth] = tryidx; in find_keepcap_word()
3362 idx_T arridx = 0; in soundfold_find() local
3377 len = byts[arridx++]; in soundfold_find()
3382 if (byts[arridx] == NUL) in soundfold_find()
3390 ++arridx; in soundfold_find()
3405 while (byts[arridx] < c) in soundfold_find()
3409 ++arridx; in soundfold_find()
[all …]
H A Dspellfile.c609 idx_T arridx[MAXWLEN]; in tree_count_words() local
615 arridx[0] = 0; in tree_count_words()
621 if (curi[depth] > byts[arridx[depth]]) in tree_count_words()
624 idxs[arridx[depth]] = wordcount[depth]; in tree_count_words()
634 n = arridx[depth] + curi[depth]; in tree_count_words()
655 arridx[depth] = idxs[n]; in tree_count_words()
5551 idx_T arridx[MAXWLEN]; in sug_filltree() local
5575 arridx[0] = 0; in sug_filltree()
5582 if (curi[depth] > byts[arridx[depth]]) in sug_filltree()
5596 n = arridx[depth] + curi[depth]; in sug_filltree()
[all …]
/vim-8.2.3635/src/proto/
H A Dspell.pro6 int valid_word_prefix(int totprefcnt, int arridx, int flags, char_u *word, slang_T *slang, int cond…