Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
205a2555
V
vscode
项目概览
掘金者说
/
vscode
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
V
vscode
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
205a2555
编写于
3月 15, 2017
作者:
J
Johannes Rieken
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
score case sensitive higher
上级
27526bd6
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
17 addition
and
13 deletion
+17
-13
src/vs/base/common/filters.ts
src/vs/base/common/filters.ts
+11
-10
src/vs/base/test/common/filters.test.ts
src/vs/base/test/common/filters.test.ts
+6
-3
未找到文件。
src/vs/base/common/filters.ts
浏览文件 @
205a2555
...
...
@@ -638,7 +638,7 @@ export function fuzzyMatchAndScore(pattern: string, word: string): [number, numb
let
matches
:
number
[]
=
[];
let
score
=
_matchRecursive
(
pattern
.
toLowerCase
(),
pattern
.
toUpperCase
(),
0
,
pattern
,
pattern
.
toLowerCase
(),
pattern
.
toUpperCase
(),
0
,
word
,
word
.
toLowerCase
(),
0
,
matches
);
...
...
@@ -654,7 +654,7 @@ export function fuzzyMatchAndScore(pattern: string, word: string): [number, numb
}
export
function
_matchRecursive
(
lowPattern
:
string
,
upPattern
:
string
,
patternPos
:
number
,
pattern
:
string
,
lowPattern
:
string
,
upPattern
:
string
,
patternPos
:
number
,
word
:
string
,
lowWord
:
string
,
wordPos
:
number
,
matches
:
number
[]
):
number
{
...
...
@@ -667,30 +667,31 @@ export function _matchRecursive(
let
idx
=
-
1
;
let
value
=
0
;
if
((
patternPos
===
wordPos
&&
lowPatternChar
===
lowWord
.
charAt
(
wordPos
))
&&
((
value
=
_matchRecursive
(
lowPattern
,
upPattern
,
patternPos
+
1
,
word
,
lowWord
,
wordPos
+
1
,
matches
))
>=
0
)
if
((
patternPos
===
wordPos
&&
lowPatternChar
===
lowWord
.
charAt
(
wordPos
))
&&
((
value
=
_matchRecursive
(
pattern
,
lowPattern
,
upPattern
,
patternPos
+
1
,
word
,
lowWord
,
wordPos
+
1
,
matches
))
>=
0
)
)
{
matches
.
unshift
(
wordPos
);
return
11
+
value
;
return
(
pattern
.
charAt
(
patternPos
)
===
word
.
charAt
(
wordPos
)
?
11
:
9
)
+
value
;
}
if
((
idx
=
lowWord
.
indexOf
(
`_
${
lowPatternChar
}
`
,
wordPos
))
>=
0
&&
((
value
=
_matchRecursive
(
lowPattern
,
upPattern
,
patternPos
+
1
,
word
,
lowWord
,
idx
+
2
,
matches
))
>=
0
)
&&
((
value
=
_matchRecursive
(
pattern
,
lowPattern
,
upPattern
,
patternPos
+
1
,
word
,
lowWord
,
idx
+
2
,
matches
))
>=
0
)
)
{
matches
.
unshift
(
idx
+
1
);
return
7
+
value
;
return
(
pattern
.
charAt
(
patternPos
)
===
word
.
charAt
(
idx
+
1
)
?
11
:
9
)
+
value
;
}
if
((
idx
=
word
.
indexOf
(
upPattern
.
charAt
(
patternPos
),
wordPos
))
>=
0
&&
((
value
=
_matchRecursive
(
lowPattern
,
upPattern
,
patternPos
+
1
,
word
,
lowWord
,
idx
+
1
,
matches
))
>=
0
)
&&
((
value
=
_matchRecursive
(
pattern
,
lowPattern
,
upPattern
,
patternPos
+
1
,
word
,
lowWord
,
idx
+
1
,
matches
))
>=
0
)
)
{
matches
.
unshift
(
idx
);
return
7
+
value
;
return
(
pattern
.
charAt
(
patternPos
)
===
word
.
charAt
(
idx
)
?
11
:
9
)
+
value
;
}
if
(
patternPos
>
0
&&
(
idx
=
lowWord
.
indexOf
(
lowPatternChar
,
wordPos
))
>=
0
&&
((
value
=
_matchRecursive
(
lowPattern
,
upPattern
,
patternPos
+
1
,
word
,
lowWord
,
idx
+
1
,
matches
))
>=
0
)
&&
((
value
=
_matchRecursive
(
pattern
,
lowPattern
,
upPattern
,
patternPos
+
1
,
word
,
lowWord
,
idx
+
1
,
matches
))
>=
0
)
)
{
matches
.
unshift
(
idx
);
return
1
+
value
;
...
...
src/vs/base/test/common/filters.test.ts
浏览文件 @
205a2555
...
...
@@ -231,6 +231,9 @@ suite('Filters', () => {
assertMatches
(
'
is
'
,
'
isValid
'
,
'
^i^sValid
'
);
assertMatches
(
'
is
'
,
'
ImportStatement
'
,
'
^Import^Statement
'
);
assertMatches
(
'
lowrd
'
,
'
lowWord
'
,
'
^l^o^wWo^r^d
'
);
assertMatches
(
'
ccm
'
,
'
cacmelCase
'
,
'
^ca^c^melCase
'
);
assertMatches
(
'
ccm
'
,
'
camelCase
'
);
assertMatches
(
'
ccm
'
,
'
camelCasecm
'
,
'
^camel^Casec^m
'
);
});
test
(
'
topScore
'
,
function
()
{
...
...
@@ -252,10 +255,10 @@ suite('Filters', () => {
assert
.
equal
(
topIdx
,
expected
);
}
//
assertTopScore('Foo', 1, 'foo', 'Foo', 'foo');
assertTopScore
(
'
Foo
'
,
1
,
'
foo
'
,
'
Foo
'
,
'
foo
'
);
//
assertTopScore('CC', 1, 'camelCase', 'CamelCase');
//
assertTopScore('cC', 0, 'camelCase', 'CamelCase');
assertTopScore
(
'
CC
'
,
1
,
'
camelCase
'
,
'
CamelCase
'
);
assertTopScore
(
'
cC
'
,
0
,
'
camelCase
'
,
'
CamelCase
'
);
// assertTopScore('cC', 1, 'ccfoo', 'camelCase');
// assertTopScore('cC', 1, 'ccfoo', 'camelCase', 'foo-cC-bar');
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录