- ICollection<T>
- IEqualityComparable<T>
- IComparable<T>
- IComparer<T>
- IEqualityComparer<T>
- IList<T>
- IMap<TKey,TValue>
- ISet<T>
- CDefaultComparer<T>
- CDefaultEqualityComparer<T>
- CRedBlackTreeNode<T>
- CLinkedListNode<T>
- CKeyValuePair<TKey,TValue>
- CArrayList<T>
- CHashMap<TKey,TValue>
- CHashSet<T>
- CLinkedList<T>
- CQueue<T>
- CRedBlackTree<T>
- CSortedMap<TKey, TValue>
- CSortedSet<T>
- CStack<T>
- ArrayBinarySearch<T>
- ArrayIndexOf<T>
- ArrayLastIndexOf<T>
- ArrayReverse<T>
- Compare
- Equals<T>
- GetHashCode
ArrayBinarySearch
Searches for the specified value in an ascending-sorted one-dimensional array using the IComparable<T> interface to compare elements.
template<typename T>
|
Parameters
&array[]
[out] The array to search in.
value
[in] The searched value.
*comparer
[in] An interface for comparing elements.
start_index
[in] The starting index from which the search begins.
count
[in] The length of the search range.
Return Value
Returns the index of the found element. If the search value is not found, it returns the index of the smallest element, which is closest in value.