Describe the bug
yn是不是自动把latex公式里的空格给删了?空格缩进不正常
To Reproduce
`
10.5 SOFTWARE PIPELINING
main() {
$E' = {e | e \text{ in } E, \delta_e = 0};$
$T_0 = \max \left( \max_j \left| \frac{\sum_{n,i} RT_n(i,j)}{r_j} \right|, \max_{c \text{ acyclein } G} \left| \frac{\sum_{e \text{ in } c} d_e}{\delta_e} \right| \right);$
for ( $T = T_0, T_0 + 1, \ldots$ or until all SCC's in $G$ are scheduled) {
RT = an empty reservation table with $T$ rows;
E* = AllPairsLongestPath( $G,T$ );
for (each SCC $C$ in $G$ in prioritized topological order) {
for (all $n$ in $C$ )
$s_0(n) = \max_{c=p\to n \text{ in } E^*, p \text{ scheduled}} (S(p) + d_e)$ ;
$first$ = some $n$ such that $s_0(n)$ is a minimum;
$s_0$ = $s_0(first)$ ;
for ( $s = s_0; s < s_0 + T; s = s + 1$ )
if (SccScheduled $(RT, T, C, first,s)$ ) break;
if ( $C$ cannot be scheduled in $RT$ ) break;
}
}
}
SecScheduled( $RT, T, c, first, s$ ) {
RT' = RT;
if (not NodeScheduled $(RT', T, first,s)$ ) return false;
for (each remaining $n$ in $c$ in prioritized topological order of edges in $E'$ ) {
$s_l = \max_{e=n'\to n \text{ in } E^, n' \text{ in } c,n' \text{ scheduled}} S(n') + d_e - (\delta_e \times T)$ ;
$u_s = \min_{e=n\to n' \text{ in } E^,n' \text{ in } c,n' \text{ scheduled}} S(n') - d_e + (\delta_e \times T)$ ;
for ( $s = s_l; \leq \min(s_u, s_l + T - 1); s = s + 1$ )
if NodeScheduled( $RT', T, n,s$ ) break;
if ( $n$ cannot be scheduled in $RT'$ ) return false;
}
RT = RT';
return true;
}
`
Expected behavior
Screenshots
Desktop (please complete the following information):
- Version [e.g. v3.23.0]
- OS: [e.g. macOS]
- Browser [e.g. chrome, safari]
Additional context
Describe the bug
yn是不是自动把latex公式里的空格给删了?空格缩进不正常
To Reproduce
`
10.5 SOFTWARE PIPELINING
main() {
$E' = {e | e \text{ in } E, \delta_e = 0};$
$T_0 = \max \left( \max_j \left| \frac{\sum_{n,i} RT_n(i,j)}{r_j} \right|, \max_{c \text{ acyclein } G} \left| \frac{\sum_{e \text{ in } c} d_e}{\delta_e} \right| \right);$ $T = T_0, T_0 + 1, \ldots$ or until all SCC's in $G$ are scheduled) {$T$ rows;$G,T$ );$C$ in $G$ in prioritized topological order) {$n$ in $C$ )
$s_0(n) = \max_{c=p\to n \text{ in } E^*, p \text{ scheduled}} (S(p) + d_e)$ ;
$first$ = some $n$ such that $s_0(n)$ is a minimum;
$s_0$ = $s_0(first)$ ;$s = s_0; s < s_0 + T; s = s + 1$ )$(RT, T, C, first,s)$ ) break;$C$ cannot be scheduled in $RT$ ) break;
for (
RT = an empty reservation table with
E* = AllPairsLongestPath(
for (each SCC
for (all
for (
if (SccScheduled
if (
}
}
}
SecScheduled($RT, T, c, first, s$ ) {$(RT', T, first,s)$ ) return false;$n$ in $c$ in prioritized topological order of edges in $E'$ ) {$s = s_l; \leq \min(s_u, s_l + T - 1); s = s + 1$ )$RT', T, n,s$ ) break;$n$ cannot be scheduled in $RT'$ ) return false;
RT' = RT;
if (not NodeScheduled
for (each remaining
$s_l = \max_{e=n'\to n \text{ in } E^, n' \text{ in } c,n' \text{ scheduled}} S(n') + d_e - (\delta_e \times T)$ ;
$u_s = \min_{e=n\to n' \text{ in } E^,n' \text{ in } c,n' \text{ scheduled}} S(n') - d_e + (\delta_e \times T)$ ;
for (
if NodeScheduled(
if (
}
RT = RT';
return true;
}
`
Expected behavior
Screenshots
Desktop (please complete the following information):
Additional context