casadi 3.6.7__cp313-none-macosx_10_13_x86_64.macosx_10_13_intel.whl

casadi/include/casadi/core/runtime/casadi_sqpmethod.hpp

@@ -0,0 +1,178 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+
+// C-REPLACE "casadi_nlpsol_prob<T1>" "struct casadi_nlpsol_prob"
+
+// SYMBOL "sqpmethod_prob"
+template<typename T1>
+struct casadi_sqpmethod_prob {
+  const casadi_nlpsol_prob<T1>* nlp;
+  // Sparsity patterns
+  const casadi_int *sp_h, *sp_a, *sp_hr;
+  casadi_int merit_memsize;
+  casadi_int max_iter_ls;
+};
+// C-REPLACE "casadi_sqpmethod_prob<T1>" "struct casadi_sqpmethod_prob"
+
+
+// SYMBOL "sqpmethod_data"
+template<typename T1>
+struct casadi_sqpmethod_data {
+  // Problem structure
+  const casadi_sqpmethod_prob<T1>* prob;
+
+  T1* z_cand;
+  // Lagrange gradient in the next iterate
+  T1 *gLag, *gLag_old;
+  // Gradient of the objective
+  T1 *gf;
+  // Bounds of the QP
+  T1 *lbdz, *ubdz;
+  // QP solution
+  T1 *dx, *dlam;
+  // Hessian approximation
+  T1 *Bk;
+  // Jacobian
+  T1* Jk;
+  // merit_mem
+  T1* merit_mem;
+  // temp_mem
+  T1* temp_mem;
+  // temp_sol
+  T1* temp_sol;
+
+  const T1** arg;
+  T1** res;
+  casadi_int* iw;
+  T1* w;
+};
+// C-REPLACE "casadi_sqpmethod_data<T1>" "struct casadi_sqpmethod_data"
+
+
+// SYMBOL "sqpmethod_work"
+template<typename T1>
+void casadi_sqpmethod_work(const casadi_sqpmethod_prob<T1>* p,
+    casadi_int* sz_iw, casadi_int* sz_w, int elastic_mode, int so_corr) {
+  // Local variables
+  casadi_int nnz_h, nnz_a, nx, ng;
+  nnz_h = p->sp_h[2+p->sp_h[1]];
+  nnz_a = p->sp_a[2+p->sp_a[1]];
+  nx = p->nlp->nx;
+  ng = p->nlp->ng;
+
+  // Reset sz_w, sz_iw
+  *sz_w = *sz_iw = 0;
+  if (p->max_iter_ls>0 || so_corr) *sz_w += nx + ng; // z_cand
+  // Lagrange gradient in the next iterate
+  *sz_w += nx; // gLag
+  *sz_w += nx; // gLag_old
+  // Gradient of the objective
+  *sz_w += nx; // gf
+  // Bounds of the QP
+  *sz_w += nx + ng; // lbdz
+  *sz_w += nx + ng; // ubdz
+  // QP solution
+  *sz_w += nx; // dx
+  *sz_w += nx + ng; // dlam
+  // Hessian approximation
+  *sz_w += nnz_h; // Bk
+  // Jacobian
+  *sz_w += nnz_a; // Jk
+  // merit_mem
+  if (p->max_iter_ls>0 || so_corr) *sz_w += p->merit_memsize;
+
+  if (elastic_mode) {
+    // Additional work for larger objective gradient
+    *sz_w += 2*ng; // gf
+    // Additional work for the larger bounds
+    *sz_w += 2*ng; // lbdz
+    *sz_w += 2*ng; // ubdz
+    // Additional work for larger solution
+    *sz_w += 2*ng; // dx
+    *sz_w += 2*ng; // dlam
+    // Additional work for larger jacobian
+    *sz_w += 2*ng; // Jk
+    // Additional work for temp memory
+    *sz_w += ng;
+  }
+
+  if (so_corr) *sz_w += nx+nx+ng; // Temp memory for failing soc
+}
+
+// SYMBOL "sqpmethod_init"
+template<typename T1>
+void casadi_sqpmethod_init(casadi_sqpmethod_data<T1>* d,
+    const T1*** arg, T1*** res, casadi_int** iw, T1** w,
+    int elastic_mode, int so_corr) {
+  // Local variables
+  casadi_int nnz_h, nnz_a, nx, ng;
+  const casadi_sqpmethod_prob<T1>* p = d->prob;
+  // Get matrix number of nonzeros
+  nnz_h = p->sp_h[2+p->sp_h[1]];
+  nnz_a = p->sp_a[2+p->sp_a[1]];
+  nx = p->nlp->nx;
+  ng = p->nlp->ng;
+  if (p->max_iter_ls>0 || so_corr) {
+    d->z_cand = *w; *w += nx + ng;
+  }
+  // Lagrange gradient in the next iterate
+  d->gLag = *w; *w += nx;
+  d->gLag_old = *w; *w += nx;
+  // Hessian approximation
+  d->Bk = *w; *w += nnz_h;
+  // merit_mem
+  if (p->max_iter_ls>0 || so_corr) {
+    d->merit_mem = *w; *w += p->merit_memsize;
+  }
+
+  if (so_corr) {
+    d->temp_sol = *w; *w += nx+nx+ng;
+  }
+
+  if (elastic_mode) {
+    // Gradient of the objective
+    d->gf = *w; *w += nx + 2*ng;
+    // Bounds of the QP
+    d->lbdz = *w; *w += nx + 3*ng;
+    d->ubdz = *w; *w += nx + 3*ng;
+    // QP solution
+    d->dx = *w; *w += nx + 2*ng;
+    d->dlam = *w; *w += nx + 3*ng;
+    // Jacobian
+    d->Jk = *w; *w += nnz_a + 2*ng;
+    // temp mem
+    d->temp_mem = *w; *w += ng;
+  } else {
+    // Gradient of the objective
+    d->gf = *w; *w += nx;
+    // Bounds of the QP
+    d->lbdz = *w; *w += nx + ng;
+    d->ubdz = *w; *w += nx + ng;
+    // QP solution
+    d->dx = *w; *w += nx;
+    d->dlam = *w; *w += nx + ng;
+    // Jacobian
+    d->Jk = *w; *w += nnz_a;
+  }
+  d->arg = *arg;
+  d->res = *res;
+  d->iw = *iw;
+  d->w = *w;
+}

casadi/include/casadi/core/runtime/casadi_sum.hpp

@@ -0,0 +1,31 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+// SYMBOL "sum"
+template<typename T1>
+T1 casadi_sum(const T1* x, casadi_int n) {
+  casadi_int i;
+  T1 r = 0;
+
+  r = 0;
+  for (i=0; i<n; ++i) {
+    r += x[i];
+  }
+  return r;
+}

casadi/include/casadi/core/runtime/casadi_sum_viol.hpp

@@ -0,0 +1,37 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+// SYMBOL "sum_viol"
+template<typename T1>
+T1 casadi_sum_viol(casadi_int n, const T1* x, const T1* lb, const T1* ub) {
+  T1 r;
+  casadi_int i;
+  const T1 zero = 0;
+  r = 0;
+  for (i=0; i<n; ++i) {
+    T1 x_i, lb_i, ub_i;
+    x_i = x ? *x++ : zero;
+    lb_i = lb ? *lb++ : zero;
+    ub_i = ub ? *ub++ : zero;
+    // C-REPLACE "fmax" "casadi_fmax"
+    r += fmax(x_i-ub_i, zero);
+    r += fmax(lb_i-x_i, zero);
+  }
+  return r;
+}

casadi/include/casadi/core/runtime/casadi_swap.hpp

@@ -0,0 +1,32 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+// SYMBOL "swap"
+template<typename T1>
+void casadi_swap(casadi_int n, T1* x, casadi_int inc_x, T1* y, casadi_int inc_y) {
+  T1 t;
+  casadi_int i;
+  for (i=0; i<n; ++i) {
+    t = *x;
+    *x = *y;
+    *y = t;
+    x += inc_x;
+    y += inc_y;
+  }
+}

casadi/include/casadi/core/runtime/casadi_trans.hpp

@@ -0,0 +1,35 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+// SYMBOL "trans"
+template<typename T1>
+void casadi_trans(const T1* x, const casadi_int* sp_x, T1* y,
+    const casadi_int* sp_y, casadi_int* tmp) {
+  casadi_int ncol_x, nnz_x, ncol_y, k;
+  const casadi_int* row_x, *colind_y;
+  ncol_x = sp_x[1];
+  nnz_x = sp_x[2 + ncol_x];
+  row_x = sp_x + 2 + ncol_x+1;
+  ncol_y = sp_y[1];
+  colind_y = sp_y+2;
+  for (k=0; k<ncol_y; ++k) tmp[k] = colind_y[k];
+  for (k=0; k<nnz_x; ++k) {
+    y[tmp[row_x[k]]++] = x[k];
+  }
+}

casadi/include/casadi/core/runtime/casadi_tri_project.hpp

@@ -0,0 +1,37 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+// SYMBOL "tri_project"
+template<typename T1>
+void casadi_tri_project(const T1* x, const casadi_int* sp_x, T1* y, casadi_int lower) {
+  casadi_int ncol_x, j, k;
+  const casadi_int *colind_x, *row_x;
+  ncol_x = sp_x[1];
+  colind_x = sp_x+2; row_x = sp_x + 2 + ncol_x+1;
+
+  for (j=0; j<ncol_x; ++j) {
+    for (k=colind_x[j]; k<colind_x[j+1]; ++k) {
+      if (lower) {
+        if (row_x[k]>=j) *y++ = x ? x[k] : 0;
+      } else {
+        if (row_x[k]<=j) *y++ = x ? x[k] : 0;
+      }
+    }
+  }
+}

casadi/include/casadi/core/runtime/casadi_trilsolve.hpp

@@ -0,0 +1,81 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+
+// SYMBOL "trilsolve"
+template<typename T1>
+void casadi_trilsolve(const casadi_int* sp_a, const T1* nz_a, T1* x, int tr, int unity,
+    casadi_int nrhs) {
+  // Local variables
+  casadi_int nrow, ncol, r, c, k, rhs;
+  const casadi_int *colind, *row;
+  // Extract sparsity
+  nrow = sp_a[0];
+  ncol = sp_a[1];
+  colind = sp_a + 2;
+  row = colind + ncol + 1;
+  // For all right hand sides
+  for (rhs = 0; rhs < nrhs; ++rhs) {
+    if (unity) {
+      if (tr) {
+        // Backward substitution
+        for (c = ncol; c-- > 0; ) {
+          for (k = colind[c + 1]; k-- > colind[c]; ) {
+            x[c] += nz_a[k] * x[row[k]];
+          }
+        }
+      } else {
+        // Forward substitution
+        for (c = 0; c < ncol; ++c) {
+          for (k = colind[c]; k < colind[c+1]; ++k) {
+            x[row[k]] += nz_a[k] * x[c];
+          }
+        }
+      }
+    } else {
+      if (tr) {
+        // Backward substitution
+        for (c = ncol; c-- > 0; ) {
+          for (k = colind[c + 1]; k-- > colind[c]; ) {
+            r = row[k];
+            if (r == c) {
+              x[c] /= nz_a[k];
+            } else {
+              x[c] -= nz_a[k] * x[r];
+            }
+          }
+        }
+      } else {
+        // Forward substitution
+        for (c = 0; c < ncol; ++c) {
+          for (k = colind[c]; k < colind[c+1]; ++k) {
+            r = row[k];
+            if (r == c) {
+              x[r] /= nz_a[k];
+            } else {
+              x[r] -= nz_a[k] * x[c];
+            }
+          }
+        }
+      }
+    }
+    // Next right-hand-side
+    x += nrow;
+  }
+}

casadi/include/casadi/core/runtime/casadi_triusolve.hpp

@@ -0,0 +1,81 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+
+// SYMBOL "triusolve"
+template<typename T1>
+void casadi_triusolve(const casadi_int* sp_a, const T1* nz_a, T1* x, int tr, int unity,
+    casadi_int nrhs) {
+  // Local variables
+  casadi_int nrow, ncol, r, c, k, rhs;
+  const casadi_int *colind, *row;
+  // Extract sparsity
+  nrow = sp_a[0];
+  ncol = sp_a[1];
+  colind = sp_a + 2;
+  row = colind + ncol + 1;
+  // For all right hand sides
+  for (rhs = 0; rhs < nrhs; ++rhs) {
+    if (unity) {
+      if (tr) {
+        // Forward substitution
+        for (c = 0; c < ncol; ++c) {
+          for (k = colind[c]; k < colind[c+1]; ++k) {
+            x[c] += nz_a[k] * x[row[k]];
+          }
+        }
+      } else {
+        // Backward substitution
+        for (c = ncol; c-- > 0; ) {
+          for (k = colind[c + 1]; k-- > colind[c]; ) {
+            x[row[k]] += nz_a[k] * x[c];
+          }
+        }
+      }
+    } else {
+      if (tr) {
+        // Forward substitution
+        for (c = 0; c < ncol; ++c) {
+          for (k = colind[c]; k < colind[c+1]; ++k) {
+            r = row[k];
+            if (r == c) {
+              x[c] /= nz_a[k];
+            } else {
+              x[c] -= nz_a[k] * x[r];
+            }
+          }
+        }
+      } else {
+        // Backward substitution
+        for (c = ncol; c-- > 0; ) {
+          for (k = colind[c + 1]; k-- > colind[c]; ) {
+            r = row[k];
+            if (r == c) {
+              x[r] /= nz_a[k];
+            } else {
+              x[r] -= nz_a[k] * x[c];
+            }
+          }
+        }
+      }
+    }
+    // Next right-hand-side
+    x += nrow;
+  }
+}

casadi/include/casadi/core/runtime/casadi_vector_fmax.hpp

@@ -0,0 +1,28 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+
+// SYMBOL "vector_fmax"
+// elementwise fmax of two vectors
+template<typename T1>
+void casadi_vector_fmax(casadi_int n, const T1* x, const T1* y, T1* z) {
+  casadi_int i;
+  // C-REPLACE "fmax" "casadi_fmax"
+  for (i=0; i<n; ++i) z[i] = fmax(x[i], y[i]);
+}

casadi/include/casadi/core/runtime/casadi_vector_fmin.hpp

@@ -0,0 +1,28 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+
+// SYMBOL "vector_fmin"
+// elementwise fmin of two vectors
+template<typename T1>
+void casadi_vector_fmin(casadi_int n, const T1* x, const T1* y, T1* z) {
+  casadi_int i;
+  // C-REPLACE "fmin" "casadi_fmin"
+  for (i=0; i<n; ++i) z[i] = fmin(x[i], y[i]);
+}

casadi/include/casadi/core/runtime/casadi_vfmax.hpp

@@ -0,0 +1,28 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+
+// SYMBOL "vfmax"
+template<typename T1>
+T1 casadi_vfmax(const T1* x, casadi_int n, T1 r) {
+  casadi_int i;
+  // C-REPLACE "fmax" "casadi_fmax"
+  for (i=0; i<n; ++i) r = fmax(r, x[i]);
+  return r;
+}

casadi/include/casadi/core/runtime/casadi_vfmin.hpp

@@ -0,0 +1,28 @@
+//
+//    MIT No Attribution
+//
+//    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
+//
+//    Permission is hereby granted, free of charge, to any person obtaining a copy of this
+//    software and associated documentation files (the "Software"), to deal in the Software
+//    without restriction, including without limitation the rights to use, copy, modify,
+//    merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
+//    permit persons to whom the Software is furnished to do so.
+//
+//    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+//    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+//    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+//    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+//    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+//    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+//
+
+
+// SYMBOL "vfmin"
+template<typename T1>
+T1 casadi_vfmin(const T1* x, casadi_int n, T1 r) {
+  casadi_int i;
+  // C-REPLACE "fmin" "casadi_fmin"
+  for (i=0; i<n; ++i) r = fmin(r, x[i]);
+  return r;
+}