Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
d3c1eda9
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,发现更多精彩内容 >>
提交
d3c1eda9
编写于
9月 21, 2018
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Iterator.fromArray
上级
2308643f
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
22 addition
and
22 deletion
+22
-22
src/vs/base/browser/ui/tree/treeModel.ts
src/vs/base/browser/ui/tree/treeModel.ts
+3
-3
src/vs/base/common/iterator.ts
src/vs/base/common/iterator.ts
+2
-2
src/vs/base/test/browser/ui/tree/treeModel.test.ts
src/vs/base/test/browser/ui/tree/treeModel.test.ts
+17
-17
未找到文件。
src/vs/base/browser/ui/tree/treeModel.ts
浏览文件 @
d3c1eda9
...
...
@@ -77,7 +77,7 @@ function getTreeElementIterator<T>(elements: Iterator<ITreeElement<T>> | ITreeEl
if
(
!
elements
)
{
return
Iterator
.
empty
();
}
else
if
(
Array
.
isArray
(
elements
))
{
return
Iterator
.
iterate
(
elements
);
return
Iterator
.
fromArray
(
elements
);
}
else
{
return
elements
;
}
...
...
@@ -102,7 +102,7 @@ function treeElementToNode<T>(treeElement: ITreeElement<T>, parent: IMutableTree
function
treeNodeToElement
<
T
>
(
node
:
IMutableTreeNode
<
T
>
):
ITreeElement
<
T
>
{
const
{
element
,
collapsed
}
=
node
;
const
children
=
Iterator
.
map
(
Iterator
.
iterate
(
node
.
children
),
treeNodeToElement
);
const
children
=
Iterator
.
map
(
Iterator
.
fromArray
(
node
.
children
),
treeNodeToElement
);
return
{
element
,
children
,
collapsed
};
}
...
...
@@ -155,7 +155,7 @@ export class TreeModel<T> {
this
.
list
.
splice
(
listIndex
,
visibleDeleteCount
,
treeListElementsToInsert
);
}
return
Iterator
.
map
(
Iterator
.
iterate
(
deletedNodes
),
treeNodeToElement
);
return
Iterator
.
map
(
Iterator
.
fromArray
(
deletedNodes
),
treeNodeToElement
);
}
getListIndex
(
location
:
number
[]):
number
{
...
...
src/vs/base/common/iterator.ts
浏览文件 @
d3c1eda9
...
...
@@ -25,7 +25,7 @@ export module Iterator {
return
_empty
;
}
export
function
iterate
<
T
>
(
array
:
T
[],
index
=
0
,
length
=
array
.
length
):
Iterator
<
T
>
{
export
function
fromArray
<
T
>
(
array
:
T
[],
index
=
0
,
length
=
array
.
length
):
Iterator
<
T
>
{
return
{
next
():
IteratorResult
<
T
>
{
if
(
index
>=
length
)
{
...
...
@@ -81,7 +81,7 @@ export type ISequence<T> = Iterator<T> | T[];
export
function
getSequenceIterator
<
T
>
(
arg
:
Iterator
<
T
>
|
T
[]):
Iterator
<
T
>
{
if
(
Array
.
isArray
(
arg
))
{
return
Iterator
.
iterate
(
arg
);
return
Iterator
.
fromArray
(
arg
);
}
else
{
return
arg
;
}
...
...
src/vs/base/test/browser/ui/tree/treeModel.test.ts
浏览文件 @
d3c1eda9
...
...
@@ -33,7 +33,7 @@ suite('TreeModel2', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
iterate
([
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
0
},
{
element
:
1
},
{
element
:
2
}
...
...
@@ -55,9 +55,9 @@ suite('TreeModel2', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
iterate
([
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
0
,
children
:
Iterator
.
iterate
([
element
:
0
,
children
:
Iterator
.
fromArray
([
{
element
:
10
},
{
element
:
11
},
{
element
:
12
},
...
...
@@ -92,9 +92,9 @@ suite('TreeModel2', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
iterate
([
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
0
,
collapsed
:
true
,
children
:
Iterator
.
iterate
([
element
:
0
,
collapsed
:
true
,
children
:
Iterator
.
fromArray
([
{
element
:
10
},
{
element
:
11
},
{
element
:
12
},
...
...
@@ -120,7 +120,7 @@ suite('TreeModel2', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
iterate
([
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
0
},
{
element
:
1
},
{
element
:
2
}
...
...
@@ -145,9 +145,9 @@ suite('TreeModel2', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
iterate
([
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
0
,
children
:
Iterator
.
iterate
([
element
:
0
,
children
:
Iterator
.
fromArray
([
{
element
:
10
},
{
element
:
11
},
{
element
:
12
},
...
...
@@ -179,9 +179,9 @@ suite('TreeModel2', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
iterate
([
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
0
,
children
:
Iterator
.
iterate
([
element
:
0
,
children
:
Iterator
.
fromArray
([
{
element
:
10
},
{
element
:
11
},
{
element
:
12
},
...
...
@@ -207,9 +207,9 @@ suite('TreeModel2', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
iterate
([
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
0
,
collapsed
:
true
,
children
:
Iterator
.
iterate
([
element
:
0
,
collapsed
:
true
,
children
:
Iterator
.
fromArray
([
{
element
:
10
},
{
element
:
11
},
{
element
:
12
},
...
...
@@ -232,9 +232,9 @@ suite('TreeModel2', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
iterate
([
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
0
,
children
:
Iterator
.
iterate
([
element
:
0
,
children
:
Iterator
.
fromArray
([
{
element
:
10
},
{
element
:
11
},
{
element
:
12
},
...
...
@@ -263,9 +263,9 @@ suite('TreeModel2', function () {
// const list = [] as ITreeNode<number>[];
// const model = new TreeModel<number>(toSpliceable(list));
// model.splice([0], 0, Iterator.
iterate
([
// model.splice([0], 0, Iterator.
fromArray
([
// {
// element: 0, collapsed: true, children: Iterator.
iterate
([
// element: 0, collapsed: true, children: Iterator.
fromArray
([
// { element: 10 },
// { element: 11 },
// { element: 12 },
...
...
@@ -303,7 +303,7 @@ suite('TreeModel2', function () {
const
list
=
[]
as
ITreeNode
<
number
>
[];
const
model
=
new
TreeModel
<
number
>
(
toSpliceable
(
list
));
model
.
splice
([
0
],
0
,
Iterator
.
iterate
([
model
.
splice
([
0
],
0
,
Iterator
.
fromArray
([
{
element
:
1
,
children
:
[
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录