From 52b787d36c60fda90673669dd2809c95c1fdfca5 Mon Sep 17 00:00:00 2001
From: Karl Berry <karl@freefriends.org>
Date: Wed, 19 Oct 2016 20:38:20 +0000
Subject: l3 (19oct16)

git-svn-id: svn://tug.org/texlive/trunk@42306 c570f23f-e606-0410-a88d-b1316a301751
---
 Master/texmf-dist/source/latex/l3kernel/l3seq.dtx | 49 ++++++++++++-----------
 1 file changed, 25 insertions(+), 24 deletions(-)

(limited to 'Master/texmf-dist/source/latex/l3kernel/l3seq.dtx')

diff --git a/Master/texmf-dist/source/latex/l3kernel/l3seq.dtx b/Master/texmf-dist/source/latex/l3kernel/l3seq.dtx
index cce3edcd256..942b6fcdb35 100644
--- a/Master/texmf-dist/source/latex/l3kernel/l3seq.dtx
+++ b/Master/texmf-dist/source/latex/l3kernel/l3seq.dtx
@@ -1,6 +1,6 @@
 % \iffalse meta-comment
 %
-%% File: l3seq.dtx Copyright (C) 1990-2015 The LaTeX3 Project
+%% File: l3seq.dtx Copyright (C) 1990-2016 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
@@ -37,7 +37,7 @@
 \documentclass[full]{l3doc}
 %</driver>
 %<*driver|package>
-\GetIdInfo$Id: l3seq.dtx 5777 2015-08-05 02:32:21Z bruno $
+\GetIdInfo$Id: l3seq.dtx 6685 2016-08-19 16:26:52Z bruno $
   {L3 Sequences and stacks}
 %</driver|package>
 %<*driver>
@@ -100,7 +100,8 @@
 %     \cs{seq_clear_new:N} \meta{sequence}
 %   \end{syntax}
 %   Ensures that the \meta{sequence} exists globally by applying
-%   \cs{seq_new:N} if necessary, then applies \cs{seq_(g)clear:N} to leave
+%   \cs{seq_new:N} if necessary, then applies
+%   \cs[index=seq_clear:N]{seq_(g)clear:N} to leave
 %   the \meta{sequence} empty.
 % \end{function}
 %
@@ -422,7 +423,7 @@
 %   \end{syntax}
 %   Removes duplicate items from the \meta{sequence}, leaving the
 %   left most copy of each item in the \meta{sequence}.  The \meta{item}
-%   comparison takes place on a token basis, as for \cs{tl_if_eq:nn(TF)}.
+%   comparison takes place on a token basis, as for \cs{tl_if_eq:nnTF}.
 %   \begin{texnote}
 %     This function iterates through every item in the \meta{sequence} and
 %     does a comparison with the \meta{items} already checked. It is therefore
@@ -440,12 +441,12 @@
 %   \end{syntax}
 %   Removes every occurrence of \meta{item} from the \meta{sequence}.
 %   The \meta{item} comparison takes place on a token basis, as for
-%   \cs{tl_if_eq:nn(TF)}.
+%   \cs{tl_if_eq:nnTF}.
 % \end{function}
 %
 %
-% \begin{function}[added = 2014-07-18]^^A
-%   {^^A
+% \begin{function}[added = 2014-07-18]
+%   {
 %     \seq_reverse:N,  \seq_reverse:c,
 %     \seq_greverse:N, \seq_greverse:c
 %   }
@@ -524,7 +525,7 @@
 %   \begin{syntax}
 %     \cs{seq_map_break:}
 %   \end{syntax}
-%   Used to terminate a \cs{seq_map_\ldots} function before all
+%   Used to terminate a \cs[no-index]{seq_map_\ldots} function before all
 %   entries in the \meta{sequence} have been processed. This will
 %   normally take place within a conditional statement, for example
 %   \begin{verbatim}
@@ -537,7 +538,7 @@
 %           }
 %       }
 %   \end{verbatim}
-%   Use outside of a \cs{seq_map_\ldots} scenario will lead to low
+%   Use outside of a \cs[no-index]{seq_map_\ldots} scenario will lead to low
 %   level \TeX{} errors.
 %   \begin{texnote}
 %     When the mapping is broken, additional tokens may be inserted by the
@@ -551,7 +552,7 @@
 %   \begin{syntax}
 %     \cs{seq_map_break:n} \Arg{tokens}
 %   \end{syntax}
-%   Used to terminate a \cs{seq_map_\ldots} function before all
+%   Used to terminate a \cs[no-index]{seq_map_\ldots} function before all
 %   entries in the \meta{sequence} have been processed, inserting
 %   the \meta{tokens} after the mapping has ended. This will
 %   normally take place within a conditional statement, for example
@@ -565,7 +566,7 @@
 %           }
 %       }
 %   \end{verbatim}
-%   Use outside of a \cs{seq_map_\ldots} scenario will lead to low
+%   Use outside of a \cs[no-index]{seq_map_\ldots} scenario will lead to low
 %   level \TeX{} errors.
 %   \begin{texnote}
 %     When the mapping is broken, additional tokens may be inserted by the
@@ -755,7 +756,7 @@
 %
 % Some operations on a set \meta{seq~var} are straightforward.  For
 % instance, \cs{seq_count:N} \meta{seq~var} expands to the number of
-% items, while \cs{seq_if_in:Nn(TF)} \meta{seq~var} \Arg{item} tests if
+% items, while \cs{seq_if_in:NnTF} \meta{seq~var} \Arg{item} tests if
 % the \meta{item} is in the set.
 %
 % Adding an \meta{item} to a set \meta{seq~var} can be done by appending
@@ -1102,9 +1103,9 @@
 %   lost braces. The second step is solely there to strip
 %   braces which are outermost after space trimming.
 %    \begin{macrocode}
-\cs_new_protected_nopar:Npn \seq_set_split:Nnn
+\cs_new_protected:Npn \seq_set_split:Nnn
   { \@@_set_split:NNnn \tl_set:Nx }
-\cs_new_protected_nopar:Npn \seq_gset_split:Nnn
+\cs_new_protected:Npn \seq_gset_split:Nnn
   { \@@_set_split:NNnn \tl_gset:Nx }
 \cs_new_protected:Npn \@@_set_split:NNnn #1#2#3#4
   {
@@ -1380,9 +1381,9 @@
 %   of \cs{exp_not:n}. The previous calls are cleanly removed
 %   from the stack, and the memory consumption becomes linear.
 %    \begin{macrocode}
-\cs_new_protected_nopar:Npn \seq_reverse:N
+\cs_new_protected:Npn \seq_reverse:N
   { \@@_reverse:NN \tl_set:Nx }
-\cs_new_protected_nopar:Npn \seq_greverse:N
+\cs_new_protected:Npn \seq_greverse:N
   { \@@_reverse:NN \tl_gset:Nx }
 \cs_new_protected:Npn \@@_reverse:NN #1 #2
   {
@@ -1457,7 +1458,7 @@
     \prg_return_false:
     \__prg_break_point:
   }
-\cs_new_nopar:Npn \@@_if_in:
+\cs_new:Npn \@@_if_in:
   { \__prg_break:n { \group_end: \prg_return_true: } }
 \cs_generate_variant:Nn \seq_if_in:NnT  {     NV , Nv , No , Nx }
 \cs_generate_variant:Nn \seq_if_in:NnT  { c , cV , cv , co , cx }
@@ -1529,9 +1530,9 @@
 %   to be redefined. This makes it more sensible to use an auxiliary
 %   function for the local and global cases.
 %    \begin{macrocode}
-\cs_new_protected_nopar:Npn \seq_pop_left:NN
+\cs_new_protected:Npn \seq_pop_left:NN
   { \@@_pop:NNNN \@@_pop_left:NNN \tl_set:Nn }
-\cs_new_protected_nopar:Npn \seq_gpop_left:NN
+\cs_new_protected:Npn \seq_gpop_left:NN
   { \@@_pop:NNNN \@@_pop_left:NNN \tl_gset:Nn }
 \cs_new_protected:Npn \@@_pop_left:NNN #1#2#3
   { \exp_after:wN \@@_pop_left:wnwNNN #2 \q_stop #1#2#3 }
@@ -1599,9 +1600,9 @@
 %   is performed, with an empty argument and \cs{use_none:nn}, which
 %   finally stops the loop.
 %    \begin{macrocode}
-\cs_new_protected_nopar:Npn \seq_pop_right:NN
+\cs_new_protected:Npn \seq_pop_right:NN
   { \@@_pop:NNNN \@@_pop_right:NNN \tl_set:Nx }
-\cs_new_protected_nopar:Npn \seq_gpop_right:NN
+\cs_new_protected:Npn \seq_gpop_right:NN
   { \@@_pop:NNNN \@@_pop_right:NNN \tl_gset:Nx }
 \cs_new_protected:Npn \@@_pop_right:NNN #1#2#3
   {
@@ -1728,9 +1729,9 @@
 %   used to find the end of the code. Any ending code is then inserted
 %   before the return value of \cs{seq_map_break:n} is inserted.
 %    \begin{macrocode}
-\cs_new_nopar:Npn \seq_map_break:
+\cs_new:Npn \seq_map_break:
   { \__prg_map_break:Nn \seq_map_break: { } }
-\cs_new_nopar:Npn \seq_map_break:n
+\cs_new:Npn \seq_map_break:n
   { \__prg_map_break:Nn \seq_map_break: }
 %    \end{macrocode}
 % \end{macro}
@@ -1789,7 +1790,7 @@
     \cs_gset_eq:cN { __prg_map_ \int_use:N \g__prg_map_int :w }
       \@@_item:n
   }
-\cs_new_protected_nopar:Npn \@@_pop_item_def:
+\cs_new_protected:Npn \@@_pop_item_def:
   {
     \cs_gset_eq:Nc \@@_item:n
       { __prg_map_ \int_use:N \g__prg_map_int :w }
-- 
cgit v1.2.3

