K extends Comparable< method
Returns the index where
element should be in this sorted list.
Uses binary search to find the location of
This takes on the order of
The list must be sorted according to the
natural ordering of the
keyOf of the elements,
otherwise the result is unspecified.
element is in the list, its index is returned,
otherwise returns the first position where adding
would keep the list sorted. This may be the
the list if all elements of the list compare less than
end are supplied, only that range is searched,
and only that range need to be sorted.
int lowerBoundBy<K extends Comparable<K>>(E element, K Function(E) keyOf, [int start = 0, int? end]) => algorithms.lowerBoundBy<E, K>( this, keyOf, compareComparable, element, start, end);