| Revisión | a711f7a6852db37b1687044ce8a96b6f48e9855b (tree) |
|---|---|
| Tiempo | 2005-04-18 05:28:32 |
| Autor | vimboss |
| Commiter | vimboss |
updated for version 7.0067
Filelist (diff)
runtime/doc/spell.txt (diff) runtime/doc/tags (diff) runtime/doc/todo.txt (diff) runtime/doc/version7.txt (diff) runtime/lang/menu_de_de.latin1.vim (diff) runtime/spell/en.latin1.spl (diff) runtime/syntax/make.vim (diff) src/Makefile (diff)
src/globals.h (diff)
src/hashtable.c (diff) src/if_python.c (diff) src/main.c (diff) src/proto/hashtable.pro (diff) src/version.h (diff) runtime/spell/en.ascii.spl (diff)| @@ -682,6 +682,10 @@ | ||
| 682 | 682 | runtime/tutor/tutor.ru.* \ |
| 683 | 683 | runtime/tutor/tutor.zh.* \ |
| 684 | 684 | runtime/spell/README.txt \ |
| 685 | + | |
| 686 | +# generic language files, binary | |
| 687 | +LANG_GEN_BIN = \ | |
| 688 | + runtime/spell/en.ascii.spl \ | |
| 685 | 689 | runtime/spell/en.latin1.spl \ |
| 686 | 690 | runtime/spell/en.utf-8.spl \ |
| 687 | 691 |
| @@ -1,4 +1,4 @@ | ||
| 1 | -*spell.txt* For Vim version 7.0aa. Last change: 2005 Apr 15 | |
| 1 | +*spell.txt* For Vim version 7.0aa. Last change: 2005 Apr 17 | |
| 2 | 2 | |
| 3 | 3 | |
| 4 | 4 | VIM REFERENCE MANUAL by Bram Moolenaar |
| @@ -75,23 +75,24 @@ | ||
| 75 | 75 | -XXX optional addition |
| 76 | 76 | EEE the value of 'encoding' |
| 77 | 77 | |
| 78 | -Exception: Vim uses "latin1" when 'encoding' is "iso-8859-15". The euro sign | |
| 79 | -doesn't matter for spelling. | |
| 78 | +Exceptions: | |
| 79 | +- Vim uses "latin1" when 'encoding' is "iso-8859-15". The euro sign doesn't | |
| 80 | + matter for spelling. | |
| 81 | +- When no spell file for 'encoding' is found "ascii" is tried. This only | |
| 82 | + works for languages where nearly all words are ASCII, such as English. It | |
| 83 | + helps when 'encoding' is not "latin1", such as iso-8859-2, and English text | |
| 84 | + is being edited. | |
| 80 | 85 | |
| 81 | 86 | Spelling for EBCDIC is currently not supported. |
| 82 | 87 | |
| 83 | 88 | A spell file might not be available in the current 'encoding'. See |
| 84 | 89 | |spell-mkspell| about how to create a spell file. Converting a spell file |
| 85 | -with "iconv" will NOT work. | |
| 86 | - | |
| 87 | -If a spell file only uses ASCII characters the encoding can be omitted. This | |
| 88 | -is useful for English: "en.spl" The file with encoding is checked first, thus | |
| 89 | -you could have one with encoding that includes words with non-ASCII characters | |
| 90 | -and use the ASCII file as a fall-back. | |
| 90 | +with "iconv" will NOT work! | |
| 91 | 91 | |
| 92 | 92 | *E758* *E759* |
| 93 | 93 | When loading a spell file Vim checks that it is properly formatted. If you |
| 94 | -get an error the file may be truncated, modified or for another Vim version. | |
| 94 | +get an error the file may be truncated, modified or intended for another Vim | |
| 95 | +version. | |
| 95 | 96 | |
| 96 | 97 | |
| 97 | 98 | WORDS |
| @@ -126,9 +127,14 @@ | ||
| 126 | 127 | find them here: |
| 127 | 128 | http://lingucomponent.openoffice.org/spell_dic.html |
| 128 | 129 | |
| 129 | -:mksp[ell] {outname} {inname} ... *:mksp* *:mkspell* | |
| 130 | +:mksp[ell] [-ascii] {outname} {inname} ... *:mksp* *:mkspell* | |
| 130 | 131 | Generate spell file {outname}.spl from Myspell files |
| 131 | 132 | {inname}.aff and {inname}.dic. |
| 133 | + When the [-ascii] argument is present, words with | |
| 134 | + non-ascii characters are skipped. The resulting file | |
| 135 | + ends in "ascii.spl". Otherwise the resulting file | |
| 136 | + ends in "ENC.spl", where ENC is the value of | |
| 137 | + 'encoding'. | |
| 132 | 138 | Multiple {inname} arguments can be given to combine |
| 133 | 139 | regions into one Vim spell file. Example: > |
| 134 | 140 | :mkspell ~/.vim/spell/en /tmp/en_US /tmp/en_CA /tmp/en_AU |
| @@ -5111,7 +5111,6 @@ | ||
| 5111 | 5111 | hebrew.txt hebrew.txt /*hebrew.txt* |
| 5112 | 5112 | help various.txt /*help* |
| 5113 | 5113 | help-context help.txt /*help-context* |
| 5114 | -help-tags tags 1 | |
| 5115 | 5114 | help-translated various.txt /*help-translated* |
| 5116 | 5115 | help-xterm-window various.txt /*help-xterm-window* |
| 5117 | 5116 | help.txt help.txt /*help.txt* |
| @@ -1,4 +1,4 @@ | ||
| 1 | -*todo.txt* For Vim version 7.0aa. Last change: 2005 Apr 15 | |
| 1 | +*todo.txt* For Vim version 7.0aa. Last change: 2005 Apr 17 | |
| 2 | 2 | |
| 3 | 3 | |
| 4 | 4 | VIM REFERENCE MANUAL by Bram Moolenaar |
| @@ -98,7 +98,14 @@ | ||
| 98 | 98 | - Add SPELLCHECKER, with support for many languages. |
| 99 | 99 | - Use "engspchk" from Charles Campbell for ideas. |
| 100 | 100 | - Spell checking code todo's: |
| 101 | - - BWF_ADDS and BWF_ADDSM for more than 256, only one byte for count. | |
| 101 | + - For French, prefixes with single quotes result in many additions. | |
| 102 | + How to do this more efficiently? Both storing and checking. | |
| 103 | + Put addition up to end of word also in hashtab, so that "s'aaa" | |
| 104 | + is found by "'aaa", s-bbb by "-bbb", etc. Put rest in table (search | |
| 105 | + longest match). | |
| 106 | + - use BWF_ADDS and BWF_ADDSM for more than 256, only one byte for count. | |
| 107 | + - Implement user and project word lists. Commands to add words and to | |
| 108 | + mark words as wrong. | |
| 102 | 109 | - Case folding only works when locale is set properly. |
| 103 | 110 | E.g., when C locale is active then 'enc' is "latin1" but Ångström |
| 104 | 111 | isn't seen as a ONECAP. |
| @@ -107,29 +114,21 @@ | ||
| 107 | 114 | Put the character tables in the .aff file? |
| 108 | 115 | - Implement = flag in .dic: KEEPCASE for lower case word. |
| 109 | 116 | 's morgens/= does not match 'S morgens |
| 110 | - - Merge en_US, en_CA, en_AU, etc. | |
| 111 | 117 | - Implement compound words? |
| 112 | - - Make matching additions faster somehow? | |
| 113 | - - More efficient way to store additions? | |
| 114 | 118 | - remove fw_prefix and fw_suffix, use fw_len (word length) and put |
| 115 | 119 | prefixes and suffixes right after it. |
| 116 | 120 | - Make "en-rare" spell file. |
| 117 | 121 | Convention: use en_US (language_region) and en-rare (language-field) |
| 118 | - - Need to check for affixes of zero length? | |
| 119 | - - specify word characters in .aff file? | |
| 122 | + Add hl groups to 'spelllang'? | |
| 123 | + :set spelllang=en_us,en-rare/SpellRare,en-math/SpellMath | |
| 120 | 124 | - Polish: Anio and Hanio are wrong words, even though Myspell allows |
| 121 | 125 | them. Problem with not ignoring case in conditions. |
| 122 | - - Put addition up to end of word also in hashtab, so that "s'aaa" | |
| 123 | - is found by "'aaa", s-bbb by "-bbb", etc. Put rest in table (search | |
| 124 | - longest match). | |
| 125 | - - Rare words: use another dictionary. Add hl groups to 'spelllang'? | |
| 126 | - :set spelllang=en_us,en.rare/SpellRare,en.math/SpellMath | |
| 127 | 126 | - References MySpell library (in OpenOffice.org). |
| 128 | 127 | http://spellchecker.mozdev.org/source.html |
| 129 | 128 | http://whiteboard.openoffice.org/source/browse/whiteboard/lingucomponent/source/spellcheck/myspell/ |
| 130 | 129 | author: Kevin Hendricks <kevin.hendricks@sympatico.ca> |
| 131 | 130 | - Alternative: use aspell library. |
| 132 | - ispell is replaced by aspell, thus forget about it. | |
| 131 | + ispell is replaced by aspell, thus forget about ispell. | |
| 133 | 132 | - More complicated: Regions with different languages? E.g. comments in |
| 134 | 133 | English, strings in German (po file). |
| 135 | 134 | - Commands required: |
| @@ -139,11 +138,13 @@ | ||
| 139 | 138 | [s move to previous spell error [S also rare word |
| 140 | 139 | ]s move to next spell error ]S also rare word |
| 141 | 140 | (only "]s" is currently implemented) |
| 141 | + Make this work like displaying, check @Spell in syntax. | |
| 142 | + Support a count. | |
| 142 | 143 | - Update option window for 'spell' and 'spelllang'. |
| 143 | 144 | - Use an external program like aspell for suggestions to correct the |
| 144 | - spelling? Or include the myspell/spell code in Vim? | |
| 145 | + spelling? Or include the myspell suggestion code in Vim? | |
| 145 | 146 | - Distribution: Need wordlists for many languages; "language pack" |
| 146 | - - Work together with OpenOffic.org to update the wordlists. (Adri | |
| 147 | + - Work together with OpenOffice.org to update the wordlists. (Adri | |
| 147 | 148 | Verhoef, Aad Nales) |
| 148 | 149 | - Support for approximate-regexps will help with finding similar words |
| 149 | 150 | (agrep http://www.tgries.de/agrep/). |
| @@ -1,4 +1,4 @@ | ||
| 1 | -*version7.txt* For Vim version 7.0aa. Last change: 2005 Apr 05 | |
| 1 | +*version7.txt* For Vim version 7.0aa. Last change: 2005 Apr 17 | |
| 2 | 2 | |
| 3 | 3 | |
| 4 | 4 | VIM REFERENCE MANUAL by Bram Moolenaar |
| @@ -1042,4 +1042,7 @@ | ||
| 1042 | 1042 | In gui_mch_draw_string() in gui_w32.c "unibuflen" wasn't static, resulting in |
| 1043 | 1043 | reallocating the buffer every time. (Alexei Alexandrov) |
| 1044 | 1044 | |
| 1045 | +When using a Python "atexit" function it was not invoked when Vim exits. Now | |
| 1046 | +call Py_Finalize() for that. (Ugo Di Girolamo) | |
| 1047 | + | |
| 1045 | 1048 | vim:tw=78:ts=8:ft=help:norl: |
| @@ -2,7 +2,7 @@ | ||
| 2 | 2 | " Language: Makefile |
| 3 | 3 | " Maintainer: Claudio Fleiner <claudio@fleiner.com> |
| 4 | 4 | " URL: http://www.fleiner.com/vim/syntax/make.vim |
| 5 | -" Last Change: 2004 Apr 30 | |
| 5 | +" Last Change: 2005 Apr 17 | |
| 6 | 6 | |
| 7 | 7 | " For version 5.x: Clear all syntax items |
| 8 | 8 | " For version 6.x: Quit when a syntax file was already loaded |
| @@ -67,9 +67,9 @@ | ||
| 67 | 67 | |
| 68 | 68 | " Comment |
| 69 | 69 | if exists("make_microsoft") |
| 70 | - syn match makeComment "#.*" contains=makeTodo | |
| 70 | + syn match makeComment "#.*" contains=makeTodo,@Spell | |
| 71 | 71 | else |
| 72 | - syn region makeComment start="#" end="^$" end="[^\\]$" keepend contains=makeTodo | |
| 72 | + syn region makeComment start="#" end="^$" end="[^\\]$" keepend contains=makeTodo,@Spell | |
| 73 | 73 | syn match makeComment "#$" |
| 74 | 74 | endif |
| 75 | 75 | syn keyword makeTodo TODO FIXME XXX contained |
| @@ -370,6 +370,8 @@ | ||
| 370 | 370 | |
| 371 | 371 | # PYTHON |
| 372 | 372 | # Uncomment this when you want to include the Python interface. |
| 373 | +# NOTE: This may cause threading to be enabled, which has side effects (such | |
| 374 | +# as using different libraries and debugging becomes more difficult). | |
| 373 | 375 | #CONF_OPT_PYTHON = --enable-pythoninterp |
| 374 | 376 | |
| 375 | 377 | # TCL |
| @@ -1810,7 +1812,11 @@ | ||
| 1810 | 1812 | |
| 1811 | 1813 | # Install the spell files, if they exist. |
| 1812 | 1814 | installspell: $(DEST_VIM) $(DEST_RT) $(DEST_SPELL) |
| 1813 | - if test -f $(SPELLSOURCE)/en.spl; then \ | |
| 1815 | + if test -f $(SPELLSOURCE)/en.latin1.spl; then \ | |
| 1816 | + $(INSTALL_DATA) $(SPELLSOURCE)/*.spl $(DEST_SPELL); \ | |
| 1817 | + chmod $(HELPMOD) $(DEST_SPELL)/*.spl; \ | |
| 1818 | + fi | |
| 1819 | + if test -f $(SPELLSOURCE)/en.utf-8.spl; then \ | |
| 1814 | 1820 | $(INSTALL_DATA) $(SPELLSOURCE)/*.spl $(DEST_SPELL); \ |
| 1815 | 1821 | chmod $(HELPMOD) $(DEST_SPELL)/*.spl; \ |
| 1816 | 1822 | fi |
| @@ -1297,7 +1297,7 @@ | ||
| 1297 | 1297 | #endif |
| 1298 | 1298 | EXTERN char_u e_invrange[] INIT(=N_("E16: Invalid range")); |
| 1299 | 1299 | EXTERN char_u e_invcmd[] INIT(=N_("E476: Invalid command")); |
| 1300 | -#ifdef UNIX | |
| 1300 | +#if defined(UNIX) || (defined(FEAT_SYN_HL) && defined(FEAT_MBYTE)) | |
| 1301 | 1301 | EXTERN char_u e_isadir2[] INIT(=N_("E17: \"%s\" is a directory")); |
| 1302 | 1302 | #endif |
| 1303 | 1303 | #ifdef FEAT_LIBCALL |
| @@ -32,7 +32,10 @@ | ||
| 32 | 32 | #if defined(FEAT_EVAL) || defined(FEAT_SYN_HL) || defined(PROTO) |
| 33 | 33 | |
| 34 | 34 | #if 0 |
| 35 | -# define HT_DEBUG /* extra checks for table consistency */ | |
| 35 | +# define HT_DEBUG /* extra checks for table consistency and statistics */ | |
| 36 | + | |
| 37 | +static long hash_count_lookup = 0; /* count number of hashtab lookups */ | |
| 38 | +static long hash_count_perturb = 0; /* count number of "misses" */ | |
| 36 | 39 | #endif |
| 37 | 40 | |
| 38 | 41 | /* Magic value for algorithm that walks through the array. */ |
| @@ -40,7 +43,7 @@ | ||
| 40 | 43 | |
| 41 | 44 | static int hash_may_resize __ARGS((hashtab_T *ht, int minitems)); |
| 42 | 45 | |
| 43 | -#if defined(FEAT_SYN_HL) || defined(PROTO) | |
| 46 | +#if 0 /* currently not used */ | |
| 44 | 47 | /* |
| 45 | 48 | * Create an empty hash table. |
| 46 | 49 | * Returns NULL when out of memory. |
| @@ -112,6 +115,10 @@ | ||
| 112 | 115 | hashitem_T *hi; |
| 113 | 116 | int idx; |
| 114 | 117 | |
| 118 | +#ifdef HT_DEBUG | |
| 119 | + ++hash_count_lookup; | |
| 120 | +#endif | |
| 121 | + | |
| 115 | 122 | /* |
| 116 | 123 | * Quickly handle the most common situations: |
| 117 | 124 | * - return if there is no item at all |
| @@ -141,6 +148,9 @@ | ||
| 141 | 148 | */ |
| 142 | 149 | for (perturb = hash; ; perturb >>= PERTURB_SHIFT) |
| 143 | 150 | { |
| 151 | +#ifdef HT_DEBUG | |
| 152 | + ++hash_count_perturb; /* count a "miss" for hashtab lookup */ | |
| 153 | +#endif | |
| 144 | 154 | idx = (idx << 2) + idx + perturb + 1; |
| 145 | 155 | hi = &ht->ht_array[idx & ht->ht_mask]; |
| 146 | 156 | if (hi->hi_key == NULL) |
| @@ -155,6 +165,23 @@ | ||
| 155 | 165 | } |
| 156 | 166 | |
| 157 | 167 | /* |
| 168 | + * Print the efficiency of hashtable lookups. | |
| 169 | + * Useful when trying different hash algorithms. | |
| 170 | + * Called when exiting. | |
| 171 | + */ | |
| 172 | + void | |
| 173 | +hash_debug_results() | |
| 174 | +{ | |
| 175 | +#ifdef HT_DEBUG | |
| 176 | + fprintf(stderr, "\r\n\r\n\r\n\r\n"); | |
| 177 | + fprintf(stderr, "Number of hashtable lookups: %ld\r\n", hash_count_lookup); | |
| 178 | + fprintf(stderr, "Number of perturb loops: %ld\r\n", hash_count_perturb); | |
| 179 | + fprintf(stderr, "Percentage of perturb loops: %ld%%\r\n", | |
| 180 | + hash_count_perturb * 100 / hash_count_lookup); | |
| 181 | +#endif | |
| 182 | +} | |
| 183 | + | |
| 184 | +/* | |
| 158 | 185 | * Add item with key "key" to hashtable "ht". |
| 159 | 186 | * Returns FAIL when out of memory or the key is already present. |
| 160 | 187 | */ |
| @@ -332,7 +359,7 @@ | ||
| 332 | 359 | else |
| 333 | 360 | { |
| 334 | 361 | /* Use specified size. */ |
| 335 | - if (minitems < ht->ht_used) /* just in case... */ | |
| 362 | + if ((long_u)minitems < ht->ht_used) /* just in case... */ | |
| 336 | 363 | minitems = ht->ht_used; |
| 337 | 364 | minsize = minitems * 3 / 2; /* array is up to 2/3 full */ |
| 338 | 365 | } |
| @@ -420,16 +447,28 @@ | ||
| 420 | 447 | } |
| 421 | 448 | |
| 422 | 449 | /* |
| 423 | - * Get the hash number for a key. Uses the ElfHash algorithm, which is | |
| 424 | - * supposed to have an even distribution (suggested by Charles Campbell). | |
| 450 | + * Get the hash number for a key. | |
| 451 | + * If you think you know a better hash function: Compile with HT_DEBUG set and | |
| 452 | + * run a script that uses hashtables a lot. Vim will then print statistics | |
| 453 | + * when exiting. Try that with the current hash algorithm and yours. The | |
| 454 | + * lower the percentage the better. | |
| 425 | 455 | */ |
| 426 | 456 | hash_T |
| 427 | 457 | hash_hash(key) |
| 428 | 458 | char_u *key; |
| 429 | 459 | { |
| 430 | - hash_T hash = 0; | |
| 460 | + hash_T hash; | |
| 461 | + char_u *p; | |
| 462 | + | |
| 463 | + if ((hash = *key) == 0) | |
| 464 | + return (hash_T)0; /* Empty keys are not allowed, but we don't | |
| 465 | + want to crash if we get one. */ | |
| 466 | + p = key + 1; | |
| 467 | + | |
| 468 | +#if 0 | |
| 469 | + /* ElfHash algorithm, which is supposed to have an even distribution. | |
| 470 | + * Suggested by Charles Campbell. */ | |
| 431 | 471 | hash_T g; |
| 432 | - char_u *p = key; | |
| 433 | 472 | |
| 434 | 473 | while (*p != NUL) |
| 435 | 474 | { |
| @@ -438,6 +477,13 @@ | ||
| 438 | 477 | if (g != 0) |
| 439 | 478 | hash ^= g >> 24; /* xor g's high 4 bits into hash */ |
| 440 | 479 | } |
| 480 | +#else | |
| 481 | + | |
| 482 | + /* A simplistic algorithm that appears to do very well. | |
| 483 | + * Suggested by George Reilly. */ | |
| 484 | + while (*p != NUL) | |
| 485 | + hash = hash * 101 + *p++; | |
| 486 | +#endif | |
| 441 | 487 | |
| 442 | 488 | return hash; |
| 443 | 489 | } |
| @@ -115,6 +115,8 @@ | ||
| 115 | 115 | # define Py_FindMethod dll_Py_FindMethod |
| 116 | 116 | # define Py_InitModule4 dll_Py_InitModule4 |
| 117 | 117 | # define Py_Initialize dll_Py_Initialize |
| 118 | +# define Py_Finalize dll_Py_Finalize | |
| 119 | +# define Py_IsInitialized dll_Py_IsInitialized | |
| 118 | 120 | # define _PyObject_New dll__PyObject_New |
| 119 | 121 | # define _Py_NoneStruct (*dll__Py_NoneStruct) |
| 120 | 122 | # define PyObject_Init dll__PyObject_Init |
| @@ -169,6 +171,8 @@ | ||
| 169 | 171 | static PyObject*(*dll_Py_FindMethod)(struct PyMethodDef[], PyObject *, char *); |
| 170 | 172 | static PyObject*(*dll_Py_InitModule4)(char *, struct PyMethodDef *, char *, PyObject *, int); |
| 171 | 173 | static void(*dll_Py_Initialize)(void); |
| 174 | +static void(*dll_Py_Finalize)(void); | |
| 175 | +static int(*dll_Py_IsInitialized)(void); | |
| 172 | 176 | static PyObject*(*dll__PyObject_New)(PyTypeObject *, PyObject *); |
| 173 | 177 | static PyObject*(*dll__PyObject_Init)(PyObject *, PyTypeObject *); |
| 174 | 178 | static PyObject* dll__Py_NoneStruct; |
| @@ -245,6 +249,8 @@ | ||
| 245 | 249 | {"Py_FindMethod", (PYTHON_PROC*)&dll_Py_FindMethod}, |
| 246 | 250 | {"Py_InitModule4", (PYTHON_PROC*)&dll_Py_InitModule4}, |
| 247 | 251 | {"Py_Initialize", (PYTHON_PROC*)&dll_Py_Initialize}, |
| 252 | + {"Py_Finalize", (PYTHON_PROC*)&dll_Py_Finalize}, | |
| 253 | + {"Py_IsInitialized", (PYTHON_PROC*)&dll_Py_IsInitialized}, | |
| 248 | 254 | {"_PyObject_New", (PYTHON_PROC*)&dll__PyObject_New}, |
| 249 | 255 | {"PyObject_Init", (PYTHON_PROC*)&dll__PyObject_Init}, |
| 250 | 256 | {"_Py_NoneStruct", (PYTHON_PROC*)&dll__Py_NoneStruct}, |
| @@ -423,7 +429,12 @@ | ||
| 423 | 429 | python_end() |
| 424 | 430 | { |
| 425 | 431 | #ifdef DYNAMIC_PYTHON |
| 432 | + if (hinstPython && Py_IsInitialized()) | |
| 433 | + Py_Finalize(); | |
| 426 | 434 | end_dynamic_python(); |
| 435 | +#else | |
| 436 | + if (Py_IsInitialized()) | |
| 437 | + Py_Finalize(); | |
| 427 | 438 | #endif |
| 428 | 439 | } |
| 429 | 440 |
| @@ -15,7 +15,7 @@ | ||
| 15 | 15 | #include "vim.h" |
| 16 | 16 | |
| 17 | 17 | #ifdef SPAWNO |
| 18 | -# include <spawno.h> /* special MSDOS swapping library */ | |
| 18 | +# include <spawno.h> /* special MS-DOS swapping library */ | |
| 19 | 19 | #endif |
| 20 | 20 | |
| 21 | 21 | #ifdef HAVE_FCNTL_H |
| @@ -2312,6 +2312,11 @@ | ||
| 2312 | 2312 | #endif |
| 2313 | 2313 | windgoto((int)Rows - 1, 0); |
| 2314 | 2314 | |
| 2315 | +#if defined(FEAT_EVAL) || defined(FEAT_SYN_HL) | |
| 2316 | + /* Optionally print hashtable efficiency. */ | |
| 2317 | + hash_debug_results(); | |
| 2318 | +#endif | |
| 2319 | + | |
| 2315 | 2320 | #ifdef FEAT_GUI |
| 2316 | 2321 | msg_didany = FALSE; |
| 2317 | 2322 | #endif |
| @@ -4,6 +4,7 @@ | ||
| 4 | 4 | void hash_clear __ARGS((hashtab_T *ht)); |
| 5 | 5 | hashitem_T *hash_find __ARGS((hashtab_T *ht, char_u *key)); |
| 6 | 6 | hashitem_T *hash_lookup __ARGS((hashtab_T *ht, char_u *key, hash_T hash)); |
| 7 | +void hash_debug_results __ARGS((void)); | |
| 7 | 8 | int hash_add __ARGS((hashtab_T *ht, char_u *key)); |
| 8 | 9 | int hash_add_item __ARGS((hashtab_T *ht, hashitem_T *hi, char_u *key, hash_T hash)); |
| 9 | 10 | void hash_remove __ARGS((hashtab_T *ht, hashitem_T *hi)); |
| @@ -36,5 +36,5 @@ | ||
| 36 | 36 | #define VIM_VERSION_NODOT "vim70aa" |
| 37 | 37 | #define VIM_VERSION_SHORT "7.0aa" |
| 38 | 38 | #define VIM_VERSION_MEDIUM "7.0aa ALPHA" |
| 39 | -#define VIM_VERSION_LONG "VIM - Vi IMproved 7.0aa ALPHA (2005 Apr 15)" | |
| 40 | -#define VIM_VERSION_LONG_DATE "VIM - Vi IMproved 7.0aa ALPHA (2005 Apr 15, compiled " | |
| 39 | +#define VIM_VERSION_LONG "VIM - Vi IMproved 7.0aa ALPHA (2005 Apr 17)" | |
| 40 | +#define VIM_VERSION_LONG_DATE "VIM - Vi IMproved 7.0aa ALPHA (2005 Apr 17, compiled " |
Vim
Fork