anchor.diff:                      Array.empty
                   else
                       let n = min (Array2D.length1 x) (Array2D.length2 x)
  -                    if n > parallelizationThreshold then
  -                        Array.Parallel.init n (fun i -> x.[i, i])
  -                    else
  -                        Array.init n (fun i -> x.[i, i])
  +                    Array.init n (fun i -> x.[i, i])
               member o.Inverse_M(x) =
                   if Array2D.isEmpty x then
                       Some(Array2D.empty)
  
positive.code:                 else
                      let m = Array2D.length2 x
                      let n = Array2D.length1 x
                      if x.Length > parallelizationThreshold then
                          Array2D.Parallel.init m n (fun i j -> x.[j, i])
                      else
                          Array2D.init m n (fun i j -> x.[j, i])
              member o.Sum_M(x) = // Non-BLAS
                  if Array2D.isEmpty x then
                      0.
  
negative.code:                 else
                      let m = Array2D.length2 x
                      let n = Array2D.length1 x
                      Array2D.init m n (fun i j -> x.[j, i])
              member o.Sum_M(x) = // Non-BLAS
                  if Array2D.isEmpty x then
                      0.f
  