lilypond-0.0.31

diff --git a/hdr/item.hh b/hdr/item.hh
index e934f279f7374a639b8c0d47d34270c5727bb952..a5a9442dc971439c76fc1099433aa18e37fc2c2c 100644 (file)
--- a/hdr/item.hh
+++ b/hdr/item.hh
@@ -16,7 +16,6 @@
   spacing calculation. 
   
 */
-
 struct Item : Staff_elem {
     /// indirection to the column it is in
     PCol * pcol_l_;

diff --git a/hdr/key.hh b/hdr/key.hh
index fa41082fd87b0e0c911f7a8b51d3f8b9217c84af..7a755244a850762f61a17d0b28985f69082748b9 100644 (file)
--- a/hdr/key.hh
+++ b/hdr/key.hh
@@ -1,5 +1,5 @@
 /*
-  key.hh -- part of LilyPond
+  key.hh -- declare Key
 
   (c) 1996,97 Han-Wen Nienhuys
 */
@@ -10,6 +10,7 @@
 #include "varray.hh"
 #include "scalar.hh"
 
+/// administration of current key
 class Key {
     Array<int> accidentals;
 
@@ -24,6 +25,7 @@ public:
     int acc(int i) { return accidentals[i]; }
 };
 
+/// administration of accidentals
 struct Local_key
 {
     void reset(Key);    

diff --git a/hdr/keyitem.hh b/hdr/keyitem.hh
index 1d1d2e37f06ba1eae122d92ac4d927b9fe9fe4d3..b882c9551a15eaf5e8c9230c4399e41b74f8b076 100644 (file)
--- a/hdr/keyitem.hh
+++ b/hdr/keyitem.hh
@@ -12,7 +12,7 @@
 
 struct Clef;
 
-///   An item which places accidentals at the start of the line
+/// An item which places accidentals at the start of the line
 struct Keyitem : Item {
     const char * name() const;
     Array<int> pitch;

diff --git a/hdr/qlp.hh b/hdr/qlp.hh
index 6e82aa9c40fa717135191392102abbaceafff6f8..7bc667b95693f13c66f66982713d196e51f0d560 100644 (file)
--- a/hdr/qlp.hh
+++ b/hdr/qlp.hh
@@ -1,3 +1,11 @@
+/*
+  qlp.hh -- declare Ineq_constrained_qp, Mixed_qp
+
+  source file of the LilyPond music typesetter
+
+  (c) 1997 Han-Wen Nienhuys <hanwen@stack.nl>
+*/
+
 #ifndef QLP_HH
 #define QLP_HH
 
@@ -18,8 +26,8 @@ public:
     /**
       use a KKT method to assert optimality of sol
       */
-     void assert_solution(Vector sol) const;
-  /// solve the problem using a projected gradient method
+    void assert_solution(Vector sol) const;
+    /// solve the problem using a projected gradient method
     Vector solve(Vector start) const;
     
     /** return the number of variables in the problem */
@@ -61,8 +69,6 @@ public:
 
     x^T QUAD x /2 + b^T x 
 */
-
-
 class Mixed_qp :public Ineq_constrained_qp {
     Array<int> eq_cons;
     Array<Real> eq_consrhs;

diff --git a/hdr/qlpsolve.hh b/hdr/qlpsolve.hh
index aefcc767e7d75b3ec53d0205f0a1802c1252c635..811556c362b680a69af431f9d5575f5e4328e41e 100644 (file)
--- a/hdr/qlpsolve.hh
+++ b/hdr/qlpsolve.hh
@@ -1,3 +1,14 @@
+/*
+  qlpsolve.hh -- declare  Active_constraints, Inactive_iter
+
+  source file of the LilyPond music typesetter
+
+  (c) 1997 Han-Wen Nienhuys <hanwen@stack.nl>
+*/
+
+
+#ifndef QLPSOLVE_HH
+#define QLPSOLVE_HH
 #include "qlp.hh"
 #include "matrix.hh"
 
@@ -76,3 +87,5 @@ public:
     Real rhs() const { return ac->rhs(constraint_id()); }
     bool ok() const { return j < ac->inactive.size(); }
 };
+
+#endif // QLPSOLVE_HH