Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
apache
skywalking-rocketbot-ui
提交
8d411076
S
skywalking-rocketbot-ui
项目概览
apache
/
skywalking-rocketbot-ui
通知
17
Star
2
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
S
skywalking-rocketbot-ui
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
未验证
提交
8d411076
编写于
8月 12, 2020
作者:
W
whfjam
提交者:
GitHub
8月 12, 2020
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
handle the situation with VNode (#338)
上级
e2f00499
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
9 addition
and
7 deletion
+9
-7
src/views/components/common/trace-detail-chart-table.vue
src/views/components/common/trace-detail-chart-table.vue
+1
-1
src/views/components/trace/d3-trace.js
src/views/components/trace/d3-trace.js
+2
-2
src/views/components/trace/trace-detail-chart-list.vue
src/views/components/trace/trace-detail-chart-list.vue
+5
-3
src/views/components/trace/trace-detail-chart-tree.vue
src/views/components/trace/trace-detail-chart-tree.vue
+1
-1
未找到文件。
src/views/components/common/trace-detail-chart-table.vue
浏览文件 @
8d411076
...
@@ -137,7 +137,7 @@ limitations under the License. -->
...
@@ -137,7 +137,7 @@ limitations under the License. -->
return
arr
;
return
arr
;
},
},
traverseTree
(
node
,
spanId
,
segmentId
,
data
)
{
traverseTree
(
node
,
spanId
,
segmentId
,
data
)
{
if
(
!
node
)
{
if
(
!
node
||
node
.
isBroken
)
{
return
;
return
;
}
}
if
(
node
.
spanId
===
spanId
&&
node
.
segmentId
===
segmentId
)
{
if
(
node
.
spanId
===
spanId
&&
node
.
segmentId
===
segmentId
)
{
...
...
src/views/components/trace/d3-trace.js
浏览文件 @
8d411076
...
@@ -69,7 +69,7 @@ export default class Trace {
...
@@ -69,7 +69,7 @@ export default class Trace {
L
${
d
.
target
.
y
}
${
d
.
target
.
x
-
20
}
L
${
d
.
target
.
y
}
${
d
.
target
.
x
-
20
}
L
${
d
.
target
.
y
}
${
d
.
target
.
x
-
5
}
`
;
L
${
d
.
target
.
y
}
${
d
.
target
.
x
-
5
}
`
;
}
}
init
(
data
,
row
)
{
init
(
data
,
row
,
fixSpansSize
)
{
d3
.
select
(
'
.trace-xaxis
'
).
remove
();
d3
.
select
(
'
.trace-xaxis
'
).
remove
();
this
.
row
=
row
;
this
.
row
=
row
;
this
.
data
=
data
;
this
.
data
=
data
;
...
@@ -85,7 +85,7 @@ export default class Trace {
...
@@ -85,7 +85,7 @@ export default class Trace {
if
(
d
>=
1000
)
return
d
/
1000
+
'
s
'
;
if
(
d
>=
1000
)
return
d
/
1000
+
'
s
'
;
return
d
;
return
d
;
});
});
this
.
svg
.
attr
(
'
height
'
,
(
this
.
row
.
length
+
1
)
*
this
.
barHeight
);
this
.
svg
.
attr
(
'
height
'
,
(
this
.
row
.
length
+
fixSpansSize
+
1
)
*
this
.
barHeight
);
this
.
svg
this
.
svg
.
append
(
'
g
'
)
.
append
(
'
g
'
)
.
attr
(
'
class
'
,
'
trace-xaxis
'
)
.
attr
(
'
class
'
,
'
trace-xaxis
'
)
...
...
src/views/components/trace/trace-detail-chart-list.vue
浏览文件 @
8d411076
...
@@ -101,6 +101,7 @@ limitations under the License. -->
...
@@ -101,6 +101,7 @@ limitations under the License. -->
list
:
[],
list
:
[],
currentSpan
:
[],
currentSpan
:
[],
loading
:
true
,
loading
:
true
,
fixSpansSize
:
0
,
};
};
},
},
watch
:
{
watch
:
{
...
@@ -108,7 +109,7 @@ limitations under the License. -->
...
@@ -108,7 +109,7 @@ limitations under the License. -->
if
(
!
this
.
data
.
length
)
{
return
;
}
if
(
!
this
.
data
.
length
)
{
return
;
}
this
.
loading
=
true
;
this
.
loading
=
true
;
this
.
changeTree
();
this
.
changeTree
();
this
.
tree
.
init
({
label
:
'
TRACE_ROOT
'
,
children
:
this
.
segmentId
},
this
.
data
);
this
.
tree
.
init
({
label
:
'
TRACE_ROOT
'
,
children
:
this
.
segmentId
},
this
.
data
,
this
.
fixSpansSize
);
this
.
tree
.
draw
(()
=>
{
this
.
tree
.
draw
(()
=>
{
setTimeout
(()
=>
{
setTimeout
(()
=>
{
this
.
loading
=
false
;
this
.
loading
=
false
;
...
@@ -124,7 +125,7 @@ limitations under the License. -->
...
@@ -124,7 +125,7 @@ limitations under the License. -->
// this.loading = true;
// this.loading = true;
this
.
changeTree
();
this
.
changeTree
();
this
.
tree
=
new
Trace
(
this
.
$refs
.
traceList
,
this
);
this
.
tree
=
new
Trace
(
this
.
$refs
.
traceList
,
this
);
this
.
tree
.
init
({
label
:
'
TRACE_ROOT
'
,
children
:
this
.
segmentId
},
this
.
data
);
this
.
tree
.
init
({
label
:
'
TRACE_ROOT
'
,
children
:
this
.
segmentId
},
this
.
data
,
this
.
fixSpansSize
);
this
.
tree
.
draw
();
this
.
tree
.
draw
();
this
.
loading
=
false
;
this
.
loading
=
false
;
// this.computedScale();
// this.computedScale();
...
@@ -136,7 +137,7 @@ limitations under the License. -->
...
@@ -136,7 +137,7 @@ limitations under the License. -->
this
.
showDetail
=
true
;
this
.
showDetail
=
true
;
},
},
traverseTree
(
node
,
spanId
,
segmentId
,
data
)
{
traverseTree
(
node
,
spanId
,
segmentId
,
data
)
{
if
(
!
node
)
{
return
;
}
if
(
!
node
||
node
.
isBroken
)
{
return
;
}
if
(
node
.
spanId
===
spanId
&&
node
.
segmentId
===
segmentId
)
{
if
(
node
.
spanId
===
spanId
&&
node
.
segmentId
===
segmentId
)
{
node
.
children
.
push
(
data
);
node
.
children
.
push
(
data
);
return
;
return
;
...
@@ -263,6 +264,7 @@ limitations under the License. -->
...
@@ -263,6 +264,7 @@ limitations under the License. -->
segmentGroup
[
i
.
segmentId
].
push
(
i
);
segmentGroup
[
i
.
segmentId
].
push
(
i
);
}
}
});
});
this
.
fixSpansSize
=
fixSpans
.
length
;
segmentIdGroup
.
forEach
((
id
)
=>
{
segmentIdGroup
.
forEach
((
id
)
=>
{
const
currentSegment
=
segmentGroup
[
id
].
sort
((
a
,
b
)
=>
b
.
parentSpanId
-
a
.
parentSpanId
);
const
currentSegment
=
segmentGroup
[
id
].
sort
((
a
,
b
)
=>
b
.
parentSpanId
-
a
.
parentSpanId
);
currentSegment
.
forEach
((
s
)
=>
{
currentSegment
.
forEach
((
s
)
=>
{
...
...
src/views/components/trace/trace-detail-chart-tree.vue
浏览文件 @
8d411076
...
@@ -127,7 +127,7 @@ limitations under the License. -->
...
@@ -127,7 +127,7 @@ limitations under the License. -->
this
.
showDetail
=
true
;
this
.
showDetail
=
true
;
},
},
traverseTree
(
node
,
spanId
,
segmentId
,
data
){
traverseTree
(
node
,
spanId
,
segmentId
,
data
){
if
(
!
node
)
return
;
if
(
!
node
||
node
.
isBroken
)
return
;
if
(
node
.
spanId
==
spanId
&&
node
.
segmentId
==
segmentId
)
{
node
.
children
.
push
(
data
);
return
;}
if
(
node
.
spanId
==
spanId
&&
node
.
segmentId
==
segmentId
)
{
node
.
children
.
push
(
data
);
return
;}
if
(
node
.
children
&&
node
.
children
.
length
>
0
)
{
if
(
node
.
children
&&
node
.
children
.
length
>
0
)
{
for
(
let
i
=
0
;
i
<
node
.
children
.
length
;
i
++
)
{
for
(
let
i
=
0
;
i
<
node
.
children
.
length
;
i
++
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录