Revision: 52871
http://brlcad.svn.sourceforge.net/brlcad/?rev=52871&view=rev
Author: carlmoore
Date: 2012-10-05 19:50:28 +0000 (Fri, 05 Oct 2012)
Log Message:
-----------
fix spellings and remove a duplicate 'the'
Modified Paths:
--------------
brlcad/trunk/src/librt/primitives/nmg/nmg_inter.c
Modified: brlcad/trunk/src/librt/primitives/nmg/nmg_inter.c
===================================================================
--- brlcad/trunk/src/librt/primitives/nmg/nmg_inter.c 2012-10-05 19:44:09 UTC
(rev 52870)
+++ brlcad/trunk/src/librt/primitives/nmg/nmg_inter.c 2012-10-05 19:50:28 UTC
(rev 52871)
@@ -161,7 +161,7 @@
/* need a self loop */
lu = nmg_mlv(&fu->l.magic, v, OT_BOOLPLACE);
if (rt_g.NMG_debug & DEBUG_POLYSECT)
- bu_log("nmg_make_dualvu is makeing a self_loop (lu=x%x, vu=x%x) for
v=x%x\n", lu, BU_LIST_FIRST(vertexuse, &lu->down_hd), v);
+ bu_log("nmg_make_dualvu is making a self_loop (lu=x%x, vu=x%x) for
v=x%x\n", lu, BU_LIST_FIRST(vertexuse, &lu->down_hd), v);
nmg_loop_g(lu->l_p, tol);
return BU_LIST_FIRST(vertexuse, &lu->down_hd);
}
@@ -184,7 +184,7 @@
*
* While it is true that in most cases the calling routine will know
* which shell the vu came from, it's cheap to re-determine it here.
- * This "all in one" packaging, which handles both lists automaticly
+ * This "all in one" packaging, which handles both lists automatically
* is *vastly* superior to the previous version, which pushed 10-20
* lines of bookkeeping up into *every* place an intersection vu was
* created.
@@ -515,7 +515,7 @@
* (3d) point_t for each "index" item, and subscripts the resulting
* array by the vertices index number.
* Since additional vertices can be created as the intersection process
- * operates, 2*maxindex items are originall allocated, as a (generous)
+ * operates, 2*maxindex items are originally allocated, as a (generous)
* upper bound on the amount of intersecting that might happen.
*
* In the array, the third double of each projected vertex is set to -1 when
@@ -578,7 +578,7 @@
/*
* Rotate so that f1's N vector points up +Z.
- * This places all 2D calcuations in the XY plane.
+ * This places all 2D calculations in the XY plane.
* Translate so that f1's centroid becomes the 2D origin.
* Reasoning: no vertex should be favored by putting it at
* the origin. The "desirable" floating point space in the
@@ -1607,7 +1607,7 @@
/* Intersection is in middle of eu1, which lies on the
* line of intersection being computed, but is outside
* the endpoints of eu2. There is no point in breaking
- * eu1 here -- it does not connnect up with anything.
+ * eu1 here -- it does not connect up with anything.
*/
ret = ISECT_NONE;
goto topo;
@@ -1796,7 +1796,7 @@
}
/*
- * We now know that the the edge does not lie +in+ the other face,
+ * We now know that the edge does not lie +in+ the other face,
* so it will intersect the face in at most one point.
* Before looking at the results of the geometric calculation,
* check the topology. If the topology says that starting vertex
@@ -2919,7 +2919,7 @@
* XXX and then intersect them with the other face.
* XXX loopuses can come and go as loops get cutjoin'ed, but at this
* XXX stage edgeuses are created, but never deleted.
- * XXX This way, the process should converge in 2 interations, rather than N.
+ * XXX This way, the process should converge in 2 iterations, rather than N.
*/
/* For every edge in f1, intersect with f2, incl. cutjoin */
@@ -3206,7 +3206,7 @@
/**
*
- * Given two pointer tables filled with edgeuses representing two differentt
+ * Given two pointer tables filled with edgeuses representing two different
* edge geometry lines, see if there is a common vertex of intersection.
* If so, enlist the intersection.
*
@@ -4609,7 +4609,7 @@
* attempt to get the correct ordering of vertices
* on the intersection list, since using the
* actual distance can get them reversed when
- * a VU is chosen over the actual interection
+ * a VU is chosen over the actual intersection
* point.
*/
nmg_enlist_vu(is, vu1a, 0, dist[0]);
@@ -6686,7 +6686,7 @@
* Check if two faceuses can be intersected normally, by looking at the line
* of intersection and determining if the vertices from each face are all
* above the other face on one side of the intersection line and below it
- * on the other side of the interection line.
+ * on the other side of the intersection line.
*
* return:
* 1 - faceuses meet criteria and can be intersected normally
@@ -6773,7 +6773,7 @@
else
on_left++;
} else {
- /* right of intersction line */
+ /* right of intersection line */
if (dist > tol->dist)
above_right++;
else if (dist < (-tol->dist))
@@ -6829,7 +6829,7 @@
else
on_left++;
} else {
- /* right of intersction line */
+ /* right of intersection line */
if (dist > tol->dist)
above_right++;
else if (dist < (-tol->dist))
@@ -7850,7 +7850,7 @@
if (!nmg_ck_fu_verts(fu2, f1, tol) && !nmg_ck_fu_verts(fu1, f2, tol) &&
NEAR_ZERO(fabs(f1_pl[W] - f2_pl[W]), tol->dist)) {
/* true when fu1 and fu2 are coplanar, i.e. all vertices
- * of faceuse (fu1) are within distance tolarance of
+ * of faceuse (fu1) are within distance tolerance of
* face (f2) and vice-versa.
*/
coplanar = 1;
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
