[latex3-commits] [git/LaTeX3-latex3-latex3] scan-quark: Add private quark tests in l3int (14a98fdd0)

[PhelypeOleinik]

Repository : https://github.com/latex3/latex3
On branch  : scan-quark
Link       : https://github.com/latex3/latex3/commit/14a98fdd003dcb0eac8055b27d7300e0676a2e7a

>---------------------------------------------------------------

commit 14a98fdd003dcb0eac8055b27d7300e0676a2e7a
Author: PhelypeOleinik <tex.phelype at gmail.com>
Date:   Thu Mar 12 00:17:43 2020 -0300

    Add private quark tests in l3int


>---------------------------------------------------------------

14a98fdd003dcb0eac8055b27d7300e0676a2e7a
 l3kernel/l3int.dtx | 34 ++++++++++++++++++++++++++--------
 1 file changed, 26 insertions(+), 8 deletions(-)

diff --git a/l3kernel/l3int.dtx b/l3kernel/l3int.dtx
index dec1552ce..228a13cf5 100644
--- a/l3kernel/l3int.dtx
+++ b/l3kernel/l3int.dtx
@@ -1069,6 +1069,24 @@
 %    \end{macrocode}
 % \end{macro}
 %
+% \begin{macro}{\q_@@_recursion_tail,\q_@@_recursion_stop}
+%   Quarks for recursion.
+%    \begin{macrocode}
+\quark_new:N \q_@@_recursion_tail
+\quark_new:N \q_@@_recursion_stop
+%    \end{macrocode}
+% \end{macro}
+%
+% \begin{macro}{\@@_if_recursion_tail_stop_do:Nn,\@@_if_recursion_tail_stop:N}
+%   Functions to query quarks.
+%    \begin{macrocode}
+\__kernel_quark_test_generate:NNNn \@@_if_recursion_tail_stop_do:Nn
+  \q_@@_recursion_tail \q_@@_recursion_stop { @@ }
+\__kernel_quark_test_generate:NNNn \@@_if_recursion_tail_stop:N
+  \q_@@_recursion_tail \q_@@_recursion_stop { @@ }
+%    \end{macrocode}
+% \end{macro}
+%
 % \subsection{Integer expressions}
 %
 % \begin{macro}{\int_eval:n}
@@ -2312,12 +2330,12 @@
       {
         \exp_after:wN \@@_pass_signs:wn \tl_to_str:n {#1}
           \s_@@_stop { \@@_from_alph:nN { 0 } }
-        \q_recursion_tail \q_recursion_stop
+        \q_@@_recursion_tail \q_@@_recursion_stop
       }
   }
 \cs_new:Npn \@@_from_alph:nN #1#2
   {
-    \quark_if_recursion_tail_stop_do:Nn #2 {#1}
+    \@@_if_recursion_tail_stop_do:Nn #2 {#1}
     \exp_args:Nf \@@_from_alph:nN
       { \int_eval:n { #1 * 26 + \@@_from_alph:N #2 } }
   }
@@ -2344,12 +2362,12 @@
       {
         \exp_after:wN \@@_pass_signs:wn \tl_to_str:n {#1}
           \s_@@_stop { \@@_from_base:nnN { 0 } {#2} }
-        \q_recursion_tail \q_recursion_stop
+        \q_@@_recursion_tail \q_@@_recursion_stop
       }
   }
 \cs_new:Npn \@@_from_base:nnN #1#2#3
   {
-    \quark_if_recursion_tail_stop_do:Nn #3 {#1}
+    \@@_if_recursion_tail_stop_do:Nn #3 {#1}
     \exp_args:Nf \@@_from_base:nnN
       { \int_eval:n { #1 * #2 + \@@_from_base:N #3 } }
       {#2}
@@ -2425,16 +2443,16 @@
         (
           0
           \exp_after:wN \@@_from_roman:NN \tl_to_str:n {#1}
-          \q_recursion_tail \q_recursion_tail \q_recursion_stop
+          \q_@@_recursion_tail \q_@@_recursion_tail \q_@@_recursion_stop
         )
       }
   }
 \cs_new:Npn \@@_from_roman:NN #1#2
   {
-    \quark_if_recursion_tail_stop:N #1
+    \@@_if_recursion_tail_stop:N #1
     \int_if_exist:cF { c_@@_from_roman_ #1 _int }
       { \@@_from_roman_error:w }
-    \quark_if_recursion_tail_stop_do:Nn #2
+    \@@_if_recursion_tail_stop_do:Nn #2
       { + \use:c { c_@@_from_roman_ #1 _int } }
     \int_if_exist:cF { c_@@_from_roman_ #2 _int }
       { \@@_from_roman_error:w }
@@ -2452,7 +2470,7 @@
         \@@_from_roman:NN #2
       }
   }
-\cs_new:Npn \@@_from_roman_error:w #1 \q_recursion_stop #2
+\cs_new:Npn \@@_from_roman_error:w #1 \q_@@_recursion_stop #2
   { #2 * 0 - 1 }
 %    \end{macrocode}
 % \end{macro}