ProcessQueueTBinarySearch(T, IComparerT) Method

Searches the entire sorted ProcessQueueT, using a binary search algorithm, for an element using the specified comparer and returns the zero-based index of the element.

Namespace: GSF.Collections
Assembly: GSF.Core (in GSF.Core.dll) Version: 2.4.218-beta+101eee949414e414795e55a6e73d88938f0177b8

Syntax

C++

JavaScript

Copy

public virtual int BinarySearch(
	T item,
	IComparer<T> comparer
)

Public Overridable Function BinarySearch ( 
	item As T,
	comparer As IComparer(Of T)
) As Integer

public:
virtual int BinarySearch(
	T item, 
	IComparer<T>^ comparer
)

abstract BinarySearch : 
        item : 'T * 
        comparer : IComparer<'T> -> int 
override BinarySearch : 
        item : 'T * 
        comparer : IComparer<'T> -> int

function BinarySearch(item, comparer);

View Source

Parameters

item T: The object to locate. The value can be null for reference types.
comparer IComparerT: The Generic.IComparer implementation to use when comparing elements -or- null to use the default comparer: Generic.Comparer(Of T).Default

Return Value

Int32
The zero-based index of item in the sorted ProcessQueueT, 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.

Exceptions

Exception	Condition
InvalidOperationException	The default comparer, Generic.Comparer.Default, cannot find an implementation of the IComparable generic interface or the IComparable interface for type T.

Remarks

ProcessQueueT must be sorted in order for this function to return an accurate result.

Reference

ProcessQueueT Class

BinarySearch Overload

GSF.Collections Namespace