~/jendhub

def has_f

bend-collections-laws-math@1.0.0.0 · src/containers/hash_table.bend:488

import bend-collections-laws-math@1.0.0.0/src/containers/hash_table.bend as HashTable
import Base

488def has_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> & Bool:
489  (fd, w) = r
490  FD{tab, ks, key, at, +l} = fd
491  (HM{n, mask, td, fresh, sz, sd, free, tab, ks, vs, nx}, U32.is_ne(l, 0))

Uses (9)

Used by (1)