提交 6dc76d59 编写于 作者: J Johannes Rieken

higher score for case-senstive match

上级 205a2555
......@@ -672,21 +672,21 @@ export function _matchRecursive(
&& ((value = _matchRecursive(pattern, lowPattern, upPattern, patternPos + 1, word, lowWord, wordPos + 1, matches)) >= 0)
) {
matches.unshift(wordPos);
return (pattern.charAt(patternPos) === word.charAt(wordPos) ? 11 : 9) + value;
return (pattern.charAt(patternPos) === word.charAt(wordPos) ? 17 : 11) + value;
}
if ((idx = lowWord.indexOf(`_${lowPatternChar}`, wordPos)) >= 0
&& ((value = _matchRecursive(pattern, lowPattern, upPattern, patternPos + 1, word, lowWord, idx + 2, matches)) >= 0)
) {
matches.unshift(idx + 1);
return (pattern.charAt(patternPos) === word.charAt(idx + 1) ? 11 : 9) + value;
return (pattern.charAt(patternPos) === word.charAt(idx + 1) ? 17 : 11) + value;
}
if ((idx = word.indexOf(upPattern.charAt(patternPos), wordPos)) >= 0
&& ((value = _matchRecursive(pattern, lowPattern, upPattern, patternPos + 1, word, lowWord, idx + 1, matches)) >= 0)
) {
matches.unshift(idx);
return (pattern.charAt(patternPos) === word.charAt(idx) ? 11 : 9) + value;
return (pattern.charAt(patternPos) === word.charAt(idx) ? 17 : 11) + value;
}
if (patternPos > 0
......
......@@ -259,8 +259,8 @@ suite('Filters', () => {
assertTopScore('CC', 1, 'camelCase', 'CamelCase');
assertTopScore('cC', 0, 'camelCase', 'CamelCase');
// assertTopScore('cC', 1, 'ccfoo', 'camelCase');
// assertTopScore('cC', 1, 'ccfoo', 'camelCase', 'foo-cC-bar');
assertTopScore('cC', 1, 'ccfoo', 'camelCase');
assertTopScore('cC', 1, 'ccfoo', 'camelCase', 'foo-cC-bar');
// issue #17836
assertTopScore('p', 0, 'parse', 'posix', 'pafdsa', 'path', 'p');
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册