On 2020-09-07 17:16 -0400, John Cowan wrote:
> On Mon, Sep 7, 2020 at 2:31 AM Marc Nieper-Wißkirchen <
> xxxxxx@nieper-wisskirchen.de> wrote:
>
> <p>Unless otherwise noted, the procedures in this SRFI that return
> > ranges allocate at most O(1) new locations in the store. By abuse of
> > notion, such procedures are said to return <dfn>compact ranges</dfn>.
> > The procedures in this SRFI that do not guarantee to return compact
> > ranges allocate at most O(n) new locations where n is the length of
> > the resulting range. Again by abuse of notion, such procedures are
> > said to return <dfn>extended ranges</dfn>.</p>
> >
>
> LGTM.  But there is no abuse of terminology here, as the terms compact and
> expanded are applied only to ranges.  (By contrast, the use of "a variable
> is bound to a value" in R[57]RS *is* an abuse of "bound", because strictly
> speaking a variable is bound to a location which is then assigned to a
> value.
>
> Here's my latest text, short and sweet:
>
> <p>Unless otherwise noted, procedures in this SRFI that return
> ranges allocate at most O(1) new locations (see R[57]RS section 3.4
> for further information).  Such ranges are known as <dfn>compact
> ranges</dfn>.  Procedures marked as returning <dfn>expanded
> ranges</dfn> allocate at most O(<em>n</em>) locations, where
> <em>n</em> is the number of elements in the range.</p>

Nicely done.

--
Wolfgang Corcoran-Mathe  <xxxxxx@sigwinch.xyz>

"Simplicity does not precede complexity, but follows it."
--Alan J. Perlis