.NET API 126,264 bytes
Array
public static int BinarySearch<
T>(
T[]
array,
int index,
int length,
T value)
public static void Clear(
Array array,
int index,
int length)
public static void ConstrainedCopy(
Array sourceArray,
int sourceIndex,
Array destinationArray,
int destinationIndex,
int length)
public static void Copy(
Array sourceArray,
Array destinationArray,
int length)
public static void Copy(
Array sourceArray,
int sourceIndex,
Array destinationArray,
int destinationIndex,
int length)
public static T[]
Empty<
T>()
public static int IndexOf(
Array array,
object value,
int startIndex)
public static int IndexOf(
Array array,
object value,
int startIndex,
int count)
public static int IndexOf<
T>(
T[]
array,
T value)
public static int IndexOf<
T>(
T[]
array,
T value,
int startIndex)
public static int IndexOf<
T>(
T[]
array,
T value,
int startIndex,
int count)
public static int LastIndexOf(
Array array,
object value,
int startIndex,
int count)
public static int LastIndexOf<
T>(
T[]
array,
T value,
int startIndex)
public static int LastIndexOf<
T>(
T[]
array,
T value,
int startIndex,
int count)
public static void Resize<
T>(
ref T array,
int newSize)
public static void Reverse(
Array array,
int index,
int length)
public static void Sort(
Array keys,
Array items,
int index,
int length)
public static void Sort(
Array array,
int index,
int length)
public static void Sort<
T>(
T[]
array)
public static void Sort<
T>(
T[]
array,
int index,
int length)
public static void Sort<
T>(
T[]
array,
int index,
int length,
IComparer<
T>
comparer)
public static void Sort<
TKey,
TValue>(
TKey[]
keys,
TValue[]
items)
public static void Sort<
TKey,
TValue>(
TKey[]
keys,
TValue[]
items,
IComparer<
TKey>
comparer)
public static void Sort<
TKey,
TValue>(
TKey[]
keys,
TValue[]
items,
int index,
int length)
public static void Sort<
TKey,
TValue>(
TKey[]
keys,
TValue[]
items,
int index,
int length,
IComparer<
TKey>
comparer)
public void SetValue(
object value,
int[]
indices)