Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
78a78a3d
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,发现更多精彩内容 >>
提交
78a78a3d
编写于
4月 20, 2017
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
wip: tree model
上级
b83f0b2f
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
100 addition
and
0 deletion
+100
-0
src/vs/base/browser/ui/tree/treeModel.ts
src/vs/base/browser/ui/tree/treeModel.ts
+100
-0
未找到文件。
src/vs/base/browser/ui/tree/treeModel.ts
0 → 100644
浏览文件 @
78a78a3d
/*---------------------------------------------------------------------------------------------
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
'
use strict
'
;
export
interface
ITreeElement
<
T
>
{
element
:
T
;
children
:
ITreeElement
<
T
>
[];
}
export
interface
ITreeNode
<
T
>
{
readonly
element
:
T
;
readonly
children
:
ITreeNode
<
T
>
[];
readonly
depth
:
number
;
count
:
number
;
}
export
type
TreeLocation
=
number
[];
function
createNode
<
T
>
(
depth
:
number
,
element
:
ITreeElement
<
T
>
,
list
:
ITreeNode
<
T
>
[]):
ITreeNode
<
T
>
{
const
node
=
{
element
:
element
.
element
,
children
:
null
,
depth
,
count
:
0
};
list
.
push
(
node
);
const
children
=
element
.
children
.
map
(
e
=>
createNode
(
depth
+
1
,
element
,
list
));
node
.
children
=
children
;
node
.
count
=
children
.
reduce
((
r
,
n
)
=>
r
+
n
.
count
,
0
);
return
node
;
}
function
createNodes
<
T
>
(
depth
:
number
,
elements
:
ITreeElement
<
T
>
[]):
{
nodes
:
ITreeNode
<
T
>
[];
list
:
ITreeNode
<
T
>
[]
}
{
const
list
:
ITreeNode
<
T
>
[]
=
[];
const
nodes
=
elements
.
map
(
e
=>
createNode
(
depth
,
e
,
list
));
return
{
nodes
,
list
};
}
export
class
TreeNode
<
T
>
{
constructor
()
{
}
splice
(
childIndex
:
number
,
deleteCount
:
number
,
elements
:
ITreeElement
<
T
>
[])
{
// TODO?
}
}
export
class
TreeModel
<
T
>
{
private
list
:
ITreeNode
<
T
>
[]
=
[];
private
root
:
ITreeNode
<
T
>
=
{
element
:
null
as
T
,
children
:
[],
depth
:
0
,
count
:
0
};
splice
(
start
:
TreeLocation
,
deleteCount
:
number
,
elements
:
ITreeElement
<
T
>
[])
{
if
(
start
.
length
===
0
)
{
throw
new
Error
(
'
Invalid tree location
'
);
}
return
this
.
spliceRecursive
(
this
.
root
,
0
,
start
,
deleteCount
,
elements
);
}
private
spliceRecursive
(
node
:
ITreeNode
<
T
>
,
listIndex
:
number
,
location
:
TreeLocation
,
deleteCount
:
number
,
elements
:
ITreeElement
<
T
>
[])
{
const
[
i
,
...
rest
]
=
location
;
if
(
rest
.
length
>
0
)
{
for
(
let
j
=
0
;
j
<
i
;
j
++
)
{
listIndex
+=
node
.
children
[
j
].
count
;
}
return
this
.
spliceRecursive
(
node
.
children
[
i
],
listIndex
,
rest
,
deleteCount
,
elements
);
}
else
{
return
this
.
spliceNode
(
node
,
listIndex
,
i
,
deleteCount
,
elements
);
}
}
private
spliceNode
(
node
:
ITreeNode
<
T
>
,
listIndex
:
number
,
childIndex
:
number
,
deleteCount
:
number
,
elements
:
ITreeElement
<
T
>
[])
{
const
depth
=
node
.
depth
;
const
{
nodes
,
list
}
=
createNodes
(
depth
,
elements
);
const
countAdd
=
nodes
.
reduce
((
r
,
n
)
=>
r
+
n
.
count
,
0
);
const
deleted
=
node
.
children
.
splice
(
childIndex
,
deleteCount
,
...
nodes
);
const
countSubtract
=
deleted
.
reduce
((
r
,
n
)
=>
r
+
n
.
count
,
0
);
node
.
count
+=
countAdd
-
countSubtract
;
this
.
list
.
splice
(
listIndex
,
countSubtract
,
...
list
);
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录