September 2009 - alexandria-devel - mailman3.common-lisp.net

[alexandria-devel] Review cycle 2: SWITCH, ESCWITCH, and CSWITCH
by Nikodemus Siivola 08 Apr '10

08 Apr '10

macro switch ((object &key test key) &body clauses) "Evaluates first matching clause, returning its values, or evaluates and returns the values of DEFAULT if no keys match." macro eswitch ((object &key test key) &body clauses) "Like SWITCH, but signals an error if no key matches." cswitch ((object &key test key) &body clauses) "Like SWITCH, but signals a continuable error if no key matches."

8 23

[alexandria-devel] cdr assoc (now called alist-get)
by John Fremlin 25 Nov '09

25 Nov '09

For http://common-lisp.net/project/cl-irregsexp/ and in fact for many other projects, it is quite handy to have a way of storing key value pairs in a table that is more lightweight than a hashtable, and that preserves ordering. The obvious way to do it in Lisp is to store a list like '((key0 . value0) (key1 . value1) ...) However in the ANSI standard there is no easy way to implement (setf (gethash key table) value). (cdr (assoc ...)) is sufficient for lookup. To that end there is commonly available in extensions a (setf cdr-assoc). I posted one to the list before but I had managed to mangle it utterly in my last edit of it and it didn't work. I hope that was why you Alexandrians ignored me . . . Anyway, one problem with cdr-assoc is that the order of parameters is apparently non-standard. To alleviate this problem I have come back with a new name, alist-get and also ralist-get (for cdr-rassoc, the (value.key) convention). Feedback very much appreciated! (declaim (inline racons)) (defun racons (key value ralist) (acons value key ralist)) (macrolet ((define-alist-get (name get-pair get-value-from-pair add) `(progn (declaim (inline ,name)) (defun ,name (alist key &key (test 'eql)) (let ((pair (,get-pair key alist :test test))) (values (,get-value-from-pair pair) pair))) (define-setf-expander ,name (place key &key (test ''eql) &environment env) (multiple-value-bind (dummies vals newvals setter getter) (get-setf-expansion place env) (when (cdr newvals) (error "~A cannot store multiple values in one place" ',name)) (with-unique-names (store key-val test-val alist found) (values `(,@dummies ,key-val ,test-val) `(,@vals ,key ,test) (list store) `(let ((,alist ,getter)) (let ((,found (,',get-pair ,key-val ,alist :test ,test-val))) (cond (,found (setf (,',get-value-from-pair ,found) ,store)) (t (let ,newvals (setf ,(first newvals) (,',add ,key ,store ,alist)) ,setter))) ,store)) `(,',name ,getter ,key)))))))) (define-alist-get alist-get assoc cdr acons) (define-alist-get ralist-get rassoc car racons))

3 6

[alexandria-devel] inline
by Faré 09 Oct '09

09 Oct '09

To compile alexandria with the latest CCL, I had to move sequence-of-length-p near the top of sequences.lisp (just below the declaim) least the local (declare (inline ...)) of it would cause CCL to bork, complaining that you're trying to inline a function that hasn't been defined yet. I believe that CCL is justified in complaining and that alexandria upstream should be modified similarly. [ François-René ÐVB Rideau | Reflection&Cybernethics | http://fare.tunes.org ] Down to Gehenna or up to the Throne, He travels the fastest who travels alone. -- Rudyard Kipling

3 3

[alexandria-devel] darcs patch: Add #.#+ readtime conditional functions.
by asf＠boinkor.net 02 Oct '09

02 Oct '09

Mon Oct 16 10:00:31 CEST 2006 asf(a)boinkor.net * Add #.#+ readtime conditional functions. * This adds functions that can be used in #+#. readtime conditionals, for example: #+#.(alexandria:read-if (find-package :asdf-install)) :yay #+#.(alexandria:read-if-fbound :install :asdf-install :exportedp t) :yay * included in the patch is a commented-out portion that allows the user to activate a #? read syntax. I'm not sure if that fits into the conservativism constraints.

3 3

[alexandria-devel] i can't drive darcs
by Nikodemus Siivola 16 Sep '09

16 Sep '09

Which is embarrassing, but true. Since Alexandria is the only project I'm involved with that uses Darcs, this means every time I have 15 minutes to spend on Alexandria I find it gone trying to figure out how to get Darcs to do --whatever--. I would much prefer _anything_ else, just to get things done. Plain tarballs, CVS, SVN, Git. Git would be my personal preference, but I can live with any of the above. Alternatively, I can just find the time to learn Darcs... How do others feel? I should note that while I have occasionally expressed gripes against Darcs, the issue here is _not_ Darcs, but rather my own limited skillset and time. Cheers, -- Nikodemus

3 2

[alexandria-devel] median function
by Johan Ur Riise 16 Sep '09

16 Sep '09

If you want this: CL-USER> (float (alexandria:median '(1 2 3 4))) 2.5 CL-USER> (alexandria:median '(100 0 99 1 98 2 97 96)) 193/2 Then you need this patch (the test is also wrong): johan@perle:~/prg/cllibs/alexandria$ darcs diff -u diff -rN -u old-alexandria/numbers.lisp new-alexandria/numbers.lisp --- old-alexandria/numbers.lisp 2009-09-12 01:24:20.000000000 +0200 +++ new-alexandria/numbers.lisp 2009-09-12 01:24:20.000000000 +0200 @@ -97,7 +97,7 @@ (middle (truncate length 2))) (if (oddp length) (aref vector middle) - (/ (+ (aref vector middle) (aref vector (1+ middle))) 2)))) + (/ (+ (aref vector middle) (aref vector (1- middle))) 2)))) (declaim (inline variance)) (defun variance (sample &key (biased t)) diff -rN -u old-alexandria/tests.lisp new-alexandria/tests.lisp --- old-alexandria/tests.lisp 2009-09-12 01:24:20.000000000 +0200 +++ new-alexandria/tests.lisp 2009-09-12 01:24:20.000000000 +0200 @@ -855,7 +855,7 @@ (deftest median.2 (median '(100 0 99 1 98 2 97 96)) - 195/2) + 193/2) (deftest variance.1 (variance (list 1 2 3)) johan@perle:~/prg/cllibs/alexandria$

2 1