- cl-utilities-cvs@common-lisp.net - mailman3.common-lisp.net

[cl-utilities-cvs] CVS cl-utilities/doc
by pscott 03 May '06

03 May '06

Update of /project/cl-utilities/cvsroot/cl-utilities/doc In directory clnet:/tmp/cvs-serv24356/doc Modified Files: with-unique-names.html Log Message: Fixed a broken link, for real this time. Really. I hope. --- /project/cl-utilities/cvsroot/cl-utilities/doc/with-unique-names.html 2006/05/03 01:33:28 1.2 +++ /project/cl-utilities/cvsroot/cl-utilities/doc/with-unique-names.html 2006/05/03 01:57:15 1.3 @@ -51,7 +51,7 @@ created are <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_l.htm#lexical">lexical</a> unless <a - HREF="http://www.lispworks.com/documentation/HyperSpec/Body/dec_specia.htm#special">special</a> + HREF="http://www.lispworks.com/documentation/HyperSpec/Body/d_specia.htm#special">special</a> <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_d.htm#declarat…">declaration</a>s are specified.

1 0

[cl-utilities-cvs] CVS cl-utilities
by pscott 03 May '06

03 May '06

Update of /project/cl-utilities/cvsroot/cl-utilities In directory clnet:/tmp/cvs-serv24356 Modified Files: package.sh Log Message: Fixed a broken link, for real this time. Really. I hope. --- /project/cl-utilities/cvsroot/cl-utilities/package.sh 2005/12/28 23:34:29 1.7 +++ /project/cl-utilities/cvsroot/cl-utilities/package.sh 2006/05/03 01:57:15 1.8 @@ -1,21 +1,21 @@ #!/bin/sh -mkdir cl-utilities-1.2.3 -mkdir cl-utilities-1.2.3/doc -cp cl-utilities.asd package.sh collecting.lisp split-sequence.lisp expt-mod.lisp package.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.2.3/ -cp doc/collecting.html doc/expt-mod.html doc/read-delimited.html doc/with-unique-names.html doc/compose.html doc/extremum.html doc/rotate-byte.html doc/copy-array.html doc/index.html doc/split-sequence.html doc/once-only.html doc/style.css cl-utilities-1.2.3/doc/ +mkdir cl-utilities-1.2.4 +mkdir cl-utilities-1.2.4/doc +cp cl-utilities.asd package.sh collecting.lisp split-sequence.lisp expt-mod.lisp package.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.2.4/ +cp doc/collecting.html doc/expt-mod.html doc/read-delimited.html doc/with-unique-names.html doc/compose.html doc/extremum.html doc/rotate-byte.html doc/copy-array.html doc/index.html doc/split-sequence.html doc/once-only.html doc/style.css cl-utilities-1.2.4/doc/ rm -f cl-utilities-latest.tar.gz cl-utilities-latest.tar.gz.asc -tar -czvf cl-utilities-1.2.3.tar.gz cl-utilities-1.2.3/ -ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.3.tar.gz ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz -gpg -b -a ~/hacking/lisp/cl-utilities/cl-utilities-1.2.3.tar.gz -ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.3.tar.gz.asc ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc -rm -Rf cl-utilities-1.2.3/ +tar -czvf cl-utilities-1.2.4.tar.gz cl-utilities-1.2.4/ +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.4.tar.gz ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz +gpg -b -a ~/hacking/lisp/cl-utilities/cl-utilities-1.2.4.tar.gz +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.4.tar.gz.asc ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc +rm -Rf cl-utilities-1.2.4/ -scp cl-utilities-1.2.3.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.3.tar.gz -scp cl-utilities-1.2.3.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.3.tar.gz.asc -scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/ftp/cl-utilities-1.2.3.tar.gz -scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/ftp/cl-utilities-1.2.3.tar.gz.asc +scp cl-utilities-1.2.4.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.4.tar.gz +scp cl-utilities-1.2.4.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.4.tar.gz.asc +scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/ftp/cl-utilities-1.2.4.tar.gz +scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/ftp/cl-utilities-1.2.4.tar.gz.asc scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz.asc

1 0

[cl-utilities-cvs] CVS cl-utilities/doc
by pscott 03 May '06

03 May '06

Update of /project/cl-utilities/cvsroot/cl-utilities/doc In directory clnet:/tmp/cvs-serv24065/doc Modified Files: split-sequence.html Log Message: Added implementation notes explaining the abysmal performance on lists. --- /project/cl-utilities/cvsroot/cl-utilities/doc/split-sequence.html 2006/05/03 01:33:28 1.3 +++ /project/cl-utilities/cvsroot/cl-utilities/doc/split-sequence.html 2006/05/03 01:46:54 1.4 @@ -78,11 +78,28 @@ me</a> so we can get it straightened out. The implementation itself is mature and well tested, and it is -widely used. Efficiency probably isn't what it could be with some type -declarations, but the code is striaghtforward and should be fast -enough. If it isn't fast enough for you, feel free to modify -it, or even just complain about it on the mailing list---something -might get done. +widely used. The code should be fast enough for most people, but be +warned: it was written with vectors in mind, with list manipulation as +an afterthought. It does a lot of things that are quick on vectors but +slow on lists, and this can result in many orders of magnitude +slowdown in list benchmarks versus code written for lists. If this is +a problem for you, it should be straightforward to write your own, +such as the (more limited, not API compatible) example function given +by Szymon in <a +href="http://common-lisp.net/pipermail/cl-utilities-devel/2006-May/000011.html">this +mailing list post</a>: + +<pre> +(defun split-list-if (test list &aux (start list) (end list)) + (loop while (and end (setq start (member-if-not test end))) + collect (ldiff start (setq end (member-if test start))))) +</pre> + +If this is an issue for enough people, I could optimize the code +and fix this problem. I'm reluctant to do that, however, since the +code works and is tested. It's usually more important to be correct +and non-buggy than to be fast, and I have been known to introduce +bugs. <hr><a href="index.html">Manual Index</a>

1 0

[cl-utilities-cvs] CVS cl-utilities/doc
by pscott 03 May '06

03 May '06

Update of /project/cl-utilities/cvsroot/cl-utilities/doc In directory clnet:/tmp/cvs-serv22428/doc Modified Files: collecting.html compose.html extremum.html once-only.html rotate-byte.html split-sequence.html with-unique-names.html Log Message: Fixed broken links in with-unique-names.html and changed links to the old HyperSpec at lisp.org to the newer one at lispworks.com. Thanks to Martin Simmons for pointing this out. --- /project/cl-utilities/cvsroot/cl-utilities/doc/collecting.html 2005/12/14 21:15:16 1.2 +++ /project/cl-utilities/cvsroot/cl-utilities/doc/collecting.html 2006/05/03 01:33:28 1.3 @@ -18,7 +18,7 @@ Arguments and Values: forms---an <a -href="http://www.lisp.org/HyperSpec/Body/glo_i.html#implicit_progn">implicit +href="http://www.lispworks.com/documentation/HyperSpec/Body/glo_i.html#implicit_p…">implicit progn</a>. collector---a symbol which will have a collection function bound to it. --- /project/cl-utilities/cvsroot/cl-utilities/doc/compose.html 2005/12/14 21:15:16 1.1 +++ /project/cl-utilities/cvsroot/cl-utilities/doc/compose.html 2006/05/03 01:33:28 1.2 @@ -14,7 +14,7 @@ Arguments and Values: -function---a <a href="http://www.lisp.org/HyperSpec/Body/glo_f.html#function_designator">function designator</a>. +function---a <a href="http://www.lispworks.com/documentation/HyperSpec/Body/glo_f.html#function_d…">function designator</a>. composite-function---a function. --- /project/cl-utilities/cvsroot/cl-utilities/doc/extremum.html 2005/12/14 21:15:18 1.2 +++ /project/cl-utilities/cvsroot/cl-utilities/doc/extremum.html 2006/05/03 01:33:28 1.3 @@ -31,13 +31,13 @@ morally-smallest-element---the element of sequence that would appear first if the sequence were ordered according to <a class="hyperspec" href =" -http://www.lisp.org/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> +http://www.lispworks.com/documentation/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> using predicate and key morally-smallest-elements---the identical elements of sequence that would appear first if the sequence were ordered according to <a class="hyperspec" href =" -http://www.lisp.org/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> +http://www.lispworks.com/documentation/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> using predicate and key. If predicate states that neither of two objects is before the other, they are considered identical. @@ -47,7 +47,7 @@ n-smallest-elements---the n elements of sequence that would appear first if the sequence were ordered according to <a class="hyperspec" href =" -http://www.lisp.org/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> +http://www.lispworks.com/documentation/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> using predicate and key @@ -57,7 +57,7 @@ appear first if the subsequence of sequence specified by start and end were ordered according to <a class="hyperspec" href =" -http://www.lisp.org/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> +http://www.lispworks.com/documentation/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> using predicate and key. @@ -96,7 +96,7 @@ The return value of <tt>(extremum predicate sequence :key key)</tt> can be defined as <tt>(elt (<a class="hyperspec" href =" -http://www.lisp.org/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> +http://www.lispworks.com/documentation/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> predicate (subseq sequence start end) :key key) 0)</tt> except when sequence is empty (see Exceptional Situations), but may use faster (less asymptotically complex) algorithms to find this answer. --- /project/cl-utilities/cvsroot/cl-utilities/doc/once-only.html 2005/12/14 21:15:18 1.1 +++ /project/cl-utilities/cvsroot/cl-utilities/doc/once-only.html 2006/05/03 01:33:28 1.2 @@ -15,9 +15,9 @@ Arguments and Values: -name---a <a href="http://www.lisp.org/HyperSpec/Body/glo_s.html#symbol">symbol</a></a>. +name---a <a href="http://www.lispworks.com/documentation/HyperSpec/Body/glo_s.html#symbol">symbol</a></a>. -form---a <a href="http://www.lisp.org/HyperSpec/Body/glo_f.html#form">form</a></a>. +form---a <a href="http://www.lispworks.com/documentation/HyperSpec/Body/glo_f.html#form">form</a></a>. Description: --- /project/cl-utilities/cvsroot/cl-utilities/doc/rotate-byte.html 2005/12/14 21:15:18 1.1 +++ /project/cl-utilities/cvsroot/cl-utilities/doc/rotate-byte.html 2006/05/03 01:33:28 1.2 @@ -46,7 +46,12 @@ See Also: -<a class="hyperspec" href =" http://www.lisp.org/HyperSpec/Body/fun_bytecm_by_yte-position.html">byte</a>, <a class="hyperspec" href =" http://www.lisp.org/HyperSpec/Body/fun_dpb.html">dpb</a>, <a class="hyperspec" href =" http://www.lisp.org/HyperSpec/Body/acc_ldb.html">ldb</a> +<a class="hyperspec" href =" +http://www.lispworks.com/documentation/HyperSpec/Body/fun_bytecm_by_yte-position.html">byte</a>, +<a class="hyperspec" href =" +http://www.lispworks.com/documentation/HyperSpec/Body/fun_dpb.html">dpb</a>, <a +class="hyperspec" href =" +http://www.lispworks.com/documentation/HyperSpec/Body/acc_ldb.html">ldb</a> Implementation notes --- /project/cl-utilities/cvsroot/cl-utilities/doc/split-sequence.html 2005/12/14 21:15:18 1.2 +++ /project/cl-utilities/cvsroot/cl-utilities/doc/split-sequence.html 2006/05/03 01:33:28 1.3 @@ -41,7 +41,7 @@ Splits sequence into a list of subsequences delimited by objects satisfying the test. -List is a list of sequences of the same kind as sequence that has elements consisting of subsequences of sequence that were delimited in the argument by elements satisfying the test. Index is an index into sequence indicating the unprocessed region, suitable as an argument to <a class="hyperspec" href =" http://www.lisp.org/HyperSpec/Body/acc_subseq.html">subseq</a> to continue processing in the same manner if desired. +List is a list of sequences of the same kind as sequence that has elements consisting of subsequences of sequence that were delimited in the argument by elements satisfying the test. Index is an index into sequence indicating the unprocessed region, suitable as an argument to <a class="hyperspec" href =" http://www.lispworks.com/documentation/HyperSpec/Body/acc_subseq.html">subseq</a> to continue processing in the same manner if desired. The count argument, if supplied, limits the number of subsequences in the first return value; if more than count delimited subsequences exist in sequence, the count leftmost delimited subsequences will be in order in the first return value, and the second return value will be the index into sequence at which processing stopped. --- /project/cl-utilities/cvsroot/cl-utilities/doc/with-unique-names.html 2005/12/14 21:15:18 1.1 +++ /project/cl-utilities/cvsroot/cl-utilities/doc/with-unique-names.html 2006/05/03 01:33:28 1.2 @@ -22,7 +22,7 @@ <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_e.htm#evaluate">evaluate</a>d. The default is var. declaration---a <a href =" - http://www.lisp.org/HyperSpec/Body/sym_declare.html">declare</a> + http://www.lispworks.com/documentation/HyperSpec/Body/sym_declare.html">declare</a> <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_e.htm#expressi…">expression</a>; not <a @@ -32,14 +32,14 @@ <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_r.htm#return">return</a>ed by the forms. Description: <a - HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_E.htm#Execute">Execute</a>s + HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_e.htm#Execute">Execute</a>s a series of <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_f.htm#form">form</a>s with each var <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_b.htm#bound">bound</a> to a <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_f.htm#fresh">fresh</a>, <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_u.htm#unintern…">uninterned</a> <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_s.htm#symbol">symbol</a>. The <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_u.htm#unintern…">uninterned</a> <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_s.htm#symbol">symbol</a> is created as if by - a <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_c.htm#call">call</a> to <a href =" http://www.lisp.org/HyperSpec/Body/fun_gensym.html">gensym</a> with the + a <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_c.htm#call">call</a> to <a href =" http://www.lispworks.com/documentation/HyperSpec/Body/fun_gensym.html">gensym</a> with the <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_s.htm#string">string</a> denoted by prefix---or, if prefix is not supplied, the <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_s.htm#string">string</a> @@ -51,7 +51,7 @@ created are <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_l.htm#lexical">lexical</a> unless <a - HREF="http://www.lispworks.com/documentation/HyperSpec/Body/dec_special.htm#speci…">special</a> + HREF="http://www.lispworks.com/documentation/HyperSpec/Body/dec_specia.htm#special">special</a> <a HREF="http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_d.htm#declarat…">declaration</a>s are specified. @@ -72,15 +72,15 @@ </pre> Side Effects: - Might increment <a href =" http://www.lisp.org/HyperSpec/Body/var_stgensym-counterst.html">*gensym-counter*</a> once for each + Might increment <a href =" http://www.lispworks.com/documentation/HyperSpec/Body/var_stgensym-counters…">*gensym-counter*</a> once for each var. Affected by: <a href =" - http://www.lisp.org/HyperSpec/Body/var_stgensym-counterst.html">*gensym-counter*</a> + http://www.lispworks.com/documentation/HyperSpec/Body/var_stgensym-counters…">*gensym-counter*</a> Exceptional Situations: None. See Also: -<a href =" http://www.lisp.org/HyperSpec/Body/fun_gensym.html">gensym</a>, <a href =" http://www.lisp.org/HyperSpec/Body/speope_letcm_letst.html">let</a> +<a href =" http://www.lispworks.com/documentation/HyperSpec/Body/fun_gensym.html">gensym</a>, <a href =" http://www.lispworks.com/documentation/HyperSpec/Body/speope_letcm_letst.ht…">let</a>

1 0

[cl-utilities-cvs] CVS update: cl-utilities/cl-utilities.asd cl-utilities/package.lisp cl-utilities/package.sh cl-utilities/rotate-byte.lisp
by pscott＠common-lisp.net 29 Dec '05

29 Dec '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv3004 Modified Files: cl-utilities.asd package.lisp package.sh rotate-byte.lisp Log Message: 1. Now this doesn't assume that SBCL has sb-rotate-byte, which was causing some problems. Thanks to Gary King and John Wiseman for finding this problem in a certain version of SBCL on ppc. 2. If :split-sequence-deprecated is added to *features* before compiling cl-utilities, it will create a :split-sequence package which exports the usual split-sequence interface. This is for easy backward compatibility. If you do not add :split-sequence-deprecated to *features*, it will leave split-sequence alone. Thanks to Greg Pfeil for the idea and some of the code. Date: Thu Dec 29 00:34:29 2005 Author: pscott Index: cl-utilities/cl-utilities.asd diff -u cl-utilities/cl-utilities.asd:1.3 cl-utilities/cl-utilities.asd:1.4 --- cl-utilities/cl-utilities.asd:1.3 Mon Aug 29 22:14:47 2005 +++ cl-utilities/cl-utilities.asd Thu Dec 29 00:34:28 2005 @@ -21,7 +21,13 @@ (:file "once-only" :depends-on ("package")) (:file "rotate-byte" :depends-on ("package")) (:file "copy-array" :depends-on ("package")) - (:file "compose" :depends-on ("package"))) - ;; On SBCL, we can speed up byte rotation by using its - ;; implementation of rotate-byte. - :depends-on (#+sbcl :sb-rotate-byte)) \ No newline at end of file + (:file "compose" :depends-on ("package")))) + +;; Sometimes we can accelerate byte rotation on SBCL by using the +;; SB-ROTATE-BYTE extension. This loads it. +#+sbcl +(eval-when (:compile-toplevel :load-toplevel :execute) + (handler-case (progn + (require :sb-rotate-byte) + (pushnew :sbcl-uses-sb-rotate-byte *features*)) + (error () (delete :sbcl-uses-sb-rotate-byte *features*)))) \ No newline at end of file Index: cl-utilities/package.lisp diff -u cl-utilities/package.lisp:1.5 cl-utilities/package.lisp:1.6 --- cl-utilities/package.lisp:1.5 Mon Nov 28 22:45:49 2005 +++ cl-utilities/package.lisp Thu Dec 29 00:34:29 2005 @@ -39,4 +39,11 @@ #:copy-array - #:compose)) \ No newline at end of file + #:compose)) + +#+split-sequence-deprecated +(defpackage :split-sequence + (:documentation "This package mimics SPLIT-SEQUENCE for compatibility with +packages that expect that system.") + (:use :cl-utilities) + (:export #:split-sequence #:split-sequence-if #:split-sequence-if-not)) Index: cl-utilities/package.sh diff -u cl-utilities/package.sh:1.6 cl-utilities/package.sh:1.7 --- cl-utilities/package.sh:1.6 Wed Dec 14 22:44:12 2005 +++ cl-utilities/package.sh Thu Dec 29 00:34:29 2005 @@ -1,19 +1,21 @@ #!/bin/sh -mkdir cl-utilities-1.2.1 -mkdir cl-utilities-1.2.1/doc -cp cl-utilities.asd package.sh collecting.lisp split-sequence.lisp expt-mod.lisp package.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.2.1/ -cp doc/collecting.html doc/expt-mod.html doc/read-delimited.html doc/with-unique-names.html doc/compose.html doc/extremum.html doc/rotate-byte.html doc/copy-array.html doc/index.html doc/split-sequence.html doc/once-only.html doc/style.css cl-utilities-1.2.1/doc/ +mkdir cl-utilities-1.2.3 +mkdir cl-utilities-1.2.3/doc +cp cl-utilities.asd package.sh collecting.lisp split-sequence.lisp expt-mod.lisp package.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.2.3/ +cp doc/collecting.html doc/expt-mod.html doc/read-delimited.html doc/with-unique-names.html doc/compose.html doc/extremum.html doc/rotate-byte.html doc/copy-array.html doc/index.html doc/split-sequence.html doc/once-only.html doc/style.css cl-utilities-1.2.3/doc/ rm -f cl-utilities-latest.tar.gz cl-utilities-latest.tar.gz.asc -tar -czvf cl-utilities-1.2.1.tar.gz cl-utilities-1.2.1/ -ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.1.tar.gz ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz -gpg -b -a ~/hacking/lisp/cl-utilities/cl-utilities-1.2.1.tar.gz -ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.1.tar.gz.asc ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc -rm -Rf cl-utilities-1.2.1/ +tar -czvf cl-utilities-1.2.3.tar.gz cl-utilities-1.2.3/ +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.3.tar.gz ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz +gpg -b -a ~/hacking/lisp/cl-utilities/cl-utilities-1.2.3.tar.gz +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.3.tar.gz.asc ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc +rm -Rf cl-utilities-1.2.3/ -scp cl-utilities-1.2.1.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.1.tar.gz -scp cl-utilities-1.2.1.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.1.tar.gz.asc +scp cl-utilities-1.2.3.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.3.tar.gz +scp cl-utilities-1.2.3.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.3.tar.gz.asc +scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/ftp/cl-utilities-1.2.3.tar.gz +scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/ftp/cl-utilities-1.2.3.tar.gz.asc scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz.asc Index: cl-utilities/rotate-byte.lisp diff -u cl-utilities/rotate-byte.lisp:1.1.1.1 cl-utilities/rotate-byte.lisp:1.2 --- cl-utilities/rotate-byte.lisp:1.1.1.1 Mon May 9 23:26:29 2005 +++ cl-utilities/rotate-byte.lisp Thu Dec 29 00:34:29 2005 @@ -22,8 +22,8 @@ bytespec integer)))) ;; On SBCL, we use the SB-ROTATE-BYTE extension. - #+sbcl (sb-rotate-byte:rotate-byte count bytespec integer)) + #+sbcl-uses-sb-rotate-byte (sb-rotate-byte:rotate-byte count bytespec integer)) ;; If we're using the SB-ROTATE-BYTE extension, we should inline our ;; call and let SBCL handle optimization from there. -#+sbcl (declaim (inline rotate-byte)) \ No newline at end of file +#+sbcl-uses-sb-rotate-byte (declaim (inline rotate-byte)) \ No newline at end of file

1 0

[cl-utilities-cvs] CVS update: cl-utilities/package.sh
by pscott＠common-lisp.net 14 Dec '05

14 Dec '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv25898 Modified Files: package.sh Log Message: Updated the packaging instructions a little. This is for my own use only, BTW. It would probably be almost useless for anyone else. Date: Wed Dec 14 22:44:12 2005 Author: pscott Index: cl-utilities/package.sh diff -u cl-utilities/package.sh:1.5 cl-utilities/package.sh:1.6 --- cl-utilities/package.sh:1.5 Mon Nov 28 22:45:49 2005 +++ cl-utilities/package.sh Wed Dec 14 22:44:12 2005 @@ -1,17 +1,19 @@ #!/bin/sh -mkdir cl-utilities-1.2 -cp cl-utilities.asd package.sh collecting.lisp split-sequence.lisp expt-mod.lisp package.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.2/ +mkdir cl-utilities-1.2.1 +mkdir cl-utilities-1.2.1/doc +cp cl-utilities.asd package.sh collecting.lisp split-sequence.lisp expt-mod.lisp package.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.2.1/ +cp doc/collecting.html doc/expt-mod.html doc/read-delimited.html doc/with-unique-names.html doc/compose.html doc/extremum.html doc/rotate-byte.html doc/copy-array.html doc/index.html doc/split-sequence.html doc/once-only.html doc/style.css cl-utilities-1.2.1/doc/ rm -f cl-utilities-latest.tar.gz cl-utilities-latest.tar.gz.asc -tar -czvf cl-utilities-1.2.tar.gz cl-utilities-1.2/ -ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.tar.gz ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz -gpg -b -a ~/hacking/lisp/cl-utilities/cl-utilities-1.2.tar.gz -ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.tar.gz.asc ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc -rm -Rf cl-utilities-1.2/ +tar -czvf cl-utilities-1.2.1.tar.gz cl-utilities-1.2.1/ +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.1.tar.gz ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz +gpg -b -a ~/hacking/lisp/cl-utilities/cl-utilities-1.2.1.tar.gz +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.1.tar.gz.asc ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc +rm -Rf cl-utilities-1.2.1/ -scp cl-utilities-1.2.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.tar.gz -scp cl-utilities-1.2.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.tar.gz.asc +scp cl-utilities-1.2.1.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.1.tar.gz +scp cl-utilities-1.2.1.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.1.tar.gz.asc scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz.asc

1 0

[cl-utilities-cvs] CVS update: cl-utilities/doc/compose.html cl-utilities/doc/copy-array.html cl-utilities/doc/expt-mod.html cl-utilities/doc/index.html cl-utilities/doc/once-only.html cl-utilities/doc/rotate-byte.html cl-utilities/doc/style.css cl-utilities/doc/with-unique-names.html cl-utilities/doc/collecting.html cl-utilities/doc/extremum.html cl-utilities/doc/read-delimited.html cl-utilities/doc/split-sequence.html
by pscott＠common-lisp.net 14 Dec '05

14 Dec '05

Update of /project/cl-utilities/cvsroot/cl-utilities/doc In directory common-lisp.net:/tmp/cvs-serv23548/doc Modified Files: collecting.html extremum.html read-delimited.html split-sequence.html Added Files: compose.html copy-array.html expt-mod.html index.html once-only.html rotate-byte.html style.css with-unique-names.html Log Message: Big improvement to the documentation. I actually added a manual instead of simply telling people to look at the Cliki pages. Also added a little more argument checking to N-MOST-EXTREME function. Date: Wed Dec 14 22:15:19 2005 Author: pscott Index: cl-utilities/doc/collecting.html diff -u cl-utilities/doc/collecting.html:1.1 cl-utilities/doc/collecting.html:1.2 --- cl-utilities/doc/collecting.html:1.1 Mon Aug 29 22:18:18 2005 +++ cl-utilities/doc/collecting.html Wed Dec 14 22:15:16 2005 @@ -43,6 +43,19 @@ If the collector names are not all symbols, a type-error will be signalled. +Examples: + +<pre> +(collecting (dotimes (x 10) (collect x))) => (0 1 2 3 4 5 6 7 8 9) + +(multiple-value-bind (a b) + (with-collectors (x y) + (x 1) + (y 2) + (x 3)) + (append a b)) => (1 2 3) +</pre> + Implementation notes: Opinions differ on how a collection macro should work. There are @@ -59,5 +72,7 @@ and you can't nest them to get the same effect as multiple collection since it always uses the collect function. If you want to collect into multiple lists, use the with-collect macro. + +<hr><a href="index.html">Manual Index</a> </body></html> Index: cl-utilities/doc/extremum.html diff -u cl-utilities/doc/extremum.html:1.1 cl-utilities/doc/extremum.html:1.2 --- cl-utilities/doc/extremum.html:1.1 Mon Aug 29 22:18:18 2005 +++ cl-utilities/doc/extremum.html Wed Dec 14 22:15:18 2005 @@ -1,17 +1,19 @@ <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <HTML> <HEAD> - <TITLE>Function EXTREMUM</TITLE> + <TITLE>Function EXTREMUM, EXTREMA, N-MOST-EXTREME</TITLE> <LINK REL="stylesheet" HREF="style.css" type="text/css"> </HEAD> <BODY> -Function EXTREMUM</a></a> +Function EXTREMUM, EXTREMA, N-MOST-EXTREME</a></a> Syntax: extremum sequence predicate <tt>&key</tt> key (start 0) end => morally-smallest-element +extrema sequence predicate <tt>&key</tt> key (start 0) end => morally-smallest-elements +n-most-extreme n sequence predicate <tt>&key</tt> key (start 0) end => n-smallest-elements Arguments and Values: @@ -32,6 +34,22 @@ http://www.lisp.org/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> using predicate and key +morally-smallest-elements---the identical elements of +sequence that would appear first if the sequence were ordered +according to <a class="hyperspec" href =" +http://www.lisp.org/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> +using predicate and key. If predicate states that +neither of two objects is before the other, they are considered +identical. + +n---a positive integer + +n-smallest-elements---the n elements of sequence that +would appear first if the sequence were ordered according to <a +class="hyperspec" href =" +http://www.lisp.org/HyperSpec/Body/fun_sortcm_stable-sort.html">sort</a> +using predicate and key + Description: @@ -82,6 +100,18 @@ predicate (subseq sequence start end) :key key) 0)</tt> except when sequence is empty (see Exceptional Situations), but may use faster (less asymptotically complex) algorithms to find this answer. + +extrema is similar to extremum, but it returns a list +of values. There can be more than one extremum, as determined by +predicate, and with extremum the choice of which +extremum to return is arbitrary. extrema returns all the +possible values which predicate determines to be equal. + +n-most-extreme returns a list of n values without +testing for equality. It orders sequence in the same way as +extremum and extrema, then returns the first n +elements of the sorted sequence. + Exceptional situations: @@ -94,6 +124,14 @@ Should be prepared to signal an error of type type-error if sequence is not a proper sequence. +If there are fewer than n values in the part of +sequence that n-most-extreme may operate on, it returns +all the values it can in sorted order and signals the warning +n-most-extreme-not-enough-elements. This warning stores the +given values for n and the relevant subsequence, and they may +be accessed with n-most-extreme-not-enough-elements-n and +n-most-extreme-not-enough-elements-subsequence, respectively. + Implementation notes: There are two implementations of this function included in @@ -111,5 +149,7 @@ Don't worry about the performance of passing <tt>#'identity</tt> as key. This is optimized by a compiler macro. + +<hr><a href="index.html">Manual Index</a> </body></html> Index: cl-utilities/doc/read-delimited.html diff -u cl-utilities/doc/read-delimited.html:1.1 cl-utilities/doc/read-delimited.html:1.2 --- cl-utilities/doc/read-delimited.html:1.1 Mon Aug 29 22:18:18 2005 +++ cl-utilities/doc/read-delimited.html Wed Dec 14 22:15:18 2005 @@ -83,4 +83,6 @@ it is more efficient. If you need something more high-level, this could be built on top of read-delimited fairly easily. +<hr><a href="index.html">Manual Index</a> + </body></html> Index: cl-utilities/doc/split-sequence.html diff -u cl-utilities/doc/split-sequence.html:1.1 cl-utilities/doc/split-sequence.html:1.2 --- cl-utilities/doc/split-sequence.html:1.1 Mon Aug 29 22:18:18 2005 +++ cl-utilities/doc/split-sequence.html Wed Dec 14 22:15:18 2005 @@ -84,4 +84,6 @@ it, or even just complain about it on the mailing list---something might get done. +<hr><a href="index.html">Manual Index</a> + </body></html>

1 0

[cl-utilities-cvs] CVS update: cl-utilities/extremum.lisp
by pscott＠common-lisp.net 14 Dec '05

14 Dec '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv23548 Modified Files: extremum.lisp Log Message: Big improvement to the documentation. I actually added a manual instead of simply telling people to look at the Cliki pages. Also added a little more argument checking to N-MOST-EXTREME function. Date: Wed Dec 14 22:15:15 2005 Author: pscott Index: cl-utilities/extremum.lisp diff -u cl-utilities/extremum.lisp:1.9 cl-utilities/extremum.lisp:1.10 --- cl-utilities/extremum.lisp:1.9 Wed Nov 30 01:07:15 2005 +++ cl-utilities/extremum.lisp Wed Dec 14 22:15:15 2005 @@ -154,6 +154,7 @@ elements in the relevant part of the sequence, this will return all the elements it can and signal the warning N-MOST-EXTREME-NOT-ENOUGH-ELEMENTS" + (check-type n (integer 0)) (with-check-length (sequence start end) ;; This is faster on vectors than on lists. (let ((sequence (subseq sequence start end)))

1 0

[cl-utilities-cvs] CVS update: cl-utilities/extremum.lisp
by pscott＠common-lisp.net 30 Nov '05

30 Nov '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv23531 Modified Files: extremum.lisp Log Message: Fixed misspelling of "Rittweiler". There should be only one l. Date: Wed Nov 30 01:07:15 2005 Author: pscott Index: cl-utilities/extremum.lisp diff -u cl-utilities/extremum.lisp:1.8 cl-utilities/extremum.lisp:1.9 --- cl-utilities/extremum.lisp:1.8 Mon Nov 28 22:45:49 2005 +++ cl-utilities/extremum.lisp Wed Nov 30 01:07:15 2005 @@ -106,7 +106,7 @@ smallest))) ;; EXTREMA and N-MOST-EXTREME are based on code and ideas from Tobias -;; C. Rittweiller. They deal with the cases in which you are not +;; C. Rittweiler. They deal with the cases in which you are not ;; looking for a single extreme element, but for the extreme identical ;; elements or the N most extreme elements.

1 0

[cl-utilities-cvs] CVS update: cl-utilities/expt-mod.lisp cl-utilities/extremum.lisp cl-utilities/package.lisp cl-utilities/package.sh cl-utilities/test.lisp
by pscott＠common-lisp.net 28 Nov '05

28 Nov '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv550 Modified Files: expt-mod.lisp extremum.lisp package.lisp package.sh test.lisp Log Message: Fixed a bug in extremum and added new EXTREMA and N-MOST-EXTREME functions based on feedback from Tobias Rittweiller. Improved docstrings. Added more tests. Added ACL optimization to EXPT-MOD. Date: Mon Nov 28 22:45:49 2005 Author: pscott Index: cl-utilities/expt-mod.lisp diff -u cl-utilities/expt-mod.lisp:1.2 cl-utilities/expt-mod.lisp:1.3 --- cl-utilities/expt-mod.lisp:1.2 Mon May 9 23:51:31 2005 +++ cl-utilities/expt-mod.lisp Mon Nov 28 22:45:49 2005 @@ -5,24 +5,25 @@ (defun expt-mod (n exponent modulus) "As (mod (expt n exponent) modulus), but more efficient." (declare (optimize (speed 3) (safety 0) (space 0) (debug 1))) - ;; It's much faster on SBCL to use the simple method, and trust the - ;; compiler to optimize it. This may be the case on other Lisp - ;; implementations as well. - #+sbcl (mod (expt n exponent) modulus) - #-sbcl (if (some (complement #'integerp) (list n exponent modulus)) - (mod (expt n exponent) modulus) - (loop with result = 1 - for i of-type fixnum from 0 below (integer-length exponent) - for sqr = n then (mod (* sqr sqr) modulus) - when (logbitp i exponent) do - (setf result (mod (* result sqr) modulus)) - finally (return result)))) + ;; It's much faster on SBCL and ACL to use the simple method, and + ;; trust the compiler to optimize it. This may be the case on other + ;; Lisp implementations as well. + #+(or sbcl allegro) (mod (expt n exponent) modulus) + #-(or sbcl allegro) + (if (some (complement #'integerp) (list n exponent modulus)) + (mod (expt n exponent) modulus) + (loop with result = 1 + for i of-type fixnum from 0 below (integer-length exponent) + for sqr = n then (mod (* sqr sqr) modulus) + when (logbitp i exponent) do + (setf result (mod (* result sqr) modulus)) + finally (return result)))) -;; If SBCL is going to expand compiler macros, we should directly -;; inline the simple expansion; this lets SBCL do all sorts of fancy -;; optimizations based on type information that wouldn't be used to -;; optimize the normal EXPT-MOD function. -#+sbcl +;; If the compiler is going to expand compiler macros, we should +;; directly inline the simple expansion; this lets the compiler do all +;; sorts of fancy optimizations based on type information that +;; wouldn't be used to optimize the normal EXPT-MOD function. +#+(or sbcl allegro) (define-compiler-macro expt-mod (n exponent modulus) `(mod (expt ,n ,exponent) ,modulus)) Index: cl-utilities/extremum.lisp diff -u cl-utilities/extremum.lisp:1.7 cl-utilities/extremum.lisp:1.8 --- cl-utilities/extremum.lisp:1.7 Mon Aug 29 22:14:47 2005 +++ cl-utilities/extremum.lisp Mon Nov 28 22:45:49 2005 @@ -48,7 +48,7 @@ (continue () :report "Return NIL instead" nil)) - ,@body))) + (progn ,@body)))) ;; This is an extended version which takes START and END keyword ;; arguments. Any spec-compliant use of EXTREMUM will also work with @@ -56,8 +56,9 @@ (defun extremum (sequence predicate &key (key #'identity) (start 0) end) "Returns the element of SEQUENCE that would appear first if the -sequence were ordered according to SORT using PREDICATE and KEY. See -http://www.cliki.net/EXTREMUM for the full specification." +sequence were ordered according to SORT using PREDICATE and KEY using +an unstable sorting algorithm. See http://www.cliki.net/EXTREMUM for +the full specification." (with-check-length (sequence start end) (reduce (comparator predicate key) sequence :start start :end end))) @@ -89,9 +90,9 @@ (let* ((smallest (elt sequence 0)) (smallest-key (funcall key smallest)) (current-index 0) - (real-end (or end #.(1- most-positive-fixnum)))) - (declare (type (integer 0 #.most-positive-fixnum) - current-index real-end start)) + (real-end (or end (1- most-positive-fixnum)))) + (declare (type (integer 0) current-index real-end start) + (fixnum current-index real-end start)) (map nil #'(lambda (x) (when (<= start current-index real-end) (let ((x-key (funcall key x))) @@ -102,4 +103,64 @@ (setf smallest-key x-key)))) (incf current-index)) sequence) - smallest))) \ No newline at end of file + smallest))) + +;; EXTREMA and N-MOST-EXTREME are based on code and ideas from Tobias +;; C. Rittweiller. They deal with the cases in which you are not +;; looking for a single extreme element, but for the extreme identical +;; elements or the N most extreme elements. + +(defun extrema (sequence predicate &key (key #'identity) (start 0) end) + (with-check-length (sequence start end) + (let* ((sequence (subseq sequence start end)) + (smallest-elements (list (elt sequence 0))) + (smallest-key (funcall key (elt smallest-elements 0)))) + (map nil + #'(lambda (x) + (let ((x-key (funcall key x))) + (cond ((funcall predicate x-key smallest-key) + (setq smallest-elements (list x)) + (setq smallest-key x-key)) + ;; both elements are considered equal if the predicate + ;; returns false for (PRED A B) and (PRED B A) + ((not (funcall predicate smallest-key x-key)) + (push x smallest-elements))))) + (subseq sequence 1)) + ;; We use NREVERSE to make this stable (in the sorting algorithm + ;; sense of the word 'stable'). + (nreverse smallest-elements)))) + + + +(define-condition n-most-extreme-not-enough-elements (warning) + ((n :initarg :n :reader n-most-extreme-not-enough-elements-n + :documentation "The number of elements that need to be returned") + (subsequence :initarg :subsequence + :reader n-most-extreme-not-enough-elements-subsequence + :documentation "The subsequence from which elements +must be taken. This is determined by the sequence and the :start and +:end arguments to N-MOST-EXTREME.")) + (:report (lambda (condition stream) + (with-slots (n subsequence) condition + (format stream "There are not enough elements in the sequence ~S~% to return the ~D most extreme elements" + subsequence n)))) + (:documentation "There are not enough elements in the sequence given +to N-MOST-EXTREME to return the N most extreme elements.")) + +(defun n-most-extreme (n sequence predicate &key (key #'identity) (start 0) end) + "Returns a list of the N elements of SEQUENCE that would appear +first if the sequence were ordered according to SORT using PREDICATE +and KEY with a stable sorting algorithm. If there are less than N +elements in the relevant part of the sequence, this will return all +the elements it can and signal the warning +N-MOST-EXTREME-NOT-ENOUGH-ELEMENTS" + (with-check-length (sequence start end) + ;; This is faster on vectors than on lists. + (let ((sequence (subseq sequence start end))) + (if (> n (length sequence)) + (progn + (warn 'n-most-extreme-not-enough-elements + :n n :subsequence sequence) + (stable-sort (copy-seq sequence) predicate :key key)) + (subseq (stable-sort (copy-seq sequence) predicate :key key) + 0 n))))) \ No newline at end of file Index: cl-utilities/package.lisp diff -u cl-utilities/package.lisp:1.4 cl-utilities/package.lisp:1.5 --- cl-utilities/package.lisp:1.4 Fri Oct 21 23:22:47 2005 +++ cl-utilities/package.lisp Mon Nov 28 22:45:49 2005 @@ -10,6 +10,11 @@ #:extremum #:no-extremum #:extremum-fastkey + #:extrema + #:n-most-extreme + #:n-most-extreme-not-enough-elements + #:n-most-extreme-not-enough-elements-n + #:n-most-extreme-not-enough-elements-subsequence #:read-delimited #:read-delimited-bounds-error Index: cl-utilities/package.sh diff -u cl-utilities/package.sh:1.4 cl-utilities/package.sh:1.5 --- cl-utilities/package.sh:1.4 Mon Aug 29 22:14:47 2005 +++ cl-utilities/package.sh Mon Nov 28 22:45:49 2005 @@ -1,17 +1,17 @@ #!/bin/sh -mkdir cl-utilities-1.1.1 -cp cl-utilities.asd package.sh collecting.lisp expt-mod.lisp package.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.1.1/ +mkdir cl-utilities-1.2 +cp cl-utilities.asd package.sh collecting.lisp split-sequence.lisp expt-mod.lisp package.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.2/ rm -f cl-utilities-latest.tar.gz cl-utilities-latest.tar.gz.asc -tar -czvf cl-utilities-1.1.1.tar.gz cl-utilities-1.1.1/ -ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.1.1.tar.gz ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz -gpg -b -a ~/hacking/lisp/cl-utilities/cl-utilities-1.1.1.tar.gz -ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.1.1.tar.gz.asc ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc -rm -Rf cl-utilities-1.1.1/ +tar -czvf cl-utilities-1.2.tar.gz cl-utilities-1.2/ +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.tar.gz ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz +gpg -b -a ~/hacking/lisp/cl-utilities/cl-utilities-1.2.tar.gz +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.2.tar.gz.asc ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc +rm -Rf cl-utilities-1.2/ -scp cl-utilities-1.1.1.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.1.1.tar.gz -scp cl-utilities-1.1.1.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.1.1.tar.gz.asc +scp cl-utilities-1.2.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.tar.gz +scp cl-utilities-1.2.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.2.tar.gz.asc scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz.asc Index: cl-utilities/test.lisp diff -u cl-utilities/test.lisp:1.6 cl-utilities/test.lisp:1.7 --- cl-utilities/test.lisp:1.6 Fri Oct 21 23:22:47 2005 +++ cl-utilities/test.lisp Mon Nov 28 22:45:49 2005 @@ -47,6 +47,42 @@ 23)) (is (= (extremum-fastkey '(2/3 2 3 4) #'> :key (lambda (x) (/ 1 x))) 2/3))) +(test extrema + (is (tree-equal (extrema '(3 2 1 1 2 1) #'<) + '(1 1 1))) + (is (tree-equal (extrema #(3 2 1 1 2 1) #'<) + '(1 1 1))) + (is (tree-equal (extrema #(3 2 1 1 2 1) #'< :end 4) + '(1 1))) + (is (tree-equal (extrema '(3 2 1 1 2 1) #'< :end 4) + '(1 1))) + (is (tree-equal (extrema #(3 2 1 1 2 1) #'< :start 3 :end 4) + '(1))) + (is (tree-equal (extrema '((A . 3) (B . 1) (C . 2) (D . 1)) #'< :key #'cdr) + '((B . 1) (D . 1))))) + +(defmacro quietly (&body body) + "Perform BODY quietly, muffling any warnings that may arise" + `(handler-bind ((warning #'muffle-warning)) + ,@body)) + +(test n-most-extreme + (is (tree-equal (n-most-extreme 1 '(3 1 2 1) #'>) + '(3))) + (is (tree-equal (n-most-extreme 2 '(3 1 2 1) #'>) + '(3 2))) + (is (tree-equal (n-most-extreme 2 '(3 1 2 1) #'<) + '(1 1))) + (is (tree-equal (n-most-extreme 1 '((A . 3) (B . 1) (C . 2) (D . 1)) #'> :key #'cdr) + '((A . 3)))) + (is (tree-equal (n-most-extreme 2 '((A . 3) (B . 1) (C . 2) (D . 1)) #'< :key #'cdr) + '((B . 1) (D . 1)))) + (is (tree-equal (quietly (n-most-extreme 20 '((A . 3) (B . 1) (C . 2) (D . 1)) #'< :key #'cdr)) + '((B . 1) (D . 1) (C . 2) (A . 3)))) + (is (tree-equal (quietly (n-most-extreme 2 '((A . 3) (B . 1) (C . 2) (D . 1)) #'< :key #'cdr :start 1 :end 2)) + '((B . 1)))) + (signals n-most-extreme-not-enough-elements (n-most-extreme 2 '((A . 3) (B . 1) (C . 2) (D . 1)) #'< :key #'cdr :start 1 :end 2))) + (defun delimited-test (&key (delimiter #\|) (start 0) end (string "foogo|ogreogrjejgierjijri|bar|baz")) (with-input-from-string (str string)

1 0

[cl-utilities-cvs] CVS update: cl-utilities/package.lisp cl-utilities/test.lisp
by pscott＠common-lisp.net 21 Oct '05

21 Oct '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv28127 Modified Files: package.lisp test.lisp Log Message: Fixed symbol export bug involving WITH-COLLECTORS and added test code to ensure that it doesn't happen again. Date: Fri Oct 21 23:22:47 2005 Author: pscott Index: cl-utilities/package.lisp diff -u cl-utilities/package.lisp:1.3 cl-utilities/package.lisp:1.4 --- cl-utilities/package.lisp:1.3 Mon Aug 29 22:14:47 2005 +++ cl-utilities/package.lisp Fri Oct 21 23:22:47 2005 @@ -21,7 +21,7 @@ #:collecting #:collect - #:with-collect + #:with-collectors #:with-unique-names #:with-gensyms Index: cl-utilities/test.lisp diff -u cl-utilities/test.lisp:1.5 cl-utilities/test.lisp:1.6 --- cl-utilities/test.lisp:1.5 Fri May 13 21:45:57 2005 +++ cl-utilities/test.lisp Fri Oct 21 23:22:47 2005 @@ -87,7 +87,14 @@ (is (tree-equal (collecting (labels ((collect-it (x) (collect x))) (mapcar #'collect-it (reverse '(c b a))))) - '(a b c)))) + '(a b c))) + (is (tree-equal (multiple-value-bind (a b) + (with-collectors (x y) + (x 1) + (y 2) + (x 3)) + (append a b)) + '(1 3 2)))) (test with-unique-names (is (equalp (subseq (with-unique-names (foo)

1 0

[cl-utilities-cvs] CVS update: cl-utilities/doc/collecting.html cl-utilities/doc/extremum.html cl-utilities/doc/read-delimited.html cl-utilities/doc/split-sequence.html
by pscott＠common-lisp.net 29 Aug '05

29 Aug '05

Update of /project/cl-utilities/cvsroot/cl-utilities/doc In directory common-lisp.net:/tmp/cvs-serv5304 Added Files: collecting.html extremum.html read-delimited.html split-sequence.html Log Message: Initial commit. Date: Mon Aug 29 22:18:18 2005 Author: pscott

1 0

[cl-utilities-cvs] CVS update: Directory change: cl-utilities/doc
by pscott＠common-lisp.net 29 Aug '05

29 Aug '05

Update of /project/cl-utilities/cvsroot/cl-utilities/doc In directory common-lisp.net:/tmp/cvs-serv4750/doc Log Message: Directory /project/cl-utilities/cvsroot/cl-utilities/doc added to the repository Date: Mon Aug 29 22:15:41 2005 Author: pscott New directory cl-utilities/doc added

1 0

[cl-utilities-cvs] CVS update: cl-utilities/cl-utilities.asd cl-utilities/collecting.lisp cl-utilities/extremum.lisp cl-utilities/package.lisp cl-utilities/package.sh cl-utilities/split-sequence.lisp
by pscott＠common-lisp.net 29 Aug '05

29 Aug '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv4286 Modified Files: cl-utilities.asd collecting.lisp extremum.lisp package.lisp package.sh split-sequence.lisp Log Message: Added split-sequence, made slight changes, updated package.sh to match my current machine. Date: Mon Aug 29 22:14:47 2005 Author: pscott Index: cl-utilities/cl-utilities.asd diff -u cl-utilities/cl-utilities.asd:1.2 cl-utilities/cl-utilities.asd:1.3 --- cl-utilities/cl-utilities.asd:1.2 Thu May 26 22:10:56 2005 +++ cl-utilities/cl-utilities.asd Mon Aug 29 22:14:47 2005 @@ -8,6 +8,7 @@ (defsystem cl-utilities :author "Maintained by Peter Scott" :components ((:file "package") + (:file "split-sequence" :depends-on ("package")) (:file "extremum" :depends-on ("package" "with-unique-names" "once-only")) @@ -21,4 +22,6 @@ (:file "rotate-byte" :depends-on ("package")) (:file "copy-array" :depends-on ("package")) (:file "compose" :depends-on ("package"))) - :depends-on (split-sequence #+sbcl :sb-rotate-byte)) \ No newline at end of file + ;; On SBCL, we can speed up byte rotation by using its + ;; implementation of rotate-byte. + :depends-on (#+sbcl :sb-rotate-byte)) \ No newline at end of file Index: cl-utilities/collecting.lisp diff -u cl-utilities/collecting.lisp:1.2 cl-utilities/collecting.lisp:1.3 --- cl-utilities/collecting.lisp:1.2 Thu May 26 22:16:47 2005 +++ cl-utilities/collecting.lisp Mon Aug 29 22:14:47 2005 @@ -1,5 +1,5 @@ ;; Opinions differ on how a collection macro should work. There are -;; two main points for discussion: multiple collection variables and +;; two major points for discussion: multiple collection variables and ;; implementation method. ;; ;; There are two main ways of implementing collection: sticking Index: cl-utilities/extremum.lisp diff -u cl-utilities/extremum.lisp:1.6 cl-utilities/extremum.lisp:1.7 --- cl-utilities/extremum.lisp:1.6 Thu May 26 21:20:28 2005 +++ cl-utilities/extremum.lisp Mon Aug 29 22:14:47 2005 @@ -19,6 +19,7 @@ &optional (key #'identity)) (if (eql key #'identity) `(lambda (a b) + (declare (optimize (speed 3) (safety 0) (space 0) (debug 1))) (if (funcall ,test a b) a b)) whole)) Index: cl-utilities/package.lisp diff -u cl-utilities/package.lisp:1.2 cl-utilities/package.lisp:1.3 --- cl-utilities/package.lisp:1.2 Thu May 12 23:17:50 2005 +++ cl-utilities/package.lisp Mon Aug 29 22:14:47 2005 @@ -1,5 +1,5 @@ (defpackage :cl-utilities - (:use :common-lisp :split-sequence) + (:use :common-lisp) (:export #:split-sequence #:split-sequence-if #:split-sequence-if-not Index: cl-utilities/package.sh diff -u cl-utilities/package.sh:1.3 cl-utilities/package.sh:1.4 --- cl-utilities/package.sh:1.3 Thu May 26 22:29:24 2005 +++ cl-utilities/package.sh Mon Aug 29 22:14:47 2005 @@ -1,17 +1,17 @@ #!/bin/sh -mkdir cl-utilities-1.1 -cp cl-utilities.asd package.sh collecting.lisp expt-mod.lisp package.lisp split-sequence.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.1/ +mkdir cl-utilities-1.1.1 +cp cl-utilities.asd package.sh collecting.lisp expt-mod.lisp package.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.1.1/ rm -f cl-utilities-latest.tar.gz cl-utilities-latest.tar.gz.asc -tar -czvf cl-utilities-1.1.tar.gz cl-utilities-1.1/ -ln -s /root/lisp/cl-utilities/cl-utilities-1.1.tar.gz /root/lisp/cl-utilities/cl-utilities-latest.tar.gz -/usr/bin/xterm -e gpg -b -a /root/lisp/cl-utilities/cl-utilities-1.1.tar.gz -ln -s /root/lisp/cl-utilities/cl-utilities-1.1.tar.gz.asc /root/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc -rm -Rf cl-utilities-1.1/ +tar -czvf cl-utilities-1.1.1.tar.gz cl-utilities-1.1.1/ +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.1.1.tar.gz ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz +gpg -b -a ~/hacking/lisp/cl-utilities/cl-utilities-1.1.1.tar.gz +ln -s ~/hacking/lisp/cl-utilities/cl-utilities-1.1.1.tar.gz.asc ~/hacking/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc +rm -Rf cl-utilities-1.1.1/ -scp cl-utilities-1.1.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.1.tar.gz -scp cl-utilities-1.1.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.1.tar.gz.asc +scp cl-utilities-1.1.1.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.1.1.tar.gz +scp cl-utilities-1.1.1.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.1.1.tar.gz.asc scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz -scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz.asc \ No newline at end of file +scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz.asc Index: cl-utilities/split-sequence.lisp diff -u cl-utilities/split-sequence.lisp:1.1.1.1 cl-utilities/split-sequence.lisp:1.2 --- cl-utilities/split-sequence.lisp:1.1.1.1 Mon May 9 23:26:29 2005 +++ cl-utilities/split-sequence.lisp Mon Aug 29 22:14:47 2005 @@ -50,6 +50,13 @@ ;;; * (split-sequence #\; ";oo;bar;ba;" :start 1 :end 9) ;;; -> ("oo" "bar" "b"), 9 +;; cl-utilities note: the license of this file is unclear, and I don't +;; even know whom to contact to clarify it. If anybody objects to my +;; assumption that it is public domain, please contact me so I can do +;; something about it. Previously I required the split-sequence + ; package as a dependency, but that was so unwieldy that it was *the* +;; sore spot sticking out in the design of cl-utilities. -Peter Scott + (in-package :cl-utilities) (defun split-sequence (delimiter seq &key (count nil) (remove-empty-subseqs nil) (from-end nil) (start 0) (end nil) (test nil test-supplied) (test-not nil test-not-supplied) (key nil key-supplied)) @@ -168,7 +175,7 @@ of this function; :from-end values of NIL and T are equivalent unless :count is supplied. The second return value is an index suitable as an argument to CL:SUBSEQ into the sequence indicating where processing -stopped." +stopped." ; Emacs syntax highlighting is broken, and this helps: " (let ((len (length seq)) (other-keys (when key-supplied (list :key key))))

1 0

[cl-utilities-cvs] CVS update: cl-utilities/package.sh
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv7761 Modified Files: package.sh Log Message: Updated version number Date: Thu May 26 22:29:24 2005 Author: pscott Index: cl-utilities/package.sh diff -u cl-utilities/package.sh:1.2 cl-utilities/package.sh:1.3 --- cl-utilities/package.sh:1.2 Tue May 17 21:30:09 2005 +++ cl-utilities/package.sh Thu May 26 22:29:24 2005 @@ -1,17 +1,17 @@ #!/bin/sh -mkdir cl-utilities-1.0.2 -cp cl-utilities.asd package.sh collecting.lisp expt-mod.lisp package.lisp split-sequence.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.0.2/ +mkdir cl-utilities-1.1 +cp cl-utilities.asd package.sh collecting.lisp expt-mod.lisp package.lisp split-sequence.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.1/ rm -f cl-utilities-latest.tar.gz cl-utilities-latest.tar.gz.asc -tar -czvf cl-utilities-1.0.2.tar.gz cl-utilities-1.0.2/ -ln -s /root/lisp/cl-utilities/cl-utilities-1.0.2.tar.gz /root/lisp/cl-utilities/cl-utilities-latest.tar.gz -/usr/bin/xterm -e gpg -b -a /root/lisp/cl-utilities/cl-utilities-1.0.2.tar.gz -ln -s /root/lisp/cl-utilities/cl-utilities-1.0.2.tar.gz.asc /root/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc -rm -Rf cl-utilities-1.0.2/ +tar -czvf cl-utilities-1.1.tar.gz cl-utilities-1.1/ +ln -s /root/lisp/cl-utilities/cl-utilities-1.1.tar.gz /root/lisp/cl-utilities/cl-utilities-latest.tar.gz +/usr/bin/xterm -e gpg -b -a /root/lisp/cl-utilities/cl-utilities-1.1.tar.gz +ln -s /root/lisp/cl-utilities/cl-utilities-1.1.tar.gz.asc /root/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc +rm -Rf cl-utilities-1.1/ -scp cl-utilities-1.0.2.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.0.2.tar.gz -scp cl-utilities-1.0.2.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.0.2.tar.gz.asc +scp cl-utilities-1.1.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.1.tar.gz +scp cl-utilities-1.1.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.1.tar.gz.asc scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz.asc

1 0

[cl-utilities-cvs] CVS update: cl-utilities/copy-array.lisp
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv7681 Modified Files: copy-array.lisp Log Message: Factored out part of COPY-ARRAY into its own function. Date: Thu May 26 22:24:24 2005 Author: pscott Index: cl-utilities/copy-array.lisp diff -u cl-utilities/copy-array.lisp:1.1.1.1 cl-utilities/copy-array.lisp:1.2 --- cl-utilities/copy-array.lisp:1.1.1.1 Mon May 9 23:26:29 2005 +++ cl-utilities/copy-array.lisp Thu May 26 22:24:24 2005 @@ -7,19 +7,23 @@ unless UNDISPLACE is non-NIL, in which case the contents of the array will be copied into a completely new, not displaced, array." (declare (type array array)) - (let ((copy - (apply #'make-array - (list* (array-dimensions array) - :element-type (array-element-type array) - :adjustable (adjustable-array-p array) - :fill-pointer (when (array-has-fill-pointer-p array) - (fill-pointer array)) - (multiple-value-bind (displacement offset) - (array-displacement array) - (when (and displacement (not undisplace)) - (list :displaced-to displacement - :displaced-index-offset offset))))))) + (let ((copy (%make-array-with-same-properties array undisplace))) (unless (array-displacement copy) (dotimes (n (array-total-size copy)) (setf (row-major-aref copy n) (row-major-aref array n)))) - copy)) \ No newline at end of file + copy)) + +(defun %make-array-with-same-properties (array undisplace) + "Make an array with the same properties (size, adjustability, etc.) +as another array, optionally undisplacing the array." + (apply #'make-array + (list* (array-dimensions array) + :element-type (array-element-type array) + :adjustable (adjustable-array-p array) + :fill-pointer (when (array-has-fill-pointer-p array) + (fill-pointer array)) + (multiple-value-bind (displacement offset) + (array-displacement array) + (when (and displacement (not undisplace)) + (list :displaced-to displacement + :displaced-index-offset offset)))))) \ No newline at end of file

1 0

[cl-utilities-cvs] CVS update: cl-utilities/collecting.lisp
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv7621 Modified Files: collecting.lisp Log Message: Refactored, moved things around, improved error handling, and generally improved things. Date: Thu May 26 22:16:47 2005 Author: pscott Index: cl-utilities/collecting.lisp diff -u cl-utilities/collecting.lisp:1.1.1.1 cl-utilities/collecting.lisp:1.2 --- cl-utilities/collecting.lisp:1.1.1.1 Mon May 9 23:26:29 2005 +++ cl-utilities/collecting.lisp Thu May 26 22:16:47 2005 @@ -1,5 +1,3 @@ -(in-package :cl-utilities) - ;; Opinions differ on how a collection macro should work. There are ;; two main points for discussion: multiple collection variables and ;; implementation method. @@ -14,11 +12,11 @@ ;; it always uses the COLLECT function. If you want to collect into ;; multiple lists, use the WITH-COLLECT macro. - +(in-package :cl-utilities) ;; This should only be called inside of COLLECTING macros, but we ;; define it here to provide an informative error message and to make -;; it easier for SLIME (et al) to get documentation for the COLLECT +;; it easier for SLIME (et al.) to get documentation for the COLLECT ;; function when it's used in the COLLECTING macro. (defun collect (thing) "Collect THING in the context established by the COLLECTING macro" @@ -40,27 +38,13 @@ ,@body) ,collector))) -#+nil -(collecting - (dotimes (x 10) - (collect x))) - -;(collecting (mapc #'collect '(1 2 3 4 5))) - (defmacro with-collectors ((&rest collectors) &body body) "Collect some things into lists forwards. The names in COLLECTORS are defined as local functions which each collect into a separate list. Returns as many values as there are collectors, in the order they were given." - ;; Check that all of the COLLECTORS are symbols. If not, raise an error. - (let ((bad-collector (find-if-not #'symbolp collectors))) - (when bad-collector - (error "WITH-COLLECTORS expected a symbol but got ~S" bad-collector))) - (let ((gensyms-alist (mapcar #'cons collectors - (mapcar #'gensym - (mapcar #'(lambda (x) - (format nil "~A-TAIL-" x)) - collectors))))) + (%with-collectors-check-collectors collectors) + (let ((gensyms-alist (%with-collectors-gensyms-alist collectors))) `(let ,(loop for collector in collectors for tail = (cdr (assoc collector gensyms-alist)) nconc (list collector tail)) @@ -75,10 +59,26 @@ ,@body) (values ,@collectors)))) -#+nil -(with-collectors (one-through-nine abc) - (mapcar #'abc '(a b c)) - (dotimes (x 10) - (one-through-nine x) - (print one-through-nine)) - (terpri) (terpri)) \ No newline at end of file +(defun %with-collectors-check-collectors (collectors) + "Check that all of the COLLECTORS are symbols. If not, raise an error." + (let ((bad-collector (find-if-not #'symbolp collectors))) + (when bad-collector + (error 'type-error + :datum bad-collector + :expected-type 'symbol)))) + +(defun %with-collectors-gensyms-alist (collectors) + "Return an alist mapping the symbols in COLLECTORS to gensyms" + (mapcar #'cons collectors + (mapcar (compose #'gensym + #'(lambda (x) + (format nil "~A-TAIL-" x))) + collectors))) + +;; Some test code which would be too hard to move to the test suite. +#+nil (with-collectors (one-through-nine abc) + (mapcar #'abc '(a b c)) + (dotimes (x 10) + (one-through-nine x) + (print one-through-nine)) + (terpri) (terpri)) \ No newline at end of file

1 0

[cl-utilities-cvs] CVS update: cl-utilities/cl-utilities.asd
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv6732 Modified Files: cl-utilities.asd Log Message: Added dependency for COMPOSE used in macroexpander code in WITH-COLLECTORS Date: Thu May 26 22:10:56 2005 Author: pscott Index: cl-utilities/cl-utilities.asd diff -u cl-utilities/cl-utilities.asd:1.1.1.1 cl-utilities/cl-utilities.asd:1.2 --- cl-utilities/cl-utilities.asd:1.1.1.1 Mon May 9 23:26:29 2005 +++ cl-utilities/cl-utilities.asd Thu May 26 22:10:56 2005 @@ -8,11 +8,15 @@ (defsystem cl-utilities :author "Maintained by Peter Scott" :components ((:file "package") - (:file "extremum" :depends-on ("package")) + (:file "extremum" :depends-on ("package" + "with-unique-names" + "once-only")) (:file "read-delimited" :depends-on ("package")) (:file "expt-mod" :depends-on ("package")) (:file "with-unique-names" :depends-on ("package")) - (:file "collecting" :depends-on ("package" "with-unique-names")) + (:file "collecting" :depends-on ("package" + "with-unique-names" + "compose")) (:file "once-only" :depends-on ("package")) (:file "rotate-byte" :depends-on ("package")) (:file "copy-array" :depends-on ("package"))

1 0

[cl-utilities-cvs] CVS update: cl-utilities/with-unique-names.lisp
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv5859 Modified Files: with-unique-names.lisp Log Message: Refactored and improved type checking. Date: Thu May 26 22:00:00 2005 Author: pscott Index: cl-utilities/with-unique-names.lisp diff -u cl-utilities/with-unique-names.lisp:1.3 cl-utilities/with-unique-names.lisp:1.4 --- cl-utilities/with-unique-names.lisp:1.3 Mon May 16 21:12:00 2005 +++ cl-utilities/with-unique-names.lisp Thu May 26 22:00:00 2005 @@ -6,17 +6,21 @@ "Executes a series of forms with each var bound to a fresh, uninterned symbol. See http://www.cliki.net/WITH-UNIQUE-NAMES" `(let ,(mapcar #'(lambda (binding) - (destructuring-bind (var prefix) - (if (consp binding) - binding - (list binding binding)) - (if (symbolp var) - `(,var (gensym ,(format nil "~A" prefix))) - (error 'type-error - :datum var - :expected-type 'symbol)))) + (multiple-value-bind (var prefix) + (%with-unique-names-binding-parts binding) + (check-type var symbol) + `(,var (gensym ,(format nil "~A" + (or prefix var)))))) bindings) ,@body)) + +(defun %with-unique-names-binding-parts (binding) + "Return (values var prefix) from a WITH-UNIQUE-NAMES binding +form. If PREFIX is not given in the binding, NIL is returned to +indicate that the default should be used." + (if (consp binding) + (values (first binding) (second binding)) + (values binding nil))) (define-condition list-binding-not-supported (warning) ((binding :initarg :binding :reader list-binding-not-supported-binding))

1 0

[cl-utilities-cvs] CVS update: cl-utilities/once-only.lisp
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv5783 Modified Files: once-only.lisp Log Message: Switched to %foo naming convention for auxilliary functions. Date: Thu May 26 21:47:53 2005 Author: pscott Index: cl-utilities/once-only.lisp diff -u cl-utilities/once-only.lisp:1.2 cl-utilities/once-only.lisp:1.3 --- cl-utilities/once-only.lisp:1.2 Thu May 26 21:09:05 2005 +++ cl-utilities/once-only.lisp Thu May 26 21:47:53 2005 @@ -7,7 +7,7 @@ (in-package :cl-utilities) -(defun check-once-only-names (names) +(defun %check-once-only-names (names) "Check that all of the NAMES are symbols. If not, raise an error." ;; This only raises an error for the first non-symbol argument ;; found. While this won't report multiple errors, it is probably @@ -18,7 +18,7 @@ (defmacro once-only (names &body body) ;; Check the NAMES list for validity. - (check-once-only-names names) + (%check-once-only-names names) ;; Do not touch this code unless you really know what you're doing. (let ((gensyms (loop for name in names collect (gensym (string name))))) `(let (,@(loop for g in gensyms

1 0

[cl-utilities-cvs] CVS update: cl-utilities/read-delimited.lisp
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv5758 Modified Files: read-delimited.lisp Log Message: Major refactoring. It now does exactly the same thing as it used to, but now it does it in such a way that I'm not afraid of its source code. Date: Thu May 26 21:46:46 2005 Author: pscott Index: cl-utilities/read-delimited.lisp diff -u cl-utilities/read-delimited.lisp:1.1.1.1 cl-utilities/read-delimited.lisp:1.2 --- cl-utilities/read-delimited.lisp:1.1.1.1 Mon May 9 23:26:29 2005 +++ cl-utilities/read-delimited.lisp Thu May 26 21:46:46 2005 @@ -1,5 +1,25 @@ (in-package :cl-utilities) +(defun read-delimited (sequence stream &key (start 0) end + (delimiter #\Newline) (test #'eql) (key #'identity)) + ;; Check bounds on SEQUENCE + (multiple-value-setq (start end) + (%read-delimited-bounds-check sequence start end)) + ;; Loop until we run out of input characters or places to put them, + ;; or until we encounter the delimiter. + (loop for index from start + for char = (read-char stream nil nil) + for test-result = (funcall test (funcall key char) delimiter) + while (and char + (< index end) + (not test-result)) + do (setf (elt sequence index) char) + finally (return-from read-delimited + (values index test-result)))) + +;; Conditions +;;;;;;;;;;;;; + (define-condition read-delimited-bounds-error (error) ((start :initarg :start :reader read-delimited-bounds-error-start) (end :initarg :end :reader read-delimited-bounds-error-end) @@ -11,41 +31,48 @@ (:documentation "There's a problem with the indices START and END for SEQUENCE. See CLHS SUBSEQ-OUT-OF-BOUNDS:IS-AN-ERROR issue.")) -(defun read-delimited (sequence stream &key (start 0) end - (delimiter #\Newline) (test #'eql) key) - ;; Check to make sure END is in bounds - (when (and end (> end (length sequence))) +;; Error checking for bounds +;;;;;;;;;;;;;;;;;;;;;;;;;;;; + +(defun %read-delimited-bounds-check (sequence start end) + "Check to make sure START and END are in bounds when calling +READ-DELIMITED with SEQUENCE" + (check-type start (or integer null)) + (check-type end (or integer null)) + (let ((start (%read-delimited-bounds-check-start sequence start end)) + (end (%read-delimited-bounds-check-end sequence start end))) + ;; Returns (values start end) + (%read-delimited-bounds-check-order sequence start end))) + +(defun %read-delimited-bounds-check-order (sequence start end) + "Check the order of START and END bounds, and return them in the +correct order." + (when (< end start) (restart-case (error 'read-delimited-bounds-error :start start :end end :sequence sequence) (continue () - :report "Use default instead" - (setf end nil)))) - ;; Check to make sure START is in bounds + :report "Switch start and end" + (rotatef start end)))) + (values start end)) + +(defun %read-delimited-bounds-check-start (sequence start end) + "Check to make sure START is in bounds when calling READ-DELIMITED +with SEQUENCE" (when (and start (< start 0)) (restart-case (error 'read-delimited-bounds-error :start start :end end :sequence sequence) (continue () - :report "Use default instead" + :report "Use default for START instead" (setf start 0)))) - (let ((key (or key #'identity)) - (end (or end (length sequence)))) - ;; START and END should be positive integers by now - (check-type start unsigned-byte) - (check-type end unsigned-byte) - ;; Check to make sure that START < END - (when (< end start) - (restart-case (error 'read-delimited-bounds-error - :start start :end end :sequence sequence) - (continue () - :report "Switch start and end" - (rotatef start end)))) - ;; Actually do the looping - (loop for index from start - for char = (read-char stream nil nil) - for test-result = (funcall test (funcall key char) delimiter) - while (and char - (< index end) - (not test-result)) - do (setf (elt sequence index) char) - finally (return-from read-delimited - (values index test-result))))) \ No newline at end of file + start) + +(defun %read-delimited-bounds-check-end (sequence start end) + "Check to make sure END is in bounds when calling READ-DELIMITED +with SEQUENCE" + (when (and end (> end (length sequence))) + (restart-case (error 'read-delimited-bounds-error + :start start :end end :sequence sequence) + (continue () + :report "Use default for END instead" + (setf end nil)))) + (or end (length sequence))) \ No newline at end of file

1 0

[cl-utilities-cvs] CVS update: cl-utilities/extremum.lisp
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv3996 Modified Files: extremum.lisp Log Message: Updated and improved documentation Date: Thu May 26 21:20:28 2005 Author: pscott Index: cl-utilities/extremum.lisp diff -u cl-utilities/extremum.lisp:1.5 cl-utilities/extremum.lisp:1.6 --- cl-utilities/extremum.lisp:1.5 Tue May 17 21:17:34 2005 +++ cl-utilities/extremum.lisp Thu May 26 21:20:28 2005 @@ -22,6 +22,11 @@ (if (funcall ,test a b) a b)) whole)) +;; The normal way of testing the if length of a proper sequence equals +;; zero is to just use (zerop (length sequence)). And, while some +;; implementations may optimize this, it's probably a good idea to +;; just write an optimized version and use it. This method can speed +;; up list length testing. (defun zero-length-p (sequence) "Is the length of SEQUENCE equal to zero?" (declare (optimize (speed 3) (safety 0) (space 0) (debug 1))) @@ -51,9 +56,7 @@ &key (key #'identity) (start 0) end) "Returns the element of SEQUENCE that would appear first if the sequence were ordered according to SORT using PREDICATE and KEY. See -http://www.cliki.net/EXTREMUM for the full -specification. Additionally, START and END specify the beginning and -ending indices of the part of the sequence we should look at." +http://www.cliki.net/EXTREMUM for the full specification." (with-check-length (sequence start end) (reduce (comparator predicate key) sequence :start start :end end))) @@ -68,15 +71,6 @@ (reduce (comparator ,predicate) ,sequence :start ,start :end ,end)))) whole)) - -;; And, for backup, here's a strictly spec-compliant version. -#+nil -(defun extremum (sequence predicate &key (key #'identity)) - "Returns the element of SEQUENCE that would appear first if the -sequence were ordered according to SORT using PREDICATE and KEY. See -http://www.cliki.net/EXTREMUM for the full specification." - (with-check-length (sequence 0 nil) - (reduce (comparator predicate key) sequence))) ;; This is an "optimized" version which calls KEY less. REDUCE is ;; already so optimized that this will actually be slower unless KEY

1 0

[cl-utilities-cvs] CVS update: cl-utilities/compose.lisp
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv3117 Modified Files: compose.lisp Log Message: Added some commentary on single and multiple values. Date: Thu May 26 21:11:52 2005 Author: pscott Index: cl-utilities/compose.lisp diff -u cl-utilities/compose.lisp:1.3 cl-utilities/compose.lisp:1.4 --- cl-utilities/compose.lisp:1.3 Fri May 13 21:17:38 2005 +++ cl-utilities/compose.lisp Thu May 26 21:11:51 2005 @@ -1,3 +1,7 @@ +;; This version of COMPOSE can only handle functions which take one +;; value and return one value. There are other ways of writing +;; COMPOSE, but this is the most commonly used. + (in-package :cl-utilities) ;; This is really slow and conses a lot. Fortunately we can speed it

1 0

[cl-utilities-cvs] CVS update: cl-utilities/once-only.lisp
by pscott＠common-lisp.net 26 May '05

26 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv3083 Modified Files: once-only.lisp Log Message: Factored out error checking Date: Thu May 26 21:09:05 2005 Author: pscott Index: cl-utilities/once-only.lisp diff -u cl-utilities/once-only.lisp:1.1.1.1 cl-utilities/once-only.lisp:1.2 --- cl-utilities/once-only.lisp:1.1.1.1 Mon May 9 23:26:29 2005 +++ cl-utilities/once-only.lisp Thu May 26 21:09:05 2005 @@ -7,11 +7,18 @@ (in-package :cl-utilities) -(defmacro once-only ((&rest names) &body body) - ;; Check that all of the NAMES are symbols. If not, raise an error. +(defun check-once-only-names (names) + "Check that all of the NAMES are symbols. If not, raise an error." + ;; This only raises an error for the first non-symbol argument + ;; found. While this won't report multiple errors, it is probably + ;; more convenient to only report one. (let ((bad-name (find-if-not #'symbolp names))) (when bad-name - (error "ONCE-ONLY expected a symbol but got ~S" bad-name))) + (error "ONCE-ONLY expected a symbol but got ~S" bad-name)))) + +(defmacro once-only (names &body body) + ;; Check the NAMES list for validity. + (check-once-only-names names) ;; Do not touch this code unless you really know what you're doing. (let ((gensyms (loop for name in names collect (gensym (string name))))) `(let (,@(loop for g in gensyms

1 0

[cl-utilities-cvs] CVS update: cl-utilities/package.sh
by pscott＠common-lisp.net 17 May '05

17 May '05

Update of /project/cl-utilities/cvsroot/cl-utilities In directory common-lisp.net:/tmp/cvs-serv25204 Modified Files: package.sh Log Message: Fixed symlink bug Date: Tue May 17 21:30:09 2005 Author: pscott Index: cl-utilities/package.sh diff -u cl-utilities/package.sh:1.1.1.1 cl-utilities/package.sh:1.2 --- cl-utilities/package.sh:1.1.1.1 Mon May 9 23:26:29 2005 +++ cl-utilities/package.sh Tue May 17 21:30:09 2005 @@ -1,15 +1,17 @@ #!/bin/sh -mkdir cl-utilities-1.0 -cp cl-utilities.asd package.sh collecting.lisp expt-mod.lisp package.lisp split-sequence.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.0/ +mkdir cl-utilities-1.0.2 +cp cl-utilities.asd package.sh collecting.lisp expt-mod.lisp package.lisp split-sequence.lisp compose.lisp extremum.lisp read-delimited.lisp test.lisp copy-array.lisp once-only.lisp rotate-byte.lisp with-unique-names.lisp README cl-utilities-1.0.2/ -tar -czvf cl-utilities-1.0.tar.gz cl-utilities-1.0/ -ln -s /root/lisp/cl-utilities/cl-utilities-1.0.tar.gz /root/lisp/cl-utilities/cl-utilities-latest.tar.gz -/usr/bin/xterm -e gpg -b -a /root/lisp/cl-utilities/cl-utilities-1.0.tar.gz -ln -s /root/lisp/cl-utilities/cl-utilities-1.0.tar.gz.asc /root/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc -rm -Rf cl-utilities-1.0/ +rm -f cl-utilities-latest.tar.gz cl-utilities-latest.tar.gz.asc -scp cl-utilities-1.0.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.0.tar.gz -scp cl-utilities-1.0.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.0.tar.gz.asc +tar -czvf cl-utilities-1.0.2.tar.gz cl-utilities-1.0.2/ +ln -s /root/lisp/cl-utilities/cl-utilities-1.0.2.tar.gz /root/lisp/cl-utilities/cl-utilities-latest.tar.gz +/usr/bin/xterm -e gpg -b -a /root/lisp/cl-utilities/cl-utilities-1.0.2.tar.gz +ln -s /root/lisp/cl-utilities/cl-utilities-1.0.2.tar.gz.asc /root/lisp/cl-utilities/cl-utilities-latest.tar.gz.asc +rm -Rf cl-utilities-1.0.2/ + +scp cl-utilities-1.0.2.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.0.2.tar.gz +scp cl-utilities-1.0.2.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-1.0.2.tar.gz.asc scp cl-utilities-latest.tar.gz pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz scp cl-utilities-latest.tar.gz.asc pscott@common-lisp.net:/project/cl-utilities/public_html/cl-utilities-latest.tar.gz.asc

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

cl-utilities-cvs