binarySearchByCompare<K> method

Bloom<int> binarySearchByCompare<K>(E element, K keyOf(E element), int compare(K a, K b), [ int start = 0, int? end, ])

Returns the index of element in this sorted list by comparing key extracted via keyOf.

• element: The target element to search for.
• keyOf: Function extracting the sort key from each element.
• compare: Comparator comparing extracted keys.
• start: Optional inclusive start index. Defaults to 0.
• end: Optional exclusive end index.

Implementation

Bloom<int> binarySearchByCompare<K>(E element, K Function(E element) keyOf,
        int Function(K a, K b) compare, [int start = 0, int? end]) =>
    computed((via) => col.ListExtensions(via(_listBloom))
        .binarySearchByCompare<K>(element, keyOf, compare, start, end));