def bounds_min_go

mlbend-preprocess@0.1.0.0 · main.bend:55

import Base

55# The smallest of two rows, cell by cell.
56def bounds_min_go(mins: List<&2, F32>, row: List<&2, F32>, +acc: List<&2, F32>) -> List<&2, F32>:
57  match mins:
58    case Nil{}:
59      acc
60    case Con{a, ta}:
61      match row:
62        case Con{b, tb}:
63          bounds_min_go(ta, tb, List.append(&2, F32, acc, Con{F32.min(a, b), Nil{}}))
64        case Nil{}:
65          acc