Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
lwm1986
roslyn
提交
770028a2
R
roslyn
项目概览
lwm1986
/
roslyn
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
roslyn
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
770028a2
编写于
1月 22, 2020
作者:
S
Sam Harwell
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add tests for reverse transitive dependencies after project reference removal
上级
c8e1f37f
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
85 addition
and
0 deletion
+85
-0
src/Workspaces/CoreTest/SolutionTests/ProjectDependencyGraphTests.cs
...ces/CoreTest/SolutionTests/ProjectDependencyGraphTests.cs
+85
-0
未找到文件。
src/Workspaces/CoreTest/SolutionTests/ProjectDependencyGraphTests.cs
浏览文件 @
770028a2
...
...
@@ -488,6 +488,91 @@ public void TestReverseTransitiveReferencesAfterProjectRemoval()
VerifyReverseTransitiveReferences
(
solution
,
"D"
,
new
string
[]
{
"C"
});
}
[
Fact
,
Trait
(
Traits
.
Feature
,
Traits
.
Features
.
Workspace
)]
public
void
TestReverseTransitiveReferencesAfterProjectReferenceRemoval_PreserveThroughUnrelatedSequence
()
{
// We are going to create a solution with the references:
//
// A -> B -> C
// A -> D
//
// and will then remove the project reference A->B. This test verifies that the new project dependency graph
// did not lose previously-computed information about the transitive reverse references for D.
var
solution
=
CreateSolutionFromReferenceMap
(
"A:B,D B:C C D"
);
VerifyReverseTransitiveReferences
(
solution
,
"D"
,
new
string
[]
{
"A"
});
var
a
=
solution
.
GetProjectsByName
(
"A"
).
Single
();
var
b
=
solution
.
GetProjectsByName
(
"B"
).
Single
();
var
d
=
solution
.
GetProjectsByName
(
"D"
).
Single
();
var
expected
=
solution
.
State
.
GetProjectDependencyGraph
().
GetProjectsThatTransitivelyDependOnThisProject
(
d
.
Id
);
var
aToB
=
a
.
ProjectReferences
.
Single
(
reference
=>
reference
.
ProjectId
==
b
.
Id
);
solution
=
solution
.
RemoveProjectReference
(
a
.
Id
,
aToB
);
// Before any other operations, verify that TryGetProjectsThatTransitivelyDependOnThisProject returns a
// non-null set. Specifically, it returns the _same_ set that was computed prior to the project reference
// removal.
Assert
.
Same
(
expected
,
solution
.
State
.
GetProjectDependencyGraph
().
TryGetProjectsThatTransitivelyDependOnThisProject
(
d
.
Id
));
}
[
Fact
,
Trait
(
Traits
.
Feature
,
Traits
.
Features
.
Workspace
)]
public
void
TestReverseTransitiveReferencesAfterProjectReferenceRemoval_PreserveUnrelated
()
{
// We are going to create a solution with the references:
//
// A -> B -> C
// D -> E
//
// and will then remove the project reference A->B. This test verifies that the new project dependency graph
// did not lose previously-computed information about the transitive reverse references for E.
var
solution
=
CreateSolutionFromReferenceMap
(
"A:B B:C C D:E E"
);
VerifyReverseTransitiveReferences
(
solution
,
"E"
,
new
string
[]
{
"D"
});
var
a
=
solution
.
GetProjectsByName
(
"A"
).
Single
();
var
b
=
solution
.
GetProjectsByName
(
"B"
).
Single
();
var
e
=
solution
.
GetProjectsByName
(
"E"
).
Single
();
var
expected
=
solution
.
State
.
GetProjectDependencyGraph
().
GetProjectsThatTransitivelyDependOnThisProject
(
e
.
Id
);
var
aToB
=
a
.
ProjectReferences
.
Single
(
reference
=>
reference
.
ProjectId
==
b
.
Id
);
solution
=
solution
.
RemoveProjectReference
(
a
.
Id
,
aToB
);
// Before any other operations, verify that TryGetProjectsThatTransitivelyDependOnThisProject returns a
// non-null set. Specifically, it returns the _same_ set that was computed prior to the project reference
// removal.
Assert
.
Same
(
expected
,
solution
.
State
.
GetProjectDependencyGraph
().
TryGetProjectsThatTransitivelyDependOnThisProject
(
e
.
Id
));
}
[
Fact
,
Trait
(
Traits
.
Feature
,
Traits
.
Features
.
Workspace
)]
public
void
TestReverseTransitiveReferencesAfterProjectReferenceRemoval_DiscardImpacted
()
{
// We are going to create a solution with the references:
//
// A -> B -> C
// A -> D
//
// and will then remove the project reference A->B. This test verifies that the new project dependency graph
// discards previously-computed information about the transitive reverse references for C.
var
solution
=
CreateSolutionFromReferenceMap
(
"A:B,D B:C C D"
);
VerifyReverseTransitiveReferences
(
solution
,
"C"
,
new
string
[]
{
"A"
,
"B"
});
var
a
=
solution
.
GetProjectsByName
(
"A"
).
Single
();
var
b
=
solution
.
GetProjectsByName
(
"B"
).
Single
();
var
c
=
solution
.
GetProjectsByName
(
"C"
).
Single
();
var
notExpected
=
solution
.
State
.
GetProjectDependencyGraph
().
GetProjectsThatTransitivelyDependOnThisProject
(
c
.
Id
);
Assert
.
NotNull
(
notExpected
);
var
aToB
=
a
.
ProjectReferences
.
Single
(
reference
=>
reference
.
ProjectId
==
b
.
Id
);
solution
=
solution
.
RemoveProjectReference
(
a
.
Id
,
aToB
);
// Before any other operations, verify that TryGetProjectsThatTransitivelyDependOnThisProject returns a
// null set.
Assert
.
Null
(
solution
.
State
.
GetProjectDependencyGraph
().
TryGetProjectsThatTransitivelyDependOnThisProject
(
c
.
Id
));
VerifyReverseTransitiveReferences
(
solution
,
"C"
,
new
string
[]
{
"B"
});
}
[
Fact
,
Trait
(
Traits
.
Feature
,
Traits
.
Features
.
Workspace
)]
public
void
TestSameDependencyGraphAfterOneOfMultipleReferencesRemoved
()
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录