Add method to collections to find the longest prefix that is sorted along a given predicate.  Add a variant method that checks for strictly increasing prefixes.  Add overloads to both that default the predicate to the less-than operator.

Add methods to collections to perform binary searches.  All the methods assume the collection is sorted along the given predicate, or simply in non-decreasing order for the overloads that default the predicate to the standard less-than operator.  The variants return: the quickest match, the earliest match, one past the latest match, and the index range for all matches.

Add method to collections to find the longest prefix that maintains the same value according to a given predicate Add overload that defaults the predicate to the eqaulity operator.