Overload_CodeJam_Algorithms_PartitionPoint

Algorithms.PartitionPoint Method

Overload List

 

	Name	Description
	PartitionPoint(T)(IList(T), Predicate(T))	Returns the index i in the range [0, list.Count - 1] such that predicate(list[j]) = true for j < i and predicate(list[k]) = false for k >= i or list.Count if no such i exists Remarks The list should be partitioned according to the predicate
	PartitionPoint(T)(IList(T), Int32, Predicate(T))	Returns the index i in the range [startIndex, list.Count - 1] such that predicate(list[j]) = true for j < i and predicate(list[k]) = false for k >= i or list.Count if no such i exists Remarks The list should be partitioned according to the predicate
	PartitionPoint(T)(IList(T), Int32, Int32, Predicate(T))	Returns the index i in the range [startIndex, endIndex - 1] such that predicate(list[j]) = true for j < i and predicate(list[k]) = false for k >= i or endIndex if no such i exists Remarks The list should be partitioned according to the predicate

  Back to Top

See Also

Reference

Algorithms Class
CodeJam Namespace