| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2023-05-20 | [Feature #19643] Direct primitive compare sort for `Array#sort_by` | nekoyama32767 | |
| In most of case `sort_by` works on primitive type. Using `qsort_r` with function pointer is much slower than compare data directly. I implement an intro sort which compare primitive data directly for `sort_by`. We can even afford an O(n) type check before primitive data sort. It still go faster. Notes: Merged: https://github.com/ruby/ruby/pull/7805 Merged-By: nobu <nobu@ruby-lang.org> | |||
 |
index : ruby.git | |
| The Ruby Programming Language |
| summaryrefslogtreecommitdiff |