Implements a variable-size List that uses an array of objects to store the elements. A List has a capacity, which is the allocated length of the internal array. As elements are added to a List, the capacity of the List is automatically increased as required by reallocating the internal array. More...

Inherits IList< T >, and IList.

Classes
struct	Enumerator

class	SynchronizedList

Public Member Functions
	AList (IEnumerable< T > collection)

	AList (int capacity)

void	Add (T item)

void	AddRange (IEnumerable< T > collection)

ReadOnlyCollection< T >	AsReadOnly ()

int	BinarySearch (int index, int count, T item, IComparer< T > comparer)

int	BinarySearch (T item)

int	BinarySearch (T item, IComparer< T > comparer)

void	Clear ()

bool	Contains (T item)

AList< TOutput >	ConvertAll< TOutput > (Converter< T, TOutput > converter)

void	CopyTo (int index, T[] array, int arrayIndex, int count)

void	CopyTo (T[] array)

void	CopyTo (T[] array, int arrayIndex)

bool	Exists (Predicate< T > match)

T	Find (Predicate< T > match)

AList< T >	FindAll (Predicate< T > match)

int	FindIndex (int startIndex, int count, Predicate< T > match)

int	FindIndex (int startIndex, Predicate< T > match)

int	FindIndex (Predicate< T > match)

T	FindLast (Predicate< T > match)

int	FindLastIndex (int startIndex, int count, Predicate< T > match)

int	FindLastIndex (int startIndex, Predicate< T > match)

int	FindLastIndex (Predicate< T > match)

void	ForEach (Action< T > action)

Enumerator	GetEnumerator ()

T[]	getInternalArray ()

AList< T >	GetRange (int index, int count)

int	IndexOf (T item)

int	IndexOf (T item, int index)

int	IndexOf (T item, int index, int count)

void	Insert (int index, T item)

void	InsertRange (int index, IEnumerable< T > collection)

int	LastIndexOf (T item)

int	LastIndexOf (T item, int index)

int	LastIndexOf (T item, int index, int count)

bool	Remove (T item)

int	RemoveAll (Predicate< T > match)

void	RemoveAt (int index)

void	RemoveRange (int index, int count)

void	Reverse ()

void	Reverse (int index, int count)

void	Sort ()

void	Sort (Comparison< T > comparison)

void	Sort (IComparer< T > comparer)

void	Sort (int index, int count, IComparer< T > comparer)

T[]	ToArray ()

void	TrimExcess ()

bool	TrueForAll (Predicate< T > match)

Properties
int	Capacity `[get, set]`

int	Count `[get]`

T	this[int index] `[get, set]`

Detailed Description

Implements a variable-size List that uses an array of objects to store the elements. A List has a capacity, which is the allocated length of the internal array. As elements are added to a List, the capacity of the List is automatically increased as required by reallocating the internal array.

Template Parameters

T Data type

The documentation for this class was generated from the following file:

/home/jenkins/ci/cgrepo/appsdk/VRay_SDK_CSharp/VRay_SDK_CSharp/Types/Utils/Helper.cs

Classes

Public Member Functions

Properties

Detailed Description