LAWS.min_dist2_cons: law of bend-prot@0.1.0.0 Import: import bend-prot@0.1.0.0/LAWS.bend as LAWS Lines 121-126 of bend-prot@0.1.0.0/LAWS.bend: https://jend.leeeet.dev/read.txt?path=bend-prot@0.1.0.0/LAWS.bend&start_line=121&end_line=126 import Base import bend-prot@0.1.0.0/geom.bend as G import bend-prot@0.1.0.0/protein.bend as P import bend-prot@0.1.0.0/topology.bend as T # Closest-approach folds one head into the running best. law min_dist2_cons: for h: P.Atom for t: List<&2, P.Atom> for qp: G.Vec3 {T.min_dist2_to(h <> t, qp) == T.min_cons(h, T.min_dist2_to(t, qp), qp) : Maybe<&2, F32>} Uses (7): https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32 https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe https://jend.leeeet.dev/definition.txt?path=bend-prot@0.1.0.0/geom.bend&name=Vec3 https://jend.leeeet.dev/definition.txt?path=bend-prot@0.1.0.0/protein.bend&name=Atom https://jend.leeeet.dev/definition.txt?path=bend-prot@0.1.0.0/topology.bend&name=min_cons https://jend.leeeet.dev/definition.txt?path=bend-prot@0.1.0.0/topology.bend&name=min_dist2_to