def pool_grow

bend-collections@1.0.0.0 · src/containers/internal/intrusive_list.bend:652

import Base
import bend-collections@1.0.0.0/src/containers/types/intrusive_doubly_linked_list.bend as E

652def pool_grow(~S: Type, ~N: Data, ~C: Data, ~set_next: S -> N -> Maybe<&2, N> -> S, ~make: S -> C -> S & N, +size: Nat, +c: C, r: S & E.Pool<N>) -> S & E.Pool<N>:
653  match size r:
654    case 0n Tuple{s, pool}: (s, pool)
655    case 1n+p Tuple{s, pool}:
656      pool_grow(~S, ~N, ~C, ~set_next, ~make, p, c, pool_grow_step(~S, ~N, ~C, ~set_next, ~make, s, pool, c))