X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=flower%2Finclude%2Ftuple.hh;h=d9f51886253969ad4ba29dc587560ffbd14796ca;hb=47db9a3883d726ca53e2133a3b2298f78dd6a32e;hp=1f8b0b28fb61fc2886f119d06fae6d0f753bfb61;hpb=1c846b2c2348b4e0ca4a3c2e8fb267047ba2d203;p=lilypond.git diff --git a/flower/include/tuple.hh b/flower/include/tuple.hh index 1f8b0b28fb..d9f5188625 100644 --- a/flower/include/tuple.hh +++ b/flower/include/tuple.hh @@ -1,7 +1,7 @@ /* This file is part of LilyPond, the GNU music typesetter. - Copyright (C) 2006--2011 Han-Wen Nienhuys + Copyright (C) 2006--2015 Han-Wen Nienhuys LilyPond is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -27,7 +27,7 @@ struct Tuple Tuple () { } - + Tuple (T const *src) { for (int i = 0; i < N; i++) @@ -42,28 +42,27 @@ struct Tuple2 : public Tuple { } - + Tuple2 (K a, K b) { - Tuple *p(this); // ugr. - + Tuple *p (this); // ugr. + p->t_array[0] = a; p->t_array[1] = b; } }; - template inline bool -operator<(Tuple const &t1, - Tuple const &t2) +operator <(Tuple const &t1, + Tuple 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;