~/jendhub

def ce_g

bendtorch@1.3.0.0 · main.bend:3192

import bendtorch@1.3.0.0/main.bend as Bendtorch
import Base

3192# z[idx] = (p - [j == y]) / nf for j = jj..jj + k, p the row's probabilities
3193def ce_g(k: Nat, +idx: U32, +j: U32, +y: U32, +nf: F32, r: Array<F32> & F32) -> Array<F32>:
3194  match k r:
3195    case 0n Tuple{z, +x}:
3196      Array.set(F32, z, idx, ((x - hit(U32.is_eq(j, y)) : F32) / nf : F32))
3197    case 1n+q Tuple{z, +x}:
3198      ce_g(q, (idx + 1 : U32), (j + 1 : U32), y, nf, Array.get(F32, Array.set(F32, z, idx, ((x - hit(U32.is_eq(j, y)) : F32) / nf : F32)), (idx + 1 : U32)))

Uses (13)

Used by (1)