lowerBoundBy<K extends Comparable> method

Bloom<int> lowerBoundBy<K extends Comparable>(E element, K keyOf(E element), [ int start = 0, int? end, ])

Returns the index where element should be inserted by key natural order.

• element: The target element to locate the lower bound for.
• keyOf: Function extracting the comparable key from each element.
• start: Optional inclusive start index. Defaults to 0.
• end: Optional exclusive end index.

Implementation

Bloom<int> lowerBoundBy<K extends Comparable<dynamic>>(
        E element, K Function(E element) keyOf, [int start = 0, int? end]) =>
    computed((via) => col.ListExtensions(via(_listBloom))
        .lowerBoundByCompare<K>(
            element, keyOf, (a, b) => a.compareTo(b), start, end));