SF.net SVN: jazzplusplus:[746] trunk/jazz/src

[<pst...@us...>]

Revision: 746
          http://jazzplusplus.svn.sourceforge.net/jazzplusplus/?rev=746&view=rev
Author:   pstieber
Date:     2010-04-25 03:08:56 +0000 (Sun, 25 Apr 2010)

Log Message:
-----------
Made cosmetic changes.

Modified Paths:
--------------
    trunk/jazz/src/Sample.cpp
    trunk/jazz/src/SampleCommand.cpp

Modified: trunk/jazz/src/Sample.cpp
===================================================================
--- trunk/jazz/src/Sample.cpp	2010-04-25 03:06:57 UTC (rev 745)
+++ trunk/jazz/src/Sample.cpp	2010-04-25 03:08:56 UTC (rev 746)
@@ -846,11 +846,13 @@
 {
   int j;
   float wmax, xmax = 0;
-  for(j = 0; j < length; j++) {
+  for (j = 0; j < length; j++)
+  {
     if ((wmax = (float)fabs(data[j])) > xmax)
       xmax = wmax;
   }
-  for(j = 0; j < length; j++) {
+  for (j = 0; j < length; j++)
+  {
     data[j] /= xmax;
   }
 }
@@ -886,14 +888,16 @@
   int j,k,l,i = 0;
 
   amp2 = pvals[0];
-  for(k = 1; k < nargs; k += 2) {
+  for (k = 1; k < nargs; k += 2)
+  {
     amp1 = amp2;
     amp2 = pvals[k+1];
     j = i + 1;
     data[i] = amp1;
     c = (float) pow((amp2/amp1),(1./ pvals[k]));
     i = (j - 1) + pvals[k];
-    for(l = j; l < i; l++) {
+    for (l = j; l < i; l++)
+    {
       if (l < size)
         data[l] = data[l-1] * c;
     }

Modified: trunk/jazz/src/SampleCommand.cpp
===================================================================
--- trunk/jazz/src/SampleCommand.cpp	2010-04-25 03:06:57 UTC (rev 745)
+++ trunk/jazz/src/SampleCommand.cpp	2010-04-25 03:08:56 UTC (rev 746)
@@ -141,7 +141,7 @@
 {
   int i;
   resetval = 1000;
-  for(i=0; i<SIZE; i++)
+  for (i = 0; i < SIZE; i++)
     array[i] = 1;
   lineset = 0;
 }
@@ -181,7 +181,7 @@
   int i,j,k,points;
 
   increm = (double)(p[n_args - 2] - p[0])/(double)length;
-  for(j=0,i=0; j < (n_args-2); j += 2)
+  for (j = 0, i = 0; j < (n_args - 2); j += 2)
     {
       points = (int)((double)(p[j+2] - p[j]) / increm +.5);
       if (p[j+2] != p[j])
@@ -406,8 +406,8 @@
   chans = sout.GetChannels();
   inchan = (int)p[6];
   j = 0;
-  for(i = 0; i < nsamps; i++) {
-
+  for (i = 0; i < nsamps; i++)i
+  {
     j = (j+1) % reinit;
     k = (k+1) % reinit;
 


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.