Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
ccb75cd5
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,发现更多精彩内容 >>
提交
ccb75cd5
编写于
5月 15, 2017
作者:
J
Johannes Rieken
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
💄
上级
ec819e0b
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
22 addition
and
18 deletion
+22
-18
src/vs/base/common/arrays.ts
src/vs/base/common/arrays.ts
+14
-0
src/vs/editor/contrib/snippet/browser/snippetSession.ts
src/vs/editor/contrib/snippet/browser/snippetSession.ts
+8
-18
未找到文件。
src/vs/base/common/arrays.ts
浏览文件 @
ccb75cd5
...
...
@@ -66,6 +66,20 @@ export function findFirst<T>(array: T[], p: (x: T) => boolean): number {
return
low
;
}
export
function
groupBy
<
T
>
(
data
:
T
[],
compare
:
(
a
:
T
,
b
:
T
)
=>
number
):
T
[][]
{
const
result
:
T
[][]
=
[];
let
currentGroup
:
T
[];
for
(
const
element
of
data
.
slice
(
0
).
sort
(
compare
))
{
if
(
!
currentGroup
||
compare
(
currentGroup
[
0
],
element
)
!==
0
)
{
currentGroup
=
[
element
];
result
.
push
(
currentGroup
);
}
else
{
currentGroup
.
push
(
element
);
}
}
return
result
;
}
/**
* Takes two *sorted* arrays and computes their delta (removed, added elements).
* Finishes in `Math.min(before.length, after.length)` steps.
...
...
src/vs/editor/contrib/snippet/browser/snippetSession.ts
浏览文件 @
ccb75cd5
...
...
@@ -12,6 +12,7 @@ import { TextmateSnippet, Placeholder, SnippetParser } from '../common/snippetPa
import
{
Selection
}
from
'
vs/editor/common/core/selection
'
;
import
{
Range
}
from
'
vs/editor/common/core/range
'
;
import
{
IPosition
}
from
'
vs/editor/common/core/position
'
;
import
{
groupBy
}
from
'
vs/base/common/arrays
'
;
import
{
dispose
}
from
'
vs/base/common/lifecycle
'
;
import
{
EditorSnippetVariableResolver
}
from
"
vs/editor/contrib/snippet/common/snippetVariables
"
;
...
...
@@ -36,17 +37,19 @@ export class OneSnippet {
this
.
_editor
=
editor
;
this
.
_snippet
=
snippet
;
this
.
_offset
=
offset
;
this
.
_placeholderGroups
=
groupBy
(
snippet
.
placeholders
,
Placeholder
.
compareByIndex
);
this
.
_placeholderGroupsIdx
=
-
1
;
}
dispose
():
void
{
if
(
!
this
.
_placeholderDecorations
)
{
return
;
if
(
this
.
_placeholderDecorations
)
{
this
.
_editor
.
changeDecorations
(
accessor
=>
this
.
_placeholderDecorations
.
forEach
(
handle
=>
accessor
.
removeDecoration
(
handle
)))
;
}
this
.
_editor
.
changeDecorations
(
accessor
=>
this
.
_placeholderDecorations
.
forEach
(
handle
=>
accessor
.
removeDecoration
(
handle
)));
this
.
_placeholderGroups
.
length
=
0
;
}
private
_init
():
void
{
private
_init
Decorations
():
void
{
if
(
this
.
_placeholderDecorations
)
{
// already initialized
...
...
@@ -57,7 +60,6 @@ export class OneSnippet {
const
model
=
this
.
_editor
.
getModel
();
this
.
_editor
.
changeDecorations
(
accessor
=>
{
// create a decoration for each placeholder
for
(
const
placeholder
of
this
.
_snippet
.
placeholders
)
{
const
placeholderOffset
=
this
.
_snippet
.
offset
(
placeholder
);
...
...
@@ -71,23 +73,11 @@ export class OneSnippet {
this
.
_placeholderDecorations
.
set
(
placeholder
,
handle
);
}
});
this
.
_placeholderGroupsIdx
=
-
1
;
this
.
_placeholderGroups
=
[];
let
lastBucket
:
Placeholder
[];
this
.
_snippet
.
placeholders
.
slice
(
0
).
sort
(
Placeholder
.
compareByIndex
).
forEach
(
a
=>
{
if
(
!
lastBucket
||
lastBucket
[
0
].
index
!==
a
.
index
)
{
lastBucket
=
[
a
];
this
.
_placeholderGroups
.
push
(
lastBucket
);
}
else
{
lastBucket
.
push
(
a
);
}
});
}
move
(
fwd
:
boolean
):
Selection
[]
{
this
.
_init
();
this
.
_init
Decorations
();
if
(
fwd
&&
this
.
_placeholderGroupsIdx
<
this
.
_placeholderGroups
.
length
-
1
)
{
this
.
_placeholderGroupsIdx
+=
1
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录