提交 f12f9e92 authored 作者: Mohammad Pezeshki's avatar Mohammad Pezeshki

Comments are rewrited more clearly.

上级 da23d114
...@@ -129,10 +129,12 @@ Timing Info ...@@ -129,10 +129,12 @@ Timing Info
<total time> time for this node + total times for this node's ancestors <total time> time for this node + total times for this node's ancestors
<% total time> total time for this node over total computation time <% total time> total time for this node over total computation time
N.B.: <total time> and <% total time> may over-count computation times N.B.:
if inputs to a node share a common ancestor and should be viewed as a * Times include the node time and the function overhead.
loose upper bound. Their intended use is to help rule out potential nodes * <total time> and <% total time> may over-count computation times
to remove when optimizing a graph because their <total time> is very low. if inputs to a node share a common ancestor and should be viewed as a
loose upper bound. Their intended use is to help rule out potential nodes
to remove when optimizing a graph because their <total time> is very low.
""" """
debugmode.debugprint(r, depth=depth, done=done, print_type=print_type, debugmode.debugprint(r, depth=depth, done=done, print_type=print_type,
......
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论