public interface IListIBoundaryItems : IEnumerable<IBoundaryItem>,
IEnumerable, IList<IBoundaryItem>, ICollection<IBoundaryItem>| Count | The number of IBoundaryItem's in the list |
| IsReadOnly | Gets a value indicating whether the ICollectionT is read-only. (Inherited from ICollectionIBoundaryItem) |
| Item | Get or set the IBoundaryItem at the specified index in the list |
| Add | Add a IBoundaryItem to the list |
| Clear | Removes all elements from the List. |
| Contains | Determines whether the ICollectionT contains a specific value. (Inherited from ICollectionIBoundaryItem) |
| CopyTo | Copies the elements of the ICollectionT to an Array, starting at a particular Array index. (Inherited from ICollectionIBoundaryItem) |
| 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 IEnumerableIBoundaryItem) |
| 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 IListT at the specified index. (Inherited from IListIBoundaryItem) |
| Remove | Removes the first occurrence of a specific object from the List. |
| RemoveAt | Removes the element at the specified index of the List. |
| BinarySearchIBoundaryItem |
Searches the entire sorted IListT for an element using the provided
comparer and returns the zero-based index of the element.
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. Example
If having a list of doubles, to find 4.5 in the list, use:
int index = list.BinarySearch(d => d.CompareTo(4.5))
(Defined by GenericExtensions) |
| BinarySearchIBoundaryItem |
Searches the entire sorted IListT for an element
and returns the zero-based index of the element.
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.
(Defined by GenericExtensions) |
| BinarySearchIBoundaryItem |
Searches the entire sorted IListT for an element using the provided
comparer and returns the zero-based index of the element.
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.
(Defined by GenericExtensions) |
| BinarySearchIBoundaryItem, TKey |
Searches the entire sorted IListT for an element
and returns the zero-based index of the element.
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.
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. (Defined by GenericExtensions) |
| BinarySearchIBoundaryItem, TKey |
Searches the entire sorted IListT for an element using the provided
comparer and returns the zero-based index of the element.
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.
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. (Defined by GenericExtensions) |
| FindIndexIBoundaryItem | 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) |
| FindIndexIBoundaryItem | 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 ListT that extends from the specified index to the last element. (Defined by GenericExtensions) |
| GetAccumulatedValueNoItemOverlap | Get boundary value accumulated over the specified period, looping over all the items and taking their application interval into account, only allowing for one value at a time, i.e. not summing up if two items are applicable at the same time. If no item is applicable, a zero value is assumed. (Defined by BoundaryExtensions) |
| GetAccumulatedValueNoItemOverlap | Get boundary value accumulated over the specified period, looping over all the items and taking their application interval into account, only allowing for one value at a time, i.e. not summing up if two items are applicable at the same time. Accumulation time is computed, indicating periods where values are undefined. If no item is applicable, a zero value is assumed. (Defined by BoundaryExtensions) |
| SortIBoundaryItem |
Sorts the elements in the entire List{T} using the default comparer.
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). (Defined by GenericExtensions) |
| SortIBoundaryItem |
Sorts the elements in the entire List{T} using the provided comparer.
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). (Defined by GenericExtensions) |
| SortStableIBoundaryItem |
Sorts the elements in the entire List{T} using the default comparer.
A merge sort algorithm is used. merge sort is a stable sort algorithm i.e. if two elements are equal their order are preserved. (Defined by GenericExtensions) |
| SortStableIBoundaryItem |
Sorts the elements in the entire List{T} using the provided comparer.
A merge sort algorithm is used. merge sort is a stable sort algorithm i.e. if two elements are equal their order are preserved. (Defined by GenericExtensions) |
| SortStableIBoundaryItem |
Sorts the elements in the entire List{T} using the provided comparer.
A merge sort algorithm is used. merge sort is a stable sort algorithm i.e. if two elements are equal their order are preserved. (Defined by GenericExtensions) |