M_CodeJam_Algorithms_LowerBound__2

Algorithms.LowerBound(TElement, TValue) Method (IList(TElement), TValue)

Returns the minimum index i in the range [0, list.Count - 1] such that list[i] >= value or list.Count if no such i exists

Namespace: CodeJam
Assembly: CodeJam (in CodeJam.dll) Version: 2.1.0.0

Syntax

C#

public static int LowerBound<TElement, TValue>(
	this IList<TElement> list,
	TValue value
)
where TElement : Object, IComparable<TValue>

VB

<ExtensionAttribute>
Public Shared Function LowerBound(Of TElement As {Object, IComparable(Of TValue)}, TValue) ( 
	list As IList(Of TElement),
	value As TValue
) As Integer

F#

[<ExtensionAttribute>]
static member LowerBound : 
        list : IList<'TElement> * 
        value : 'TValue -> int  when 'TElement : Object and IComparable<'TValue>

Parameters

 

list

Type: System.Collections.Generic.IList(TElement)
The sorted list

value

Type: TValue
The value to compare

Type Parameters

 

TElement

The list element type

Remarks

Should implement IComparable

TValue

The type of the value

Return Value

Type: Int32
The lower bound for the value

Usage Note

In Visual Basic and C#, you can call this method as an instance method on any object of type IList(TElement). When you use instance method syntax to call this method, omit the first parameter. For more information, see Extension Methods (Visual Basic) or Extension Methods (C# Programming Guide).

See Also

Reference

Algorithms Class
LowerBound Overload
CodeJam Namespace