summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/source/latex/l3kernel/l3prg.dtx
diff options
context:
space:
mode:
Diffstat (limited to 'Master/texmf-dist/source/latex/l3kernel/l3prg.dtx')
-rw-r--r--Master/texmf-dist/source/latex/l3kernel/l3prg.dtx54
1 files changed, 5 insertions, 49 deletions
diff --git a/Master/texmf-dist/source/latex/l3kernel/l3prg.dtx b/Master/texmf-dist/source/latex/l3kernel/l3prg.dtx
index 8134b827bda..194181b4c87 100644
--- a/Master/texmf-dist/source/latex/l3kernel/l3prg.dtx
+++ b/Master/texmf-dist/source/latex/l3kernel/l3prg.dtx
@@ -35,7 +35,7 @@
%
%<*driver|package>
\RequirePackage{l3names}
-\GetIdInfo$Id: l3prg.dtx 3317 2012-02-06 12:26:40Z bruno $
+\GetIdInfo$Id: l3prg.dtx 3338 2012-02-08 08:21:42Z joseph $
{L3 Experimental control structures}
%</driver|package>
%<*driver>
@@ -724,47 +724,6 @@
% \meta{ending code} for the loop.
% \end{function}
%
-% \section{Experimental programmings functions}
-%
-% \begin{function}{\prg_quicksort:n}
-% \begin{syntax}
-% \cs{prg_quicksort:n} |{| \Arg{item~1} \Arg{item~2} \dots \Arg{item~n} |}|
-% \end{syntax}
-% Performs a quicksort on the token list. The comparisons are
-% performed by the function \cs{prg_quicksort_compare:nnTF} which is up
-% to the programmer to define. When the sorting process is over, all
-% items are given as argument to the function
-% \cs{prg_quicksort_function:n} which the programmer also controls.
-% \end{function}
-%
-% \begin{function}{
-% \prg_quicksort_function:n ,
-% \prg_quicksort_compare:nnTF
-% }
-% \begin{syntax}
-% "\prg_quicksort_function:n" \Arg{element} \\
-% "\prg_quicksort_compare:nnTF" \Arg{element 1} \Arg{element 2}\\
-% \end{syntax}
-% The two functions the programmer must define before calling
-% |\prg_quicksort:n|. As an example we could define
-% \begin{quote}
-% |\cs_set_nopar:Npn\prg_quicksort_function:n #1{{#1}}|\\
-% |\cs_set_nopar:Npn\prg_quicksort_compare:nnTF #1#2 {\int_compare:nNnTF{#1}>{#2}}|
-% \end{quote}
-% Then the function call
-% \begin{quote}
-% |\prg_quicksort:n {876234520}|
-% \end{quote}
-% would return |{0}{2}{2}{3}{4}{5}{6}{7}{8}|. An alternative example
-% where one sorts a list of words, |\prg_quicksort_compare:nnTF| could
-% be defined as
-% \begin{quote}
-% |\cs_set_nopar:Npn\prg_quicksort_compare:nnTF #1#2 {|\\
-% | \int_compare:nNnTF{\tl_compare:nn{#1}{#2}}>\c_zero }|
-% \end{quote}
-%
-% \end{function}
-%
% \end{documentation}
%
% \begin{implementation}
@@ -1885,8 +1844,10 @@
% \end{macro}
% \end{macro}
%
-% \subsection{Experimental programmings functions}
-%
+% \subsection{Deprecated functions}
+%
+% These were deprecated on 2012-02-08, and will be removed entirely by
+% 2012-05-31.
%
% \begin{macro}[aux]{\prg_define_quicksort:nnn}
% |#1| is the name, |#2| and |#3| are the tokens enclosing the
@@ -2004,7 +1965,6 @@
% \end{macro}
%
% \begin{macro}{\prg_quicksort:n}
-% \UnitTested
% A simple version. Sorts a list of tokens, uses the function
% |\prg_quicksort_compare:nnTF| to compare items, and places the
% function |\prg_quicksort_function:n| in front of each of them.
@@ -2014,9 +1974,7 @@
% \end{macro}
%
% \begin{macro}{\prg_quicksort_function:n}
-% \UnitTested
% \begin{macro}{\prg_quicksort_compare:nnTF}
-% \UnitTested
% \begin{macrocode}
\cs_set:Npn \prg_quicksort_function:n {\ERROR}
\cs_set:Npn \prg_quicksort_compare:nnTF {\ERROR}
@@ -2024,8 +1982,6 @@
% \end{macro}
% \end{macro}
%
-% \subsection{Deprecated functions}
-%
% These were deprecated on 2011-05-27 and will be removed entirely by
% 2011-08-31.
%