From 5c11ad4fdc4901eb2ff20fbc7378831392490a44 Mon Sep 17 00:00:00 2001
From: Matej Focko <mfocko@redhat.com>
Date: Sun, 15 May 2022 23:54:35 +0200
Subject: [PATCH] shorten names of parameters

Signed-off-by: Matej Focko <mfocko@redhat.com>
---
 fi-pdflatex.tex | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/fi-pdflatex.tex b/fi-pdflatex.tex
index 97523c9..85a0c9a 100644
--- a/fi-pdflatex.tex
+++ b/fi-pdflatex.tex
@@ -728,7 +728,7 @@ In contrast to the \textit{AVL Rule}, WAVL tree allows us to have (2, 2) nodes p
 \end{algorithm}
 
 \begin{algorithm}
-\Proc{$\texttt{fixDelete}(T, x, y, z, reversed, rotateLeft, rotateRight)$}{
+\Proc{$\texttt{fixDelete}(T, x, y, z, reversed, rotateL, rotateR)$}{
     $v \gets y.left$\;
     $w \gets y.right$\;
     \If{$reversed$}{
@@ -736,7 +736,7 @@ In contrast to the \textit{AVL Rule}, WAVL tree allows us to have (2, 2) nodes p
     }
     \BlankLine
     \uIf{$w \text{ is 1-child} \land y.parent \neq nil$}{
-        $rotateLeft(T, y.parent)$\;
+        $rotateL(T, y.parent)$\;
         \BlankLine
         $\texttt{promote}(y)$\;
         $\texttt{demote}(z)$\;
@@ -746,8 +746,8 @@ In contrast to the \textit{AVL Rule}, WAVL tree allows us to have (2, 2) nodes p
         }
     }
     \ElseIf{$w \text{ is 2-child} \land v.parent \neq nil$}{
-        $rotateRight(T, v.parent)$\;
-        $rotateLeft(T, v.parent)$\;
+        $rotateR(T, v.parent)$\;
+        $rotateL(T, v.parent)$\;
         \BlankLine
         $\texttt{promote}(v)$\;
         $\texttt{promote}(v)$\;