Add getter for Np (NumLocalPoints).

dsteinmo · Apr 15, 2018 · 4c85cda · 4c85cda
1 parent 5c71ad2
commit 4c85cda
Show file tree

Hide file tree

Showing 3 changed files with 12 additions and 7 deletions.
diff --git a/include/Nodes1DProvisioner.hpp b/include/Nodes1DProvisioner.hpp
@@ -8,10 +8,6 @@ using namespace std;
 using namespace blitz;
 
 class Nodes1DProvisioner {
-
-    static const int NumFacePoints;
-    static const int NumFaces;
-
     double Min_x;
     double Max_x;
     int NumElements;
@@ -31,6 +27,8 @@ class Nodes1DProvisioner {
     DirectSolver * LinSolver;
 
   public:
+    static const int NumFacePoints;
+    static const int NumFaces;
     Nodes1DProvisioner(int NOrder, int NumElements, double xmin, double xmax, SparseMatrixConverter & converter, EigenSolver & eigenSolver, DirectSolver & directSolver);
 
     void buildNodes();
@@ -44,6 +42,7 @@ class Nodes1DProvisioner {
     Array<double, 2> & get_Dr();
     Array<double, 2> & get_V();
     Array<double, 2> & get_EToV();
+    int get_NumLocalPoints();
 
     // these can be moved to a helper (polynomials) class or made private within this class.
     void computeJacobiPolynomial(Array<double,1> const & x, const double alpha, const double beta, const int N, Array<double,1> & p);

diff --git a/src/Nodes1DProvisioner.cpp b/src/Nodes1DProvisioner.cpp
@@ -162,6 +162,10 @@ Array<double, 2> & Nodes1DProvisioner::get_V() {
     return *V;
 }
 
+int Nodes1DProvisioner::get_NumLocalPoints() {
+    return NumLocalPoints;
+}
+
 /**
  * Destructor.
  */

diff --git a/src/main.cpp b/src/main.cpp
@@ -32,12 +32,14 @@ int main(int argc, char **argv) {
 
   nodes1DProvisioner.buildNodes();
 
+  int Np = nodes1DProvisioner.get_NumLocalPoints();
+
   Array<double,1> rGrid = nodes1DProvisioner.get_rGrid();
   cout << rGrid << endl;
 
   cout << nodes1DProvisioner.get_V() << endl;
 
-  Array<double, 2> DVr(N+1, N+1);
+  Array<double, 2> DVr(Np, Np);
 
   nodes1DProvisioner.computeGradVandermonde(DVr);
 
@@ -48,8 +50,8 @@ int main(int argc, char **argv) {
 
   cout << x << endl;
 
-  Array<double,2> J(N+1, K);
-  Array<double,2> rx(N+1, K);
+  Array<double,2> J(Np, K);
+  Array<double,2> rx(Np, K);
 
   nodes1DProvisioner.computeJacobian(J, rx);