On 2020-09-03 21:09 +0200, Marc Nieper-Wißkirchen wrote:
> As most Scheme implementations will probably just copy the sample
> implementation, it is important to have, eventually, a performant one.

I fully agree, although it's also important to me that the sample
implementation be as simple as possible (but not simpler!).  If I
understand correctly, improvements to the sample implementation can
come after finalization, so there is time to get this right.

> I would do the following changes:
>
> ...
>
> What this proposal doesn't yet include is lazily realizing the range.
> I am not yet sure how to do it best because we don't want to trigger a
> cascade of realizations.

Thanks, this seems quite clear.  The laziness will certainly require
some more thought.

Adding any of this hinges on what John decides to do with the indexer
complexity requirements, though.

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

"I don't really know much about Python.  I only stole its object
system for Perl 5.  I have since repented." --Larry Wall