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

Alexandria version in ASD file
by Michał "phoe" Herda 15 Aug '17

15 Aug '17

The ASD file for Alexandria mentions that is has version "0.0.0", which is crazy to have for the most popular Quicklisp library and perhaps the most famous Lisp one. https://github.com/keithj/alexandria/blob/master/alexandria.asd#L2 I call for this to be fixed. ~phoe

3 4

[Alexandria-devel] add COPY-STREAM-CONTENT-INTO-{STRING, BYTE-VECTOR}?
by Jan Moringen 14 Aug '17

14 Aug '17

Hi, in my experience, READ-FILE-INTO-{STRING,BYTE-VECTOR} are very handy. However, maybe half of the time I already receive an open stream and need something like R-F-I-{S,B-V} but for streams. I already submitted the attached patch in mid 2012. Nikodemus didn't want to introduce new functions at that time. Please consider it again. The patch adds the functions COPY-STREAM-CONTENT-INTO-{STRING,BYTE-VECTOR} which implement this feature. Despite the new toplevel functions, little new code is introduced since R-F-I-{S,B-V} can be implemented in terms of the new functions. Thanks in advance and kind regards, Jan

2 3

Wrong handling of duplicate keys in alist-hash-table and plist-hash-table
by Christoph Arenz 10 Apr '17

10 Apr '17

Hi there, apparently for association lists, it is possible to have 'new' entries in front of the list 'shadow' old entries. See https://www.cs.cmu.edu/Groups/AI/html/cltl/clm/node153.html However, the Alexandria function alists-hash-table does not account for this behavior when transforming an a-list to a hash-table. There is no checking for duplicate keys in an a-list, resulting in the 'older' entries finding their way in the resulting hash-table. Similar is for p-lists and the plist-hash-table function, though I found contradicting statements whether duplicate keys are allowed for those. At least the hyperspec explains that in case of multiple pairs, the first key/value pair defines the property. See http://www.lispworks.com/documentation/HyperSpec/Body/26_glo_p.htm#property… CL-USER> alist ((:ONE 1) (:TWO 2) (:ONE :SURPRISE)) CL-USER> (assoc :one alist) (:ONE 1) CL-USER> (gethash :one (alexandria:alist-hash-table alist)) (:SURPRISE) T Thanks for your consideration! Kind Regards, Christoph Arenz

2 1

[PATCH] Add PARTIAL-APPLY and REVERSE-PARTIAL-APPLY as aliases for CURRY and RCURRY, respectively
by Smith Dhumbumroong 25 Jan '17

25 Jan '17

Hello, Following the discussion in the following mailing list threads: [0] and [1], as well as the conclusion reached in this [2] email, I've attached a patch which adds PARTIAL-APPLY and REVERSE-PARTIAL-APPLY function as aliases/synonyms for CURRY and RCURRY function, respectively. In addition, the patch also adds tests for the 2 new functions. I've tested the new functions and ran the test suite, and have found no issue so far. I hope that this patch will be useful. If I have made any mistakes, please don't hesitate to point them out to me. Best regards, Smith Dhumbumroong [0] http://www.mail-archive.com/alexandria-devel@common-lisp.net/msg00199.html [1] https://www.mail-archive.com/alexandria-devel@common-lisp.net/msg00417.html [2] https://www.mail-archive.com/alexandria-devel@common-lisp.net/msg00419.html

2 1

[PATCH] Fix typos in XOR docstring and WITH-{INPUT-FROM,OUTPUT-TO}-FILE error messages
by Steve Losh 22 Nov '16

22 Nov '16

--- control-flow.lisp | 2 +- io.lisp | 4 ++-- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/control-flow.lisp b/control-flow.lisp index f262443..27a2915 100644 --- a/control-flow.lisp +++ b/control-flow.lisp @@ -68,7 +68,7 @@ returns the values of DEFAULT if no keys match." ,(expand possibilities 0 random-number))))))) (defmacro xor (&rest datums) - "Evaluates its arguments one at a time, from left to right. If more then one + "Evaluates its arguments one at a time, from left to right. If more than one argument evaluates to a true value no further DATUMS are evaluated, and NIL is returned as both primary and secondary value. If exactly one argument evaluates to true, its value is returned as the primary value after all the diff --git a/io.lisp b/io.lisp index f36dd66..28bf5e6 100644 --- a/io.lisp +++ b/io.lisp @@ -33,7 +33,7 @@ FILE-NAME. ARGS is sent as is to the call to OPEN except EXTERNAL-FORMAT, which is only sent to WITH-OPEN-FILE when it's not NIL." (declare (ignore direction)) (when direction-p - (error "Can't specifiy :DIRECTION for WITH-INPUT-FROM-FILE.")) + (error "Can't specify :DIRECTION for WITH-INPUT-FROM-FILE.")) `(with-open-file* (,stream-name ,file-name :direction :input ,@args) ,@body)) @@ -46,7 +46,7 @@ FILE-NAME. ARGS is sent as is to the call to OPEN except EXTERNAL-FORMAT, which is only sent to WITH-OPEN-FILE when it's not NIL." (declare (ignore direction)) (when direction-p - (error "Can't specifiy :DIRECTION for WITH-OUTPUT-TO-FILE.")) + (error "Can't specify :DIRECTION for WITH-OUTPUT-TO-FILE.")) `(with-open-file* (,stream-name ,file-name :direction :output ,@args) ,@body)) -- 2.10.0

2 1

[PATCH] Use a more efficient algorithm for list shuffling
by salvador fandino 11 May '15

11 May '15

See patch attached...

4 6

[PATCH] Fix for ensure-gethash macro
by salvador fandino 27 Apr '15

27 Apr '15

3 2

[Alexandria-devel] [PATCH] Fix default ARRAY-INDEX and ARRAY-LENGTH.
by James M. Lawrence 30 Jul '14

30 Jul '14

ARRAY-DIMENSION-LIMIT is an exclusive upper bound. --- types.lisp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/types.lisp b/types.lisp index 6aa722f..1942d0e 100644 --- a/types.lisp +++ b/types.lisp @@ -1,14 +1,14 @@ (in-package :alexandria) -(deftype array-index (&optional (length array-dimension-limit)) +(deftype array-index (&optional (length (1- array-dimension-limit))) "Type designator for an index into array of LENGTH: an integer between -0 (inclusive) and LENGTH (exclusive). LENGTH defaults to +0 (inclusive) and LENGTH (exclusive). LENGTH defaults to one less than ARRAY-DIMENSION-LIMIT." `(integer 0 (,length))) -(deftype array-length (&optional (length array-dimension-limit)) +(deftype array-length (&optional (length (1- array-dimension-limit))) "Type designator for a dimension of an array of LENGTH: an integer between -0 (inclusive) and LENGTH (inclusive). LENGTH defaults to +0 (inclusive) and LENGTH (inclusive). LENGTH defaults to one less than ARRAY-DIMENSION-LIMIT." `(integer 0 ,length)) -- 1.7.9.5

2 1

[alexandria-devel] Implementation of DELETE-FROM-PLIST
by Robert Smith 30 Jul '14

30 Jul '14

Hey: Here's a destructive/non-consing version of DELETE-FROM-PLIST. I've tested with (I think) all corner cases from the REPL, but I ought to write tests proper. The function is here http://tinyurl.com/adqkssu ;or the following huge link, in case the last one is invalidated https://bitbucket.org/tarballs_are_good/lisp-random/src/3db634111d35e788c6e… . For simplicity or ease of review from an email client, I've pasted the function at the end of this email. Additionally, this function would make it pretty easy to write DELETE-FROM-PLIST-IF{-NOT}, since the function to determine if a key is bad is factored out. If one did write this function, then it would be easy to define DELETE-FROM-PLIST in terms of it. Let me know if there are any changes that should be made. Cheers, Robert Smith ;;;; from delete-from-plist.lisp (defun delete-from-plist (plist &rest keys) "Delete all keys and pairs indicated by KEYS from the plist PLIST." (labels ((assert-proper-plist (x) (assert x () "Expected a proper plist, got ~S" plist)) (bad-key-p (key) (member key keys :test #'eq)) (find-first () "Find the first cons in PLIST to keep." (loop :for the-cons :on plist :by #'cddr :unless (prog1 (bad-key-p (car the-cons)) (assert-proper-plist (cdr the-cons))) :do (return the-cons) :finally (return nil)))) (declare (inline assert-proper-plist bad-key-p find-first)) ;; Find the first good key and delete any bad key-value pairs ;; between it and the start. (let ((first (find-first))) (unless (eq first plist) (setf (cddr plist) first)) ;; At this point, we know FIRST points to the first key ;; which exists, or NIL. (loop :with last-good := first ; Keep the last good key :for the-cons :on (cddr first) :by #'cddr :do (progn (assert-proper-plist (cdr the-cons)) (if (bad-key-p (car the-cons)) (setf (cddr last-good) (cddr the-cons)) (setf last-good the-cons))) :finally (return first)))))

5 17

[Alexandria-devel] BISECT-BIG in %MULTIPLY-RANGE is never called
by Jan Moringen 12 May '14

12 May '14

Hi, out of curiosity, I tried (alexandria:binomial-coefficient 2000000000000 20) on a x86 machine (in SBCL between 1.1.18 and master with debug = 3, safety = 3 compiler policy) which resulted in the below session. Looking at %MULTIPLY-RANGE, I noticed that BISECT-BIG was never called. Calling BISECT-BIG when at least one argument is not a fixnum fixes the problem. The attached patch does that and adds a test case to the test suite. Kind regards, Jan CL-USER(5): (alexandria:binomial-coefficient 2000000000000 20) debugger invoked on a TYPE-ERROR in thread #<THREAD "main thread" RUNNING {B4748E9}>: The value 1999999999981 is not of type (INTEGER 1 536870911). Type HELP for debugger help, or (SB-EXT:EXIT) to exit from SBCL. restarts (invokable by number or by possibly-abbreviated name): 0: [ABORT] Exit debugger, returning to top level. (ALEXANDRIA.0.DEV::%MULTIPLY-RANGE 1999999999981 2000000000000) ; file: /home/jmoringe/code/cl/alexandria/numbers.lisp source: (BISECT I J) 0] 0 [ applying change in numbers.lisp ] CL-USER(6): (ql:quickload :alexandria) To load "alexandria": Load 1 ASDF system: alexandria ; Loading "alexandria" [package alexandria.0.dev]................ (:ALEXANDRIA) CL-USER(7): (alexandria:binomial-coefficient 2000000000000 20) 430998041177272843950422879590338454856322722740402365741730748431530623813012487773080486408378680853987520854296499536311275320016878730999689934464711239072435565454954447356845336730100919970769793030177499999999900000000000

2 1