Re: Flexvector computational complexity
Marc Nieper-Wißkirchen 08 Oct 2020 19:04 UTC
Am Do., 8. Okt. 2020 um 19:47 Uhr schrieb Adam Nelson <xxxxxx@nels.onl>:
[...]
> Current idea: "Flexvectors have the same random-access performance
> guarantees as ordinary vectors. In particular, if a given Scheme
> implements vectors with contiguous memory locations and O(1) random
> access and mutation, flexvectors must also have these performance
> characteristics. Additionally, appending to the back of a flexvector has
> the same (amortized) performance as setting an existing location in the
> same flexvector."
The first sentence looks good to me. The second talks about
"contiguous memory locations", which is not a language concept of
Scheme so it shouldn't be in the proper specification (but possibly in
the rationale). The last sentence about the amortized performance is
again important.