Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
9fcf0f62
V
vscode
项目概览
xxadev
/
vscode
与 Fork 源项目一致
从无法访问的项目Fork
通知
2
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
V
vscode
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
9fcf0f62
编写于
10月 04, 2016
作者:
J
Johannes Rieken
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
compute score from highlights, fixes #11423
上级
105168b4
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
20 addition
and
18 deletion
+20
-18
src/vs/editor/contrib/suggest/common/completionModel.ts
src/vs/editor/contrib/suggest/common/completionModel.ts
+20
-18
未找到文件。
src/vs/editor/contrib/suggest/common/completionModel.ts
浏览文件 @
9fcf0f62
...
...
@@ -5,10 +5,10 @@
'
use strict
'
;
import
{
isFalsyOrEmpty
}
from
'
vs/base/common/arrays
'
;
import
{
IMatch
,
fuzzyContiguousFilter
}
from
'
vs/base/common/filters
'
;
import
{
ISuggestSupport
}
from
'
vs/editor/common/modes
'
;
import
{
ISuggestionItem
}
from
'
./suggest
'
;
import
{
isFalsyOrEmpty
}
from
'
vs/base/common/arrays
'
;
import
{
IMatch
,
fuzzyContiguousFilter
}
from
'
vs/base/common/filters
'
;
import
{
ISuggestSupport
}
from
'
vs/editor/common/modes
'
;
import
{
ISuggestionItem
}
from
'
./suggest
'
;
export
interface
ICompletionItem
extends
ISuggestionItem
{
highlights
?:
IMatch
[];
...
...
@@ -43,7 +43,7 @@ export class CompletionModel {
this
.
_lineContext
=
lineContext
;
}
replaceIncomplete
(
newItems
:
ISuggestionItem
[],
compareFn
:
(
a
:
ISuggestionItem
,
b
:
ISuggestionItem
)
=>
number
):
void
{
replaceIncomplete
(
newItems
:
ISuggestionItem
[],
compareFn
:
(
a
:
ISuggestionItem
,
b
:
ISuggestionItem
)
=>
number
):
void
{
let
newItemsIdx
=
0
;
for
(
let
i
=
0
;
i
<
this
.
_items
.
length
;
i
++
)
{
if
(
this
.
_incomplete
.
indexOf
(
this
.
_items
[
i
].
support
)
>=
0
)
{
...
...
@@ -137,7 +137,7 @@ export class CompletionModel {
match
=
item
.
highlights
!==
null
;
// no match on label nor codeSnippet -> check on filterText
if
(
!
match
&&
typeof
suggestion
.
filterText
===
'
string
'
)
{
if
(
!
match
&&
typeof
suggestion
.
filterText
===
'
string
'
)
{
if
(
!
isFalsyOrEmpty
(
filter
(
word
,
suggestion
.
filterText
)))
{
match
=
true
;
...
...
@@ -155,7 +155,7 @@ export class CompletionModel {
// compute score against word
const
wordLowerCase
=
word
.
toLowerCase
();
const
score
=
CompletionModel
.
_score
(
suggestion
.
insertText
,
word
,
wordLowerCase
);
const
score
=
CompletionModel
.
_score
ByHighlight
(
item
,
word
,
wordLowerCase
);
if
(
score
>
topScore
)
{
topScore
=
score
;
this
.
_topScoreIdx
=
this
.
_filteredItems
.
length
-
1
;
...
...
@@ -176,20 +176,22 @@ export class CompletionModel {
}
}
private
static
_score
(
suggestion
:
string
,
currentWord
:
string
,
currentWordLowerCase
:
string
):
number
{
const
suggestionLowerCase
=
suggestion
.
toLowerCase
()
;
private
static
_score
ByHighlight
(
item
:
ICompletionItem
,
currentWord
:
string
,
currentWordLowerCase
:
string
):
number
{
const
{
highlights
,
suggestion
}
=
item
;
let
score
=
0
;
for
(
let
i
=
0
,
len
=
Math
.
min
(
currentWord
.
length
,
suggestion
.
length
);
i
<
len
;
i
++
)
{
if
(
currentWord
[
i
]
===
suggestion
[
i
])
{
score
+=
2
;
}
else
if
(
currentWordLowerCase
[
i
]
===
suggestionLowerCase
[
i
])
{
score
+=
1
;
}
else
{
break
;
if
(
!
isFalsyOrEmpty
(
highlights
))
{
for
(
const
{
start
,
end
}
of
highlights
)
{
// find the highlight in the current word and
// score it based on case-match and start index
const
part
=
suggestion
.
label
.
substring
(
start
,
end
);
if
(
currentWord
.
indexOf
(
part
)
>=
0
)
{
score
+=
(
2
*
part
.
length
)
/
(
start
+
1
);
}
else
if
(
currentWordLowerCase
.
indexOf
(
part
)
>=
0
)
{
score
+=
part
.
length
/
(
start
+
1
);
}
}
}
return
score
;
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录