X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;ds=inline;f=lily%2Finclude%2Fqlpsolve.hh;h=9a342527eec657ea47f33a56af1c6b29988b4aac;hb=bb446de35e2d24c7f6f15425a76b433cb71a4a1d;hp=db985df6c54a83e28ad0bf18f2d66b3a759de3dc;hpb=63c9cee8ce190aaae4a5db3d2e200d35a570838d;p=lilypond.git

diff --git a/lily/include/qlpsolve.hh b/lily/include/qlpsolve.hh
index db985df6c5..9a342527ee 100644
--- a/lily/include/qlpsolve.hh
+++ b/lily/include/qlpsolve.hh
@@ -3,7 +3,7 @@
 
   source file of the GNU LilyPond music typesetter
 
-  (c) 1997 Han-Wen Nienhuys <hanwen@stack.nl>
+  (c)  1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
 */
 
 
@@ -35,6 +35,10 @@ class Active_constraints {
   Ineq_constrained_qp const *opt;
 
 public:
+  
+  /** This counts the number of errors the algorithms makes.  The
+      optimum search should be abandoned if it becomes too high.  */
+  int degenerate_count_i_;
   String status() const;
     
   Vector vec (int k) const { return opt->cons_[k]; }
@@ -45,17 +49,17 @@ public:
     constraint in #active#
     
     */
-  void drop (int k);
+  void drop_constraint (int k);
     
 
   /** add constraint j.
     add constraint j to the active set j is the index of the
     constraint in #inactive#   
     */
-  void add (int j);
+  void add_constraint (int j);
 
   /// exchange in and out.
-  void exchange (int in, int out) { add (in); drop (out); }
+  void exchange (int in, int out) { add_constraint (in); drop_constraint (out); }
     
 
   Vector find_active_optimum (Vector g);