On 2020-09-06 19:30 +0200, Marc Nieper-Wißkirchen wrote:
> 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.

Yes, I quickly realized that when trying to formulate it.  I think it's
far to complicated to bother spelling out in this case.

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

"The Algol compiler was so poorly implemented that we dared not rely
on it, and working with assembler code was considered dishonorable.
There remained only Fortran." --Niklaus Wirth