Am So., 6. Sept. 2020 um 19:24 Uhr schrieb Wolfgang Corcoran-Mathe
<xxxxxx@sigwinch.xyz>:

> The only comment I have is that the variadic procedures range-fold,
> etc. are described as running in time "O(n) where n is the sum of the
> total accessing times of the ranges", which is a slight
> oversimplification.  As a rule, these procedures terminate when the
> shortest range runs out, so the actual requirement is rather more
> complicated.  But the requirement given is indeed the upper bound on
> running time, so I wouldn't change anything.

Indeed, it is a simplification in the case of ranges of different
lengths. Unfortunately, one cannot make the bound sharper without even
more abstractions as a single"average accessing time" wouldn't be
enough anymore but would have to be replaced by one parameterized by
the index of the element that is accessed.

> I agree with the substantial changes, including the revised running
> time requirement for range-append.  I think this patch should be
> merged.

I have no objections when you have proof-read what I wrote. Initially,
I decided to use the patch format because it was easier for me than
listing all proposed changes in a long list. :)

Marc