blob: 4719a3ecbf7217fa86ee00e5e54385ff9a63ecfb (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
-- Inserts 2 million lines with consecutive integers starting from 1
-- (essentially, the output of GNU's seq 1 2000000), writes them to Xtest
-- and calculates its cksum.
-- 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.
local helpers = require('test.functional.helpers')(after_each)
local feed = helpers.feed
local wait = helpers.wait
local clear = helpers.clear
local expect = helpers.expect
local command = helpers.command
describe('mf_hash_grow()', function()
setup(clear)
-- Check to see if cksum exists, otherwise skip the test
local null = helpers.iswin() and 'nul' or '/dev/null'
if os.execute('cksum --help >' .. null .. ' 2>&1') ~= 0 then
pending('was not tested because cksum was not found', function() end)
else
it('is working', function()
command('set fileformat=unix undolevels=-1')
-- Fill the buffer with numbers 1 - 2000000
command('let i = 1')
command('while i <= 2000000 | call append(i, range(i, i + 99)) | let i += 100 | endwhile')
-- Delete empty first line, save to Xtest, and clear buffer
feed('ggdd<cr>')
wait()
command('w! Xtest')
feed('ggdG<cr>')
wait()
-- Calculate the cksum of Xtest and delete first line
command('r !cksum Xtest')
feed('ggdd<cr>')
-- Assert correct output of cksum.
expect([[
3678979763 14888896 Xtest]])
end)
end
teardown(function()
os.remove('Xtest')
end)
end)
|
