[gsharp-cvs] CVS gsharp/Doc
rstrandh
rstrandh at common-lisp.net
Sat Jun 30 14:15:26 UTC 2007
Update of /project/gsharp/cvsroot/gsharp/Doc
In directory clnet:/tmp/cvs-serv8726
Modified Files:
accidentals.tex
Log Message:
Fixed some unfortunate choice of wording.
--- /project/gsharp/cvsroot/gsharp/Doc/accidentals.tex 2004/02/16 15:46:22 1.1.1.1
+++ /project/gsharp/cvsroot/gsharp/Doc/accidentals.tex 2007/06/30 14:15:26 1.2
@@ -3,14 +3,14 @@
The rules of Ross essentially boil down to the following:
\begin{itemize}
-\item If there are no suspended notes with accidentals on the right
- side of the stem, place all the accidentals in the order of the
+\item If there are no suspended notes on the right side of the stem
+ that have accidentals, place all the accidentals in the order of the
topmost one that can be placed closest to the stem.
-\item If there are suspended notes with accidentals on the right side
- of the stem (stem is up and there is an interval of a second), start
- by placing the accidental of the topmost suspended note with an
- accidental as close as possible to the stem, then place the other
- notes according to the previous rule.
+\item If there is at least one suspended note on the right side of the
+ stem (stem is up and there is an interval of a second) with an
+ accidental, start by placing the accidental of the topmost suspended
+ note with an accidental as close as possible to the stem, then place
+ the other notes according to the previous rule.
\end{itemize}
To implement this algorithm, we keep a table of smallest distances
More information about the Gsharp-cvs
mailing list