Revision: 52836
          http://brlcad.svn.sourceforge.net/brlcad/?rev=52836&view=rev
Author:   carlmoore
Date:     2012-10-05 13:34:37 +0000 (Fri, 05 Oct 2012)
Log Message:
-----------
fix spellings and change ie to i.e.

Modified Paths:
--------------
    brlcad/trunk/src/librt/shoot.c

Modified: brlcad/trunk/src/librt/shoot.c
===================================================================
--- brlcad/trunk/src/librt/shoot.c      2012-10-05 13:32:06 UTC (rev 52835)
+++ brlcad/trunk/src/librt/shoot.c      2012-10-05 13:34:37 UTC (rev 52836)
@@ -896,7 +896,7 @@
  *
  * Formal Return: whatever the application function returns (an int).
  *
- * NOTE:  The appliction functions may call rt_shootray() recursively.
+ * NOTE:  The application functions may call rt_shootray() recursively.
  * Thus, none of the local variables may be static.
  *
  * To prevent having to lock the statistics variables in a PARALLEL
@@ -1132,7 +1132,7 @@
 
     /*
      * The interesting part of the ray starts at distance 0.  If the
-     * ray enters the model at a negative distance, (ie, the ray
+     * ray enters the model at a negative distance, (i.e., the ray
      * starts within the model RPP), we only look at little bit behind
      * (BACKING_DIST) to see if we are just coming out of something,
      * but never further back than the intersection with the model
@@ -1240,7 +1240,7 @@
      * While the ray remains inside model space, push from box to box
      * until ray emerges from model space again (or first hit is
      * found, if user is impatient).  It is vitally important to
-     * always stay within the model RPP, or the space partitoning tree
+     * always stay within the model RPP, or the space partitioning tree
      * will pick wrong boxes & miss them.
      */
     while ((cutp = rt_advance_to_next_cell(&ss)) != CUTTER_NULL) {
@@ -1429,7 +1429,7 @@
         *
         * If a_onehit != 0, then it indicates how many hit points
         * (which are greater than the ray start point of 0.0) the
-        * application requires, ie, partitions with inhit >= 0.  (If
+        * application requires, i.e., partitions with inhit >= 0.  (If
         * negative, indicates number of non-air hits needed).  If
         * this box yielded additional segments, immediately weave
         * them into the partition list, and perform final boolean
@@ -1775,7 +1775,7 @@
 
     /*
      * The interesting part of the ray starts at distance 0.  If the
-     * ray enters the model at a negative distance, (ie, the ray
+     * ray enters the model at a negative distance, (i.e., the ray
      * starts within the model RPP), we only look at little bit behind
      * (BACKING_DIST) to see if we are just coming out of something,
      * but never further back than the intersection with the model
@@ -1825,7 +1825,7 @@
      * While the ray remains inside model space, push from box to box
      * until ray emerges from model space again (or first hit is
      * found, if user is impatient).  It is vitally important to
-     * always stay within the model RPP, or the space partitoning tree
+     * always stay within the model RPP, or the space partitioning tree
      * will pick wrong boxes & miss them.
      */
     while ((cutp = rt_advance_to_next_cell(&ss)) != CUTTER_NULL) {

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


------------------------------------------------------------------------------
Don't let slow site performance ruin your business. Deploy New Relic APM
Deploy New Relic app performance management and know exactly
what is happening inside your Ruby, Python, PHP, Java, and .NET app
Try New Relic at no cost today and get our sweet Data Nerd shirt too!
http://p.sf.net/sfu/newrelic-dev2dev
_______________________________________________
BRL-CAD Source Commits mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-commits

Reply via email to