def pool_take_1
bend-collections@1.0.0.0 · src/containers/internal/intrusive_list.bend:624
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
624def pool_take_1(~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, +node: N, +count: Nat, r: S & Maybe<&2, N>) -> S & (E.Pool<N> & N):
625 (s, +after) = r
626 (set_next(s, node, None{}), (E.Pool{after, Nat.sub(count, 1n)}, node))