casadi 3.6.4__cp312-none-macosx_10_13_x86_64.macosx_10_13_intel.whl

casadi/include/include/blasfeo_stdlib.h

@@ -0,0 +1,62 @@
+/**************************************************************************************************
+*                                                                                                 *
+* This file is part of BLASFEO.                                                                   *
+*                                                                                                 *
+* BLASFEO -- BLAS For Embedded Optimization.                                                      *
+* Copyright (C) 2019 by Gianluca Frison.                                                          *
+* Developed at IMTEK (University of Freiburg) under the supervision of Moritz Diehl.              *
+* All rights reserved.                                                                            *
+*                                                                                                 *
+* The 2-Clause BSD License                                                                        *
+*                                                                                                 *
+* Redistribution and use in source and binary forms, with or without                              *
+* modification, are permitted provided that the following conditions are met:                     *
+*                                                                                                 *
+* 1. Redistributions of source code must retain the above copyright notice, this                  *
+*    list of conditions and the following disclaimer.                                             *
+* 2. Redistributions in binary form must reproduce the above copyright notice,                    *
+*    this list of conditions and the following disclaimer in the documentation                    *
+*    and/or other materials provided with the distribution.                                       *
+*                                                                                                 *
+* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND                 *
+* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED                   *
+* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE                          *
+* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR                 *
+* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES                  *
+* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;                    *
+* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND                     *
+* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT                      *
+* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS                   *
+* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.                                    *
+*                                                                                                 *
+* Author: Gianluca Frison, gianluca.frison (at) imtek.uni-freiburg.de                             *
+*                                                                                                 *
+**************************************************************************************************/
+
+#ifndef BLASFEO_STDLIB_H_
+#define BLASFEO_STDLIB_H_
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+
+#include <stdlib.h>
+
+//
+void blasfeo_malloc(void **ptr, size_t size);
+//
+void blasfeo_malloc_align(void **ptr, size_t size);
+//
+void blasfeo_free(void *ptr);
+//
+void blasfeo_free_align(void *ptr);
+
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // BLASFEO_STDLIB_H_

casadi/include/include/blasfeo_target.h

@@ -0,0 +1,73 @@
+#ifndef TARGET_GENERIC
+#define TARGET_GENERIC
+#endif
+
+#ifndef TARGET_NEED_FEATURE_AVX2
+/* #undef TARGET_NEED_FEATURE_AVX2 */
+#endif
+
+#ifndef TARGET_NEED_FEATURE_FMA
+/* #undef TARGET_NEED_FEATURE_FMA */
+#endif
+
+#ifndef TARGET_NEED_FEATURE_SSE3
+/* #undef TARGET_NEED_FEATURE_SSE3 */
+#endif
+
+#ifndef TARGET_NEED_FEATURE_AVX
+/* #undef TARGET_NEED_FEATURE_AVX */
+#endif
+
+#ifndef TARGET_NEED_FEATURE_VFPv3
+/* #undef TARGET_NEED_FEATURE_VFPv3 */
+#endif
+
+#ifndef TARGET_NEED_FEATURE_NEON
+/* #undef TARGET_NEED_FEATURE_NEON */
+#endif
+
+#ifndef TARGET_NEED_FEATURE_VFPv4
+/* #undef TARGET_NEED_FEATURE_VFPv4 */
+#endif
+
+#ifndef TARGET_NEED_FEATURE_NEONv2
+/* #undef TARGET_NEED_FEATURE_NEONv2 */
+#endif
+
+#ifndef LA_HIGH_PERFORMANCE
+#define LA_HIGH_PERFORMANCE
+#endif
+
+#ifndef MF_PANELMAJ
+#define MF_PANELMAJ
+#endif
+
+#ifndef EXT_DEP
+#define ON 1
+#define OFF 0
+#if ON==ON
+#define EXT_DEP
+#endif
+#undef ON
+#undef OFF
+#endif
+
+#ifndef BLAS_API
+#define ON 1
+#define OFF 0
+#if ON==ON
+#define BLAS_API
+#endif
+#undef ON
+#undef OFF
+#endif
+
+#ifndef FORTRAN_BLAS_API
+#define ON 1
+#define OFF 0
+#if OFF==ON
+#define FORTRAN_BLAS_API
+#endif
+#undef ON
+#undef OFF
+#endif

casadi/include/include/blasfeo_timing.h

@@ -0,0 +1,114 @@
+/**************************************************************************************************
+*                                                                                                 *
+* This file is part of BLASFEO.                                                                   *
+*                                                                                                 *
+* BLASFEO -- BLAS For Embedded Optimization.                                                      *
+* Copyright (C) 2019 by Gianluca Frison.                                                          *
+* Developed at IMTEK (University of Freiburg) under the supervision of Moritz Diehl.              *
+* All rights reserved.                                                                            *
+*                                                                                                 *
+* The 2-Clause BSD License                                                                        *
+*                                                                                                 *
+* Redistribution and use in source and binary forms, with or without                              *
+* modification, are permitted provided that the following conditions are met:                     *
+*                                                                                                 *
+* 1. Redistributions of source code must retain the above copyright notice, this                  *
+*    list of conditions and the following disclaimer.                                             *
+* 2. Redistributions in binary form must reproduce the above copyright notice,                    *
+*    this list of conditions and the following disclaimer in the documentation                    *
+*    and/or other materials provided with the distribution.                                       *
+*                                                                                                 *
+* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND                 *
+* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED                   *
+* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE                          *
+* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR                 *
+* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES                  *
+* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;                    *
+* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND                     *
+* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT                      *
+* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS                   *
+* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.                                    *
+*                                                                                                 *
+* Author: Gianluca Frison, gianluca.frison (at) imtek.uni-freiburg.de                             *
+*                                                                                                 *
+**************************************************************************************************/
+
+#ifndef BLASFEO_TIMING_H_
+#define BLASFEO_TIMING_H_
+
+//#include <stdbool.h>
+
+#if (defined _WIN32 || defined _WIN64) && !(defined __MINGW32__ || defined __MINGW64__)
+
+	/* Use Windows QueryPerformanceCounter for timing. */
+	#include <Windows.h>
+
+	/** A structure for keeping internal timer data. */
+	typedef struct blasfeo_timer_ {
+		LARGE_INTEGER tic;
+		LARGE_INTEGER toc;
+		LARGE_INTEGER freq;
+	} blasfeo_timer;
+
+#elif(defined __APPLE__)
+
+	#include <mach/mach_time.h>
+
+	/** A structure for keeping internal timer data. */
+	typedef struct blasfeo_timer_ {
+		uint64_t tic;
+		uint64_t toc;
+		mach_timebase_info_data_t tinfo;
+	} blasfeo_timer;
+
+#elif(defined __DSPACE__)
+
+	#include <brtenv.h>
+
+	typedef struct blasfeo_timer_ {
+		double time;
+	} blasfeo_timer;
+
+#elif(defined __XILINX_NONE_ELF__ || defined __XILINX_ULTRASCALE_NONE_ELF_JAILHOUSE__)
+
+	#include "xtime_l.h"
+
+	typedef struct blasfeo_timer_ {
+		uint64_t tic;
+		uint64_t toc;
+	} blasfeo_timer;
+
+#else
+
+	/* Use POSIX clock_gettime() for timing on non-Windows machines. */
+	#include <time.h>
+
+	#if __STDC_VERSION__ >= 199901L  // C99 Mode
+
+		#include <sys/stat.h>
+		#include <sys/time.h>
+
+		typedef struct blasfeo_timer_ {
+			struct timeval tic;
+			struct timeval toc;
+		} blasfeo_timer;
+
+	#else  // ANSI C Mode
+
+		/** A structure for keeping internal timer data. */
+		typedef struct blasfeo_timer_ {
+			struct timespec tic;
+			struct timespec toc;
+		} blasfeo_timer;
+
+	#endif  // __STDC_VERSION__ >= 199901L
+
+#endif  // (defined _WIN32 || defined _WIN64)
+
+/** A function for measurement of the current time. */
+void blasfeo_tic(blasfeo_timer* t);
+
+/** A function which returns the elapsed time. */
+double blasfeo_toc(blasfeo_timer* t);
+
+#endif  // BLASFEO_TIMING_H_

casadi/include/include/blasfeo_v_aux_ext_dep.h

@@ -0,0 +1,83 @@
+/**************************************************************************************************
+*                                                                                                 *
+* This file is part of BLASFEO.                                                                   *
+*                                                                                                 *
+* BLASFEO -- BLAS For Embedded Optimization.                                                      *
+* Copyright (C) 2019 by Gianluca Frison.                                                          *
+* Developed at IMTEK (University of Freiburg) under the supervision of Moritz Diehl.              *
+* All rights reserved.                                                                            *
+*                                                                                                 *
+* The 2-Clause BSD License                                                                        *
+*                                                                                                 *
+* Redistribution and use in source and binary forms, with or without                              *
+* modification, are permitted provided that the following conditions are met:                     *
+*                                                                                                 *
+* 1. Redistributions of source code must retain the above copyright notice, this                  *
+*    list of conditions and the following disclaimer.                                             *
+* 2. Redistributions in binary form must reproduce the above copyright notice,                    *
+*    this list of conditions and the following disclaimer in the documentation                    *
+*    and/or other materials provided with the distribution.                                       *
+*                                                                                                 *
+* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND                 *
+* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED                   *
+* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE                          *
+* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR                 *
+* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES                  *
+* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;                    *
+* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND                     *
+* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT                      *
+* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS                   *
+* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.                                    *
+*                                                                                                 *
+* Author: Gianluca Frison, gianluca.frison (at) imtek.uni-freiburg.de                             *
+*                                                                                                 *
+**************************************************************************************************/
+
+#ifndef BLASFEO_V_AUX_EXT_DEP_H_
+#define BLASFEO_V_AUX_EXT_DEP_H_
+
+
+
+#include "blasfeo_target.h"
+
+
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+
+/************************************************
+* d_aux_extern_depend_lib.c
+************************************************/
+
+#ifdef EXT_DEP
+
+void v_zeros(void **ptrA, int size);
+// dynamically allocate size bytes of memory aligned to 64-byte boundaries and set accordingly a pointer to void; set allocated memory to zero
+void v_zeros_align(void **ptrA, int size);
+// free the memory allocated by v_zeros
+void v_free(void *ptrA);
+// free the memory allocated by v_zeros_aligned
+void v_free_align(void *ptrA);
+// dynamically allocate size bytes of memory and set accordingly a pointer to char; set allocated memory to zero
+void c_zeros(char **ptrA, int size);
+// dynamically allocate size bytes of memory aligned to 64-byte boundaries and set accordingly a pointer to char; set allocated memory to zero
+void c_zeros_align(char **ptrA, int size);
+// free the memory allocated by c_zeros
+void c_free(char *ptrA);
+// free the memory allocated by c_zeros_aligned
+void c_free_align(char *ptrA);
+
+#endif // EXT_DEP
+
+
+
+#ifdef __cplusplus
+}
+#endif
+
+
+
+#endif  // BLASFEO_V_AUX_EXT_DEP_H_

casadi/include/include/coin/BonArraysHelpers.hpp

@@ -0,0 +1,52 @@
+// (C) Copyright International Business Machines Corporation 2007
+// All Rights Reserved.
+// This code is published under the Eclipse Public License.
+//
+// Authors :
+// Pierre Bonami, International Business Machines Corporation
+//
+// Date : 10/06/2007
+
+#include "CoinHelperFunctions.hpp"
+#ifndef BonArraysHelpers_H
+#define BonArraysHelpers_H
+
+namespace Bonmin {
+template <class X> void
+resizeAndCopyArray(X *& array, unsigned int oldSize, unsigned int newSize){
+ if(newSize == 0){
+   if(oldSize > 0){
+     delete [] array;
+     array = NULL;
+   }
+   return;
+ }
+ X * buffy = new X[newSize];
+ if(oldSize > 0){
+   if(oldSize < newSize)
+     CoinCopyN(array, oldSize, buffy);
+   else
+     CoinCopyN(array, newSize, buffy);
+   delete [] array;
+ }
+ array = buffy;
+}
+
+template <class X> void
+resizeAndCopyArray(X *& array, unsigned int oldSize, unsigned int newSize,
+                   unsigned int& capacity){
+ if(newSize > capacity){
+   X * buffy = new X[newSize];
+   if(oldSize > 0){
+     CoinCopyN(array, oldSize, buffy);
+     delete [] array;
+    }
+   array = buffy;
+  }
+  else {
+    newSize = oldSize;
+  }
+}
+}// Ends Bonmin namespace
+#endif
+

casadi/include/include/coin/BonAuxInfos.hpp

@@ -0,0 +1,110 @@
+// (C) Copyright International Business Machines Corporation 2007
+// All Rights Reserved.
+// This code is published under the Eclipse Public License.
+//
+// Authors :
+// Pierre Bonami, International Business Machines Corporation
+//
+// Date : 04/23/2007
+
+#ifndef BonAuxInfos_H
+#define BonAuxInfos_H
+#include <cstdlib>
+#include <vector>
+#include "OsiAuxInfo.hpp"
+#include "CoinSmartPtr.hpp"
+#include "BonTypes.hpp"
+
+
+namespace Bonmin {
+
+
+  /** Bonmin class for passing info between components of branch-and-cuts.*/
+class AuxInfo : public OsiBabSolver {
+public:
+  /** Default constructor.*/
+  AuxInfo(int type);
+
+  /** Constructor from OsiBabSolver.*/
+  AuxInfo(const OsiBabSolver &other);
+
+  /** Copy constructor.*/
+  AuxInfo(const AuxInfo &other);
+  
+  /** Destructor.*/
+  virtual ~AuxInfo();
+  
+  /** Virtual copy constructor.*/
+  virtual OsiAuxInfo * clone() const;
+  
+  /** Declare the node to be feasible.*/
+  void setFeasibleNode(){
+    infeasibleNode_ = false;}
+  
+  /** Declare the node to be infeasible.*/
+  void setInfeasibleNode(){
+    infeasibleNode_ = true;}
+  
+  /** Say if current node is found feasible by cut generators.*/
+  bool infeasibleNode(){
+    return infeasibleNode_;}
+  
+  /** Get solution found by nlp solver (or NULL if none found).*/
+  const double * nlpSolution(){
+
+    if(hasNlpSolution_)
+      return nlpSolution_;
+    else
+      return NULL;
+  }
+
+  /** Get objective value of nlp solution found, or +infinity if none exists */
+  double nlpObjValue ();
+
+  /** Pass a solution found by an nlp solver.*/
+  void setNlpSolution(const double * sol, int numcols, double objValue);
+  
+  /** Say if has an nlp solution*/
+  void setHasNlpSolution(bool b){
+    hasNlpSolution_ = b;}
+  /** get the best solution computed with alternative objective function.*/
+  const std::vector<double>& bestSolution2() const
+  {
+    return (*bestSolution2_)();
+  }
+  /** return objective value of the best solution computed with alternative
+      objective function.*/
+  double bestObj2() const
+  {
+    return (*bestObj2_)();
+  }
+  /** Set an alternate objective value.*/
+  void setBestObj2(double o)
+  {
+    (*bestObj2_)() = o;
+  }
+  void setBestSolution2(int n, double * d)
+  {
+    (*bestSolution2_)().clear();
+    (*bestSolution2_)().insert((*bestSolution2_)().end(),d, d+n);
+  }
+protected: 
+  /** Say if current node was found infeasible during cut generation*/
+  bool infeasibleNode_;
+  /** value of the objective function of this nlp solution */
+  double objValue_;
+  /** nlp solution found by heuristic if any.*/
+  double * nlpSolution_;
+  /** numcols_ gives the size of nlpSolution_.*/
+  int numcols_;
+  /** say if has a solution.*/
+  bool hasNlpSolution_;
+  /** Stores the solution with alternate objective.*/
+  Coin::SmartPtr< SimpleReferenced<std::vector<double> > > bestSolution2_;
+  /** Alternate solution objective value.*/
+  Coin::SmartPtr< SimpleReferenced<double> > bestObj2_;
+  };
+}/* End namespace.*/
+
+#endif
+

casadi/include/include/coin/BonBabInfos.hpp

@@ -0,0 +1,57 @@
+// (C) Copyright International Business Machines Corporation 2007
+// All Rights Reserved.
+// This code is published under the Eclipse Public License.
+//
+// Authors :
+// Pierre Bonami, International Business Machines Corporation
+//
+// Date : 04/23/2007
+
+#ifndef BonBabInfos_H
+#define BonBabInfos_H
+#include <stdlib.h>
+#include "BonAuxInfos.hpp"
+
+namespace Bonmin
+{
+  class Bab;
+  /** Bonmin class for passing info between components of branch-and-cuts.*/
+  class BabInfo : public Bonmin::AuxInfo
+  {
+  public:
+    /** Default constructor.*/
+    BabInfo(int type);
+
+    /** Constructor from OsiBabSolver.*/
+    BabInfo(const OsiBabSolver &other);
+
+    /** Copy constructor.*/
+    BabInfo(const BabInfo &other);
+
+    /** Destructor.*/
+    virtual ~BabInfo();
+
+    /** Virtual copy constructor.*/
+    virtual OsiAuxInfo * clone() const;
+
+    /** Set pointer to the branch-and-bound algorithm (to access CbcModel).*/
+    void setBabPtr(Bab * babPtr)
+    {
+      babPtr_ = babPtr;
+    }
+
+    /** Pointer to the branch-and-bound algorithm (to access CbcModel).*/
+    Bab * babPtr()
+    {
+      return babPtr_;
+    }
+
+    bool hasSolution() const{
+      return bestSolution_ != NULL;}
+  protected:
+    /** Pointer to branch-and-bound algorithm.*/
+    Bab * babPtr_;
+  };
+}/* End namespace.*/
+
+#endif