Changeset 706 for trunk/Cbc/examples


Ignore:
Timestamp:
Jul 25, 2007 11:54:56 AM (13 years ago)
Author:
forrest
Message:

take out };

Location:
trunk/Cbc/examples
Files:
8 edited

Legend:

Unmodified
Added
Removed
  • trunk/Cbc/examples/CbcBranchFollow2.hpp

    r129 r706  
    5959  /// get and set for maximum rhws (affects cuts as branch)
    6060  inline int maximumRhs() const
    61   { return maximumRhs_;};
     61  { return maximumRhs_;}
    6262  inline void setMaximumRhs(int value)
    63   { maximumRhs_=value;};
     63  { maximumRhs_=value;}
    6464protected:
    6565  /// data
  • trunk/Cbc/examples/CbcBranchLink.hpp

    r640 r706  
    5959  /// Number of members
    6060  inline int numberMembers() const
    61   {return numberMembers_;};
     61  {return numberMembers_;}
    6262
    6363  /// Number of links for each member
    6464  inline int numberLinks() const
    65   {return numberLinks_;};
     65  {return numberLinks_;}
    6666
    6767  /// Which variables
    6868  inline const int * which() const
    69   {return which_;};
     69  {return which_;}
    7070
    7171  /** Array of weights */
    7272  inline const double * weights() const
    73   { return weights_;};
     73  { return weights_;}
    7474
    7575private:
  • trunk/Cbc/examples/CbcCompareUser.hpp

    r180 r706  
    4949  */
    5050  inline double getWeight() const
    51   { return weight_;};
     51  { return weight_;}
    5252  inline void setWeight(double weight)
    53   { weight_ = weight;};
     53  { weight_ = weight;}
    5454protected:
    5555  // Weight for each infeasibility
  • trunk/Cbc/examples/CbcSolver2.hpp

    r83 r706  
    5959  /// get which ones have been used
    6060  inline const int * when() const
    61   { return node_;};
     61  { return node_;}
    6262  /// Get memory (i.e. how recent use should be)
    6363  inline int getMemory() const
    64   { return memory_;};
     64  { return memory_;}
    6565  /// Get current count
    6666  inline int getCount() const
    67   { return count_;};
     67  { return count_;}
    6868  /// Set memory (i.e. how recent use should be)
    6969  inline void setMemory(int value)
    70   { memory_=value;};
     70  { memory_=value;}
    7171  /// Say whether to just count usage
    7272  inline void setAlgorithm(int value)
    73   { algorithm_=value;};
     73  { algorithm_=value;}
    7474  /// Say whether to just count usage
    7575  inline int getAlgorithm() const
    76   { return algorithm_;};
     76  { return algorithm_;}
    7777  /// Strategy
    7878  inline void setStrategy(int value)
    79   { strategy_=value;};
     79  { strategy_=value;}
    8080  /// Strategy
    8181  inline int getStrategy() const
    82   { return strategy_;};
     82  { return strategy_;}
    8383  //@}
    8484
  • trunk/Cbc/examples/CbcSolver3.hpp

    r123 r706  
    5555  /// get which ones have been used
    5656  inline const int * when() const
    57   { return node_;};
     57  { return node_;}
    5858  /// Get memory (i.e. how recent use should be)
    5959  inline int getMemory() const
    60   { return memory_;};
     60  { return memory_;}
    6161  /// Get current count
    6262  inline int getCount() const
    63   { return count_;};
     63  { return count_;}
    6464  /// Set memory (i.e. how recent use should be)
    6565  inline void setMemory(int value)
    66   { memory_=value;};
     66  { memory_=value;}
    6767  /// Say whether to believe infeasible
    6868  inline void setBelieveInfeasible(bool yesNo)
    69   { believeInfeasible_=yesNo;};
     69  { believeInfeasible_=yesNo;}
    7070  /// Say whether to just count usage
    7171  inline void setAlgorithm(int value)
    72   { algorithm_=value;};
     72  { algorithm_=value;}
    7373  /// Do nested search if this fraction fixed
    7474  inline void setNested(double value)
    75   { nestedSearch_=value;};
     75  { nestedSearch_=value;}
    7676  /// Say whether to just count usage
    7777  inline int getAlgorithm() const
    78   { return algorithm_;};
     78  { return algorithm_;}
    7979  /// Do nested search if this fraction fixed
    8080  inline double getNested() const
    81   { return nestedSearch_;};
     81  { return nestedSearch_;}
    8282  //@}
    8383
  • trunk/Cbc/examples/CbcSolverLongThin.hpp

    r124 r706  
    5555  /// get which ones have been used
    5656  inline const int * when() const
    57   { return node_;};
     57  { return node_;}
    5858  /// Get memory (i.e. how recent use should be)
    5959  inline int getMemory() const
    60   { return memory_;};
     60  { return memory_;}
    6161  /// Get current count
    6262  inline int getCount() const
    63   { return count_;};
     63  { return count_;}
    6464  /// Set memory (i.e. how recent use should be)
    6565  inline void setMemory(int value)
    66   { memory_=value;};
     66  { memory_=value;}
    6767  /// Say whether to believe infeasible
    6868  inline void setBelieveInfeasible(bool yesNo)
    69   { believeInfeasible_=yesNo;};
     69  { believeInfeasible_=yesNo;}
    7070  /// Say whether to just count usage
    7171  inline void setAlgorithm(int value)
    72   { algorithm_=value;};
     72  { algorithm_=value;}
    7373  /// Do nested search if this fraction fixed
    7474  inline void setNested(double value)
    75   { nestedSearch_=value;};
     75  { nestedSearch_=value;}
    7676  /// Say whether to just count usage
    7777  inline int getAlgorithm() const
    78   { return algorithm_;};
     78  { return algorithm_;}
    7979  /// Do nested search if this fraction fixed
    8080  inline double getNested() const
    81   { return nestedSearch_;};
     81  { return nestedSearch_;}
    8282  //@}
    8383
  • trunk/Cbc/examples/Makefile.in

    r640 r706  
    2323        CbcSolver2.@OBJEXT@ \
    2424        CbcSolver3.@OBJEXT@ \
    25         CbcSolverLink.@OBJEXT@ \
    26         ClpDynamicInterface.@OBJEXT@ \
    2725        ClpQuadInterface.@OBJEXT@ \
    28         CoinWarmStartBasisDynamic.@OBJEXT@ \
    2926        CbcBranchFollow2.@OBJEXT@ \
    30         CbcBranchLotsizeSimple.@OBJEXT@ \
    3127        CbcBranchUser.@OBJEXT@ \
    3228        CbcBranchLink.@OBJEXT@
  • trunk/Cbc/examples/qmip2.cpp

    r640 r706  
    3030public:
    3131  // Default Constructor
    32   CbcFeasibilityNoStrong () {};
    33 
    34   virtual ~CbcFeasibilityNoStrong() {};
     32  CbcFeasibilityNoStrong () {}
     33
     34  virtual ~CbcFeasibilityNoStrong() {}
    3535  // Copy constructor
    36   CbcFeasibilityNoStrong ( const CbcFeasibilityNoStrong &rhs) {};
     36  CbcFeasibilityNoStrong ( const CbcFeasibilityNoStrong &rhs) {}
    3737   
    3838  // Assignment operator
    3939  CbcFeasibilityNoStrong & operator=( const CbcFeasibilityNoStrong& rhs)
    40   { return * this;};
     40  { return * this;}
    4141
    4242  /// Clone
    4343  virtual CbcFeasibilityBase * clone() const
    44   { return new CbcFeasibilityNoStrong();};
     44  { return new CbcFeasibilityNoStrong();}
    4545
    4646  /**
     
    5454  */
    5555  virtual int feasible(CbcModel * model, int mode)
    56   {return mode;};
     56  {return mode;}
    5757};
    5858
Note: See TracChangeset for help on using the changeset viewer.