Size constraints?

Hi @chriselrod , thanks for making this available, and for your nice summary here:
https://github.com/cscherrer/MeasureTheory.jl/discussions/49#discussioncomment-303700

With `StaticArrays`, there's compiler overhead that grows with the size of the array. From some command line checks this doesn't seem to be the case for `StrideArrays`. Is that right? Would it be accurate that StrideArray performance will always be at least as good as vanilla Arrays, as long as you're careful about the gc concerns?

The issue names no repository files or tests; start with the linked MeasureTheory.jl discussion and the command-line checks described here. Compare the stated StaticArrays, StrideArrays, and vanilla Array behavior under the GC concerns, and consider the work done when the result is recorded as a supported answer or documentation clarification.

Written by the indexing model from the issue text.