This is an abstract class and cannot be directly instanced.
[ deal | Source | Keywords | Summary | Ancestors | All Members | Descendants ]
public: | |
static const int prim_face_vertex[ | NNB][NPTFACE1]; |
static const int sec_face_vertex[ | NNB][NPTFACE2]; |
static int | one_irregular_thresh; |
void* | operator new(size_t sz); |
void | operator delete(void*p); |
Vertex* | vertex(int i) const; |
Cell* | child(int i) const; |
Cell* | neighbour(int i) const; |
int | neighbour_number(int i) const; |
int | nneighbours() const ; |
int | nchildren() const ; |
Hex (Polygon<NPT>, int mat, Cell* papa); | |
~Hex(); | |
Hex* | newHex (Polygon<NPT>, int mat , Cell* papa ) const; // pure virtual |
void | neighbour(int i,Cell* pp); |
void | neighbour_number(int i,int n); |
int | sleep() const ; |
int | refine_type() const ; |
int | one_irregular(); |
int | seam_prepare(); |
int | seam_irregular(); |
void | coarse(); |
void | distort(dVector& F) const; |
void | boundary(); |
void | child(int i,Cell* cp); |
void | refine_type(int i) ; |
QuadFace* | _face(int i) const; |
Face* | face(int i, FaceQual q ) const; |
void | notify(Face& f, int n); |
int | identify_neighbour(Cell*); |
int | identify_neighbour(Face&) const; |
void | build_fields(Vertex**, Cell**, int*); |
const char* | name() const |
void | delete_children(); |
void | ucd_print(FILE* fp) const; |
protected: |
Back to the top of Hex
const int prim_face_vertex[NNB][NPTFACE1];
static const int prim_face_vertex[NNB][NPTFACE1];
Back to the top of Hex
const int sec_face_vertex[NNB][NPTFACE2];
static const int sec_face_vertex[NNB][NPTFACE2];
Back to the top of Hex
static int one_irregular_thresh;
Back to the top of Hex
void* operator new(size_t sz);
void* operator new(size_t sz);
Back to the top of Hex
void operator delete(void*p);
Back to the top of Hex
virtual Vertex* vertex(int i) const;
Back to the top of Hex
virtual Cell* child(int i) const;
Back to the top of Hex
virtual Cell* neighbour(int i) const;
Back to the top of Hex
int neighbour_number(int i) const;
virtual int neighbour_number(int i) const;
Back to the top of Hex
int nneighbours() const ;
virtual int refine() const { return refine_count_field; }
virtual void refine(int i) { refine_count_field = i; }
virtual int nneighbours() const ;
Function is currently defined inline.
Back to the top of Hex
virtual int nchildren() const ;
Function is currently defined inline.
Back to the top of Hex
Hex (Polygon<NPT>, int mat, Cell* papa);
Hex (Polygon<NPT>, int mat, Cell* papa);
Back to the top of Hex
virtual ~Hex();
Back to the top of Hex
Hex* newHex (Polygon<NPT>, int mat , Cell* papa ) const;
virtual Hex* newHex (Polygon<NPT>, int mat=0, Cell* papa = NULL) const;
Back to the top of Hex
void neighbour(int i,Cell* pp);
void neighbour(int i,Cell* pp);
Back to the top of Hex
void neighbour_number(int i,int n);
void neighbour_number(int i,int n);
Back to the top of Hex
int sleep() const ;
Function is currently defined inline.
Back to the top of Hex
int refine_type() const ;
Function is currently defined inline.
Back to the top of Hex
int one_irregular();
Back to the top of Hex
int seam_prepare();
Back to the top of Hex
int seam_irregular();
Back to the top of Hex
void coarse();
Back to the top of Hex
void distort(dVector& F) const;
void distort(dVector& F) const;
Back to the top of Hex
void boundary();
Back to the top of Hex
void child(int i,Cell* cp);
Back to the top of Hex
void refine_type(int i) ;
Function is currently defined inline.
Back to the top of Hex
QuadFace* _face(int i) const;
Back to the top of Hex
Face* face(int i, FaceQual q ) const;
virtual Face* face(int i, FaceQual q = face_normal) const;
Back to the top of Hex
virtual void notify(Face& f, int n);
Back to the top of Hex
int identify_neighbour(Cell*);
virtual int identify_neighbour(Cell*);
Back to the top of Hex
int identify_neighbour(Face&) const;
virtual int identify_neighbour(Face&) const;
Back to the top of Hex
void build_fields(Vertex**, Cell**, int*);
virtual void build_fields(Vertex**, Cell**, int*);
Back to the top of Hex
const char* name() const { return "Hex"; }
Back to the top of Hex
virtual void delete_children();
Back to the top of Hex
void ucd_print(FILE* fp) const;
void ucd_print(FILE* fp) const;
Back to the top of Hex
public: | ||
---|---|---|
DoubleNode* | pred; | |
DoubleNode* | succ; | |
void | knot(DoubleNode* p); | |
void | dissolve(); | |
static const int prim_face_vertex[ | NNB][NPTFACE1]; | |
static const int sec_face_vertex[ | NNB][NPTFACE2]; | |
static int | one_irregular_thresh; | |
void* | operator new(size_t sz); | |
void | operator delete(void*p); | |
Vertex* | vertex(int i) const; | |
Cell* | child(int i) const; | |
Cell* | neighbour(int i) const; | |
int | neighbour_number(int i) const; | |
int | nneighbours() const ; | |
int | nchildren() const ; | |
Hex* | newHex (Polygon<NPT>, int mat , Cell* papa ) const; // pure virtual | |
void | neighbour(int i,Cell* pp); | |
void | neighbour_number(int i,int n); | |
int | sleep() const ; | |
int | refine_type() const ; | |
int | one_irregular(); | |
int | seam_prepare(); | |
int | seam_irregular(); | |
void | coarse(); | |
void | distort(dVector& F) const; | |
void | boundary(); | |
void | child(int i,Cell* cp); | |
void | refine_type(int i) ; | |
QuadFace* | _face(int i) const; | |
Face* | face(int i, FaceQual q ) const; | |
void | notify(Face& f, int n); | |
int | identify_neighbour(Cell*); | |
int | identify_neighbour(Face&) const; | |
void | build_fields(Vertex**, Cell**, int*); | |
const char* | name() const | |
void | delete_children(); | |
void | ucd_print(FILE* fp) const; | |
protected: |
Back to the top of Hex
Back to the top of Hex
Back to the top of Hex
Report problems to jkotula@vitalimages.com