1 files changed, 142 insertions, 0 deletions
diff --git a/Carpet/CarpetLib/src/gh.hh b/Carpet/CarpetLib/src/gh.hh
new file mode 100644
index 000000000..edf149000
--- /dev/null
+++ b/Carpet/CarpetLib/src/gh.hh
@@ -0,0 +1,142 @@
+// $Header: /home/eschnett/C/carpet/Carpet/Carpet/CarpetLib/src/gh.hh,v 1.18 2004/08/07 19:47:11 schnetter Exp $
+
+#ifndef GH_HH
+#define GH_HH
+
+#include <assert.h>
+
+#include <iostream>
+#include <list>
+#include <vector>
+
+#include "bbox.hh"
+#include "defs.hh"
+#include "dist.hh"
+#include "vect.hh"
+
+using namespace std;
+
+
+
+// Forward declaration
+template<int D> class dh;
+template<int D> class th;
+template<int D> class gh;
+
+// Output
+template<int D>
+ostream& operator<< (ostream& os, const gh<D>& h);
+
+
+
+// A refinement hierarchy, where higher levels are finer than the base
+// level.  The extents do not include ghost zones.
+template<int D>
+class gh {
+  
+public:
+  
+  // Types
+  typedef vect<int,D> ivect;
+  typedef bbox<int,D> ibbox;
+  
+  typedef vect<vect<bool,2>,D> bvect;
+  
+  typedef vector<ibbox> mexts;	// ... for each multigrid level
+  typedef vector<mexts> cexts;	// ... for each component
+  typedef vector<cexts> rexts;	// ... for each refinement level
+  
+  typedef vector<bvect> cbnds;	// ... for each component
+  typedef vector<cbnds> rbnds;	// ... for each refinement level
+  
+  typedef vector<int>    cprocs; // ... for each component
+  typedef vector<cprocs> rprocs; // ... for each refinement level
+  
+public:				// should be readonly
+  
+  // Fields
+  int reffact;			// refinement factor
+  centering refcent;		// vertex or cell centered
+  
+  int mgfact;			// default multigrid factor
+  centering mgcent;		// default (vertex or cell centered)
+  
+  list<th<D>*> ths;		// list of all time hierarchies
+  
+  ibbox baseextent;
+  vector<vector<ibbox> > bases; // [rl][ml]
+  
+  // TODO: invent structure for this
+  rexts extents;		// extents of all grids
+  rbnds outer_boundaries;	// boundary descriptions of all grids
+  rprocs processors;		// processor numbers of all grids
+  
+  list<dh<D>*> dhs;		// list of all data hierarchies
+  
+public:
+  
+  // Constructors
+  gh (const int reffact, const centering refcent,
+      const int mgfact, const centering mgcent,
+      const ibbox baseextent);
+  
+  // Destructors
+  virtual ~gh ();
+  
+  // Modifiers
+  void recompose (const rexts& exts, const rbnds& outer_bounds,
+		  const rprocs& procs,
+                  const bool do_prolongate);
+  
+  // Accessors
+  int reflevels () const {
+    return (int)extents.size();
+  }
+  
+  int components (const int rl) const {
+    return (int)extents.at(rl).size();
+  }
+  
+  int mglevels (const int rl, const int c) const {
+    return (int)extents.at(rl).at(c).size();
+  }
+  
+  bvect outer_boundary (const int rl, const int c) const {
+    return outer_boundaries.at(rl).at(c);
+  }
+  
+  int proc (const int rl, const int c) const {
+    return processors.at(rl).at(c);
+  }
+
+  bool is_local (const int rl, const int c) const {
+    int rank;
+    MPI_Comm_rank (dist::comm, &rank);
+    return proc(rl,c) == rank;
+  }
+  
+  int local_components (const int rl) const;
+  
+  // Time hierarchy management
+  void add (th<D>* t);
+  void remove (th<D>* t);
+  
+  // Data hierarchy management
+  void add (dh<D>* d);
+  void remove (dh<D>* d);
+  
+  // Output
+  virtual ostream& output (ostream& os) const;
+};
+
+
+
+template<int D>
+inline ostream& operator<< (ostream& os, const gh<D>& h) {
+  h.output(os);
+  return os;
+}
+
+
+
+#endif // GH_HH