def pool_grow_step_1
bend-collections@1.0.0.0 · src/containers/internal/intrusive_list.bend:645
import bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend as IntrusiveList
import Base
import bend-collections@1.0.0.0/src/containers/types/intrusive_doubly_linked_list.bend as E
645def pool_grow_step_1(~S: Type, ~N: Data, ~C: Data, ~set_next: S -> N -> Maybe<&2, N> -> S, ~make: S -> C -> S & N, pool: E.Pool<N>, r: S & N) -> S & E.Pool<N>:
646 (s, +node) = r
647 pool_free(~S, ~N, ~set_next, s, pool, node)