Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
1454f1bb
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,发现更多精彩内容 >>
提交
1454f1bb
编写于
12月 20, 2017
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
hello tree my old friend
上级
08dbc340
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
23 addition
and
28 deletion
+23
-28
src/vs/base/browser/ui/list/treeModel.ts
src/vs/base/browser/ui/list/treeModel.ts
+22
-27
src/vs/base/test/browser/ui/list/treeModel.test.ts
src/vs/base/test/browser/ui/list/treeModel.test.ts
+1
-1
未找到文件。
src/vs/base/browser/ui/list/treeModel.ts
浏览文件 @
1454f1bb
...
...
@@ -17,13 +17,13 @@ export interface ITreeNode<T> {
readonly
depth
:
number
;
}
export
class
TreeNode
<
T
>
implements
ITreeNode
<
T
>
{
class
TreeNode
<
T
>
implements
ITreeNode
<
T
>
{
static
createRoot
<
T
>
():
TreeNode
<
T
>
{
const
node
=
new
TreeNode
<
T
>
();
node
.
_
children
=
[];
node
.
_
count
=
1
;
node
.
_
depth
=
0
;
node
.
children
=
[];
node
.
count
=
1
;
node
.
depth
=
0
;
return
node
;
}
...
...
@@ -31,34 +31,29 @@ export class TreeNode<T> implements ITreeNode<T> {
const
node
=
new
TreeNode
<
T
>
();
list
.
push
(
node
);
const
{
children
,
count
}
=
treeElement
.
children
.
reduce
((
r
,
e
)
=>
{
const
child
=
TreeNode
.
createNode
<
T
>
(
e
,
depth
+
1
,
list
);
r
.
children
.
push
(
child
);
r
.
count
+=
child
.
count
;
return
r
;
},
{
children
:
[]
as
TreeNode
<
T
>
[],
count
:
1
});
let
count
=
1
;
const
children
:
TreeNode
<
T
>
[]
=
[];
node
.
_element
=
treeElement
.
element
;
node
.
_children
=
children
;
node
.
_count
=
count
;
node
.
_depth
=
depth
;
for
(
const
element
of
treeElement
.
children
)
{
const
node
=
TreeNode
.
createNode
<
T
>
(
element
,
depth
+
1
,
list
);
children
.
push
(
node
);
count
+=
node
.
count
;
}
node
.
element
=
treeElement
.
element
;
node
.
children
=
children
;
node
.
count
=
count
;
node
.
depth
=
depth
;
return
node
;
}
private
_element
:
T
;
public
get
element
():
T
{
return
this
.
_element
;
}
private
_children
:
TreeNode
<
T
>
[];
public
get
children
():
TreeNode
<
T
>
[]
{
return
this
.
_children
;
}
private
_count
=
1
;
public
get
count
():
number
{
return
this
.
_count
;
}
private
_depth
:
number
;
public
get
depth
():
number
{
return
this
.
_depth
;
}
element
:
T
;
children
:
TreeNode
<
T
>
[];
count
:
number
;
depth
:
number
;
constructor
()
{
}
private
constructor
()
{
}
splice
(
index
:
number
,
deleteCount
:
number
,
elements
:
ITreeElement
<
T
>
[]):
{
listDeleteCount
:
number
;
listElements
:
ITreeNode
<
T
>
[];
}
{
const
listElements
=
[]
as
ITreeNode
<
T
>
[];
...
...
@@ -69,7 +64,7 @@ export class TreeNode<T> implements ITreeNode<T> {
const
deleted
=
this
.
children
.
splice
(
index
,
deleteCount
,
...
added
);
const
listDeleteCount
=
deleted
.
reduce
((
r
,
n
)
=>
r
+
n
.
count
,
0
);
this
.
_
count
+=
listAddCount
-
listDeleteCount
;
this
.
count
+=
listAddCount
-
listDeleteCount
;
return
{
listDeleteCount
,
listElements
};
}
}
...
...
src/vs/base/
browser/ui/list/te
st/treeModel.test.ts
→
src/vs/base/
test/browser/ui/li
st/treeModel.test.ts
浏览文件 @
1454f1bb
...
...
@@ -4,7 +4,7 @@
*--------------------------------------------------------------------------------------------*/
import
*
as
assert
from
'
assert
'
;
import
{
TreeModel
,
ITreeNode
}
from
'
..
/treeModel
'
;
import
{
TreeModel
,
ITreeNode
}
from
'
vs/base/browser/ui/list
/treeModel
'
;
suite
(
'
TreeModel2
'
,
()
=>
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录