left method

int left(
  1. List<T> list,
  2. V value, {
  3. int lo = 0,
  4. int? hi,
})

Finds the leftmost insertion point.

Implementation

int left(List<T> list, V value, {int lo = 0, int? hi}) {
  return bisectLeftBy(list, value, accessor, lo: lo, hi: hi);
}