Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Phodal
Coca
提交
9b9742bd
C
Coca
项目概览
Phodal
/
Coca
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
Coca
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
未验证
提交
9b9742bd
编写于
7月 19, 2020
作者:
P
Phodal Huang
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
feat: try to add test for node merge
上级
842ac705
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
36 addition
and
22 deletion
+36
-22
pkg/application/arch/tequila/incl_viz.go
pkg/application/arch/tequila/incl_viz.go
+17
-17
pkg/application/arch/tequila/incl_viz_test.go
pkg/application/arch/tequila/incl_viz_test.go
+19
-5
未找到文件。
pkg/application/arch/tequila/incl_viz.go
浏览文件 @
9b9742bd
...
...
@@ -152,23 +152,6 @@ func (fullGraph *FullGraph) ToDot(split string, include func(string) bool) *gogr
return
graph
}
type
GraphNode
struct
{
text
string
children
[]
*
GraphNode
}
func
(
fullGraph
*
FullGraph
)
BuildMapTree
(
split
string
,
include
func
(
key
string
)
bool
)
*
GraphNode
{
graphNode
:=
&
GraphNode
{}
for
nodeKey
:=
range
fullGraph
.
NodeList
{
tmp
:=
strings
.
Split
(
nodeKey
,
split
)
graphNode
.
text
=
tmp
[
0
]
graphNode
=
buildNode
(
tmp
[
1
:
],
graphNode
)
}
return
graphNode
}
func
(
fullGraph
*
FullGraph
)
ToMapDot
(
node
*
GraphNode
)
*
gographviz
.
Graph
{
graph
:=
gographviz
.
NewGraph
()
_
=
graph
.
SetName
(
"G"
)
...
...
@@ -211,6 +194,23 @@ func (fullGraph *FullGraph) buildGraphNode(subgraph string, current *GraphNode,
}
}
type
GraphNode
struct
{
text
string
children
[]
*
GraphNode
}
func
(
fullGraph
*
FullGraph
)
BuildMapTree
(
split
string
,
include
func
(
key
string
)
bool
)
*
GraphNode
{
graphNode
:=
&
GraphNode
{}
for
nodeKey
:=
range
fullGraph
.
NodeList
{
tmp
:=
strings
.
Split
(
nodeKey
,
split
)
graphNode
.
text
=
tmp
[
0
]
graphNode
=
buildNode
(
tmp
[
1
:
],
graphNode
)
}
return
graphNode
}
func
buildNode
(
arr
[]
string
,
node
*
GraphNode
)
*
GraphNode
{
if
node
.
text
==
arr
[
0
]
{
return
node
...
...
pkg/application/arch/tequila/incl_viz_test.go
浏览文件 @
9b9742bd
...
...
@@ -6,6 +6,13 @@ import (
)
func
createBasicMap
()
(
*
GraphNode
,
*
FullGraph
)
{
fullGraph
,
nodeFilter
:=
createGraph
()
node
:=
fullGraph
.
BuildMapTree
(
"."
,
nodeFilter
)
return
node
,
fullGraph
}
func
createGraph
()
(
*
FullGraph
,
func
(
key
string
)
bool
)
{
fullGraph
:=
&
FullGraph
{
NodeList
:
make
(
map
[
string
]
string
),
RelationList
:
make
(
map
[
string
]
*
Relation
),
...
...
@@ -26,9 +33,7 @@ func createBasicMap() (*GraphNode, *FullGraph) {
var
nodeFilter
=
func
(
key
string
)
bool
{
return
true
}
node
:=
fullGraph
.
BuildMapTree
(
"."
,
nodeFilter
)
return
node
,
fullGraph
return
fullGraph
,
nodeFilter
}
func
Test_BuildGraphNode
(
t
*
testing
.
T
)
{
...
...
@@ -38,8 +43,17 @@ func Test_BuildGraphNode(t *testing.T) {
g
.
Expect
(
node
.
text
)
.
To
(
Equal
(
"com"
))
children
:=
node
.
children
g
.
Expect
(
len
(
children
))
.
To
(
Equal
(
2
))
//g.Expect(children[0].text).To(Equal("phodal"))
//g.Expect(children[1].text).To(Equal("spring"))
}
func
Test_ShouldMergeSameMap
(
t
*
testing
.
T
)
{
g
:=
NewGomegaWithT
(
t
)
fullGraph
,
nodeFilter
:=
createGraph
()
fullGraph
.
NodeList
[
"com.phodal.coca"
]
=
"com.phodal.coca"
node
:=
fullGraph
.
BuildMapTree
(
"."
,
nodeFilter
)
g
.
Expect
(
node
.
text
)
.
To
(
Equal
(
"com"
))
children
:=
node
.
children
g
.
Expect
(
len
(
children
))
.
To
(
Equal
(
3
))
}
func
Test_BuildNodeDot
(
t
*
testing
.
T
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录