def M0

lawful-bytes@0.1.1.0 · proof_fast_find.bend:60

import Base
import lawful-bytes@0.1.1.0/fast.bend as FA
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P

60# The mask of the first word.
61def M0(+t: P.Tree<U32>, +from: U32, +rc: U32) -> U32:
62  FA.zb(((C.WD(t, (from >> 2n : U32)) .^. rc : U32) .|. U32.not(FA.low(from)) : U32))