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

take out };

File:
1 edited

Legend:

Unmodified
Added
Removed
  • 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
Note: See TracChangeset for help on using the changeset viewer.