IntrusiveDoublyLinkedList.find_convert: def of bend-collections@1.0.0.0
Import: import bend-collections@1.0.0.0/src/containers/intrusive_doubly_linked_list.bend as IntrusiveDoublyLinkedList
Lines 85-87 of bend-collections@1.0.0.0/src/containers/intrusive_doubly_linked_list.bend: https://jend.leeeet.dev/read.txt?path=bend-collections@1.0.0.0/src/containers/intrusive_doubly_linked_list.bend&start_line=85&end_line=87

import Base
import bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend as Impl
import bend-collections@1.0.0.0/src/containers/types/intrusive_doubly_linked_list.bend as E

# Convert once per visited value, skip failed conversions, return the original node.
def find_convert(~S: Type, ~N: Data, ~V: Data, ~D: Data, ~C: Data, ~H: Data, ~get_head: S -> H -> S & Maybe<&2, N>, ~next: S -> N -> S & Maybe<&2, N>, ~value: S -> N -> S & V, ~convert: S -> V -> S & Maybe<&2, D>, ~pred: S -> C -> D -> S & Bool, +fuel: Nat, s: S, +h: H, +c: C) -> S & Result<&2, &1, E.Error, Maybe<&2, N>>:
  Impl.find_convert(~S, ~N, ~V, ~D, ~C, ~H, ~get_head, ~next, ~value, ~convert, ~pred, fuel, s, h, c)

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Result
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend&name=find_convert
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/types/intrusive_doubly_linked_list.bend&name=Error