2015-07-18 17:05:45 -04:00
|
|
|
if !exists('g:polyglot_disabled') || index(g:polyglot_disabled, 'julia') == -1
|
|
|
|
|
2015-06-11 11:02:51 -04:00
|
|
|
" Vim indent file
|
|
|
|
" Language: Julia
|
|
|
|
" Maintainer: Carlo Baldassi <carlobaldassi@gmail.com>
|
2017-12-06 07:05:56 -05:00
|
|
|
" Last Change: 2016 jun 16
|
|
|
|
" Notes: originally based on Bram Molenaar's indent file for vim
|
2015-06-11 11:02:51 -04:00
|
|
|
|
|
|
|
setlocal autoindent
|
|
|
|
|
|
|
|
setlocal indentexpr=GetJuliaIndent()
|
2017-12-06 07:05:56 -05:00
|
|
|
setlocal indentkeys+==end,=else,=catch,=finally,),],}
|
2015-06-11 11:02:51 -04:00
|
|
|
setlocal indentkeys-=0#
|
|
|
|
setlocal indentkeys-=:
|
|
|
|
setlocal indentkeys-=0{
|
|
|
|
setlocal indentkeys-=0}
|
|
|
|
setlocal nosmartindent
|
|
|
|
|
|
|
|
" Only define the function once.
|
|
|
|
if exists("*GetJuliaIndent")
|
|
|
|
finish
|
|
|
|
endif
|
|
|
|
|
2018-05-08 13:17:30 -04:00
|
|
|
let s:skipPatterns = '\<julia\%(Comprehension\%(For\|If\)\|RangeEnd\|Comment[LM]\|\%([bsv]\|ip\|big\|MIME\|Shell\|Printf\|Doc\)\=String\|RegEx\|SymbolS\?\)\>'
|
2015-06-11 11:02:51 -04:00
|
|
|
|
2017-12-06 07:05:56 -05:00
|
|
|
function JuliaMatch(lnum, str, regex, st, ...)
|
2015-06-11 11:02:51 -04:00
|
|
|
let s = a:st
|
2017-12-06 07:05:56 -05:00
|
|
|
let e = a:0 > 0 ? a:1 : -1
|
2015-06-11 11:02:51 -04:00
|
|
|
while 1
|
2018-04-30 15:00:42 -04:00
|
|
|
let f = match(a:str, '\C' . a:regex, s)
|
2017-12-06 07:05:56 -05:00
|
|
|
if e >= 0 && f >= e
|
|
|
|
return -1
|
|
|
|
endif
|
2015-06-11 11:02:51 -04:00
|
|
|
if f >= 0
|
|
|
|
let attr = synIDattr(synID(a:lnum,f+1,1),"name")
|
2018-04-30 15:00:42 -04:00
|
|
|
if attr =~# s:skipPatterns
|
2015-06-11 11:02:51 -04:00
|
|
|
let s = f+1
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
endif
|
|
|
|
break
|
|
|
|
endwhile
|
|
|
|
return f
|
|
|
|
endfunction
|
|
|
|
|
2017-12-06 07:05:56 -05:00
|
|
|
function GetJuliaNestingStruct(lnum, ...)
|
2015-06-11 11:02:51 -04:00
|
|
|
" Auxiliary function to inspect the block structure of a line
|
|
|
|
let line = getline(a:lnum)
|
2017-12-06 07:05:56 -05:00
|
|
|
let s = a:0 > 0 ? a:1 : 0
|
|
|
|
let e = a:0 > 1 ? a:2 : -1
|
2015-06-11 11:02:51 -04:00
|
|
|
let blocks_stack = []
|
|
|
|
let num_closed_blocks = 0
|
2018-10-08 13:00:59 -04:00
|
|
|
let tt = get(b:, 'julia_syntax_version', 10) == 6 ? '\|\%(\%(abstract\|primitive\)\s\+\)\@<!type' : ''
|
2015-06-11 11:02:51 -04:00
|
|
|
while 1
|
2018-10-08 13:00:59 -04:00
|
|
|
let fb = JuliaMatch(a:lnum, line, '@\@<!\<\%(if\|else\%(if\)\?\|while\|for\|try\|catch\|finally\|\%(staged\)\?function\|macro\|begin\|mutable\s\+struct\|\%(mutable\s\+\)\@<!struct\|\%(abstract\|primitive\)\s\+type\|immutable\|let\|\%(bare\)\?module\|quote\|do'.tt.'\)\>', s, e)
|
2017-12-06 07:05:56 -05:00
|
|
|
let fe = JuliaMatch(a:lnum, line, '@\@<!\<end\>', s, e)
|
2015-06-11 11:02:51 -04:00
|
|
|
|
|
|
|
if fb < 0 && fe < 0
|
|
|
|
" No blocks found
|
|
|
|
break
|
|
|
|
end
|
|
|
|
|
|
|
|
if fb >= 0 && (fb < fe || fe < 0)
|
|
|
|
" The first occurrence is an opening block keyword
|
|
|
|
" Note: some keywords (elseif,else,catch,finally) are both
|
|
|
|
" closing blocks and opening new ones
|
|
|
|
|
|
|
|
let i = JuliaMatch(a:lnum, line, '@\@<!\<if\>', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
|
|
|
call add(blocks_stack, 'if')
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
let i = JuliaMatch(a:lnum, line, '@\@<!\<elseif\>', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
|
|
|
if len(blocks_stack) > 0 && blocks_stack[-1] == 'if'
|
|
|
|
let blocks_stack[-1] = 'elseif'
|
|
|
|
elseif (len(blocks_stack) > 0 && blocks_stack[-1] != 'elseif') || len(blocks_stack) == 0
|
|
|
|
call add(blocks_stack, 'elseif')
|
|
|
|
let num_closed_blocks += 1
|
|
|
|
endif
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
let i = JuliaMatch(a:lnum, line, '@\@<!\<else\>', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
2018-04-30 15:00:42 -04:00
|
|
|
if len(blocks_stack) > 0 && blocks_stack[-1] =~# '\<\%(else\)\=if\>'
|
2015-06-11 11:02:51 -04:00
|
|
|
let blocks_stack[-1] = 'else'
|
|
|
|
else
|
|
|
|
call add(blocks_stack, 'else')
|
|
|
|
let num_closed_blocks += 1
|
|
|
|
endif
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
|
|
|
let i = JuliaMatch(a:lnum, line, '@\@<!\<try\>', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
|
|
|
call add(blocks_stack, 'try')
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
let i = JuliaMatch(a:lnum, line, '@\@<!\<catch\>', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
|
|
|
if len(blocks_stack) > 0 && blocks_stack[-1] == 'try'
|
|
|
|
let blocks_stack[-1] = 'catch'
|
|
|
|
else
|
|
|
|
call add(blocks_stack, 'catch')
|
|
|
|
let num_closed_blocks += 1
|
|
|
|
endif
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
let i = JuliaMatch(a:lnum, line, '@\@<!\<finally\>', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
|
|
|
if len(blocks_stack) > 0 && (blocks_stack[-1] == 'try' || blocks_stack[-1] == 'catch')
|
|
|
|
let blocks_stack[-1] = 'finally'
|
|
|
|
else
|
|
|
|
call add(blocks_stack, 'finally')
|
|
|
|
let num_closed_blocks += 1
|
|
|
|
endif
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
|
|
|
let i = JuliaMatch(a:lnum, line, '@\@<!\<\%(bare\)\?module\>', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
|
|
|
if i == 0
|
|
|
|
call add(blocks_stack, 'col1module')
|
|
|
|
else
|
|
|
|
call add(blocks_stack, 'other')
|
|
|
|
endif
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
2018-10-08 13:00:59 -04:00
|
|
|
let i = JuliaMatch(a:lnum, line, '@\@<!\<\%(while\|for\|\%(staged\)\?function\|macro\|begin\|\%(mutable\s\+\)\?struct\|\%(abstract\|primitive\)\s\+type\|immutable\|let\|quote\|do'.tt.'\)\>', s)
|
2015-06-11 11:02:51 -04:00
|
|
|
if i >= 0 && i == fb
|
2018-04-30 15:00:42 -04:00
|
|
|
if match(line, '\C\<\%(mutable\|abstract\|primitive\)', i) != -1
|
2017-12-06 07:05:56 -05:00
|
|
|
let s = i+11
|
|
|
|
else
|
|
|
|
let s = i+1
|
|
|
|
endif
|
2015-06-11 11:02:51 -04:00
|
|
|
call add(blocks_stack, 'other')
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
|
|
|
" Note: it should be impossible to get here
|
|
|
|
break
|
|
|
|
|
|
|
|
else
|
|
|
|
" The first occurrence is an 'end'
|
|
|
|
|
|
|
|
let s = fe+1
|
|
|
|
if len(blocks_stack) == 0
|
|
|
|
let num_closed_blocks += 1
|
|
|
|
else
|
|
|
|
call remove(blocks_stack, -1)
|
|
|
|
endif
|
|
|
|
continue
|
|
|
|
|
|
|
|
endif
|
|
|
|
|
|
|
|
" Note: it should be impossible to get here
|
|
|
|
break
|
|
|
|
endwhile
|
|
|
|
let num_open_blocks = len(blocks_stack) - count(blocks_stack, 'col1module')
|
|
|
|
return [num_open_blocks, num_closed_blocks]
|
|
|
|
endfunction
|
|
|
|
|
2017-12-06 07:05:56 -05:00
|
|
|
function GetJuliaNestingBrackets(lnum, c)
|
|
|
|
" Auxiliary function to inspect the brackets structure of a line
|
|
|
|
let line = getline(a:lnum)[0 : (a:c - 1)]
|
|
|
|
let s = 0
|
|
|
|
let brackets_stack = []
|
|
|
|
let last_closed_bracket = -1
|
|
|
|
while 1
|
|
|
|
let fb = JuliaMatch(a:lnum, line, '[([{]', s)
|
|
|
|
let fe = JuliaMatch(a:lnum, line, '[])}]', s)
|
|
|
|
|
|
|
|
if fb < 0 && fe < 0
|
|
|
|
" No brackets found
|
|
|
|
break
|
|
|
|
end
|
|
|
|
|
|
|
|
if fb >= 0 && (fb < fe || fe < 0)
|
|
|
|
" The first occurrence is an opening bracket
|
|
|
|
|
|
|
|
let i = JuliaMatch(a:lnum, line, '(', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
|
|
|
call add(brackets_stack, ['par',i])
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
|
|
|
let i = JuliaMatch(a:lnum, line, '\[', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
|
|
|
call add(brackets_stack, ['sqbra',i])
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
|
|
|
let i = JuliaMatch(a:lnum, line, '{', s)
|
|
|
|
if i >= 0 && i == fb
|
|
|
|
let s = i+1
|
|
|
|
call add(brackets_stack, ['curbra',i])
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
|
|
|
" Note: it should be impossible to get here
|
|
|
|
break
|
|
|
|
|
|
|
|
else
|
|
|
|
" The first occurrence is a closing bracket
|
|
|
|
|
|
|
|
let i = JuliaMatch(a:lnum, line, ')', s)
|
|
|
|
if i >= 0 && i == fe
|
|
|
|
let s = i+1
|
|
|
|
if len(brackets_stack) > 0 && brackets_stack[-1][0] == 'par'
|
|
|
|
call remove(brackets_stack, -1)
|
|
|
|
else
|
|
|
|
let last_closed_bracket = i + 1
|
|
|
|
endif
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
|
|
|
let i = JuliaMatch(a:lnum, line, ']', s)
|
|
|
|
if i >= 0 && i == fe
|
|
|
|
let s = i+1
|
|
|
|
if len(brackets_stack) > 0 && brackets_stack[-1][0] == 'sqbra'
|
|
|
|
call remove(brackets_stack, -1)
|
|
|
|
else
|
|
|
|
let last_closed_bracket = i + 1
|
|
|
|
endif
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
|
|
|
let i = JuliaMatch(a:lnum, line, '}', s)
|
|
|
|
if i >= 0 && i == fe
|
|
|
|
let s = i+1
|
|
|
|
if len(brackets_stack) > 0 && brackets_stack[-1][0] == 'curbra'
|
|
|
|
call remove(brackets_stack, -1)
|
|
|
|
else
|
|
|
|
let last_closed_bracket = i + 1
|
|
|
|
endif
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
|
|
|
|
" Note: it should be impossible to get here
|
|
|
|
break
|
|
|
|
|
|
|
|
endif
|
|
|
|
|
|
|
|
" Note: it should be impossible to get here
|
|
|
|
break
|
|
|
|
endwhile
|
|
|
|
let first_open_bracket = -1
|
|
|
|
let last_open_bracket = -1
|
|
|
|
if len(brackets_stack) > 0
|
|
|
|
let first_open_bracket = brackets_stack[0][1]
|
|
|
|
let last_open_bracket = brackets_stack[-1][1]
|
|
|
|
endif
|
|
|
|
return [first_open_bracket, last_open_bracket, last_closed_bracket]
|
|
|
|
endfunction
|
|
|
|
|
|
|
|
let s:bracketBlocks = '\<julia\%(\%(\%(Printf\)\?Par\|SqBra\|CurBra\)Block\|ParBlockInRange\|StringVars\%(Par\|SqBra\|CurBra\)\|Dollar\%(Par\|SqBra\)\|QuotedParBlockS\?\)\>'
|
|
|
|
|
|
|
|
function IsInBrackets(lnum, c)
|
|
|
|
let stack = map(synstack(a:lnum, a:c), 'synIDattr(v:val, "name")')
|
|
|
|
call filter(stack, 'v:val =~# s:bracketBlocks')
|
|
|
|
return len(stack) > 0
|
|
|
|
endfunction
|
|
|
|
|
|
|
|
" Auxiliary function to find a line which does not start in the middle of a
|
|
|
|
" multiline bracketed expression, to be used as reference for block
|
|
|
|
" indentation.
|
|
|
|
function LastBlockIndent(lnum)
|
|
|
|
let lnum = a:lnum
|
|
|
|
let ind = 0
|
|
|
|
while lnum > 0
|
|
|
|
let ind = indent(lnum)
|
|
|
|
if ind == 0
|
|
|
|
return [lnum, 0]
|
|
|
|
endif
|
|
|
|
if !IsInBrackets(lnum, 1)
|
|
|
|
break
|
|
|
|
endif
|
|
|
|
let lnum = prevnonblank(lnum - 1)
|
|
|
|
endwhile
|
|
|
|
return [max([lnum,1]), ind]
|
|
|
|
endfunction
|
|
|
|
|
2015-06-11 11:02:51 -04:00
|
|
|
function GetJuliaIndent()
|
|
|
|
" Find a non-blank line above the current line.
|
|
|
|
let lnum = prevnonblank(v:lnum - 1)
|
|
|
|
|
|
|
|
" At the start of the file use zero indent.
|
|
|
|
if lnum == 0
|
|
|
|
return 0
|
|
|
|
endif
|
|
|
|
|
2017-12-06 07:05:56 -05:00
|
|
|
let ind = -1
|
|
|
|
let st = -1
|
|
|
|
let lim = -1
|
|
|
|
|
|
|
|
" Multiline bracketed expressions take precedence
|
|
|
|
let c = len(getline(lnum)) + 1
|
|
|
|
while IsInBrackets(lnum, c)
|
|
|
|
let [first_open_bracket, last_open_bracket, last_closed_bracket] = GetJuliaNestingBrackets(lnum, c)
|
|
|
|
|
|
|
|
" First scenario: the previous line has a hanging open bracket:
|
|
|
|
" set the indentation to match the opening bracket (plus an extra space)
|
|
|
|
if last_open_bracket != -1
|
|
|
|
let st = last_open_bracket
|
|
|
|
let ind = virtcol([lnum, st + 1])
|
|
|
|
|
|
|
|
" Second scenario: some multiline bracketed expression was closed in the
|
|
|
|
" previous line. But since we know we are still in a bracketed expression,
|
|
|
|
" we need to find the line where the bracket was open
|
|
|
|
elseif last_closed_bracket != -1 " && exists("loaded_matchit")
|
|
|
|
" we use the % command to skip back (this is buggy without matchit, and
|
|
|
|
" is potentially a disaster if % got remapped)
|
|
|
|
call cursor(lnum, last_closed_bracket)
|
|
|
|
normal %
|
|
|
|
if line(".") == lnum
|
|
|
|
" something wrong here, give up
|
|
|
|
let ind = indent(lnum)
|
|
|
|
else
|
|
|
|
let lnum = line(".")
|
|
|
|
let c = col(".") - 1
|
|
|
|
if c == 0
|
|
|
|
" uhm, give up
|
|
|
|
let ind = 0
|
|
|
|
else
|
|
|
|
" we skipped a bracket set, keep searching for an opening bracket
|
|
|
|
let lim = c
|
|
|
|
continue
|
|
|
|
endif
|
|
|
|
endif
|
|
|
|
|
|
|
|
" Third scenario: nothing special, or matchit not available: keep the indentation
|
|
|
|
else
|
|
|
|
let ind = indent(lnum)
|
|
|
|
endif
|
|
|
|
|
|
|
|
" In case the current line starts with a closing bracket, we align it with
|
|
|
|
" the opening one.
|
|
|
|
if JuliaMatch(v:lnum, getline(v:lnum), '[])}]', indent(v:lnum)) == indent(v:lnum) && ind > 0
|
|
|
|
return ind - 1
|
|
|
|
endif
|
|
|
|
|
|
|
|
break
|
|
|
|
endwhile
|
|
|
|
|
|
|
|
if ind == -1
|
|
|
|
" We are not in a multiline bracketed expression. Thus we look for a
|
|
|
|
" previous line to use as a reference
|
|
|
|
let [lnum,ind] = LastBlockIndent(lnum)
|
|
|
|
let c = len(getline(lnum)) + 1
|
|
|
|
if IsInBrackets(lnum, c)
|
|
|
|
let [first_open_bracket, last_open_bracket, last_closed_bracket] = GetJuliaNestingBrackets(lnum, c)
|
|
|
|
let lim = first_open_bracket
|
|
|
|
endif
|
|
|
|
end
|
2015-06-11 11:02:51 -04:00
|
|
|
|
2017-12-06 07:05:56 -05:00
|
|
|
" Analyse the reference line
|
|
|
|
let [num_open_blocks, num_closed_blocks] = GetJuliaNestingStruct(lnum, st, lim)
|
2015-06-11 11:02:51 -04:00
|
|
|
|
|
|
|
" Increase indentation for each newly opened block
|
2017-12-06 07:05:56 -05:00
|
|
|
" in the reference line
|
2015-06-11 11:02:51 -04:00
|
|
|
while num_open_blocks > 0
|
|
|
|
let ind += &sw
|
|
|
|
let num_open_blocks -= 1
|
|
|
|
endwhile
|
|
|
|
|
2017-12-06 07:05:56 -05:00
|
|
|
" Analyse the current line
|
2015-06-11 11:02:51 -04:00
|
|
|
let [num_open_blocks, num_closed_blocks] = GetJuliaNestingStruct(v:lnum)
|
|
|
|
|
|
|
|
" Decrease indentation for each closed block
|
|
|
|
" in the current line
|
|
|
|
while num_closed_blocks > 0
|
|
|
|
let ind -= &sw
|
|
|
|
let num_closed_blocks -= 1
|
|
|
|
endwhile
|
|
|
|
|
|
|
|
return ind
|
|
|
|
endfunction
|
2015-07-18 17:05:45 -04:00
|
|
|
|
|
|
|
endif
|