Click or drag to resize

CollectionUtility Class

Helper class for working with collections.
Inheritance Hierarchy
SystemObject
  NeoAxisCollectionUtility

Namespace:  NeoAxis
Assembly:  NeoAxis.Core (in NeoAxis.Core.dll) Version: 2022.1.1.0 (2022.1.1.0)
Syntax
C#
public static class CollectionUtility

The CollectionUtility type exposes the following members.

Methods
  NameDescription
Public methodStatic memberFromByteArrayT
Public methodStatic memberGetReverseT(IListT)
Returns reversed list.
Public methodStatic memberGetReverseT(LinkedListT)
Returns reversed linked list.
Public methodStatic memberInsertionSortT(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.
Public methodStatic memberInsertionSortT(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.
Public methodStatic memberInsertionSortT(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.
Public methodStatic memberInsertionSortT(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.
Public methodStatic memberMergeT(ICollectionT)
Merges a collection of arrays into one.
Public methodStatic memberMergeT(T, T)
Merges two arrays into one.
Public methodStatic memberMergeSort(Int32*, Int32, IComparerInt32)
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.
Public methodStatic memberMergeSort(Int32*, Int32, ComparisonInt32)
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.
Public methodStatic memberMergeSortT(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.
Public methodStatic memberMergeSortT(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.
Public methodStatic memberMergeSortT(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.
Public methodStatic memberMergeSortT(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.
Public methodStatic memberSelectionSortT(IListT)
The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort.
Public methodStatic memberSelectionSortT(IListT, IComparerT)
The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort.
Public methodStatic memberSelectionSortT(IListT, ComparisonT)
The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort.
Public methodStatic memberSelectionSortT(T, IComparerT)
The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort.
Public methodStatic memberSelectionSortT(T, ComparisonT)
The selection sort algorithm sorts an array by repeatedly finding the minimum element. No memory allocation. Stable sort.
Public methodStatic memberToByteArrayT
Top
See Also