On 2020-09-06 11:33 +0200, Marc Nieper-Wißkirchen wrote:
> So here is some constructive proposal to (hopefully finally) resolve
> the problem with the running time guarantees. Instead of listing all
> proposed changes, I applied them to the latest draft in John's
> repository and you'll find the corresponding patch file attached to
> this email.  Please go over the proposed changes.

Thanks for making this extensive revision, which I think makes the
running time requirements much more precise.

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.

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

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

"Lisp is not about writing a sequence of serial instructions; it is
about building complex structures by summing parts." --Riastradh