Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
e30a8a2e
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,发现更多精彩内容 >>
提交
e30a8a2e
编写于
4月 21, 2017
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
tree: initial tests
上级
702f2739
变更
3
显示空白变更内容
内联
并排
Showing
3 changed file
with
68 addition
and
4 deletion
+68
-4
src/vs/base/browser/ui/list/splice.ts
src/vs/base/browser/ui/list/splice.ts
+4
-0
src/vs/base/browser/ui/list/test/treeModel.test.ts
src/vs/base/browser/ui/list/test/treeModel.test.ts
+54
-0
src/vs/base/browser/ui/list/treeModel.ts
src/vs/base/browser/ui/list/treeModel.ts
+10
-4
未找到文件。
src/vs/base/browser/ui/list/splice.ts
浏览文件 @
e30a8a2e
...
...
@@ -9,6 +9,10 @@ export interface ISpliceable<T> {
splice
(
start
:
number
,
deleteCount
:
number
,
elements
:
T
[]):
void
;
}
export
interface
ISpreadSpliceable
<
T
>
{
splice
(
start
:
number
,
deleteCount
:
number
,
...
elements
:
T
[]):
void
;
}
export
class
CombinedSpliceable
<
T
>
implements
ISpliceable
<
T
>
{
constructor
(
private
spliceables
:
ISpliceable
<
T
>
[])
{
}
...
...
src/vs/base/browser/ui/list/test/treeModel.test.ts
0 → 100644
浏览文件 @
e30a8a2e
/*---------------------------------------------------------------------------------------------
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
import
*
as
assert
from
'
assert
'
;
import
{
TreeModel
,
ITreeNode
}
from
'
../treeModel
'
;
suite
(
'
TreeModel2
'
,
()
=>
{
test
(
'
ctor
'
,
()
=>
{
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
list
);
assert
(
model
);
assert
.
equal
(
list
.
length
,
0
);
});
test
(
'
insert
'
,
()
=>
{
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
list
);
model
.
splice
([
0
],
0
,
[
{
element
:
0
,
children
:
[]
},
{
element
:
1
,
children
:
[]
},
{
element
:
2
,
children
:
[]
}
]);
assert
.
deepEqual
(
list
.
length
,
3
);
assert
.
deepEqual
(
list
[
0
].
element
,
0
);
assert
.
deepEqual
(
list
[
0
].
children
,
[]);
assert
.
deepEqual
(
list
[
0
].
depth
,
1
);
assert
.
deepEqual
(
list
[
1
].
element
,
1
);
assert
.
deepEqual
(
list
[
1
].
children
,
[]);
assert
.
deepEqual
(
list
[
1
].
depth
,
1
);
assert
.
deepEqual
(
list
[
2
].
element
,
2
);
assert
.
deepEqual
(
list
[
2
].
children
,
[]);
assert
.
deepEqual
(
list
[
2
].
depth
,
1
);
});
test
(
'
delete
'
,
()
=>
{
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
list
);
model
.
splice
([
0
],
0
,
[
{
element
:
0
,
children
:
[]
},
{
element
:
1
,
children
:
[]
},
{
element
:
2
,
children
:
[]
}
]);
model
.
splice
([
0
],
3
,
[]);
assert
.
equal
(
list
.
length
,
0
);
});
});
\ No newline at end of file
src/vs/base/browser/ui/list/treeModel.ts
浏览文件 @
e30a8a2e
...
...
@@ -5,7 +5,7 @@
'
use strict
'
;
import
{
ISpliceable
}
from
'
./splice
'
;
import
{
ISp
readSp
liceable
}
from
'
./splice
'
;
export
interface
ITreeElement
<
T
>
{
element
:
T
;
...
...
@@ -14,7 +14,13 @@ export interface ITreeElement<T> {
export
type
TreeLocation
=
number
[];
export
class
TreeNode
<
T
>
{
export
interface
ITreeNode
<
T
>
{
readonly
element
:
T
;
readonly
children
:
ITreeNode
<
T
>
[];
readonly
depth
:
number
;
}
export
class
TreeNode
<
T
>
implements
ITreeNode
<
T
>
{
static
createRoot
<
T
>
():
TreeNode
<
T
>
{
return
new
TreeNode
<
T
>
({
children
:
[],
element
:
null
},
0
);
...
...
@@ -77,7 +83,7 @@ export class TreeModel<T> {
private
root
=
TreeNode
.
createRoot
<
T
>
();
constructor
(
private
spliceable
:
ISp
liceable
<
TreeNode
<
T
>>
)
{
}
constructor
(
private
spliceable
:
ISp
readSpliceable
<
I
TreeNode
<
T
>>
)
{
}
splice
(
start
:
TreeLocation
,
deleteCount
:
number
,
elements
:
ITreeElement
<
T
>
[]):
void
{
if
(
start
.
length
===
0
)
{
...
...
@@ -87,7 +93,7 @@ export class TreeModel<T> {
const
{
node
,
listIndex
}
=
this
.
findNode
(
start
,
this
.
root
,
0
);
const
{
listDeleteCount
,
listElements
}
=
node
.
splice
(
start
[
start
.
length
-
1
],
deleteCount
,
elements
);
this
.
spliceable
.
splice
(
listIndex
,
listDeleteCount
,
listElements
);
this
.
spliceable
.
splice
(
listIndex
,
listDeleteCount
,
...
listElements
);
}
private
findNode
(
location
:
TreeLocation
,
node
:
TreeNode
<
T
>
,
listIndex
:
number
):
{
node
:
TreeNode
<
T
>
;
listIndex
:
number
}
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录