bisectLeft method
Assuming the list is sorted, locate the insertion point for item
in a to maintain sorted order.
Implementation
int bisectLeft(E item, {Comparator<E>? compare, int low = 0, int? high}) {
return funcs.bisect_left(this, item, compare: compare, lo: low, hi: high);
}