def cursor_insert_gap
bend-collections@1.0.0.0 · src/containers/dlist_iterator.bend:92
import bend-collections@1.0.0.0/src/containers/dlist_iterator.bend as DlistIterator
import Base
import bend-collections@1.0.0.0/src/containers/doubly_linked_list.bend as D
import bend-collections@1.0.0.0/src/containers/internal/dlist_storage.bend as R
import bend-collections@1.0.0.0/src/containers/types/doubly_linked_list.bend as E
92
93def cursor_insert_gap(~T: Data, s: D.DList<T>, +n: U32, x: T) -> D.DList<T> & Result<&2, &2, E.Error, E.Handle>:
94 D.DL{tag, depth, cap, R.DL{owner, fresh, free, count, head, +tail, rd, rc, vals, prevs, nexts}, gens} = s
95 insert_gap(~T, tag, depth, cap, gens, owner, fresh, free, count, head, tail, rd, rc, vals, nexts, n, x, gap_left(prevs, tail, n, U32.is_eq(n, 0)))