提交 8167588f 编写于 作者: D dengkaipeng

add blank after math::. test=develop

上级 d9ec6058
...@@ -260,14 +260,19 @@ Example: ...@@ -260,14 +260,19 @@ Example:
$$ $$
For exclusive = false: For exclusive = false:
.. math:: .. math::
hstart &= i * strides[0] - paddings[0] \\ hstart &= i * strides[0] - paddings[0] \\
hend &= hstart + ksize[0] \\ hend &= hstart + ksize[0] \\
wstart &= j * strides[1] - paddings[1] \\ wstart &= j * strides[1] - paddings[1] \\
wend &= wstart + ksize[1] \\ wend &= wstart + ksize[1] \\
Output(i ,j) &= \\frac{sum(Input[hstart:hend, wstart:wend])}{ksize[0] * ksize[1]} Output(i ,j) &= \\frac{sum(Input[hstart:hend, wstart:wend])}{ksize[0] * ksize[1]}
For exclusive = true: For exclusive = true:
.. math:: .. math::
hstart &= max(0, i * strides[0] - paddings[0]) \\ hstart &= max(0, i * strides[0] - paddings[0]) \\
hend &= min(H, hstart + ksize[0]) \\ hend &= min(H, hstart + ksize[0]) \\
wstart &= max(0, j * strides[1] - paddings[1]) \\ wstart &= max(0, j * strides[1] - paddings[1]) \\
...@@ -275,7 +280,9 @@ Example: ...@@ -275,7 +280,9 @@ Example:
Output(i ,j) &= \\frac{sum(Input[hstart:hend, wstart:wend])}{(hend - hstart) * (wend - wstart)} Output(i ,j) &= \\frac{sum(Input[hstart:hend, wstart:wend])}{(hend - hstart) * (wend - wstart)}
For adaptive = true: For adaptive = true:
.. math:: .. math::
hstart &= floor(i * H_{in} / H_{out}) \\ hstart &= floor(i * H_{in} / H_{out}) \\
hend &= ceil((i + 1) * H_{in} / H_{out}) \\ hend &= ceil((i + 1) * H_{in} / H_{out}) \\
wstart &= floor(j * W_{in} / W_{out}) \\ wstart &= floor(j * W_{in} / W_{out}) \\
...@@ -410,7 +417,9 @@ Example: ...@@ -410,7 +417,9 @@ Example:
$$ $$
For exclusive = false: For exclusive = false:
.. math:: .. math::
dstart &= i * strides[0] - paddings[0] \\ dstart &= i * strides[0] - paddings[0] \\
dend &= dstart + ksize[0] \\ dend &= dstart + ksize[0] \\
hstart &= j * strides[1] - paddings[1] \\ hstart &= j * strides[1] - paddings[1] \\
...@@ -418,8 +427,11 @@ Example: ...@@ -418,8 +427,11 @@ Example:
wstart &= k * strides[2] - paddings[2] \\ wstart &= k * strides[2] - paddings[2] \\
wend &= wstart + ksize[2] \\ wend &= wstart + ksize[2] \\
Output(i ,j, k) &= \\frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{ksize[0] * ksize[1] * ksize[2]} Output(i ,j, k) &= \\frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{ksize[0] * ksize[1] * ksize[2]}
For exclusive = true: For exclusive = true:
.. math:: .. math::
dstart &= max(0, i * strides[0] - paddings[0]) \\ dstart &= max(0, i * strides[0] - paddings[0]) \\
dend &= min(D, dstart + ksize[0]) \\ dend &= min(D, dstart + ksize[0]) \\
hend &= min(H, hstart + ksize[1]) \\ hend &= min(H, hstart + ksize[1]) \\
...@@ -428,7 +440,9 @@ Example: ...@@ -428,7 +440,9 @@ Example:
Output(i ,j, k) &= \\frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{(dend - dstart) * (hend - hstart) * (wend - wstart)} Output(i ,j, k) &= \\frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{(dend - dstart) * (hend - hstart) * (wend - wstart)}
For adaptive = true: For adaptive = true:
.. math:: .. math::
dstart &= floor(i * D_{in} / D_{out}) \\ dstart &= floor(i * D_{in} / D_{out}) \\
dend &= ceil((i + 1) * D_{in} / D_{out}) \\ dend &= ceil((i + 1) * D_{in} / D_{out}) \\
hstart &= floor(j * H_{in} / H_{out}) \\ hstart &= floor(j * H_{in} / H_{out}) \\
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册