def pool_free
bend-collections@1.0.0.0 · src/containers/internal/intrusive_list.bend:620
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
620def pool_free(~S: Type, ~N: Data, ~set_next: S -> N -> Maybe<&2, N> -> S, s: S, pool: E.Pool<N>, +node: N) -> S & E.Pool<N>:
621 E.Pool{head, count} = pool
622 (set_next(s, node, head), E.Pool{Some{node}, 1n+count})