MemoryReclaimer.h

浏览该文件的文档。

#ifndef _MemoryReclaimer_h_
#define _MemoryReclaimer_h_

#include "HGeometry.h"

template <int DIM, int DOW=DIM>
  class MemoryReclaimer {
 public:
 typedef HGeometryTree<DIM,DOW> tree_t;
 typedef IrregularMesh<DIM,DOW> ir_mesh_t;
 private:
 tree_t * h_tree;
 std::list<ir_mesh_t *> ir_mesh;

 public:
 MemoryReclaimer() : h_tree(NULL) {}
 MemoryReclaimer(tree_t& _h_tree) : h_tree(&_h_tree) {}
 virtual ~MemoryReclaimer() {}

 public:
 void setGeometryTree(tree_t& _h_tree) {
   h_tree = &_h_tree;
 }
 void addIrregularMesh(ir_mesh_t& _ir_mesh) {
   if (&(_ir_mesh.geometryTree()) != h_tree) {
     std::cout << "warning: the irregular mesh added is not based on the geometry tree used."
     << std::endl;
   }
   ir_mesh.push_back(&_ir_mesh);
 }
 void clear() {
   h_tree = NULL;
   ir_mesh.clear();
 }
 void reclaim();

 private:
 void reclaimIrregularMesh(ir_mesh_t&);
 void initialTreeLabel();
 void labelIrregularMesh(ir_mesh_t&);
 void reclaimTreeMemory();

 template <int DIM1> void labelHGeometry(HGeometry<DIM1,DOW>&, int lab);
 template <int DIM1> void labelHGeometryRecursively(HGeometry<DIM1,DOW>& g, int lab);
 template <int DIM1> int relabelHGeometryRecursively(HGeometry<DIM1,DOW>& g);
 template <int DIM1> int reclaimHGeometryRecursively(HGeometry<DIM1,DOW>& g);

 void labelHGeometry(HGeometry<0,DOW>&, int lab);
 void labelHGeometryRecursively(HGeometry<0,DOW>& g, int lab);
 int relabelHGeometryRecursively(HGeometry<0,DOW>& g);
 int reclaimHGeometryRecursively(HGeometry<0,DOW>& g);

 virtual void 
 reclaimHGeometry(void * p_geo, int dim) const {
   switch (dim) {
   case 0: delete ((HGeometry<0,DOW> *)(p_geo)); break;
   case 1: delete ((HGeometry<1,DOW> *)(p_geo)); break;
   case 2: delete ((HGeometry<2,DOW> *)(p_geo)); break;
   case 3: delete ((HGeometry<3,DOW> *)(p_geo)); break;
   }
 }

 protected:
 tree_t * get_tree_ptr() const { return h_tree; }
};

#include "MemoryReclaimer.templates.h"

#endif // _MemoryReclaimer_h_