Re: Sort a list of dotted pairs

On Thu, 24 Jul 2008, Pascal J. Bourguignon wrote:

> "Kjetil S. Matheussen" <k.s.matheussen@[EMAIL PROTECTED]
> writes:
> 
> > On Thu, 24 Jul 2008, Pascal J. Bourguignon wrote:
> >
> >> With (sort a-list function-which-compares-cars) you would have to
> >> write 2000 function-which-compares-some-key-some-way before.
> >> 
> >
> > What?
> >
> > Sure, common lisp is more convenient than scheme
> > in most ways, but reimplementing sort just because
> > you wan't to write "< :key car" instead of
> > "(lambda (a b) (< (car a) (car b)))" seems silly.
> >
> 
> Of course, that's why that's not what I did.  cl-sort is a wrapper
> over scheme-sort that builds that lambda automatically.
> 

Oh, okay, sorry, I didn't read closely enough.

Scheme is not scheme though. In Guile, for example, you
could implement cl-sort like this:

(define* (cl-sort alist less? :key (key (lambda (x) x)))
  (sort alist (lambda (a b) (less? (key a) (key b)))))