Revision: 41231
          http://brlcad.svn.sourceforge.net/brlcad/?rev=41231&view=rev
Author:   brlcad
Date:     2010-11-02 17:40:24 +0000 (Tue, 02 Nov 2010)

Log Message:
-----------
minor ws consistency

Modified Paths:
--------------
    brlcad/trunk/src/anim/cattrack.c
    brlcad/trunk/src/anim/chan_permute.c

Modified: brlcad/trunk/src/anim/cattrack.c
===================================================================
--- brlcad/trunk/src/anim/cattrack.c    2010-11-02 17:38:11 UTC (rev 41230)
+++ brlcad/trunk/src/anim/cattrack.c    2010-11-02 17:40:24 UTC (rev 41231)
@@ -181,7 +181,7 @@
            break;
        }
     }
-    *pb = p_zero[Z] - cosh( (*pa)*(p_zero[X]-(*pc)) )/(*pa);
+    *pb = p_zero[Z] - cosh((*pa)*(p_zero[X]-(*pc)))/(*pa);
 
     return status;
 
@@ -237,7 +237,7 @@
 
        solved = 0;
        /* refine theta_one */
-       stmp = sinh( (*pa)*(q_zero[X]-(*pc)) );
+       stmp = sinh((*pa)*(q_zero[X]-(*pc)));
        new_theta_zero = atan2(1.0, -stmp);
        avg_theta_zero = 0.5 * (theta_zero + new_theta_zero);
        if (fabs(theta_zero-avg_theta_zero)<T_TOL) {
@@ -246,7 +246,7 @@
        theta_zero = avg_theta_zero;
 
        /* refine theta_two */
-       stmp = sinh( (*pa)*(q_one[X]-(*pc)) );
+       stmp = sinh((*pa)*(q_one[X]-(*pc)));
        new_theta_one = atan2(1.0, -stmp);
        avg_theta_one = 0.5 * (theta_one + new_theta_one);
        if (fabs(theta_one-avg_theta_one)<T_TOL) {

Modified: brlcad/trunk/src/anim/chan_permute.c
===================================================================
--- brlcad/trunk/src/anim/chan_permute.c        2010-11-02 17:38:11 UTC (rev 
41230)
+++ brlcad/trunk/src/anim/chan_permute.c        2010-11-02 17:40:24 UTC (rev 
41231)
@@ -28,7 +28,7 @@
  * tables. Usage:
  *
 
-channel -i infile1 id id id ... [-i infile2 ...] -o outfile1 id id ... [-o 
outfile2 ...]
+ channel -i infile1 id id id ... [-i infile2 ...] -o outfile1 id id ... [-o 
outfile2 ...]
 
  *
  * where infiles are files to be read from, outfiles are files to be
@@ -72,10 +72,10 @@
 
     i=j=icount = ocount = maxlength = 0;
     for (i=1;i<argc;i++) {
-       if ( !strncmp(argv[i], ihead, 2) ) {
+       if (!strncmp(argv[i], ihead, 2)) {
            j=0;
            icount++;
-       } else if ( !strncmp(argv[i], ohead, 2) ) {
+       } else if (!strncmp(argv[i], ohead, 2)) {
            j=0;
            ocount++;
        } else
@@ -85,23 +85,23 @@
     y = (struct unit *) bu_calloc(icount+ocount, sizeof(struct unit), "struct 
unit");
     x = y - 1;
     for (i=1;i<argc;i++) {
-       if ( !strncmp(argv[i], "-", 1) ) {
+       if (!strncmp(argv[i], "-", 1)) {
            j=0;
            x++;
            x->list = (short *) bu_calloc(maxlength, sizeof(short), "short 
array");
            if (argv[i][1] == 'i') {
                i++;
                (x)->i_o = 1;
-               if ( ! strcmp(argv[i], "stdin") )
+               if (! strcmp(argv[i], "stdin"))
                    x->file = stdin;
-               else if ( !(x->file = fopen(argv[i], "rb")) )
+               else if (!(x->file = fopen(argv[i], "rb")))
                    fprintf(stderr, "Channel: can't open %s\n", argv[i]);
            } else if (argv[i][1] == 'o') {
                i++;
                (x)->i_o = 0;
-               if ( ! strcmp(argv[i], "stdout") )
+               if (! strcmp(argv[i], "stdout"))
                    x->file = stdout;
-               else if ( !(x->file = fopen(argv[i], "wb")) )
+               else if (!(x->file = fopen(argv[i], "wb")))
                    fprintf(stderr, "Channel: can't write to %s\n", argv[i]);
            } else {
                fprintf(stderr, "Illegal option %c\n", argv[i][1]);
@@ -114,7 +114,7 @@
     }
     arrayd = (Word *) bu_calloc(argc, sizeof(Word), "Word"); /*may use more 
memory than absolutely necessary*/
     num_done = 0;
-    while (num_done < icount ) {
+    while (num_done < icount) {
        /* go until all in files are done */
        num_done = 0;
        for (x=y;x<y+ocount+icount;x++) {


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

------------------------------------------------------------------------------
Nokia and AT&T present the 2010 Calling All Innovators-North America contest
Create new apps & games for the Nokia N8 for consumers in  U.S. and Canada
$10 million total in prizes - $4M cash, 500 devices, nearly $6M in marketing
Develop with Nokia Qt SDK, Web Runtime, or Java and Publish to Ovi Store 
http://p.sf.net/sfu/nokia-dev2dev
_______________________________________________
BRL-CAD Source Commits mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-commits

Reply via email to