[Mono-bugs] [Bug 351638] [PATCH] Array.Sort: proper argument checking and performance enhancements

bugzilla_noreply at novell.com bugzilla_noreply at novell.com
Tue Oct 7 08:44:46 EDT 2008


User juraj at hotfeet.ch added comment

--- Comment #12 from Juraj Skripsky <juraj at hotfeet.ch>  2008-10-07 06:44:46 MDT ---
Created an attachment (id=243937)
 --> (https://bugzilla.novell.com/attachment.cgi?id=243937)
Array.cs - version 1 of 3

Here you go, Paolo. This is Array.cs with the qsort optimization applied.

2008-10-07  Juraj Skripsky  <js at hotfeet.ch>

        * Array.cs (Sort): optimize qsort by employing multiple, faster copies
        of the inner-most loops:
        - for case "comparer != null"
        - for case "pivot is IComparable<T>"
        - for case "pivot is IComparable"
        Remove compare methods as the inner loops now do their work.
        Use GetValueImpl instead of GetValue in swap.

        Part 1 of 3 fixing bug #351638.

Configure bugmail: https://bugzilla.novell.com/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are the QA contact for the bug.
You are the assignee for the bug.

More information about the mono-bugs mailing list