Class ArrayUtil
Methods for manipulating arrays.
@lucene.internal
Inheritance
Assembly: DistributedLucene.Net.dll
Syntax
public sealed class ArrayUtil : object
Fields
Name | Description |
---|---|
MAX_ARRAY_LENGTH | Maximum length for an array; we set this to "a
bit" below |
Methods
Name | Description |
---|---|
Equals(Byte[], Int32, Byte[], Int32, Int32) | See if two array slices are the same. |
Equals(Char[], Int32, Char[], Int32, Int32) | See if two array slices are the same. |
Equals(Int32[], Int32, Int32[], Int32, Int32) | See if two array slices are the same. |
GetHashCode(Byte[], Int32, Int32) | Returns hash of bytes in range start (inclusive) to end (inclusive) |
GetHashCode(Char[], Int32, Int32) | Returns hash of chars in range start (inclusive) to end (inclusive) |
GetNaturalComparer<T>() | Get the natural
The comparer returned depends on the
NOTE: This was naturalComparer() in Lucene |
GetShrinkSize(Int32, Int32, Int32) | |
Grow(Boolean[]) | |
Grow(Boolean[], Int32) | |
Grow(Byte[]) | |
Grow(Byte[], Int32) | |
Grow(Char[]) | |
Grow(Char[], Int32) | |
Grow(Double[]) | |
Grow(Double[], Int32) | |
Grow(Int16[]) | |
Grow(Int16[], Int32) | |
Grow(Int32[]) | |
Grow(Int32[], Int32) | |
Grow(Int32[][]) | |
Grow(Int32[][], Int32) | |
Grow(Int64[]) | |
Grow(Int64[], Int32) | |
Grow(SByte[], Int32) | |
Grow(Single[]) | |
Grow(Single[], Int32) | |
Grow(Single[][]) | |
Grow(Single[][], Int32) | |
IntroSort<T>(T[]) | Sorts the given array in natural order. This method uses the intro sort algorithm, but falls back to insertion sort for small arrays. |
IntroSort<T>(T[], IComparer<T>) | Sorts the given array using the |
IntroSort<T>(T[], Int32, Int32) | Sorts the given array slice in natural order. This method uses the intro sort algorithm, but falls back to insertion sort for small arrays. |
IntroSort<T>(T[], Int32, Int32, IComparer<T>) | Sorts the given array slice using the |
Oversize(Int32, Int32) | Returns an array size >= NOTE: this was originally borrowed from Python 2.4.2 listobject.c sources (attribution in LICENSE.txt), but has now been substantially changed based on discussions from java-dev thread with subject "Dynamic array reallocation algorithms", started on Jan 12 2010. @lucene.internal |
ParseInt32(Char[]) | Parses the string argument as if it was an NOTE: This was parseInt() in Lucene |
ParseInt32(Char[], Int32, Int32) | Parses a char array into an NOTE: This was parseInt() in Lucene |
ParseInt32(Char[], Int32, Int32, Int32) | Parses the string argument as if it was an NOTE: This was parseInt() in Lucene |
Shrink(Boolean[], Int32) | |
Shrink(Byte[], Int32) | |
Shrink(Char[], Int32) | |
Shrink(Int16[], Int32) | |
Shrink(Int32[], Int32) | |
Shrink(Int32[][], Int32) | |
Shrink(Int64[], Int32) | |
Shrink(Single[][], Int32) | |
Swap<T>(T[], Int32, Int32) | Swap values stored in slots |
TimSort<T>(T[]) | Sorts the given array in natural order. this method uses the Tim sort algorithm, but falls back to binary sort for small arrays. |
TimSort<T>(T[], IComparer<T>) | Sorts the given array using the |
TimSort<T>(T[], Int32, Int32) | Sorts the given array slice in natural order. this method uses the Tim sort algorithm, but falls back to binary sort for small arrays. |
TimSort<T>(T[], Int32, Int32, IComparer<T>) | Sorts the given array slice using the |
ToInt32Array(ICollection<Nullable<Int32>>) | NOTE: This was toIntArray() in Lucene |