Oscar Smith

however the two areas of impurity (rounding modes and flags) appear not to be accessible from julia (or at least I haven't been able to observe the impurity)

Yeah. These benchmarks are wrong (the functions are getting constant folded), but the idea is correct. ``` julia> @btime besselk0(x) setup=x=rand() 11.271 ns (0 allocations: 0 bytes) julia> @btime besselk0x(x)...

Note that the better answer here would be a QuickSelect based approach. partial sorting does more work than necessary here.

I think that is a good solution.

@KristofferC the point is that with this change `takestring!(iobuffer)` will be as efficient as `String(take!(iobuffer))` is now, while `String(take!(iobuffer))` will have a copy. The reason for this change is that...

is this ready to merge?

Julia unlike C bounds-checks by default, so it's just an error, not UB.

I think this was somewhat intentional. We know that regular `Memory` has the interface we want, but I think we wanted a release or two and a few examples using...

subtypes does not list all subtypes because there may be infinitely many of them.

I believe the rebase is now actually correct. Rebasing across the formatting changes is really annoying.