Bug 239267
| Summary: | [JSC] Optimize ArrayPrototype.js::sort | ||
|---|---|---|---|
| Product: | WebKit | Reporter: | Robin Morisset <rmorisset> |
| Component: | JavaScriptCore | Assignee: | Nobody <webkit-unassigned> |
| Status: | NEW | ||
| Severity: | Normal | CC: | mrbsayee, webkit-bug-importer |
| Priority: | P2 | Keywords: | InRadar |
| Version: | WebKit Nightly Build | ||
| Hardware: | Unspecified | ||
| OS: | Unspecified | ||
Robin Morisset
It currently seems to be a fairly naive merge sort. Making it some kind of Timsort (https://en.wikipedia.org/wiki/Timsort) could be an easy perf win.
| Attachments | ||
|---|---|---|
| Add attachment proposed patch, testcase, etc. |
Radar WebKit Bug Importer
<rdar://problem/91996423>
Raiyan Sayeed
Would it make sense to base the Timsort implementation off a full-fledged one (like a Javascript version of the OpenJDK implementation: https://github.com/AdoptOpenJDK/openjdk-jdk11u/blob/master/src/java.base/share/classes/java/util/TimSort.java)? Or would it be better to create a more basic implementation?