Class CoreUnsafeUtils
Static class with unsafe utility functions.
Inheritance
CoreUnsafeUtils
Assembly: Unity.RenderPipelines.Core.Runtime.dll
Syntax
public static class CoreUnsafeUtils
Methods
| Name |
Description |
|
CombineHashes(int, Hash128*, Hash128*)
|
Combine hashes.
|
|
CombineHashes<TValue, TGetter>(int, void*, Hash128*)
|
Combine all of the hashes of a collection of hashes.
|
|
CompareHashes(int, Hash128*, int, Hash128*, int*, int*, out int, out int)
|
Compare hashes.
|
|
CompareHashes<TOldValue, TOldGetter, TNewValue, TNewGetter>(int, void*, int, void*, int*, int*, out int, out int)
|
Compare hashes of two collections and provide
a list of indices removeIndices to remove in oldHashes
and a list of indices addIndices to add in newHashes.
Assumes that newHashes and oldHashes are sorted.
|
|
CopyTo<T>(List<T>, void*, int)
|
Extension method to copy elements of a list into a buffer.
|
|
CopyTo<T>(T[], void*, int)
|
Extension method to copy elements of an array into a buffer.
|
|
HaveDuplicates(int[])
|
Checks for duplicates in an array.
|
|
IndexOf<T>(void*, int, T)
|
Index of an element in a buffer.
|
|
InsertionSort(uint[], int)
|
Insertion sort
|
|
InsertionSort(NativeArray<uint>, int)
|
Insertion sort
|
|
MergeSort(uint[], int, ref uint[])
|
Merge sort - non recursive
|
|
MergeSort(NativeArray<uint>, int, ref NativeArray<uint>)
|
Merge sort - non recursive
|
|
QuickSort(uint[], int, int)
|
Quick Sort
|
|
QuickSort<T>(int, void*)
|
Quick sort.
|
|
QuickSort<TValue, TKey, TGetter>(int, void*)
|
Quick sort.
|
|
QuickSort<TValue, TKey, TGetter>(void*, int, int)
|
Quick sort.
|
|
RadixSort(uint[], int, ref uint[], int)
|
Radix sort or bucket sort, stable and non in place.
|
|
RadixSort(NativeArray<uint>, int, ref NativeArray<uint>, int)
|
Radix sort or bucket sort, stable and non in place.
|