binarySearch method

Bloom<int> binarySearch(
  1. E element, [
  2. int compare(
    1. E a,
    2. E b
    )?
])

Returns the index of element in this sorted list.

  • element: The target element to search for.
  • compare: Optional comparator overriding Comparable.compareTo.

Implementation

Bloom<int> binarySearch(E element, [int Function(E a, E b)? compare]) =>
    computed((via) => col.ListExtensions(via(_listBloom))
        .binarySearch(element, compare ?? (a, b) => a.compareTo(b)));