diff options
author | Karl Berry <karl@freefriends.org> | 2017-12-06 23:56:06 +0000 |
---|---|---|
committer | Karl Berry <karl@freefriends.org> | 2017-12-06 23:56:06 +0000 |
commit | cc862e582aa0dd7c0dee16bb5475394338a07641 (patch) | |
tree | b03dbc5b6657d47f5c61b8fcc26f04a564ad6afd /Master/texmf-dist/source/latex/l3kernel/l3sort.dtx | |
parent | 7ffad570b11726b0ca150867d23878fc1a949865 (diff) |
l3 (7dec17)
git-svn-id: svn://tug.org/texlive/trunk@46003 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/source/latex/l3kernel/l3sort.dtx')
-rw-r--r-- | Master/texmf-dist/source/latex/l3kernel/l3sort.dtx | 48 |
1 files changed, 24 insertions, 24 deletions
diff --git a/Master/texmf-dist/source/latex/l3kernel/l3sort.dtx b/Master/texmf-dist/source/latex/l3kernel/l3sort.dtx index 592046c0619..fdbf90b082a 100644 --- a/Master/texmf-dist/source/latex/l3kernel/l3sort.dtx +++ b/Master/texmf-dist/source/latex/l3kernel/l3sort.dtx @@ -1,13 +1,13 @@ % \iffalse % -%% File l3sort.dtx (C) Copyright 2012,2014-2017 The LaTeX3 Project +%% File l3sort.dtx (C) Copyright 2012-2017 The LaTeX3 Project % % It may be distributed and/or modified under the conditions of the % LaTeX Project Public License (LPPL), either version 1.3c of this % license or (at your option) any later version. The latest version % of this license is in the file % -% http://www.latex-project.org/lppl.txt +% https://www.latex-project.org/lppl.txt % % This file is part of the "l3kernel bundle" (The Work in LPPL) % and all files in that bundle must be distributed together. @@ -21,7 +21,7 @@ % for those people who are interested. % %<*driver> -\documentclass[full]{l3doc} +\documentclass[full,kernel]{l3doc} \begin{document} \DocInput{\jobname.dtx} \end{document} @@ -41,7 +41,7 @@ % }^^A % } % -% \date{Released 2017/11/14} +% \date{Released 2017/12/05} % % \maketitle % @@ -173,8 +173,8 @@ % % \subsection{Finding available \tn{toks} registers} % -% \begin{macro}[int]{\@@_shrink_range:} -% \begin{macro}[aux]{\@@_shrink_range_loop:} +% \begin{macro}{\@@_shrink_range:} +% \begin{macro}{\@@_shrink_range_loop:} % After \cs{@@_compute_range:} (defined below) determines that % \tn{toks} registers between \cs{l_@@_min_int} (included) and % \cs{l_@@_true_max_int} (excluded) have not yet been assigned, @@ -218,7 +218,7 @@ % \end{macro} % \end{macro} % -% \begin{macro}[int]{\@@_compute_range:, \@@_redefine_compute_range:} +% \begin{macro}{\@@_compute_range:, \@@_redefine_compute_range:} % \begin{variable}{\c_@@_max_length_int} % First find out what \tn{toks} have not yet been assigned. There are % many cases. In \LaTeXe{} with no package, available \tn{toks} range @@ -303,7 +303,7 @@ % % \subsection{Protected user commands} % -% \begin{macro}[int]{\@@_main:NNNnNn} +% \begin{macro}{\@@_main:NNNnNn} % Sorting happens in three steps. First store items in \tn{toks} % registers ranging from \cs{l_@@_min_int} to $\cs{l_@@_top_int}-1$, % while checking that the list is not too @@ -398,7 +398,7 @@ % % \begin{macro} % {\clist_sort:Nn, \clist_sort:cn, \clist_gsort:Nn, \clist_gsort:cn} -% \begin{macro}[aux]{\@@_clist:NNn} +% \begin{macro}{\@@_clist:NNn} % The case of empty comma-lists is a little bit special as usual, % and filtered out: there is nothing to sort in that case. % Otherwise, the input is done with \cs{clist_map_inline:Nn}, @@ -464,7 +464,7 @@ % % \subsection{Merge sort} % -% \begin{macro}[int]{\@@_level:} +% \begin{macro}{\@@_level:} % This function is called once blocks of size \cs{l_@@_block_int} % (initially $1$) are each sorted. If the whole list fits in one % block, then we are done (this also takes care of the case of an @@ -483,7 +483,7 @@ % \end{macrocode} % \end{macro} % -% \begin{macro}[int]{\@@_merge_blocks:} +% \begin{macro}{\@@_merge_blocks:} % This function is called to merge a pair of blocks, starting at % the last value of \cs{l_@@_end_int} (end-point of the previous % pair of blocks). If shifting by one block to the right we reach @@ -524,7 +524,7 @@ % \end{macrocode} % \end{macro} % -% \begin{macro}[int]{\@@_copy_block:} +% \begin{macro}{\@@_copy_block:} % We wish to store a copy of the \enquote{upper} block of % \tn{toks} registers, ranging between the initial value of % \cs{l_@@_B_int} (included) and \cs{l_@@_end_int} @@ -544,7 +544,7 @@ % \end{macrocode} % \end{macro} % -% \begin{macro}[aux]{\@@_merge_blocks_aux:} +% \begin{macro}{\@@_merge_blocks_aux:} % At this stage, the first block starts at \cs{l_@@_begin_int}, % and ends at \cs{l_@@_A_int}, and the second block starts at % \cs{l_@@_top_int} and ends at \cs{l_@@_C_int}. The result @@ -572,8 +572,8 @@ % \end{macro} % % \begin{macro}{\sort_return_same:, \sort_return_swapped:} -% \begin{macro}[aux]{\@@_return_mark:N} -% \begin{macro}[aux]{\@@_return_none_error:, \@@_return_two_error:w} +% \begin{macro}{\@@_return_mark:N} +% \begin{macro}{\@@_return_none_error:, \@@_return_two_error:w} % The marker removes one token. Each comparison should call % \cs{sort_return_same:} or \cs{sort_return_swapped:} exactly % once. If neither is called, \cs{@@_return_none_error:} is called. @@ -598,7 +598,7 @@ % \end{macro} % \end{macro} % -% \begin{macro}[aux]{\@@_return_same:} +% \begin{macro}{\@@_return_same:} % If the comparison function returns \texttt{same}, % then the second argument fed to \cs{@@_compare:nn} % should remain to the right of the other one. Since @@ -623,7 +623,7 @@ % \end{macrocode} % \end{macro} % -% \begin{macro}[aux]{\@@_return_swapped:} +% \begin{macro}{\@@_return_swapped:} % If the comparison function returns \texttt{swapped}, % then the next item to add to the merger is the first % argument, contents of the \tn{toks} register $A$. @@ -647,7 +647,7 @@ % \end{macrocode} % \end{macro} % -% \begin{macro}[aux]{\@@_merge_blocks_end:} +% \begin{macro}{\@@_merge_blocks_end:} % This function's task is to copy the \tn{toks} registers % in the block indexed by $C$ to the merger indexed by $B$. % The end can equally be detected by checking when $B$ reaches @@ -813,7 +813,7 @@ % typical \TeX{}'s memory. % % \begin{macro}[EXP]{\tl_sort:nN} -% \begin{macro}[aux, EXP] +% \begin{macro}[EXP] % { % \@@_quick_prepare:Nnnn, % \@@_quick_prepare_end:NNNnw, @@ -864,7 +864,7 @@ % \end{macro} % \end{macro} % -% \begin{macro}[EXP, aux] +% \begin{macro}[EXP] % { % \@@_quick_split:NnNn, % \@@_quick_only_i:NnnnnNn, @@ -926,7 +926,7 @@ % \end{macrocode} % \end{macro} % -% \begin{macro}[EXP, aux] +% \begin{macro}[EXP] % { % \@@_quick_end:nnTFNn, % \@@_quick_single_end:nnnwnw, @@ -986,7 +986,7 @@ % % \subsection{Messages} % -% \begin{macro}[aux]{\@@_error:} +% \begin{macro}{\@@_error:} % Bailing out of the sorting code is a bit tricky. It may not be safe % to use a delimited argument, so instead we redefine many % \pkg{l3sort} commands to be trivial, with \cs{@@_level:} getting rid @@ -1001,7 +1001,7 @@ % \end{macrocode} % \end{macro} % -% \begin{macro}[aux]{\@@_disable_toksdef:, \@@_disabled_toksdef:n} +% \begin{macro}{\@@_disable_toksdef:, \@@_disabled_toksdef:n} % While sorting, \tn{toksdef} is locally disabled to prevent users % from using \tn{newtoks} or similar commands in their comparison % code: the \tn{toks} registers that would be assigned are in use by @@ -1029,7 +1029,7 @@ % \end{macrocode} % \end{macro} % -% \begin{macro}[aux]{\@@_too_long_error:NNw} +% \begin{macro}{\@@_too_long_error:NNw} % When there are too many items in a sequence, this is an error, and % we clean up properly the mapping over items in the list: break using % the type-specific breaking function |#1|. |