mono/linux-packaging-mono
0
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Imported Upstream version 3.8.0

Browse Source 
Former-commit-id: 6a76a29bd07d86e57c6c8da45c65ed5447d38a61
This commit is contained in:
Jo Shields
2014-09-04 09:07:35 +01:00
parent a575963da9
commit fe777c5c82
1062 changed files with 12460 additions and 5983 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
mcs/class/corlib/System/Array.cs
View File

@ -1480,9 +1480,9 @@ namespace System
return false;
}
private static void qsort (Array keys, Array items, int low0, int high0, IComparer comparer)
unsafe static void qsort (Array keys, Array items, int low0, int high0, IComparer comparer)
{
QSortStack[] stack = new QSortStack[32];
QSortStack* stack = stackalloc QSortStack [32];
const int QSORT_THRESHOLD = 7;
int high, low, mid, i, k;
object key, hi, lo;
@ -1934,9 +1934,9 @@ namespace System
return false;
}
private static void qsort<T, U> (T[] keys, U[] items, int low0, int high0) where T : IComparable<T>
unsafe static void qsort<T, U> (T[] keys, U[] items, int low0, int high0) where T : IComparable<T>
{
QSortStack[] stack = new QSortStack[32];
QSortStack* stack = stackalloc QSortStack [32];
const int QSORT_THRESHOLD = 7;
int high, low, mid, i, k;
int sp = 1;
@ -2043,9 +2043,9 @@ namespace System
}
// Specialized version for items==null
private static void qsort<T> (T[] keys, int low0, int high0) where T : IComparable<T>
unsafe static void qsort<T> (T[] keys, int low0, int high0) where T : IComparable<T>
{
QSortStack[] stack = new QSortStack[32];
QSortStack* stack = stackalloc QSortStack [32];
const int QSORT_THRESHOLD = 7;
int high, low, mid, i, k;
int sp = 1;
@ -2232,9 +2232,9 @@ namespace System
return false;
}
private static void qsort<K, V> (K [] keys, V [] items, int low0, int high0, IComparer<K> comparer)
unsafe static void qsort<K, V> (K [] keys, V [] items, int low0, int high0, IComparer<K> comparer)
{
QSortStack[] stack = new QSortStack[32];
QSortStack* stack = stackalloc QSortStack [32];
const int QSORT_THRESHOLD = 7;
int high, low, mid, i, k;
IComparable<K> gcmp;
@ -2378,9 +2378,9 @@ namespace System
}
// Specialized version for items==null
private static void qsort<K> (K [] keys, int low0, int high0, IComparer<K> comparer)
unsafe static void qsort<K> (K [] keys, int low0, int high0, IComparer<K> comparer)
{
QSortStack[] stack = new QSortStack[32];
QSortStack* stack = stackalloc QSortStack [32];
const int QSORT_THRESHOLD = 7;
int high, low, mid, i, k;
IComparable<K> gcmp;
@ -2535,9 +2535,9 @@ namespace System
return false;
}
private static void qsort<T> (T [] array, int low0, int high0, Comparison<T> compare)
unsafe static void qsort<T> (T [] array, int low0, int high0, Comparison<T> compare)
{
QSortStack[] stack = new QSortStack[32];
QSortStack* stack = stackalloc QSortStack [32];
const int QSORT_THRESHOLD = 7;
int high, low, mid, i, k;
int sp = 1;