| 1 |
% \iffalse meta-comment |
| 2 |
% !TEX program = pdfLaTeX |
| 3 |
%<*internal> |
| 4 |
\iffalse |
| 5 |
%</internal> |
| 6 |
%<*readme> |
| 7 |
----------------------------------------------------------------- |
| 8 |
##### erw-l3 --- Utilities based on LaTeX3, such as 'merge sort' |
| 9 |
- Source repository: https://github.com/rogard/erw-l3 |
| 10 |
- Released under the LaTeX Project Public License v1.3c or later |
| 11 |
- See http://www.latex-project.org/lppl.txt |
| 12 |
----------------------------------------------------------------- |
| 13 |
%</readme> |
| 14 |
%<*internal> |
| 15 |
\fi |
| 16 |
\def\nameofplainTeX{plain} |
| 17 |
\ifx\fmtname\nameofplainTeX\else |
| 18 |
\expandafter\begingroup |
| 19 |
\fi |
| 20 |
%</internal> |
| 21 |
%<*install> |
| 22 |
\input l3docstrip.tex |
| 23 |
\keepsilent |
| 24 |
\askforoverwritefalse |
| 25 |
\preamble |
| 26 |
----------------------------------------------------------------------------- |
| 27 |
erw-l3 --- Utilities based on LaTeX3, such as 'merge sort' |
| 28 |
Released under the LaTeX Project Public License v1.3c or later |
| 29 |
See http://www.latex-project.org/lppl.txt |
| 30 |
---------------------------------------------------------------------------- |
| 31 |
|
| 32 |
\endpreamble |
| 33 |
\postamble |
| 34 |
|
| 35 |
Copyright (C) 2020-2022 by Erwann Rogard |
| 36 |
|
| 37 |
This work may be distributed and/or modified under the |
| 38 |
conditions of the LaTeX Project Public License (LPPL), either |
| 39 |
version 1.3c of this license or (at your option) any later |
| 40 |
version. The latest version of this license is in the file: |
| 41 |
|
| 42 |
http://www.latex-project.org/lppl.txt |
| 43 |
|
| 44 |
This work is "maintained" (as per LPPL maintenance status) by |
| 45 |
Erwann Rogard. |
| 46 |
|
| 47 |
This work consists of the file erw-l3.dtx and the derived files: |
| 48 |
erw-l3.sty, and erw-l3.pdf. |
| 49 |
|
| 50 |
\endpostamble |
| 51 |
\generate{ |
| 52 |
\file{\jobname.sty}{\from{\jobname.dtx}{package}} |
| 53 |
} |
| 54 |
%</install> |
| 55 |
%<install> \endbatchfile |
| 56 |
%<*internal> |
| 57 |
\generate{ |
| 58 |
\file{\jobname.ins}{\from{\jobname.dtx}{install}} |
| 59 |
} |
| 60 |
\nopreamble\nopostamble |
| 61 |
\generate{ |
| 62 |
\file{README.md}{\from{\jobname.dtx}{readme}} |
| 63 |
} |
| 64 |
\ifx\fmtname\nameofplainTeX |
| 65 |
\expandafter\endbatchfile |
| 66 |
\else |
| 67 |
\expandafter\endgroup |
| 68 |
\fi |
| 69 |
%</internal> |
| 70 |
%<package> \NeedsTeXFormat{LaTeX2e}[2021-06-01] |
| 71 |
%<package> \RequirePackage{xparse, l3keys2e, xtemplate}[2021-06-01] |
| 72 |
%<package> \ProvidesExplPackage |
| 73 |
%<package> {erw-l3} % Package name |
| 74 |
%<package> {2022-01-28} % Release date |
| 75 |
%<package> {4.2} % Release version |
| 76 |
%<package> {erw-l3 --- Utilities based on LaTeX3, such as 'merge sort' } % Description |
| 77 |
%<*driver> |
| 78 |
\documentclass%^^A[show-notes] |
| 79 |
% ^^A[draft] |
| 80 |
{l3doc} |
| 81 |
\EnableCrossrefs |
| 82 |
\CodelineIndex |
| 83 |
\RecordChanges |
| 84 |
% ^^A \listfiles |
| 85 |
\usepackage{amsmath, bookmark, enumitem, mathtools, microtype, tcolorbox, xparse} |
| 86 |
\usepackage[french, german, english]{babel} |
| 87 |
\usepackage[T1]{fontenc} |
| 88 |
\usepackage[bibencoding=auto, backend=biber, sorting=ynt]{biblatex} |
| 89 |
\begin{filecontents*}{\jobname.bib} |
| 90 |
@manual{interface3, |
| 91 |
title = {The \LaTeX3 interfaces}, |
| 92 |
author = {The \LaTeX3 Project Team}, |
| 93 |
year = {2019}, |
| 94 |
note = {\url{https://ctan.math.washington.edu/tex-archive/macros/latex/contrib/l3kernel/expl3.pdf}}, |
| 95 |
annote = {} } |
| 96 |
\end{filecontents*} |
| 97 |
\addbibresource{\jobname.bib} |
| 98 |
\ExplSyntaxOn |
| 99 |
% ^^A *** Sectioning |
| 100 |
\tl_gset:Nn \partname {Part}%^^A allows to test w/o babel |
| 101 |
% ^^A *** Msg |
| 102 |
\msg_new:nnn{__erw-l3_doc}{unknown}{~#1:#2~unknown} |
| 103 |
% ^^A *** Expressions |
| 104 |
\ProvideDocumentCommand{\docrule}{}{\texttt{$\rightarrow$}} |
| 105 |
\ProvideDocumentCommand{\docpipe}{}{\textbar} |
| 106 |
% ^^A *** L3 package |
| 107 |
\ProvideDocumentCommand{\docparam}{m}{\texttt{\#}\meta{#1}} |
| 108 |
% ^^A *** Lists |
| 109 |
\newlist{arab-inl}{enumerate*}{1} |
| 110 |
\setlist[arab-inl]{label=\arabic*)} |
| 111 |
\newlist{colon-inl}{itemize*}{1} |
| 112 |
\setlist[colon-inl] |
| 113 |
{ %^^Abefore=\noindent, |
| 114 |
label={}, |
| 115 |
itemjoin={{; }}, |
| 116 |
after={{.}}} |
| 117 |
\newlist{descr}{description}{2} |
| 118 |
\setlist[descr]{nosep, align=right, itemindent=0pt, font=\sffamily\tiny} |
| 119 |
% ^^A Sort---> |
| 120 |
\ProvideDocumentCommand{\docdescrf}{m}{{\sffamily\bfseries\tiny{}#1}} |
| 121 |
\ProvideDocumentCommand{\docfillblank}{}{\begin{minipage}[t]{\linewidth}\end{minipage}} |
| 122 |
% ^^A Sort<--- |
| 123 |
\ExplSyntaxOff |
| 124 |
% ^^A *** listing |
| 125 |
\tcbuselibrary{listings, breakable} |
| 126 |
\newtcblisting[auto counter] |
| 127 |
{listing}[2][]{ |
| 128 |
noparskip, |
| 129 |
breakable, |
| 130 |
colback=white, |
| 131 |
colframe=black, |
| 132 |
opacitybacktitle=.8,% |
| 133 |
fonttitle=\bfseries, |
| 134 |
title={Listing~\thetcbcounter. #1}, |
| 135 |
arc=0pt, |
| 136 |
outer arc=0pt, |
| 137 |
boxrule=1pt, |
| 138 |
listing and text, |
| 139 |
#2} |
| 140 |
\usepackage{erw-l3} |
| 141 |
\usepackage{hyperref} %^^A comes last |
| 142 |
\begin{document} |
| 143 |
\DocInput{\jobname.dtx} |
| 144 |
\end{document} |
| 145 |
%</driver> |
| 146 |
% \fi |
| 147 |
% |
| 148 |
% \GetFileInfo{\jobname.sty} |
| 149 |
% \title{The \pkg{erw-l3} package\thanks{^^A |
| 150 |
% This file describes version \fileversion, last revised \filedate.^^A |
| 151 |
% }^^A |
| 152 |
% } |
| 153 |
% \begin{documentation} |
| 154 |
% \maketitle |
| 155 |
% \begin{abstract} |
| 156 |
% Utilities based on \LaTeX3\cite{interface3}, such as \cs{erw_merge_sort:nNn}. |
| 157 |
% \end{abstract} |
| 158 |
% \tableofcontents |
| 159 |
% \part{Usage} |
| 160 |
% \section{\textsf{boilerplate}} |
| 161 |
% \begin{function}{\erw_keys_set:n,\erw_keys_set:nn} |
| 162 |
% \cs{erw_keys_set:n}\Arg{keyval list} |
| 163 |
% \end{function} |
| 164 |
% \begin{function}[EXP] |
| 165 |
% {\erw_identity:n, |
| 166 |
% \erw_int_incr:n, |
| 167 |
% \erw_swap:nn, |
| 168 |
% \erw_swap:ne, |
| 169 |
% \erw_name_signature_cs:N} |
| 170 |
% \end{function} |
| 171 |
% \section{\textsf{quark}} |
| 172 |
% \begin{function} |
| 173 |
% {\erw_all_q:w, |
| 174 |
% \erw_remove_first_q:w, |
| 175 |
% \erw_first_q:w, |
| 176 |
% \erw_remove_last_q:w, |
| 177 |
% \erw_last_q:w} |
| 178 |
% \begin{syntax} |
| 179 |
% \cs{erw_remove_last_q:w}\meta{tokenlist} \cs[no-index]{q_recursion_tail}\cs[no-index]{q_recursion_stop} |
| 180 |
% \end{syntax} |
| 181 |
% \end{function} |
| 182 |
% \section{\textsf{predicate}} |
| 183 |
% \begin{function}{new_compare_p} |
| 184 |
% \cs{erw_keys_set:n}|{ new_compare_p = |\Arg{name}\Arg{signature}\Arg{predicate}| }| |
| 185 |
% \begin{descr} |
| 186 |
% \item[Instance]\docfillblank |
| 187 |
% \begin{descr} |
| 188 |
% \item[erw_compare_p:nNnNn] |
| 189 |
% \item[erw_int_incr_p:nn] |
| 190 |
% \end{descr} |
| 191 |
% \end{descr} |
| 192 |
% \end{function} |
| 193 |
% \section{\textsf{op's on lists}} |
| 194 |
% \begin{function} |
| 195 |
% {\erw_remove_first:n, |
| 196 |
% \erw_remove_last:n, |
| 197 |
% \erw_first:n, |
| 198 |
% \erw_last:n, |
| 199 |
% \erw_adjacent_insert:nn, |
| 200 |
% \erw_adjacent_insert:en} |
| 201 |
% \end{function} |
| 202 |
% \section{\textsf{algo}} |
| 203 |
% \begin{function} |
| 204 |
% {\erw_split_even:n, |
| 205 |
% \erw_split_even:e, |
| 206 |
% \erw_merge_sort:nNn, |
| 207 |
% \thread_sort:nnNn, |
| 208 |
% \erw_filter_uniq:nn, |
| 209 |
% \erw_filter_uniq:n |
| 210 |
% } |
| 211 |
% \begin{syntax} |
| 212 |
% \cs{erw_thread_sort:nnNn}\Arg{first sorted list}\Arg{second sorted list}\Arg{compare predicate name}|<|\docpipe|>| |
| 213 |
% \cs{erw_merge_sort:nNn}\Arg{compare predicate name}|<|\docpipe|>|\Arg{unsorted list} |
| 214 |
% \cs{erw_filter_uniq:nn}\Arg{compare predicate}\Arg{tokenlist} |
| 215 |
% \cs{erw_filter_uniq:n}\Arg{ascending intergers} |
| 216 |
% \end{syntax} |
| 217 |
% \end{function} |
| 218 |
% \section{\textsf{code}} |
| 219 |
% \begin{function}{\erw_parameter:n, |
| 220 |
% \erw_parameter:nn,\argument:nn,} |
| 221 |
% \begin{syntax} |
| 222 |
% \cs{erw_parameter:n}\Arg{arity} |
| 223 |
% \cs{erw_parameter:nn}\Arg{start pos}\Arg{arity} |
| 224 |
% \cs{erw_argument:nn}\Arg{start pos}\Arg{signature} |
| 225 |
% \end{syntax} |
| 226 |
% \end{function} |
| 227 |
% |
| 228 |
% \part{Other} |
| 229 |
% \section{Bibliograhy} |
| 230 |
% \printbibliography[heading=none] |
| 231 |
% \section{Support}\label{other:support} |
| 232 |
% |
| 233 |
% This package is available from \url{https://github.com/rogard/erw-l3}. |
| 234 |
% \changes{v4.0}{2022/01/27} |
| 235 |
%{Replacing 3.2 altogether (not used by any packages but mine that have been updated accordingly} |
| 236 |
% \changes{v4.1}{2022/01/27} |
| 237 |
% {Removed commented portion labeled trash (thread), code_analyze, erw_compare_recurse_p:nnN[N], and keyval, as not used.} |
| 238 |
% \changes{v4.2}{2022/01.28} |
| 239 |
% {Removed \cs[no-index]{__erw_keyval_dispatch_build:nn}} |
| 240 |
% \StopEventually{ |
| 241 |
% \clearpage |
| 242 |
% \PrintChanges |
| 243 |
% \PrintIndex %^^A https://tex.stackexchange.com/q/610349/112708 |
| 244 |
% } |
| 245 |
%^^A% |
| 246 |
% \end{documentation} |
| 247 |
% \begin{implementation} |
| 248 |
% \part{Implementation}\label{part:impl} |
| 249 |
% \begin{macrocode} |
| 250 |
%<*package> |
| 251 |
%<@@=erw> |
| 252 |
% \ExplSyntaxOn |
| 253 |
% \end{macrocode} |
| 254 |
% \section{\textsf{kernel}} |
| 255 |
% \begin{macrocode} |
| 256 |
\cs_generate_variant:Nn\int_compare_p:nNn{eNe} |
| 257 |
\cs_generate_variant:Nn\int_eval:n{e} |
| 258 |
\cs_generate_variant:Nn\prg_new_conditional:Nnn{c} |
| 259 |
\cs_generate_variant:Nn\prg_replicate:nn{e} |
| 260 |
\cs_generate_variant:Nn\regex_gset:Nn{c} |
| 261 |
\cs_generate_variant:Nn\regex_log:N{c} |
| 262 |
\cs_generate_variant:Nn\regex_match:NnTF{c} |
| 263 |
\cs_generate_variant:Nn\tl_to_str:n{e} |
| 264 |
\cs_generate_variant:Nn\prop_put:Nnn{Nne} |
| 265 |
% \end{macrocode} |
| 266 |
% \section{\textsf{boilerplate}} |
| 267 |
% \begin{macrocode} |
| 268 |
\msg_new:nnnn{@@}{text}{text~is~not~loaded}{load~amsmath} |
| 269 |
\cs_new:Npn \@@_text:n #1 |
| 270 |
{\cs_if_exist:NTF\text{\text{#1}}{\msg_error:nn{@@}{text}}} |
| 271 |
\cs_new:Npn\@@_empty:w #1 \q_recursion_stop {\c_empty_tl} |
| 272 |
\cs_new_protected:Nn\erw_keys_set:n{ \keys_set:nn{@@}{#1} } |
| 273 |
\cs_new_protected:Nn\erw_keys_set:nn{ \keys_set:nn{@@ / #1}{#2} } |
| 274 |
\cs_generate_variant:Nn\erw_apply:Nw{c} |
| 275 |
\cs_new:Npn \erw_identity:n#1{#1} |
| 276 |
\cs_new:Npn \erw_int_incr:n#1{\int_eval:n{#1+1}} |
| 277 |
\cs_new:Npn \erw_swap:nn#1#2{#2#1} |
| 278 |
\cs_generate_variant:Nn \erw_swap:nn{e} |
| 279 |
\cs_new:Npn \erw_name_signature_cs:N #1 |
| 280 |
{ \exp_last_unbraced:Ne |
| 281 |
\@@_name_signature_cs:nnn{\cs_split_function:N#1}} |
| 282 |
\cs_new:Nn \@@_name_signature_cs:nnn{{#1}{#2}} |
| 283 |
% \end{macrocode} |
| 284 |
% \section{\textsf{quark}} |
| 285 |
% \begin{macrocode} |
| 286 |
\msg_new:nnn{erw}{quark-only-tail} |
| 287 |
{requires~tail;~got~'#1';~\msg_line_context:} |
| 288 |
\cs_new:Npn |
| 289 |
\erw_all_q:w |
| 290 |
#1 |
| 291 |
\q_recursion_stop |
| 292 |
{% |
| 293 |
\erw_remove_last_q:w#1\q_recursion_stop |
| 294 |
\erw_last_q:w#1\q_recursion_stop |
| 295 |
} |
| 296 |
\cs_new:Npn |
| 297 |
\erw_remove_first_q:w |
| 298 |
#1 % <tokenlist ending with recursion tail> |
| 299 |
\q_recursion_stop |
| 300 |
{\quark_if_recursion_tail_stop:n{#1} |
| 301 |
\@@_remove_first_q:nw#1\q_recursion_stop} |
| 302 |
\cs_new:Npn |
| 303 |
\@@_remove_first_q:nw |
| 304 |
#1 % <head> |
| 305 |
#2 % <rest> |
| 306 |
\q_recursion_stop |
| 307 |
{\erw_remove_last_q:w#2\q_recursion_stop |
| 308 |
\erw_last_q:w#2\q_recursion_stop} |
| 309 |
\cs_new:Npn |
| 310 |
\erw_first_q:w |
| 311 |
#1 |
| 312 |
\q_recursion_stop |
| 313 |
{% |
| 314 |
\quark_if_recursion_tail_stop:n{#1} |
| 315 |
\@@_first_q:enw{ \tl_if_head_is_group_p:n{#1}}#1\q_recursion_stop } |
| 316 |
\cs_new:Npn |
| 317 |
\@@_first_q:nnw |
| 318 |
#1 % <head is group> |
| 319 |
#2 % <head> |
| 320 |
#3 % <rest> |
| 321 |
\q_recursion_stop |
| 322 |
{% |
| 323 |
\bool_if:nTF{#1}{{#2}}{#2} |
| 324 |
} |
| 325 |
\cs_generate_variant:Nn\@@_first_q:nnw{e} |
| 326 |
\cs_new:Npn |
| 327 |
\erw_remove_last_q:w #1 \q_recursion_stop |
| 328 |
{% |
| 329 |
\quark_if_recursion_tail_stop:n{#1} |
| 330 |
\@@_remove_last_q:ew{\tl_if_head_is_group_p:n{#1}}#1\q_recursion_stop } |
| 331 |
\cs_new:Npn |
| 332 |
\@@_remove_last_q:nw |
| 333 |
#1 % <head is group> |
| 334 |
#2 % <tokenlist> |
| 335 |
\q_recursion_stop |
| 336 |
{ \@@_remove_last_q:nnw{#1}#2\q_recursion_stop } |
| 337 |
\cs_generate_variant:Nn\@@_remove_last_q:nw{e} |
| 338 |
\cs_new:Npn |
| 339 |
\@@_remove_last_q:nnw |
| 340 |
#1 % <head is group> |
| 341 |
#2 % <head> |
| 342 |
#3 % <rest> |
| 343 |
\q_recursion_stop |
| 344 |
{% |
| 345 |
\quark_if_recursion_tail_stop:n{#3} |
| 346 |
\bool_if:nTF{#1}{{#2}}{#2} |
| 347 |
\@@_remove_last_q:ew {\tl_if_head_is_group_p:n{#3}} #3 \q_recursion_stop |
| 348 |
} |
| 349 |
\cs_generate_variant:Nn\@@_remove_last_q:nnw{e} |
| 350 |
\cs_new:Npn |
| 351 |
\erw_last_q:w #1 \q_recursion_stop |
| 352 |
{\quark_if_recursion_tail_stop:n{#1} |
| 353 |
\@@_last_q:ew{\tl_if_head_is_group_p:n{#1}}#1\q_recursion_stop} |
| 354 |
\cs_new:Npn |
| 355 |
\@@_last_q:nw |
| 356 |
#1 % <head is group> |
| 357 |
#2 % <tokenlist> |
| 358 |
\q_recursion_stop |
| 359 |
{ \@@_last_q:nnw{#1}#2\q_recursion_stop } |
| 360 |
\cs_generate_variant:Nn\@@_last_q:nw{e} |
| 361 |
\cs_new:Npn |
| 362 |
\@@_last_q:nnw |
| 363 |
#1 % <head is group> |
| 364 |
#2 % <head> |
| 365 |
#3 % <rest> |
| 366 |
\q_recursion_stop |
| 367 |
{% |
| 368 |
\quark_if_recursion_tail_stop_do:nn{#3}{ \bool_if:nTF{#1}{{#2}}{#2} } |
| 369 |
\@@_last_q:ew {\tl_if_head_is_group_p:n{#3}} #3 \q_recursion_stop |
| 370 |
} |
| 371 |
\cs_generate_variant:Nn\@@_last_q:nnw{e} |
| 372 |
% \end{macrocode} |
| 373 |
% \section{\textsf{predicate}} |
| 374 |
% \begin{macrocode} |
| 375 |
\msg_new:nnn{@@}{predicate-empty} |
| 376 |
{empty~expression~in~predicate} |
| 377 |
\prg_new_conditional:Npnn |
| 378 |
\erw_and_tl:nn |
| 379 |
#1 % <predicate expression> |
| 380 |
#2 % <tokens> |
| 381 |
{p} |
| 382 |
{%^^A |
| 383 |
\@@_and_tl:nw {#1}#2 \q_recursion_tail\q_recursion_stop |
| 384 |
} |
| 385 |
\cs_new:Npn |
| 386 |
\@@_and_tl:nw |
| 387 |
#1 % <predicate expression> |
| 388 |
#2 % <value> |
| 389 |
\q_recursion_stop |
| 390 |
{% |
| 391 |
\quark_if_recursion_tail_stop_do:nn{#2} |
| 392 |
{ \prg_return_true: } |
| 393 |
\@@_and_tl:nnw |
| 394 |
{#1} % <predicate expression> |
| 395 |
#2 % <value> |
| 396 |
\q_recursion_stop |
| 397 |
} |
| 398 |
\cs_new:Npn |
| 399 |
\@@_and_tl:nnw |
| 400 |
#1 % <predicate expression> |
| 401 |
#2 % <value> |
| 402 |
#3 % <rest> |
| 403 |
\q_recursion_stop |
| 404 |
{% |
| 405 |
\bool_if:nTF |
| 406 |
{#1{#2}} |
| 407 |
{\@@_and_tl:nw{#1}#3\q_recursion_stop} |
| 408 |
{ \prg_return_false: } |
| 409 |
} |
| 410 |
\cs_new:Npn \@@_new_compare_p:nnn |
| 411 |
#1 % <name> |
| 412 |
#2 % <signature> |
| 413 |
#3 % <code> |
| 414 |
{% |
| 415 |
\prg_new_conditional:cnn{#1:#2} |
| 416 |
{p} |
| 417 |
{% |
| 418 |
\bool_if:nTF |
| 419 |
{#3} |
| 420 |
{\prg_return_true:} |
| 421 |
{\prg_return_false:} |
| 422 |
} |
| 423 |
} |
| 424 |
\keys_define:nn{ @@ } |
| 425 |
{ |
| 426 |
new_compare_p.code:n = {\@@_new_compare_p:nnn#1} |
| 427 |
} |
| 428 |
\erw_keys_set:n |
| 429 |
{% |
| 430 |
new_compare_p = |
| 431 |
{erw_compare} % <name> |
| 432 |
{nNnNn} |
| 433 |
{ \@@_compare:eecN{ #2{#3} }{ #2{#5} }{ #1:nNn }#4 } |
| 434 |
} |
| 435 |
\cs_new:Npn |
| 436 |
\@@_compare:nnNN |
| 437 |
#1 % <first> |
| 438 |
#2 % <second> |
| 439 |
#3 % <predicate> |
| 440 |
#4 % <operator> |
| 441 |
{ #3{ #1 }#4{ #2 } } |
| 442 |
\cs_generate_variant:Nn\@@_compare:nnNN{eec} |
| 443 |
\erw_keys_set:n |
| 444 |
{% |
| 445 |
new_compare_p = |
| 446 |
{erw_int_incr} |
| 447 |
{nn} |
| 448 |
{\exp_args:Ne |
| 449 |
\int_compare_p:nNn{ \int_eval:n{#1+1} } = {#2} } |
| 450 |
} |
| 451 |
% \end{macrocode} |
| 452 |
% \section{\textsf{keyval}} |
| 453 |
% \begin{macrocode} |
| 454 |
\cs_new:Npn\@@_keyval_key:w #1 = #2 \q_recursion_stop{#1} |
| 455 |
\cs_new:Npn\@@_keyval_value:w #1 = #2 \q_recursion_stop{#2} |
| 456 |
\cs_new:Npn \erw_keyval_key:n#1{\@@_keyval_key:w #1 \q_recursion_stop} |
| 457 |
\cs_new:Npn \erw_keyval_value:n#1{\@@_keyval_value:w #1 \q_recursion_stop} |
| 458 |
\cs_new:Npn \erw_keyval:nn#1#2{ #1 = #2 } |
| 459 |
\erw_keys_set:n |
| 460 |
{ |
| 461 |
new_compare_p = {erw_key_compare} |
| 462 |
{nNn}{ \erw_compare_p:nNnNn |
| 463 |
{int_compare_p}\erw_keyval_key:n{#1}#2{#3} }, |
| 464 |
new_compare_p = {erw_key_compare} |
| 465 |
{n}{ \erw_compare_recurse_p:nnNN{#1} |
| 466 |
{int_compare_p}\erw_keyval_key:n< } |
| 467 |
} |
| 468 |
% \end{macrocode} |
| 469 |
% \section{\textsf{op's on list}} |
| 470 |
% \begin{macrocode} |
| 471 |
\cs_new:Npn |
| 472 |
\erw_remove_first:n |
| 473 |
#1 % <tokenlist> |
| 474 |
{\erw_remove_first_q:w#1\q_recursion_tail\q_recursion_stop} |
| 475 |
\cs_generate_variant:Nn\erw_remove_first:n{e} |
| 476 |
\cs_new:Npn |
| 477 |
\erw_remove_last:n |
| 478 |
#1 % <tokenlist> |
| 479 |
{\erw_remove_last_q:w#1\q_recursion_tail\q_recursion_stop} |
| 480 |
\cs_generate_variant:Nn\erw_remove_last:n{e} |
| 481 |
\cs_new:Npn |
| 482 |
\erw_first:n |
| 483 |
#1 |
| 484 |
{\erw_first_q:w#1\q_recursion_tail\q_recursion_stop} |
| 485 |
\cs_generate_variant:Nn\erw_first:n{e} |
| 486 |
\cs_new:Npn |
| 487 |
\erw_last:n |
| 488 |
#1 % <tokenlist> |
| 489 |
{\erw_last_q:w#1\q_recursion_tail\q_recursion_stop} |
| 490 |
\cs_generate_variant:Nn\erw_last:n{e} |
| 491 |
\cs_new:Npn |
| 492 |
\erw_adjacent_insert:nn |
| 493 |
#1 % <list> |
| 494 |
#2 % <separator> |
| 495 |
{% |
| 496 |
\erw_first:n{#1} |
| 497 |
\erw_swap:en |
| 498 |
{ \erw_remove_first:n{#1} } |
| 499 |
{% |
| 500 |
\@@_adjacent_insert:nw |
| 501 |
{#2} % <separator> |
| 502 |
} |
| 503 |
\q_recursion_tail |
| 504 |
\q_recursion_stop |
| 505 |
} |
| 506 |
\cs_generate_variant:Nn\erw_adjacent_insert:nn{e} |
| 507 |
\cs_new:Npn |
| 508 |
\@@_adjacent_insert:nw |
| 509 |
#1 % <separator> |
| 510 |
#2 % <rest> |
| 511 |
\q_recursion_stop |
| 512 |
{% |
| 513 |
\quark_if_recursion_tail_stop:n{#2} |
| 514 |
\@@_adjacent_insert:new {#1}{\tl_if_head_is_group_p:n{#2}}#2 \q_recursion_stop |
| 515 |
} |
| 516 |
\cs_new:Npn |
| 517 |
\@@_adjacent_insert:nnw |
| 518 |
#1 % <separator> |
| 519 |
#2 % <head is group> |
| 520 |
#3 % <head> |
| 521 |
#4 % <rest> |
| 522 |
\q_recursion_stop |
| 523 |
{% |
| 524 |
#1\bool_if:nTF{#2}{{#3}}{#3} |
| 525 |
\@@_adjacent_insert:nw{#1}#4\q_recursion_stop |
| 526 |
} |
| 527 |
\cs_generate_variant:Nn\@@_adjacent_insert:nnw{ne} |
| 528 |
% \end{macrocode} |
| 529 |
% \begin{macrocode} |
| 530 |
\cs_new:Npn |
| 531 |
\erw_clist_tl:nn |
| 532 |
#1 % <bool> |
| 533 |
#2 % <list> |
| 534 |
{ \erw_clist_tl:nnw {#1} #2 \q_recursion_tail\q_recursion_stop } |
| 535 |
\cs_new:Npn |
| 536 |
\erw_clist_tl:nnw #1 #2\q_recursion_stop |
| 537 |
{\quark_if_recursion_tail_stop:n{#2} |
| 538 |
\erw_clist_tl:nenw {#1} |
| 539 |
{\tl_if_head_is_group_p:n{#2}} #2 \q_recursion_stop} |
| 540 |
\cs_generate_variant:Nn\erw_clist_tl:nnw{ne} |
| 541 |
\cs_new:Npn |
| 542 |
\erw_clist_tl:nnnw |
| 543 |
#1 % <bool> |
| 544 |
#2 % <head is group> |
| 545 |
#3 % <head> |
| 546 |
#4 % <rest> |
| 547 |
\q_recursion_stop |
| 548 |
{ |
| 549 |
\quark_if_recursion_tail_stop_do:nn{#4} |
| 550 |
{% |
| 551 |
\bool_if:nTF |
| 552 |
{\bool_lazy_and_p:nn{#1}{#2}} |
| 553 |
{{#3}}{#3} |
| 554 |
} |
| 555 |
\bool_if:nTF{\bool_lazy_and_p:nn{#1}{#2}} |
| 556 |
{{#3}}{#3}, |
| 557 |
\erw_clist_tl:nnw {#1} #4 \q_recursion_stop |
| 558 |
} |
| 559 |
\cs_generate_variant:Nn\erw_clist_tl:nnnw{ne} |
| 560 |
\prg_new_conditional:Npnn |
| 561 |
\erw_if_in_clist:nn |
| 562 |
#1 % <value> |
| 563 |
#2 % <clist> |
| 564 |
{p} |
| 565 |
{ \@@_clist_if_in:nw {#1} #2, \q_recursion_tail \q_recursion_stop } |
| 566 |
\cs_new:Npn |
| 567 |
\@@_clist_if_in:nw #1 #2 \q_recursion_stop |
| 568 |
{% |
| 569 |
\quark_if_recursion_tail_stop:n{#2} |
| 570 |
\@@_clist_if_in:nnw {#1} #2 \q_recursion_stop |
| 571 |
} |
| 572 |
\cs_new:Nn |
| 573 |
\@@_clist_if_in:nn |
| 574 |
{\@@_clist_if_in:nw{#1} #2 \q_recursion_stop} |
| 575 |
\cs_new:Npn |
| 576 |
\@@_clist_if_in:nnw #1 #2, #3 \q_recursion_stop |
| 577 |
{% |
| 578 |
\quark_if_recursion_tail_stop_do:nn{#3} |
| 579 |
{% |
| 580 |
\str_if_eq:nnTF{#1}{#2} |
| 581 |
{\prg_return_true:}{\prg_return_false:} |
| 582 |
} |
| 583 |
\str_if_eq:nnTF{#1}{#2} |
| 584 |
{\prg_return_true:} |
| 585 |
{\@@_clist_if_in:nw {#1} #3 \q_recursion_stop} |
| 586 |
\@@_empty:w\q_recursion_stop |
| 587 |
} |
| 588 |
% \end{macrocode} |
| 589 |
% \section{\textsf{algo}} |
| 590 |
% \subsection{\textsf{split}} |
| 591 |
% \begin{macrocode} |
| 592 |
\cs_new:Npn |
| 593 |
\erw_split_even:n |
| 594 |
#1 % <tokenlist> |
| 595 |
{% |
| 596 |
\tl_if_empty:nF{#1} |
| 597 |
{% |
| 598 |
\exp_last_unbraced:Ne |
| 599 |
\@@_split_even:nnnw |
| 600 |
{% |
| 601 |
{\@@_split_even_threshold:n{#1}} % <count> |
| 602 |
{\tl_if_head_is_group_p:n{#1}} % <head is group> |
| 603 |
} |
| 604 |
#1 % <tokenlist> |
| 605 |
\q_recursion_tail |
| 606 |
\q_recursion_stop |
| 607 |
} |
| 608 |
} |
| 609 |
\cs_generate_variant:Nn\erw_split_even:n{e} |
| 610 |
\cs_new:Npn |
| 611 |
\@@_split_even_threshold:n |
| 612 |
#1 % <tokenlist> |
| 613 |
{\exp_args:Ne |
| 614 |
\int_div_round:nn{\tl_count:n{#1}}{2}} |
| 615 |
\cs_new:Npn |
| 616 |
\@@_split_even:nnnw |
| 617 |
#1 % <threshold> |
| 618 |
#2 % <head is group> |
| 619 |
#3 % <head> |
| 620 |
#4 % <rest> |
| 621 |
\q_recursion_stop |
| 622 |
{% |
| 623 |
\quark_if_recursion_tail_stop_do:nn{#4} |
| 624 |
{ { \bool_if:nTF{#2}{{#3}}{#3} }{} } |
| 625 |
\exp_last_unbraced:Ne |
| 626 |
\@@_split_even:nnnnw |
| 627 |
{% |
| 628 |
{1} % <left size> |
| 629 |
{ \tl_if_head_is_group_p:n{#4} } |
| 630 |
{#1} % <threshold count> |
| 631 |
{ \bool_if:nTF{#2}{{#3}}{#3} } % <left list> |
| 632 |
} |
| 633 |
#4 % <right list> |
| 634 |
\q_recursion_stop |
| 635 |
} |
| 636 |
\cs_new:Npn |
| 637 |
\@@_split_even:nnnnw |
| 638 |
#1 % <left size> |
| 639 |
#2 % <right head is group> |
| 640 |
#3 % <threshold count> |
| 641 |
#4 % <left list> |
| 642 |
#5 % <right head> |
| 643 |
#6 % <right rest> |
| 644 |
\q_recursion_stop |
| 645 |
{% |
| 646 |
\bool_if:nTF |
| 647 |
{ \int_compare_p:nNn {#1}<{#3} } |
| 648 |
{% |
| 649 |
\exp_last_unbraced:Ne |
| 650 |
\@@_split_even:nnnnw |
| 651 |
{ |
| 652 |
{ \int_eval:n{#1+1} } % <left size> |
| 653 |
{ \tl_if_head_is_group_p:n{#6} } % <right head is group> |
| 654 |
{#3} % <threshold count> |
| 655 |
{#4\bool_if:nTF{#2}{{#5}}{#5}} % <left list> |
| 656 |
} |
| 657 |
#6 |
| 658 |
\q_recursion_stop |
| 659 |
} |
| 660 |
{% |
| 661 |
{#4} |
| 662 |
{% |
| 663 |
\bool_if:nTF{#2}{{#5}}{#5} |
| 664 |
\erw_remove_last_q:w#6\q_recursion_stop\erw_last_q:w#6\q_recursion_stop} |
| 665 |
} |
| 666 |
} |
| 667 |
% \end{macrocode} |
| 668 |
% \subsection{\textsf{thread sort}} |
| 669 |
% \begin{macrocode} |
| 670 |
\cs_new:Npn |
| 671 |
\erw_thread_sort:nnNn |
| 672 |
#1 % <first sorted list> |
| 673 |
#2 % <second sorted list> |
| 674 |
#3 % <compare predicate name> |
| 675 |
#4 % <compare operator> |
| 676 |
{% |
| 677 |
\@@_thread_sort:nNnnn |
| 678 |
{#3} % <compare predicate name> |
| 679 |
#4 % <compare operator> |
| 680 |
{\c_empty_tl} % <accum> |
| 681 |
{#1} |
| 682 |
{#2} |
| 683 |
} |
| 684 |
\cs_generate_variant:Nn\erw_thread_sort:nnNn{ee} |
| 685 |
\cs_new:Npn |
| 686 |
\@@_thread_sort:nNnnn |
| 687 |
#1 % <compare predicate name> |
| 688 |
#2 % <compare operator> |
| 689 |
#3 % <sorted> |
| 690 |
#4 % <first> |
| 691 |
#5 % <second> |
| 692 |
{% |
| 693 |
\@@_thread_sort:nNnww |
| 694 |
{#1} % <compare predicate name> |
| 695 |
{#2} % <compare operator> |
| 696 |
{#3} % <sorted> |
| 697 |
#4 \q_recursion_tail% <first> |
| 698 |
\q_stop |
| 699 |
#5 \q_recursion_tail% <second> |
| 700 |
\q_recursion_stop |
| 701 |
} |
| 702 |
\cs_generate_variant:Nn\@@_thread_sort:nNnnn{nNeee} |
| 703 |
\cs_new:Npn |
| 704 |
\@@_thread_sort:nNnww |
| 705 |
#1 % <compare predicate name> |
| 706 |
#2 % <compare operator> |
| 707 |
#3 % <sorted> |
| 708 |
#4 % <first> |
| 709 |
\q_stop |
| 710 |
#5 % <second> |
| 711 |
\q_recursion_stop |
| 712 |
{% |
| 713 |
\quark_if_recursion_tail_stop_do:nn{#4} |
| 714 |
{ #3 \erw_all_q:w #5 \q_recursion_stop } |
| 715 |
\quark_if_recursion_tail_stop_do:nn{#5} |
| 716 |
{ #3 \erw_all_q:w #4 \q_recursion_stop } |
| 717 |
\@@_thread_sort:nNneeww |
| 718 |
{#1}#2{#3} |
| 719 |
{ \tl_if_head_is_group_p:n{#4} } |
| 720 |
{ \tl_if_head_is_group_p:n{#5} } |
| 721 |
#4\q_stop |
| 722 |
#5\q_recursion_stop |
| 723 |
} |
| 724 |
\cs_new:Npn |
| 725 |
\@@_thread_sort:nNnnnww |
| 726 |
#1 % <compare predicate name> |
| 727 |
#2 % <compare operator> |
| 728 |
#3 % <sorted> |
| 729 |
#4 % <head is begin> |
| 730 |
#5 % <head is begin> |
| 731 |
#6 % <first head> |
| 732 |
#7 % <first rest> |
| 733 |
\q_stop |
| 734 |
#8 % <second head> |
| 735 |
#9 % <second rest> |
| 736 |
\q_recursion_stop |
| 737 |
{% |
| 738 |
\bool_if:nTF |
| 739 |
{ \use:c{#1:nNn}{#6}#2{#8} } |
| 740 |
{% |
| 741 |
\@@_thread_sort:nNeee |
| 742 |
{#1} |
| 743 |
#2 |
| 744 |
{#3\bool_if:nTF{#4}{{#6}}{#6}} |
| 745 |
{\erw_all_q:w#7\q_recursion_stop} |
| 746 |
{\bool_if:nTF{#5}{{#8}}{#8}\erw_all_q:w#9\q_recursion_stop} |
| 747 |
} |
| 748 |
{% |
| 749 |
\@@_thread_sort:nNeee |
| 750 |
{#1} |
| 751 |
#2 |
| 752 |
{#3\bool_if:nTF{#5}{{#8}}{#8}} |
| 753 |
{\bool_if:nTF{#4}{{#6}}{#6}\erw_all_q:w#7\q_recursion_stop} |
| 754 |
{\erw_all_q:w#9\q_recursion_stop} |
| 755 |
} |
| 756 |
} |
| 757 |
\cs_generate_variant:Nn\@@_thread_sort:nNnnnww{nNnee} |
| 758 |
% \end{macrocode} |
| 759 |
% \subsection{\textsf{merge sort}} |
| 760 |
% \begin{macrocode} |
| 761 |
\cs_new:Npn |
| 762 |
\erw_merge_sort:nNn |
| 763 |
#1 % <compare predicate name> |
| 764 |
#2 % <compare operator> |
| 765 |
#3 % <unsorted list> |
| 766 |
{% |
| 767 |
\tl_if_empty:nF{#3} |
| 768 |
{% |
| 769 |
\@@_sort_merge:enNw |
| 770 |
{\tl_if_head_is_group_p:n{#3}} % <head is group> |
| 771 |
{#1} % <compare predicate name> |
| 772 |
#2 % <compare operator> |
| 773 |
#3 % <unsorted list> |
| 774 |
\q_recursion_tail |
| 775 |
\q_recursion_stop |
| 776 |
} |
| 777 |
} |
| 778 |
\cs_generate_variant:Nn\erw_merge_sort:nNn{nNe} |
| 779 |
\cs_new:Npn |
| 780 |
\@@_sort_merge:nnNw |
| 781 |
#1 % <head is group> |
| 782 |
#2 % <compare predicate name> |
| 783 |
#3 % <compare operator> |
| 784 |
#4 % <unsorted list head> |
| 785 |
#5 % <unsorted list rest> |
| 786 |
\q_recursion_stop |
| 787 |
{% |
| 788 |
\quark_if_recursion_tail_stop_do:nn{#5} |
| 789 |
{ \bool_if:nTF{#1}{{#4}}{#4} } |
| 790 |
\exp_last_unbraced:Ne |
| 791 |
\@@_sort_merge:nnnN |
| 792 |
{% |
| 793 |
\erw_split_even:e |
| 794 |
{% |
| 795 |
\bool_if:nTF{#1}{{#4}}{#4} |
| 796 |
\erw_all_q:w#5\q_recursion_stop |
| 797 |
} |
| 798 |
} % {<first sorted list>}{<second sorted list>} |
| 799 |
{#2} % <compare predicate name> |
| 800 |
#3 % <compare operator> |
| 801 |
\@@_empty:w \q_recursion_stop |
| 802 |
} |
| 803 |
\cs_generate_variant:Nn\@@_sort_merge:nnNw{e} |
| 804 |
\cs_new:Npn |
| 805 |
\@@_sort_merge:nnnN |
| 806 |
#1 % <left unsorted list> |
| 807 |
#2 % <right unsorted list> |
| 808 |
#3 % <compare predicate name> |
| 809 |
#4 % <compare operator> |
| 810 |
{% |
| 811 |
\erw_thread_sort:eeNn |
| 812 |
{% |
| 813 |
\@@_sort_merge:enNw |
| 814 |
{\tl_if_head_is_group_p:n{#1}} |
| 815 |
{#3} % <compare predicate name> |
| 816 |
#4 % <compare operator> |
| 817 |
#1 % <unsorted list> |
| 818 |
\q_recursion_tail |
| 819 |
\q_recursion_stop |
| 820 |
} % <first sorted list> |
| 821 |
{% |
| 822 |
\@@_sort_merge:enNw |
| 823 |
{\tl_if_head_is_group_p:n{#2}} |
| 824 |
{#3} % <compare predicate name> |
| 825 |
#4 % <compare operator> |
| 826 |
#2 % <unsorted list> |
| 827 |
\q_recursion_tail |
| 828 |
\q_recursion_stop |
| 829 |
} % <second sorted list> |
| 830 |
{#3} % <compare predicate name> |
| 831 |
#4 % <operator> |
| 832 |
} |
| 833 |
% \end{macrocode} |
| 834 |
% \subsection{\textsf{filter}} |
| 835 |
% \begin{macrocode} |
| 836 |
\msg_new:nnn{@@}{tokenlist-incr} |
| 837 |
{expecting~an~ascending~tokenlist~got~#1~followed~by~#2} |
| 838 |
\cs_new:Npn |
| 839 |
\@@_filter_uniq:nnw |
| 840 |
#1 % <compare predicate> |
| 841 |
#2 % <greatest> |
| 842 |
#3 % <tokenlist> |
| 843 |
\q_recursion_stop |
| 844 |
{ % |
| 845 |
\quark_if_recursion_tail_stop:n{#3} |
| 846 |
\@@_filter_uniq_aux:nnw{#1}{#2}#3\q_recursion_stop} |
| 847 |
\cs_new:Npn |
| 848 |
\@@_filter_uniq_aux:nw |
| 849 |
#1 % <compare predicate> |
| 850 |
#2 % <tokenlist head> |
| 851 |
#3 % <tokenlist rest> |
| 852 |
\q_recursion_stop |
| 853 |
{% |
| 854 |
{#2} |
| 855 |
\@@_filter_uniq:nnw |
| 856 |
{#1} % <compare predicate> |
| 857 |
{#2} #3 % <tokenlist> |
| 858 |
\q_recursion_stop } |
| 859 |
\cs_new:Npn |
| 860 |
\@@_filter_uniq_aux:nnw |
| 861 |
#1 % <compare predicate> |
| 862 |
#2 % <last> |
| 863 |
#3 % <head token> |
| 864 |
#4 % <rest token> |
| 865 |
\q_recursion_stop |
| 866 |
{ % |
| 867 |
\bool_if:nTF{\use:c{#1:nNn}{#3}<{#2}} |
| 868 |
{\msg_error:nnnn{@@}{tokenlist-incr}{#2}{#3}} |
| 869 |
{% |
| 870 |
\bool_if:nF |
| 871 |
{\use:c{#1:nNn}{#3}={#2}} |
| 872 |
% ^^A {{#3}} |
| 873 |
{\tl_if_single_token:nTF{#3}{#3}{{#3}}} |
| 874 |
} |
| 875 |
\quark_if_recursion_tail_stop:n{#4} |
| 876 |
% ^^A \@@_filter_uniq:nnw{#1}{#3}#4\q_recursion_stop } |
| 877 |
\@@_filter_uniq:nnw{#1}{#3}#4\q_recursion_stop } |
| 878 |
\cs_new:Npn |
| 879 |
\@@_filter_uniq:nw |
| 880 |
#1 % <compare predicate> |
| 881 |
#2 % <tokenlist> |
| 882 |
{% |
| 883 |
\quark_if_recursion_tail_stop_do:nn{#2}{\c_empty_tl} |
| 884 |
\@@_filter_uniq_aux:nw {#1}#2 \q_recursion_stop} |
| 885 |
\cs_new:Npn |
| 886 |
\erw_filter_uniq:nn |
| 887 |
#1 % <compare predicate> |
| 888 |
#2 % <tokenlist> |
| 889 |
{% |
| 890 |
\@@_filter_uniq_aux:nw |
| 891 |
{#1} % <compare predicate> |
| 892 |
#2 |
| 893 |
\q_recursion_tail % <head token> |
| 894 |
\q_recursion_stop} |
| 895 |
\cs_new:Npn |
| 896 |
\erw_filter_uniq:n |
| 897 |
#1 % <ascending integers> |
| 898 |
{ \erw_filter_uniq:nn{int_compare_p}{#1} } |
| 899 |
\cs_generate_variant:Nn\erw_filter_uniq:nn{ne} |
| 900 |
% \end{macrocode} |
| 901 |
% \section{\textsf{code}} |
| 902 |
% \begin{macrocode} |
| 903 |
\keys_define:nn{@@} |
| 904 |
{ clist_map_inline.code:n = \@@_map_inline_clist:nnn#1 } |
| 905 |
\cs_new_protected:Npn |
| 906 |
\@@_map_inline_clist:nnn |
| 907 |
#1 % <clist> |
| 908 |
#2 % <signature> |
| 909 |
#3 % <code> |
| 910 |
{ |
| 911 |
\cs_new_protected:cn |
| 912 |
{@@_do:#2}{#3} |
| 913 |
\clist_map_inline:nn |
| 914 |
{#1} |
| 915 |
{\use:c{@@_do:#2}##1} |
| 916 |
} |
| 917 |
\cs_new:Npn |
| 918 |
\erw_parameter:n |
| 919 |
#1 %^^A <arity> |
| 920 |
{## #1} |
| 921 |
\cs_new:Npn |
| 922 |
\@@_parameter_aux:nn |
| 923 |
#1 % <finish> |
| 924 |
#2 % <start> |
| 925 |
{ \int_step_function:nnN {#2}{#1}\erw_parameter:n} |
| 926 |
\cs_new:Npn |
| 927 |
\erw_parameter:nn |
| 928 |
#1 % <start> |
| 929 |
#2 % <count> |
| 930 |
{% |
| 931 |
\exp_args:Ne |
| 932 |
\@@_parameter_aux:nn |
| 933 |
{\int_eval:n{#1+#2-1}}{#1}} |
| 934 |
\cs_new:Npn |
| 935 |
\erw_argument:nn |
| 936 |
#1 % <position> |
| 937 |
#2 % <signature> |
| 938 |
{\@@_argument:nw{#1}#2\q_recursion_tail\q_recursion_stop} |
| 939 |
\cs_new:Npn |
| 940 |
\@@_argument_unit:nn |
| 941 |
#1 % <position> |
| 942 |
#2 % <n|N> |
| 943 |
{\use:c{@@_argument_#2:w} #1 \q_recursion_stop} |
| 944 |
\cs_new:Npn\@@_argument_n:w #1 \q_recursion_stop{{## #1}} |
| 945 |
\cs_new:Npn\@@_argument_N:w #1 \q_recursion_stop{## #1} |
| 946 |
\cs_new:Npn |
| 947 |
\@@_argument:nw |
| 948 |
#1 % <position> |
| 949 |
#2 % <signature list> |
| 950 |
\q_recursion_stop |
| 951 |
{ \quark_if_recursion_tail_stop:n{#2} |
| 952 |
\@@_argument:nnw{#1}#2\q_recursion_stop } |
| 953 |
\cs_new:Npn |
| 954 |
\@@_argument:nnw |
| 955 |
#1 % <position> |
| 956 |
#2 % <n|N> |
| 957 |
#3 % <signature rest> |
| 958 |
\q_recursion_stop |
| 959 |
{% |
| 960 |
\@@_argument_unit:nn{#1}{#2} |
| 961 |
\exp_args:Ne |
| 962 |
\@@_argument:nw |
| 963 |
{\erw_int_incr:n{#1}}#3\q_recursion_stop } |
| 964 |
% \end{macrocode} |
| 965 |
% ^^A --- |
| 966 |
% \begin{macrocode} |
| 967 |
\ProcessKeysOptions{@@} |
| 968 |
\ExplSyntaxOff |
| 969 |
%</package> |
| 970 |
% \end{macrocode} |
| 971 |
% \end{implementation} |
| 972 |
% \Finale |
| 973 |
\endinput |