Mercurial > vim
view src/testdir/test77a.in @ 10601:1b09db809d3f v8.0.0190
patch 8.0.0190: finding duplicate tags uses a slow linear search
commit https://github.com/vim/vim/commit/810f9c361c83afb36b9f1cdadca2b93f1201d039
Author: Bram Moolenaar <Bram@vim.org>
Date: Sun Jan 15 16:52:51 2017 +0100
patch 8.0.0190: finding duplicate tags uses a slow linear search
Problem: Detecting duplicate tags uses a slow linear search.
Solution: Use a much faster hash table solution. (James McCoy, closes https://github.com/vim/vim/issues/1046)
But don't add hi_keylen, it makes hash tables 50% bigger.
| author | Christian Brabandt <cb@256bit.org> |
|---|---|
| date | Sun, 15 Jan 2017 17:00:04 +0100 |
| parents | 47a673b20e49 |
| children | e705ea6e855b |
line wrap: on
line source
Inserts 2 million lines with consecutive integers starting from 1 (essentially, the output of GNU's seq 1 2000000), writes them to Xtest and writes its cksum to test.out. We need 2 million lines to trigger a call to mf_hash_grow(). If it would mess up the lines the checksum would differ. cksum is part of POSIX and so should be available on most Unixes. If it isn't available then the test will be skipped. VMS does not have CKSUM but has a built in CHECKSUM - it should be used STARTTEST :so small.vim :if !has("vms") : e! test.ok : w! test.out : qa! :endif :set fileformat=unix undolevels=-1 ggdG :let i = 1 :while i <= 2000000 | call append(i, range(i, i + 99)) | let i += 100 | endwhile ggdd :w! Xtest. :r !@test77a.com Xtest. :s/\s/ /g :set fileformat& :.w! test.out :qa! ENDTEST