1 files changed, 23 insertions, 23 deletions
diff --git a/Master/texmf-dist/source/latex/l3kernel/l3fp-logic.dtx b/Master/texmf-dist/source/latex/l3kernel/l3fp-logic.dtx
index 5938ae067db..6008c321da8 100644
--- a/Master/texmf-dist/source/latex/l3kernel/l3fp-logic.dtx
+++ b/Master/texmf-dist/source/latex/l3kernel/l3fp-logic.dtx
@@ -1,13 +1,13 @@
 % \iffalse meta-comment
 %
-%% File: l3fp-logic.dtx Copyright (C) 2011-2014,2016,2017 The LaTeX3 Project
+%% File: l3fp-logic.dtx Copyright (C) 2011-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}
@@ -38,7 +38,7 @@
 %          {latex-team@latex-project.org}^^A
 %    }^^A
 % }
-% \date{Released 2017/11/14}
+% \date{Released 2017/12/05}
 %
 % \maketitle
 %
@@ -58,7 +58,7 @@
 %<@@=fp>
 %    \end{macrocode}
 %
-% \begin{macro}[aux, EXP]{\@@_parse_word_max:N  , \@@_parse_word_min:N}
+% \begin{macro}[EXP]{\@@_parse_word_max:N  , \@@_parse_word_min:N}
 %   Those functions may receive a variable number of arguments.
 %    \begin{macrocode}
 \cs_new:Npn \@@_parse_word_max:N
@@ -94,7 +94,7 @@
 % \subsection{Comparison}
 %
 % \begin{macro}[pTF, EXP]{\fp_compare:n}
-% \begin{macro}[aux, EXP]{\@@_compare_return:w}
+% \begin{macro}[EXP]{\@@_compare_return:w}
 %   Within floating point expressions, comparison operators are treated
 %   as operations, so we evaluate |#1|, then compare with $0$.
 %    \begin{macrocode}
@@ -116,7 +116,7 @@
 % \end{macro}
 %
 % \begin{macro}[pTF, EXP]{\fp_compare:nNn}
-% \begin{macro}[aux, EXP]{\@@_compare_aux:wn}
+% \begin{macro}[EXP]{\@@_compare_aux:wn}
 %   Evaluate |#1| and |#3|, using an auxiliary to expand both, and feed
 %   the two floating point numbers swapped to \cs{@@_compare_back:ww},
 %   defined below.  Compare the result with |`#2-`=|, which is $-1$ for
@@ -142,7 +142,7 @@
 % \end{macro}
 % \end{macro}
 %
-% \begin{macro}[aux, EXP]{\@@_compare_back:ww, \@@_compare_nan:w}
+% \begin{macro}[EXP]{\@@_compare_back:ww, \@@_compare_nan:w}
 %   \begin{quote}
 %     \cs{@@_compare_back:ww} \meta{y} |;| \meta{x} |;|
 %   \end{quote}
@@ -188,8 +188,8 @@
 %    \end{macrocode}
 % \end{macro}
 %
-% \begin{macro}[int, EXP]{\@@_compare_npos:nwnw}
-% \begin{macro}[aux, EXP]{\@@_compare_significand:nnnnnnnn}
+% \begin{macro}[EXP]{\@@_compare_npos:nwnw}
+% \begin{macro}[EXP]{\@@_compare_significand:nnnnnnnn}
 %   \begin{quote}
 %     \cs{@@_compare_npos:nwnw}
 %       \Arg{expo_1} \meta{body_1} |;|
@@ -309,8 +309,8 @@
 % \end{macro}
 %
 % \begin{macro}[EXP]{\fp_step_function:nnnN, \fp_step_function:nnnc}
-% \begin{macro}[EXP, aux]{\@@_step:wwwN}
-% \begin{macro}[EXP, aux]{\@@_step:NnnnnN, \@@_step:NfnnnN}
+% \begin{macro}[EXP]{\@@_step:wwwN}
+% \begin{macro}[EXP]{\@@_step:NnnnnN, \@@_step:NfnnnN}
 %   The approach here is somewhat similar to
 %   \cs{int_step_function:nnnN}.  There are two subtleties: we use the
 %   internal parser \cs{@@_parse:n} to avoid converting back and forth
@@ -376,7 +376,7 @@
 % \end{macro}
 %
 % \begin{macro}{\fp_step_inline:nnnn, \fp_step_variable:nnnNn}
-% \begin{macro}[aux]{\@@_step:NNnnnn}
+% \begin{macro}{\@@_step:NNnnnn}
 %   As for \cs{int_step_inline:nnnn}, create a global function and apply it,
 %   following up with a break point.
 %    \begin{macrocode}
@@ -418,7 +418,7 @@
 %
 % \subsection{Extrema}
 %
-% \begin{macro}[int, EXP]{\@@_minmax_o:Nw}
+% \begin{macro}[EXP]{\@@_minmax_o:Nw}
 %   The argument~|#1| is $2$~to find the maximum of an array~|#2| of
 %   floating point numbers, and $0$~to find the minimum.  We read
 %   numbers sequentially, keeping track of the largest (smallest) number
@@ -444,7 +444,7 @@
 %    \end{macrocode}
 % \end{macro}
 %
-% \begin{macro}[aux, EXP]{\@@_minmax_loop:Nww}
+% \begin{macro}[EXP]{\@@_minmax_loop:Nww}
 %   The first argument is $-$ or $+$ to denote the case where the
 %   currently largest (smallest) number found (first floating point
 %   argument) should be replaced by the new number (second floating
@@ -482,7 +482,7 @@
 %    \end{macrocode}
 % \end{macro}
 %
-% \begin{macro}[aux, EXP]{\@@_minmax_auxi:ww, \@@_minmax_auxii:ww}
+% \begin{macro}[EXP]{\@@_minmax_auxi:ww, \@@_minmax_auxii:ww}
 %   Keep the first/second number, and remove the other.
 %    \begin{macrocode}
 \cs_new:Npn \@@_minmax_auxi:ww  #1 \fi: \fi: #2 \s_@@ #3 ; \s_@@ #4;
@@ -492,7 +492,7 @@
 %    \end{macrocode}
 % \end{macro}
 %
-% \begin{macro}[aux, EXP]{\@@_minmax_break_o:w}
+% \begin{macro}[EXP]{\@@_minmax_break_o:w}
 %   This function is called from within an \cs{if_meaning:w} test.  Skip
 %   to the end of the tests, close the current test with \cs{fi:}, clean
 %   up, and return the appropriate number with one post-expansion.
@@ -504,7 +504,7 @@
 %
 % \subsection{Boolean operations}
 %
-% \begin{macro}[int, EXP]{\@@_not_o:w}
+% \begin{macro}[EXP]{\@@_not_o:w}
 %   Return \texttt{true} or \texttt{false}, with two expansions, one to
 %   exit the conditional, and one to please \pkg{l3fp-parse}.  The first
 %   argument is provided by \pkg{l3fp-parse} and is ignored.
@@ -520,9 +520,9 @@
 %    \end{macrocode}
 % \end{macro}
 %
-% \begin{macro}[int, EXP]+\@@_&_o:ww+
-% \begin{macro}[int, EXP]+\@@_|_o:ww+
-% \begin{macro}[aux, EXP]{\@@_and_return:wNw}
+% \begin{macro}[EXP]+\@@_&_o:ww+
+% \begin{macro}[EXP]+\@@_|_o:ww+
+% \begin{macro}[EXP]{\@@_and_return:wNw}
 %   For \texttt{and}, if the first number is zero, return it (with the
 %   same sign).  Otherwise, return the second one.  For \texttt{or}, the
 %   logic is reversed: if the first number is non-zero, return it,
@@ -551,9 +551,9 @@
 % \subsection{Ternary operator}
 %
 %^^A todo: understand and optimize.
-% \begin{macro}[int, EXP]
+% \begin{macro}[EXP]
 %   {\@@_ternary:NwwN, \@@_ternary_auxi:NwwN, \@@_ternary_auxii:NwwN}
-% \begin{macro}[aux, EXP]
+% \begin{macro}[EXP]
 %   {
 %     \@@_ternary_loop_break:w, \@@_ternary_loop:Nw,
 %     \@@_ternary_map_break:, \@@_ternary_break_point:n