X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=lily%2Fsimple-spacer-scheme.cc;h=fe14925be8fc7d0c9c0d3104f4717fac53212b38;hb=9e781b7dc83b60a543ce218aa1a5f139f74c760f;hp=48f127bfca5ae710b5778c73b343e6d08e994839;hpb=b80683cc94b0c22bbe3fccb94a9b2e23787fd10b;p=lilypond.git

diff --git a/lily/simple-spacer-scheme.cc b/lily/simple-spacer-scheme.cc
index 48f127bfca..fe14925be8 100644
--- a/lily/simple-spacer-scheme.cc
+++ b/lily/simple-spacer-scheme.cc
@@ -1,9 +1,20 @@
 /*
-  simple-spacer-scheme.cc -- implement Simple_spacer
+  This file is part of LilyPond, the GNU music typesetter.
 
-  source file of the GNU LilyPond music typesetter
+  Copyright (C) 2005--2014 Han-Wen Nienhuys <hanwen@xs4all.nl>
 
-  (c) 2005--2007 Han-Wen Nienhuys <hanwen@xs4all.nl>
+  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/>.
 */
 
 #include <cstdio>
@@ -14,27 +25,27 @@
 #include "simple-spacer.hh"
 
 LY_DEFINE (ly_solve_spring_rod_problem, "ly:solve-spring-rod-problem",
-	   4, 1, 0, (SCM springs, SCM rods, SCM length, SCM ragged),
-	   "Solve a spring and rod problem for @var{count} objects, that"
-	   " are connected by @var{count}-1 @var{springs}, and an arbitrary"
-	   " number of @var{rods}.  @var{count} is implicitly given by"
-	   " @var{springs} and @var{rods}.  The @var{springs} argument has"
-	   " the format @code{(ideal, inverse_hook)} and @var{rods} is of"
-	   " the form @code{(idx1, idx2, distance)}.\n"
-	   "\n"
-	   "@var{length} is a number, @var{ragged} a boolean.\n"
-	   "\n"
-	   "The function returns a list containing the force (positive for"
-	   " stretching, negative for compressing and @code{#f} for"
-	   " non-satisfied constraints) followed by @var{spring-count}+1"
-	   " positions of the objects.")
+           4, 1, 0, (SCM springs, SCM rods, SCM length, SCM ragged),
+           "Solve a spring and rod problem for @var{count} objects, that"
+           " are connected by @var{count}-1 @var{springs}, and an arbitrary"
+           " number of @var{rods}.  @var{count} is implicitly given by"
+           " @var{springs} and @var{rods}.  The @var{springs} argument has"
+           " the format @code{(ideal, inverse_hook)} and @var{rods} is of"
+           " the form @code{(idx1, idx2, distance)}.\n"
+           "\n"
+           "@var{length} is a number, @var{ragged} a boolean.\n"
+           "\n"
+           "The function returns a list containing the force (positive for"
+           " stretching, negative for compressing and @code{#f} for"
+           " non-satisfied constraints) followed by @var{spring-count}+1"
+           " positions of the objects.")
 {
   int len = scm_ilength (springs);
   if (len == 0)
     return scm_list_2 (scm_from_double (0.0), scm_from_double (0.0));
 
   SCM_ASSERT_TYPE (len >= 0, springs, SCM_ARG1, __FUNCTION__, "list of springs");
-  SCM_ASSERT_TYPE (scm_ilength (rods)  > 0, rods, SCM_ARG1, __FUNCTION__, "list of rods");
+  SCM_ASSERT_TYPE (scm_ilength (rods) > 0, rods, SCM_ARG1, __FUNCTION__, "list of rods");
   LY_ASSERT_TYPE (scm_is_number, length, 3);
 
   bool is_ragged = ragged == SCM_BOOL_T;