GasTree.H

Go to the documentation of this file.

 
 #ifndef _GASTREE_H_
 #define _GASTREE_H_
 
 #include <iostream>
 #include <vector>
 #include "../Definitions.H"
 #include "../Core/FieldQty.H"
 #include "../MPI/MPIUtil.H"
 #include "../Utils/Constants.H"
 #include "../Utils/Units.H"
 #include "../Core/CRTree.H"
 #include "../Losses/Losses.H"
 #include "../Prob/Prob.H"
 #include "../Propagation/Propagation.H"
 #include "../Utils/Types.H"
 #include "hdf5.h"
 
 namespace criptic {
  class GasNode{
    public:
 
    GasNode(IdxType first_, IdxType numPart_, int splitDim_, Real splitVal_,
      RealBox bbox_, RealBox searchBox_,Real hMax_) : 
      first(first_), numPart(numPart_), splitDim(splitDim_), splitVal(splitVal_),
      bbox(bbox_), searchBox(searchBox_), hMax(hMax_) {};
 
    // Internal Data
    IdxType first; 
    IdxType numPart; 
    int splitDim; 
    Real splitVal; 
    RealBox bbox; 
    RealBox searchBox; 
    Real hMax; 
  };
 
  class GasTree{ 
    public:
    GasTree(std::vector<RealVec> positions, std::vector<Real> smoothingLengths,
       Real hLimit = 0, int leafSize_ = 16);
 
    void buildTree();
 
    static RealBox constructBox(std::vector<RealVec> positions);
 
    static inline bool inBox(const RealVec& pos_, const RealBox& bx) {
    return (pos_[0] > bx.lo[0] && pos_[0] < bx.hi[0] &&
            pos_[1] > bx.lo[1] && pos_[1] < bx.hi[1] &&
            pos_[2] > bx.lo[2] && pos_[2] < bx.hi[2]);
    }
 
    void partitionNode(GasNode& nd);
 
 
    std::vector<IdxType> getIdxs(const RealVec& targetPos, 
      const Real smoothingScale = 1) const;
 
    // Internal Data
    private:
    std::vector<RealVec> posArray; 
    std::vector<IdxType> idxs; 
    std::vector<Real> hs; 
    Real hLim; 
    std::vector<GasNode> nodes; 
    int leafSize;
  };
}
 
 // _GASTREE_H_
 #endif