summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/tex/generic/pgfplots/liststructure/pgfplotsarray.code.tex
diff options
context:
space:
mode:
Diffstat (limited to 'Master/texmf-dist/tex/generic/pgfplots/liststructure/pgfplotsarray.code.tex')
-rw-r--r--Master/texmf-dist/tex/generic/pgfplots/liststructure/pgfplotsarray.code.tex34
1 files changed, 17 insertions, 17 deletions
diff --git a/Master/texmf-dist/tex/generic/pgfplots/liststructure/pgfplotsarray.code.tex b/Master/texmf-dist/tex/generic/pgfplots/liststructure/pgfplotsarray.code.tex
index df9a26d6839..3bf006f31fd 100644
--- a/Master/texmf-dist/tex/generic/pgfplots/liststructure/pgfplotsarray.code.tex
+++ b/Master/texmf-dist/tex/generic/pgfplots/liststructure/pgfplotsarray.code.tex
@@ -31,12 +31,12 @@
% it under the terms of the GNU General Public License as published by
% the Free Software Foundation, either version 3 of the License, or
% (at your option) any later version.
-%
+%
% This program is distributed in the hope that it will be useful,
% but WITHOUT ANY WARRANTY; without even the implied warranty of
% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
% GNU General Public License for more details.
-%
+%
% You should have received a copy of the GNU General Public License
% along with this program. If not, see <http://www.gnu.org/licenses/>.
%
@@ -100,7 +100,7 @@
}
% #1 the array's name (a macro name
-% #2 a list created by \pgfplotslistnew
+% #2 a list created by \pgfplotslistnew
\def\pgfplotsarrayfrompgfplotslist#1#2{%
\pgfplotsarraynewempty#1%
\pgfplotslistforeachungrouped#2\as\pgfplotsarray@TMPa{%
@@ -398,21 +398,21 @@
}%
% Sorts array '#1' using N log N time.
-%
+%
% The sort key is provided as argument in
% /pgfplots/iflessthan/.code args={#1#2#3#4}, see docs in
% pgfplotsutil.code.tex.
%
% Remarks:
% - the sorting algorithm is a sub-optimal mergesort currently -
-% but it has runtime N log N.
+% but it has runtime N log N.
% - As usual, it is very difficult to move the final result out of the
-% current scope. The initial configuration allocates a *global* copy of #1
+% current scope. The initial configuration allocates a *global* copy of #1
% to carry results out of one TeX group. This means that memory will NEVER be freed.
% I don't see a general N log N alternative for doing so (short of discarding
% the scopes for local groups).
% BUT:
-% you can redefine the code key pair
+% you can redefine the code key pair
% |/pgfplots/array/unscope pre|
% and
% |/pgfplots/array/unscope post|
@@ -440,18 +440,18 @@
% \pgfplotsarraypushback677\to\testarray
% \pgfplotsarraypushback765\to\testarray
% \pgfplotsarraypushback703\to\testarray
-%
-% Unsorted:
-%
+%
+% Unsorted:
+%
% [\pgfplotsarrayforeach\testarray\as\elem{\elem\space}]
-%
+%
% \pgfplotsarraysort\testarray
-%
-% sorted:
-%
+%
+% sorted:
+%
% [\pgfplotsarrayforeach\testarray\as\elem{\elem\space}]
-%
-%--------------------------------------------------
+%
+%--------------------------------------------------
%
% @see \pgfplotsutilsortthree
% @see \pgfplotsutilsortfour
@@ -609,7 +609,7 @@
\pgfplotsarray@mergesort{#1}{#4}{#5}%
}
-
+
% A simple, ungrouped insert sort algorithm for small arrays.
%
% for i := 1; i < N; ++i do