aboutsummaryrefslogtreecommitdiffstats
path: root/lib/completion.js
diff options
context:
space:
mode:
authorNiklas Baumstark2012-01-25 17:30:51 +0100
committerNiklas Baumstark2012-04-10 23:58:07 +0200
commit66330ac3b5f4320ddf3d7c985f351eaa6886a9da (patch)
treedb605f6b90e70325df69ea9d04468833b02d402c /lib/completion.js
parentd1364c2dffe7e371c60fede5007b886fb7c9beb3 (diff)
downloadvimium-66330ac3b5f4320ddf3d7c985f351eaa6886a9da.tar.bz2
rename "match" method to prevent confusion
Diffstat (limited to 'lib/completion.js')
-rw-r--r--lib/completion.js6
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/completion.js b/lib/completion.js
index 2163dbdd..6f5b0f96 100644
--- a/lib/completion.js
+++ b/lib/completion.js
@@ -32,7 +32,7 @@ var completion = (function() {
*
* _Don't use this to check if a string matches a query_. Use `getMatcher(query).test(str)` instead.
*/
- self.match = function(query, str) {
+ self.getMatchGroups = function(query, str) {
query = self.normalize(query);
if (query.length == 0)
return str.length ? [str] : [];
@@ -49,7 +49,7 @@ var completion = (function() {
continue;
// we use recursive backtracking here, this is why it's slow.
- rest = self.match(query.slice(i), str.slice(partOffset + i));
+ rest = self.getMatchGroups(query.slice(i), str.slice(partOffset + i));
if (!rest) continue;
return [
@@ -202,7 +202,7 @@ var completion = (function() {
// tags and reinsert them after the matching process
var htmlTags = {};
str = stripHtmlTags(str, htmlTags);
- var groups = fuzzyMatcher.match(query, str);
+ var groups = fuzzyMatcher.getMatchGroups(query, str);
var html = '';
var htmlOffset = 0;