Revision: 52852
http://brlcad.svn.sourceforge.net/brlcad/?rev=52852&view=rev
Author: carlmoore
Date: 2012-10-05 18:49:04 +0000 (Fri, 05 Oct 2012)
Log Message:
-----------
fix (mostly spellings)
Modified Paths:
--------------
brlcad/trunk/src/librt/primitives/bspline/nurb_solve.c
Modified: brlcad/trunk/src/librt/primitives/bspline/nurb_solve.c
===================================================================
--- brlcad/trunk/src/librt/primitives/bspline/nurb_solve.c 2012-10-05
18:47:40 UTC (rev 52851)
+++ brlcad/trunk/src/librt/primitives/bspline/nurb_solve.c 2012-10-05
18:49:04 UTC (rev 52852)
@@ -24,7 +24,7 @@
* Decompose a matrix into its LU decomposition using pivoting.
*
* These Procedures take a set of matrices of the form Ax = b and
- * alows one to solve the system by various means. The
+ * allows one to solve the system by various means. The
* rt_nurb_doolittle routine takes the system and creates a lu
* decomposition using pivoting to get the system in a desired
* form. Forward and backward substitution are then used to solve the
@@ -61,7 +61,7 @@
/* dimension of the matrix */
- /* Number of coordsinates for mat_2 and solution */
+ /* Number of coordinates for mat_2 and solution */
{
register int i, k;
fastf_t *y;
@@ -77,7 +77,7 @@
s = (fastf_t *) bu_malloc(sizeof (fastf_t) * dim,
"rt_nurb_solve: s");/* Create temp array */
- rt_nurb_doolittle (mat_1, mat_2, dim, coords);/* Create LU decomosition */
+ rt_nurb_doolittle (mat_1, mat_2, dim, coords);/* Create LU decomposition */
for (k =0; k < coords; k++) {
fastf_t * ptr;
@@ -110,7 +110,7 @@
/**
- * Create LU decomosition.
+ * Create LU decomposition.
* Modifies both mat_1 and mat_2 values.
*/
void
@@ -134,7 +134,7 @@
s = (fastf_t *) bu_malloc(sizeof (fastf_t) * row * row,
"rt_nurb_doolittle:s"); /* vector to check */
ds = (fastf_t *) bu_malloc(sizeof (fastf_t) * row,
- "rt_nurb_doolittle:ds"); /* if rows need to be
swaped */
+ "rt_nurb_doolittle:ds"); /* if rows need to be
swapped */
for (i = 0; i < row; i++) {
/* calculate the scaling factors */
@@ -158,7 +158,7 @@
for (i = k; i < row; i ++) {
/* check to see if rows need */
- /* to be swaped */
+ /* to be swapped */
ds[i] = d[i] * s[ i * row + k];
if (ds[max_pivot] < ds[i])
max_pivot = i;
@@ -205,7 +205,7 @@
void
-rt_nurb_forw_solve(const fastf_t *lu, const fastf_t *b, fastf_t *y, int n)
/* spl_solve lower trianglular matrix */
+rt_nurb_forw_solve(const fastf_t *lu, const fastf_t *b, fastf_t *y, int n)
/* spl_solve lower triangular matrix */
{
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
