law cut_view_t

lawful-fields@0.1.1.0 · proof_cut.bend:938

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-fields@0.1.1.0/defs.bend as F
import lawful-fields@0.1.1.0/fields.bend as K
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P

938law cut_view_t:
939  for +len: U32
940  for +t: P.Tree<U32>
941  for +d: Nat
942  for +from: U32
943  for +to: U32
944  for +sep: U32
945  for +n: Nat
946  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
947  for +hft: {U32.is_le(from, to) == True{} : Bool}
948  for +ht: {Nat.is_le(U32.to_nat(to), D.size(C.BT(len, t))) == True{} : Bool}
949  for +hs: {U32.is_lt(sep, 256) == True{} : Bool}
950  {F.pieces(Pair.snd(D.Bytes, List<&2, U32>, K.cut(C.BT(len, t), from, to, sep, n)), D.view(C.BT(len, t)), U32.to_nat(from)) == List.take(&2, List<&2, U32>, F.split(D.slice(D.view(C.BT(len, t)), U32.to_nat(from), Nat.sub(U32.to_nat(to), U32.to_nat(from))), sep), n) : List<&2, List<&2, U32>>}