Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
645d3550
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,发现更多精彩内容 >>
提交
645d3550
编写于
1月 28, 2019
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
fix tree model getListIndex
上级
5f4406ce
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
10 addition
and
8 deletion
+10
-8
src/vs/base/browser/ui/tree/indexTreeModel.ts
src/vs/base/browser/ui/tree/indexTreeModel.ts
+10
-8
未找到文件。
src/vs/base/browser/ui/tree/indexTreeModel.ts
浏览文件 @
645d3550
...
@@ -144,7 +144,8 @@ export class IndexTreeModel<T extends Exclude<any, undefined>, TFilterData = voi
...
@@ -144,7 +144,8 @@ export class IndexTreeModel<T extends Exclude<any, undefined>, TFilterData = voi
}
}
getListIndex
(
location
:
number
[]):
number
{
getListIndex
(
location
:
number
[]):
number
{
return
this
.
getTreeNodeWithListIndex
(
location
).
listIndex
;
const
{
listIndex
,
visible
}
=
this
.
getTreeNodeWithListIndex
(
location
);
return
visible
?
listIndex
:
-
1
;
}
}
getListRenderCount
(
location
:
number
[]):
number
{
getListRenderCount
(
location
:
number
[]):
number
{
...
@@ -423,12 +424,12 @@ export class IndexTreeModel<T extends Exclude<any, undefined>, TFilterData = voi
...
@@ -423,12 +424,12 @@ export class IndexTreeModel<T extends Exclude<any, undefined>, TFilterData = voi
}
}
// expensive
// expensive
private
getTreeNodeWithListIndex
(
location
:
number
[]):
{
node
:
IMutableTreeNode
<
T
,
TFilterData
>
,
listIndex
:
number
,
revealed
:
boolean
}
{
private
getTreeNodeWithListIndex
(
location
:
number
[]):
{
node
:
IMutableTreeNode
<
T
,
TFilterData
>
,
listIndex
:
number
,
revealed
:
boolean
,
visible
:
boolean
}
{
if
(
location
.
length
===
0
)
{
if
(
location
.
length
===
0
)
{
return
{
node
:
this
.
root
,
listIndex
:
-
1
,
revealed
:
true
};
return
{
node
:
this
.
root
,
listIndex
:
-
1
,
revealed
:
true
,
visible
:
false
};
}
}
const
{
parentNode
,
listIndex
,
revealed
}
=
this
.
getParentNodeWithListIndex
(
location
);
const
{
parentNode
,
listIndex
,
revealed
,
visible
}
=
this
.
getParentNodeWithListIndex
(
location
);
const
index
=
location
[
location
.
length
-
1
];
const
index
=
location
[
location
.
length
-
1
];
if
(
index
<
0
||
index
>
parentNode
.
children
.
length
)
{
if
(
index
<
0
||
index
>
parentNode
.
children
.
length
)
{
...
@@ -437,10 +438,10 @@ export class IndexTreeModel<T extends Exclude<any, undefined>, TFilterData = voi
...
@@ -437,10 +438,10 @@ export class IndexTreeModel<T extends Exclude<any, undefined>, TFilterData = voi
const
node
=
parentNode
.
children
[
index
];
const
node
=
parentNode
.
children
[
index
];
return
{
node
,
listIndex
,
revealed
};
return
{
node
,
listIndex
,
revealed
,
visible
:
visible
&&
node
.
visible
};
}
}
private
getParentNodeWithListIndex
(
location
:
number
[],
node
:
IMutableTreeNode
<
T
,
TFilterData
>
=
this
.
root
,
listIndex
:
number
=
0
,
revealed
=
true
):
{
parentNode
:
IMutableTreeNode
<
T
,
TFilterData
>
;
listIndex
:
number
;
revealed
:
boolean
;
}
{
private
getParentNodeWithListIndex
(
location
:
number
[],
node
:
IMutableTreeNode
<
T
,
TFilterData
>
=
this
.
root
,
listIndex
:
number
=
0
,
revealed
=
true
,
visible
=
true
):
{
parentNode
:
IMutableTreeNode
<
T
,
TFilterData
>
;
listIndex
:
number
;
revealed
:
boolean
;
visible
:
boolean
;
}
{
const
[
index
,
...
rest
]
=
location
;
const
[
index
,
...
rest
]
=
location
;
if
(
index
<
0
||
index
>
node
.
children
.
length
)
{
if
(
index
<
0
||
index
>
node
.
children
.
length
)
{
...
@@ -453,12 +454,13 @@ export class IndexTreeModel<T extends Exclude<any, undefined>, TFilterData = voi
...
@@ -453,12 +454,13 @@ export class IndexTreeModel<T extends Exclude<any, undefined>, TFilterData = voi
}
}
revealed
=
revealed
&&
!
node
.
collapsed
;
revealed
=
revealed
&&
!
node
.
collapsed
;
visible
=
visible
&&
node
.
visible
;
if
(
rest
.
length
===
0
)
{
if
(
rest
.
length
===
0
)
{
return
{
parentNode
:
node
,
listIndex
,
revealed
};
return
{
parentNode
:
node
,
listIndex
,
revealed
,
visible
};
}
}
return
this
.
getParentNodeWithListIndex
(
rest
,
node
.
children
[
index
],
listIndex
+
1
,
revealed
);
return
this
.
getParentNodeWithListIndex
(
rest
,
node
.
children
[
index
],
listIndex
+
1
,
revealed
,
visible
);
}
}
getNode
(
location
:
number
[]
=
[]):
ITreeNode
<
T
,
TFilterData
>
{
getNode
(
location
:
number
[]
=
[]):
ITreeNode
<
T
,
TFilterData
>
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录