CoreUnsafeUtils

: Object

UnityEngine.Rendering.CoreUnsafeUtils, Unity.RenderPipelines.Core.Runtime 0x0010 (16 B) inherited 0x0010 Unity.RenderPipelines.Core.Runtime.dll

0x00x0010

Members 0

Show inherited members

Offset	Size	Name	Type	Flags	Default
No reflected members.

Functions 26

Signature	Flags	Params
void CopyTo(List<T> list, const Void*& dest, int count)	PublicStatic	0x08
void CopyTo(const T[]& list, const Void*& dest, int count)	PublicStatic	0x08
void CalculateRadixParams(int radixBits, ref int& bitStates)	PrivateStatic	0x04
int CalculateRadixSupportSize(int bitStates, int arrayLength)	PrivateStatic	0x04
void CalculateRadixSortSupportArrays(int bitStates, int arrayLength, const UInt32& supportArray, ref UInt32& bucketIndices, ref UInt32& bucketSizes, ref UInt32& bucketPrefix, ref UInt32*& arrayOutput)	PrivateStatic	0x04
void MergeSort(const UInt32& array, const UInt32& support, int length)	PrivateStatic	0x04
void MergeSort(const uint[]& arr, int sortSize, ref uint[]& supportArray)	PublicStatic	0x08
void MergeSort(const NativeArray<System.UInt32>& arr, int sortSize, ref NativeArray<System.UInt32>& supportArray)	PublicStatic	0x10
void InsertionSort(const UInt32*& arr, int length)	PrivateStatic	0x04
void InsertionSort(const uint[]& arr, int sortSize)	PublicStatic	0x08
void InsertionSort(const NativeArray<System.UInt32>& arr, int sortSize)	PublicStatic	0x10
void RadixSort(const UInt32& array, const UInt32& support, int radixBits, int bitStates, int length)	PrivateStatic	0x04
void RadixSort(const uint[]& arr, int sortSize, ref uint[]& supportArray, int radixBits)	PublicStatic	0x08
void RadixSort(const NativeArray<System.UInt32>& array, int sortSize, ref NativeArray<System.UInt32>& supportArray, int radixBits)	PublicStatic	0x10
void QuickSort(const uint[]& arr, int left, int right)	PublicStatic	0x08
void QuickSort(const ulong[]& arr, int left, int right)	PublicStatic	0x08
void QuickSort(int count, const Void*& data)	PublicStatic	0x04
void QuickSort(int count, const Void*& data)	PublicStatic	0x04
void QuickSort(const Void*& data, int left, int right)	PublicStatic	0x04
int IndexOf(const Void*& data, int count, const uint8& v)	PublicStatic	0x04
int CompareHashes(int oldHashCount, const Void& oldHashes, int newHashCount, const Void& newHashes, const Int32& addIndices, const Int32& removeIndices, ref int& addCount, ref int& remCount)	PublicStatic	0x04
int CompareHashes(int oldHashCount, const Hash128& oldHashes, int newHashCount, const Hash128& newHashes, const Int32& addIndices, const Int32& removeIndices, ref int& addCount, ref int& remCount)	PublicStatic	0x04
void CombineHashes(int count, const Void& hashes, const Hash128& outHash)	PublicStatic	0x04
void CombineHashes(int count, const Hash128& hashes, const Hash128& outHash)	PublicStatic	0x04
int Partition(const Void*& data, int left, int right)	PrivateStatic	0x04
bool HaveDuplicates(const int[]& arr)	PublicStatic	0x08

// UnityEngine.Rendering.CoreUnsafeUtils, Unity.RenderPipelines.Core.Runtime
// size 0x0010 (16), inherited 0x0010
class CoreUnsafeUtils : public Object
{
public:

    void CopyTo(List<T> list, Void* dest, int count); // 0x29e240 [Public Static]
    void CopyTo(T[] list, Void* dest, int count); // 0x29e240 [Public Static]
    void CalculateRadixParams(int radixBits, ref int bitStates); // 0x18e4220 [Private Static]
    int CalculateRadixSupportSize(int bitStates, int arrayLength); // 0x18e4270 [Private Static]
    void CalculateRadixSortSupportArrays(int bitStates, int arrayLength, UInt32* supportArray, ref UInt32* bucketIndices, ref UInt32* bucketSizes, ref UInt32* bucketPrefix, ref UInt32* arrayOutput); // 0x18e4230 [Private Static]
    void MergeSort(UInt32* array, UInt32* support, int length); // 0x18e47c0 [Private Static]
    void MergeSort(uint[] arr, int sortSize, ref uint[] supportArray); // 0x18e4940 [Public Static]
    void MergeSort(NativeArray<System.UInt32> arr, int sortSize, ref NativeArray<System.UInt32> supportArray); // 0x18e46c0 [Public Static]
    void InsertionSort(UInt32* arr, int length); // 0x18e4570 [Private Static]
    void InsertionSort(uint[] arr, int sortSize); // 0x18e45d0 [Public Static]
    void InsertionSort(NativeArray<System.UInt32> arr, int sortSize); // 0x18e4490 [Public Static]
    void RadixSort(UInt32* array, UInt32* support, int radixBits, int bitStates, int length); // 0x18e4b10 [Private Static]
    void RadixSort(uint[] arr, int sortSize, ref uint[] supportArray, int radixBits); // 0x18e4c90 [Public Static]
    void RadixSort(NativeArray<System.UInt32> array, int sortSize, ref NativeArray<System.UInt32> supportArray, int radixBits); // 0x18e4db0 [Public Static]
    void QuickSort(uint[] arr, int left, int right); // 0x18e4aa0 [Public Static]
    void QuickSort(ulong[] arr, int left, int right); // 0x18e4a30 [Public Static]
    void QuickSort(int count, Void* data); // 0x29e240 [Public Static]
    void QuickSort(int count, Void* data); // 0x29e240 [Public Static]
    void QuickSort(Void* data, int left, int right); // 0x29e240 [Public Static]
    int IndexOf(Void* data, int count, uint8 v); // 0x29e240 [Public Static]
    int CompareHashes(int oldHashCount, Void* oldHashes, int newHashCount, Void* newHashes, Int32* addIndices, Int32* removeIndices, ref int addCount, ref int remCount); // 0x29e240 [Public Static]
    int CompareHashes(int oldHashCount, Hash128* oldHashes, int newHashCount, Hash128* newHashes, Int32* addIndices, Int32* removeIndices, ref int addCount, ref int remCount); // 0x18e42e0 [Public Static]
    void CombineHashes(int count, Void* hashes, Hash128* outHash); // 0x29e240 [Public Static]
    void CombineHashes(int count, Hash128* hashes, Hash128* outHash); // 0x18e4280 [Public Static]
    int Partition(Void* data, int left, int right); // 0x29e240 [Private Static]
    bool HaveDuplicates(int[] arr); // 0x18e4340 [Public Static]
};