Collection |
Helper class for working with collections.
Inheritance HierarchyNamespace: NeoAxis
Assembly: NeoAxis.Core (in NeoAxis.Core.dll) Version: 2026.1.1.0 (2026.1.1.0)
SyntaxC#
public static class CollectionUtility
The CollectionUtility type exposes the following members.
Methods| Name | Description | |
|---|---|---|
  | FromByteArrayT | |
 | GetReverseT(IListT) | Returns reversed list. |
| GetReverseT(LinkedListT) | Returns reversed linked list. |
| InsertionSortT(T, ComparisonT) | Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. No memory allocation. Stable sort. |
| InsertionSortT(T, IComparerT) | Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. No memory allocation. Stable sort. |
| InsertionSortT(IListT, IComparerT) | Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. No memory allocation. Stable sort. |
| InsertionSortT(IListT, ComparisonT) | Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. No memory allocation. Stable sort. |
| MergeT(ICollectionT) | Merges a collection of arrays into one. |
| MergeT(T, T) | Merges two arrays into one. |
| MergeSortT(T, IComparerT, Boolean) | Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort. |
| MergeSortT(T, ComparisonT, Boolean) | Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort. |
| MergeSortT(IListT, IComparerT, Boolean) | Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort. |
| MergeSortT(IListT, ComparisonT, Boolean) | Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort. |
| MergeSortUnmanagedT(T, IComparerT, Boolean) | Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort. |
| MergeSortUnmanagedT(T, ComparisonT, Boolean) | Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort. |
| MergeSortUnmanagedT(T*, Int32, PointerComparisonT, Boolean) | Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort. |
| MergeSortUnmanagedT(T*, Int32, IComparerT, Boolean) | Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort. |
| MergeSortUnmanagedT(T*, Int32, ComparisonT, Boolean) | Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort. |
| SelectionSortT(IListT) | The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort. |
| SelectionSortT(T, ComparisonT) | The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort. |
| SelectionSortT(T, IComparerT) | The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort. |
| SelectionSortT(IListT, IComparerT) | The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort. |
| SelectionSortT(IListT, ComparisonT) | The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort. |
| ToByteArrayT | |
| ToVector2 | |
| ToVector2F | |
| ToVector3 | |
| ToVector3F(Vector3) | |
| ToVector3F(Vector3H) | |
| ToVector3H | |
| ToVector4 | |
| ToVector4F(Vector4) | |
| ToVector4F(Vector4H) | |
| ToVector4H |
See Also