July 2008 - 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] 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] Testing with Lisps other than SBCL, patches
by Luis Oliveira 21 Aug '08

21 Aug '08

Hello, Yesterday I decided to test Alexandria with a couple of Lisps. The following patches resulted from that session, except MULTIPLE-VALUE-PROG2 whose usefulness is admittedly debatable. Sun Jul 27 04:01:39 WEST 2008 Luis Oliveira <loliveira(a)common-lisp.net> * Mark expected failures for Allegro CL: TYPE=.[234] Sun Jul 27 04:01:30 WEST 2008 Luis Oliveira <loliveira(a)common-lisp.net> * amend COPY-SEQUENCE.1 - can't assume that (upgraded-array-element-type 'fixnum) => fixnum. Fix that. Sun Jul 27 03:54:27 WEST 2008 Luis Oliveira <loliveira(a)common-lisp.net> * tests: mark CLISP failures - COPY-HASH-TABLE.1 causes a stack overflow due to a CLISP bug. - ALIST-HASH-TABLE.1, PLIST-HASH-TABLE.1 fail because HASH-TABLE-TEST returns EXT:FASTHASH-{EQ,EQL}. Sun Jul 27 03:46:35 WEST 2008 Luis Oliveira <loliveira(a)common-lisp.net> * tests: define and use ERRORP - TYPEP returns a generalized boolean. On Lisps like ECL, this detail was causing some tests to fail. ERRORP takes this into account. Sun Jul 27 03:45:07 WEST 2008 Luis Oliveira <loliveira(a)common-lisp.net> * Small fix to COPY-HASH-TABLE - New hash-table was being created with a bogus rehash-size. - Added regression test in another patch. Sun Jul 27 03:43:21 WEST 2008 Luis Oliveira <loliveira(a)common-lisp.net> * Define an alexandria-tests ASDF system. - make it usable for other Lisps besides SBCL. - TEST-OP runs tests both compiled and evaluated. Sun Jul 27 03:37:13 WEST 2008 Luis Oliveira <loliveira(a)common-lisp.net> * New macro: MULTIPLE-VALUE-PROG2 These patches can be pulled via darcs pull http://common-lisp.net/~loliveira/darcs/alexandria -- Luís Oliveira http://student.dei.uc.pt/~lmoliv/

3 2

[alexandria-devel] [PATCH] Fix for a bug in map-permutations
by Juan M. Bello Rivas 01 Aug '08

01 Aug '08

Hi, The function map-permutations wasn't working. The attached patch fixes it. Regards, -- Juan M. Bello Rivas

2 1

[alexandria-devel] Pending patches
by Tobias C. Rittweiler 01 Aug '08

01 Aug '08

There are still several patches pending in my repository: http://common-lisp.net/~trittweiler/darcs/alexandria/ The patches affect the following files: * alexandria.asd: Attila's LENGTH= implementation makes use of ARRAY-INDEX. So add a dependency between `types.lisp' and `sequences.lisp'. * functions.lisp: Make %COERCE-CALLABLE-TO-FUN notes go away. * lists.lisp: Add macro DO-PROPER-LIST, add function PROPER-LIST-LENGTH. Use them to guard against dotted and circular lists in several functions in `lists.lisp' and `sequences.lisp' (those who stated so in their docstrings.) * sequences.lisp: Fix MAP-COMBINATIONS. Add sequence iterators, i.e. WITH-SEQUENCE-ITERATOR and DOSEQUENCE. * hash-tables.lisp: Remove :KEY argument from COPY-HASH-TABLE; introduce MAP-HASH-TABLE instead. * modify-macros.lisp: New file; add CALLF &c.; Also add ENSUREF. -T.

3 2

[alexandria-devel] Sequence Iterators.
by Tobias C. Rittweiler 12 Jul '08

12 Jul '08

Hi all, When writing complex functions that are supposed to work on sequences, one often laments about the lack of an iteration form that works on general sequences. I finished my work on sequence iterators to provide several abstractions to help writing such functions. The iterators are reasonably optimized, and result in performance that should be fast enough for virtually any purpose, especially on SBCL. The iterators are not extensible by any means, and only work on lists and vectors. My work provides the following macros: (with-sequence-iterator (name seq &key start end from-end) ...body...) Binds NAME to an iterator to iterate through SEQ from START to END, possibly in reversed order if FROM-END is T. (dosequence ((var idx) seq &key start end from-end) ...body...) Iterates through SEQ, binding VAR to the current element, and IDX to the current index of the current element. (dosequences (((var idx) seq &key start end from-end) &rest more) ...body...) Iterates through several sequences simultaneously. (dosequences* (((var idx) seq &key start end from-end) &rest more) ...body...) Similiarly to DOSEQUENCES, but iterates through the sequences in a more sequential manner. Cf. its docstring. (check-sequence-bounds seq start end &optional length) Signals an error if START, END are not valid bounding indices. (with-sequence-bounds ((seq-var seq) (start-var start) (end-var end) (length-var length)) ... body ...) Wrapper around CHECK-SEQUENCE-BOUNDS to bind the above vars to appropriate default values, check validity of indices, and declare some types. It can be found in my repository at http://common-lisp.net/~trittweiler/darcs/alexandria/ As a schmankerl (tidbit), here is an implementation of a function which tests whether a given sequence is the prefix of another given sequence: (defun begins-with-subseq (prefix sequence &key (test #'eql) (key #'identity) start1 end1 start2 end2) "Test whether the first elements of SEQUENCE are the same as the elements of PREFIX." (dosequences* ((p prefix t :start start1 :end end1) (s sequence nil :start start2 :end end2)) (unless (funcall test (funcall key p) (funcall key s)) (return nil)))) I hope you enjoy, -T.

1 1

[alexandria-devel] Pushed
by Nikodemus Siivola 07 Jul '08

07 Jul '08

Mon Jul 7 11:51:14 EEST 2008 Nikodemus Siivola <nikodemus(a)random-state.net> * implement SIMPLE-PROGRAM-ERROR ...what is says on the tin. Mon Jul 7 11:55:06 EEST 2008 Nikodemus Siivola <nikodemus(a)random-state.net> * implement PARSE-ORDINARY-LAMBDA-LIST ...not something you need every day. Mon Jul 7 11:57:04 EEST 2008 Nikodemus Siivola <nikodemus(a)random-state.net> * implement MAKE-GENSYM, use similar logic in MAKE-GENSYM-LIST ...non-negative integers are arguments, and string designators instead of strings. Mon Jul 7 12:50:26 EEST 2008 Nikodemus Siivola <nikodemus(a)random-state.net> * explicitly export the CDR5 types from DEFPACKAGE ...so reloading package.lisp doesn't warn. Cheers, -- Nikodemus

2 1