Extern/Beef
1
0
Fork 0
mirror of https://github.com/beefytech/Beef.git synced 2025-06-11 04:52:21 +02:00
Code Activity

Add Reverse

Browse source 
Reverse an array.
Update GetRef while i'm here.
This commit is contained in:
Damian Day 2020-03-20 22:18:27 +00:00
parent bc264c9447
commit 37f8cc9f98
1 changed files with 39 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

43
BeefLibs/corlib/src/Array.bf
View file

@ -147,6 +147,41 @@ namespace System
var sorter = Sorter<T, void>(&array.[Friend]mFirstElement, null, array.[Friend]mLength, comp); var sorter = Sorter<T, void>(&array.[Friend]mFirstElement, null, array.[Friend]mLength, comp);
sorter.[Friend]Sort(index, count); sorter.[Friend]Sort(index, count);
} }
// Reverses all elements of the given array. Following a call to this
// method, an element previously located at index i will now be
// located at index length - i - 1, where length is the
// length of the array.
public static void Reverse<T>(T[] arr)
{
Debug.Assert(arr != null);
Reverse(arr, 0, arr.Count);
}
// Reverses the elements in a range of an array. Following a call to this
// method, an element in the range given by index and count
// which was previously located at index i will now be located at
// index index + (index + count - i - 1).
// Reliability note: This may fail because it may have to box objects.
public static void Reverse<T>(T[] arr, int index, int length)
{
Debug.Assert(arr != null);
Debug.Assert(index >= 0);
Debug.Assert(length >= 0);
Debug.Assert(length >= arr.Count - index);
int i = index;
int j = index + length - 1;
while (i < j)
{
let temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
i++;
j--;
}
}
} }
[CRepr] [CRepr]
@ -268,19 +303,19 @@ namespace System
} }
[Inline] [Inline]
public ref T getRef(int idx) public ref T GetRef(int idx)
{ {
return ref (&mFirstElement)[idx]; return ref (&mFirstElement)[idx];
} }
[Inline] [Inline]
public ref T getRef(int idx0, int idx1) public ref T GetRef(int idx0, int idx1)
{ {
return ref (&mFirstElement)[idx0*mLength1 + idx1]; return ref (&mFirstElement)[idx0*mLength1 + idx1];
} }
[Inline] [Inline]
public ref T getRefChecked(int idx) public ref T GetRefChecked(int idx)
{ {
if ((uint)idx >= (uint)mLength) if ((uint)idx >= (uint)mLength)
Internal.ThrowIndexOutOfRange(1); Internal.ThrowIndexOutOfRange(1);
@ -288,7 +323,7 @@ namespace System
} }
[Inline] [Inline]
public ref T getRefChecked(int idx0, int idx1) public ref T GetRefChecked(int idx0, int idx1)
{ {
int idx = idx0*mLength1 + idx1; int idx = idx0*mLength1 + idx1;
if (((uint)idx >= (uint)mLength) || if (((uint)idx >= (uint)mLength) ||