/
misc.vim
523 lines (466 loc) · 13.8 KB
/
misc.vim
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
runtime! plugin/smartinput.vim
call vspec#hint({'scope': 'smartinput#scope()', 'sid': 'smartinput#sid()'})
syntax enable
set backspace=indent,eol,start
describe 's:calculate_rule_priority'
it 'should use "at", "mode", "filetype" and "syntax"'
let snrule1 = {
\ 'at': '\%#',
\ 'char': '(',
\ 'input': '()<Left>',
\ 'mode': 'i',
\ 'filetype': ['foo', 'bar', 'baz'],
\ 'syntax': ['String', 'Comment'],
\ }
Expect Call('s:calculate_rule_priority', snrule1)
\ == 3 + 100 / 3 + 100 / 2 + 100 / 1
let snrule2 = {
\ 'at': '\%#',
\ 'char': '[',
\ 'input': '[ ]<Left><Left>',
\ 'mode': 'i',
\ 'filetype': ['foo', 'bar', 'baz'],
\ 'syntax': ['String', 'Comment'],
\ }
Expect Call('s:calculate_rule_priority', snrule2)
\ == 3 + 100 / 3 + 100 / 2 + 100 / 1
let snrule3 = {
\ 'at': '\%#',
\ 'char': '(',
\ 'input': '<Bslash>(',
\ 'mode': '/?',
\ 'filetype': 0,
\ 'syntax': 0,
\ }
Expect Call('s:calculate_rule_priority', snrule3)
\ == 3 + 0 + 0 + 100 / 2
end
it 'should use a low value for omitted "filetype" and "syntax"'
let snrule = {
\ 'at': '\%#',
\ 'char': '(',
\ 'input': '()<Left>',
\ 'mode': 'i',
\ 'filetype': 0,
\ 'syntax': 0,
\ }
Expect Call('s:calculate_rule_priority', snrule)
\ == 3 + 0 + 0 + 100 / 1
end
end
describe 's:decode_key_notation'
it 'should decode a <Key> notation into an actual byte sequence'
Expect Call('s:decode_key_notation', 'foo') ==# "foo"
Expect Call('s:decode_key_notation', '"') ==# "\""
Expect Call('s:decode_key_notation', '\') ==# "\\"
Expect Call('s:decode_key_notation', '<C-h>') ==# "\<C-h>"
Expect Call('s:decode_key_notation', '<BS>') ==# "\<BS>"
Expect Call('s:decode_key_notation', '<LT><LT>') ==# "\<LT>\<LT>"
end
end
describe 's:find_the_most_proper_rule_in_command_line_mode'
before
new
let b:nrule1 = Call('s:normalize_rule', {
\ 'at': '\%#',
\ 'char': '<LT>',
\ 'input': '<LT>><Left>',
\ 'mode': ':',
\ })
let b:nrule2 = Call('s:normalize_rule', {
\ 'at': '\w\%#',
\ 'char': '<LT>',
\ 'input': '<LT>',
\ 'mode': ':',
\ })
let b:nrule3 = Call('s:normalize_rule', {
\ 'at': '\%#',
\ 'char': '<LT>',
\ 'input': '<LT>',
\ 'filetype': ['lisp', 'scheme'],
\ 'mode': '/',
\ })
let b:nrule4 = Call('s:normalize_rule', {
\ 'at': '\%#',
\ 'char': '<LT>',
\ 'input': '<LT>><Left>',
\ 'filetype': ['lisp', 'scheme'],
\ 'syntax': ['Comment', 'String'],
\ 'mode': '/',
\ })
let b:nrule5 = Call('s:normalize_rule', {
\ 'at': '\%#',
\ 'char': '<LT>',
\ 'input': 'This rule MUST NOT be selected.',
\ 'mode': 'i',
\ })
let b:nrules = [b:nrule5, b:nrule4, b:nrule3, b:nrule2, b:nrule1]
function! b:find(...)
return call('Call',
\ ['s:find_the_most_proper_rule_in_command_line_mode'] + a:000)
endfunction
end
after
close!
end
it 'should fail if there is no rule for a given char'
Expect b:find(b:nrules, '[', '', 1, ':') ==# 0
end
it 'should fail if there is no rule for a given command-line type'
Expect b:find(b:nrules, '<', '', 1, 'X') ==# 0
end
it 'should check the text under the cursor by "at"'
" foo #bar
Expect b:find(b:nrules, '<', 'foo bar', 5, ':') ==# b:nrule1
" foo# bar
Expect b:find(b:nrules, '<', 'foo bar', 4, ':') ==# b:nrule2
end
it 'should ignore "filetype" and "syntax"'
setfiletype scheme
" foo #bar
Expect b:find(b:nrules, '<', 'foo bar', 5, '/') ==# b:nrule4
end
end
describe 's:find_the_most_proper_rule_in_insert_mode'
before
new
let b:nrule1 = Call('s:normalize_rule', {
\ 'at': '\%#',
\ 'char': '<LT>',
\ 'input': '<LT>><Left>',
\ })
let b:nrule2 = Call('s:normalize_rule', {
\ 'at': '\w\%#',
\ 'char': '<LT>',
\ 'input': '<LT>',
\ })
let b:nrule3 = Call('s:normalize_rule', {
\ 'at': '\%#',
\ 'char': '<LT>',
\ 'input': '<LT>',
\ 'filetype': ['lisp', 'scheme'],
\ })
let b:nrule4 = Call('s:normalize_rule', {
\ 'at': '\%#',
\ 'char': '<LT>',
\ 'input': '<LT>><Left>',
\ 'filetype': ['lisp', 'scheme'],
\ 'syntax': ['Comment', 'String'],
\ })
let b:nrule5 = Call('s:normalize_rule', {
\ 'at': '\%#',
\ 'char': '<LT>',
\ 'input': 'This rule MUST NOT be selected.',
\ 'mode': ':',
\ })
let b:nrules = [b:nrule5, b:nrule4, b:nrule3, b:nrule2, b:nrule1]
function! b:find(...)
return call('Call',
\ ['s:find_the_most_proper_rule_in_insert_mode'] + a:000)
endfunction
end
after
close!
end
it 'should fail if there is no rule for a given char'
Expect b:find(b:nrules, '[') ==# 0
end
it 'should check the text under the cursor by "at"'
setfiletype html
call setline(1, '(define foo ) ; ...')
Expect getline(1, line('$')) ==# ['(define foo ) ; ...']
" (define foo #) ; ...
normal! ggf)
Expect [line('.'), col('.')] ==# [1, 13]
Expect b:find(b:nrules, '<') ==# b:nrule1
" (define foo# ) ; ...
normal! ggf)h
Expect [line('.'), col('.')] ==# [1, 12]
Expect b:find(b:nrules, '<') ==# b:nrule2
end
it 'should check the filetype of the current buffer with "filetype"'
setfiletype scheme
call setline(1, '(define foo ) ; ...')
Expect getline(1, line('$')) ==# ['(define foo ) ; ...']
" (define foo #) ; ...
normal! ggf)
Expect [line('.'), col('.')] ==# [1, 13]
Expect b:find(b:nrules, '<') ==# b:nrule3
" (define foo# ) ; ...
normal! ggf)h
Expect [line('.'), col('.')] ==# [1, 12]
Expect b:find(b:nrules, '<') ==# b:nrule3
end
it 'should check the syntax name of text under the cursor with "syntax"'
setfiletype scheme
call setline(1, '(define foo ) ; ...')
Expect getline(1, line('$')) ==# ['(define foo ) ; ...']
" (define foo #) ; ...
normal! ggf)
Expect [line('.'), col('.')] ==# [1, 13]
Expect b:find(b:nrules, '<') ==# b:nrule3
" (define foo ) ; #...
normal! ggf.
Expect [line('.'), col('.')] ==# [1, 18]
Expect b:find(b:nrules, '<') ==# b:nrule4
end
end
describe 's:insert_or_replace_a_rule'
before
new
let b:nrule_table = {}
for char in ['A', 'B', 'C', 'D', 'E', 'F']
let b:nrule_table[char] = Call('s:normalize_rule', {
\ 'at': '---',
\ 'char': char,
\ 'input': '---',
\ })
endfor
let b:sorted_nrules =
\ map(
\ reverse(sort(map(values(b:nrule_table), '[v:val.hash, v:val]'))),
\ 'v:val[1]'
\ )
end
after
close
end
it 'should replace an existing value which is equivalent to the given one'
let nrule_table = {}
for char in ['A', 'B', 'C', 'D', 'E', 'F']
let nrule_table[char] = Call('s:normalize_rule', {
\ 'at': '---',
\ 'char': char,
\ 'input': '===',
\ })
endfor
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ b:nrule_table['D'],
\ b:nrule_table['C'],
\ b:nrule_table['B'],
\ b:nrule_table['A'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['A'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ b:nrule_table['D'],
\ b:nrule_table['C'],
\ b:nrule_table['B'],
\ nrule_table['A'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['B'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ b:nrule_table['D'],
\ b:nrule_table['C'],
\ nrule_table['B'],
\ nrule_table['A'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['C'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ b:nrule_table['D'],
\ nrule_table['C'],
\ nrule_table['B'],
\ nrule_table['A'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['D'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ nrule_table['D'],
\ nrule_table['C'],
\ nrule_table['B'],
\ nrule_table['A'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['E'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ nrule_table['E'],
\ nrule_table['D'],
\ nrule_table['C'],
\ nrule_table['B'],
\ nrule_table['A'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['F'])
Expect b:sorted_nrules ==# [
\ nrule_table['F'],
\ nrule_table['E'],
\ nrule_table['D'],
\ nrule_table['C'],
\ nrule_table['B'],
\ nrule_table['A'],
\ ]
end
it 'should insert a given rule into the "sorted" position'
let nrule_table = {}
for char in ['00', 'AA', 'BB', 'CC', 'DD', 'EE', 'FF']
let nrule_table[char] = Call('s:normalize_rule', {
\ 'at': '---',
\ 'char': char,
\ 'input': '===',
\ })
endfor
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ b:nrule_table['D'],
\ b:nrule_table['C'],
\ b:nrule_table['B'],
\ b:nrule_table['A'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['00'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ b:nrule_table['D'],
\ b:nrule_table['C'],
\ b:nrule_table['B'],
\ b:nrule_table['A'],
\ nrule_table['00'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['AA'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ b:nrule_table['D'],
\ b:nrule_table['C'],
\ b:nrule_table['B'],
\ nrule_table['AA'],
\ b:nrule_table['A'],
\ nrule_table['00'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['BB'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ b:nrule_table['D'],
\ b:nrule_table['C'],
\ nrule_table['BB'],
\ b:nrule_table['B'],
\ nrule_table['AA'],
\ b:nrule_table['A'],
\ nrule_table['00'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['CC'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ b:nrule_table['D'],
\ nrule_table['CC'],
\ b:nrule_table['C'],
\ nrule_table['BB'],
\ b:nrule_table['B'],
\ nrule_table['AA'],
\ b:nrule_table['A'],
\ nrule_table['00'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['DD'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ b:nrule_table['E'],
\ nrule_table['DD'],
\ b:nrule_table['D'],
\ nrule_table['CC'],
\ b:nrule_table['C'],
\ nrule_table['BB'],
\ b:nrule_table['B'],
\ nrule_table['AA'],
\ b:nrule_table['A'],
\ nrule_table['00'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['EE'])
Expect b:sorted_nrules ==# [
\ b:nrule_table['F'],
\ nrule_table['EE'],
\ b:nrule_table['E'],
\ nrule_table['DD'],
\ b:nrule_table['D'],
\ nrule_table['CC'],
\ b:nrule_table['C'],
\ nrule_table['BB'],
\ b:nrule_table['B'],
\ nrule_table['AA'],
\ b:nrule_table['A'],
\ nrule_table['00'],
\ ]
call Call('s:insert_or_replace_a_rule', b:sorted_nrules, nrule_table['FF'])
Expect b:sorted_nrules ==# [
\ nrule_table['FF'],
\ b:nrule_table['F'],
\ nrule_table['EE'],
\ b:nrule_table['E'],
\ nrule_table['DD'],
\ b:nrule_table['D'],
\ nrule_table['CC'],
\ b:nrule_table['C'],
\ nrule_table['BB'],
\ b:nrule_table['B'],
\ nrule_table['AA'],
\ b:nrule_table['A'],
\ nrule_table['00'],
\ ]
end
it 'should insert a given rule as the 0th element of an empty list'
let nrules = []
Expect nrules ==# []
call Call('s:insert_or_replace_a_rule', nrules, b:nrule_table['A'])
Expect nrules ==# [b:nrule_table['A']]
end
end
describe 's:normalize_rule'
it 'should copy a given rule recursively'
let urule = {
\ 'at': '\%#',
\ 'char': '(',
\ 'input': '()<Left>',
\ 'filetype': ['foo', 'bar'],
\ 'syntax': ['String', 'Comment'],
\ }
let nrule = Call('s:normalize_rule', urule)
Expect nrule isnot urule
Expect nrule.filetype isnot urule.filetype
Expect nrule.syntax isnot urule.syntax
end
it 'should sort "filetype" and "syntax"'
let urule = {
\ 'at': '\%#',
\ 'char': '(',
\ 'input': '()<Left>',
\ 'filetype': ['foo', 'bar'],
\ 'syntax': ['String', 'Comment'],
\ }
let nrule = Call('s:normalize_rule', urule)
Expect nrule.filetype ==# ['bar', 'foo']
Expect nrule.syntax ==# ['Comment', 'String']
end
it 'should complete optional items'
let urule = {
\ 'at': '\%#',
\ 'char': '(',
\ 'input': '()<Left>',
\ }
let nrule = Call('s:normalize_rule', urule)
Expect nrule ==# {
\ 'at': urule.at,
\ 'char': urule.char,
\ '_char': Call('s:decode_key_notation', urule.char),
\ 'input': urule.input,
\ '_input': Call('s:decode_key_notation', urule.input),
\ 'mode': 'i',
\ 'filetype': 0,
\ 'syntax': 0,
\ 'priority': 3 + 0 + 0 + 100 / 1,
\ 'hash': string([printf('%06d', 3 + 0 + 0 + 100 / 1),
\ urule.at,
\ urule.char,
\ 0,
\ 0]),
\ }
end
end