M_CodeJam_Algorithms_UpperBound_14

Algorithms.UpperBound Method (IList(TimeSpan), TimeSpan, Int32, Int32)

[This is preliminary documentation and is subject to change.]

Returns the minimum index i in the range [from, to - 1] such that list[i] > value or "to" if no such i exists

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

Syntax

C#

public static int UpperBound(
	this IList<TimeSpan> list,
	TimeSpan value,
	int from,
	int to
)

VB

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

F#

[<ExtensionAttribute>]
static member UpperBound : 
        list : IList<TimeSpan> * 
        value : TimeSpan * 
        from : int * 
        to : int -> int 

Parameters

 

list

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

value

Type: System.TimeSpan
The value to compare

from

Type: System.Int32
The minimum index

to

Type: System.Int32
The upper bound for the index (not included)

Return Value

Type: Int32
The upper 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
UpperBound Overload
CodeJam Namespace