> On Jan 21, 2017, at 12:37 AM, Russ Bishop <xen...@gmail.com> wrote: > >> On Jan 16, 2017, at 9:43 AM, Charles Srstka via swift-evolution >> <swift-evolution@swift.org <mailto:swift-evolution@swift.org>> wrote: > >> I don’t even know how long it actually takes to finish this test, because >> the last time I did this I eventually got sick of waiting and killed the >> process. So, I don’t know quite how many orders of magnitude slower it is, >> but it’s a lot. > > That’s all the endorsement I need. +1 from me. > > > I do wonder if there is any way to get this sort of optimization out of the > compiler. I suppose it would be difficult because the compiler doesn’t know > what the mutable vs immutable pairs are or if such a pair even exists (array > doesn’t have appending()).
The (somewhat naïve) assumption that some optimization of this sort might be going on is what led me to do the speed test in the first place. However, when you think about it, it’d be really quite hard to do. A reduce that builds an array consists of the closure that adds something to an array, and the reduce function itself. With the code to both of these, it’s not inconceivable that the compiler could figure out what you’re doing, but unfortunately the two components live in different modules / compilation units. The closure doesn’t know that its return value is just going to be replacing the passed-in value, and the reduce function doesn’t know that the closure isn’t going to store the original array somewhere, so neither can really know that it’s safe to modify the array in place. Charles
_______________________________________________ swift-evolution mailing list swift-evolution@swift.org https://lists.swift.org/mailman/listinfo/swift-evolution
