IDataItems Methods |
The IDataItems type exposes the following members.
Methods| Name | Description | |
|---|---|---|
 | Add |
Add a IDataItem to the list
|
| Clear |
Removes all elements from the List.
|
| Contains | Determines whether the ICollection<T> contains a specific value. (Inherited from ICollection<IDataItem>.) |
| CopyTo | (Inherited from ICollection<IDataItem>.) |
| Find |
Searches for an element that matches the conditions defined by
the specified predicate, and returns the first occurrence within
the entire List.
|
| GetEnumerator | Returns an enumerator that iterates through the collection. (Inherited from IEnumerable<IDataItem>.) |
| IndexOf |
Searches for the specified object and returns the zero-based index of the first occurrence within the entire List.
|
| Insert | Inserts an item to the IList<T> at the specified index. (Inherited from IList<IDataItem>.) |
| Remove |
Removes the first occurrence of a specific object from the List.
|
| RemoveAt |
Removes the element at the specified index of the List.
|
Extension Methods| Name | Description | |
|---|---|---|
 | BinarySearch<IDataItem>(IDataItem) | Overloaded.
Searches the entire sorted IList<T> for an element
and returns the zero-based index of the element.
(Defined by GenericExtensions.)If the key is not found, a negative number is returned, which can be intepreted as the bitwise complement of the interval of indices that the key is in between, i.e. list[interval-1] < key < list[interval] |
 | BinarySearch<IDataItem>(Func<IDataItem, Int32>) | Overloaded.
Searches the entire sorted IList<T> for an element using the provided
comparer and returns the zero-based index of the element.
(Defined by GenericExtensions.)This differs from the "ordinary" binary search in allowing a comparer delegate that defines whether an item is found (returning 0), whether the item in the list is before (<0) or after (>0) that knows how to compare a class with its key. Example, if the list contains classes of type T having an id number and the class is sorted on that id, then the keySelector returns the id number for that class. Examples
If having a list of doubles, to find 4.5 in the list, use:
int index = list.BinarySearch(d => d.CompareTo(4.5)) |
| BinarySearch<IDataItem>(IDataItem, IComparer<IDataItem>) | Overloaded.
Searches the entire sorted IList<T> for an element using the provided
comparer and returns the zero-based index of the element.
(Defined by GenericExtensions.)If the key is not found, a negative number is returned, which can be intepreted as the bitwise complement of the interval of indices that the key is in between, i.e. list[interval-1] < key < list[interval] |
| BinarySearch<IDataItem, TKey>(Func<IDataItem, TKey>, TKey) | Overloaded.
Searches the entire sorted IList<T> for an element
and returns the zero-based index of the element.
(Defined by GenericExtensions.)If the key is not found, a negative number is returned, which can be intepreted as the bitwise complement of the interval of indices that the key is in between, i.e. list[interval-1] < key < list[interval]This differs from the "ordinary" binary search in allowing a keySelectorcomparer that knows how to compare a class with its key. Example, if the list contains classes of type T having an id number and the class is sorted on that id, then the keySelector returns the id number for that class. |
| BinarySearch<IDataItem, TKey>(Func<IDataItem, TKey>, TKey, IComparer<TKey>) | Overloaded.
Searches the entire sorted IList<T> for an element using the provided
comparer and returns the zero-based index of the element.
(Defined by GenericExtensions.)If the key is not found, a negative number is returned, which can be intepreted as the bitwise complement of the interval of indices that the key is in between, i.e. list[interval-1] < key < list[interval]This differs from the "ordinary" binary search in allowing a keySelectorcomparer that knows how to compare a class with its key. Example, if the list contains classes of type T having an id number and the class is sorted on that id, then the keySelector returns the id number for that class. |
| FindIndex<IDataItem>(Predicate<IDataItem>) | Overloaded. Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the first occurrence within the range of elements in the list. (Defined by GenericExtensions.) |
| FindIndex<IDataItem>(Int32, Predicate<IDataItem>) | Overloaded. Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the first occurrence within the range of elements in the List<T> that extends from the specified index to the last element. (Defined by GenericExtensions.) |
| Sort<IDataItem>() | Overloaded.
Sorts the elements in the entire List{T} using the default comparer.
(Defined by GenericExtensions.)A quick sort algorithm is used. Quick sort is a un-stable sort algorithm i.e. if two elements are equal their order may not be preserved. If the provided IList is either an array or a list, the build in sorting method is used (also quick sort). |
| Sort<IDataItem>(IComparer<IDataItem>) | Overloaded.
Sorts the elements in the entire List{T} using the provided comparer.
(Defined by GenericExtensions.)A quick sort algorithm is used. Quick sort is a un-stable sort algorithm i.e. if two elements are equal their order may not be preserved. If the provided IList is either an array or a list, the build in sorting method is used (also quick sort). |
| SortStable<IDataItem>() | Overloaded. (Defined by GenericExtensions.) |
| SortStable<IDataItem>(IComparer<IDataItem>) | Overloaded.
Sorts the elements in the entire List{T} using the provided comparer.
(Defined by GenericExtensions.)A merge sort algorithm is used. merge sort is a stable sort algorithm i.e. if two elements are equal their order are preserved. |
| SortStable<IDataItem>(Comparison<IDataItem>) | Overloaded.
Sorts the elements in the entire List{T} using the provided comparer.
(Defined by GenericExtensions.)A merge sort algorithm is used. merge sort is a stable sort algorithm i.e. if two elements are equal their order are preserved. |
See Also