summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/source/latex/l3kernel/l3quark.dtx
diff options
context:
space:
mode:
Diffstat (limited to 'Master/texmf-dist/source/latex/l3kernel/l3quark.dtx')
-rw-r--r--Master/texmf-dist/source/latex/l3kernel/l3quark.dtx56
1 files changed, 23 insertions, 33 deletions
diff --git a/Master/texmf-dist/source/latex/l3kernel/l3quark.dtx b/Master/texmf-dist/source/latex/l3kernel/l3quark.dtx
index 4841664f938..32d2fc4540e 100644
--- a/Master/texmf-dist/source/latex/l3kernel/l3quark.dtx
+++ b/Master/texmf-dist/source/latex/l3kernel/l3quark.dtx
@@ -37,7 +37,7 @@
\documentclass[full]{l3doc}
%</driver>
%<*driver|package>
-\GetIdInfo$Id: l3quark.dtx 5659 2015-07-14 18:58:00Z joseph $
+\GetIdInfo$Id: l3quark.dtx 5855 2015-08-17 17:22:56Z mittelba $
{L3 Quarks}
%</driver|package>
%<*driver>
@@ -277,11 +277,6 @@
% Using quarks to define such functions simplifies their logic and ensures
% robustness in many cases.
%
-% \iffalse
-% \begin{macrocode}
-%<*exampleonly>
-% \end{macrocode}
-% \fi
%
% Here's the definition of |\my_map_dbl:nn|.
% First of all, define the function that will do the processing based on the
@@ -291,39 +286,34 @@
% delimiters according to the type of recursion (here a pair of
% \cs{q_recursion_tail}), concluding with \cs{q_recursion_stop}.
% These quarks are used to mark the end of the token list being operated upon.
-% \begin{macrocode}
-\cs_new:Npn \my_map_dbl:nn #1#2
- {
- \cs_set:Npn \__my_map_dbl_fn:nn ##1 ##2 {#2}
- \__my_map_dbl:nn #1 \q_recursion_tail \q_recursion_tail
- \q_recursion_stop
- }
-% \end{macrocode}
+%\begin{verbatim}
+% \cs_new:Npn \my_map_dbl:nn #1#2
+% {
+% \cs_set:Npn \__my_map_dbl_fn:nn ##1 ##2 {#2}
+% \__my_map_dbl:nn #1 \q_recursion_tail \q_recursion_tail
+% \q_recursion_stop
+% }
+%\end{verbatim}
%
% The definition of the internal recursion function follows.
% First check if either of the input tokens are the termination quarks.
% Then, if not, apply the inline function to the two arguments.
-% \begin{macrocode}
-\cs_new:Nn \__my_map_dbl:nn
- {
- \quark_if_recursion_tail_stop:n {#1}
- \quark_if_recursion_tail_stop:n {#2}
- \__my_map_dbl_fn:nn {#1} {#2}
-% \end{macrocode}
+%\begin{verbatim}
+% \cs_new:Nn \__my_map_dbl:nn
+% {
+% \quark_if_recursion_tail_stop:n {#1}
+% \quark_if_recursion_tail_stop:n {#2}
+% \__my_map_dbl_fn:nn {#1} {#2}
+%\end{verbatim}
% Finally, recurse:
-% \begin{macrocode}
- \__my_map_dbl:nn
- }
-% \end{macrocode}
+%\begin{verbatim}
+% \__my_map_dbl:nn
+% }
+%\end{verbatim}
% Note that contrarily to \LaTeX3 built-in mapping functions, this
% mapping function cannot be nested, since the second map will overwrite
% the definition of |\__my_map_dbl_fn:nn|.
%
-% \iffalse
-% \begin{macrocode}
-%</exampleonly>
-% \end{macrocode}
-% \fi
%
% \section{Internal quark functions}
%
@@ -418,7 +408,7 @@
% \end{macrocode}
% \end{variable}
%
-% \begin{variable}{\q_recursion_tail,\q_recursion_stop}
+% \begin{variable}{\q_recursion_tail, \q_recursion_stop}
% Quarks for ending recursions. Only ever used there!
% \cs{q_recursion_tail} is appended to whatever list structure we are
% doing recursion on, meaning it is added as a proper list item with
@@ -461,10 +451,10 @@
% \end{macro}
%
% \begin{macro}
-% {\quark_if_recursion_tail_stop:n,\quark_if_recursion_tail_stop:o}
+% {\quark_if_recursion_tail_stop:n, \quark_if_recursion_tail_stop:o}
% \UnitTested
% \begin{macro}
-% {\quark_if_recursion_tail_stop_do:nn,\quark_if_recursion_tail_stop_do:on}
+% {\quark_if_recursion_tail_stop_do:nn, \quark_if_recursion_tail_stop_do:on}
% \UnitTested
% \begin{macro}[aux]{\@@_if_recursion_tail:w}
% See \cs{quark_if_nil:nTF} for the details. Expanding