Re: Faster zend sorting implementation
| From: | David Zuelke | Date: | Tue, 06 Jan 2015 15:14:25 +0000 |
| Subject: | Re: Faster zend sorting implementation | ||
| References: | 1 2 | Groups: | php.internals |
| Request: | Send a blank email to internals+get-80239@lists.php.net to get a copy of this message | ||
On 06.01.2015, at 05:42, Pierre Joye <pierre.php@gmail.com> wrote:
> I am not sure about that. Introducing a not easy to catch BC break for
> 0.1% gain on function (or even for the whole app) is not very
> appealing.
>
> However, there is nothing in the documentation actually describing how
> it works and there are clear warnings about the unpredictable results.
> That means we won't actually break it,per definition. I only wonder if
> it is worth the effort for such little gain (yes, the ocean is made of
> drops ;).
The clear benefit I see is that it turns it into a stable sort, although we could of course always
break that again in the future unless we explicitly specify/guarantee it to be stable from now on
(without any other guarantees about the algorithm).