Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
ebf10a30
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,发现更多精彩内容 >>
提交
ebf10a30
编写于
10月 02, 2018
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
tree: getNodeLocation tests
上级
5731c047
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
44 addition
and
17 deletion
+44
-17
src/vs/base/browser/ui/tree/tree.ts
src/vs/base/browser/ui/tree/tree.ts
+5
-5
src/vs/base/browser/ui/tree/treeModel.ts
src/vs/base/browser/ui/tree/treeModel.ts
+12
-12
src/vs/base/test/browser/ui/tree/treeModel.test.ts
src/vs/base/test/browser/ui/tree/treeModel.test.ts
+27
-0
未找到文件。
src/vs/base/browser/ui/tree/tree.ts
浏览文件 @
ebf10a30
...
...
@@ -6,7 +6,7 @@
import
'
vs/css!./tree
'
;
import
{
IDisposable
,
dispose
}
from
'
vs/base/common/lifecycle
'
;
import
{
IListOptions
,
List
,
IIdentityProvider
,
IMultipleSelectionController
}
from
'
vs/base/browser/ui/list/listWidget
'
;
import
{
TreeModel
,
ITreeNode
,
ITreeElement
,
getNodeLocation
,
ITreeModelOptions
}
from
'
vs/base/browser/ui/tree/treeModel
'
;
import
{
TreeModel
,
ITreeNode
,
ITreeElement
,
ITreeModelOptions
}
from
'
vs/base/browser/ui/tree/treeModel
'
;
import
{
Iterator
,
ISequence
}
from
'
vs/base/common/iterator
'
;
import
{
IVirtualDelegate
,
IRenderer
,
IListMouseEvent
}
from
'
vs/base/browser/ui/list/list
'
;
import
{
append
,
$
}
from
'
vs/base/browser/dom
'
;
...
...
@@ -184,7 +184,7 @@ export class Tree<T, TFilterData = void> implements IDisposable {
private
onMouseClick
(
e
:
IListMouseEvent
<
ITreeNode
<
T
,
TFilterData
>>
):
void
{
const
node
=
e
.
element
;
const
location
=
getNodeLocation
(
node
);
const
location
=
TreeModel
.
getNodeLocation
(
node
);
this
.
model
.
toggleCollapsed
(
location
);
}
...
...
@@ -200,7 +200,7 @@ export class Tree<T, TFilterData = void> implements IDisposable {
}
const
node
=
nodes
[
0
];
const
location
=
getNodeLocation
(
node
);
const
location
=
TreeModel
.
getNodeLocation
(
node
);
const
didChange
=
this
.
model
.
setCollapsed
(
location
,
true
);
if
(
!
didChange
)
{
...
...
@@ -227,7 +227,7 @@ export class Tree<T, TFilterData = void> implements IDisposable {
}
const
node
=
nodes
[
0
];
const
location
=
getNodeLocation
(
node
);
const
location
=
TreeModel
.
getNodeLocation
(
node
);
const
didChange
=
this
.
model
.
setCollapsed
(
location
,
false
);
if
(
!
didChange
)
{
...
...
@@ -254,7 +254,7 @@ export class Tree<T, TFilterData = void> implements IDisposable {
}
const
node
=
nodes
[
0
];
const
location
=
getNodeLocation
(
node
);
const
location
=
TreeModel
.
getNodeLocation
(
node
);
this
.
model
.
toggleCollapsed
(
location
);
}
...
...
src/vs/base/browser/ui/tree/treeModel.ts
浏览文件 @
ebf10a30
...
...
@@ -91,24 +91,24 @@ function getVisibleState(visibility: Visibility): boolean | undefined {
}
}
// TODO fix with visibility
export
function
getNodeLocation
<
T
>
(
node
:
ITreeNode
<
T
,
any
>
):
number
[]
{
const
location
=
[];
while
(
node
.
parent
)
{
location
.
push
(
node
.
parent
.
children
.
indexOf
(
node
));
node
=
node
.
parent
;
}
return
location
.
reverse
();
}
export
interface
ITreeModelOptions
<
T
,
TFilterData
=
void
>
{
filter
?:
ITreeFilter
<
T
,
TFilterData
>
;
}
export
class
TreeModel
<
T
,
TFilterData
=
void
>
{
// TODO fix with visibility
static
getNodeLocation
<
T
>
(
node
:
ITreeNode
<
T
,
any
>
):
number
[]
{
const
location
=
[];
while
(
node
.
parent
)
{
location
.
push
(
node
.
parent
.
children
.
indexOf
(
node
));
node
=
node
.
parent
;
}
return
location
.
reverse
();
}
private
root
:
IMutableTreeNode
<
T
,
TFilterData
>
=
{
parent
:
undefined
,
element
:
undefined
,
...
...
src/vs/base/test/browser/ui/tree/treeModel.test.ts
浏览文件 @
ebf10a30
...
...
@@ -440,4 +440,31 @@ suite('TreeModel2', function () {
assert
.
deepEqual
(
toArray
(
list
),
[
0
,
1
,
2
,
3
,
4
,
5
,
6
,
7
]);
});
suite
(
'
getNodeLocation
'
,
function
()
{
test
(
'
simple
'
,
function
()
{
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
0
,
children
:
Iterator
.
fromArray
([
{
element
:
10
},
{
element
:
11
},
{
element
:
12
},
])
},
{
element
:
1
},
{
element
:
2
}
]));
assert
.
deepEqual
(
TreeModel
.
getNodeLocation
(
list
[
0
]),
[
0
]);
assert
.
deepEqual
(
TreeModel
.
getNodeLocation
(
list
[
1
]),
[
0
,
0
]);
assert
.
deepEqual
(
TreeModel
.
getNodeLocation
(
list
[
2
]),
[
0
,
1
]);
assert
.
deepEqual
(
TreeModel
.
getNodeLocation
(
list
[
3
]),
[
0
,
2
]);
assert
.
deepEqual
(
TreeModel
.
getNodeLocation
(
list
[
4
]),
[
1
]);
assert
.
deepEqual
(
TreeModel
.
getNodeLocation
(
list
[
5
]),
[
2
]);
});
});
});
\ No newline at end of file
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录