C5  2.4
The C5 Generic Collection Library for C# and CLI is a comprehensive collection library supporting lists, sets, bags, dictionaries, priority queues, (FIFO) queues, and (LIFO) stacks. C5 runs on .NET 3.5+, Silverlight 5, Windows Phone 8, Xamarin.iOS, Xamarin.Android, and Mono.
C5.IList< T > Interface Template Reference

This is an indexed collection, where the item order is chosen by the user at insertion time. More...

Inheritance diagram for C5.IList< T >:
C5.IIndexed< T > C5.ISequenced< T > C5.ICollection< T > C5.IDirectedCollectionValue< T > C5.IExtensible< T > C5.ICollectionValue< T > C5.IDirectedEnumerable< T > C5.ICollectionValue< T > C5.IShowable C5.IShowable C5.ArrayList< T > C5.GuardedList< T > C5.HashedArrayList< T > C5.HashedLinkedList< T > C5.LinkedList< T > C5.WrappedArray< T >

Public Member Functions

new bool Add (T item)
 
new void Clear ()
 
new bool Contains (T item)
 
new void CopyTo (T[] array, int index)
 
new bool Remove (T item)
 
new int IndexOf (T item)
 Searches for an item in the list going forwards from the start. More...
 
new T RemoveAt (int index)
 Remove the item at a specific position of the list. More...
 
void Insert (IList< T > pointer, T item)
 Insert an item at the end of a compatible view, used as a pointer. More...
 
void InsertFirst (T item)
 Insert an item at the front of this list.

Exceptions
DuplicateNotAllowedExceptionif the list has
More...
 
void InsertLast (T item)
 Insert an item at the back of this list.

Exceptions
DuplicateNotAllowedExceptionif the list has
More...
 
void InsertAll (int index, SCG.IEnumerable< T > items)
 Insert into this list all items from an enumerable collection starting at a particular index. More...
 
IList< T > FindAll (Func< T, bool > filter)
 Create a new list consisting of the items of this list satisfying a certain predicate. More...
 
IList< V > Map< V > (Func< T, V > mapper)
 Create a new list consisting of the results of mapping all items of this list. The new list will use the default equalityComparer for the item type V. More...
 
IList< V > Map< V > (Func< T, V > mapper, SCG.IEqualityComparer< V > equalityComparer)
 Create a new list consisting of the results of mapping all items of this list. The new list will use a specified equalityComparer for the item type. More...
 
Remove ()
 Remove one item from the list: from the front if More...
 
RemoveFirst ()
 Remove one item from the front of the list.

Exceptions
NoSuchItemExceptionif this list is empty.
More...
 
RemoveLast ()
 Remove one item from the back of the list.

Exceptions
NoSuchItemExceptionif this list is empty.
More...
 
IList< T > View (int start, int count)
 Create a list view on this list.

Exceptions
ArgumentOutOfRangeExceptionif the view would not fit into this list.
More...
 
IList< T > ViewOf (T item)
 Create a list view on this list containing the (first) occurrence of a particular item.

Exceptions
NoSuchItemExceptionif the item is not in this list.
More...
 
IList< T > LastViewOf (T item)
 Create a list view on this list containing the last occurrence of a particular item.

Exceptions
NoSuchItemExceptionif the item is not in this list.
More...
 
IList< T > Slide (int offset)
 Slide this list view along the underlying list. More...
 
IList< T > Slide (int offset, int size)
 Slide this list view along the underlying list, changing its size. More...
 
bool TrySlide (int offset)
 
bool TrySlide (int offset, int size)
 
IList< T > Span (IList< T > otherView)
 
void Reverse ()
 Reverse the list so the items are in the opposite sequence order. More...
 
bool IsSorted ()
 Check if this list is sorted according to the default sorting order for the item type T, as defined by the T:C5.Comparer`1 class More...
 
bool IsSorted (SCG.IComparer< T > comparer)
 Check if this list is sorted according to a specific sorting order. More...
 
void Sort ()
 Sort the items of the list according to the default sorting order for the item type T, as defined by the T:C5.Comparer`1 class More...
 
void Sort (SCG.IComparer< T > comparer)
 Sort the items of the list according to a specified sorting order. More...
 
void Shuffle ()
 Randomly shuffle the items of this list. More...
 
void Shuffle (Random rnd)
 Shuffle the items of this list according to a specific random source. More...
 
- Public Member Functions inherited from C5.IIndexed< T >
int LastIndexOf (T item)
 Searches for an item in the list going backwards from the end. More...
 
int FindIndex (Func< T, bool > predicate)
 Check if there exists an item that satisfies a specific predicate in this collection and return the index of the first one. More...
 
int FindLastIndex (Func< T, bool > predicate)
 Check if there exists an item that satisfies a specific predicate in this collection and return the index of the last one. More...
 
void RemoveInterval (int start, int count)
 Remove all items in an index interval. More...
 
- Public Member Functions inherited from C5.ISequenced< T >
int GetSequencedHashCode ()
 The hashcode is defined as More...
 
bool SequencedEquals (ISequenced< T > otherCollection)
 Compare this sequenced collection to another one in sequence order. More...
 
- Public Member Functions inherited from C5.ICollection< T >
int GetUnsequencedHashCode ()
 The unordered collection hashcode is defined as the sum of More...
 
bool UnsequencedEquals (ICollection< T > otherCollection)
 Compare the contents of this collection to another one without regards to the sequence order. The comparison will use this collection's itemequalityComparer to compare individual items. More...
 
int ContainsCount (T item)
 Count the number of items of the collection equal to a particular value. Returns 0 if and only if the value is not in the collection. More...
 
ICollectionValue< T > UniqueItems ()
 
ICollectionValue< KeyValuePair< T, int > > ItemMultiplicities ()
 
bool ContainsAll (SCG.IEnumerable< T > items)
 Check whether this collection contains all the values in another collection. If this collection has bag semantics ( More...
 
bool Find (ref T item)
 Check if this collection contains an item equivalent according to the itemequalityComparer to a particular value. If so, return in the ref argument (a binary copy of) the actual value found. More...
 
bool FindOrAdd (ref T item)
 Check if this collection contains an item equivalent according to the itemequalityComparer to a particular value. If so, return in the ref argument (a binary copy of) the actual value found. Else, add the item to the collection. More...
 
bool Update (T item)
 Check if this collection contains an item equivalent according to the itemequalityComparer to a particular value. If so, update the item in the collection with a (binary copy of) the supplied value. If the collection has bag semantics, it depends on the value of DuplicatesByCounting if this updates all equivalent copies in the collection or just one. More...
 
bool Update (T item, out T olditem)
 Check if this collection contains an item equivalent according to the itemequalityComparer to a particular value. If so, update the item in the collection with a (binary copy of) the supplied value. If the collection has bag semantics, it depends on the value of DuplicatesByCounting if this updates all equivalent copies in the collection or just one. More...
 
bool UpdateOrAdd (T item)
 Check if this collection contains an item equivalent according to the itemequalityComparer to a particular value. If so, update the item in the collection to with a binary copy of the supplied value; else add the value to the collection. More...
 
bool UpdateOrAdd (T item, out T olditem)
 Check if this collection contains an item equivalent according to the itemequalityComparer to a particular value. If so, update the item in the collection to with a binary copy of the supplied value; else add the value to the collection. More...
 
bool Remove (T item, out T removeditem)
 Remove a particular item from this collection if found. If the collection has bag semantics only one copy equivalent to the supplied item is removed, which one is implementation dependent. If an item was removed, report a binary copy of the actual item removed in the argument. More...
 
void RemoveAllCopies (T item)
 Remove all items equivalent to a given value. More...
 
void RemoveAll (SCG.IEnumerable< T > items)
 Remove all items in another collection from this one. If this collection has bag semantics, take multiplicities into account. More...
 
void RetainAll (SCG.IEnumerable< T > items)
 Remove all items not in some other collection from this one. If this collection has bag semantics, take multiplicities into account. More...
 
- Public Member Functions inherited from C5.IExtensible< T >
void AddAll (SCG.IEnumerable< T > items)
 Add the elements from another collection with a more specialized item type to this collection. If this collection has set semantics, only items not already in the collection will be added. More...
 
bool Check ()
 Check the integrity of the internal data structures of this collection. This is only relevant for developers of the library More...
 
- Public Member Functions inherited from C5.ICollectionValue< T >
T[] ToArray ()
 Create an array with the items of this collection (in the same order as an enumerator would output them). More...
 
void Apply (Action< T > action)
 Apply a delegate to all items of this collection. More...
 
bool Exists (Func< T, bool > predicate)
 Check if there exists an item that satisfies a specific predicate in this collection. More...
 
bool Find (Func< T, bool > predicate, out T item)
 Check if there exists an item that satisfies a specific predicate in this collection and return the first one in enumeration order. More...
 
bool All (Func< T, bool > predicate)
 Check if all items in this collection satisfies a specific predicate. More...
 
Choose ()
 Choose some item of this collection. More...
 
SCG.IEnumerable< T > Filter (Func< T, bool > filter)
 Create an enumerable, enumerating the items of this collection that satisfies a certain condition. More...
 
- Public Member Functions inherited from C5.IShowable
bool Show (StringBuilder stringbuilder, ref int rest, IFormatProvider formatProvider)
 Format More...
 
- Public Member Functions inherited from C5.IDirectedCollectionValue< T >
new IDirectedCollectionValue< T > Backwards ()
 Create a collection containing the same items as this collection, but whose enumerator will enumerate the items backwards. The new collection will become invalid if the original is modified. Method typically used as in More...
 
bool FindLast (Func< T, bool > predicate, out T item)
 Check if there exists an item that satisfies a specific predicate in this collection and return the first one in enumeration order. More...
 

Properties

First [get]
 
Last [get]
 
bool FIFO [get, set]
 Since More...
 
bool IsFixedSize [get]
 
new T this[int index] [get, set]
 On this list, this indexer is read/write. More...
 
new int Count [get]
 
new bool IsReadOnly [get]
 
IList< T > Underlying [get]
 Null if this list is not a view. More...
 
int Offset [get]
 
bool IsValid [get]
 
- Properties inherited from C5.IIndexed< T >
Speed IndexingSpeed [get]
 
IDirectedCollectionValue< T > this[int start, int count] [get]
 
- Properties inherited from C5.ICollection< T >
Speed ContainsSpeed [get]
 The value is symbolic indicating the type of asymptotic complexity in terms of the size of this collection (worst-case or amortized as relevant). More...
 
new int Count [get]
 
new bool IsReadOnly [get]
 If true any call of an updating operation will throw an More...
 
- Properties inherited from C5.IExtensible< T >
bool IsReadOnly [get]
 If true any call of an updating operation will throw an More...
 
bool AllowsDuplicates [get]
 
SCG.IEqualityComparer< T > EqualityComparer [get]
 (Here should be a discussion of the role of equalityComparers. Any ). More...
 
bool DuplicatesByCounting [get]
 By convention this is true for any collection with set semantics. More...
 
- Properties inherited from C5.ICollectionValue< T >
EventTypeEnum ListenableEvents [get]
 A flag bitmap of the events subscribable to by this collection. More...
 
EventTypeEnum ActiveEvents [get]
 A flag bitmap of the events currently subscribed to by this collection. More...
 
bool IsEmpty [get]
 
int Count [get]
 
Speed CountSpeed [get]
 The value is symbolic indicating the type of asymptotic complexity in terms of the size of this collection (worst-case or amortized as relevant). More...
 
- Properties inherited from C5.IDirectedEnumerable< T >
EnumerationDirection Direction [get]
 

Additional Inherited Members

- Events inherited from C5.ICollectionValue< T >
CollectionChangedHandler< T > CollectionChanged
 The change event. Will be raised for every change operation on the collection. More...
 
CollectionClearedHandler< T > CollectionCleared
 The change event. Will be raised for every clear operation on the collection. More...
 
ItemsAddedHandler< T > ItemsAdded
 The item added event. Will be raised for every individual addition to the collection. More...
 
ItemInsertedHandler< T > ItemInserted
 The item inserted event. Will be raised for every individual insertion to the collection. More...
 
ItemsRemovedHandler< T > ItemsRemoved
 The item removed event. Will be raised for every individual removal from the collection. More...
 
ItemRemovedAtHandler< T > ItemRemovedAt
 The item removed at event. Will be raised for every individual removal at from the collection. More...
 

Detailed Description

This is an indexed collection, where the item order is chosen by the user at insertion time.

NBNBNB: we need a description of the view functionality here!

Member Function Documentation

new bool C5.IList< T >.Add ( item)
new bool C5.IList< T >.Contains ( item)
new void C5.IList< T >.CopyTo ( T[]  array,
int  index 
)

Parameters
array
index

Implements C5.ICollection< T >.

Implemented in C5.WrappedArray< T >.

IList<T> C5.IList< T >.FindAll ( Func< T, bool >  filter)

Create a new list consisting of the items of this list satisfying a certain predicate.

Parameters
filterThe filter delegate defining the predicate.
Returns
The new list.

Implemented in C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.GuardedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

new int C5.IList< T >.IndexOf ( item)

Searches for an item in the list going forwards from the start.

Parameters
itemItem to search for.
Returns
Index of item from start. A negative number if item not found, namely the one's complement of the index at which the Add operation would put the item.

Implements C5.IIndexed< T >.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

void C5.IList< T >.Insert ( IList< T >  pointer,
item 
)

Insert an item at the end of a compatible view, used as a pointer.

The pointer must be a view on the same list as this and the endpoint of pointer must be a valid insertion point of this

Exceptions
IncompatibleViewExceptionIf
pointer
is not a view on the same list as
this
IndexOutOfRangeException?????? if the endpoint of
pointer
is not inside
this
DuplicateNotAllowedExceptionif the list has and the item is already in the list.
Parameters
pointer
item

Implemented in C5.GuardedList< T >, C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

void C5.IList< T >.InsertAll ( int  index,
SCG.IEnumerable< T >  items 
)

Insert into this list all items from an enumerable collection starting at a particular index.

Exceptions
IndexOutOfRangeExceptionif
index
is negative or > the size of the collection.
DuplicateNotAllowedExceptionif the list has and one of the items to insert is already in the list.
Parameters
indexIndex to start inserting at
itemsItems to insert

Implemented in C5.GuardedList< T >, C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

void C5.IList< T >.InsertFirst ( item)

Insert an item at the front of this list.

Exceptions
DuplicateNotAllowedExceptionif the list has

AllowsDuplicates==false and the item is already in the list.

Parameters
itemThe item to insert.

Implemented in C5.GuardedList< T >, C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

void C5.IList< T >.InsertLast ( item)

Insert an item at the back of this list.

Exceptions
DuplicateNotAllowedExceptionif the list has

AllowsDuplicates==false and the item is already in the list.

Parameters
itemThe item to insert.

Implemented in C5.GuardedList< T >, C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

bool C5.IList< T >.IsSorted ( )

Check if this list is sorted according to the default sorting order for the item type T, as defined by the T:C5.Comparer`1 class

Exceptions
NotComparableExceptionif T is not comparable
Returns
True if the list is sorted, else false.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

bool C5.IList< T >.IsSorted ( SCG.IComparer< T >  comparer)

Check if this list is sorted according to a specific sorting order.

Parameters
comparerThe comparer defining the sorting order.
Returns
True if the list is sorted, else false.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

IList<T> C5.IList< T >.LastViewOf ( item)

Create a list view on this list containing the last occurrence of a particular item.

Exceptions
NoSuchItemExceptionif the item is not in this list.

Parameters
itemThe item to find.
Returns
The new list view.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

IList<V> C5.IList< T >.Map< V > ( Func< T, V >  mapper)

Create a new list consisting of the results of mapping all items of this list. The new list will use the default equalityComparer for the item type V.

Template Parameters
VThe type of items of the new list
Parameters
mapperThe delegate defining the map.
Returns
The new list.

Implemented in C5.GuardedList< T >, C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

IList<V> C5.IList< T >.Map< V > ( Func< T, V >  mapper,
SCG.IEqualityComparer< V >  equalityComparer 
)

Create a new list consisting of the results of mapping all items of this list. The new list will use a specified equalityComparer for the item type.

Template Parameters
VThe type of items of the new list
Parameters
mapperThe delegate defining the map.
equalityComparerThe equalityComparer to use for the new list
Returns
The new list.

Implemented in C5.GuardedList< T >, C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

new bool C5.IList< T >.Remove ( item)
T C5.IList< T >.Remove ( )

Remove one item from the list: from the front if

FIFO is true, else from the back.

Exceptions
NoSuchItemExceptionif this list is empty.
Returns
The removed item.

Implemented in C5.GuardedList< T >, C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

new T C5.IList< T >.RemoveAt ( int  index)

Remove the item at a specific position of the list.

Exceptions
IndexOutOfRangeExceptionif
index
is negative or >= the size of the collection.
Parameters
indexThe index of the item to remove.
Returns
The removed item.

Implements C5.IIndexed< T >.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

T C5.IList< T >.RemoveFirst ( )

Remove one item from the front of the list.

Exceptions
NoSuchItemExceptionif this list is empty.

Returns
The removed item.

Implemented in C5.GuardedList< T >, C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

T C5.IList< T >.RemoveLast ( )

Remove one item from the back of the list.

Exceptions
NoSuchItemExceptionif this list is empty.

Returns
The removed item.

Implemented in C5.GuardedList< T >, C5.HashedLinkedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

void C5.IList< T >.Reverse ( )

Reverse the list so the items are in the opposite sequence order.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

void C5.IList< T >.Shuffle ( )
void C5.IList< T >.Shuffle ( Random  rnd)

Shuffle the items of this list according to a specific random source.

Parameters
rndThe random source.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

IList<T> C5.IList< T >.Slide ( int  offset)

Slide this list view along the underlying list.

Exceptions
NotAViewExceptionif this list is not a view.
ArgumentOutOfRangeExceptionif the operation would bring either end of the view outside the underlying list.
Parameters
offsetThe signed amount to slide: positive to slide towards the end.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

IList<T> C5.IList< T >.Slide ( int  offset,
int  size 
)

Slide this list view along the underlying list, changing its size.

Exceptions
NotAViewExceptionif this list is not a view.
ArgumentOutOfRangeExceptionif the operation would bring either end of the view outside the underlying list.
Parameters
offsetThe signed amount to slide: positive to slide towards the end.
sizeThe new size of the view.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

void C5.IList< T >.Sort ( )

Sort the items of the list according to the default sorting order for the item type T, as defined by the T:C5.Comparer`1 class

Exceptions
NotComparableExceptionif T is not comparable

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

void C5.IList< T >.Sort ( SCG.IComparer< T >  comparer)

Sort the items of the list according to a specified sorting order.

The sorting does not perform duplicate elimination or identify items according to the comparer or itemequalityComparer. I.e. the list as an unsequenced collection with binary equality, will not change.

Parameters
comparerThe comparer defining the sorting order.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

IList<T> C5.IList< T >.Span ( IList< T >  otherView)

Returns null if otherView is strictly to the left of this view

Parameters
otherView
Exceptions
IncompatibleViewExceptionIf otherView does not have the same underlying list as this
ArgumentOutOfRangeExceptionIf
otherView
is strictly to the left of this view
Returns

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

bool C5.IList< T >.TrySlide ( int  offset)
bool C5.IList< T >.TrySlide ( int  offset,
int  size 
)
IList<T> C5.IList< T >.View ( int  start,
int  count 
)

Create a list view on this list.

Exceptions
ArgumentOutOfRangeExceptionif the view would not fit into this list.

Parameters
startThe index in this list of the start of the view.
countThe size of the view.
Returns
The new list view.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

IList<T> C5.IList< T >.ViewOf ( item)

Create a list view on this list containing the (first) occurrence of a particular item.

Exceptions
NoSuchItemExceptionif the item is not in this list.

Parameters
itemThe item to find.
Returns
The new list view.

Implemented in C5.HashedLinkedList< T >, C5.GuardedList< T >, C5.LinkedList< T >, C5.HashedArrayList< T >, C5.ArrayList< T >, and C5.WrappedArray< T >.

Property Documentation

new int C5.IList< T >.Count
get

bool C5.IList< T >.FIFO
getset

Since

Add(T item) always add at the end of the list, this describes if list has FIFO or LIFO semantics.

True if the Remove() operation removes from the start of the list, false if it removes from the end.

T C5.IList< T >.First
get

Exceptions
NoSuchItemExceptionif this list is empty.

The first item in this list.

bool C5.IList< T >.IsFixedSize
get

new bool C5.IList< T >.IsReadOnly
get

bool C5.IList< T >.IsValid
get

T C5.IList< T >.Last
get

Exceptions
NoSuchItemExceptionif this list is empty.

The last item in this list.

int C5.IList< T >.Offset
get

Offset for this list view or 0 for an underlying list.

new T C5.IList< T >.this[int index]
getset

On this list, this indexer is read/write.

Exceptions
IndexOutOfRangeExceptionif index is negative or >= the size of the collection.

The index'th item of this list.

Parameters
indexThe index of the item to fetch or store.
IList<T> C5.IList< T >.Underlying
get

Null if this list is not a view.

Underlying list for view.


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