Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
3b647d9c
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,发现更多精彩内容 >>
提交
3b647d9c
编写于
9月 06, 2019
作者:
J
Johannes Rieken
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
💄
use asyn/await
上级
503c36d9
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
33 addition
and
35 deletion
+33
-35
src/vs/editor/contrib/suggest/wordDistance.ts
src/vs/editor/contrib/suggest/wordDistance.ts
+33
-35
未找到文件。
src/vs/editor/contrib/suggest/wordDistance.ts
浏览文件 @
3b647d9c
...
...
@@ -17,55 +17,53 @@ export abstract class WordDistance {
distance
()
{
return
0
;
}
};
static
create
(
service
:
IEditorWorkerService
,
editor
:
ICodeEditor
):
Promise
<
WordDistance
>
{
static
async
create
(
service
:
IEditorWorkerService
,
editor
:
ICodeEditor
):
Promise
<
WordDistance
>
{
if
(
!
editor
.
getConfiguration
().
contribInfo
.
suggest
.
localityBonus
)
{
return
Promise
.
resolve
(
WordDistance
.
None
)
;
return
WordDistance
.
None
;
}
if
(
!
editor
.
hasModel
())
{
return
Promise
.
resolve
(
WordDistance
.
None
)
;
return
WordDistance
.
None
;
}
const
model
=
editor
.
getModel
();
const
position
=
editor
.
getPosition
();
if
(
!
service
.
canComputeWordRanges
(
model
.
uri
))
{
return
Promise
.
resolve
(
WordDistance
.
None
)
;
return
WordDistance
.
None
;
}
return
new
BracketSelectionRangeProvider
().
provideSelectionRanges
(
model
,
[
position
]).
then
(
ranges
=>
{
if
(
!
ranges
||
ranges
.
length
===
0
||
ranges
[
0
].
length
===
0
)
{
return
WordDistance
.
None
;
}
return
service
.
computeWordRanges
(
model
.
uri
,
ranges
[
0
][
0
].
range
).
then
(
wordRanges
=>
{
return
new
class
extends
WordDistance
{
distance
(
anchor
:
IPosition
,
suggestion
:
CompletionItem
)
{
if
(
!
wordRanges
||
!
position
.
equals
(
editor
.
getPosition
()))
{
return
0
;
}
if
(
suggestion
.
kind
===
CompletionItemKind
.
Keyword
)
{
return
2
<<
20
;
}
let
word
=
suggestion
.
label
;
let
wordLines
=
wordRanges
[
word
];
if
(
isFalsyOrEmpty
(
wordLines
))
{
return
2
<<
20
;
}
let
idx
=
binarySearch
(
wordLines
,
Range
.
fromPositions
(
anchor
),
Range
.
compareRangesUsingStarts
);
let
bestWordRange
=
idx
>=
0
?
wordLines
[
idx
]
:
wordLines
[
Math
.
max
(
0
,
~
idx
-
1
)];
let
blockDistance
=
ranges
.
length
;
for
(
const
range
of
ranges
[
0
])
{
if
(
!
Range
.
containsRange
(
range
.
range
,
bestWordRange
))
{
break
;
}
blockDistance
-=
1
;
}
return
blockDistance
;
const
ranges
=
await
new
BracketSelectionRangeProvider
().
provideSelectionRanges
(
model
,
[
position
]);
if
(
!
ranges
||
ranges
.
length
===
0
||
ranges
[
0
].
length
===
0
)
{
return
WordDistance
.
None
;
}
const
wordRanges
=
await
service
.
computeWordRanges
(
model
.
uri
,
ranges
[
0
][
0
].
range
);
return
new
class
extends
WordDistance
{
distance
(
anchor
:
IPosition
,
suggestion
:
CompletionItem
)
{
if
(
!
wordRanges
||
!
position
.
equals
(
editor
.
getPosition
()))
{
return
0
;
}
if
(
suggestion
.
kind
===
CompletionItemKind
.
Keyword
)
{
return
2
<<
20
;
}
let
word
=
suggestion
.
label
;
let
wordLines
=
wordRanges
[
word
];
if
(
isFalsyOrEmpty
(
wordLines
))
{
return
2
<<
20
;
}
let
idx
=
binarySearch
(
wordLines
,
Range
.
fromPositions
(
anchor
),
Range
.
compareRangesUsingStarts
);
let
bestWordRange
=
idx
>=
0
?
wordLines
[
idx
]
:
wordLines
[
Math
.
max
(
0
,
~
idx
-
1
)];
let
blockDistance
=
ranges
.
length
;
for
(
const
range
of
ranges
[
0
])
{
if
(
!
Range
.
containsRange
(
range
.
range
,
bestWordRange
))
{
break
;
}
};
});
});
blockDistance
-=
1
;
}
return
blockDistance
;
}
};
}
abstract
distance
(
anchor
:
IPosition
,
suggestion
:
CompletionItem
):
number
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录