binarySearch method

Coral<int> binarySearch(
  1. E element,
  2. int compare(
    1. E a,
    2. E b
    )
)

Returns the index of element in this sorted list.

Implementation

Coral<int> binarySearch(E element, int Function(E a, E b) compare) =>
    _listCoral.map(
        (list) => col.ListExtensions(list).binarySearch(element, compare));