ProofIndex.set_tree: def of lawful-arrays@0.1.0.0
Import: import lawful-arrays@0.1.0.0/proof_index.bend as ProofIndex
Lines 595-598 of lawful-arrays@0.1.0.0/proof_index.bend: https://jend.leeeet.dev/read.txt?path=lawful-arrays@0.1.0.0/proof_index.bend&start_line=595&end_line=598

import Base
import lawful-arrays@0.1.0.0/proof_tree.bend as P

def set_tree(-T: Data, +t: P.Tree<T>, +i: U32, +v: T) -> P.Tree<T>:
  +n = Pair.snd(Array<T>, U32, Array.size(T, P.fromT(T, t)))
  +j = U32.and(i, U32.sub(n, 1))
  tswap(T, t, n, j, v, U32.is_lt(j, U32.shr(n)))

Uses (11):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.size
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair.snd
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.and
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.is_lt
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.shr
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.sub
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_index.bend&name=tswap
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=Tree
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=fromT