Yes. And every function call has a check to see if it has to grow the stack. We can plausibly collapse these two costs into one in some cases. In cases where we can't, and it's a performance bottleneck, we can offer some unsafe variant; but you're assuming a particular datapoint without evidence just as you accuse me of. We don't know it'll be prohibitively slow any more than we know bounds checking vector accesses is prohibitively slow. I'm not ok with this argument.
Sorry what am I accusing you of? And no, I don't have a datapoint for a system that has not been implemented.
-Graydon
Cheers, Rafael _______________________________________________ Rust-dev mailing list [email protected] https://mail.mozilla.org/listinfo/rust-dev
