Changeset 1172 for XIOS/dev/branch_yushan_merged/extern

Timestamp:

06/15/17 19:32:13 (7 years ago)

Author:

yushan

Message:

save dev. need to unify the file type when using EP

Location:

XIOS/dev/branch_yushan_merged/extern/remap/src

Files:

• elt.hpp (modified) (2 diffs)
• node.cpp (modified) (1 diff)
• parallel_tree.cpp (modified) (3 diffs)
• tree.cpp (modified) (2 diffs)
• tree.hpp (modified) (3 diffs)

XIOS/dev/branch_yushan_merged/extern/remap/src/elt.hpp

@@ -53 +53 @@
 struct Elt : Polyg
 {
-        Elt() {}
-        Elt(const double *bounds_lon, const double *bounds_lat, int max_num_vert)
-        {
-                int k = 0;
-                vertex[k++] = xyz(bounds_lon[0], bounds_lat[0]);
-                for (int i = 1; i < max_num_vert; i++)
-                {
-                        vertex[k] = xyz(bounds_lon[i], bounds_lat[i]);
-                        /* netCDF convention: if first vertex repeats element is finished (at least three vertices == triagle) */
-                        if (k >= 3 && squaredist(vertex[k], vertex[0]) < EPS*EPS) 
-                                break;
-                        /* eliminate zero edges: move to next vertex only if it is different */
-                        if (squaredist(vertex[k], vertex[k-1]) > EPS*EPS)
-                                k++;
-                        else
-                                /* cout << "Removed edge " << k << " due to zero length (coinciding endpoints)." << endl */ ;
-                }
-                n = k;
-                x = barycentre(vertex, n);
-        }
+  Elt() {}
+  Elt(const double *bounds_lon, const double *bounds_lat, int max_num_vert)
+  {
+    int k = 0;
+    vertex[k++] = xyz(bounds_lon[0], bounds_lat[0]);
+    for (int i = 1; i < max_num_vert; i++)
+    {
+      vertex[k] = xyz(bounds_lon[i], bounds_lat[i]);
+      /* netCDF convention: if first vertex repeats element is finished (at least three vertices == triagle) */
+      if (k >= 3 && squaredist(vertex[k], vertex[0]) < EPS*EPS) 
+        break;
+      /* eliminate zero edges: move to next vertex only if it is different */
+      if (squaredist(vertex[k], vertex[k-1]) > EPS*EPS)
+        k++;
+      //else cout << "Removed edge " << k << " due to zero length (coinciding endpoints)." << endl ;
+    }
+    n = k;
+    x = barycentre(vertex, n);
+  }
 
         Elt& operator=(const Elt& rhs)
@@ -96 +95 @@
         }
 
-        void delete_intersections()
-        {
-                for (list<Polyg*>::iterator it = this->is.begin(); it != this->is.end(); it++)
-                {
-                        Polyg* poly = *it;
-                        delete poly;
-                }
-        }
+  void delete_intersections()
+  {
+    for (list<Polyg*>::iterator it = this->is.begin(); it != this->is.end(); it++)
+    {
+      Polyg* poly = *it;
+      delete poly;
+    }
+  }
 
   void insert_vertex(int i, const Coord& v)

XIOS/dev/branch_yushan_merged/extern/remap/src/node.cpp

@@ -472 +472 @@
         q->child.resize(MAX_NODE_SZ/2 + 1);
         assert(thIs->child.size() == MAX_NODE_SZ+1);
-        thIs->tree->ref = thIs->closest(thIs->child, FARTHEST); // farthest from centre
+        if(thIs->closest(thIs->child, FARTHEST) == 0) 
+          thIs->tree->ref = thIs->closest(thIs->child, FARTHEST); // farthest from centre
+          
+        thIs->tree->ref = thIs->closest(thIs->child, FARTHEST); // farthest from centre
+        
+          
         std::sort(thIs->child.begin(), thIs->child.end(), compareDist);
         for (int i = 0; i < MAX_NODE_SZ+1; i++)

XIOS/dev/branch_yushan_merged/extern/remap/src/parallel_tree.cpp

@@ -315 +315 @@
 {
 
-        int assignLevel = 2;
-        int nbSampleNodes = 2*ipow(MAX_NODE_SZ + 1, assignLevel);
+  int assignLevel = 2;
+  int nbSampleNodes = 2*ipow(MAX_NODE_SZ + 1, assignLevel);
 
 
@@ -326 +326 @@
   MPI_Comm_size(communicator,&commSize) ;
   
-        // make multiple of two
-        nbSampleNodes /= 2;
-        nbSampleNodes *= 2;
-//  assert( nbTot > nbSampleNodes*commSize) ;
+  // make multiple of two
+  nbSampleNodes /= 2;
+  nbSampleNodes *= 2;
+  //assert( nbTot > nbSampleNodes*commSize) ;
     
   int nbSampleNodes1 = nbSampleNodes * (nb1*commSize)/(1.*nbTot) ;
@@ -335 +335 @@
   
 
-//      assert(node.size() > nbSampleNodes);
-//      assert(node2.size() > nbSampleNodes);
-//      assert(node.size() + node2.size() > nbSampleNodes);
-        vector<Node> sampleNodes; sampleNodes.reserve(nbSampleNodes1+nbSampleNodes2);
-
-        vector<int> randomArray1(node.size());
-        randomizeArray(randomArray1);
-        vector<int> randomArray2(node2.size());
-        randomizeArray(randomArray2);
+  //assert(node.size() > nbSampleNodes);
+  //assert(node2.size() > nbSampleNodes);
+  //assert(node.size() + node2.size() > nbSampleNodes);
+  vector<Node> sampleNodes; sampleNodes.reserve(nbSampleNodes1+nbSampleNodes2);
+
+  vector<int> randomArray1(node.size());
+  randomizeArray(randomArray1);
+  vector<int> randomArray2(node2.size());
+  randomizeArray(randomArray2);
 
 /*      

XIOS/dev/branch_yushan_merged/extern/remap/src/tree.cpp

@@ -29 +29 @@
 void CBasicTree::routeNodes(vector<int>& route, vector<Node>& nodes, int assignLevel)
 {
-        for (int i = 0; i < nodes.size(); i++)
-        {
-                root->routeNode(&nodes[i], assignLevel);
-                route[i] = nodes[i].route;
-        }
+  for (int i = 0; i < nodes.size(); i++)
+  {
+    root->routeNode(&nodes[i], assignLevel);
+    route[i] = nodes[i].route;
+  }
 }
 
 void CBasicTree::routeIntersections(vector<vector<int> >& routes, vector<Node>& nodes)
 {
-        for (int i = 0; i < nodes.size(); i++)
-                root->routeIntersection(routes[i], &nodes[i]);
+  for (int i = 0; i < nodes.size(); i++)
+    root->routeIntersection(routes[i], &nodes[i]);
 }
 
 void CBasicTree::build(vector<Node>& nodes)
 {
-        newRoot(1);
-        insertNodes(nodes);
+  newRoot(1);
+  insertNodes(nodes);
 }
 
 void CBasicTree::output(ostream& flux, int level)
 {
-        root->output(flux,level,0) ;
+  root->output(flux,level,0) ;
 }
 void CBasicTree::slim(int nbIts)
 {
-        for (int i = 0; i < nbIts; i++)
-        {
-                for (int level = root->level - 1; level > 0; level--)
-                {
-                        slim2(root, level);
-                        ri = 0;
-                        emptyPool();
-                }
-
-                for (int level = 2; level < root->level; level++)
-                {
-                        slim2(root, level);
-                        ri = 0;
-                        emptyPool();
-                }
-        }
+  for (int i = 0; i < nbIts; i++)
+  {
+    for (int level = root->level - 1; level > 0; level--)
+    {
+      slim2(root, level);
+      ri = 0;
+      emptyPool();
+    }
+
+    for (int level = 2; level < root->level; level++)
+    {
+      slim2(root, level);
+      ri = 0;
+      emptyPool();
+    }
+  }
 }
 
@@ -76 +76 @@
 void CBasicTree::insertNode(NodePtr node)
 {
-        node->tree = this;
-        increaseLevelSize(0);
-        push_back(node);
-
-        NodePtr q;
-        while (pool.size())
-        {
-                q = pool.front();
-                pool.pop_front();
-                q = insert(q, root);
-                if (ri)
-                {
-                        delete q;
-                        ri = 0;
-                }
-        }
+  node->tree = this;
+  increaseLevelSize(0);
+  push_back(node);
+
+  NodePtr q;
+  while (pool.size())
+  {
+    q = pool.front();
+    pool.pop_front();
+    q = insert(q, root);
+    if (ri)
+    {
+      delete q;
+      ri = 0;
+    }
+  }
 }
 
 void CBasicTree::emptyPool(void)
 {
-        while (pool.size())
-        {
-                NodePtr q = pool.front();
-                pool.pop_front();
-                q = insert(q, root);
-                if (ri)
-                {
-                        delete q;
-                        ri = 0;
-                }
-        }
+  while (pool.size())
+  {
+    NodePtr q = pool.front();
+    pool.pop_front();
+    q = insert(q, root);
+    if (ri)
+    {
+      delete q;
+      ri = 0;
+    }
+  }
 }
 

XIOS/dev/branch_yushan_merged/extern/remap/src/tree.hpp

@@ -14 +14 @@
 class CBasicTree
 {
-public:
+  public:
 
-        NodePtr root; /* The main tree is stored as Nodes which can be reached through traversal starting here */
-        NodePtr ref; // FIXME this reference, set by a node is odd, try to remove
-        int ri; /** this is set to one by a node in case of reinsertion */
-        vector<int> levelSize; /** e.g. levelSize[0] == leafs.size() */
-        vector<Node> leafs; /** leafs are stored in vector for easy access and rest of the tree nodes as separate allocations, only reachable through tree traversal */
+  NodePtr root; /* The main tree is stored as Nodes which can be reached through traversal starting here */
+  NodePtr ref; // FIXME this reference, set by a node is odd, try to remove
+  int ri; /** this is set to one by a node in case of reinsertion */
+  vector<int> levelSize; /** e.g. levelSize[0] == leafs.size() */
+  vector<Node> leafs; /** leafs are stored in vector for easy access and rest of the tree nodes as separate allocations, only reachable through tree traversal */
 
-        CBasicTree() : ri(0), levelSize(MAX_LEVEL_SIZE), root(NULL), isAssignedLevel(false), okSplit(true), isActiveOkSplit(false) {} 
-        ~CBasicTree(); 
-        void build(vector<Node>& nodes);
-        void slim(int nbIts = 1);
-        virtual void insertNodes(vector<Node>& node) = 0;
+  CBasicTree() : ri(0), levelSize(MAX_LEVEL_SIZE), root(NULL), isAssignedLevel(false), okSplit(true), isActiveOkSplit(false) {} 
+  ~CBasicTree(); 
+  void build(vector<Node>& nodes);
+  void slim(int nbIts = 1);
+  virtual void insertNodes(vector<Node>& node) = 0;
 
-        void routeNodes(vector<int>& route, vector<Node>& nodes, int assignLevel);
-        void routeIntersections(vector<vector<int> >& route, vector<Node>& nodes);
+  void routeNodes(vector<int>& route, vector<Node>& nodes, int assignLevel);
+  void routeIntersections(vector<vector<int> >& route, vector<Node>& nodes);
 
-        void push_back(NodePtr node);
-        void push_front(NodePtr node);
-        void increaseLevelSize(int level);
-        void decreaseLevelSize(int level);
-        void newRoot(int level);
-        void insertNode(NodePtr node);
+  void push_back(NodePtr node);
+  void push_front(NodePtr node);
+  void increaseLevelSize(int level);
+  void decreaseLevelSize(int level);
+  void newRoot(int level);
+  void insertNode(NodePtr node);
   void output(ostream& flux, int level) ;
 
-        int keepNodes;
+  int keepNodes;
   bool isAssignedLevel ; 
   int assignLevel;
@@ -50 +50 @@
 
   
-private:
-        deque<NodePtr > pool;
+  private:
+  deque<NodePtr > pool;
         
   bool okSplit ;
  
-protected:
+  protected:
   void emptyPool();
-  CBasicTree(int keepNodes_, int assignLevel_) : ri(0), levelSize(MAX_LEVEL_SIZE), root(NULL), keepNodes(keepNodes_), assignLevel(assignLevel_), isAssignedLevel(true), okSplit(true), isActiveOkSplit(false) {} 
+  CBasicTree(int keepNodes_, int assignLevel_) : ri(0), levelSize(MAX_LEVEL_SIZE), root(NULL), keepNodes(keepNodes_), assignLevel(assignLevel_), isAssignedLevel(true), 
+                                                 okSplit(true), isActiveOkSplit(false) {} 
 };
 
 class CTree : public CBasicTree
 {
-public:
-        void insertNodes(vector<Node>& nodes);
+  public:
+  void insertNodes(vector<Node>& nodes);
 };
 
@@ -69 +70 @@
 {
 
-public:
-        CSampleTree(int keepNodes_, int assignLevel_) : CBasicTree(keepNodes_,assignLevel_) {}
+  public:
+  CSampleTree(int keepNodes_, int assignLevel_) : CBasicTree(keepNodes_,assignLevel_) {}
   void slimAssignedLevel() ;
   void removeExtraNode(void) ;
-        void insertNodes(vector<Node>& nodes);
+  void insertNodes(vector<Node>& nodes);
 };