IntrusiveDoublyLinkedList.map_from_values: 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 162-164 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=162&end_line=164

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

# Convert then construct each node, both in forward order; return the head.
def map_from_values(~S: Type, ~N: Data, ~V: Data, ~D: Data, ~C: Data, ~set_next: S -> N -> Maybe<&2, N> -> S, ~set_prev: S -> N -> Maybe<&2, N> -> S, ~convert: S -> C -> V -> S & D, ~make: S -> C -> D -> S & N, s: S, +xs: List<&2, V>, +c: C) -> S & Maybe<&2, N>:
  Impl.map_from_values(~S, ~N, ~V, ~D, ~C, ~set_next, ~set_prev, ~convert, ~make, s, xs, c)

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend&name=map_from_values