Reading List
ARC Overhead in Swift Sorting from Michael Tsai RSS feed.
ARC Overhead in Swift Sorting
Sean Heber: I made a function in Tapestry 23x faster today by sorting an array using its indices instead of using its data directly. Like this: let unsorted = items var indices = Array(unsorted.indices) indices.sort { a, b in unsorted[a].thing > unsorted[b].thing } items = indices.map { unsorted[$0] } Versus presumably something like: items.sort { […]