Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
c6d52426
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,发现更多精彩内容 >>
提交
c6d52426
编写于
9月 13, 2019
作者:
J
Joao Moreno
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
scm: resource tree model
上级
6d09fb3c
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
152 addition
and
0 deletion
+152
-0
src/vs/base/common/resourceTree.ts
src/vs/base/common/resourceTree.ts
+103
-0
src/vs/base/test/common/resourceTree.test.ts
src/vs/base/test/common/resourceTree.test.ts
+49
-0
未找到文件。
src/vs/base/common/resourceTree.ts
0 → 100644
浏览文件 @
c6d52426
/*---------------------------------------------------------------------------------------------
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
import
{
URI
}
from
'
vs/base/common/uri
'
;
export
const
enum
NodeType
{
Branch
,
Leaf
}
export
interface
LeafNode
<
T
>
{
readonly
type
:
NodeType
.
Leaf
;
readonly
element
:
T
;
}
export
interface
BranchNode
<
T
>
{
readonly
type
:
NodeType
.
Branch
;
readonly
children
:
Map
<
string
,
Node
<
T
>>
;
}
export
type
Node
<
T
>
=
BranchNode
<
T
>
|
LeafNode
<
T
>
;
export
class
ResourceTree
<
T
extends
NonNullable
<
any
>>
{
readonly
root
:
BranchNode
<
T
>
=
{
type
:
NodeType
.
Branch
,
children
:
new
Map
()
};
constructor
()
{
}
add
(
uri
:
URI
,
element
:
T
):
void
{
const
parts
=
uri
.
fsPath
.
split
(
/
[\\\/]
/
).
filter
(
p
=>
!!
p
);
let
node
=
this
.
root
;
for
(
let
i
=
0
;
i
<
parts
.
length
;
i
++
)
{
const
name
=
parts
[
i
];
let
child
=
node
.
children
.
get
(
name
);
if
(
!
child
)
{
if
(
i
<
parts
.
length
-
1
)
{
child
=
{
type
:
NodeType
.
Branch
,
children
:
new
Map
()
};
node
.
children
.
set
(
name
,
child
);
}
else
{
child
=
{
type
:
NodeType
.
Leaf
,
element
};
node
.
children
.
set
(
name
,
child
);
return
;
}
}
if
(
child
.
type
===
NodeType
.
Leaf
)
{
if
(
i
<
parts
.
length
-
1
)
{
throw
new
Error
(
'
Inconsistent tree: can
\'
t override leaf with branch.
'
);
}
// replace
node
.
children
.
set
(
name
,
{
type
:
NodeType
.
Leaf
,
element
});
return
;
}
else
if
(
i
===
parts
.
length
-
1
)
{
throw
new
Error
(
'
Inconsistent tree: can
\'
t override branch with leaf.
'
);
}
node
=
child
;
}
}
delete
(
uri
:
URI
):
T
|
undefined
{
const
parts
=
uri
.
fsPath
.
split
(
/
[\\\/]
/
).
filter
(
p
=>
!!
p
);
return
this
.
_delete
(
this
.
root
,
parts
,
0
);
}
private
_delete
(
node
:
BranchNode
<
T
>
,
parts
:
string
[],
index
:
number
):
T
|
undefined
{
const
name
=
parts
[
index
];
const
child
=
node
.
children
.
get
(
name
);
if
(
!
child
)
{
return
undefined
;
}
// not at end
if
(
index
<
parts
.
length
-
1
)
{
if
(
child
.
type
===
NodeType
.
Leaf
)
{
throw
new
Error
(
'
Inconsistent tree: Expected a branch, found a leaf instead.
'
);
}
else
{
const
result
=
this
.
_delete
(
child
,
parts
,
index
+
1
);
if
(
typeof
result
!==
'
undefined
'
&&
child
.
children
.
size
===
0
)
{
node
.
children
.
delete
(
name
);
}
return
result
;
}
}
//at end
if
(
child
.
type
===
NodeType
.
Branch
)
{
// TODO: maybe we can allow this
throw
new
Error
(
'
Inconsistent tree: Expected a leaf, found a branch instead.
'
);
}
node
.
children
.
delete
(
name
);
return
child
.
element
;
}
}
src/vs/base/test/common/resourceTree.test.ts
0 → 100644
浏览文件 @
c6d52426
/*---------------------------------------------------------------------------------------------
* 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
{
ResourceTree
,
NodeType
,
BranchNode
,
LeafNode
}
from
'
vs/base/common/resourceTree
'
;
import
{
URI
}
from
'
vs/base/common/uri
'
;
suite
(
'
ResourceTree
'
,
function
()
{
test
(
'
ctor
'
,
function
()
{
const
tree
=
new
ResourceTree
<
string
>
();
assert
.
equal
(
tree
.
root
.
type
,
NodeType
.
Branch
);
assert
.
equal
(
tree
.
root
.
children
.
size
,
0
);
});
test
(
'
simple
'
,
function
()
{
const
tree
=
new
ResourceTree
<
string
>
();
tree
.
add
(
URI
.
file
(
'
/foo/bar.txt
'
),
'
bar contents
'
);
assert
.
equal
(
tree
.
root
.
type
,
NodeType
.
Branch
);
assert
.
equal
(
tree
.
root
.
children
.
size
,
1
);
let
foo
=
tree
.
root
.
children
.
get
(
'
foo
'
)
as
BranchNode
<
string
>
;
assert
(
foo
);
assert
.
equal
(
foo
.
type
,
NodeType
.
Branch
);
assert
.
equal
(
foo
.
children
.
size
,
1
);
let
bar
=
foo
.
children
.
get
(
'
bar.txt
'
)
as
LeafNode
<
string
>
;
assert
(
bar
);
assert
.
equal
(
bar
.
type
,
NodeType
.
Leaf
);
assert
.
equal
(
bar
.
element
,
'
bar contents
'
);
tree
.
add
(
URI
.
file
(
'
/hello.txt
'
),
'
hello contents
'
);
assert
.
equal
(
tree
.
root
.
children
.
size
,
2
);
let
hello
=
tree
.
root
.
children
.
get
(
'
hello.txt
'
)
as
LeafNode
<
string
>
;
assert
(
hello
);
assert
.
equal
(
hello
.
type
,
NodeType
.
Leaf
);
assert
.
equal
(
hello
.
element
,
'
hello contents
'
);
tree
.
delete
(
URI
.
file
(
'
/foo/bar.txt
'
));
assert
.
equal
(
tree
.
root
.
children
.
size
,
1
);
hello
=
tree
.
root
.
children
.
get
(
'
hello.txt
'
)
as
LeafNode
<
string
>
;
assert
(
hello
);
assert
.
equal
(
hello
.
type
,
NodeType
.
Leaf
);
assert
.
equal
(
hello
.
element
,
'
hello contents
'
);
});
});
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录