Click or drag to resize

ICatchments Methods

The ICatchments type exposes the following members.

Methods
  NameDescription
Public methodAdd (Inherited from ICollection<ICatchment>.)
Public methodClear (Inherited from ICollection<ICatchment>.)
Public methodContains (Inherited from ICollection<ICatchment>.)
Public methodCopyTo (Inherited from ICollection<ICatchment>.)
Public methodFind
Find a catchment by catchment model id (unique)
Public methodFindAll
Find a catchment by catchment name
Public methodGetEnumerator
Returns an enumerator that iterates through the collection.
(Inherited from IEnumerable<ICatchment>.)
Public methodIndexOf (Inherited from IList<ICatchment>.)
Public methodInitialize
Initialize Rainfall Runoff models. Sets up static data.
Public methodInsert (Inherited from IList<ICatchment>.)
Public methodPrepare
Prepare Rainfall Runoff models. Sets up dynamic data so that the model is ready for first time step.
Public methodRemove (Inherited from ICollection<ICatchment>.)
Public methodRemoveAt (Inherited from IList<ICatchment>.)
Top
Extension Methods
  NameDescription
Public Extension MethodBinarySearch<ICatchment>(ICatchment)Overloaded.
Searches the entire sorted IList<T> 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.

list[interval-1] < key < list[interval]

(Defined by GenericExtensions.)
Public Extension MethodCode exampleBinarySearch<ICatchment>(Func<ICatchment, Int32>)Overloaded.
Searches the entire sorted IList<T> 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.

Examples
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.)
Public Extension MethodBinarySearch<ICatchment>(ICatchment, IComparer<ICatchment>)Overloaded.
Searches the entire sorted IList<T> 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.

list[interval-1] < key < list[interval]

(Defined by GenericExtensions.)
Public Extension MethodBinarySearch<ICatchment, TKey>(Func<ICatchment, TKey>, TKey)Overloaded.
Searches the entire sorted IList<T> 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.

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.

(Defined by GenericExtensions.)
Public Extension MethodBinarySearch<ICatchment, TKey>(Func<ICatchment, 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.

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.

(Defined by GenericExtensions.)
Public Extension MethodFindAll
Find all catchments with the specified name, and providing the specified quantity
(Defined by RRExtensions.)
Public Extension MethodFindIndex<ICatchment>(Predicate<ICatchment>)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.)
Public Extension MethodFindIndex<ICatchment>(Int32, Predicate<ICatchment>)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.)
Public Extension MethodSort<ICatchment>()Overloaded.
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.)
Public Extension MethodSort<ICatchment>(IComparer<ICatchment>)Overloaded.
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.)
Public Extension MethodSortStable<ICatchment>()Overloaded. (Defined by GenericExtensions.)
Public Extension MethodSortStable<ICatchment>(IComparer<ICatchment>)Overloaded.
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.)
Public Extension MethodSortStable<ICatchment>(Comparison<ICatchment>)Overloaded.
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.)
Top
See Also