IntrusiveDoublyLinkedList.pool_next: 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 174-176 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=174&end_line=176 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 # Pop and clear the next link, or call make only when empty. O(1) before make. def pool_next(~S: Type, ~N: Data, ~C: Data, ~next: S -> N -> S & Maybe<&2, N>, ~set_next: S -> N -> Maybe<&2, N> -> S, ~make: S -> C -> S & N, s: S, pool: E.Pool, +c: C) -> S & (E.Pool & N): Impl.pool_next(~S, ~N, ~C, ~next, ~set_next, ~make, s, pool, c) Uses (4): 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=pool_next https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/types/intrusive_doubly_linked_list.bend&name=Pool