⟨LV⇐ListVariations, V⇐Variation, I⇐Info, TY⇐Type, Refc⇐Refc⟩ ← •internal u ← ⌊100×(•UnixTime+1|100וMonoTime)@ rand ← •MakeRand •Show u R ← rand.Range RB ← "Ab" V R⟜2 # uniformly random boolean array RB2 ← {¬⍟(R 2) "Ab" V 𝕩 R 1+R 2⋆R 10} # random boolean array with random uniform probability rByteVals ← "Ai8"V {𝕩-256×𝕩>127} ∾{{2⊸×⊸+˜´ 8↑/⁼ 𝕩 •rand.Subset 8}¨ ↕9}¨↕20 RByte ← (R (≠rByteVals)˙)⊸(⊑⟜rByteVals) RH ← R⥊¨RByte # store to a variable to randomize heap by 𝕨 values, each up to 𝕩 bytes CH ← { # do "var CH↩" to a variable assigned to a result of RH "heap corruption" ! ∧´2=Refc¨ 𝕩 "heap corruption" ! 1 ≡ Refc 𝕩 0 } rByteVals {! "i8arr" ≡ TY 𝕩⥊𝕨}⌜ ↕10 # ⥊ is dumb for now, but when it realizes that n⥊0 is a bitarr this'll need changing OrScanBitarr ← {𝕊: n ← 1 + R 2⋆R 13 ! (∨` ≡ ⊢∘∨`) "Ab" V {𝕊: 1⌾((R n)⊸⊑)𝕩}⍟2 0⥊˜ n }¨ ↕ PlusScanBitarr ← {𝕊: a ← RB2 R 2⋆R 13 ! (+` ≡ ⊢∘+`) a }¨ ↕ BitSlash ← {ty‿dy‿max𝕊n: f ← dy ⊑ ⟨/∘⊢ ⋄ {𝕩/ty V 𝕨 R 100}⟩ {𝕊: # 𝕩⊸{•Show 𝕨}⍟⊢ 0=10000|𝕩 t1←20 RH 100 n←R max x←n F n↑RB2 128+n t2←20 RH 100 x↩0 ⋄ t1 CH↩ ⋄ t2 CH↩ }¨↕n } •Show "∨`bitarr" ⋄ OrScanBitarr 100000 •Show "+`bitarr" ⋄ PlusScanBitarr 100000 •Show "heap corruption of /bit" ⋄ @‿0‿200 BitSlash 1000000 •Show "heap corruption of bit/i8" ⋄ "Ai8"‿1‿50 BitSlash 1000000 •Show "heap corruption of bit/i16" ⋄ "Ai16"‿1‿50 BitSlash 1000000 •Show "heap corruption of bit/i32" ⋄ "Ai32"‿1‿50 BitSlash 1000000