def qs_w
import bend-collections-laws-math@1.0.0.0/src/containers/hash_table.bend as HashTableimport Base
206def qs_w(+i: U32, +w: U32, r: Array<U32> & U32) -> QStep:
207 (tab, +x) = r
208 qs_if(tab, i, w, x, U32.is_eq(x, 0))
import bend-collections-laws-math@1.0.0.0/src/containers/hash_table.bend as HashTableimport Base
206def qs_w(+i: U32, +w: U32, r: Array<U32> & U32) -> QStep:
207 (tab, +x) = r
208 qs_if(tab, i, w, x, U32.is_eq(x, 0))