mirror of
https://github.com/kuhyx/WUT_Computer_Science.git
synced 2026-11-10 22:07:10 +01:00
Krzysztof kuhy Rudnicki
ffa5dad02a
The 250-line cap applies to prose too, and the reports were the worst
offenders -- ENUME's projectA.tex alone was 1,876 lines. Each is now a
preamble plus one \input{} per section, which is how a long LaTeX document is
normally organised; not one byte of prose was rewritten.
"The PDF is unchanged" is checked by a script rather than by eye, because
hashing the PDF cannot work: pdflatex stamps a /CreationDate and an /ID into
every build, so two runs of the SAME source already differ. tex_fingerprint.sh
compares what a reader sees instead -- page count plus a hash of the extracted
text -- and it is stable across rebuilds of untouched sources, which is the
property that makes it usable as a gate.
It earned its keep immediately. Both ECOTE reports quote an example LaTeX
document inside an lstlisting block, so \end{document} appears in the middle
of the file; splitting on the FIRST one stranded everything after it. Same
page count, different text, caught automatically. EOPSY lab3 exposed a second
bug: a \section{} title that runs onto the next line.
Result: 19 .tex over the cap -> 1. The survivor,
ELAC/.../03-building-nfa-...tex, is 418 lines of consecutive tikz figures
with no subsection to split on and needs a hand-placed boundary.
Verified: 29 splits across two passes (section, then subsection for the
pieces still over), every one reporting `unchanged` from
scripts/tex_fingerprint.sh --check.
Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_0172dj34FDpao6wsix8ZuCzE
26 lines
608 B
TeX
26 lines
608 B
TeX
\section{RK4Phi.m}
|
|
\subsection{RK4Phi}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function Phi = RK4Phi(algorithm, stepValue, stepSize)
|
|
k1 = algorithm(stepValue);
|
|
k2 = algorithm(stepValue + 0.5 * stepSize * k1);
|
|
k3 = algorithm(stepValue + 0.5 * stepSize * k2);
|
|
k4 = algorithm(stepValue + stepSize * k3);
|
|
Phi = (k1 + 2 * k2 + 2 * k3 + k4) / 6;
|
|
end
|
|
% calculates the Phi used in RK4 algorithms
|
|
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
|
|
|
|
|
|
\begin{thebibliography}{9}
|
|
\bibitem{texbook}
|
|
Piotr Tatjewski (2014) \emph{Numerical Methods}, Oficyna Wydawnicza Politechniki Warszawskiej
|
|
\end{thebibliography}
|
|
|
|
|