Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
2c72fd0f
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,发现更多精彩内容 >>
提交
2c72fd0f
编写于
10月 03, 2018
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
tree om: setChildren
上级
f971baa7
变更
2
显示空白变更内容
内联
并排
Showing
2 changed file
with
15 addition
and
19 deletion
+15
-19
src/vs/base/browser/ui/tree/treeObjectModel.ts
src/vs/base/browser/ui/tree/treeObjectModel.ts
+2
-2
src/vs/base/test/browser/ui/tree/treeObjectModel.test.ts
src/vs/base/test/browser/ui/tree/treeObjectModel.test.ts
+13
-17
未找到文件。
src/vs/base/browser/ui/tree/treeObjectModel.ts
浏览文件 @
2c72fd0f
...
@@ -20,7 +20,7 @@ export class TreeObjectModel<T extends NonNullable<any>, TFilterData = void> {
...
@@ -20,7 +20,7 @@ export class TreeObjectModel<T extends NonNullable<any>, TFilterData = void> {
this
.
model
=
new
TreeModel
(
list
,
options
);
this
.
model
=
new
TreeModel
(
list
,
options
);
}
}
s
plice
(
element
:
T
|
null
,
start
:
number
,
deleteCount
:
number
,
toInsert
?:
ISequence
<
ITreeElement
<
T
>>
):
Iterator
<
ITreeElement
<
T
>>
{
s
etChildren
(
element
:
T
|
null
,
children
?:
ISequence
<
ITreeElement
<
T
>>
):
Iterator
<
ITreeElement
<
T
>>
{
const
location
=
this
.
getLocation
(
element
);
const
location
=
this
.
getLocation
(
element
);
const
insertedElements
=
new
Set
<
T
>
();
const
insertedElements
=
new
Set
<
T
>
();
...
@@ -35,7 +35,7 @@ export class TreeObjectModel<T extends NonNullable<any>, TFilterData = void> {
...
@@ -35,7 +35,7 @@ export class TreeObjectModel<T extends NonNullable<any>, TFilterData = void> {
}
}
};
};
return
this
.
model
.
splice
([...
location
,
start
],
deleteCount
,
toInsert
,
onDidCreateNode
,
onDidDeleteNode
);
return
this
.
model
.
splice
([...
location
,
0
],
Number
.
MAX_VALUE
,
children
,
onDidCreateNode
,
onDidDeleteNode
);
}
}
getListIndex
(
element
:
T
):
number
{
getListIndex
(
element
:
T
):
number
{
...
...
src/vs/base/test/browser/ui/tree/treeObjectModel.test.ts
浏览文件 @
2c72fd0f
...
@@ -35,7 +35,7 @@ suite('TreeObjectModel', function () {
...
@@ -35,7 +35,7 @@ suite('TreeObjectModel', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeObjectModel
<
number
>
(
toSpliceable
(
list
));
const
model
=
new
TreeObjectModel
<
number
>
(
toSpliceable
(
list
));
model
.
s
plice
(
null
,
0
,
0
,
Iterator
.
fromArray
([
model
.
s
etChildren
(
null
,
Iterator
.
fromArray
([
{
element
:
0
},
{
element
:
0
},
{
element
:
1
},
{
element
:
1
},
{
element
:
2
}
{
element
:
2
}
...
@@ -44,25 +44,25 @@ suite('TreeObjectModel', function () {
...
@@ -44,25 +44,25 @@ suite('TreeObjectModel', function () {
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
1
,
2
]);
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
1
,
2
]);
assert
.
equal
(
model
.
size
,
3
);
assert
.
equal
(
model
.
size
,
3
);
model
.
s
plice
(
null
,
3
,
0
,
Iterator
.
fromArray
([
model
.
s
etChildren
(
null
,
Iterator
.
fromArray
([
{
element
:
3
},
{
element
:
3
},
{
element
:
4
},
{
element
:
4
},
{
element
:
5
},
{
element
:
5
},
]));
]));
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
1
,
2
,
3
,
4
,
5
]);
assert
.
deepEqual
(
toArray
(
list
),
[
3
,
4
,
5
]);
assert
.
equal
(
model
.
size
,
6
);
assert
.
equal
(
model
.
size
,
3
);
model
.
s
plice
(
null
,
2
,
2
);
model
.
s
etChildren
(
null
);
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
1
,
4
,
5
]);
assert
.
deepEqual
(
toArray
(
list
),
[]);
assert
.
equal
(
model
.
size
,
4
);
assert
.
equal
(
model
.
size
,
0
);
});
});
test
(
'
nested
'
,
()
=>
{
test
(
'
nested
'
,
()
=>
{
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeObjectModel
<
number
>
(
toSpliceable
(
list
));
const
model
=
new
TreeObjectModel
<
number
>
(
toSpliceable
(
list
));
model
.
s
plice
(
null
,
0
,
0
,
Iterator
.
fromArray
([
model
.
s
etChildren
(
null
,
Iterator
.
fromArray
([
{
{
element
:
0
,
children
:
Iterator
.
fromArray
([
element
:
0
,
children
:
Iterator
.
fromArray
([
{
element
:
10
},
{
element
:
10
},
...
@@ -77,7 +77,7 @@ suite('TreeObjectModel', function () {
...
@@ -77,7 +77,7 @@ suite('TreeObjectModel', function () {
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
10
,
11
,
12
,
1
,
2
]);
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
10
,
11
,
12
,
1
,
2
]);
assert
.
equal
(
model
.
size
,
6
);
assert
.
equal
(
model
.
size
,
6
);
model
.
s
plice
(
12
,
0
,
0
,
Iterator
.
fromArray
([
model
.
s
etChildren
(
12
,
Iterator
.
fromArray
([
{
element
:
120
},
{
element
:
120
},
{
element
:
121
}
{
element
:
121
}
]));
]));
...
@@ -85,15 +85,11 @@ suite('TreeObjectModel', function () {
...
@@ -85,15 +85,11 @@ suite('TreeObjectModel', function () {
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
10
,
11
,
12
,
120
,
121
,
1
,
2
]);
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
10
,
11
,
12
,
120
,
121
,
1
,
2
]);
assert
.
equal
(
model
.
size
,
8
);
assert
.
equal
(
model
.
size
,
8
);
model
.
splice
(
0
,
1
,
1
);
model
.
setChildren
(
0
);
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
10
,
12
,
120
,
121
,
1
,
2
]);
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
1
,
2
]);
assert
.
equal
(
model
.
size
,
7
);
assert
.
equal
(
model
.
size
,
3
);
model
.
splice
(
null
,
0
,
1
);
assert
.
deepEqual
(
toArray
(
list
),
[
1
,
2
]);
assert
.
equal
(
model
.
size
,
2
);
model
.
s
plice
(
null
,
0
,
2
);
model
.
s
etChildren
(
null
);
assert
.
deepEqual
(
toArray
(
list
),
[]);
assert
.
deepEqual
(
toArray
(
list
),
[]);
assert
.
equal
(
model
.
size
,
0
);
assert
.
equal
(
model
.
size
,
0
);
});
});
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录