Re: performance Taylor R Campbell 18 Sep 2009 15:17 UTC

   Date: Fri, 18 Sep 2009 07:53:45 -0400
   From: David Van Horn <xxxxxx@cs.brandeis.edu>

   It's difficult to say since this was never an option for these programs,
   but I have frequently seen programs that convert between lists and
   vectors in order to enjoy the inductive structure of lists at times and
   the constant time access and update of vectors at others.

In that case, I'd like to see some nice examples of these programs!
I'm sure I've seen examples of this before, but nothing good jumps to
mind (e.g., sorting a list by turning it into a vector).

   I'm not entirely sure what you're getting at with these questions.  Are
   you not satisfied with the rationale in the document?  Or is there some
   concrete change you'd like made to the specification and/or implementation?

I think this is a very interesting SRFI.  I suppose you could say that
I'm not satisfied with the rationale, but only in that I suspect it
could be made much stronger with some very nice examples of programs
that derive great benefits from both constant-time CONS, CAR, & CDR,
and logarithmic-time insert & update.