insort_left<E> function
void
insort_left<E>(
- List<
E> a, - E x, {
- Comparator<
E> ? compare, - ToKey<
E, Object> ? key, - int lo = 0,
- int? hi,
Assuming the list is sorted, insert item
in list in sorted order.
Implementation
void insort_left<E>(List<E> a, E x,
{Comparator<E>? compare, ToKey<E, Object>? key, int lo = 0, int? hi}) {
a.insert(bisect_left(a, x, compare: compare, lo: lo, hi: hi, key: key), x);
}