2 // Class : Element de base des Vertex/Edge/Quad, etc...
4 // Copyright (C) 2009-2013 CEA/DEN, EDF R&D
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
26 #include "hexa_base.hxx"
29 #define HexDump(x) {printf(#x " = "); if (x) x->dump(); else printf("NULL\n");}
30 #define PrintName(x) if (x) x->printName(); else printf ("NULL, ")
31 #define PutName(x) { printf(#x " = "); if (x) x->printName("\n"); else printf("NULL\n"); }
33 #define GetClone(elt) ((elt)==NULL ? NULL : elt->getClone())
34 #define BadElement(elt) (elt)==NULL || (elt)->isBad()
41 virtual int countHexa () { return 0; }
42 virtual int countQuad () { return 0; }
43 virtual int countEdge () { return 0; }
44 virtual int countVertex () { return 0; }
46 virtual void setError (int kod=HERR) { el_status = kod; }
47 virtual int getError () { return el_status; }
48 virtual bool isValid () { return el_status==HOK; }
49 virtual bool isBad () { return el_status!=HOK; }
51 virtual void duplicate () {}
52 virtual void clearAssociation () {}
54 // void copyAssociation (EltBase* orig);
55 // void replaceAssociation (EltBase* orig);
58 virtual void replaceEdge (Edge* old, Edge* nouveau)
59 { printf ("rep-edge\n") ; }
60 virtual void replaceVertex (Vertex* old, Vertex* nouveau)
61 { printf ("rep-vertex\n") ; }
63 EltBase (Document* doc, EnumElt type=EL_NONE);
64 EltBase (EnumElt type=EL_NONE);
67 virtual void remove ();
68 virtual void suppress ();
70 virtual void saveXml (XmlWriter* xml) {}
71 virtual void majReferences () { }
72 virtual char* makeVarName (char* nom);
74 static char* makeName (int type, int id, char* name);
76 EltBase* next () { return el_next; }
77 void setNext (EltBase* suivant) { el_next = suivant; }
78 int getId () { return el_id; }
80 Document* dad () { return el_root; }
81 EnumElt getType () { return el_type; }
82 bool isHere () { return el_type!=EL_REMOVED; }
83 bool isDeleted () { return el_type==EL_REMOVED; }
85 // On s'occupe des parents
87 void razReferences () { el_parent.clear() ; }
88 void addParent (EltBase* dad) { if (dad) el_parent.push_back(dad) ; }
89 int getNbrParents () { return el_parent.size() ; }
91 EltBase* getFather (int nro);
93 int getMark () { return el_mark; }
94 void setMark (int ln) { el_mark = ln ; }
95 char* getName (pchar nom);
96 void printName (cpchar sep=" ");
100 void setName (const string& nom) { el_name = nom ; }
101 void setName (cpchar nom) { el_name = nom ; }
103 bool debug (int niv=0);
104 bool isAssociated () { return is_associated ; }
116 std::vector <EltBase*> el_parent;
118 // ========================================================= dump
119 inline void EltBase::dump ()
121 printf ("Elt%d Nro=%04d", el_type, el_id);
125 // ========================================================= getFather
126 inline EltBase* EltBase::getFather (int nro)
129 if (nro >= 0 && nro < (int) el_parent.size() && isHere()
130 && el_parent[nro]->isHere())
131 elt = el_parent[nro];
135 // ========================================================= hasParents
136 inline bool EltBase::hasParents ()
138 int nbp = el_parent.size();
139 for (int nro=0 ; nro<nbp ; nro++)
140 if (el_parent[nro]!=NULL && el_parent[nro]->isHere())