Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
f971baa7
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,体验更适合开发者的 AI 搜索 >>
提交
f971baa7
编写于
10月 03, 2018
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
tree object model tests
上级
7513c288
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
104 addition
and
1 deletion
+104
-1
src/vs/base/browser/ui/tree/treeModel.ts
src/vs/base/browser/ui/tree/treeModel.ts
+2
-1
src/vs/base/browser/ui/tree/treeObjectModel.ts
src/vs/base/browser/ui/tree/treeObjectModel.ts
+2
-0
src/vs/base/test/browser/ui/tree/treeObjectModel.test.ts
src/vs/base/test/browser/ui/tree/treeObjectModel.test.ts
+100
-0
未找到文件。
src/vs/base/browser/ui/tree/treeModel.ts
浏览文件 @
f971baa7
...
...
@@ -133,7 +133,8 @@ export class TreeModel<T, TFilterData = void> {
const
lastIndex
=
location
[
location
.
length
-
1
];
const
deletedNodes
=
parentNode
.
children
.
splice
(
lastIndex
,
deleteCount
,
...
nodesToInsert
);
const
visibleDeleteCount
=
deletedNodes
.
reduce
((
r
,
node
)
=>
r
+
node
.
revealedCount
,
0
);
parentNode
.
revealedCount
+=
revealedCount
-
visibleDeleteCount
;
this
.
_updateAncestorsRevealedCount
(
parentNode
,
revealedCount
-
visibleDeleteCount
);
if
(
revealed
)
{
this
.
list
.
splice
(
listIndex
,
visibleDeleteCount
,
treeListElementsToInsert
);
...
...
src/vs/base/browser/ui/tree/treeObjectModel.ts
浏览文件 @
f971baa7
...
...
@@ -14,6 +14,8 @@ export class TreeObjectModel<T extends NonNullable<any>, TFilterData = void> {
private
model
:
TreeModel
<
T
,
TFilterData
>
;
private
nodes
=
new
Map
<
T
,
ITreeNode
<
T
,
TFilterData
>>
();
get
size
():
number
{
return
this
.
nodes
.
size
;
}
constructor
(
list
:
ISpliceable
<
ITreeNode
<
T
,
TFilterData
>>
,
options
:
ITreeModelOptions
<
T
,
TFilterData
>
=
{})
{
this
.
model
=
new
TreeModel
(
list
,
options
);
}
...
...
src/vs/base/test/browser/ui/tree/treeObjectModel.test.ts
0 → 100644
浏览文件 @
f971baa7
/*---------------------------------------------------------------------------------------------
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
import
*
as
assert
from
'
assert
'
;
import
{
ITreeNode
}
from
'
vs/base/browser/ui/tree/treeModel
'
;
import
{
ISpliceable
}
from
'
vs/base/common/sequence
'
;
import
{
TreeObjectModel
}
from
'
vs/base/browser/ui/tree/treeObjectModel
'
;
import
{
Iterator
}
from
'
vs/base/common/iterator
'
;
function
toSpliceable
<
T
>
(
arr
:
T
[]):
ISpliceable
<
T
>
{
return
{
splice
(
start
:
number
,
deleteCount
:
number
,
elements
:
T
[]):
void
{
arr
.
splice
(
start
,
deleteCount
,
...
elements
);
}
};
}
function
toArray
<
T
>
(
list
:
ITreeNode
<
T
>
[]):
T
[]
{
return
list
.
map
(
i
=>
i
.
element
);
}
suite
(
'
TreeObjectModel
'
,
function
()
{
test
(
'
ctor
'
,
()
=>
{
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeObjectModel
<
number
>
(
toSpliceable
(
list
));
assert
(
model
);
assert
.
equal
(
list
.
length
,
0
);
assert
.
equal
(
model
.
size
,
0
);
});
test
(
'
flat
'
,
()
=>
{
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeObjectModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
(
null
,
0
,
0
,
Iterator
.
fromArray
([
{
element
:
0
},
{
element
:
1
},
{
element
:
2
}
]));
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
1
,
2
]);
assert
.
equal
(
model
.
size
,
3
);
model
.
splice
(
null
,
3
,
0
,
Iterator
.
fromArray
([
{
element
:
3
},
{
element
:
4
},
{
element
:
5
},
]));
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
1
,
2
,
3
,
4
,
5
]);
assert
.
equal
(
model
.
size
,
6
);
model
.
splice
(
null
,
2
,
2
);
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
1
,
4
,
5
]);
assert
.
equal
(
model
.
size
,
4
);
});
test
(
'
nested
'
,
()
=>
{
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeObjectModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
(
null
,
0
,
0
,
Iterator
.
fromArray
([
{
element
:
0
,
children
:
Iterator
.
fromArray
([
{
element
:
10
},
{
element
:
11
},
{
element
:
12
},
])
},
{
element
:
1
},
{
element
:
2
}
]));
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
10
,
11
,
12
,
1
,
2
]);
assert
.
equal
(
model
.
size
,
6
);
model
.
splice
(
12
,
0
,
0
,
Iterator
.
fromArray
([
{
element
:
120
},
{
element
:
121
}
]));
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
10
,
11
,
12
,
120
,
121
,
1
,
2
]);
assert
.
equal
(
model
.
size
,
8
);
model
.
splice
(
0
,
1
,
1
);
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
10
,
12
,
120
,
121
,
1
,
2
]);
assert
.
equal
(
model
.
size
,
7
);
model
.
splice
(
null
,
0
,
1
);
assert
.
deepEqual
(
toArray
(
list
),
[
1
,
2
]);
assert
.
equal
(
model
.
size
,
2
);
model
.
splice
(
null
,
0
,
2
);
assert
.
deepEqual
(
toArray
(
list
),
[]);
assert
.
equal
(
model
.
size
,
0
);
});
});
\ No newline at end of file
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录