Go to file
Strahinja Val Markovic d18b89bceb Fixed another bug in the word boundary condition
The problem was that should have been using a longest common subsequence
algorithm for the "number of word boundary character matches" calculation. Our
old approach would fail for the following case:

Query: "caafoo"

Candidate1 : "acaaCaaFooGxx"
Candidate2 : "aCaafoog"

Candidate1 needs to win. This is now also a test case.
2012-06-24 17:58:20 -07:00
autoload Completion now off for comments and strings 2012-06-24 12:04:45 -07:00
cpp Fixed another bug in the word boundary condition 2012-06-24 17:58:20 -07:00
plugin Updating copyright line 2012-04-15 20:28:46 -07:00
python Small refactoring of the ShouldAddIdentifier func 2012-05-12 20:42:45 -07:00
.gitignore Updating gitignore to ignore the test exe 2012-05-10 10:39:50 -07:00
README.md Adding initial readme file 2012-04-15 20:14:47 -07:00

Work in progress, NOT yet ready for primetime!