alexandria-devel April 2008

alexandria-devel@common-lisp.net

3 participants
5 discussions

[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] BISECT
by Samium Gromoff 07 Jun '08

07 Jun '08

Good day list, I believe the code below might meet the conservative standards of Alexandria. What do you think? (defun bisect (test n &optional (base 0)) "Find, using bisection, the largest positive integer below N and above, or equal to BASE, which satisfies TEST of one argument. Assumes monotonous truth value of TEST." (labels ((traverse (x fallback attack) (if (funcall test x) (cond ((zerop attack) x) ((= attack 1) (if (funcall test (1+ x)) (1+ x) x)) (t (rebalance x (1+ attack)))) (cond ((= fallback 1) (when (funcall test (1- x)) (1- x))) (t (rebalance (- x fallback) fallback))))) (rebalance (origin span &aux (middle (ash span -1))) (traverse (+ origin middle) middle (- span middle 1)))) (rebalance base (- n base)))) regards, Samium Gromoff

2 2

[alexandria-devel] length=1
by Attila Lendvai 27 May '08

27 May '08

dear list, is there any objections against this? (declaim (inline length=1)) (defun length=1 (sequence) (if (listp sequence) (and sequence (null (rest sequence))) (= 1 (length sequence)))) in optimized code, where type information is available, it drops the type check. and otherwise it works for sequences and is fast for lists. maybe it could be extended into two functions: length= and length=1, where length= optimizes for lists using nthcdr. -- attila

5 15

[alexandria-devel] DOSEQUENCE and WITH-SEQUENCE-ITERATOR
by Tobias C. Rittweiler 05 Apr '08

05 Apr '08

* sequences.lisp (dosequence): New macro. DOLIST analagon. (with-sequence-iterator): New macro. WITH-HASH-TABLE-ITERATOR analogon. (%make-sequence-iterator): New internal function. * package.lisp: Export DOSEQUENCE, and WITH-SEQUENCE-ITERATOR. * tests.lisp (dosequence.1): New test case. (with-sequence-iterator.1): Ditto. (with-sequence-iterator.2): Ditto. pullable from http://common-lisp.net/~trittweiler/darcs/alexandria/ -T.

1 0

[alexandria-devel] [PATCH] COPY-HASH-TABLE
by Tobias C. Rittweiler 04 Apr '08

04 Apr '08

The following patch adds a :COPY-FN &key arg to COPY-HASH-TABLE which defaults to CL:IDENTITY. This way, you can specify if you want a shallow copy (default), or a customized one which is possibly deep to some arbitrary level. -T.

4 11

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

alexandria-devel April 2008