IntrusiveDoublyLinkedList.pool_new: 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 178-180 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=178&end_line=180

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

# Construct max(size, 1) nodes in a LIFO pool, using the application factory.
def pool_new(~S: Type, ~N: Data, ~C: Data, ~set_next: S -> N -> Maybe<&2, N> -> S, ~make: S -> C -> S & N, +size: Nat, s: S, +c: C) -> S & E.Pool<N>:
  Impl.pool_new(~S, ~N, ~C, ~set_next, ~make, size, s, c)

Uses (5):
  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=bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend&name=pool_new
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/types/intrusive_doubly_linked_list.bend&name=Pool