[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:17:28 EDT 2010
http://bugzilla.novell.com/show_bug.cgi?id=506070
http://bugzilla.novell.com/show_bug.cgi?id=506070#c4
Alan McGovern <amcgovern at novell.com> changed:
What |Removed |Added
----------------------------------------------------------------------------
Status|NEEDINFO |NEW
InfoProvider|amcgovern at novell.com |
--- Comment #4 from Alan McGovern <amcgovern at novell.com> 2010-04-01 10:17:26 UTC ---
Created an attachment (id=351967)
--> (http://bugzilla.novell.com/attachment.cgi?id=351967)
benchmark application
Yes, this bug has been fixed. The attached testcase is the benchmark I used to
verify the fix. The List<T>.Sort () and Array.Sort <T>() overloads all have
~identical performance now which is great.
--
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