Changeset 1286 for branches/sandbox/Cbc/src/CbcStatistics.hpp
 Timestamp:
 Nov 9, 2009 6:33:07 PM (10 years ago)
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

branches/sandbox/Cbc/src/CbcStatistics.hpp
r1271 r1286 11 11 class CbcStatistics { 12 12 public: 13 // Default Constructor14 CbcStatistics ();15 // Branch16 CbcStatistics(CbcNode * node, CbcModel * model);13 // Default Constructor 14 CbcStatistics (); 15 // Branch 16 CbcStatistics(CbcNode * node, CbcModel * model); 17 17 18 ~CbcStatistics(); 19 // Copy 20 CbcStatistics(const CbcStatistics & rhs); 21 // Assignment 22 CbcStatistics& operator=(const CbcStatistics & rhs); 23 // Update at end of branch 24 void endOfBranch(int numberIterations, double objectiveValue); 25 // Update number of infeasibilities 26 void updateInfeasibility(int numberInfeasibilities); 27 // Branch found to be infeasible by chooseBranch 28 void sayInfeasible(); 29 // Just prints 30 void print(const int * sequenceLookup=NULL) const; 31 // Node number 32 inline int node() const 33 { return id_;} 34 // Parent node number 35 inline int parentNode() const 36 { return parentId_;} 37 // depth 38 inline int depth() const 39 { return depth_;} 40 // way 41 inline int way() const 42 { return way_;} 43 // value 44 inline double value() const 45 { return value_;} 46 // starting objective 47 inline double startingObjective() const 48 { return startingObjective_;} 49 // Unsatisfied at beginning 50 inline int startingInfeasibility() const 51 { return startingInfeasibility_;} 52 // starting objective 53 inline double endingObjective() const 54 { return endingObjective_;} 55 // Unsatisfied at end 56 inline int endingInfeasibility() const 57 { return endingInfeasibility_;} 58 // Number iterations 59 inline int numberIterations() const 60 { return numberIterations_;} 18 ~CbcStatistics(); 19 // Copy 20 CbcStatistics(const CbcStatistics & rhs); 21 // Assignment 22 CbcStatistics& operator=(const CbcStatistics & rhs); 23 // Update at end of branch 24 void endOfBranch(int numberIterations, double objectiveValue); 25 // Update number of infeasibilities 26 void updateInfeasibility(int numberInfeasibilities); 27 // Branch found to be infeasible by chooseBranch 28 void sayInfeasible(); 29 // Just prints 30 void print(const int * sequenceLookup = NULL) const; 31 // Node number 32 inline int node() const { 33 return id_; 34 } 35 // Parent node number 36 inline int parentNode() const { 37 return parentId_; 38 } 39 // depth 40 inline int depth() const { 41 return depth_; 42 } 43 // way 44 inline int way() const { 45 return way_; 46 } 47 // value 48 inline double value() const { 49 return value_; 50 } 51 // starting objective 52 inline double startingObjective() const { 53 return startingObjective_; 54 } 55 // Unsatisfied at beginning 56 inline int startingInfeasibility() const { 57 return startingInfeasibility_; 58 } 59 // starting objective 60 inline double endingObjective() const { 61 return endingObjective_; 62 } 63 // Unsatisfied at end 64 inline int endingInfeasibility() const { 65 return endingInfeasibility_; 66 } 67 // Number iterations 68 inline int numberIterations() const { 69 return numberIterations_; 70 } 61 71 62 72 protected: 63 // Data64 /// Value65 double value_;66 /// Starting objective67 double startingObjective_;68 /// Ending objective69 double endingObjective_;70 /// id71 int id_;72 /// parent id73 int parentId_;74 /// way 1 or +1 is first branch 10 or +10 is second branch75 int way_;76 /// sequence number branched on77 int sequence_;78 /// depth79 int depth_;80 /// starting number of integer infeasibilities81 int startingInfeasibility_;82 /// ending number of integer infeasibilities83 int endingInfeasibility_;84 /// number of iterations85 int numberIterations_;73 // Data 74 /// Value 75 double value_; 76 /// Starting objective 77 double startingObjective_; 78 /// Ending objective 79 double endingObjective_; 80 /// id 81 int id_; 82 /// parent id 83 int parentId_; 84 /// way 1 or +1 is first branch 10 or +10 is second branch 85 int way_; 86 /// sequence number branched on 87 int sequence_; 88 /// depth 89 int depth_; 90 /// starting number of integer infeasibilities 91 int startingInfeasibility_; 92 /// ending number of integer infeasibilities 93 int endingInfeasibility_; 94 /// number of iterations 95 int numberIterations_; 86 96 }; 87 97
Note: See TracChangeset
for help on using the changeset viewer.