lowerBound method Null safety
- E element,
- int compare(
- E,
- E
Returns the index where element
should be in this sorted list.
Uses binary search to find the location of element
.
The list must be sorted according to compare
,
otherwise the result is unspecified.
If element
is in the list, its index is returned,
otherwise returns the first position where adding element
would keep the list sorted. This may be the length
of
the list if all elements of the list compare less than
element
.
Implementation
int lowerBound(E element, int Function(E, E) compare) =>
algorithms.lowerBoundBy<E, E>(this, identity, compare, element);