Overload_CodeJam_Algorithms_LowerBound - rsdn/CodeJam GitHub Wiki

Algorithms.LowerBound Method

Overload List

 

	Name	Description
	LowerBound(IList(DateTime), DateTime)	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
	LowerBound(IList(DateTimeOffset), DateTimeOffset)	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
	LowerBound(IList(Double), Double)	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
	LowerBound(IList(Single), Single)	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
	LowerBound(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
	LowerBound(TElement, TValue)(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
	LowerBound(IList(DateTime), DateTime, Int32)	Returns the minimum index i in the range [startIndex, list.Count - 1] such that list[i] >= value or list.Count if no such i exists
	LowerBound(IList(DateTimeOffset), DateTimeOffset, Int32)	Returns the minimum index i in the range [startIndex, list.Count - 1] such that list[i] >= value or list.Count if no such i exists
	LowerBound(IList(Double), Double, Int32)	Returns the minimum index i in the range [startIndex, list.Count - 1] such that list[i] >= value or list.Count if no such i exists
	LowerBound(IList(Single), Single, Int32)	Returns the minimum index i in the range [startIndex, list.Count - 1] such that list[i] >= value or list.Count if no such i exists
	LowerBound(IList(TimeSpan), TimeSpan, Int32)	Returns the minimum index i in the range [startIndex, list.Count - 1] such that list[i] >= value or list.Count if no such i exists
	LowerBound(TElement, TValue)(IList(TElement), TValue, Func(TElement, TValue, Int32))	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
	LowerBound(TElement, TValue)(IList(TElement), TValue, Int32)	Returns the minimum index i in the range [startIndex, list.Count - 1] such that list[i] >= value or list.Count if no such i exists
	LowerBound(IList(DateTime), DateTime, Int32, Int32)	Returns the minimum index i in the range [startIndex, endIndex - 1] such that list[i] >= value or endIndex if no such i exists
	LowerBound(IList(DateTimeOffset), DateTimeOffset, Int32, Int32)	Returns the minimum index i in the range [startIndex, endIndex - 1] such that list[i] >= value or endIndex if no such i exists
	LowerBound(IList(Double), Double, Int32, Int32)	Returns the minimum index i in the range [startIndex, endIndex - 1] such that list[i] >= value or endIndex if no such i exists
	LowerBound(IList(Single), Single, Int32, Int32)	Returns the minimum index i in the range [startIndex, endIndex - 1] such that list[i] >= value or endIndex if no such i exists
	LowerBound(IList(TimeSpan), TimeSpan, Int32, Int32)	Returns the minimum index i in the range [startIndex, endIndex - 1] such that list[i] >= value or endIndex if no such i exists
	LowerBound(TElement, TValue)(IList(TElement), TValue, Int32, Func(TElement, TValue, Int32))	Returns the minimum index i in the range [startIndex, list.Count - 1] such that list[i] >= value or list.Count if no such i exists
	LowerBound(TElement, TValue)(IList(TElement), TValue, Int32, Int32)	Returns the minimum index i in the range [startIndex, endIndex - 1] such that list[i] >= value or endIndex if no such i exists
	LowerBound(TElement, TValue)(IList(TElement), TValue, Int32, Int32, Func(TElement, TValue, Int32))	Returns the minimum index i in the range [startIndex, endIndex - 1] such that list[i] >= value or endIndex if no such i exists

  Back to Top

See Also

Reference

Algorithms Class
CodeJam Namespace

⚠️ **GitHub.com Fallback** ⚠️