TArray Class
Definition
type TArray = class(TObject)- Inheritance
-
TObjectTArray
Constants
Methods
| BinarySearch<T>(array of T, T, Integer) |
Searches a sorted array for the given value, using a binary search algorithm returning the index for the first found value using the default comparer. |
| BinarySearch<T>(array of T, T, Integer, IComparer<T>) |
Searches a sorted array for the given value, using a binary search algorithm returning the index for the first found value using the specified comparer. |
| BinarySearch<T>(array of T, T, Integer, IComparer<T>, Integer, Integer) |
Searches a range of elements in a sorted array for the given value, using a binary search algorithm returning the index for the first found value using the specified comparer. |
| BinarySearch<T>(array of T, T, Integer, Integer, Integer) |
Searches a range of elements in a sorted array for the given value, using a binary search algorithm returning the index for the first found value using the default comparer. |
| BinarySearch<T>(array of T, T, Integer, TComparison<T>) |
Searches a sorted array for the given value, using a binary search algorithm returning the index for the first found value using the specified comparison. |
| BinarySearch<T>(array of T, T, Integer, TComparison<T>, Integer, Integer) |
Searches a range of elements in a sorted array for the given value, using a binary search algorithm returning the index for the first found value using the specified comparison. |
| BinarySearchInternal<T>(array of T, T, Integer, IComparer<T>) | |
| BinarySearchUpperBound<T>(array of T, T, Integer) |
Searches a sorted array for the given value, using a binary search algorithm returning the index for the last found value. |
| BinarySearchUpperBound<T>(array of T, T, Integer, IComparer<T>) |
Searches a sorted array for the given value, using a binary search algorithm returning the index for the last found value using the specified comparer. |
| BinarySearchUpperBound<T>(array of T, T, Integer, IComparer<T>, Integer, Integer) |
Searches a range of elements in a sorted array for the given value, using a binary search algorithm returning the index for the last found value using the specified comparer. |
| BinarySearchUpperBound<T>(array of T, T, Integer, Integer, Integer) |
Searches a range of elements in a sorted array for the given value, using a binary search algorithm returning the index for the last found value using the default comparer. |
| BinarySearchUpperBound<T>(array of T, T, Integer, TComparison<T>) |
Searches a sorted array for the given value, using a binary search algorithm returning the index for the last found value using the specified comparer. |
| BinarySearchUpperBound<T>(array of T, T, Integer, TComparison<T>, Integer, Integer) |
Searches a range of elements in a sorted array for the given value, using a binary search algorithm returning the index for the last found value using the specified comparison. |
| BinarySearchUpperBoundInternal<T>(array of T, T, Integer, IComparer<T>) | |
| Concat<T>(array of TArray<T>) |
Concatenates an array of arrays to one array |
| Contains<T>(array of T, T) |
Determines whether the specified item exists as an element in an array. |
| Copy<T>(array of T) |
Copies an open array to a dynamic array. |
| Copy<T>(array of T, array of T, NativeInt) |
Copies the specified count of elements from the source array to the target array. |
| Copy<T>(array of T, array of T, NativeInt, NativeInt, NativeInt) |
Copies the specified count of elements from the specified position in the source array to the specified position in the target array. |
| DownHeap<T>(array of T, TCompareMethod<T>, NativeInt) | |
| DownHeap_Ref(PByte, NativeInt, TCompareMethodRef, NativeInt, NativeInt) | |
| ForEach<T>(array of T, Action<T>) |
Executes the specified action for each item in the specified array. |
| GetDepthLimit(Integer) | |
| HeapSort<T>(array of T, TCompareMethod<T>) | |
| HeapSort_Ref(PByte, NativeInt, TCompareMethodRef, NativeInt) | |
| IndexOf<T>(array of T, T) |
Searches for the specified element and returns the index of the first occurrence within the entire array. |
| IndexOf<T>(array of T, T, Integer) |
Searches for the specified element and returns the index of the first occurrence within the range of elements in the array that extends from the specified index to the last element. |
| IndexOf<T>(array of T, T, Integer, Integer) |
Searches for the specified element and returns the index of the first occurrence within the range of elements in the array that starts at the specified index and contains the specified number of elements. |
| IndexOf<T>(array of T, T, Integer, Integer, IEqualityComparer<T>) |
Searches for the specified element and returns the index of the first occurrence within the range of elements in the array that starts at the specified index and contains the specified number of elements using the specified equality comparer. |
| InsertionSort<T>(array of T, IComparer<T>) | |
| InsertionSort_Ref(PByte, NativeInt, TCompareMethodRef, NativeInt) | |
| IntroSort<T>(array of T, IComparer<T>, Integer) | |
| IntroSort_Double(array of Double, IComparer<Double>) | |
| IntroSort_Extended(array of Extended, IComparer<Extended>) | |
| IntroSort_Int16(array of Int16, IComparer<Int16>) | |
| IntroSort_Int24(array of Int24, IComparer<Int24>) | |
| IntroSort_Int32(array of Int32, IComparer<Int32>) | |
| IntroSort_Int64(array of Int64, IComparer<Int64>) | |
| IntroSort_Int8(array of Int8, IComparer<Int8>) | |
| IntroSort_Method(array of TMethodPointer, IComparer<TMethodPointer>) | |
| IntroSort_Ref(PByte, NativeInt, IComparerRef, NativeInt, Integer) | |
| IntroSort_Single(array of Single, IComparer<Single>) | |
| LastIndexOf<T>(array of T, T) |
Searches for the specified element and returns the index of the last occurrence within the entire array. |
| LastIndexOf<T>(array of T, T, Integer) |
Searches for the specified element and returns the index of the last occurrence within the range of elements in the array that extends from the specified index to the last element. |
| LastIndexOf<T>(array of T, T, Integer, Integer) |
Searches for the specified element and returns the index of the last occurrence within the range of elements in the array that starts at the specified index and contains the specified number of elements. |
| LastIndexOf<T>(array of T, T, Integer, Integer, IEqualityComparer<T>) |
Searches for the specified element and returns the index of the last occurrence within the range of elements in the array that starts at the specified index and contains the specified number of elements using the specified equality comparer. |
| QuickSortPartition<T>(array of T, TCompareMethod<T>) | |
| QuickSortPartition_Ref(PByte, NativeInt, TCompareMethodRef, NativeInt) | |
| Reverse<T>(Pointer, NativeInt) |
Reverses the elements in the specified range in the array. |
| Reverse<T>(array of T) |
Reverses the elements in the entire array. |
| Reverse<T>(array of T, Integer, Integer) |
Reverses the elements in the specified range in the array. |
| Reverse_Double(PDouble, NativeInt) | |
| Reverse_Extended(PExtended, NativeInt) | |
| Reverse_Generic<T>(array of T) | |
| Reverse_Int16(PInt16, NativeInt) | |
| Reverse_Int24(PInt24, NativeInt) | |
| Reverse_Int32(PInt32, NativeInt) | |
| Reverse_Int64(PInt64, NativeInt) | |
| Reverse_Int8(PInt8, NativeInt) | |
| Reverse_Method(PMethodPointer, NativeInt) | |
| Reverse_Ref(PByte, NativeInt, NativeInt) | |
| Reverse_Single(PSingle, NativeInt) | |
| Shuffle<T>(Pointer, NativeInt) |
Shuffles the elements in the specified range in the array using the Fisher-Yates algorithm. |
| Shuffle<T>(array of T) |
Shuffles the elements in the array using the Fisher-Yates algorithm. |
| Shuffle<T>(array of T, Integer, Integer) |
Shuffles the specified count of elements in the array starting at the specified index using the Fisher-Yates algorithm. |
| Shuffle_Double(PDouble, NativeInt) | |
| Shuffle_Extended(PExtended, NativeInt) | |
| Shuffle_Generic<T>(array of T) | |
| Shuffle_Int16(PInt16, NativeInt) | |
| Shuffle_Int24(PInt24, NativeInt) | |
| Shuffle_Int32(PInt32, NativeInt) | |
| Shuffle_Int64(PInt64, NativeInt) | |
| Shuffle_Int8(PInt8, NativeInt) | |
| Shuffle_Method(PMethodPointer, NativeInt) | |
| Shuffle_Ref(PByte, NativeInt, NativeInt) | |
| Shuffle_Single(PSingle, NativeInt) | |
| Sort<T>(array of T) |
Sorts the elements in an array using the default comparer. |
| Sort<T>(array of T, IComparer<T>) |
Sorts the elements in an array using the specified comparer. |
| Sort<T>(array of T, IComparer<T>, Integer, Integer) |
Sorts the specified range of elements in an array using the specified comparer. |
| Sort<T>(array of T, TComparison<T>) |
Sorts the elements in an array using the specified comparison. |
| Sort<T>(array of T, TComparison<T>, Integer, Integer) |
Sorts the specified range of elements in an array using the specified comparison. |
| StableSort<T>(array of T) |
Sorts the elements in an array using the default comparer. |
| StableSort<T>(array of T, IComparer<T>) |
Sorts the elements in an array using the specified comparer. |
| StableSort<T>(array of T, IComparer<T>, Integer, Integer) |
Sorts the specified range of elements in an array using the specified comparer. |
| StableSort<T>(array of T, Integer, Integer) |
Sorts the specified range of elements in an array using the default comparer. |
| StableSort<T>(array of T, TComparison<T>) |
Sorts the elements in an array using the specified comparison. |
| StableSort<T>(array of T, TComparison<T>, Integer, Integer) |
Sorts the specified range of elements in an array using the specified comparison. |
| Swap<T>(Pointer, Pointer) |
Swaps the values of the specified variables. |
Fields
| UnsafeStableSort |
When |