X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=flower%2Finclude%2Ftuple.hh;h=d9f51886253969ad4ba29dc587560ffbd14796ca;hb=47db9a3883d726ca53e2133a3b2298f78dd6a32e;hp=5f2705b8fab12501a9f615114eb7a32cb7b27e09;hpb=f9214bac21e9926dc3248416f58190c98c4167a9;p=lilypond.git

diff --git a/flower/include/tuple.hh b/flower/include/tuple.hh
index 5f2705b8fa..d9f5188625 100644
--- a/flower/include/tuple.hh
+++ b/flower/include/tuple.hh
@@ -1,10 +1,20 @@
 /*
-  tuple.hh -- declare Tuple
+  This file is part of LilyPond, the GNU music typesetter.
 
-  source file of the GNU LilyPond music typesetter
+  Copyright (C) 2006--2015 Han-Wen Nienhuys <hanwen@lilypond.org>
 
-  (c) 2006--2007 Han-Wen Nienhuys <hanwen@lilypond.org>
+  LilyPond is free software: you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation, either version 3 of the License, or
+  (at your option) any later version.
 
+  LilyPond is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
+
+  You should have received a copy of the GNU General Public License
+  along with LilyPond.  If not, see <http://www.gnu.org/licenses/>.
 */
 
 #ifndef TUPLE_HH
@@ -17,7 +27,7 @@ struct Tuple
   Tuple ()
   {
   }
-  
+
   Tuple (T const *src)
   {
     for (int i = 0; i < N; i++)
@@ -32,28 +42,27 @@ struct Tuple2 : public Tuple<K, 2>
   {
 
   }
-  
+
   Tuple2 (K a, K b)
   {
-    Tuple<K,2> *p(this);	//  ugr.
-    
+    Tuple<K, 2> *p (this);       //  ugr.
+
     p->t_array[0] = a;
     p->t_array[1] = b;
   }
 };
 
-  
 template<class T, int N>
 inline bool
-operator<(Tuple<T, N> const &t1,
-	  Tuple<T, N> const &t2)
+operator <(Tuple<T, N> const &t1,
+           Tuple<T, N> const &t2)
 {
-  for (int i = 0; i < N ; i++)
+  for (int i = 0; i < N; i++)
     {
       if (t1.t_array[i] > t2.t_array[i])
-	return false;
+        return false;
       if (t1.t_array[i] < t2.t_array[i])
-	return true;
+        return true;
     }
 
   return false;