binarySearchByCompare<K> method

Coral<int> binarySearchByCompare<K>(
  1. E element,
  2. K keyOf(
    1. E element
    ),
  3. int compare(
    1. K a,
    2. K b
    ), [
  4. int start = 0,
  5. int? end,
])

Returns the index of element in this sorted list.

Implementation

Coral<int> binarySearchByCompare<K>(E element, K Function(E element) keyOf,
        int Function(K a, K b) compare, [int start = 0, int? end]) =>
    _listCoral.map((list) => col.ListExtensions(list)
        .binarySearchByCompare<K>(element, keyOf, compare, start, end));