Changeset 12339 for branches/rel-1_0/psLib/src/math/psPolynomial.c

Timestamp:

Mar 8, 2007, 1:23:43 PM (19 years ago)

Author:

rhl

Message:

Added psPolynomial[1-4]DNterm()

File:

• branches/rel-1_0/psLib/src/math/psPolynomial.c (modified) (2 diffs)

branches/rel-1_0/psLib/src/math/psPolynomial.c

@@ -7 +7 @@
 *  polynomials.  It also contains a Gaussian functions.
 *
-*  @version $Revision: 1.157 $ $Name: not supported by cvs2svn $
-*  @date $Date: 2007-01-09 22:38:53 $
+*  @version $Revision: 1.157.2.1 $ $Name: not supported by cvs2svn $
+*  @date $Date: 2007-03-08 23:23:43 $
 *
 *  Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii
@@ -823 +823 @@
 }
 
+/************************************************************************************************************/
+/*
+ * Return the number of active terms in a polynomial
+ */
+int psPolynomial1DNterm(const psPolynomial1D *poly)
+{
+    PS_ASSERT_POLY_NON_NULL(poly, 0);
+
+    int nterm = 0;
+    for (int i = 0; i <= poly->nX; i++) {
+        if (poly->mask[i] == 0) {
+            nterm++;
+        }
+    }
+
+    return nterm;
+}
+
+int psPolynomial2DNterm(const psPolynomial2D *poly)
+{
+    PS_ASSERT_POLY_NON_NULL(poly, 0);
+
+    int nterm = 0;
+    for (int i = 0; i <= poly->nX; i++) {
+        for (int j = 0; j <= poly->nY; j++) {
+            if (poly->mask[j][i] == 0) {
+                nterm++;
+            }
+        }
+    }
+
+    return nterm;
+}
+
+int psPolynomial3DNterm(const psPolynomial3D *poly)
+{
+    PS_ASSERT_POLY_NON_NULL(poly, 0);
+
+    int nterm = 0;
+    for (int i = 0; i <= poly->nX; i++) {
+        for (int j = 0; j <= poly->nY; j++) {
+            for (int k = 0; k <= poly->nZ; k++) {
+                if (poly->mask[k][j][i] == 0) {
+                    nterm++;
+                }
+            }
+        }
+    }
+
+    return nterm;
+}
+
+int psPolynomial4DNterm(const psPolynomial4D *poly)
+{
+    PS_ASSERT_POLY_NON_NULL(poly, 0);
+
+    int nterm = 0;
+    for (int i = 0; i <= poly->nX; i++) {
+        for (int j = 0; j <= poly->nY; j++) {
+            for (int k = 0; k <= poly->nZ; k++) {
+                for (int l = 0; l <= poly->nT; l++) {
+                    if (poly->mask[l][k][j][i] == 0) {
+                        nterm++;
+                    }
+                }
+            }
+        }
+    }
+
+    return nterm;
+}
+
+/************************************************************************************************************/
+
 psF64 psPolynomial1DEval(const psPolynomial1D* poly,
                          psF64 x)