%% %% This is file `l3sort.sty', %% generated with the docstrip utility. %% %% The original source files were: %% %% l3sort.dtx (with options: `package') %% %% EXPERIMENTAL CODE %% %% Do not distribute this file without also distributing the %% source files specified above. %% %% Do not distribute a modified version of this file. %% %% File l3sort.dtx (C) Copyright 2012,2014,2015 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 %% %% This file is part of the "l3experimental bundle" (The Work in LPPL) %% and all files in that bundle must be distributed together. %% %% The released version of this bundle is available from CTAN. %% %% ----------------------------------------------------------------------- %% %% The development version of the bundle can be found at %% %% http://www.latex-project.org/svnroot/experimental/trunk/ %% %% for those people who are interested. %% %%%%%%%%%%% %% NOTE: %% %%%%%%%%%%% %% %% Snapshots taken from the repository represent work in progress and may %% not work or may contain conflicting material! We therefore ask %% people _not_ to put them into distributions, archives, etc. without %% prior consultation with the LaTeX Project Team. %% %% ----------------------------------------------------------------------- %% \RequirePackage{expl3}[2015/09/27] \@ifpackagelater{expl3}{2015/09/27} {} {% \PackageError{l3sort}{Support package l3kernel too old} {% Please install an up to date version of l3kernel\MessageBreak using your TeX package manager or from CTAN.\MessageBreak \MessageBreak Loading l3sort will abort!% }% \endinput } \GetIdInfo$Id: l3sort.dtx 6111 2015-09-27 16:06:17Z joseph $ {L3 Experimental sorting functions} \ProvidesExplPackage {\ExplFileName}{\ExplFileDate}{\ExplFileVersion}{\ExplFileDescription} \int_const:Nn \c__sort_max_length_int { \sys_if_engine_luatex:TF { 49152 } { 24576 } } \int_new:N \l__sort_length_int \int_new:N \l__sort_block_int \int_new:N \l__sort_begin_int \int_new:N \l__sort_end_int \int_new:N \l__sort_A_int \int_new:N \l__sort_B_int \int_new:N \l__sort_C_int \cs_new_protected:Npn \__sort_main:NNNnNn #1#2#3#4#5#6 { \group_begin: \l__sort_length_int \c_zero #2 #5 { \if_int_compare:w \l__sort_length_int = \c__sort_max_length_int \__sort_too_long_error:NNw #3 #5 \fi: \tex_toks:D \l__sort_length_int {##1} \tex_advance:D \l__sort_length_int \c_one } \cs_set:Npn \sort_compare:nn ##1 ##2 { #6 } \l__sort_block_int \c_one \__sort_level: \use:x { \group_end: #1 \exp_not:N #5 {#4} } } \cs_new_protected_nopar:Npn \seq_sort:Nn { \__sort_main:NNNnNn \tl_set:Nn \seq_map_inline:Nn \seq_map_break: { \s__seq \__sort_toks:NNw \exp_not:N \__seq_item:n 0 ; } } \cs_new_protected_nopar:Npn \seq_gsort:Nn { \__sort_main:NNNnNn \tl_gset:Nn \seq_map_inline:Nn \seq_map_break: { \s__seq \__sort_toks:NNw \exp_not:N \__seq_item:n 0 ; } } \cs_new_protected_nopar:Npn \tl_sort:Nn { \__sort_main:NNNnNn \tl_set:Nn \tl_map_inline:Nn \tl_map_break: { \__sort_toks:NNw \prg_do_nothing: \prg_do_nothing: 0 ; } } \cs_new_protected_nopar:Npn \tl_gsort:Nn { \__sort_main:NNNnNn \tl_gset:Nn \tl_map_inline:Nn \tl_map_break: { \__sort_toks:NNw \prg_do_nothing: \prg_do_nothing: 0 ; } } \cs_new_protected_nopar:Npn \clist_sort:Nn { \__sort_clist:NNn \tl_set:Nn } \cs_new_protected_nopar:Npn \clist_gsort:Nn { \__sort_clist:NNn \tl_gset:Nn } \cs_new_protected:Npn \__sort_clist:NNn #1#2#3 { \clist_if_empty:NF #2 { \__sort_main:NNNnNn #1 \clist_map_inline:Nn \clist_map_break: { \exp_last_unbraced:Nf \use_none:n { \__sort_toks:NNw \exp_args:No \__clist_wrap_item:n 0 ; } } #2 {#3} } } \cs_new:Npn \__sort_toks:NNw #1#2#3 ; { \if_int_compare:w #3 < \l__sort_length_int #1 #2 { \tex_the:D \tex_toks:D #3 } \exp_after:wN \__sort_toks:NNw \exp_after:wN #1 \exp_after:wN #2 \int_use:N \__int_eval:w #3 + \c_one \exp_after:wN ; \fi: } \cs_new_protected_nopar:Npn \__sort_level: { \if_int_compare:w \l__sort_block_int < \l__sort_length_int \l__sort_end_int \c_zero \__sort_merge_blocks: \tex_multiply:D \l__sort_block_int \c_two \exp_after:wN \__sort_level: \fi: } \cs_new_protected_nopar:Npn \__sort_merge_blocks: { \l__sort_begin_int \l__sort_end_int \tex_advance:D \l__sort_end_int \l__sort_block_int \if_int_compare:w \__int_eval:w \l__sort_end_int < \l__sort_length_int \l__sort_A_int \l__sort_end_int \tex_advance:D \l__sort_end_int \l__sort_block_int \if_int_compare:w \l__sort_end_int > \l__sort_length_int \l__sort_end_int \l__sort_length_int \fi: \l__sort_B_int \l__sort_A_int \l__sort_C_int \l__sort_length_int \sort_copy_block: \tex_advance:D \l__sort_A_int \c_minus_one \tex_advance:D \l__sort_B_int \c_minus_one \tex_advance:D \l__sort_C_int \c_minus_one \__sort_merge_blocks_aux: \exp_after:wN \__sort_merge_blocks: \fi: } \cs_new_protected_nopar:Npn \sort_copy_block: { \tex_toks:D \l__sort_C_int \tex_toks:D \l__sort_B_int \tex_advance:D \l__sort_C_int \c_one \tex_advance:D \l__sort_B_int \c_one \if_int_compare:w \l__sort_B_int = \l__sort_end_int \use_i:nn \fi: \sort_copy_block: } \cs_new_protected_nopar:Npn \__sort_merge_blocks_aux: { \exp_after:wN \sort_compare:nn \exp_after:wN { \tex_the:D \tex_toks:D \exp_after:wN \l__sort_A_int \exp_after:wN } \exp_after:wN { \tex_the:D \tex_toks:D \l__sort_C_int } } \cs_new_protected_nopar:Npn \sort_ordered: { \tex_toks:D \l__sort_B_int \tex_toks:D \l__sort_C_int \tex_advance:D \l__sort_B_int \c_minus_one \tex_advance:D \l__sort_C_int \c_minus_one \if_int_compare:w \l__sort_C_int < \l__sort_length_int \use_i:nn \fi: \__sort_merge_blocks_aux: } \cs_new_protected_nopar:Npn \sort_reversed: { \tex_toks:D \l__sort_B_int \tex_toks:D \l__sort_A_int \tex_advance:D \l__sort_B_int \c_minus_one \tex_advance:D \l__sort_A_int \c_minus_one \if_int_compare:w \l__sort_A_int < \l__sort_begin_int \__sort_merge_blocks_end: \use_i:nn \fi: \__sort_merge_blocks_aux: } \cs_new_protected_nopar:Npn \__sort_merge_blocks_end: { \tex_toks:D \l__sort_B_int \tex_toks:D \l__sort_C_int \tex_advance:D \l__sort_B_int \c_minus_one \tex_advance:D \l__sort_C_int \c_minus_one \if_int_compare:w \l__sort_B_int < \l__sort_begin_int \use_i:nn \fi: \__sort_merge_blocks_end: } \cs_new:Npn \tl_sort:nN #1#2 { \exp_not:f { \tl_if_blank:nF {#1} { \__sort_quick_prepare:Nnnn #2 { } { } #1 { \__prg_break_point: \__sort_quick_prepare_end:NNNnw } \q_stop } } } \cs_new:Npn \__sort_quick_prepare:Nnnn #1#2#3#4 { \__prg_break: #4 \__prg_break_point: \__sort_quick_prepare:Nnnn #1 { #2 #3 } { #1 {#4} } } \cs_new:Npn \__sort_quick_prepare_end:NNNnw #1#2#3#4#5 \q_stop { \__sort_quick_split:NnNn #4 \__sort_quick_end:nnTFNn { } \q_mark { \__sort_quick_cleanup:w \exp_stop_f: } \s__stop \q_stop } \cs_new:Npn \__sort_quick_cleanup:w #1 \s__stop \q_stop {#1} \cs_new:Npn \__sort_quick_split:NnNn #1#2#3#4 { #3 {#2} {#4} \__sort_quick_only_ii:NnnnnNn \__sort_quick_only_i:NnnnnNn \__sort_quick_single_end:nnnwnw { #3 {#4} } { } { } {#2} } \cs_new:Npn \__sort_quick_only_i:NnnnnNn #1#2#3#4#5#6#7 { #6 {#5} {#7} \__sort_quick_split_ii:NnnnnNn \__sort_quick_only_i:NnnnnNn \__sort_quick_only_i_end:nnnwnw { #6 {#7} } { #3 #2 } { } {#5} } \cs_new:Npn \__sort_quick_only_ii:NnnnnNn #1#2#3#4#5#6#7 { #6 {#5} {#7} \__sort_quick_only_ii:NnnnnNn \__sort_quick_split_i:NnnnnNn \__sort_quick_only_ii_end:nnnwnw { #6 {#7} } { } { #4 #2 } {#5} } \cs_new:Npn \__sort_quick_split_i:NnnnnNn #1#2#3#4#5#6#7 { #6 {#5} {#7} \__sort_quick_split_ii:NnnnnNn \__sort_quick_split_i:NnnnnNn \__sort_quick_split_end:nnnwnw { #6 {#7} } { #3 #2 } {#4} {#5} } \cs_new:Npn \__sort_quick_split_ii:NnnnnNn #1#2#3#4#5#6#7 { #6 {#5} {#7} \__sort_quick_split_ii:NnnnnNn \__sort_quick_split_i:NnnnnNn \__sort_quick_split_end:nnnwnw { #6 {#7} } {#3} { #4 #2 } {#5} } \cs_new:Npn \__sort_quick_end:nnTFNn #1#2#3#4#5#6 {#5} \cs_new:Npn \__sort_quick_single_end:nnnwnw #1#2#3#4 \q_mark #5#6 \q_stop { #5 {#3} #6 \q_stop } \cs_new:Npn \__sort_quick_only_i_end:nnnwnw #1#2#3#4 \q_mark #5#6 \q_stop { \__sort_quick_split:NnNn #1 \__sort_quick_end:nnTFNn { } \q_mark {#5} {#3} #6 \q_stop } \cs_new:Npn \__sort_quick_only_ii_end:nnnwnw #1#2#3#4 \q_mark #5#6 \q_stop { \__sort_quick_split:NnNn #2 \__sort_quick_end:nnTFNn { } \q_mark { #5 {#3} } #6 \q_stop } \cs_new:Npn \__sort_quick_split_end:nnnwnw #1#2#3#4 \q_mark #5#6 \q_stop { \__sort_quick_split:NnNn #2 \__sort_quick_end:nnTFNn { } \q_mark { \__sort_quick_split:NnNn #1 \__sort_quick_end:nnTFNn { } \q_mark {#5} {#3} } #6 \q_stop } \cs_new_protected:Npn \__sort_too_long_error:NNw #1#2 \fi: { \fi: \__msg_kernel_error:nnx { sort } { too-large } { \token_to_str:N #2 } #1 } \__msg_kernel_new:nnnn { sort } { too-large } { The~list~#1~is~too~long~to~be~sorted~by~TeX. } { TeX~has~\int_eval:n { \c_max_register_int + 1 }~registers~available:~ this~only~allows~to~sorts~with~up~to~\int_use:N \c__sort_max_length_int \ items.~All~extra~items~will~be~ignored. } %% %% %% End of file `l3sort.sty'.