1 files changed, 0 insertions, 168 deletions
diff --git a/build/Bonmin/include/coin/CbcCountRowCut.hpp b/build/Bonmin/include/coin/CbcCountRowCut.hpp
deleted file mode 100644
index 73eac08..0000000
--- a/build/Bonmin/include/coin/CbcCountRowCut.hpp
+++ /dev/null
@@ -1,168 +0,0 @@
-/* $Id: CbcCountRowCut.hpp 2094 2014-11-18 11:15:36Z forrest $ */
-// Copyright (C) 2002, International Business Machines
-// Corporation and others.  All Rights Reserved.
-// This code is licensed under the terms of the Eclipse Public License (EPL).
-
-#ifndef CbcCountRowCut_H
-#define CbcCountRowCut_H
-
-
-class OsiCuts;
-class OsiRowCut;
-class CbcNodeInfo;
-
-//#############################################################################
-/** \brief OsiRowCut augmented with bookkeeping
-
-  CbcCountRowCut is an OsiRowCut object augmented with bookkeeping
-  information: a reference count and information that specifies the
-  the generator that created the cut and the node to which it's associated.
-
-  The general principles for handling the reference count are as follows:
-  <ul>
-    <li> Once it's determined how the node will branch, increment the
-	 reference count under the assumption that all children will use
-         all cuts currently tight at the node and will survive to be placed
-	 in the search tree.
-    <li> As this assumption is proven incorrect (a cut becomes loose, or a
-	 child is fathomed), decrement the reference count accordingly.
-  </ul>
-  When all possible uses of a cut have been demonstrated to be unnecessary,
-  the reference count (#numberPointingToThis_) will fall to zero. The
-  CbcCountRowCut object (and its included OsiRowCut object) are then deleted.
-*/
-
-class CbcCountRowCut : public OsiRowCut {
-
-public:
-
-    /** @name Constructors & destructors */
-    //@{
-
-    /// Default Constructor
-    CbcCountRowCut ();
-
-    /// `Copy' constructor using an OsiRowCut
-    CbcCountRowCut ( const OsiRowCut &);
-
-    /// `Copy' constructor using an OsiRowCut and an CbcNodeInfo
-    CbcCountRowCut(const OsiRowCut &, CbcNodeInfo *, int whichOne,
-                   int whichGenerator = -1, int numberPointingToThis = 0);
-
-    /** Destructor
-
-      \note The destructor will reach out (via #owner_) and NULL the
-      reference to the cut in the owner's
-      \link CbcNodeInfo::cuts_ cuts_ \endlink list.
-    */
-    virtual ~CbcCountRowCut ();
-    //@}
-
-    /// Increment the number of references
-    void increment(int change = 1);
-
-    /// Decrement the number of references and return the number left.
-    int decrement(int change = 1);
-
-    /** \brief Set the information associating this cut with a node
-
-      An CbcNodeInfo object and an index in the cut set of the node.
-      For locally valid cuts, the node will be the  search tree node where the
-      cut was generated. For globally valid cuts, it's the node where the cut
-      was activated.
-    */
-    void setInfo(CbcNodeInfo *, int whichOne);
-
-    /// Number of other CbcNodeInfo objects pointing to this row cut
-    inline int numberPointingToThis() {
-        return numberPointingToThis_;
-    }
-
-    /// Which generator for cuts - as user order
-    inline int whichCutGenerator() const {
-        return whichCutGenerator_;
-    }
-
-    /// Returns true if can drop cut if slack basic
-    bool canDropCut(const OsiSolverInterface * solver, int row) const;
-
-#ifdef CHECK_CUT_COUNTS
-    // Just for printing sanity checks
-    int tempNumber_;
-#endif
-
-private:
-
-    /// Standard copy is illegal (reference counts would be incorrect)
-    CbcCountRowCut(const CbcCountRowCut &);
-
-    /// Standard assignment is illegal (reference counts would be incorrect)
-    CbcCountRowCut & operator=(const CbcCountRowCut& rhs);
-
-    /// Backward pointer to owning CbcNodeInfo
-    CbcNodeInfo * owner_;
-
-    /// Index of cut in owner's cut set
-    /// (\link CbcNodeInfo::cuts_ cuts_ \endlink).
-    int ownerCut_;
-
-    /// Number of other CbcNodeInfo objects pointing to this cut
-    int numberPointingToThis_;
-
-    /** Which generator created this cut 
-	(add 10000 if globally valid)
-	if -1 then from global cut pool
-	-2 cut branch
-        -3 unknown
-    */
-    int whichCutGenerator_;
-
-};
-/**
-   Really for Conflict cuts to -
-   a) stop duplicates
-   b) allow half baked cuts
-   The whichRow_ field in OsiRowCut2 is used for a type
-   0 - normal 
-   1 - processed cut (conflict)
-   2 - unprocessed cut i.e. dual ray computation
-*/
-// for hashing
-typedef struct {
-  int index, next;
-} CoinHashLink;
-class CbcRowCuts {
-public:
-
-  CbcRowCuts(int initialMaxSize=0, int hashMultiplier=4 );
-  ~CbcRowCuts();
-  CbcRowCuts(const CbcRowCuts& rhs);
-  CbcRowCuts& operator=(const CbcRowCuts& rhs);
-  inline OsiRowCut2 * cut(int sequence) const
-  { return rowCut_[sequence];}
-  inline int numberCuts() const
-  { return numberCuts_;}
-  inline int sizeRowCuts() const
-  { return numberCuts_;}
-  inline OsiRowCut * rowCutPtr(int sequence)
-  { return rowCut_[sequence];}
-  void eraseRowCut(int sequence);
-  // Return 0 if added, 1 if not, -1 if not added because of space
-  int addCutIfNotDuplicate(const OsiRowCut & cut,int whichType=0);
-  // Return 0 if added, 1 if not, -1 if not added because of space
-  int addCutIfNotDuplicateWhenGreedy(const OsiRowCut & cut,int whichType=0);
-  // Add in cuts as normal cuts (and delete)
-  void addCuts(OsiCuts & cs);
-  // Truncate
-  void truncate(int numberAfter);
-private:
-  OsiRowCut2 ** rowCut_;
-  /// Hash table
-  CoinHashLink *hash_;
-  int size_;
-  int hashMultiplier_;
-  int numberCuts_;
-  int lastHash_;
-};
-#endif
-