Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
ad569df8
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,发现更多精彩内容 >>
提交
ad569df8
编写于
11月 28, 2018
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
expose DataTree.getNode
上级
a8bc6afa
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
23 addition
and
17 deletion
+23
-17
src/vs/base/browser/ui/tree/dataTree.ts
src/vs/base/browser/ui/tree/dataTree.ts
+23
-17
未找到文件。
src/vs/base/browser/ui/tree/dataTree.ts
浏览文件 @
ad569df8
...
...
@@ -196,21 +196,21 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
// Data Tree
refresh
(
element
:
T
|
null
):
Thenable
<
void
>
{
return
this
.
refreshNode
(
this
.
getNode
(
element
),
ChildrenResolutionReason
.
Refresh
);
return
this
.
refreshNode
(
this
.
get
Data
Node
(
element
),
ChildrenResolutionReason
.
Refresh
);
}
// Tree
get
visibleNodeCount
():
number
{
return
this
.
tree
.
visibleNodeCount
;
get
Node
(
element
:
T
|
null
):
ITreeNode
<
T
,
TFilterData
>
{
return
new
DataTreeNodeWrapper
(
this
.
tree
.
getNode
(
this
.
getDataNode
(
element
)))
;
}
collapse
(
element
:
T
):
boolean
{
return
this
.
tree
.
collapse
(
this
.
getNode
(
element
));
return
this
.
tree
.
collapse
(
this
.
get
Data
Node
(
element
));
}
expand
(
element
:
T
):
Thenable
<
boolean
>
{
const
node
=
this
.
getNode
(
element
);
const
node
=
this
.
get
Data
Node
(
element
);
if
(
!
this
.
tree
.
isCollapsed
(
node
))
{
return
Promise
.
resolve
(
false
);
...
...
@@ -227,7 +227,7 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
}
toggleCollapsed
(
element
:
T
):
void
{
this
.
tree
.
toggleCollapsed
(
this
.
getNode
(
element
));
this
.
tree
.
toggleCollapsed
(
this
.
get
Data
Node
(
element
));
}
collapseAll
():
void
{
...
...
@@ -235,11 +235,11 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
}
isCollapsed
(
element
:
T
):
boolean
{
return
this
.
tree
.
isCollapsed
(
this
.
getNode
(
element
));
return
this
.
tree
.
isCollapsed
(
this
.
get
Data
Node
(
element
));
}
isExpanded
(
element
:
T
):
boolean
{
return
this
.
tree
.
isExpanded
(
this
.
getNode
(
element
));
return
this
.
tree
.
isExpanded
(
this
.
get
Data
Node
(
element
));
}
refilter
():
void
{
...
...
@@ -247,7 +247,7 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
}
setSelection
(
elements
:
T
[],
browserEvent
?:
UIEvent
):
void
{
const
nodes
=
elements
.
map
(
e
=>
this
.
getNode
(
e
));
const
nodes
=
elements
.
map
(
e
=>
this
.
get
Data
Node
(
e
));
this
.
tree
.
setSelection
(
nodes
,
browserEvent
);
}
...
...
@@ -257,7 +257,7 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
}
setFocus
(
elements
:
T
[],
browserEvent
?:
UIEvent
):
void
{
const
nodes
=
elements
.
map
(
e
=>
this
.
getNode
(
e
));
const
nodes
=
elements
.
map
(
e
=>
this
.
get
Data
Node
(
e
));
this
.
tree
.
setFocus
(
nodes
,
browserEvent
);
}
...
...
@@ -291,38 +291,44 @@ export class DataTree<T extends NonNullable<any>, TFilterData = void> implements
}
open
(
elements
:
T
[]):
void
{
const
nodes
=
elements
.
map
(
e
=>
this
.
getNode
(
e
));
const
nodes
=
elements
.
map
(
e
=>
this
.
get
Data
Node
(
e
));
this
.
tree
.
open
(
nodes
);
}
reveal
(
element
:
T
,
relativeTop
?:
number
):
void
{
this
.
tree
.
reveal
(
this
.
getNode
(
element
),
relativeTop
);
this
.
tree
.
reveal
(
this
.
get
Data
Node
(
element
),
relativeTop
);
}
getRelativeTop
(
element
:
T
):
number
|
null
{
return
this
.
tree
.
getRelativeTop
(
this
.
getNode
(
element
));
return
this
.
tree
.
getRelativeTop
(
this
.
get
Data
Node
(
element
));
}
// Tree navigation
getParentElement
(
element
:
T
):
T
|
null
{
const
node
=
this
.
tree
.
getParentElement
(
this
.
getNode
(
element
));
const
node
=
this
.
tree
.
getParentElement
(
this
.
get
Data
Node
(
element
));
return
node
&&
node
.
element
;
}
getFirstElementChild
(
element
:
T
|
null
=
null
):
T
|
null
{
const
node
=
this
.
tree
.
getFirstElementChild
(
this
.
getNode
(
element
));
const
node
=
this
.
tree
.
getFirstElementChild
(
this
.
get
Data
Node
(
element
));
return
node
&&
node
.
element
;
}
getLastElementAncestor
(
element
:
T
|
null
=
null
):
T
|
null
{
const
node
=
this
.
tree
.
getLastElementAncestor
(
this
.
getNode
(
element
));
const
node
=
this
.
tree
.
getLastElementAncestor
(
this
.
get
Data
Node
(
element
));
return
node
&&
node
.
element
;
}
// List
get
visibleNodeCount
():
number
{
return
this
.
tree
.
visibleNodeCount
;
}
// Implementation
private
getNode
(
element
:
T
|
null
):
IDataTreeNode
<
T
>
{
private
get
Data
Node
(
element
:
T
|
null
):
IDataTreeNode
<
T
>
{
const
node
:
IDataTreeNode
<
T
>
=
this
.
nodes
.
get
(
element
);
if
(
typeof
node
===
'
undefined
'
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录