def pop_f

bend-collections-laws-crypto@1.0.0.0 · src/containers/hash_table.bend:517

import Base

517def pop_f(a, -V: Kind(a), +n: U32, +mask: U32, +td: U32, +fresh: U32, +sz: U32, +sd: U32, +free: U32, vs: Array<Maybe<a, V>>, nx: Array<U32>, r: Found & U32) -> HashMap<a, V> & Maybe<a, V>:
518  (fd, +w) = r
519  FD{tab, ks, key, +at, +l} = fd
520  pop_hit(a, V, n, mask, td, fresh, sz, sd, free, tab, ks, vs, nx, at, l, w, U32.is_eq(l, 0))