Mercurial > vim

comparison runtime/doc/develop.txt @ 17667:95c23e180022

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Update runtime files. commit https://github.com/vim/vim/commit/088e8e3443520dec91a384081e66445a104810bb Author: Bram Moolenaar <Bram@vim.org> Date: Thu Aug 8 22:15:18 2019 +0200 Update runtime files.
author Bram Moolenaar <Bram@vim.org>
date Thu, 08 Aug 2019 22:30:08 +0200
parents 7e733046db1d
children 99586852c2db
comparison
equal deleted inserted replaced
17666:460af4da8fa6 17667:95c23e180022
1 *develop.txt* For Vim version 8.1. Last change: 2019 Feb 17 1 *develop.txt* For Vim version 8.1. Last change: 2019 Aug 05
2 2
3 3
4 VIM REFERENCE MANUAL by Bram Moolenaar 4 VIM REFERENCE MANUAL by Bram Moolenaar
5 5
6 6
527 walking through the trie of good words, soundfolding each word and 527 walking through the trie of good words, soundfolding each word and
528 checking how different it is from the bad word. This is very efficient for 528 checking how different it is from the bad word. This is very efficient for
529 memory use, but takes a long time. On a fast PC it takes a couple of 529 memory use, but takes a long time. On a fast PC it takes a couple of
530 seconds for English, which can be acceptable for interactive use. But for 530 seconds for English, which can be acceptable for interactive use. But for
531 some languages it takes more than ten seconds (e.g., German, Catalan), 531 some languages it takes more than ten seconds (e.g., German, Catalan),
532 which is unacceptable slow. For batch processing (automatic corrections) 532 which is unacceptably slow. For batch processing (automatic corrections)
533 it's too slow for all languages. 533 it's too slow for all languages.
534 2. Use a trie for the soundfolded words, so that searching can be done just 534 2. Use a trie for the soundfolded words, so that searching can be done just
535 like how it works without soundfolding. This requires remembering a list 535 like how it works without soundfolding. This requires remembering a list
536 of good words for each soundfolded word. This makes finding matches very 536 of good words for each soundfolded word. This makes finding matches very
537 fast but requires quite a lot of memory, in the order of 1 to 10 Mbyte. 537 fast but requires quite a lot of memory, in the order of 1 to 10 Mbyte.