Searching Sequences Sequences
nil) if and only if its first argument is less than (not equal to) its second argument. For example,
string-lesspare suitable predicate functions for sorting numbers and strings, respectively;
>would sort numbers into decreasing rather than increasing order.
This function differs from Emacs' built-in
sort in that it
can operate on any type of sequence, not just lists. Also, it
:key argument which is used to preprocess data
fed to the predicate function. For example,
(setq data (sort data 'string-lessp :key 'downcase))
sorts data, a sequence of strings, into increasing alphabetical
order without regard to case. A
:key function of
would be useful for sorting association lists.
sort* function is destructive; it sorts lists by actually
cdr pointers in suitable fashion.
stable-sort are equivalent
in Emacs Lisp because the underlying
sort function is
stable by default. However, this package reserves the right to
use non-stable methods for
sort* in the future.
concatenate), has length equal to the sum of the lengths of the two input sequences. The sequences may be modified destructively. Order of elements within seq1 and seq2 is preserved in the interleaving; elements of the two sequences are compared by predicate (in the sense of
sort) and the lesser element goes first in the result. When elements are equal, those from seq1 precede those from seq2 in the result. Thus, if seq1 and seq2 are both sorted according to predicate, then the result will be a merged sequence which is (stably) sorted according to predicate.