Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
ac2bd0a4
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,发现更多精彩内容 >>
提交
ac2bd0a4
编写于
9月 24, 2018
作者:
J
Johannes Rieken
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
use actual word range and block ranges to compute distance
上级
39facdaf
变更
5
隐藏空白更改
内联
并排
Showing
5 changed file
with
37 addition
and
39 deletion
+37
-39
src/vs/editor/common/services/editorSimpleWorker.ts
src/vs/editor/common/services/editorSimpleWorker.ts
+9
-4
src/vs/editor/common/services/editorWorkerService.ts
src/vs/editor/common/services/editorWorkerService.ts
+2
-2
src/vs/editor/common/services/editorWorkerServiceImpl.ts
src/vs/editor/common/services/editorWorkerServiceImpl.ts
+5
-5
src/vs/editor/contrib/suggest/test/suggestModel.test.ts
src/vs/editor/contrib/suggest/test/suggestModel.test.ts
+1
-1
src/vs/editor/contrib/suggest/wordDistance.ts
src/vs/editor/contrib/suggest/wordDistance.ts
+20
-27
未找到文件。
src/vs/editor/common/services/editorSimpleWorker.ts
浏览文件 @
ac2bd0a4
...
...
@@ -500,13 +500,13 @@ export abstract class BaseEditorSimpleWorker {
//#region -- word ranges --
computeWord
Lines
(
modelUrl
:
string
,
range
:
IRange
,
wordDef
:
string
,
wordDefFlags
:
string
):
Promise
<
{
[
word
:
string
]:
number
[]
}
>
{
computeWord
Ranges
(
modelUrl
:
string
,
range
:
IRange
,
wordDef
:
string
,
wordDefFlags
:
string
):
Promise
<
{
[
word
:
string
]:
IRange
[]
}
>
{
let
model
=
this
.
_getModel
(
modelUrl
);
if
(
!
model
)
{
return
Promise
.
resolve
(
{}
);
return
Promise
.
resolve
(
Object
.
create
(
null
)
);
}
const
wordDefRegExp
=
new
RegExp
(
wordDef
,
wordDefFlags
);
const
result
:
{
[
word
:
string
]:
number
[]
}
=
Object
.
create
(
null
);
const
result
:
{
[
word
:
string
]:
IRange
[]
}
=
Object
.
create
(
null
);
for
(
let
line
=
range
.
startLineNumber
;
line
<
range
.
endLineNumber
;
line
++
)
{
let
words
=
model
.
getLineWords
(
line
,
wordDefRegExp
);
for
(
const
word
of
words
)
{
...
...
@@ -518,7 +518,12 @@ export abstract class BaseEditorSimpleWorker {
array
=
[];
result
[
word
.
word
]
=
array
;
}
array
.
push
(
line
);
array
.
push
({
startLineNumber
:
line
,
startColumn
:
word
.
startColumn
,
endLineNumber
:
line
,
endColumn
:
word
.
endColumn
});
}
}
return
Promise
.
resolve
(
result
);
...
...
src/vs/editor/common/services/editorWorkerService.ts
浏览文件 @
ac2bd0a4
...
...
@@ -25,8 +25,8 @@ export interface IEditorWorkerService {
computeMoreMinimalEdits
(
resource
:
URI
,
edits
:
TextEdit
[]):
TPromise
<
TextEdit
[]
>
;
canComputeWord
Lin
es
(
resource
:
URI
):
boolean
;
computeWord
Lines
(
resource
:
URI
,
range
:
IRange
):
TPromise
<
{
[
word
:
string
]:
number
[]
}
>
;
canComputeWord
Rang
es
(
resource
:
URI
):
boolean
;
computeWord
Ranges
(
resource
:
URI
,
range
:
IRange
):
TPromise
<
{
[
word
:
string
]:
IRange
[]
}
>
;
canNavigateValueSet
(
resource
:
URI
):
boolean
;
navigateValueSet
(
resource
:
URI
,
range
:
IRange
,
up
:
boolean
):
TPromise
<
IInplaceReplaceSupportResult
>
;
...
...
src/vs/editor/common/services/editorWorkerServiceImpl.ts
浏览文件 @
ac2bd0a4
...
...
@@ -108,12 +108,12 @@ export class EditorWorkerServiceImpl extends Disposable implements IEditorWorker
return
this
.
_workerManager
.
withWorker
().
then
(
client
=>
client
.
navigateValueSet
(
resource
,
range
,
up
));
}
canComputeWord
Lin
es
(
resource
:
URI
):
boolean
{
canComputeWord
Rang
es
(
resource
:
URI
):
boolean
{
return
canSyncModel
(
this
.
_modelService
,
resource
);
}
computeWord
Lines
(
resource
:
URI
,
range
:
IRange
):
TPromise
<
{
[
word
:
string
]:
number
[]
}
>
{
return
this
.
_workerManager
.
withWorker
().
then
(
client
=>
client
.
computeWord
Lin
es
(
resource
,
range
));
computeWord
Ranges
(
resource
:
URI
,
range
:
IRange
):
TPromise
<
{
[
word
:
string
]:
IRange
[]
}
>
{
return
this
.
_workerManager
.
withWorker
().
then
(
client
=>
client
.
computeWord
Rang
es
(
resource
,
range
));
}
}
...
...
@@ -422,7 +422,7 @@ export class EditorWorkerClient extends Disposable {
});
}
computeWord
Lines
(
resource
:
URI
,
range
:
IRange
):
TPromise
<
{
[
word
:
string
]:
number
[]
}
>
{
computeWord
Ranges
(
resource
:
URI
,
range
:
IRange
):
TPromise
<
{
[
word
:
string
]:
IRange
[]
}
>
{
return
this
.
_withSyncedResources
([
resource
]).
then
(
proxy
=>
{
let
model
=
this
.
_modelService
.
getModel
(
resource
);
if
(
!
model
)
{
...
...
@@ -431,7 +431,7 @@ export class EditorWorkerClient extends Disposable {
let
wordDefRegExp
=
LanguageConfigurationRegistry
.
getWordDefinition
(
model
.
getLanguageIdentifier
().
id
);
let
wordDef
=
wordDefRegExp
.
source
;
let
wordDefFlags
=
(
wordDefRegExp
.
global
?
'
g
'
:
''
)
+
(
wordDefRegExp
.
ignoreCase
?
'
i
'
:
''
)
+
(
wordDefRegExp
.
multiline
?
'
m
'
:
''
);
return
proxy
.
computeWord
Lin
es
(
resource
.
toString
(),
range
,
wordDef
,
wordDefFlags
);
return
proxy
.
computeWord
Rang
es
(
resource
.
toString
(),
range
,
wordDef
,
wordDefFlags
);
});
}
...
...
src/vs/editor/contrib/suggest/test/suggestModel.test.ts
浏览文件 @
ac2bd0a4
...
...
@@ -178,7 +178,7 @@ suite('SuggestModel - TriggerAndCancelOracle', function () {
return
new
Promise
((
resolve
,
reject
)
=>
{
const
editor
=
createMockEditor
(
model
);
const
oracle
=
new
SuggestModel
(
editor
,
new
class
extends
mock
<
IEditorWorkerService
>
()
{
computeWord
Lines
():
Promise
<
{
[
word
:
string
]:
number
[]
}
>
{
computeWord
Ranges
()
{
return
Promise
.
resolve
({});
}
...
...
src/vs/editor/contrib/suggest/wordDistance.ts
浏览文件 @
ac2bd0a4
...
...
@@ -28,52 +28,45 @@ export abstract class WordDistance {
const
model
=
editor
.
getModel
();
const
position
=
editor
.
getPosition
();
if
(
!
service
.
canComputeWordRanges
(
model
.
uri
))
{
return
Promise
.
resolve
(
WordDistance
.
None
);
}
// use token tree ranges
let
node
=
find
(
build
(
model
),
position
);
let
blockScores
=
new
Map
<
number
,
number
>
();
let
score
=
0
;
let
ranges
:
Range
[]
=
[];
let
stop
=
false
;
let
lastRange
:
Range
;
while
(
node
&&
!
stop
)
{
if
(
node
instanceof
Block
||
!
node
.
parent
)
{
// assign block score
score
+=
1
;
if
(
!
lastRange
)
{
for
(
let
line
=
node
.
start
.
lineNumber
;
line
<=
node
.
end
.
lineNumber
;
line
++
)
{
blockScores
.
set
(
line
,
score
);
}
}
else
{
for
(
let
line
=
node
.
start
.
lineNumber
;
line
<
lastRange
.
startLineNumber
;
line
++
)
{
blockScores
.
set
(
line
,
score
);
}
for
(
let
line
=
lastRange
.
endLineNumber
;
line
<=
node
.
end
.
lineNumber
;
line
++
)
{
blockScores
.
set
(
line
,
score
);
}
}
lastRange
=
node
.
range
;
ranges
.
push
(
node
.
range
);
stop
=
node
.
end
.
lineNumber
-
node
.
start
.
lineNumber
>=
100
;
}
node
=
node
.
parent
;
}
ranges
.
reverse
();
return
service
.
computeWord
Lines
(
model
.
uri
,
lastRange
).
then
(
lineNumber
s
=>
{
return
service
.
computeWord
Ranges
(
model
.
uri
,
ranges
[
0
]).
then
(
wordRange
s
=>
{
return
new
class
extends
WordDistance
{
distance
(
anchor
:
IPosition
,
word
:
string
)
{
if
(
!
lineNumber
s
||
!
position
.
equals
(
editor
.
getPosition
()))
{
if
(
!
wordRange
s
||
!
position
.
equals
(
editor
.
getPosition
()))
{
return
0
;
}
let
wordLines
=
lineNumber
s
[
word
];
let
wordLines
=
wordRange
s
[
word
];
if
(
isFalsyOrEmpty
(
wordLines
))
{
return
101
;
return
2
<<
20
;
}
let
idx
=
binarySearch
(
wordLines
,
anchor
.
lineNumber
,
(
a
,
b
)
=>
a
-
b
);
let
wordLineNumber
=
idx
>=
0
?
wordLines
[
idx
]
:
wordLines
[
Math
.
max
(
0
,
~
idx
-
1
)];
if
(
!
blockScores
.
has
(
wordLineNumber
))
{
return
101
;
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
)
{
if
(
!
Range
.
containsRange
(
range
,
bestWordRange
))
{
break
;
}
blockDistance
-=
1
;
}
return
block
Scores
.
get
(
wordLineNumber
)
;
return
block
Distance
;
}
};
});
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录