* srfi-1.scm (reduce, reduce-right): Don't call f with ridentity, use
it only if lst is empty, per srfi and intended optimization reduce
represents over fold.
--- srfi-1.scm.~1.48.~ 2005-02-01 10:06:05.0 +1100
+++ srfi-1.scm 2005-02-11 21:11:00.0 +1100
@@
Mikael Djurfeldt <[EMAIL PROTECTED]> writes:
>
> To me, the name "generalized_vector" feels a bit odd and heavy.
> Looking in the dictionaries, it seems like the term "generic_vector"
> would be more fitting. What do the native English speakers say?
I would steer clear of "generic", since it has
New words for fold and reduce. I found the kons/knil names unclear,
and e12/e21 bits very hard to tell which order calls were made. And
how fold and reduce differed was also pretty subtle.
-- Scheme Procedure: fold proc init lst1 ... lstN
-- Scheme Procedure: fold-right proc init lst1 ... ls
Expanded words about make-shared-array, trying to clarify what linear
means, and adding lots of example usages.
The examples make it a bit on the long side, it's worth it though,
since it's not easy to think of these usages if you don't already
know. I'm thinking of splitting out a "shared arrays
This is some words about tail calls, with I don't think are otherwise
described. I'm thinking of this for a new section just after the
"Evaluating" node.
3.1.5 Tail calls
Scheme is "properly tail recursive", meaning that tail calls or
recursions from certain contexts do not c
The development tree now supports a quick implementation of SRFI-55
(require-extension) in boot-9.scm. See
http://srfi.schemers.org/srfi-55/srfi-55.html.
require-extension is available without loading any modules, and so it
provides a portable way to load SRFIs, i.e. (require-extension (srfi 1
1
