[Mono-bugs] [Bug 506070] List<int>.Sort () is slower than Array.Sort <int>

bugzilla_noreply at novell.com bugzilla_noreply at novell.com
Thu Apr 1 06:21:09 EDT 2010



--- Comment #5 from Alan McGovern <amcgovern at novell.com> 2010-04-01 10:21:08 UTC ---
Created an attachment (id=351968)
 --> (http://bugzilla.novell.com/attachment.cgi?id=351968)
benchmark for explicitly using Comparer<T>.Default

There's one more case we could optimise:

Array.Sort <T>(new T [10], Comparer<T>.Default);

We can catch this case and hit the fastpath for value types pretty easily as in
the above patch. Is this worth committing?

Configure bugmail: http://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