From mono-devel-list  Thu Mar 03 01:27:24 2005
From: Marcus <mathpup () mylinuxisp ! com>
Date: Thu, 03 Mar 2005 01:27:24 +0000
To: mono-devel-list
Subject: Re: [Mono-devel-list] [Patch] Array.Sort
Message-Id: <200503021927.24304.mathpup () mylinuxisp ! com>
X-MARC-Message: https://marc.info/?l=mono-devel-list&m=111336500128142

The MS implementation of Array.Sort attempts to check whether the Array it is 
passed can be converted to object[], and in that case it uses a verison of 
Quicksort that uses array indexers instead the slower Array accessors to 
access elements of the Array. Apparently, their JIT has special helpers for 
array indexers that do not exist Array.GetValue and Array.SetValue.

Has there been any consideration to doing that?


On Wednesday 02 March 2005 4:25 pm, Ben Maurer wrote:
> On Wed, 2005-03-02 at 16:06 -0600, Carlos Alberto Cortez wrote:
> > Attached is a patch for implementing Array.Sort generic methods. Could
> > somebody review it?
>
> There is one major risk to these patches:
>
> Array.Sort <T> will be a better binding than Array.Sort. This means that
> people will automatically be using the generic version.