Skip to content

M_CodeJam_Algorithms_EqualRange_13

Andrew Koryavchenko edited this page Jun 17, 2018 · 7 revisions

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

Returns the tuple of [i, j] where i is the smallest index in the range [startIndex, list.Count - 1] such that list[i] >= value or list.Count if no such i exists j is the smallest index in the range [startIndex, list.Count - 1] such that list[i] > value or list.Count if no such j exists

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

Syntax

C#

public static Range<int> EqualRange(
	this IList<TimeSpan> list,
	TimeSpan value,
	int startIndex
)

VB

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

F#

[<ExtensionAttribute>]
static member EqualRange : 
        list : IList<TimeSpan> * 
        value : TimeSpan * 
        startIndex : int -> Range<int> 

Parameters

 

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

Return Value

Type: Range(Int32)
The tuple of lower bound and 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
EqualRange Overload
CodeJam Namespace

Clone this wiki locally