b1bba2e201
When I initially released this project, I released it under my own copyright. I have since then worked on it in my 20% time at Google (and want to continue doing this) and my life becomes much simpler if the copyright is Google's. From the perspective of how this project is run and managed, **NOTHING** changes. YCM is not a Google product, merely a project run by someone who just happens to work for Google. Please note that the license of the project is **NOT** changing. People sending in future pull requests will have to sign the Google [CLA](https://developers.google.com/open-source/cla/individual) (you can sign online at the bottom of that page) before those pull requests could be merged in. People who sent in pull requests that were merged in the past will get an email from me asking them to sign the CLA as well.
202 lines
5.8 KiB
Python
202 lines
5.8 KiB
Python
#!/usr/bin/env python
|
|
#
|
|
# Copyright (C) 2011, 2012 Google Inc.
|
|
#
|
|
# This file is part of YouCompleteMe.
|
|
#
|
|
# YouCompleteMe is free software: you can redistribute it and/or modify
|
|
# it under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation, either version 3 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# YouCompleteMe is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
#
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with YouCompleteMe. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
import vim
|
|
from ycm import vimsupport
|
|
from ycm import utils
|
|
from ycm import user_options_store
|
|
import ycm_client_support
|
|
|
|
YCM_VAR_PREFIX = 'ycm_'
|
|
|
|
|
|
def BuildServerConf():
|
|
"""Builds a dictionary mapping YCM Vim user options to values. Option names
|
|
don't have the 'ycm_' prefix."""
|
|
|
|
vim_globals = vimsupport.GetReadOnlyVimGlobals( force_python_objects = True )
|
|
server_conf = {}
|
|
for key, value in vim_globals.items():
|
|
if not key.startswith( YCM_VAR_PREFIX ):
|
|
continue
|
|
try:
|
|
new_value = int( value )
|
|
except:
|
|
new_value = value
|
|
new_key = key[ len( YCM_VAR_PREFIX ): ]
|
|
server_conf[ new_key ] = new_value
|
|
|
|
return server_conf
|
|
|
|
|
|
def LoadJsonDefaultsIntoVim():
|
|
defaults = user_options_store.DefaultOptions()
|
|
vim_defaults = {}
|
|
for key, value in defaults.iteritems():
|
|
vim_defaults[ 'ycm_' + key ] = value
|
|
|
|
vimsupport.LoadDictIntoVimGlobals( vim_defaults, overwrite = False )
|
|
|
|
|
|
def CompletionStartColumn():
|
|
"""Returns the 0-based index where the completion string should start. So if
|
|
the user enters:
|
|
foo.bar^
|
|
with the cursor being at the location of the caret, then the starting column
|
|
would be the index of the letter 'b'.
|
|
"""
|
|
|
|
line = vim.current.line
|
|
start_column = vimsupport.CurrentColumn()
|
|
|
|
while start_column > 0 and utils.IsIdentifierChar( line[ start_column - 1 ] ):
|
|
start_column -= 1
|
|
return start_column
|
|
|
|
|
|
def CurrentIdentifierFinished():
|
|
current_column = vimsupport.CurrentColumn()
|
|
previous_char_index = current_column - 1
|
|
if previous_char_index < 0:
|
|
return True
|
|
line = vim.current.line
|
|
try:
|
|
previous_char = line[ previous_char_index ]
|
|
except IndexError:
|
|
return False
|
|
|
|
if utils.IsIdentifierChar( previous_char ):
|
|
return False
|
|
|
|
if ( not utils.IsIdentifierChar( previous_char ) and
|
|
previous_char_index > 0 and
|
|
utils.IsIdentifierChar( line[ previous_char_index - 1 ] ) ):
|
|
return True
|
|
else:
|
|
return line[ : current_column ].isspace()
|
|
|
|
|
|
def LastEnteredCharIsIdentifierChar():
|
|
current_column = vimsupport.CurrentColumn()
|
|
previous_char_index = current_column - 1
|
|
if previous_char_index < 0:
|
|
return False
|
|
line = vim.current.line
|
|
try:
|
|
previous_char = line[ previous_char_index ]
|
|
except IndexError:
|
|
return False
|
|
|
|
return utils.IsIdentifierChar( previous_char )
|
|
|
|
|
|
def AdjustCandidateInsertionText( candidates ):
|
|
"""This function adjusts the candidate insertion text to take into account the
|
|
text that's currently in front of the cursor.
|
|
|
|
For instance ('|' represents the cursor):
|
|
1. Buffer state: 'foo.|bar'
|
|
2. A completion candidate of 'zoobar' is shown and the user selects it.
|
|
3. Buffer state: 'foo.zoobar|bar' instead of 'foo.zoo|bar' which is what the
|
|
user wanted.
|
|
|
|
This function changes candidates to resolve that issue.
|
|
|
|
It could be argued that the user actually wants the final buffer state to be
|
|
'foo.zoobar|' (the cursor at the end), but that would be much more difficult
|
|
to implement and is probably not worth doing.
|
|
"""
|
|
|
|
def NewCandidateInsertionText( to_insert, text_after_cursor ):
|
|
overlap_len = OverlapLength( to_insert, text_after_cursor )
|
|
if overlap_len:
|
|
return to_insert[ :-overlap_len ]
|
|
return to_insert
|
|
|
|
text_after_cursor = vimsupport.TextAfterCursor()
|
|
if not text_after_cursor:
|
|
return candidates
|
|
|
|
new_candidates = []
|
|
for candidate in candidates:
|
|
if type( candidate ) is dict:
|
|
new_candidate = candidate.copy()
|
|
|
|
if not 'abbr' in new_candidate:
|
|
new_candidate[ 'abbr' ] = new_candidate[ 'word' ]
|
|
|
|
new_candidate[ 'word' ] = NewCandidateInsertionText(
|
|
new_candidate[ 'word' ],
|
|
text_after_cursor )
|
|
|
|
new_candidates.append( new_candidate )
|
|
|
|
elif type( candidate ) is str:
|
|
new_candidates.append(
|
|
{ 'abbr': candidate,
|
|
'word': NewCandidateInsertionText( candidate, text_after_cursor ) } )
|
|
return new_candidates
|
|
|
|
|
|
def OverlapLength( left_string, right_string ):
|
|
"""Returns the length of the overlap between two strings.
|
|
Example: "foo baro" and "baro zoo" -> 4
|
|
"""
|
|
left_string_length = len( left_string )
|
|
right_string_length = len( right_string )
|
|
|
|
if not left_string_length or not right_string_length:
|
|
return 0
|
|
|
|
# Truncate the longer string.
|
|
if left_string_length > right_string_length:
|
|
left_string = left_string[ -right_string_length: ]
|
|
elif left_string_length < right_string_length:
|
|
right_string = right_string[ :left_string_length ]
|
|
|
|
if left_string == right_string:
|
|
return min( left_string_length, right_string_length )
|
|
|
|
# Start by looking for a single character match
|
|
# and increase length until no match is found.
|
|
best = 0
|
|
length = 1
|
|
while True:
|
|
pattern = left_string[ -length: ]
|
|
found = right_string.find( pattern )
|
|
if found < 0:
|
|
return best
|
|
length += found
|
|
if left_string[ -length: ] == right_string[ :length ]:
|
|
best = length
|
|
length += 1
|
|
|
|
|
|
COMPATIBLE_WITH_CORE_VERSION = 8
|
|
|
|
def CompatibleWithYcmCore():
|
|
try:
|
|
current_core_version = ycm_client_support.YcmCoreVersion()
|
|
except AttributeError:
|
|
return False
|
|
|
|
return current_core_version == COMPATIBLE_WITH_CORE_VERSION
|
|
|
|
|