Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
a8bc6afa
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,发现更多精彩内容 >>
提交
a8bc6afa
编写于
11月 28, 2018
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
data tree: expand should be async
上级
1867a875
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
29 addition
and
4 deletion
+29
-4
src/vs/base/browser/ui/tree/dataTree.ts
src/vs/base/browser/ui/tree/dataTree.ts
+29
-4
未找到文件。
src/vs/base/browser/ui/tree/dataTree.ts
浏览文件 @
a8bc6afa
...
@@ -9,7 +9,7 @@ import { IListVirtualDelegate } from 'vs/base/browser/ui/list/list';
...
@@ -9,7 +9,7 @@ import { IListVirtualDelegate } from 'vs/base/browser/ui/list/list';
import
{
ITreeElement
,
ITreeNode
,
ITreeRenderer
}
from
'
vs/base/browser/ui/tree/tree
'
;
import
{
ITreeElement
,
ITreeNode
,
ITreeRenderer
}
from
'
vs/base/browser/ui/tree/tree
'
;
import
{
IDisposable
,
dispose
}
from
'
vs/base/common/lifecycle
'
;
import
{
IDisposable
,
dispose
}
from
'
vs/base/common/lifecycle
'
;
import
{
Emitter
,
Event
,
mapEvent
}
from
'
vs/base/common/event
'
;
import
{
Emitter
,
Event
,
mapEvent
}
from
'
vs/base/common/event
'
;
import
{
timeout
}
from
'
vs/base/common/async
'
;
import
{
timeout
,
always
}
from
'
vs/base/common/async
'
;
import
{
ISequence
}
from
'
vs/base/common/iterator
'
;
import
{
ISequence
}
from
'
vs/base/common/iterator
'
;
import
{
IListStyles
}
from
'
vs/base/browser/ui/list/listWidget
'
;
import
{
IListStyles
}
from
'
vs/base/browser/ui/list/listWidget
'
;
...
@@ -131,6 +131,7 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
...
@@ -131,6 +131,7 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
private
tree
:
ObjectTree
<
IDataTreeNode
<
T
>
,
TFilterData
>
;
private
tree
:
ObjectTree
<
IDataTreeNode
<
T
>
,
TFilterData
>
;
private
root
:
IDataTreeNode
<
T
>
;
private
root
:
IDataTreeNode
<
T
>
;
private
nodes
=
new
Map
<
T
|
null
,
IDataTreeNode
<
T
>>
();
private
nodes
=
new
Map
<
T
|
null
,
IDataTreeNode
<
T
>>
();
private
refreshPromises
=
new
Map
<
IDataTreeNode
<
T
>
,
Thenable
<
void
>>
();
private
_onDidChangeNodeState
=
new
Emitter
<
IDataTreeNode
<
T
>>
();
private
_onDidChangeNodeState
=
new
Emitter
<
IDataTreeNode
<
T
>>
();
...
@@ -208,8 +209,21 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
...
@@ -208,8 +209,21 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
return
this
.
tree
.
collapse
(
this
.
getNode
(
element
));
return
this
.
tree
.
collapse
(
this
.
getNode
(
element
));
}
}
expand
(
element
:
T
):
boolean
{
expand
(
element
:
T
):
Thenable
<
boolean
>
{
return
this
.
tree
.
expand
(
this
.
getNode
(
element
));
const
node
=
this
.
getNode
(
element
);
if
(
!
this
.
tree
.
isCollapsed
(
node
))
{
return
Promise
.
resolve
(
false
);
}
if
(
node
.
element
!
.
state
===
DataTreeNodeState
.
Uninitialized
)
{
const
result
=
this
.
refreshNode
(
node
,
ChildrenResolutionReason
.
Expand
);
this
.
tree
.
expand
(
node
);
return
result
.
then
(()
=>
true
);
}
this
.
tree
.
expand
(
node
);
return
Promise
.
resolve
(
true
);
}
}
toggleCollapsed
(
element
:
T
):
void
{
toggleCollapsed
(
element
:
T
):
void
{
...
@@ -319,6 +333,18 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
...
@@ -319,6 +333,18 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
}
}
private
refreshNode
(
node
:
IDataTreeNode
<
T
>
,
reason
:
ChildrenResolutionReason
):
Thenable
<
void
>
{
private
refreshNode
(
node
:
IDataTreeNode
<
T
>
,
reason
:
ChildrenResolutionReason
):
Thenable
<
void
>
{
let
result
=
this
.
refreshPromises
.
get
(
node
);
if
(
result
)
{
return
result
;
}
result
=
this
.
doRefresh
(
node
,
reason
);
this
.
refreshPromises
.
set
(
node
,
result
);
return
always
(
result
,
()
=>
this
.
refreshPromises
.
delete
(
node
));
}
private
doRefresh
(
node
:
IDataTreeNode
<
T
>
,
reason
:
ChildrenResolutionReason
):
Thenable
<
void
>
{
const
hasChildren
=
this
.
dataSource
.
hasChildren
(
node
.
element
);
const
hasChildren
=
this
.
dataSource
.
hasChildren
(
node
.
element
);
if
(
!
hasChildren
)
{
if
(
!
hasChildren
)
{
...
@@ -399,7 +425,6 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
...
@@ -399,7 +425,6 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
this
.
tree
.
setChildren
(
element
,
children
,
onDidCreateNode
,
onDidDeleteNode
);
this
.
tree
.
setChildren
(
element
,
children
,
onDidCreateNode
,
onDidDeleteNode
);
}
}
dispose
():
void
{
dispose
():
void
{
this
.
disposables
=
dispose
(
this
.
disposables
);
this
.
disposables
=
dispose
(
this
.
disposables
);
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录