Skip to content

M_CodeJam_Algorithms_LowerBound_12

Andrew Koryavchenko edited this page Jul 4, 2017 · 5 revisions

Algorithms.LowerBound Method (IList(TimeSpan), TimeSpan)

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: 1.1.0.0 (1.1.0.0)

Syntax

C#

public static int LowerBound(
	this IList<TimeSpan> list,
	TimeSpan value
)

VB

<ExtensionAttribute>
Public Shared Function LowerBound ( 
	list As IList(Of TimeSpan),
	value As TimeSpan
) As Integer

F#

[<ExtensionAttribute>]
static member LowerBound : 
        list : IList<TimeSpan> * 
        value : TimeSpan -> int 

Parameters

 

list
Type: System.Collections.Generic.IList(TimeSpan)
The sorted list
value
Type: System.TimeSpan
The value to compare

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(TimeSpan). 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

Clone this wiki locally