NativeSortExtension

: Object

Unity.Collections.NativeSortExtension, Unity.Collections 0x0010 (16 B) inherited 0x0010 Unity.Collections.dll

0x00x0010

Members 1

Show inherited members

Offset	Size	Name	Type	Flags	Default
—	0x04	k_IntrosortSizeThreshold	int	PrivateStatic+1 flags	16

Functions 52

Signature	Flags	Params
void Sort(const T*& array, int length)	PublicStatic	0x04
void Sort(const T*& array, int length, const uint8& comp)	PublicStatic	0x04
SortJob<T SortJob(const T*& array, int length)	PublicStatic	0x10
SortJob<T SortJob(const T*& array, int length, const uint8& comp)	PublicStatic	0x18
int BinarySearch(const T*& ptr, int length, const uint8& value)	PublicStatic	0x04
int BinarySearch(const T*& ptr, int length, const uint8& value, const uint8& comp)	PublicStatic	0x04
void Sort(const NativeArray<T>& array)	PublicStatic	0x10
void Sort(const NativeArray<T>& array, const uint8& comp)	PublicStatic	0x10
SortJob<T SortJob(const NativeArray<T>& array)	PublicStatic	0x10
SortJob<T SortJob(const NativeArray<T>& array, const uint8& comp)	PublicStatic	0x18
int BinarySearch(const NativeArray<T>& array, const uint8& value)	PublicStatic	0x10
int BinarySearch(const NativeArray<T>& array, const uint8& value, const uint8& comp)	PublicStatic	0x10
int BinarySearch(const ReadOnly<T>& array, const uint8& value)	PublicStatic	0x10
int BinarySearch(const ReadOnly<T>& array, const uint8& value, const uint8& comp)	PublicStatic	0x10
void Sort(const NativeList<T>& list)	PublicStatic	0x08
void Sort(const NativeList<T>& list, const uint8& comp)	PublicStatic	0x08
SortJob<T SortJob(const NativeList<T>& list)	PublicStatic	0x10
SortJob<T SortJob(const NativeList<T>& list, const uint8& comp)	PublicStatic	0x18
SortJobDefer<T SortJobDefer(const NativeList<T>& list)	PublicStatic	0x10
SortJobDefer<T SortJobDefer(const NativeList<T>& list, const uint8& comp)	PublicStatic	0x10
int BinarySearch(const NativeList<T>& list, const uint8& value)	PublicStatic	0x08
int BinarySearch(const NativeList<T>& list, const uint8& value, const uint8& comp)	PublicStatic	0x08
void Sort(const UnsafeList<T>& list)	PublicStatic	0x18
void Sort(const UnsafeList<T>& list, const uint8& comp)	PublicStatic	0x18
SortJob<T SortJob(const UnsafeList<T>& list)	PublicStatic	0x18
SortJob<T SortJob(const UnsafeList<T>& list, const uint8& comp)	PublicStatic	0x18
int BinarySearch(const UnsafeList<T>& list, const uint8& value)	PublicStatic	0x18
int BinarySearch(const UnsafeList<T>& list, const uint8& value, const uint8& comp)	PublicStatic	0x18
void Sort(const NativeSlice<T>& slice)	PublicStatic	0x10
void Sort(const NativeSlice<T>& slice, const uint8& comp)	PublicStatic	0x10
SortJob<T SortJob(const NativeSlice<T>& slice)	PublicStatic	0x10
SortJob<T SortJob(const NativeSlice<T>& slice, const uint8& comp)	PublicStatic	0x18
int BinarySearch(const NativeSlice<T>& slice, const uint8& value)	PublicStatic	0x10
int BinarySearch(const NativeSlice<T>& slice, const uint8& value, const uint8& comp)	PublicStatic	0x10
void IntroSort(const Void*& array, int length, const uint8& comp)	Static+1 flags	0x04
void IntroSort_R(const Void*& array, int lo, int hi, int depth, const uint8& comp)	Static+1 flags	0x04
void InsertionSort(const Void*& array, int lo, int hi, const uint8& comp)	PrivateStatic	0x04
int Partition(const Void*& array, int lo, int hi, const uint8& comp)	PrivateStatic	0x04
void HeapSort(const Void*& array, int lo, int hi, const uint8& comp)	PrivateStatic	0x04
void Heapify(const Void*& array, int i, int n, int lo, const uint8& comp)	PrivateStatic	0x04
void Swap(const Void*& array, int lhs, int rhs)	PrivateStatic	0x04
void SwapIfGreaterWithItems(const Void*& array, int lhs, int rhs, const uint8& comp)	PrivateStatic	0x04
void IntroSortStruct(const Void*& array, int length, const uint8& comp)	PrivateStatic	0x04
void IntroSortStruct_R(const Void*& array, ref int& lo, ref int& _hi, int depth, const uint8& comp)	PrivateStatic	0x04
void InsertionSortStruct(const Void*& array, ref int& lo, ref int& hi, const uint8& comp)	PrivateStatic	0x04
int PartitionStruct(const Void*& array, ref int& lo, ref int& hi, const uint8& comp)	PrivateStatic	0x04
void HeapSortStruct(const Void*& array, ref int& lo, ref int& hi, const uint8& comp)	PrivateStatic	0x04
void HeapifyStruct(const Void*& array, int i, int n, ref int& lo, const uint8& comp)	PrivateStatic	0x04
void SwapStruct(const Void*& array, int lhs, int rhs)	PrivateStatic	0x04
void SwapIfGreaterWithItemsStruct(const Void*& array, int lhs, int rhs, const uint8& comp)	PrivateStatic	0x04
void CheckStrideMatchesSize(int stride)	PrivateStatic	0x04
void CheckComparer(const T*& array, int length, const uint8& comp)	PrivateStatic	0x04

// Unity.Collections.NativeSortExtension, Unity.Collections
// size 0x0010 (16), inherited 0x0010
class NativeSortExtension : public Object
{
public:
    int k_IntrosortSizeThreshold;                      // ????(0x04) Private Static Literal = 16

    void Sort(T* array, int length); // 0x5042a0 [Public Static]
    void Sort(T* array, int length, uint8 comp); // 0x5042a0 [Public Static]
    SortJob<T SortJob(T* array, int length); // 0x5042a0 [Public Static]
    SortJob<T SortJob(T* array, int length, uint8 comp); // 0x5042a0 [Public Static]
    int BinarySearch(T* ptr, int length, uint8 value); // 0x5042a0 [Public Static]
    int BinarySearch(T* ptr, int length, uint8 value, uint8 comp); // 0x5042a0 [Public Static]
    void Sort(NativeArray<T> array); // 0x5042a0 [Public Static]
    void Sort(NativeArray<T> array, uint8 comp); // 0x5042a0 [Public Static]
    SortJob<T SortJob(NativeArray<T> array); // 0x5042a0 [Public Static]
    SortJob<T SortJob(NativeArray<T> array, uint8 comp); // 0x5042a0 [Public Static]
    int BinarySearch(NativeArray<T> array, uint8 value); // 0x5042a0 [Public Static]
    int BinarySearch(NativeArray<T> array, uint8 value, uint8 comp); // 0x5042a0 [Public Static]
    int BinarySearch(ReadOnly<T> array, uint8 value); // 0x5042a0 [Public Static]
    int BinarySearch(ReadOnly<T> array, uint8 value, uint8 comp); // 0x5042a0 [Public Static]
    void Sort(NativeList<T> list); // 0x5042a0 [Public Static]
    void Sort(NativeList<T> list, uint8 comp); // 0x5042a0 [Public Static]
    SortJob<T SortJob(NativeList<T> list); // 0x5042a0 [Public Static]
    SortJob<T SortJob(NativeList<T> list, uint8 comp); // 0x5042a0 [Public Static]
    SortJobDefer<T SortJobDefer(NativeList<T> list); // 0x5042a0 [Public Static]
    SortJobDefer<T SortJobDefer(NativeList<T> list, uint8 comp); // 0x5042a0 [Public Static]
    int BinarySearch(NativeList<T> list, uint8 value); // 0x5042a0 [Public Static]
    int BinarySearch(NativeList<T> list, uint8 value, uint8 comp); // 0x5042a0 [Public Static]
    void Sort(UnsafeList<T> list); // 0x5042a0 [Public Static]
    void Sort(UnsafeList<T> list, uint8 comp); // 0x5042a0 [Public Static]
    SortJob<T SortJob(UnsafeList<T> list); // 0x5042a0 [Public Static]
    SortJob<T SortJob(UnsafeList<T> list, uint8 comp); // 0x5042a0 [Public Static]
    int BinarySearch(UnsafeList<T> list, uint8 value); // 0x5042a0 [Public Static]
    int BinarySearch(UnsafeList<T> list, uint8 value, uint8 comp); // 0x5042a0 [Public Static]
    void Sort(NativeSlice<T> slice); // 0x5042a0 [Public Static]
    void Sort(NativeSlice<T> slice, uint8 comp); // 0x5042a0 [Public Static]
    SortJob<T SortJob(NativeSlice<T> slice); // 0x5042a0 [Public Static]
    SortJob<T SortJob(NativeSlice<T> slice, uint8 comp); // 0x5042a0 [Public Static]
    int BinarySearch(NativeSlice<T> slice, uint8 value); // 0x5042a0 [Public Static]
    int BinarySearch(NativeSlice<T> slice, uint8 value, uint8 comp); // 0x5042a0 [Public Static]
    void IntroSort(Void* array, int length, uint8 comp); // 0x5042a0 [Assembly Static]
    void IntroSort_R(Void* array, int lo, int hi, int depth, uint8 comp); // 0x5042a0 [Assembly Static]
    void InsertionSort(Void* array, int lo, int hi, uint8 comp); // 0x5042a0 [Private Static]
    int Partition(Void* array, int lo, int hi, uint8 comp); // 0x5042a0 [Private Static]
    void HeapSort(Void* array, int lo, int hi, uint8 comp); // 0x5042a0 [Private Static]
    void Heapify(Void* array, int i, int n, int lo, uint8 comp); // 0x5042a0 [Private Static]
    void Swap(Void* array, int lhs, int rhs); // 0x5042a0 [Private Static]
    void SwapIfGreaterWithItems(Void* array, int lhs, int rhs, uint8 comp); // 0x5042a0 [Private Static]
    void IntroSortStruct(Void* array, int length, uint8 comp); // 0x5042a0 [Private Static]
    void IntroSortStruct_R(Void* array, ref int lo, ref int _hi, int depth, uint8 comp); // 0x5042a0 [Private Static]
    void InsertionSortStruct(Void* array, ref int lo, ref int hi, uint8 comp); // 0x5042a0 [Private Static]
    int PartitionStruct(Void* array, ref int lo, ref int hi, uint8 comp); // 0x5042a0 [Private Static]
    void HeapSortStruct(Void* array, ref int lo, ref int hi, uint8 comp); // 0x5042a0 [Private Static]
    void HeapifyStruct(Void* array, int i, int n, ref int lo, uint8 comp); // 0x5042a0 [Private Static]
    void SwapStruct(Void* array, int lhs, int rhs); // 0x5042a0 [Private Static]
    void SwapIfGreaterWithItemsStruct(Void* array, int lhs, int rhs, uint8 comp); // 0x5042a0 [Private Static]
    void CheckStrideMatchesSize(int stride); // 0x3cc540 [Private Static]
    void CheckComparer(T* array, int length, uint8 comp); // 0x5042a0 [Private Static]
};