Run grand replace for 2015.

[lilypond.git] / lily / simple-spacer-scheme.cc

diff --git a/lily/simple-spacer-scheme.cc b/lily/simple-spacer-scheme.cc
index 3df7d2f7dddb41c60ce1a4d501f44ff6d36c93b3..cc09da1021ac35fd96256c383df4a09345e611e5 100644 (file)
--- a/lily/simple-spacer-scheme.cc
+++ b/lily/simple-spacer-scheme.cc
@@ -1,7 +1,7 @@
 /*
   This file is part of LilyPond, the GNU music typesetter.
 
-  Copyright (C) 2005--2011 Han-Wen Nienhuys <hanwen@xs4all.nl>
+  Copyright (C) 2005--2015 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
@@ -25,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;