Revision: 56472
http://sourceforge.net/p/brlcad/code/56472
Author: carlmoore
Date: 2013-08-02 15:12:56 +0000 (Fri, 02 Aug 2013)
Log Message:
-----------
fix spellings and grammar
Modified Paths:
--------------
brlcad/trunk/doc/burst/fb.tbl
brlcad/trunk/doc/docbook/system/mann/en/comb.xml
brlcad/trunk/include/icv.h
brlcad/trunk/src/libbrep/intersect.cpp
brlcad/trunk/src/libged/comb.c
brlcad/trunk/src/libicv/stat.c
Modified: brlcad/trunk/doc/burst/fb.tbl
===================================================================
--- brlcad/trunk/doc/burst/fb.tbl 2013-08-02 15:07:48 UTC (rev 56471)
+++ brlcad/trunk/doc/burst/fb.tbl 2013-08-02 15:12:56 UTC (rev 56472)
@@ -11,5 +11,5 @@
white@255@255@255@shot hit target
lt green@200@255@200@burst occurred but hit no critical components
pink@255@200@200@burst occurred and hit some critical components
-purple@255@0@255@a ground burst occured
+purple@255@0@255@a ground burst occurred
.TE
Modified: brlcad/trunk/doc/docbook/system/mann/en/comb.xml
===================================================================
--- brlcad/trunk/doc/docbook/system/mann/en/comb.xml 2013-08-02 15:07:48 UTC
(rev 56471)
+++ brlcad/trunk/doc/docbook/system/mann/en/comb.xml 2013-08-02 15:12:56 UTC
(rev 56472)
@@ -112,7 +112,7 @@
"Lift" a region flag to the top comb, and clear all region flags
below
the comb in the tree. Like the <option>f</option> option this
option
will work to respect the integrity of other geometry in the
database, but
- it is more agressive in the steps it will take and it will operate
on trees
+ it is more aggressive in the steps it will take and it will
operate on trees
that contain non-union booleans. The decision logic is as
follows:
<orderedlist>
Modified: brlcad/trunk/include/icv.h
===================================================================
--- brlcad/trunk/include/icv.h 2013-08-02 15:07:48 UTC (rev 56471)
+++ brlcad/trunk/include/icv.h 2013-08-02 15:12:56 UTC (rev 56472)
@@ -348,7 +348,7 @@
*
* It forces the image pixels to be in the prescribed range.
*
- * All the pixels higer than the max range are set to MAX (1.0).
+ * All the pixels higher than the max range are set to MAX (1.0).
* All the pixels lower than the min range are set to MIN (0.0).
*
* Note if an image(bif) is sanitized then, (bif->flags&&ICV_SANITIZED)
@@ -359,7 +359,7 @@
/**
* This adds a constant value to all the pixels of the image.
- * Also if the flag ICV_OPERATIONS_MODE is set this doesnt santizes
+ * Also if the flag ICV_OPERATIONS_MODE is set this doesn't sanitize
* the image.
*
* Note to set the flag for a bif (icv_image struct);
@@ -368,15 +368,15 @@
ICV_EXPORT void icv_add_val(icv_image_t* img, double val);
/**
- * This multiplies all the pixels of the image with a contant Value.
- * Also if the flag ICV_OPERATIONS_MODE is set this doesnt santizes
+ * This multiplies all the pixels of the image with a constant Value.
+ * Also if the flag ICV_OPERATIONS_MODE is set this doesn't sanitize
* the image.
*/
ICV_EXPORT void icv_multiply_val(icv_image_t* img, double val);
/**
* This divides all the pixels of the image with a constant Value.
- * Also if the flag ICV_OPERATIONS_MODE is set this doesnt santizes
+ * Also if the flag ICV_OPERATIONS_MODE is set this doesn't sanitize
* the image.
*/
ICV_EXPORT void icv_divide_val(icv_image_t* img, double val);
@@ -384,7 +384,7 @@
/**
* This raises all the pixels of the image to a constant exponential
* power.
- * Also if the flag ICV_OPERATIONS_MODE is set this doesnt santizes
+ * Also if the flag ICV_OPERATIONS_MODE is set this doesn't sanitize
* the image.
*/
ICV_EXPORT void icv_pow_val(icv_image_t* img, double val);
@@ -398,7 +398,7 @@
ICV_EXPORT icv_image_t *icv_add(icv_image_t *img1, icv_image_t *img2);
/**
- * This routine substracts pixel value of one image from pixel value
+ * This routine subtracts pixel value of one image from pixel value
* of other pixel and inserts the result at the same index of the
* output image.
*
@@ -503,7 +503,7 @@
/**
* This function calculates the histogram of different channels
- * seperately.
+ * separately.
*
* @param img Image of which histogram is to found.
* @param n_bins number of bins required.
@@ -519,7 +519,7 @@
* @return a double array of size channels. Each element contains min
* value of the channel.
*
- * For eg. min = icv_min(bif);
+ * e.g. min = icv_min(bif);
* min[0] gives the minimum value of all the pixels in first bin.
* and so on.
*
@@ -532,7 +532,7 @@
* @return a double array of size channels. Each elements contains
* average value of the channel.
*
- * For eg. mean = icv_mean(bif);
+ * e.g. mean = icv_mean(bif);
* mean[0] gives the average value of all the pixels in first channel
* and so on.
*
@@ -545,7 +545,7 @@
* @return a double array of size channels. Each element contains sum
* value of the channel.
*
- * For eg. sum = icv_sum(bif);
+ * e.g. sum = icv_sum(bif);
* sum[0] gives the sum of all the pixels in first channel
* and so on.
*
@@ -558,7 +558,7 @@
* @return a double array of size channels. Each element contains max
* value of the channel.
*
- * For eg. max = icv_max(bif);
+ * e.g. max = icv_max(bif);
* max[0] gives the maximum value of all the pixels in first bin.
* and so on.
*
Modified: brlcad/trunk/src/libbrep/intersect.cpp
===================================================================
--- brlcad/trunk/src/libbrep/intersect.cpp 2013-08-02 15:07:48 UTC (rev
56471)
+++ brlcad/trunk/src/libbrep/intersect.cpp 2013-08-02 15:12:56 UTC (rev
56472)
@@ -38,7 +38,7 @@
/* Sub-division support for a curve.
* It's similar to generating the bounding box tree, when the Split()
- * method is called, the curve is splitted into two parts, whose bounding
+ * method is called, the curve is split into two parts, whose bounding
* boxes become the children of the original curve's bbox.
*/
class Subcurve {
@@ -125,7 +125,7 @@
/* Sub-division support for a surface.
* It's similar to generating the bounding box tree, when the Split()
- * method is called, the surface is splitted into two parts, whose bounding
+ * method is called, the surface is split into two parts, whose bounding
* boxes become the children of the original surface's bbox.
*/
class Subsurface {
@@ -1213,7 +1213,7 @@
// Use two different start points - the two end-points of the
interval
// If they converge to one point, it's considered an intersection
// point, otherwise it's considered an overlap event.
- // FIXME: Find a better machanism to check overlapping, because
this method
+ // FIXME: Find a better mechanism to check overlapping, because
this method
// may miss some overlap cases. (Overlap events can also converge
to one
// point)
double t_a1 = i->first->m_t.Min(), t_b1 = i->second->m_t.Min();
@@ -3106,7 +3106,7 @@
}
if (inside_overlap) {
// We only do this optimization of surfA, because node pairs
- // need both boxes from surfA and surfB, and eliminate one of
+ // need both boxes from surfA and surfB, and eliminating one of
// them is enough.
continue;
}
@@ -3397,7 +3397,7 @@
}
// In some cases, the intersection curves will intersect with each other.
- // But with our merging machanism, one point can only belong to one curve,
+ // But with our merging mechanism, one point can only belong to one curve,
// so if they need to share one intersection point, this cannot work
// properly. So we need some "seaming" segments to make sure the inter-
// section.
Modified: brlcad/trunk/src/libged/comb.c
===================================================================
--- brlcad/trunk/src/libged/comb.c 2013-08-02 15:07:48 UTC (rev 56471)
+++ brlcad/trunk/src/libged/comb.c 2013-08-02 15:12:56 UTC (rev 56472)
@@ -422,7 +422,7 @@
* check for parent node in combs_outside_of_tree
* if problem found, append specifics to ged_result_str, set fail flag
* if no problem found, add to bu_ptbl list of regions to wrap (uniq
insert)
- * no point in storing the speciifc parent, since we'll in-tree mvall in
any case to update */
+ * no point in storing the specific parent, since we'll in-tree mvall in
any case to update */
bu_ptbl_init(®ions_to_clear, 64, "regions to clear");
bu_ptbl_init(®ions_to_wrap, 64, "regions to wrap");
for (BU_LIST_FOR_BACKWARDS(entry, db_full_path_list, &(regions->l))) {
Modified: brlcad/trunk/src/libicv/stat.c
===================================================================
--- brlcad/trunk/src/libicv/stat.c 2013-08-02 15:07:48 UTC (rev 56471)
+++ brlcad/trunk/src/libicv/stat.c 2013-08-02 15:12:56 UTC (rev 56472)
@@ -115,7 +115,7 @@
size_t size;
int i;
- mean = icv_sum(img); /**< recieves sum from icv_image_sum*/
+ mean = icv_sum(img); /**< receives sum from icv_image_sum*/
size = (size_t)img->width*img->height;
for(i=0; i<img->channels; i++)
This was sent by the SourceForge.net collaborative development platform, the
world's largest Open Source development site.
------------------------------------------------------------------------------
Get your SQL database under version control now!
Version control is standard for application code, but databases havent
caught up. So what steps can you take to put your SQL databases under
version control? Why should you start doing it? Read more to find out.
http://pubads.g.doubleclick.net/gampad/clk?id=49501711&iu=/4140/ostg.clktrk
_______________________________________________
BRL-CAD Source Commits mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-commits
