Re: case-lambda integration

Hey, Andy Wingo writes: > All args are passed on the stack. A procedure may have required, > optional, keyword, and rest arguments. The N required arguments are > bound to the first N local variable slots. The M optional arguments are > bound to the next M local variable slots. If an optional va

Re: SRFI-0 ‘guile-2’ feature

l...@gnu.org (Ludovic Courtès) writes: > (cond-expand (guile-2 #t)) > => #t Done! Ludo'.

Re: Guile web page docs

Neil Jerram writes: > I noticed that the docs on the Guile web pages are a bit out of date. > The 1.8 ones are behind those in 1.8.7 (the latest release). http://www.gnu.org/software/guile/manual/html_node/index.html appears to correspond to 1.8.7. (BTW, Gnulib has a new script to automate upda

Guile web page docs

I noticed that the docs on the Guile web pages are a bit out of date. The 1.8 ones are behind those in 1.8.7 (the latest release). I'm not sure about the 1.6 ones, but will check. And there aren't any docs for 1.9/2.0 at all - which I think would be useful. Would anyone object if we added a 1.9/

Re: Parallel installability, API stability

On Wed 21 Oct 2009 18:45, l...@gnu.org (Ludovic Courtès) writes: > Andy Wingo writes: > >> Sure, we need to make well-thought-out changes -- but our current >> policy of very extended C-level compatibility is very, very limiting, >> and a big energy drain. If we think we need to change a function

Re: Compiled load path issues

Hi Ludovic, On Wed 21 Oct 2009 18:22, l...@gnu.org (Ludovic Courtès) writes: > Andy Wingo writes: > >> On Tue 20 Oct 2009 10:27, l...@gnu.org (Ludovic Courtès) writes: > > [...] > >>> In theory, we could interpret the ‘.go’ cookie and byte-swap things if >>> needed... >> >> In theory yes. In pra

Re: sort needs a #:key argument

Hello, On Wed 21 Oct 2009 18:06, l...@gnu.org (Ludovic Courtès) writes: > Andy Wingo writes: > >> if your key takes time to >> compute, you need to use the decorate-sort-undecorate idiom, otherwise >> you compute the sort key O(n log n) times instead of O(n) times. > > If you insist: > > (sort

Re: eval-case

On Wed 21 Oct 2009 13:59, l...@gnu.org (Ludovic Courtès) writes: > OTOH, with ‘(cond-expand (guile-2 ...))’, one can achieve this and more, > which may be a good reason to not worry about it. Would you be happy settling on this? Andy -- http://wingolog.org/

Parallel installability, API stability

Hi again! Andy Wingo writes: > On Tue 20 Oct 2009 10:27, l...@gnu.org (Ludovic Courtès) writes: [...] >> I think we must pay close attention to backwards compatibility, at least >> to honor long time promises >> (http://lists.gnu.org/archive/html/guile-devel/2003-02/msg00074.html). [...] > F

Re: Compiled load path issues

Hello! Andy Wingo writes: > On Tue 20 Oct 2009 10:27, l...@gnu.org (Ludovic Courtès) writes: [...] >> In theory, we could interpret the ‘.go’ cookie and byte-swap things if >> needed... > > In theory yes. In practice we map things read-only so they can be cached > and not copied, and we'd have

Re: sort needs a #:key argument

Hello, Andy Wingo writes: > On Tue 20 Oct 2009 10:38, l...@gnu.org (Ludovic Courtès) writes: > >> Andy Wingo writes: >> >>> (sort '((a . 1) (b . -2) (c . 3)) < cdr) >>> => ((b . -2) (a . 1) (c . 3)) >> >> FWIW I find: >> >> (sort '((a . 1) (b . -2) (c . 3)) >> (lambda (x y) >>

eval-case

Hello! Andy Wingo writes: > The problem is that eval-case has really murky semantics -- to me at > least. We've *never* needed to use it in the past, to my knowledge, > except to distinguish toplevel expressions from lexically nested > expressions -- an iffy use, IMO. (Any definition should be v