ruby-cbc 0.1.9 → 0.2.1

data/ext/ruby-cbc/install/include/coin/ClpCholeskyDense.hpp

@@ -1,162 +0,0 @@
-/* $Id: ClpCholeskyDense.hpp 1910 2013-01-27 02:00:13Z stefan $ */
-/*
-  Copyright (C) 2003, International Business Machines Corporation
-  and others.  All Rights Reserved.
-
-  This code is licensed under the terms of the Eclipse Public License (EPL).
-*/
-#ifndef ClpCholeskyDense_H
-#define ClpCholeskyDense_H
-
-#include "ClpCholeskyBase.hpp"
-class ClpMatrixBase;
-
-class ClpCholeskyDense : public ClpCholeskyBase {
-
-public:
-     /**@name Virtual methods that the derived classes provides  */
-     /**@{*/
-     /** Orders rows and saves pointer to matrix.and model.
-      Returns non-zero if not enough memory */
-     virtual int order(ClpInterior * model) ;
-     /** Does Symbolic factorization given permutation.
-         This is called immediately after order.  If user provides this then
-         user must provide factorize and solve.  Otherwise the default factorization is used
-         returns non-zero if not enough memory */
-     virtual int symbolic();
-     /** Factorize - filling in rowsDropped and returning number dropped.
-         If return code negative then out of memory */
-     virtual int factorize(const CoinWorkDouble * diagonal, int * rowsDropped) ;
-     /** Uses factorization to solve. */
-     virtual void solve (CoinWorkDouble * region) ;
-     /**@}*/
-
-     /**@name Non virtual methods for ClpCholeskyDense  */
-     /**@{*/
-     /** Reserves space.
-         If factor not NULL then just uses passed space
-      Returns non-zero if not enough memory */
-     int reserveSpace(const ClpCholeskyBase * factor, int numberRows) ;
-     /** Returns space needed */
-     CoinBigIndex space( int numberRows) const;
-     /** part 2 of Factorize - filling in rowsDropped */
-     void factorizePart2(int * rowsDropped) ;
-     /** part 2 of Factorize - filling in rowsDropped - blocked */
-     void factorizePart3(int * rowsDropped) ;
-     /** Forward part of solve */
-     void solveF1(longDouble * a, int n, CoinWorkDouble * region);
-     void solveF2(longDouble * a, int n, CoinWorkDouble * region, CoinWorkDouble * region2);
-     /** Backward part of solve */
-     void solveB1(longDouble * a, int n, CoinWorkDouble * region);
-     void solveB2(longDouble * a, int n, CoinWorkDouble * region, CoinWorkDouble * region2);
-     int bNumber(const longDouble * array, int &, int&);
-     /** A */
-     inline longDouble * aMatrix() const {
-          return sparseFactor_;
-     }
-     /** Diagonal */
-     inline longDouble * diagonal() const {
-          return diagonal_;
-     }
-     /**@}*/
-
-
-     /**@name Constructors, destructor */
-     /**@{*/
-     /** Default constructor. */
-     ClpCholeskyDense();
-     /** Destructor  */
-     virtual ~ClpCholeskyDense();
-     /** Copy */
-     ClpCholeskyDense(const ClpCholeskyDense&);
-     /** Assignment */
-     ClpCholeskyDense& operator=(const ClpCholeskyDense&);
-     /** Clone */
-     virtual ClpCholeskyBase * clone() const ;
-     /**@}*/
-
-
-private:
-     /**@name Data members */
-     /**@{*/
-     /** Just borrowing space */
-     bool borrowSpace_;
-     /**@}*/
-};
-
-/* structure for C */
-typedef struct {
-     longDouble * diagonal_;
-     longDouble * a;
-     longDouble * work;
-     int * rowsDropped;
-     double doubleParameters_[1]; /* corresponds to 10 */
-     int integerParameters_[2]; /* corresponds to 34, nThreads */
-     int n;
-     int numberBlocks;
-} ClpCholeskyDenseC;
-
-extern "C" {
-     void ClpCholeskySpawn(void *);
-}
-/**Non leaf recursive factor */
-void
-ClpCholeskyCfactor(ClpCholeskyDenseC * thisStruct,
-                   longDouble * a, int n, int numberBlocks,
-                   longDouble * diagonal, longDouble * work, int * rowsDropped);
-
-/**Non leaf recursive triangle rectangle update */
-void
-ClpCholeskyCtriRec(ClpCholeskyDenseC * thisStruct,
-                   longDouble * aTri, int nThis,
-                   longDouble * aUnder, longDouble * diagonal,
-                   longDouble * work,
-                   int nLeft, int iBlock, int jBlock,
-                   int numberBlocks);
-/**Non leaf recursive rectangle triangle update */
-void
-ClpCholeskyCrecTri(ClpCholeskyDenseC * thisStruct,
-                   longDouble * aUnder, int nTri, int nDo,
-                   int iBlock, int jBlock, longDouble * aTri,
-                   longDouble * diagonal, longDouble * work,
-                   int numberBlocks);
-/** Non leaf recursive rectangle rectangle update,
-    nUnder is number of rows in iBlock,
-    nUnderK is number of rows in kBlock
-*/
-void
-ClpCholeskyCrecRec(ClpCholeskyDenseC * thisStruct,
-                   longDouble * above, int nUnder, int nUnderK,
-                   int nDo, longDouble * aUnder, longDouble *aOther,
-                   longDouble * work,
-                   int iBlock, int jBlock,
-                   int numberBlocks);
-/**Leaf recursive factor */
-void
-ClpCholeskyCfactorLeaf(ClpCholeskyDenseC * thisStruct,
-                       longDouble * a, int n,
-                       longDouble * diagonal, longDouble * work,
-                       int * rowsDropped);
-/**Leaf recursive triangle rectangle update */
-void
-ClpCholeskyCtriRecLeaf(/*ClpCholeskyDenseC * thisStruct,*/
-     longDouble * aTri, longDouble * aUnder,
-     longDouble * diagonal, longDouble * work,
-     int nUnder);
-/**Leaf recursive rectangle triangle update */
-void
-ClpCholeskyCrecTriLeaf(/*ClpCholeskyDenseC * thisStruct, */
-     longDouble * aUnder, longDouble * aTri,
-     /*longDouble * diagonal,*/ longDouble * work, int nUnder);
-/** Leaf recursive rectangle rectangle update,
-    nUnder is number of rows in iBlock,
-    nUnderK is number of rows in kBlock
-*/
-void
-ClpCholeskyCrecRecLeaf(/*ClpCholeskyDenseC * thisStruct, */
-     const longDouble * COIN_RESTRICT above,
-     const longDouble * COIN_RESTRICT aUnder,
-     longDouble * COIN_RESTRICT aOther,
-     const longDouble * COIN_RESTRICT work,
-     int nUnder);
-#endif

data/ext/ruby-cbc/install/include/coin/ClpConfig.h

@@ -1,17 +0,0 @@
-/* src/config_clp.h.  Generated by configure.  */
-/* src/config_clp.h.in.  */
-
-/* Define to 1, 2, 3, or 4 if Aboca should be build. */
-/* #undef CLP_HAS_ABC */
-
-/* Version number of project */
-#define CLP_VERSION "1.16.9"
-
-/* Major Version number of project */
-#define CLP_VERSION_MAJOR 1
-
-/* Minor Version number of project */
-#define CLP_VERSION_MINOR 16
-
-/* Release Version number of project */
-#define CLP_VERSION_RELEASE 9

data/ext/ruby-cbc/install/include/coin/ClpConstraint.hpp

@@ -1,125 +0,0 @@
-/* $Id: ClpConstraint.hpp 1665 2011-01-04 17:55:54Z lou $ */
-// Copyright (C) 2007, International Business Machines
-// Corporation and others.  All Rights Reserved.
-// This code is licensed under the terms of the Eclipse Public License (EPL).
-
-#ifndef ClpConstraint_H
-#define ClpConstraint_H
-
-
-//#############################################################################
-class ClpSimplex;
-class ClpModel;
-
-/** Constraint Abstract Base Class
-
-Abstract Base Class for describing a constraint or objective function
-
-*/
-class ClpConstraint  {
-
-public:
-
-     ///@name Stuff
-     //@{
-
-     /** Fills gradient.  If Linear then solution may be NULL,
-         also returns true value of function and offset so we can use x not deltaX in constraint
-         If refresh is false then uses last solution
-         Uses model for scaling
-         Returns non-zero if gradient undefined at current solution
-     */
-     virtual int gradient(const ClpSimplex * model,
-                          const double * solution,
-                          double * gradient,
-                          double & functionValue ,
-                          double & offset,
-                          bool useScaling = false,
-                          bool refresh = true) const = 0;
-     /// Constraint function value
-     virtual double functionValue (const ClpSimplex * model,
-                                   const double * solution,
-                                   bool useScaling = false,
-                                   bool refresh = true) const ;
-     /// Resize constraint
-     virtual void resize(int newNumberColumns) = 0;
-     /// Delete columns in  constraint
-     virtual void deleteSome(int numberToDelete, const int * which) = 0;
-     /// Scale constraint
-     virtual void reallyScale(const double * columnScale) = 0;
-     /** Given a zeroed array sets nonlinear columns to 1.
-         Returns number of nonlinear columns
-      */
-     virtual int markNonlinear(char * which) const = 0;
-     /** Given a zeroed array sets possible nonzero coefficients to 1.
-         Returns number of nonzeros
-      */
-     virtual int markNonzero(char * which) const = 0;
-     //@}
-
-
-     ///@name Constructors and destructors
-     //@{
-     /// Default Constructor
-     ClpConstraint();
-
-     /// Copy constructor
-     ClpConstraint(const ClpConstraint &);
-
-     /// Assignment operator
-     ClpConstraint & operator=(const ClpConstraint& rhs);
-
-     /// Destructor
-     virtual ~ClpConstraint ();
-
-     /// Clone
-     virtual ClpConstraint * clone() const = 0;
-
-     //@}
-
-     ///@name Other
-     //@{
-     /// Returns type, 0 linear, 1 nonlinear
-     inline int type() {
-          return type_;
-     }
-     /// Row number (-1 is objective)
-     inline int rowNumber() const {
-          return rowNumber_;
-     }
-
-     /// Number of possible coefficients in gradient
-     virtual int numberCoefficients() const = 0;
-
-     /// Stored constraint function value
-     inline double functionValue () const {
-          return functionValue_;
-     }
-
-     /// Constraint offset
-     inline double offset () const {
-          return offset_;
-     }
-     /// Say we have new primal solution - so may need to recompute
-     virtual void newXValues() {}
-     //@}
-
-     //---------------------------------------------------------------------------
-
-protected:
-     ///@name Protected member data
-     //@{
-     /// Gradient at last evaluation
-     mutable double * lastGradient_;
-     /// Value of non-linear part of constraint
-     mutable double functionValue_;
-     /// Value of offset for constraint
-     mutable double offset_;
-     /// Type of constraint - linear is 1
-     int type_;
-     /// Row number (-1 is objective)
-     int rowNumber_;
-     //@}
-};
-
-#endif

data/ext/ruby-cbc/install/include/coin/ClpConstraintAmpl.hpp

@@ -1,108 +0,0 @@
-/* $Id: ClpConstraintAmpl.hpp 1899 2013-04-09 18:12:08Z stefan $ */
-// Copyright (C) 2007, International Business Machines
-// Corporation and others.  All Rights Reserved.
-// This code is licensed under the terms of the Eclipse Public License (EPL).
-
-#ifndef ClpConstraintAmpl_H
-#define ClpConstraintAmpl_H
-
-#include "ClpConstraint.hpp"
-
-//#############################################################################
-
-/** Ampl Constraint Class
-
-*/
-
-class ClpConstraintAmpl : public ClpConstraint {
-
-public:
-
-    ///@name Stuff
-    //@{
-
-
-    /** Fills gradient.  If Ampl then solution may be NULL,
-        also returns true value of function and offset so we can use x not deltaX in constraint
-        If refresh is false then uses last solution
-        Uses model for scaling
-        Returns non-zero if gradient udefined at current solution
-    */
-    virtual int gradient(const ClpSimplex * model,
-                         const double * solution,
-                         double * gradient,
-                         double & functionValue ,
-                         double & offset,
-                         bool useScaling = false,
-                         bool refresh = true) const ;
-    /// Resize constraint
-    virtual void resize(int newNumberColumns) ;
-    /// Delete columns in  constraint
-    virtual void deleteSome(int numberToDelete, const int * which) ;
-    /// Scale constraint
-    virtual void reallyScale(const double * columnScale) ;
-    /** Given a zeroed array sets nonampl columns to 1.
-        Returns number of nonampl columns
-     */
-    virtual int markNonlinear(char * which) const ;
-    /** Given a zeroed array sets possible nonzero coefficients to 1.
-        Returns number of nonzeros
-     */
-    virtual int markNonzero(char * which) const;
-    /// Say we have new primal solution - so may need to recompute
-    virtual void newXValues() ;
-    //@}
-
-
-    ///@name Constructors and destructors
-    //@{
-    /// Default Constructor
-    ClpConstraintAmpl();
-
-    /// Constructor from ampl
-    ClpConstraintAmpl(int row, void * amplInfo);
-
-    /** Copy constructor .
-    */
-    ClpConstraintAmpl(const ClpConstraintAmpl & rhs);
-
-    /// Assignment operator
-    ClpConstraintAmpl & operator=(const ClpConstraintAmpl& rhs);
-
-    /// Destructor
-    virtual ~ClpConstraintAmpl ();
-
-    /// Clone
-    virtual ClpConstraint * clone() const;
-    //@}
-    ///@name Gets and sets
-    //@{
-    /// Number of coefficients
-    virtual int numberCoefficients() const;
-    /// Columns
-    inline const int * column() const {
-        return column_;
-    }
-    /// Coefficients
-    inline const double * coefficient() const {
-        return coefficient_;
-    }
-    //@}
-
-    //---------------------------------------------------------------------------
-
-private:
-    ///@name Private member data
-    /// Ampl info
-    void * amplInfo_;
-    /// Column
-    int * column_;
-    /// Coefficients
-    double * coefficient_;
-    /// Number of coefficients in gradient
-    int numberCoefficients_;
-    //@}
-};
-
-#endif
-

data/ext/ruby-cbc/install/include/coin/ClpConstraintLinear.hpp

@@ -1,110 +0,0 @@
-/* $Id: ClpConstraintLinear.hpp 1665 2011-01-04 17:55:54Z lou $ */
-// Copyright (C) 2007, International Business Machines
-// Corporation and others.  All Rights Reserved.
-// This code is licensed under the terms of the Eclipse Public License (EPL).
-
-#ifndef ClpConstraintLinear_H
-#define ClpConstraintLinear_H
-
-#include "ClpConstraint.hpp"
-
-//#############################################################################
-
-/** Linear Constraint Class
-
-*/
-
-class ClpConstraintLinear : public ClpConstraint {
-
-public:
-
-     ///@name Stuff
-     //@{
-
-
-     /** Fills gradient.  If Linear then solution may be NULL,
-         also returns true value of function and offset so we can use x not deltaX in constraint
-         If refresh is false then uses last solution
-         Uses model for scaling
-         Returns non-zero if gradient udefined at current solution
-     */
-     virtual int gradient(const ClpSimplex * model,
-                          const double * solution,
-                          double * gradient,
-                          double & functionValue ,
-                          double & offset,
-                          bool useScaling = false,
-                          bool refresh = true) const ;
-     /// Resize constraint
-     virtual void resize(int newNumberColumns) ;
-     /// Delete columns in  constraint
-     virtual void deleteSome(int numberToDelete, const int * which) ;
-     /// Scale constraint
-     virtual void reallyScale(const double * columnScale) ;
-     /** Given a zeroed array sets nonlinear columns to 1.
-         Returns number of nonlinear columns
-      */
-     virtual int markNonlinear(char * which) const ;
-     /** Given a zeroed array sets possible nonzero coefficients to 1.
-         Returns number of nonzeros
-      */
-     virtual int markNonzero(char * which) const;
-     //@}
-
-
-     ///@name Constructors and destructors
-     //@{
-     /// Default Constructor
-     ClpConstraintLinear();
-
-     /// Constructor from constraint
-     ClpConstraintLinear(int row, int numberCoefficients, int numberColumns,
-                         const int * column, const double * element);
-
-     /** Copy constructor .
-     */
-     ClpConstraintLinear(const ClpConstraintLinear & rhs);
-
-     /// Assignment operator
-     ClpConstraintLinear & operator=(const ClpConstraintLinear& rhs);
-
-     /// Destructor
-     virtual ~ClpConstraintLinear ();
-
-     /// Clone
-     virtual ClpConstraint * clone() const;
-     //@}
-     ///@name Gets and sets
-     //@{
-     /// Number of coefficients
-     virtual int numberCoefficients() const;
-     /// Number of columns in linear constraint
-     inline int numberColumns() const {
-          return numberColumns_;
-     }
-     /// Columns
-     inline const int * column() const {
-          return column_;
-     }
-     /// Coefficients
-     inline const double * coefficient() const {
-          return coefficient_;
-     }
-     //@}
-
-     //---------------------------------------------------------------------------
-
-private:
-     ///@name Private member data
-     /// Column
-     int * column_;
-     /// Coefficients
-     double * coefficient_;
-     /// Useful to have number of columns about
-     int numberColumns_;
-     /// Number of coefficients
-     int numberCoefficients_;
-     //@}
-};
-
-#endif