def ins_go
bend-collections-laws-math@1.0.0.0 · src/containers/hash_table.bend:282
import bend-collections-laws-math@1.0.0.0/src/containers/hash_table.bend as HashTable
import Base
282def ins_go(fuel: Nat, s: RStep, +mask: U32, +i: U32, +w: U32, +l: U32) -> Array<U32>:
283 match fuel s:
284 case 0n REmpty{tab}:
285 tab
286 case 0n RFull{tab}:
287 tab
288 case 1n+p REmpty{tab}:
289 put_bucket(tab, i, w, l)
290 case 1n+p RFull{tab}:
291 +j = bnext(i, mask)
292 ins_go(p, rstep(tab, j), mask, j, w, l)