anchor.diff:                  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])
  +                    Array2D.init m n (fun i j -> x.[j, i])
               member o.Sum_M(x) = // Non-BLAS
                   if Array2D.isEmpty x then
                       0.
  
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.f
  
negative.code:             let m = Array2D.length1 a
              let n = Array2D.length2 a
              let a' = Array2D.zeroCreate n m
              for i = 0 to n - 1 do
                  for j = 0 to m - 1 do
                      a'.[i, j] <- a.[j, i]
              let b' = Array.copy b
              let ipiv = Array.zeroCreate n
              let mutable arg_n = n
  