{"push_id":3026729778,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"e5c1567957e8bd159beb7ef21f5fbb25bebf34e8","before":"50e5a66bd5284fb167d22e29f13ce78ee561e861","commits":[{"sha":"e5c1567957e8bd159beb7ef21f5fbb25bebf34e8","author":{"name":"Nate Cook","email":"6bcc360495a5c48087eb5714203ea743ce46d693@users.noreply.github.com"},"message":"[stdlib] Switch to a stable sort algorithm (#19717)\n\nThis switches the standard library's sort algorithm from an in-place\r\nintrosort to use a modified timsort, a stable, adaptive sort that\r\nmerges runs using a temporary buffer. This implementation performs\r\nstraight merges instead of adopting timsort's galloping strategy.\r\n\r\nIn addition to maintaining the relative order of equal/non-comparable\r\nelements, this algorithm outperforms the introsort on data with any\r\nintrinsic structure, such as runs of ascending or descending elements\r\nor a significant number of equality collisions.","distinct":true,"url":"https://api.github.com/repos/apple/swift/commits/e5c1567957e8bd159beb7ef21f5fbb25bebf34e8"}]}
{"actor":{"display_login":"natecook1000"}}