CollectionAlgorithmsBinarySearchT Method (IListT, T, IComparerT) |
Uses a binary search algorithm to locate a specific element in the sorted
IListT.
Namespace:
AGI.Foundation.Infrastructure
Assembly:
AGI.Foundation.Core (in AGI.Foundation.Core.dll) Version: 24.2.419.0 (24.2.419.0)
Syntax public static int BinarySearch<T>(
IList<T> collection,
T item,
IComparer<T> comparer
)
Public Shared Function BinarySearch(Of T) (
collection As IList(Of T),
item As T,
comparer As IComparer(Of T)
) As Integer
public:
generic<typename T>
static int BinarySearch(
IList<T>^ collection,
T item,
IComparer<T>^ comparer
)
static member BinarySearch :
collection : IList<'T> *
item : 'T *
comparer : IComparer<'T> -> int
Parameters
- collection
- Type: System.Collections.GenericIListT
The collection to search. - item
- Type: T
The item to find. - comparer
- Type: System.Collections.GenericIComparerT
The IComparerT implementation to use when comparing elements.
Type Parameters
- T
- The type of item in the collection.
Return Value
Type:
Int32
The zero-based index of item in the sorted IList, if
item is found; otherwise, a negative number
that is the bitwise complement of the index of the next element that is larger than
item or, if there is no larger element, the bitwise complement of
Count.
Remarks See Also