Revision: 52870
http://brlcad.svn.sourceforge.net/brlcad/?rev=52870&view=rev
Author: carlmoore
Date: 2012-10-05 19:44:09 +0000 (Fri, 05 Oct 2012)
Log Message:
-----------
remove duplicate 'the' and fix spellings
Modified Paths:
--------------
brlcad/trunk/src/librt/primitives/nmg/nmg_mk.c
Modified: brlcad/trunk/src/librt/primitives/nmg/nmg_mk.c
===================================================================
--- brlcad/trunk/src/librt/primitives/nmg/nmg_mk.c 2012-10-05 19:35:36 UTC
(rev 52869)
+++ brlcad/trunk/src/librt/primitives/nmg/nmg_mk.c 2012-10-05 19:44:09 UTC
(rev 52870)
@@ -166,7 +166,7 @@
* case of the cube, there are 4 edgeuses per edge).
* 48 vertexuse structures.
* Each vertexuse structure references one vertex structure
- * and is in turn enroled as a member of the linked list
+ * and is in turn enrolled as a member of the linked list
* headed by that vertex structure.
* Each vertexuse is cited by exactly one edgeuse.
* Also, "up" references the parent object (edgeuse, here).
@@ -239,7 +239,7 @@
* N.B.:
*
* "maxindex" is a misnomer. It is the value of the NEXT index
- * assigned. This allows "ptab"s to be allocated easly using maxindex
+ * assigned. This allows "ptab"s to be allocated easily using maxindex
* and the index value of the structures to be the actual index into
* the "ptab".
*/
@@ -585,7 +585,7 @@
* or
* lu = BU_LIST_FIRST(loopuse, &s->lu_hd);
*
- * N.B. This function is made more complex than warrented by using
+ * N.B. This function is made more complex than warranted by using
* the "hack" of stealing a vertexuse structure from the shell if at
* all possible. A future enhancement to this function would be to
* remove the vertexuse steal and have the caller pass in the vertex
@@ -790,7 +790,7 @@
eu2->vu_p = nmg_mvvu(&eu2->l.magic, m);
}
- /* This if statment dies when no vertex stealing */
+ /* This if statement dies when no vertex stealing */
if (s->vu_p) {
/* Ensure shell no longer has any stored vertexuse */
(void)nmg_kvu(s->vu_p);
@@ -1038,7 +1038,7 @@
p1->up.lu_p = lu1;
p2->up.lu_p = lu2;
- /* If p2's vertex does not match next one comming, quit */
+ /* If p2's vertex does not match next one coming, quit */
if (BU_LIST_IS_EMPTY(&s->eu_hd)) break;
p1 = BU_LIST_FIRST(edgeuse, &s->eu_hd);
NMG_CK_EDGEUSE(p1);
@@ -1104,7 +1104,7 @@
*
* Kill vertexuse, and null out parent's vu_p.
*
- * This routine is not intented for general use by applications,
+ * This routine is not intended for general use by applications,
* because it requires cooperation on the part of the caller to
* properly dispose of or fix the now *quite* illegal parent.
* (Illegal because the parent's vu_p is NULL). It exists primarily
@@ -2384,7 +2384,7 @@
/* dequeue this face from fg's face list */
BU_LIST_DEQUEUE(&f->l);
- /* get a new geometry sructure */
+ /* get a new geometry structure */
m = nmg_find_model(&fu->l.magic);
GET_FACE_G_PLANE(f->g.plane_p, m);
f->flip = 0;
@@ -2515,9 +2515,9 @@
}
/* Note, calculating the bounding box for face_g_snurbs
- * from the extents of the the loop does not work
+ * from the extents of the loop does not work
* since the loops are most likely in parametric space
- * thus we need to calcualte the bounding box for the
+ * thus we need to calculate the bounding box for the
* face_g_snurb here instead. There may be a more efficient
* way, and one may need some time to take a good look at
* this
@@ -2742,7 +2742,7 @@
/**
* n m g _ d e m o t e _ e u
*
- * Demote a wire edge into a pair of self-loop verticies
+ * Demote a wire edge into a pair of self-loop vertices
*
*
* Returns -
@@ -2875,7 +2875,7 @@
eudst->vu_p->v_p == eusrc_mate->vu_p->v_p) ||
(eudst->vu_p->v_p == eusrc->vu_p->v_p &&
eudst_mate->vu_p->v_p == eusrc_mate->vu_p->v_p))) {
- /* edgeuses do NOT share verticies. */
+ /* edgeuses do NOT share vertices. */
bu_log("eusrc (v=0x%p) (%g %g %g)\n", eusrc->vu_p->v_p,
V3ARGS(eusrc->vu_p->v_p->vg_p->coord));
bu_log("eusrc_mate (v=0x%p) (%g %g %g)\n", eusrc_mate->vu_p->v_p,
V3ARGS(eusrc_mate->vu_p->v_p->vg_p->coord));
bu_log("eudst (v=0x%p) (%g %g %g)\n", eudst->vu_p->v_p,
V3ARGS(eudst->vu_p->v_p->vg_p->coord));
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
