diff options
Diffstat (limited to 'macros/latex-dev/required/l3kernel/l3regex.dtx')
-rw-r--r-- | macros/latex-dev/required/l3kernel/l3regex.dtx | 46 |
1 files changed, 23 insertions, 23 deletions
diff --git a/macros/latex-dev/required/l3kernel/l3regex.dtx b/macros/latex-dev/required/l3kernel/l3regex.dtx index ce85b56262..ad44b8c6f9 100644 --- a/macros/latex-dev/required/l3kernel/l3regex.dtx +++ b/macros/latex-dev/required/l3kernel/l3regex.dtx @@ -43,7 +43,7 @@ % }^^A % } % -% \date{Released 2024-04-11} +% \date{Released 2024-05-08} % % \maketitle % @@ -2047,9 +2047,9 @@ % phase. Compiled regular expressions consist of the following: % \begin{itemize} % \item \cs{@@_class:NnnnN} \meta{boolean} \Arg{tests} \Arg{min} -% \Arg{more} \meta{lazyness} +% \Arg{more} \meta{laziness} % \item \cs{@@_group:nnnN} \Arg{branches} \Arg{min} \Arg{more} -% \meta{lazyness}, also \cs{@@_group_no_capture:nnnN} and +% \meta{laziness}, also \cs{@@_group_no_capture:nnnN} and % \cs{@@_group_resetting:nnnN} with the same syntax. % \item \cs{@@_branch:n} \Arg{contents} % \item \cs{@@_command_K:} @@ -2638,7 +2638,7 @@ % \end{macro} % \end{macro} % -% \begin{macro}{\@@_compile_quantifier_lazyness:nnNN} +% \begin{macro}{\@@_compile_quantifier_laziness:nnNN} % Once the \enquote{main} quantifier (\texttt{?}, \texttt{*}, % \texttt{+} or a braced construction) is found, we check whether it % is lazy (followed by a question mark). We then add to the compiled @@ -2646,7 +2646,7 @@ % the start-point of the range, its end-point, and a boolean, % \texttt{true} for lazy and \texttt{false} for greedy operators. % \begin{macrocode} -\cs_new_protected:Npn \@@_compile_quantifier_lazyness:nnNN #1#2#3#4 +\cs_new_protected:Npn \@@_compile_quantifier_laziness:nnNN #1#2#3#4 { \@@_two_if_eq:NNNNTF #3 #4 \@@_compile_special:N ? { @@ -2669,15 +2669,15 @@ % \@@_compile_quantifier_+:w % } % For each \enquote{basic} quantifier, |?|, |*|, |+|, feed the correct -% arguments to \cs{@@_compile_quantifier_lazyness:nnNN}, $-1$ means +% arguments to \cs{@@_compile_quantifier_laziness:nnNN}, $-1$ means % that there is no upper bound on the number of repetitions. % \begin{macrocode} \cs_new_protected:cpn { @@_compile_quantifier_?:w } - { \@@_compile_quantifier_lazyness:nnNN { 0 } { 1 } } + { \@@_compile_quantifier_laziness:nnNN { 0 } { 1 } } \cs_new_protected:cpn { @@_compile_quantifier_*:w } - { \@@_compile_quantifier_lazyness:nnNN { 0 } { -1 } } + { \@@_compile_quantifier_laziness:nnNN { 0 } { -1 } } \cs_new_protected:cpn { @@_compile_quantifier_+:w } - { \@@_compile_quantifier_lazyness:nnNN { 1 } { -1 } } + { \@@_compile_quantifier_laziness:nnNN { 1 } { -1 } } % \end{macrocode} % \end{macro} % @@ -2711,7 +2711,7 @@ { { \@@_compile_special:N \c_right_brace_str } { - \exp_args:No \@@_compile_quantifier_lazyness:nnNN + \exp_args:No \@@_compile_quantifier_laziness:nnNN { \int_use:N \l_@@_internal_a_int } 0 } { \@@_compile_special:N , } @@ -2731,7 +2731,7 @@ { \@@_two_if_eq:NNNNTF #1 #2 \@@_compile_special:N \c_right_brace_str { - \exp_args:No \@@_compile_quantifier_lazyness:nnNN + \exp_args:No \@@_compile_quantifier_laziness:nnNN { \int_use:N \l_@@_internal_a_int } { -1 } } { @@ -2753,7 +2753,7 @@ \else: \int_sub:Nn \l_@@_internal_b_int \l_@@_internal_a_int \fi: - \exp_args:Noo \@@_compile_quantifier_lazyness:nnNN + \exp_args:Noo \@@_compile_quantifier_laziness:nnNN { \int_use:N \l_@@_internal_a_int } { \int_use:N \l_@@_internal_b_int } } @@ -4517,13 +4517,13 @@ % \end{macrocode} % \end{macro} % -% \begin{macro}{\@@_build_transitions_lazyness:NNNNN} +% \begin{macro}{\@@_build_transitions_laziness:NNNNN} % This function creates a new state, and puts two transitions starting % from the old current state. The order of the transitions is % controlled by |#1|, true for lazy quantifiers, and false for greedy % quantifiers. % \begin{macrocode} -\cs_new_protected:Npn \@@_build_transitions_lazyness:NNNNN #1#2#3#4#5 +\cs_new_protected:Npn \@@_build_transitions_laziness:NNNNN #1#2#3#4#5 { \@@_build_new_state: \@@_toks_put_right:Ne \l_@@_left_state_int @@ -4545,7 +4545,7 @@ % \begin{macro}{\@@_class:NnnnN} % \begin{macro}[rEXP]{\@@_tests_action_cost:n} % The arguments are: \meta{boolean} \Arg{tests} \Arg{min} \Arg{more} -% \meta{lazyness}. First store the tests with a trailing +% \meta{laziness}. First store the tests with a trailing % \cs{@@_action_cost:n}, in the true branch of % \cs{@@_break_point:TF} for positive classes, or the false branch % for negative classes. The integer \meta{more} is $0$ for fixed @@ -4599,18 +4599,18 @@ % \cs{@@_class_repeat:n} for the code to match |#1| repetitions, % and add free transitions from the last state to the previous one, % and to a new one. In both cases, the order of transitions is -% controlled by the lazyness boolean |#2|. +% controlled by the laziness boolean |#2|. % \begin{macrocode} \cs_new_protected:Npn \@@_class_repeat:nN #1#2 { \if_int_compare:w #1 = \c_zero_int - \@@_build_transitions_lazyness:NNNNN #2 + \@@_build_transitions_laziness:NNNNN #2 \@@_action_free:n \l_@@_right_state_int \@@_tests_action_cost:n \l_@@_left_state_int \else: \@@_class_repeat:n {#1} \int_set_eq:NN \l_@@_internal_a_int \l_@@_left_state_int - \@@_build_transitions_lazyness:NNNNN #2 + \@@_build_transitions_laziness:NNNNN #2 \@@_action_free:n \l_@@_right_state_int \@@_action_free:n \l_@@_internal_a_int \fi: @@ -4634,7 +4634,7 @@ { \l_@@_max_state_int + #2 - \c_one_int } \prg_replicate:nn { #2 } { - \@@_build_transitions_lazyness:NNNNN #3 + \@@_build_transitions_laziness:NNNNN #3 \@@_action_free:n \l_@@_internal_a_int \@@_tests_action_cost:n \l_@@_right_state_int } @@ -4646,7 +4646,7 @@ % % \begin{macro}{\@@_group_aux:nnnnN} % Arguments: \Arg{label} \Arg{contents} \Arg{min} \Arg{more} -% \meta{lazyness}. If \meta{min} is $0$, we need to add a state before +% \meta{laziness}. If \meta{min} is $0$, we need to add a state before % building the group, so that the thread which skips the group does % not also set the start-point of the submatch. After adding one more % state, the \texttt{left_state} is the left end of the group, from @@ -4656,7 +4656,7 @@ % build the \textsc{nfa} states for the contents |#2| of the group, % and we forget about the two integers. Once this is done, perform the % repetition: either exactly |#3| times, or |#3| or more times, or -% between |#3| and $|#3|+|#4|$ times, with lazyness |#5|. The +% between |#3| and $|#3|+|#4|$ times, with laziness |#5|. The % \meta{label} |#1| is used for submatch tracking. Each of the three % auxiliaries expects \texttt{left_state} and \texttt{right_state} to % be set properly. @@ -4884,7 +4884,7 @@ % % \begin{macro}{\@@_group_repeat:nnnN} % We wish to repeat the group between |#2| and $|#2|+|#3|$ times, with -% a lazyness controlled by |#4|. We insert submatch tracking up front: +% a laziness controlled by |#4|. We insert submatch tracking up front: % in principle, we could avoid recording submatches for the first |#2| % copies of the group, but that forces us to treat specially the case % $|#2|=0$. Repeat that group with submatch tracking $|#2|+|#3|$ times @@ -8076,7 +8076,7 @@ % This is not technically a message, but seems related enough to go % there. The arguments are: |#1| is the minimum number of repetitions; % |#2| is the number of allowed extra repetitions ($-1$ for infinite -% number), and |#3| tells us about lazyness. +% number), and |#3| tells us about laziness. % \begin{macrocode} \cs_new:Npn \@@_msg_repeated:nnN #1#2#3 { |