def previous_found
bend-collections@1.0.0.0 · src/containers/dlist_iterator.bend:163
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
163def previous_found(~T: Data, n: U32, last: U32, f: Bool, i: Nat, r: D.DList<T> & U32) -> Iterator<T> & Result<&2, &2, Error, T>:
164 (D.DL{tag, depth, cap, R.DL{owner, fresh, free, count, head, tail, rd, rc, vals, prevs, nexts}, gens}, +h) = r
165 backward_finish(~T, tag, depth, cap, gens, owner, fresh, free, count, head, tail, rd, rc, prevs, nexts, n, last, f, i, h, backward_value(~T, vals, h, U32.is_eq(h, 0)))