+// Copyright (C) 2007-2008 OPEN CASCADE, CEA/DEN, EDF R&D
+//
+// This library is free software; you can redistribute it and/or
+// modify it under the terms of the GNU Lesser General Public
+// License as published by the Free Software Foundation; either
+// version 2.1 of the License.
+//
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+// Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public
+// License along with this library; if not, write to the Free Software
+// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+//
+// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
+//
+// ---
+//
+// File : ghs3dprl_mesh_wrap.cxx
+// Author : Christian VAN WAMBEKE (CEA)
+//
+// ---
+
+#include "ghs3dprl_mesh_wrap.h"
#include <string>
#include <iostream>
#include <sstream>
#include <fstream>
-#include <qstring.h>
-#include <qfile.h>
-#include "ghs3dprl_mesh_wrap.h"
+
+#include <libxml/tree.h>
+#include <libxml/parser.h>
+#include <libxml/xpath.h>
+#include <libxml/xpathInternals.h>
+
+#include <QFile>
+#include <QRegExp>
using namespace std;
using namespace med_2_2;
+//utils procedures
+
+//************************************
+string i2a(const int &v)
+{
+ ostringstream ss;
+ ss<<v;
+ return ss.str();
+}
+
+//************************************
+QString endspace(QString deb,int lg)
+//better fill by spaces for char unicoo[3*MED_TAILLE_PNOM+1]; etc...
+{
+ QString fin,spa;
+ //spa.fill(' ',lg);
+ //fin=deb+spa;
+ //fin.truncate(lg);
+ fin=deb.leftJustified(lg,' ',true);
+ return fin;
+}
+
+//************************************
+void charendnull(char *p, QString deb, int lg)
+{
+ QString fin;
+ fin=deb;
+ fin.truncate(lg-1);
+ strcpy(p,fin.toLatin1().constData()); // 0 at end
+ for (int i=fin.length();i<lg-1;i++){
+ p[i]='\0';
+ }
+}
+
+//class familles
+//************************************
+ void familles::newfam(QString nom){
+ //cout<<"newfam "<<nom<<endl;
+ if (fam.find(nom)!=fam.end()){
+ cout<<"***newfam*** "<<nom.toLatin1().constData()<<" deja present\n";
+ return;
+ }
+ fend gb;
+ fam[nom]=gb;
+ }
+
+//************************************
+ void familles::newgro(QString nom){
+ //cout<<"newgro "<<nom<<endl;
+ if (gro.find(nom)!=gro.end()){
+ cout<<"***newgro*** "<<nom.toLatin1().constData()<<" deja present\n";
+ return;
+ }
+ fend gb;
+ gro[nom]=gb;
+ }
+
+//************************************
+ void familles::write(){
+ fend gb;
+ fagr::iterator it1;
+ fend::iterator it2;
+ //cout<<"\n***familles.write()***\n";
+ for (it1=fam.begin(); it1!=fam.end(); ++it1){
+ cout<<"Family=<"<<(*it1).first.toLatin1().constData()<<">\tGroups=";
+ gb=(*it1).second;
+ for (it2=gb.begin(); it2!=gb.end(); ++it2){
+ cout<<"<"<<(*it2).first.toLatin1().constData()<<"> ";
+ }
+ cout<<endl;
+ }
+ for (it1=gro.begin(); it1!=gro.end(); ++it1){
+ cout<<"Group=<"<<(*it1).first.toLatin1().constData()<<">\tFamilies=";
+ gb=(*it1).second;
+ for (it2=gb.begin(); it2!=gb.end(); ++it2){
+ cout<<"<"<<(*it2).first.toLatin1().constData()<<"> ";
+ }
+ cout<<endl;
+ }
+ }
+
+//************************************
+ xmlNodePtr familles::xml_groups(){
+ fend gb;
+ fagr::iterator it1;
+ fend::iterator it2;
+ int nb=0,nbf;
+ string ss;
+ xmlNodePtr res,node;
+ res=xmlNewNode(NULL, BAD_CAST "groups");
+ for (it1=gro.begin(); it1!=gro.end(); ++it1){
+ node = xmlNewChild(res, 0, BAD_CAST "group",0);
+ ss=(*it1).first.toLatin1().constData();
+ xmlNewProp(node, BAD_CAST "name", BAD_CAST ss.c_str());
+ nb++;
+ gb=(*it1).second;
+ nbf=0; ss="";
+ for (it2=gb.begin(); it2!=gb.end(); ++it2){
+ ss=ss+" "+(*it2).first.toLatin1().constData();
+ nbf++;
+ }
+ xmlNewProp(node, BAD_CAST "families_number", BAD_CAST i2a(nbf).c_str());
+ xmlNewProp(node, BAD_CAST "families", BAD_CAST ss.substr(1).c_str());
+ //cout<<endl;
+ }
+ xmlNewProp(res, BAD_CAST "number", BAD_CAST i2a(nb).c_str());
+ return res;
+ }
+
+//************************************
+ void familles::add(QString nomfam, QString nomgro)
+ {
+ //cout<<"add family <"<<nomfam<<">\t<"<<nomgro<<">\n";
+ fagr::iterator it;
+ it=fam.find(nomfam);
+ if (it==fam.end()){
+ //cout<<"add new family <"<<nomfam<<">\t<"<<nomgro<<">\n";
+ newfam(nomfam);
+ it=fam.find(nomfam);
+ }
+ if (nomgro=="") return; //no group
+ (*it).second[nomgro]=0;
+ it=gro.find(nomgro);
+ if (it==gro.end()){
+ //cout<<"***new*** "<<nomgro<<" non present\n";
+ newgro(nomgro);
+ it=gro.find(nomgro);
+ }
+ (*it).second[nomfam]=0;
+
+ }
+
+
+//************************************
+bool familles::get_number_of_new_family(int sign, med_int *ires, QString *tmp)
+//if sign < 0 families faces or tria3 etc...
+//if sign >= 0 family zero and family nodes
+//outputs in *ires and *tmp
+{
+ int pas,i,ii;
+ QString nomfam;
+ fagr::iterator it;
+ if (sign>=0) pas=1; else pas=-1;
+ *tmp="0"; *ires=0;
+ ii=pas;
+ for (i=0;i<10000;i++) { //mefiance
+ nomfam=nomfam.sprintf("%d",ii);
+ it=fam.find(nomfam);
+ if (it==fam.end()) {
+ *tmp=nomfam; *ires=ii;
+ //cout<<"NewFamily Found<"<<*ires<<"><"<<*tmp<<">\n";
+ return true;
+ }
+ ii=ii+pas;
+ }
+ cerr<<"***get_number_of_new_family*** Problem new family not found"<<endl;
+ return false;
+}
+
+//************************************
+ med_int familles::find_family_on_groups(med_int fam1, med_int fam2)
+ {
+ med_int ires=0;
+ if (fam1==fam2) {ires=fam1; return ires;}
+ //find one family whith groups of fam1 and groups of fam2
+ fend gb=fuse_goups(fam1,fam2);
+ //find if one family have theses groups
+ fagr::iterator it1;
+ fend::iterator it2;
+ for (it1=fam.begin(); it1!=fam.end(); ++it1){
+ if (gb==(*it1).second){
+ ires=(*it1).first.toLong();
+ //cout<<"find_family_on_groups old <"<<ires<<"> from <"<<
+ // fam1<<"><"<<fam2<<">\n";
+ return ires;
+ }
+ }
+ //cout<<"no family found!!! - groups of "<<fam1<<" and "<<fam2<<endl;
+ QString tmp;
+ //fam1 positive for nodes negative faces & mailles
+ bool oktmp=get_number_of_new_family(fam1,&ires,&tmp);
+ fend::iterator it;
+ for (it=gb.begin(); it!=gb.end(); ++it){
+ this->add(tmp,(*it).first);
+ }
+ //cout<<"new family <"<<ires<<"> intersection of <"<<fam1<<"><"<<fam2<<">\n";
+ return ires;
+ }
+
+//************************************
+ fend familles::fuse_goups(med_int fam1, med_int fam2)
+ //concatenation/fusion deux map groupes
+ {
+ QString nom1,nom2;
+ fagr::iterator it1,it2;
+ nom1=nom1.sprintf("%d",fam1);
+ it1=fam.find(nom1);
+ nom2=nom2.sprintf("%d",fam2);
+ it2=fam.find(nom2);
+ if ( (it1==fam.end())||(it2==fam.end()) ) {
+ cerr<<"***fuse_goups*** non existing family "<<fam1<<" or "<<fam2<<endl;
+ fend gb;
+ return gb; //empty
+ }
+ fend gb=(*it1).second; //firt groups
+ gb.insert((*it2).second.begin(),(*it2).second.end()); //other groups
+ return gb;
+ //for debug
+ cout<<"fuse_goups "<<fam1<<" "<<fam2<<" ";
+ fend::iterator it;
+ for (it=gb.begin(); it!=gb.end(); ++it){
+ cout<<"<"<<(*it).first.toLatin1().constData()<<"> ";
+ }
+ cout<<endl;
+ return gb;
+ }
+
+long CVWtab::memoryuse=0; //static
+long CVWtab::memorymax=1000*1000000; //static
+
//************************************
CVWtab::CVWtab(long nb, med_int *pmint)
//constructor with pmint allocated yet with new
type=1; //only tmint valide
tmint=pmint;
tmflo=NULL;
+ memoryuse=memoryuse+sizeof(med_int)*nb;
+ //cout<<"memoryuse int "<<sizeof(med_int)<<" "<<nb<<" "<<memoryuse<<" "<<memorymax<<endl;
+ if (memoryuse>memorymax) {
+ cout<<"***WARNING*** memory max reached "<<memorymax<<endl;
+ //cout<<"memoryuse int "<<sizeof(med_int)<<" "<<nb<<" "<<memoryuse<<endl;
+ }
}
//************************************
type=2; //only tmflo valide
tmint=NULL;
tmflo=pmflo;
+ memoryuse=memoryuse+sizeof(med_float)*nb;
+ //cout<<"memoryuse float "<<sizeof(med_float)<<" "<<nb<<" "<<memoryuse<<" "<<memorymax<<endl;
+ if (memoryuse>memorymax) {
+ cout<<"***WARNING*** memory max reached "<<memorymax<<endl;
+ //cout<<"memoryuse float "<<sizeof(med_float)<<" "<<nb<<" "<<memoryuse<<endl;
+ }
}
//************************************
//remove temporary file
if (this->filename!="_NO_FILE")
{
- remove(this->filename); //#include <stdio.h>
+ remove(this->filename.toLatin1().constData()); //#include <stdio.h>
//cout<<this->filename<<" successfully deleted\n";
}
bool CVWtab::CVWtab_deallocate()
{
//cout<<" deallocate CVWtab*** "<<size<<endl;
- if (size <= 0) return FALSE;
+ if (size <= 0) return false;
if (tmint)
{
delete[] tmint;
+ memoryuse=memoryuse-sizeof(med_int)*size;
size=-size; //precaution
}
if (tmflo)
{
delete[] tmflo;
+ memoryuse=memoryuse-sizeof(med_float)*size;
size=-size; //precaution
}
- return TRUE;
+ if (memoryuse<0) cout<<"***WARNING*** memoryuse <0 "<<memoryuse<<endl;
+ if (memoryuse==0) cout<<"***CVWtab_deallocate*** memoryuse=0 "<<endl;
+ return true;
}
//************************************
//cout<<"is_equal tab1 tab2 type="<<this->type<<" size="<<this->size<<" "<<tab2->size<<endl;
//if (this->type==1) cout<<"med_int tab1[0]="<<this->tmint[0]<<endl;
//if (this->type==2) cout<<"med_float tab1[0]="<<this->tmflo[0]<<endl;
- if (this->size!=tab2->size) return FALSE;
- if (this->type!=tab2->type) return FALSE;
+ if (this->size!=tab2->size) return false;
+ if (this->type!=tab2->type) return false;
if (this->type==1)
{
if (!this->tmint)
{ cout<<"***is_equal*** pb pointer NULL with tmint size="<<this->size<<endl;
- return FALSE;
+ return false;
}
for (long i=0; i < this->size; i++)
- if (this->tmint[i]!=tab2->tmint[i]) return FALSE;
+ if (this->tmint[i]!=tab2->tmint[i]) return false;
}
if (this->type==2)
{
if (!this->tmflo)
{ cout<<"***is_equal*** pb pointer NULL with tmflo size="<<this->size<<endl;
- return FALSE;
+ return false;
}
for (long i=0; i < this->size; i++)
- if (this->tmflo[i]!=tab2->tmflo[i]) return FALSE;
+ if (this->tmflo[i]!=tab2->tmflo[i]) return false;
}
- return TRUE;
+ return true;
}
//************************************
//verbose 2 for print also vertices equals (debug)
{
//cout<<"is_equal_vertice size="<<tab1->size<<" "<<tab2->size<<endl;
- bool ok=FALSE;
+ bool ok=false;
med_float *p1,*p2;
//vertices indices from 1 not 0!
long di1=(i1-1)*3, di2=(i2-1)*3;
{
cerr<<"BadIndice tab1 in is_equal_vertices "<<
di1<<" not in "<<tab1->size<<endl;
- return FALSE;
+ return false;
}
if (di2<0 || di2>=tab2->size)
{
cerr<<"BadIndice tab2 in is_equal_vertices "<<
di2<<" not in "<<tab2->size<<endl;
- return FALSE;
+ return false;
}
p1=(tab1->tmflo+di1);
p2=(tab2->tmflo+di2);
- if (p1[0]==p2[0] && p1[1]==p2[1] && p1[2]==p2[2]) ok=TRUE ;
+ if (p1[0]==p2[0] && p1[1]==p2[1] && p1[2]==p2[2]) ok=true ;
if (!ok && verbose>0) printf(
"Vertices differents (%.16g %.16g %.16g) (%.16g %.16g %.16g)\n",
p1[0],p1[1],p1[2],p2[0],p2[1],p2[2]);
//converts count value expected after "='" in line found
{
string line;
+ QString tmp;
do
{
if (getline(Ff,line))
{
if (line.find(str)==0)
{
- QString tmp=line;
+ tmp=line.c_str();
bool ok;
count=tmp.section('\'',1,1).toLong(&ok);
return ok;
else
{
cerr<<"Problem line '"<<str<<"' not found in file\n"<<endl;
- return FALSE;
+ return false;
}
} while (1);
- return TRUE;
+ return true;
}
//************************************
+bool ghs3dprl_mesh_wrap::ReadFileMSGnew(const QString FileName)
+//read file .glo with no parser xml because big file (volume)
+//no read of <receive> for speed (and so no test)
+{
+ QString tmp;
+ fstream Ff(FileName.toLatin1().constData(),ios_base::in);
+ string line;
+ long i,count,nbneighbour,ineighbour;
+ bool ok;
+
+ if (!Ff.is_open())
+ {
+ cerr<<"Problem File '"<<FileName.toLatin1().constData()<<"' not open\n"<<endl;
+ return false;
+ }
+
+ //Lit les données :
+ if (!CVW_FindString("<neighbours count=",Ff,nbneighbour)) return false;
+ if (verbose>2) cout<<"NeighboursCount="<<nbneighbour<<endl;
+ for (i=1; i<=nbneighbour; i++)
+ {
+ if (!CVW_FindString("<neighbour indice=",Ff,ineighbour)) return false;
+ if (!CVW_FindString("<vertices count=",Ff,count)) return false;
+ if (count>0){
+ med_int *tmint=new med_int[count];
+ for (int i=0; i<count; i++) Ff>>tmint[i];
+ if (verbose>4) cout<<"Vertices "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
+
+ CVWtab *montab=new CVWtab(count,tmint);
+ tmp=tmp.sprintf("MS%ld NE%ld VE SE",this->nofile,ineighbour);
+ ok=this->insert_key(tmp,montab);
+ }
+ if (!CVW_FindString("<edges count=",Ff,count)) return false;
+ if (count>0){
+ med_int *tmint=new med_int[count];
+ for (int i=0; i<count; i++) Ff>>tmint[i];
+ if (verbose>4) cout<<"Edges "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
+
+ CVWtab *montab=new CVWtab(count,tmint);
+ tmp=tmp.sprintf("MS%ld NE%ld ED SE",this->nofile,ineighbour);
+ ok=this->insert_key(tmp,montab);
+ }
+ if (!CVW_FindString("<faces count=",Ff,count)) return false;
+ if (count>0){
+ med_int *tmint=new med_int[count];
+ for (int i=0; i<count; i++) Ff>>tmint[i];
+ if (verbose>4) cout<<"Faces "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
+
+ CVWtab *montab=new CVWtab(count,tmint);
+ tmp=tmp.sprintf("MS%ld NE%ld FA SE",this->nofile,ineighbour);
+ ok=this->insert_key(tmp,montab);
+ }
+ if (!CVW_FindString("<elements count=",Ff,count)) return false;
+ if (count>0){
+ med_int *tmint=new med_int[count];
+ for (int i=0; i<count; i++) Ff>>tmint[i];
+ if (verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
+
+ CVWtab *montab=new CVWtab(count,tmint);
+ tmp=tmp.sprintf("MS%ld NE%ld EL SE",this->nofile,ineighbour);
+ ok=this->insert_key(tmp,montab);
+ }
+ }
+
+ //Ferme le fichier :
+ Ff.close();
+ this->nbfiles++;
+ return true;
+}
+
+///************************************
bool ghs3dprl_mesh_wrap::ReadFileGLO(const QString FileName)
//read file .glo with no parser xml because big file (volume)
{
QString tmp;
- fstream Ff((const char *)FileName,ios_base::in);
+ fstream Ff(FileName.toLatin1().constData(),ios_base::in);
string line;
long count;
bool ok;
if (!Ff.is_open())
{
- cerr<<"Problem File '"<<FileName<<"' not open\n"<<endl;
- return FALSE;
+ cerr<<"Problem File '"<<FileName.toLatin1().constData()<<"' not open\n"<<endl;
+ return false;
}
//Lit les données :
- if (!CVW_FindString("<vertices count=",Ff,count)) return FALSE;
- if (this->verbose>2) cout<<"VerticesCount="<<count<<endl;
+ if (!CVW_FindString("<vertices count=",Ff,count)) return false;
+ if (verbose>3) cout<<"GloVerticesCount="<<count<<endl;
if (count>0)
{
med_int *tmint=new med_int[count];
for (int i=0; i<count; i++) Ff>>tmint[i];
- if (this->verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
+ if (verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
CVWtab *montab=new CVWtab(count,tmint);
tmp=tmp.sprintf("GL%ld VE",this->nofile);
ok=this->insert_key(tmp,montab);
}
- if (!CVW_FindString("<edges count=",Ff,count)) return FALSE;
- if (this->verbose>2) cout<<"EdgesCount="<<count<<endl;
+ if (!CVW_FindString("<edges count=",Ff,count)) return false;
+ if (verbose>3) cout<<"GloEdgesCount="<<count<<endl;
if (count>0)
{
med_int *tmint=new med_int[count];
for (int i=0; i<count; i++) Ff>>tmint[i];
- if (this->verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
+ if (verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
CVWtab *montab=new CVWtab(count,tmint);
tmp=tmp.sprintf("GL%ld ED",this->nofile);
ok=this->insert_key(tmp,montab);
}
- if (!CVW_FindString("<faces count=",Ff,count)) return FALSE;
- if (this->verbose>2) cout<<"FacesCount="<<count<<endl;
+ if (!CVW_FindString("<faces count=",Ff,count)) return false;
+ if (verbose>3) cout<<"GloFacesCount="<<count<<endl;
if (count>0)
{
med_int *tmint=new med_int[count];
for (int i=0; i<count; i++) Ff>>tmint[i];
- if (this->verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
+ if (verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
CVWtab *montab=new CVWtab(count,tmint);
tmp=tmp.sprintf("GL%ld FA",this->nofile);
ok=this->insert_key(tmp,montab);
}
- if (!CVW_FindString("<elements count=",Ff,count)) return FALSE;
- if (this->verbose>2) cout<<"ElementsCount="<<count<<endl;
+ if (!CVW_FindString("<elements count=",Ff,count)) return false;
+ if (verbose>3) cout<<"GloElementsCount="<<count<<endl;
if (count>0)
{
med_int *tmint=new med_int[count];
for (int i=0; i<count; i++) Ff>>tmint[i];
- if (this->verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
+ if (verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[count-1]<<endl;
CVWtab *montab=new CVWtab(count,tmint);
tmp=tmp.sprintf("GL%ld EL",this->nofile);
//Ferme le fichier :
Ff.close();
this->nbfiles++;
- return TRUE;
+ return true;
}
//************************************
//read file .faces (wrap)
{
QString tmp;
- fstream Ff((const char *)FileName,ios_base::in);
+ fstream Ff(FileName.toLatin1().constData(),ios_base::in);
string line;
long nbelem,ntype;
bool ok;
if (!Ff.is_open())
{
- cerr<<"Problem File '"<<FileName<<"' not open\n"<<endl;
- return FALSE;
+ cerr<<"Problem File '"<<FileName.toLatin1().constData()<<"' not open\n"<<endl;
+ return false;
}
//Lit les données :
//Replace le pointeur de fichier au début :f.seekg(0);
if (getline(Ff,line))
{
- tmp=line;
+ tmp=line.c_str();
nbelem=tmp.section(' ',0,0).toLong(&ok);
}
else
{
cerr<<"Problem on first line of file"<<endl;
- return FALSE;
+ return false;
}
- if (this->verbose>2) cout<<"NumberOfElements="<<nbelem<<endl;
+ if (verbose>3) cout<<"FacesNumberOfElements="<<nbelem<<endl;
med_int *tmint=new med_int[nbelem*7];
for (int i=0; i<nbelem*7; i=i+7)
{
if (ntype!=3) //only triangles
{
cerr<<"Problem on ntype != 3"<<endl;
- return FALSE;
+ return false;
}
for (int j=0; j<7; j++) Ff>>tmint[i+j];
//for (int j=0; j<7; j++) cout<<tmint[i+j]<<' '; cout<<endl;
}
- if (this->verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[nbelem*7-1]<<endl;
+ if (verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[nbelem*7-1]<<endl;
CVWtab *montab=new CVWtab(nbelem*7,tmint);
tmp=tmp.sprintf("FC%ld",this->nofile);
Ff.close();
this->nbfiles++;
- return TRUE;
+ return true;
}
//************************************
//(parameter option of ghs3d but NOT tepal)
{
QString tmp;
- fstream Ff((const char *)FileName,ios_base::in);
+ fstream Ff(FileName.toLatin1().constData(),ios_base::in);
long ne,np,npfixe,subnumber,reste;
bool ok;
- if (!Ff.is_open())
- {
- cerr<<"Problem File '"<<FileName<<"' not open\n"<<endl;
- return FALSE;
+ if (!Ff.is_open()){
+ cerr<<"Problem File '"<<FileName.toLatin1().constData()<<"' not open\n"<<endl;
+ return false;
}
//lit les données :
Ff>>ne>>np>>npfixe;
- if (this->verbose>2)
- {
- cout<<"NumberOfElements="<<ne<<endl;
- cout<<"NumberOfVertices="<<np<<endl;
- cout<<"NumberOfSpecifiedPoints="<<npfixe<<endl;
+ if (verbose>3){
+ cout<<"NoboiteNumberOfElements="<<ne<<endl;
+ cout<<"NoboiteNumberOfVertices="<<np<<endl;
+ cout<<"NoboiteNumberOfSpecifiedPoints="<<npfixe<<endl;
}
+
for (int i=1; i<=17-3; i++) Ff>>reste;
//printf("reste %ld\n",reste);
med_int *tmint=new med_int[ne*4];
for (int i=0; i<ne*4; i++) Ff>>tmint[i];
- if (this->verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[ne*4-1]<<endl;
+ if (verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[ne*4-1]<<endl;
CVWtab *montab=new CVWtab(ne*4,tmint);
tmp=tmp.sprintf("NB%ld EV",this->nofile);
med_float *tmflo=new med_float[np*3];
for (int i=0; i<np*3; i++) Ff>>tmflo[i];
- if (this->verbose>4) cout<<"Vertices "<<tmflo[0]<<" "<<tmflo[1]<<"... "<<tmflo[np*3-1]<<endl;
+ if (verbose>4) cout<<"Vertices "<<tmflo[0]<<" "<<tmflo[1]<<"... "<<tmflo[np*3-1]<<endl;
montab=new CVWtab(np*3,tmflo);
tmp=tmp.sprintf("NB%ld VC",this->nofile);
ok=this->insert_key(tmp,montab);
Ff>>subnumber;
- if (this->verbose>2) cout<<"NumberOfSubdomains="<<subnumber<<endl;
+ if (verbose>2) cout<<"NumberOfSubdomains="<<subnumber<<endl;
tmint=new med_int[subnumber*3];
for (int i=0; i<subnumber*3; i++) Ff>>tmint[i];
- if (this->verbose>4) cout<<"Subdomains "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[subnumber*3-1]<<endl;
+ if (verbose>4) cout<<"Subdomains "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[subnumber*3-1]<<endl;
montab=new CVWtab(subnumber*3,tmint);
tmp=tmp.sprintf("NB%ld SN",this->nofile);
ok=this->insert_key(tmp,montab);
+ //swap on file if too big for memory in one cpu
+ //default 1GOctet/8(for double)/10(for arrays in memory at the same time)
+ if (np*3>this->nbelem_limit_swap)
+ this->SwapOutOfMemory_key_mesh_wrap(QRegExp("NB",Qt::CaseSensitive,QRegExp::RegExp));
//beware record 6 lenght 1
//ferme le fichier :
Ff.close();
this->nbfiles++;
- return TRUE;
+ return true;
}
//************************************
//idem ReadFileNOBOITE with read unformatted
{
bool ok;
-
+ QString tmp;
cerr<<"Problem function ReadFileNOBOITEB\n"
<<"(no FORTRAN binary format files in tepal)\n\n";
-
- QString tmp;
//file binary
- FILE *Ff=fopen((const char *)FileName,"rb");
- long ne,np,npfixe,reste,subnumber; /*,cube,npbli,
- nbele,loele,nbelef,loelef,
- nbpoi,lopoi,nbpoif,lopoif,
- nbsub,losub,nbsubf,losubf,reste;*/
+ FILE *Ff=fopen(FileName.toLatin1().constData(),"rb");
+ long ne,np,npfixe,reste,subnumber;
//http://www.math.utah.edu/software/c-with-fortran.html
//record 1 from format FORTRAN begins and ends with lengh of record
//=> 2*long(68) (68=17*4octets)
long r1[17+2];
-
- if (!Ff)
- {
- cerr<<"Problem File '"<<FileName<<"' not open\n"<<endl;
- return FALSE;
+ if (!Ff){
+ cerr<<"Problem File '"<<FileName.toLatin1().constData()<<"' not open\n"<<endl;
+ return false;
}
-
//read datas :
fread(&r1,sizeof(long),17+2,Ff);
for (long i=1; i<18; i++) cout<<"R1("<<i<<")="<<r1[i]<<endl;
- if (r1[0]!=68)
- {
- cerr<<"First FORTRAN record of File '"<<FileName<<"' not length 17*long"<<endl;
- return FALSE;
+ if (r1[0]!=68){
+ cerr<<"First FORTRAN record of File '"<<FileName.toLatin1().constData()<<"' not length 17*long"<<endl;
+ return false;
}
ne=r1[1];
np=r1[2];
npfixe=r1[3];
- if (this->verbose>2)
- {
- cout<<"NumberOfElements="<<ne<<endl;
- cout<<"NumberOfVertices="<<np<<endl;
- cout<<"NumberOfSpecifiedPoints="<<npfixe<<endl;
+ if (verbose>3){
+ cout<<"NoboitebNumberOfElements="<<ne<<endl;
+ cout<<"NoboitebNumberOfVertices="<<np<<endl;
+ cout<<"NoboitebNumberOfSpecifiedPoints="<<npfixe<<endl;
}
- ///etc...could be done if necessary not debugged
+ //etc...could be done if necessary not debugged
fread(&reste,sizeof(long),1,Ff);
long *tlong=new long[ne*4];
med_int *tmint=new med_int[ne*4];
fread(&reste,sizeof(long),1,Ff);
for (long i=0; i<ne*4; i++) tmint[i]=tlong[i];
delete tlong;
- if (this->verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[ne*4-1]<<endl;
+ if (verbose>4) cout<<"Elements "<<tmint[0]<<" "<<tmint[1]<<"... "<<tmint[ne*4-1]<<endl;
CVWtab *montab=new CVWtab(ne*4,tmint);
tmp=tmp.sprintf("NB%ld EV",this->nofile);
fread(&reste,sizeof(long),1,Ff);
for (long i=0; i<np*3; i++) tmflo[i]=tfloat[i];
delete tfloat;
- if (this->verbose>4) printf("Vertices %g %g ... %g \n",tmflo[0],tmflo[1],tmflo[np*3-1]);
+ if (verbose>4) printf("Vertices %g %g ... %g \n",tmflo[0],tmflo[1],tmflo[np*3-1]);
montab=new CVWtab(np*3,tmflo);
tmp=tmp.sprintf("NB%ld VC",this->nofile);
fread(&reste,sizeof(long),1,Ff);
fread(&subnumber,sizeof(long),1,Ff);
fread(&reste,sizeof(long),1,Ff);
- if (this->verbose>2) cout<<"NumberOfSubdomains="<<subnumber<<endl;
+ if (verbose>2) cout<<"NumberOfSubdomains="<<subnumber<<endl;
fread(&reste,sizeof(long),1,Ff);
tlong=new long[subnumber*3];
fread(tlong,sizeof(long),subnumber*3,Ff);
fread(&reste,sizeof(long),1,Ff);
- if (this->verbose>4) printf("Subdomains %ld %ld ... %ld \n",tlong[0],tlong[1],tlong[subnumber*3-1]);
+ if (verbose>4) printf("Subdomains %ld %ld ... %ld \n",tlong[0],tlong[1],tlong[subnumber*3-1]);
tmint=new med_int[subnumber*3];
for (long i=0; i<subnumber*3; i++) tmint[i]=tlong[i];
tmp=tmp.sprintf("NB%ld SN",this->nofile);
ok=this->insert_key(tmp,montab);
+ //swap on file if too big for memory in one cpu
+ //default 1GOctet/8(for double)/10(for arrays in memory at the same time)
+ if (np*3>this->nbelem_limit_swap)
+ this->SwapOutOfMemory_key_mesh_wrap(QRegExp("NB",Qt::CaseSensitive,QRegExp::RegExp));
+
//beware record 6 lenght 1
//ferme le fichier :
fclose(Ff);
this->nbfiles++;
- return TRUE;
-
+ return true;
}
//************************************
{
QString tmp;
long nb;
- Q_ULONG maxlen=128;
- Q_LONG lg;
- bool ok=TRUE;
+ long maxlen=128;
+ bool ok=true;
//Lit les données :
QFile Ff(FileName);
//NOT Raw because Raw=non-buffered file access
- ok=Ff.open(IO_ReadOnly|IO_Translate);
- if (!ok)
- {
- cerr<<"Problem File '"<<FileName<<"' not open\n"<<endl;
- return FALSE;
+ //qt3 ok=Ff.open(IO_ReadOnly|IO_Translate);
+ ok=Ff.open(QIODevice::ReadOnly|QIODevice::Text);
+ if (!ok){
+ cerr<<"Problem File '"<<FileName.toLatin1().constData()<<"' not open\n"<<endl;
+ return false;
}
-
- lg=Ff.readLine(tmp,maxlen);
- tmp=tmp.simplifyWhiteSpace();
+ tmp=Ff.readLine(maxlen);
+ tmp=tmp.simplified();
nb=tmp.toLong(&ok);
- if (!ok)
- {
- cerr<<"Problem conversion File '"<<FileName<<"\n"<<endl;
- return FALSE;
+ if (!ok){
+ cerr<<"Problem conversion File '"<<FileName.toLatin1().constData()<<"\n"<<endl;
+ return false;
}
- if (this->verbose>2) cout<<"NumberOfVertices="<<nb<<endl;
+ if (verbose>2) cout<<"NumberOfVertices="<<nb<<endl;
med_float *tmflo=new med_float[3*nb]; //coordinates
med_int *tmint=new med_int[nb]; //nrs (attribute of point)
long il3=0;
- for ( long il=0; il<nb; il++ )
- {
- lg=Ff.readLine(tmp,maxlen);
- tmp=tmp.simplifyWhiteSpace();
- //cout<<"lu '"<<tmp<<"'"<<lg<<endl;
- for ( int j=0; j<3; j++ )
- {
+ for ( long il=0; il<nb; il++ ){
+ tmp=Ff.readLine(maxlen);
+ tmp=tmp.simplified();
+ for ( int j=0; j<3; j++ ){
tmflo[il3]=tmp.section(' ',j,j).toDouble(&ok);
//cout<<"cv '"<<tmflo[il3]<<"' "<<il3<<endl;
il3++;
- if (!ok)
- {
- cerr<<"Problem conversion File '"<<FileName<<"\n"<<endl;
- return FALSE;
+ if (!ok){
+ cerr<<"Problem conversion File '"<<FileName.toLatin1().constData()<<"\n"<<endl;
+ return false;
}
}
//nrs is vertex attribute
tmint[il]=tmp.section(' ',3,3).toLong(&ok);
- if (!ok)
- {
- cerr<<"Problem conversion File '"<<FileName<<"\n"<<endl;
- return FALSE;
+ if (!ok){
+ cerr<<"Problem conversion File '"<<FileName.toLatin1().constData()<<"\n"<<endl;
+ return false;
}
}
//beware no examples with each specified points (if any) here
-
- {CVWtab *montab=new CVWtab(nb,tmint); //init montab->tmint nrs
+ CVWtab *montab=new CVWtab(nb,tmint); //init montab->tmint nrs
tmp=tmp.sprintf("PO%ld NRS",this->nofile);
- ok=this->insert_key(tmp,montab);}
+ ok=this->insert_key(tmp,montab);
- {CVWtab *montab=new CVWtab(nb,tmflo); //init montab->tmflo xyz
+ montab=new CVWtab(nb,tmflo); //init montab->tmflo xyz
tmp=tmp.sprintf("PO%ld XYZ",this->nofile);
- ok=this->insert_key(tmp,montab);}
+ ok=this->insert_key(tmp,montab);
//Ferme le fichier :
Ff.close();
this->nbfiles++;
- return TRUE;
+ return true;
}
//************************************
bool ghs3dprl_mesh_wrap::list_keys_mesh_wrap()
{
- QDictIterator<CVWtab> it( this->mestab);
- for ( ; it.current(); ++it )
- {
- string nom=it.currentKey();
- nom.resize(20,' ');
- cout<<nom<<"-> size="<<it.current()->size<<endl;
+ QHashIterator<QString,CVWtab*> it( this->mestab);
+ while ( it.hasNext() ) {
+ it.next();
+ QString nom = it.key().leftJustified(32,' ');
+ cout<<nom.toLatin1().constData()<<"-> size="<<it.value()->size<<endl;
}
- return TRUE;
+ return true;
}
//************************************
long ghs3dprl_mesh_wrap::remove_all_keys_mesh_wrap()
{
- long nb=this->remove_key_mesh_wrap(QRegExp(".",TRUE,FALSE));
+ long nb=this->remove_key_mesh_wrap(QRegExp(".",Qt::CaseSensitive,QRegExp::RegExp));
return nb;
}
long ghs3dprl_mesh_wrap::remove_key_mesh_wrap(const QRegExp &rxp)
{
long nbremove=0;
- bool remove;
- QDictIterator<CVWtab> it(this->mestab);
- for ( ; it.current(); ++it )
- {
- do
- {
- long i=it.currentKey().contains(rxp);
- remove=FALSE;
- if (i>0)
- {
- nbremove++;
- if (this->verbose>4) cout<<"remove key "<<it.currentKey()<<endl;
- delete it.current();
- this->mestab.remove(it.currentKey());
- remove=TRUE;
- }
- //All dictionary iterators that refer to the removed item
- //will be set to point to the next item
- //in the dictionary's traversal order
- } while (remove);
+ QMutableHashIterator<QString,CVWtab*> it(this->mestab);
+ while ( it.hasNext() ){
+ it.next();
+ if (it.key().contains(rxp)) {
+ nbremove++;
+ if (this->verbose>6) cout<<"remove key "<<it.key().toLatin1().constData()<<endl;
+ delete it.value();
+ it.remove();
+ }
}
return nbremove;
}
+//************************************
+long ghs3dprl_mesh_wrap::nb_key_mesh_wrap(const QRegExp &rxp)
+{
+ long nbremove=0;
+ //cout<<"nb_key_mesh_wrap on "<<endl;
+ QMutableHashIterator<QString,CVWtab*> it(this->mestab);
+ while ( it.hasNext() ){
+ it.next();
+ if (it.key().contains(rxp)) nbremove++;
+ }
+ //cout<<"nb_key_mesh_wrap found "<<nbremove<<endl;
+ return nbremove;
+}
+
//************************************
bool SwapOnFile(const QString &key,const QString &path,CVWtab *tab,int verbose)
//
{
- //return TRUE;
- if (tab->filename=="_NO_FILE")
- {
+ //return true;
+ if (tab->filename=="_NO_FILE"){
tab->filename=path+key+".tmp";
tab->filename.replace(" ","_"); //replace " " by "_"
//swap disque binaire
//montab->tmint=new long[10]; //for test
//for (int i=0; i<10; i++) montab->tmint[i]=i*2;
- FILE *fichier=fopen(tab->filename,"wb");
+ FILE *fichier=fopen(tab->filename.toLatin1().constData(),"wb");
long taille;
taille=tab->size;
fwrite(&taille,sizeof(taille),1,fichier);
- if (tab->tmint)
- {
+ if (tab->tmint){
if (verbose>3)
- cout<<"SwapOnFile in binary file "<<tab->filename<<
- " number of elements "<<taille<<
- " size_element med_int "<<sizeof(med_int)<<
- " total_size_binary " <<taille*sizeof(med_int)<<endl;
+ cout<<"SwapOnFile_binary "<<tab->filename.toLatin1().constData()<<
+ " NbElements "<<taille<<
+ " SizeElement_med_int "<<sizeof(med_int)<<
+ " TotalSizeBinary " <<taille*sizeof(med_int)<<endl;
fwrite(tab->tmint,sizeof(med_int),taille,fichier);
//fread(&gagnants,sizeof(gagnants),1,fichier);
}
- if (tab->tmflo)
- {
+ if (tab->tmflo){
if (verbose>3)
- cout<<"SwapOnFile in binary file "<<tab->filename<<
- " number of elements "<<taille<<
- " size_element med_float "<<sizeof(med_float)<<
- " total_size_binary " <<taille*sizeof(med_float)<<endl;
+ cout<<"SwapOnFile_binary "<<tab->filename.toLatin1().constData()<<
+ " NbElements "<<taille<<
+ " SizeElement_med_float "<<sizeof(med_float)<<
+ " TotalSizeBinary " <<taille*sizeof(med_float)<<endl;
fwrite(tab->tmflo,sizeof(med_float),taille,fichier);
}
fclose(fichier);
}
- else
- {
- if (verbose>3) cout<<"SwapOnFile in binary file done yet "<<tab->filename<<endl;
+ else{
+ if (verbose>3) cout<<"SwapOnFile in binary file done yet "<<
+ tab->filename.toLatin1().constData()<<endl;
}
//deallocate because swap disk binary mode
tab->CVWtab_deallocate(); //free memory
- return TRUE;
+ return true;
}
//************************************
-long ghs3dprl_mesh_wrap::SwapOutOfMemory_key_mesh_wrap(const QRegExp &rxp)
-//
+long ghs3dprl_mesh_wrap::SwapOutOfMemory_key_mesh_wrap(const QRegExp &rxp,
+ long ifgreaterthan)
+//swap on file if not yet and if size greater than ifgreaterthan
{
long nb=0;
bool ok;
- QDictIterator<CVWtab> it(this->mestab);
- for ( ; it.current(); ++it )
- {
- long i=it.currentKey().contains(rxp);
- if (i>0)
- {
+ QHashIterator<QString,CVWtab*> it(this->mestab);
+ while ( it.hasNext() ) {
+ it.next();
+ if (it.key().contains(rxp)) {
nb++;
- if (it.current()->size>0)
- ok=SwapOnFile(it.currentKey(),this->path,it.current(),this->verbose); //free memory
- //if (this->verbose) cout<<"SwapOutOfMemory key "<<it.currentKey()<<endl;
+ if ((it.value()->size>0)&&(it.value()->size>ifgreaterthan)){
+ if (verbose>3)
+ cout<<"SwapOutOfMemory_key_mesh_wrap on demand "<<
+ it.key().toLatin1().constData()<<
+ " size "<<it.value()->size<<">"<<ifgreaterthan<<endl;
+ //free memory
+ ok=SwapOnFile(it.key(),this->path,it.value(),this->verbose);
+ }
}
}
return nb;
bool ghs3dprl_mesh_wrap::list_onekey_mesh_wrap(const QString &key)
{
CVWtab *montab=this->mestab[key];
- if (montab)
- {
+ if (montab){
//cout<<"key "<<key<<"trouvee -> size="<<montab->size<<endl;
if (montab->type==1)
for ( long i=0; i<montab->size; i++ )
cout<<endl;
}
else
- cout<<"key "<<key<<" not found"<<endl;
- return TRUE;
+ cout<<"key "<<key.toLatin1().constData()<<" not found"<<endl;
+ return true;
}
//************************************
//alors swap disque dans getenv(tmp) fichier temporaire binaire
{
bool ok;
- if (this->verbose>4)
- cout<<"InsertKey "<<key<<" size="<<tab->size<<endl;
+ if (verbose>4)
+ cout<<"insert key "<<key.toLatin1().constData()<<
+ " size="<<tab->size<<endl;
tab->filename="_NO_FILE";
- if (this->nbelem_limit_swap < tab->size)
+ if (this->nbelem_limit_swap<tab->size) {
+ if (verbose>3) cout<<"insert key automatic SwapOnFile "<<
+ key.toLatin1().constData()<<endl;
ok=SwapOnFile(key,this->path,tab,this->verbose);
+ }
this->mestab.insert(key,tab);
- return TRUE;
+ return true;
}
//************************************
CVWtab* ghs3dprl_mesh_wrap::restore_key(const QString &key)
else cout<<" -> tab NULL\n";*/
if (!tab) //it is NOT a problem
{
- if (this->verbose>6) cout<<"restore_key key not found "<<key<<endl;
+ if (verbose>6) cout<<"restore key not found "<<key.toLatin1().constData()<<endl;
return NULL;
}
- if (tab->size > 0)
- {
- if (this->verbose>5) cout<<"restore_key direct from memory "<<key<<" size="<<tab->size<<endl;
+ if (tab->size > 0){
+ if (verbose>5) cout<<"restore key direct from memory "<<key.toLatin1().constData()<<" size="<<tab->size<<endl;
return tab;
}
//restore from binary file
- if ((tab->type<1)||(tab->type>2))
- {
- cerr<<"Problem restore_key from binary file "<<tab->filename<<
+ if ((tab->type<1)||(tab->type>2)){
+ cerr<<"Problem restore key from binary file "<<tab->filename.toLatin1().constData()<<
" type unexpexted "<<tab->type<<endl;
return NULL;
}
//cout<<"restore_key from binary file "<<tab->filename<<endl;
//swap disque binaire
- FILE *fichier=fopen(tab->filename,"rb");
+ FILE *fichier=fopen(tab->filename.toLatin1().constData(),"rb");
long taille;
fread(&taille,sizeof(long),1,fichier);
- if (taille!=-tab->size)
- {
- cerr<<"Problem restore_key from binary file "<<tab->filename<<
+ if (taille!=-tab->size){
+ cerr<<"Problem restore_key from binary file "<<tab->filename.toLatin1().constData()<<
" size unexpexted "<<taille<<" expected "<<-tab->size<<endl;
fclose(fichier);
return NULL;
}
- if (tab->type==1)
- {
- if (this->verbose>5)
- cout<<"restore_key from binary file "<<tab->filename<<
+ if (tab->type==1){
+ if (verbose>5)
+ cout<<"restore key from binary file "<<tab->filename.toLatin1().constData()<<
" number of elements "<<taille<<
" size_element med_float "<<sizeof(med_float)<<
" total_size_binary " <<taille*sizeof(med_float)<<endl;
tab->tmint=new med_int[taille]; //allocate memory
fread(tab->tmint,sizeof(med_int),taille,fichier);
}
- if (tab->type==2)
- {
- if (this->verbose>5)
- cout<<"restore_key from binary file "<<tab->filename<<
+ if (tab->type==2){
+ if (verbose>5)
+ cout<<"restore key from binary file "<<tab->filename.toLatin1().constData()<<
" number of elements "<<taille<<
" size_element med_float "<<sizeof(med_float)<<
" total_size_binary " <<taille*sizeof(med_float)<<endl;
{
QString key1,key2,typ="FA VE ED EL"; //pour faces vertice edges elements
CVWtab *tab1,*tab2;
- bool ok=TRUE;
+ bool ok=true;
//test send=receive
//numerotations locales sont identiques
- long nb=typ.contains(' ',TRUE) + 1; //nb chiffres detectes
+ long nb=typ.count(' ',Qt::CaseSensitive) + 1; //nb chiffres detectes
for (long i=0; i < nb; i++)
for (long ifile=1; ifile <= this->nbfiles; ifile++)
for (long ineig=1; ineig <= this->nbfiles; ineig++)
//cout<<"sortie key "<<key1<<" et key "<<key2<<endl;
if (!tab1 && !tab2) continue; //case not neighbours
if (!tab1)
- { cout<<"key "<<key1<<" inexistante avec key "<<key2<<" existante"<<endl;
- ok=FALSE;
+ { cout<<"key "<<key1.toLatin1().constData()<<" inexistante avec key "<<key2.toLatin1().constData()<<" existante"<<endl;
+ ok=false;
}
else
{
if (!tab2)
- { cout<<"key "<<key2<<" inexistante avec key "<<key1<<" existante"<<endl;
- ok=FALSE;
+ { cout<<"key "<<key2.toLatin1().constData()<<" inexistante avec key "<<key1.toLatin1().constData()<<" existante"<<endl;
+ ok=false;
}
else
if (!tab1->is_equal(tab2))
- { cout<<"key "<<key1<<" et key "<<key2<<" de contenu differents"<<endl;
- ok=FALSE;
+ { cout<<"key "<<key1.toLatin1().constData()<<" et key "<<key2.toLatin1().constData()<<" de contenu differents"<<endl;
+ ok=false;
}
}
/*else
tab2=this->restore_key(key2); //tab2=this->mestab[key2];
if (!tab1 && !tab2) continue; //case not neighbours
if (!tab1)
- { cout<<"key "<<key1<<" inexistante avec key "<<key2<<" existante"<<endl;
- ok=FALSE;
+ { cout<<"key "<<key1.toLatin1().constData()<<" inexistante avec key "<<key2.toLatin1().constData()<<" existante"<<endl;
+ ok=false;
}
else
{
if (!tab2)
- { cout<<"key "<<key2<<" inexistante avec key "<<key1<<" existante"<<endl;
- ok=FALSE;
+ { cout<<"key "<<key2.toLatin1().constData()<<" inexistante avec key "<<key1.toLatin1().constData()<<" existante"<<endl;
+ ok=false;
}
else
if ((tab1->type!=tab2->type)||(tab1->size!=tab2->size))
- { cout<<"key "<<key1<<" et key "<<key2<<" de type ou tailles differents"<<endl;
- ok=FALSE;
+ { cout<<"key "<<key1.toLatin1().constData()<<" et key "<<key2.toLatin1().constData()<<" de type ou tailles differents"<<endl;
+ ok=false;
}
}
}
{
QString key1,key2,key11,key22,key11old,key22old;
CVWtab *tab1,*tab2,*tab11,*tab22;
- bool ok=TRUE;
+ bool ok=true;
key11old="_NO_KEY";key22old="_NO_KEY";
//test size neighbourg=ifile
//numerotations locales sont differentes mais de tailles identiques
//pas besoin de verifier " RE " car deja fait au dessus
//for (int ifile=1; ifile <= this->nbfiles; ifile++)
//for (int ineig=ifile+1; ineig <= this->nbfiles; ineig++)
+ bool swap=false;
for (int ifile=this->nbfiles; ifile >= 1; ifile--)
for (int ineig=this->nbfiles; ineig >= ifile+1; ineig--)
{
if (!tab1 && !tab2) continue; //cas non voisins
if (!tab1)
{
- cerr<<"TestEqualityCoordinates key "<<key1<<" NOT existing but key "<<key2<<" existing"<<endl;
- ok=FALSE; continue;
+ cerr<<"TestEqualityCoordinates key "<<key1.toLatin1().constData()<<
+ " NOT existing but key "<<key2.toLatin1().constData()<<" existing"<<endl;
+ ok=false; continue;
}
if (!tab2)
{
- cerr<<"TestEqualityCoordinates key "<<key2<<" NOT existing but key "<<key1<<" existing"<<endl;
- ok=FALSE; continue;
+ cerr<<"TestEqualityCoordinates key "<<key2.toLatin1().constData()<<
+ " NOT existing but key "<<key1.toLatin1().constData()<<" existing"<<endl;
+ ok=false; continue;
}
if (tab1->size!=tab2->size)
{
- cerr<<"TestEqualityCoordinates key "<<key1<<" and key "<<key2<<" NOT same size"<<endl;
- ok=FALSE; continue;
+ cerr<<"TestEqualityCoordinates key "<<key1.toLatin1().constData()<<
+ " and key "<<key2.toLatin1().constData()<<" NOT same size"<<endl;
+ ok=false; continue;
}
if (ok)
{
- //Swap out of memory if no use
- if ((key11old!=key11)&&(key11old!=key22))
- this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key11old,TRUE,FALSE));
- if ((key22old!=key11)&&(key22old!=key22))
- this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key22old,TRUE,FALSE));
-
+ if (swap) {
+ //Swap out of memory if no use
+ if ((key11old!=key11)&&(key11old!=key22))
+ this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key11old,Qt::CaseSensitive,QRegExp::RegExp));
+ if ((key22old!=key11)&&(key22old!=key22))
+ this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key22old,Qt::CaseSensitive,QRegExp::RegExp));
+ }
tab11=this->restore_key(key11); //tab11=this->mestab[key11];
tab22=this->restore_key(key22); //tab22=this->mestab[key22];
+ if (tab11->size>this->nbelem_limit_swap ||
+ tab22->size>this->nbelem_limit_swap) swap=true ;
long i1,i2;
- bool ok1=TRUE;
+ bool ok1=true;
//test on equality of xyz_coordinates of commons vertices
for (long j=0; j < tab1->size-1; j++)
{
if (!CVW_is_equal_vertices(tab11,i1,tab22,i2,1))
{
cerr<<j<<" Vertice "<<i1<<" != Vertice "<<i2<<"\n"<<endl;
- ok=FALSE; ok1=FALSE;
+ ok=false; ok1=false;
}
}
- if ((this->verbose>2)&&(ok1))
+ if ((verbose>2)&&(ok1))
cout<<"TestEqualityCoordinates "<<tab1->size<<
- " Vertices "<<key1<<" and "<<key2<<" ok"<<endl;
+ " Vertices "<<key1.toLatin1().constData()<<" and "<<key2.toLatin1().constData()<<" ok"<<endl;
if (!ok1)
cerr<<"TestEqualityCoordinates "<<tab1->size<<
- " Vertices "<<key1<<" and "<<key2<<" NO_OK"<<endl;
+ " Vertices "<<key1.toLatin1().constData()<<" and "<<key2.toLatin1().constData()<<" NO_OK"<<endl;
key11old=key11; key22old=key22;
}
}
//Swap out of memory (supposed no use?)
//NO because NB1&NB2 VC supposed future use
//YES precaution
- this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key11old,TRUE,FALSE));
- this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key22old,TRUE,FALSE));
+ if (swap) {
+ this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key11old,Qt::CaseSensitive,QRegExp::RegExp));
+ this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key22old,Qt::CaseSensitive,QRegExp::RegExp));
+ }
return ok;
}
//************************************
-bool ghs3dprl_mesh_wrap::Write_MEDfiles()
+bool ghs3dprl_mesh_wrap::Find_VerticesDomainToVerticesSkin()
+//initialise correspondances vertice skin et vertices locaux pour chaque domaine
+//calcule un med_int new tab[nb_vertices_of_domain]
+//avec nieme vertice of skin=tab[ieme vertice de domain]
+//apres verification tepal garde bien dans la global numbering "GLi VE"
+//les indices initiaux des noeuds (attention: de 1 a nbNodes)
{
- bool ok=FALSE,oklocal;
- QString key1,tmp,filename;
- CVWtab *tab1,*tab2;
- med_err err;
- char namelocal[MED_TAILLE_NOM+1]; //no more 32
- char distfilename[MED_TAILLE_DESC+1];
- char description[MED_TAILLE_DESC+1];
+ QString key1,key2,tmp;
+ CVWtab *cooskin,*coodom,*glodom,*montab;
+ bool ok=true;
+ med_float *p1,*p2;
+ med_int i,nb,jd,js;
+
+ cooskin=this->restore_key(QString("SKIN_VERTICES_COORDINATES"));
+ if (verbose>4)cout<<"NumberVerticesSKIN="<<cooskin->size/3<<endl;
+ if (!cooskin) return false;
+ //ici pourrait creer BBtree sur skin
+ for (int ifile=1; ifile<=this->nbfiles; ifile++)
+ {
+ key1=key1.sprintf("NB%ld VC",ifile);
+ coodom=this->restore_key(key1);
+ if (!coodom) continue; //Problem
+ key2=key2.sprintf("GL%ld VE",ifile);
+ glodom=this->restore_key(key2);
+ if (verbose>4)
+ cout<<"NumberVerticesDOMAIN_"<<ifile<<"="<<glodom->size<<endl;
+ if (coodom->size!=glodom->size*3)
+ {
+ cerr<<"Find_VerticesDomainToVerticesSkin key "<<key1.toLatin1().constData()<<
+ " and key "<<key2.toLatin1().constData()<<" NOT coherent sizes"<<endl;
+ ok=false; continue;
+ }
+ //test on equality of xyz_coordinates of commons vertices
+ med_int *tab=new med_int[glodom->size];
+ i=0;
+ nb=0; //nb equals vertices
+ if (verbose>8){
+ cout<<"\nglobal numbering nodes: no iglo\n";
+ for (jd=0; jd < glodom->size; jd++)
+ cout<<"\t"<<jd<<"\t"<<glodom->tmint[jd]<<endl;
+ cout<<"\nresults: no i js iglo\n";
+ for (jd=0; jd < coodom->size; jd=jd+3)
+ {
+ p2=(coodom->tmflo+jd);
+ tab[i]=0;
+ //ici pourrait utiliser BBtree
+ for (js=0; js < cooskin->size; js=js+3)
+ {
+ p1=(cooskin->tmflo+js);
+ if (p1[0]==p2[0] && p1[1]==p2[1] && p1[2]==p2[2])
+ {
+ cout<<"\t"<<nb<<"\t"<<i<<"\t"<<js/3<<"\t"<<glodom->tmint[i]-1<<
+ key2.sprintf("\t%13.5e%13.5e%13.5e",p1[0],p1[1],p1[2]).toLatin1().constData()<<endl;
+ tab[i]=js/3; nb++; continue;
+ }
+ }
+ i++;
+ }
+ montab=new CVWtab(glodom->size,tab);
+ tmp=tmp.sprintf("NB%ld GL_SKIN",ifile);
+ ok=this->insert_key(tmp,montab);
+ if (verbose>4){
+ cout<<"NumberOfEqualsVerticesDOMAIN_"<<ifile<<"="<<nb<<endl;
+ }
+ }
+ }
+ return ok;
+}
+
+//fin utils procedures
+//************************************
+bool ghs3dprl_mesh_wrap::Write_masterxmlMEDfile()
+{
+ QString tmp;
+
+ //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!first call
+ if (idom==1)
+ {
+ //define master file (.xml) in memory
+ tmp=path+medname+".xml";
+ filemaster=tmp.toLatin1().constData();
+ domainname=medname.toLatin1().constData();
+ char buff[256];
+
+ //Creating the XML document
+ master_doc = xmlNewDoc(BAD_CAST "1.0");
+ root_node = xmlNewNode(0, BAD_CAST "root");
+ xmlDocSetRootElement(master_doc,root_node);
+
+ //Creating child nodes
+ //Version tag
+ med_int majeur,mineur,release;
+ //Quelle version de MED est utilisée
+ MEDversionDonner(&majeur,&mineur,&release);
+ if (verbose>0) fprintf(stdout,"Files write with MED V%d.%d.%d\n",majeur,mineur,release);
+ node = xmlNewChild(root_node, 0, BAD_CAST "version",0);
+ //xmlNewProp(node, BAD_CAST "maj", BAD_CAST int2string2(majeur).c_str());
+ xmlNewProp(node, BAD_CAST "maj", BAD_CAST i2a(majeur).c_str());
+ xmlNewProp(node, BAD_CAST "min", BAD_CAST i2a(mineur).c_str());
+ xmlNewProp(node, BAD_CAST "ver", BAD_CAST i2a(release).c_str());
+
+ //Description tag
+ node = xmlNewChild(root_node,0, BAD_CAST "description",0);
+ xmlNewProp(node, BAD_CAST "what", BAD_CAST "tetrahedral mesh by tepal");
+ time_t present;
+ time(&present);
+ struct tm *time_asc = localtime(&present);
+ sprintf(buff,"%04d/%02d/%02d %02dh%02dm",
+ time_asc->tm_year+1900,time_asc->tm_mon+1,time_asc->tm_mday,
+ time_asc->tm_hour,time_asc->tm_min);
+ xmlNewProp(node, BAD_CAST "when", BAD_CAST buff);
+ xmlNewProp(node, BAD_CAST "from", BAD_CAST "tepal2med");
+
+ //Content tag
+ node =xmlNewChild(root_node,0, BAD_CAST "content",0);
+ node2 = xmlNewChild(node, 0, BAD_CAST "mesh",0);
+ xmlNewProp(node2, BAD_CAST "name", BAD_CAST domainname.c_str());
+ info_node = xmlNewChild(node, 0, BAD_CAST "tepal2med_info",0);
+
+ //Splitting tag
+ node=xmlNewChild(root_node,0,BAD_CAST "splitting",0);
+ node2=xmlNewChild(node,0,BAD_CAST "subdomain",0);
+ xmlNewProp(node2, BAD_CAST "number", BAD_CAST i2a(nbfilestot).c_str());
+ node2=xmlNewChild(node,0,BAD_CAST "global_numbering",0);
+ xmlNewProp(node2, BAD_CAST "present", BAD_CAST "yes");
+
+ //Files tag
+ files_node=xmlNewChild(root_node,0,BAD_CAST "files",0);
+
+ //Mapping tag
+ node = xmlNewChild(root_node,0,BAD_CAST "mapping",0);
+ mesh_node = xmlNewChild(node, 0, BAD_CAST "mesh",0);
+ xmlNewProp(mesh_node, BAD_CAST "name", BAD_CAST domainname.c_str());
+ }
+
+ //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!all calls
+ {
+ char *hostname = getenv("HOSTNAME");
+ node = xmlNewChild(files_node,0,BAD_CAST "subfile",0);
+ xmlNewProp(node, BAD_CAST "id", BAD_CAST i2a(idom).c_str());
+ node2 = xmlNewChild(node, 0, BAD_CAST "name", BAD_CAST distfilename);
+ if (hostname == NULL)
+ node2 = xmlNewChild(node, 0, BAD_CAST "machine",BAD_CAST "localhost");
+ else
+ node2 = xmlNewChild(node, 0, BAD_CAST "machine",BAD_CAST hostname);
+
+ node = xmlNewChild(mesh_node,0,BAD_CAST "chunk",0);
+ xmlNewProp(node, BAD_CAST "subdomain", BAD_CAST i2a(idom).c_str());
+ node2 = xmlNewChild(node, 0, BAD_CAST "name", BAD_CAST nomfinal);
+
+ //tepal2med_info
+ node = xmlNewChild(info_node, 0, BAD_CAST "chunk",0);
+ xmlNewProp(node, BAD_CAST "subdomain", BAD_CAST i2a(idom).c_str());
+ xmlNewProp(node, BAD_CAST "nodes_number", BAD_CAST i2a(nbnodes).c_str());
+ xmlNewProp(node, BAD_CAST "faces_number", BAD_CAST i2a(nbtria3).c_str());
+ xmlNewProp(node, BAD_CAST "tetrahedra_number", BAD_CAST i2a(nbtetra4).c_str());
+ //node2 = xmlNewChild(node, 0, BAD_CAST "name", BAD_CAST nomfinal);
+
+ //node2 = xmlNewChild(node, 0, BAD_CAST "nodes", 0);
+ //xmlNewProp(node2, BAD_CAST "number", BAD_CAST i2a(nbnodes).c_str());
+ //node2 = xmlNewChild(node, 0, BAD_CAST "faces", 0);
+ //xmlNewProp(node2, BAD_CAST "number", BAD_CAST i2a(nbtria3).c_str());
+ //node2 = xmlNewChild(node, 0, BAD_CAST "tetrahedra", 0);
+ //xmlNewProp(node2, BAD_CAST "number", BAD_CAST i2a(nbtetra4).c_str());
+
+ //tepal2med_info about joints of one subdomain
+ xmlAddChild(node,joints_node);
+ //tepal2med_info about groups and families of one subdomain
+ xmlAddChild(node,families.xml_groups());
+ }
+
+ //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!last call
+ if (idom==nbfilestot)
+ {
+ node2 = xmlNewChild(info_node, 0, BAD_CAST "global",0);
+ xmlNewProp(node2, BAD_CAST "tetrahedra_number", BAD_CAST i2a(nbtetrastotal).c_str());
+ //save masterfile
+ xmlSaveFormatFileEnc(filemaster.c_str(), master_doc, "UTF-8", 1);
+ xmlFreeDoc(master_doc);
+ xmlCleanupParser();
+ }
+ return true;
+}
+
+
+//************************************
+bool ghs3dprl_mesh_wrap::Write_MEDfiles_v2(bool deletekeys)
+//deletekeys=true to delete non utils keys and arrays "au fur et a mesure"
+{
+ bool ok=true,oktmp;
+ QString tmp,cmd;
+ char description[MED_TAILLE_DESC];
+ med_int nb;
+
//remove path
- //precaution because casename->med_namelocal no more 32 character
+ //precaution because casename->med_nomfinal no more 32 character
//if path, in this->path.
//20 preserve for add postfixes "_idom" etc...
- this->casename=this->casename.section('/',-1);
- if (this->casename.length()>20)
- {
+ if (verbose>0)cout<<"\nWrite_MEDfiles_v2\n";
+ if (verbose>6){cout<<"\nInitialFamilies\n"; families.write();}
+
+ medname=medname.section('/',-1);
+ if (medname.length()>20) {
cerr<<"CaseNameMed truncated (no more 20 characters)"<<endl;
- this->casename.truncate(20);
+ medname.truncate(20);
}
- filename=this->path+this->casename;
- ofstream file(filename); //master file
- file<<"#MED Fichier V 2.3"<<" "<<endl;
- file<<"# NumbersOfSubDomains"<<" "<<endl;
- int nbdomains=this->nbfiles;
- file<<nbdomains<<" "<<endl;
+
+ //create file resume DOMAIN.joints.med of all joints for quick display (...may be...)
+ tmp=path+medname+tmp.sprintf("_joints.med",idom);
+ charendnull(distfilename,tmp,MED_TAILLE_DESC);
+ fidjoint=MEDouvrir(distfilename,MED_CREATION);
+ if (fidjoint<0) cerr<<"Problem MEDouvrir "<<distfilename<<endl;
+ if (verbose>0) cout<<"CreateMEDFile for all joints <"<<distfilename<<">\n";
+
+ //copy file source/GHS3DPRL_skin.med as destination/DOMAIN.skin.med
+ tmp=path+medname+"_skin.med";
+ cmd="cp "+pathini+casename+"_skin.med "+tmp;
+ //cout<<"Copy skin.med Command = "<<cmd<<endl;
+ system(cmd.toLatin1().constData());
+ if (verbose>0)cout<<"CreateMEDFile for initial skin <"<<tmp.toLatin1().constData()<<">\n";
+
+ //define family 0 if not existing, no groups
+ families.add("0","");
+ //define family Group_of_New_Nodes (which not exists before tetrahedra)
+ famallnodes=0;
+ if (QString("All_Nodes").contains(deletegroups)==0){
+ oktmp=families.get_number_of_new_family(1,&famallnodes,&tmp);
+ families.add(tmp,"All_Nodes");
+ }
+ else if (verbose>3) cout<<"--deletegroups matches \"All_Nodes\"\n";
+
+ famalltria3=0;
+ if (QString("All_Faces").contains(deletegroups)==0){
+ oktmp=families.get_number_of_new_family(-1,&famalltria3,&tmp);
+ families.add(tmp,"All_Faces");
+ }
+ else if (verbose>3) cout<<"--deletegroups matches \"All_Faces\"\n";
+
+ famalltetra4=0;
+ if (QString("All_Tetrahedra").contains(deletegroups)==0){
+ oktmp=families.get_number_of_new_family(-1,&famalltetra4,&tmp);
+ families.add(tmp,"All_Tetrahedra");
+ }
+ else if (verbose>3) cout<<"--deletegroups matches \"All_Tetrahedra\"\n";
+
+ famnewnodes=0;
+ if (QString("New_Nodes").contains(deletegroups)==0){
+ oktmp=families.get_number_of_new_family(1,&famnewnodes,&tmp);
+ families.add(tmp,"New_Nodes");
+ }
+ else if (verbose>3) cout<<"--deletegroups matches \"New_Nodes\"\n";
+
+ famnewtria3=0;
+ if (QString("New_Faces").contains(deletegroups)==0){
+ oktmp=families.get_number_of_new_family(-1,&famnewtria3,&tmp);
+ families.add(tmp,"New_Faces");
+ }
+ else if (verbose>3) cout<<"--deletegroups matches \"New_Faces\"\n";
+
+ famnewtetra4=0;
+ if (QString("New_Tetrahedra").contains(deletegroups)==0){
+ oktmp=families.get_number_of_new_family(-1,&famnewtetra4,&tmp);
+ families.add(tmp,"New_Tetrahedra");
+ }
+ else if (verbose>3) cout<<"--deletegroups matches \"New_Tetrahedra\"\n";
+
+ if (verbose>6){cout<<"\nIntermediatesFamilies\n"; families.write();}
+ if (verbose>6) cout<<"\nNumber0fFiles="<<nbfilestot<<endl;
+ familles intermediatesfamilies=families;
+ //initialisations on all domains
+ nbtetrastotal=0;
//loop on the domains
- for (int idom=1; idom<=nbdomains; idom++)
- {
- oklocal=TRUE;
- ostringstream suffix;
- suffix<<filename<<"_"<<idom<<".med";
- strcpy(distfilename,suffix.str().c_str());
- //tmp=filename+tmp.sprintf("_%d.med",idom);
- //strcpy(distfilename,tmp);
- if (this->verbose>0)
- {
- if (this->verbose>2) cout<<endl;
- cout<<"CreateMEDFile "<<idom<<" "<<distfilename<<endl;
+ //for (idom=1; idom<=nbfilestot; idom++) {
+ for (idom=1; idom<=nbfilestot; idom++) {
+
+ this->nofile=idom;
+ //restore initial context of families
+ if (idom>1) families=intermediatesfamilies;
+ //if (idom>1) continue;
+ tmp=path+medname+tmp.sprintf("_%d.med",idom);
+ charendnull(distfilename,tmp,MED_TAILLE_DESC);
+
+ //cout<<"<"<<distfilename<<">"<<endl;
+ fid=MEDouvrir(distfilename,MED_CREATION);
+ if (fid<0) {cerr<<"Problem MEDouvrir "<<distfilename<<endl; goto erreur;}
+ if (verbose>0){
+ if (verbose>2) cout<<endl;
+ cout<<"CreateMEDFile "<<idom<<" <"<<distfilename<<">\n";
}
+
+ //create mesh
+ tmp=medname+tmp.sprintf("_%d",idom);
+ charendnull(nomfinal,tmp,MED_TAILLE_NOM);
+ tmp=tmp.sprintf("domain %d among %d",idom,nbfilestot);
+ charendnull(description,tmp,MED_TAILLE_DESC);
+
+ if (verbose>4) cout<<"Description : "<<description<<endl;
+ err=MEDmaaCr(fid,nomfinal,3,MED_NON_STRUCTURE,description);
+ if (err<0) {cerr<<"Problem MEDmaaCr"<<nomfinal<<endl; goto erreur;}
+
+ if (!idom_nodes()) {cerr<<"Problem on Nodes"<<endl; goto erreur;}
+ if (!idom_edges()) {cerr<<"Problem on Edges"<<endl; goto erreur;}
+ if (!idom_faces()) {cerr<<"Problem on Faces"<<endl; goto erreur;}
+ if (!idom_tetras()) {cerr<<"Problem on tetrahedra"<<endl; goto erreur;}
+ if (!idom_joints()) {cerr<<"Problem on Joints"<<endl; goto erreur;}
+
+ if (verbose>6){cout<<"\nFinalsFamilies\n"; families.write();}
+ //for nodes families
+ nb=create_families(fid,1);
+ if (verbose>5)cout<<"NumberOfFamiliesNodes="<<nb<<endl;
+
+ err=MEDfamEcr(fid,nomfinal,famnodes,nbnodes,MED_NOEUD,MED_NONE);
+ if (verbose>8)
+ cout<<"MEDfamEcr nodes "<<nbnodes<<":"<<
+ famnodes[0]<<"..."<<famnodes[nbnodes-1]<<" "<<endl;
+ delete[] famnodes;
+ if (err<0) cerr<<"Problem MEDfamEcr nodes"<<endl;
- med_idt fid=MEDouvrir(distfilename,MED_CREATION);
- if (fid<0) cerr<<"Problem MEDouvrir "<<distfilename<<endl;
+ //for others families
+ nb=create_families(fid,-1);
+ if (verbose>5)cout<<"NumberOfFamiliesFacesAndEdgesEtc="<<nb<<endl;
+
+ err=MEDfamEcr(fid,nomfinal,famtria3,nbtria3,MED_MAILLE,MED_TRIA3);
+ if (verbose>8)
+ cout<<"MEDfamEcr tria3 "<<nbtria3<<":"<<
+ famtria3[0]<<"..."<<famtria3[nbtria3-1]<<" "<<endl;
+ delete[] famtria3;
+ if (err<0) cerr<<"Problem MEDfamEcr tria3"<<endl;
+
+ err=MEDfamEcr(fid,nomfinal,famtetra4,nbtetra4,MED_MAILLE,MED_TETRA4);
+ if (verbose>8)
+ cout<<"MEDfamEcr tetra4 "<<nbtetra4<<":"<<
+ famtetra4[0]<<"..."<<famtetra4[nbtria3-1]<<" "<<endl;
+ delete[] famtetra4;
+ if (err<0) cerr<<"Problem MEDfamEcr tria3"<<endl;
+
+ MEDfermer(fid); //no error
+ //master.xml writings
+ oktmp=Write_masterxmlMEDfile();
+ continue; //and loop on others domains
+
+ erreur: //error
+ ok=false;
+ MEDfermer(fid); //but loop on others domains
- //updating the ascii master description file
- tmp=tmp.sprintf(this->casename+"_%d",idom);
- file<<this->casename<<" "<<idom<<" "<<
- tmp<<" "<<"localhost "<<distfilename<<" "<<endl;
+ }
+ MEDfermer(fidjoint); //no error
+ if (verbose>0)cout<<"\nTotalNumberOftetrahedra="<<nbtetrastotal<<endl;
- //create mesh
- strcpy(namelocal,tmp);
- tmp=tmp.sprintf("domain %d among %d",idom,nbdomains);
- strcpy(description,tmp);
- if (this->verbose>4) cout<<"File "<<distfilename<<" : "<<description<<endl;
- //cout<<namelocal<<":"<<description<<endl
- err=MEDmaaCr(fid,namelocal,3,MED_NON_STRUCTURE,description);
- if (err<0) cerr<<"Problem MEDmaaCr"<<endl;
+ return ok;
+}
+
+//************************************
+bool ghs3dprl_mesh_wrap::idom_nodes()
+{
+ bool ok=true;
+ QString tmp,key,key1,key2,key3;
+ CVWtab *tab,*tab1,*tab2,*tab3;
+ med_int i,j,*arrayi;
+ int xx;
//writing node(vertices) coordinates
//NBx VC=files.NoBoite Vertex Coordinates
- // 123456789012345612345678901234561234567890123456
- char nomcoo[3*MED_TAILLE_PNOM+1]="x y z ";
- char unicoo[3*MED_TAILLE_PNOM+1]="? ? ? ";
- key1=key1.sprintf("NB%d VC",idom); //files.NoBoite Vertex Coordinates
- tab1=this->restore_key(key1); //tab1=this->mestab[key1];
- med_int nbnodes=tab1->size/3;
-
- /*(med_idt fid, char *maa, med_int mdim, med_float *coo,
- med_mode_switch mode_switch, med_int n,
- med_repere type_rep, char *nom, char *unit)*/
- err=MEDcoordEcr(fid,namelocal,3,tab1->tmflo,MED_FULL_INTERLACE,
- nbnodes,MED_CART,nomcoo,unicoo);
- if (err<0) cerr<<"Problem MEDcoordEcr"<<endl;
- if (this->verbose>4)cout<<"NumberOfNodes="<<nbnodes<<endl;
- this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key1,TRUE,FALSE));
+ key=key.sprintf("NB%d VC",idom); //files.NoBoite Vertex Coordinates
+ tab=this->restore_key(key); //tab1=this->mestab[key1];
+ if (!tab) {
+ tmp=pathini+casename+tmp.sprintf(format.toLatin1().constData(),nbfilestot,idom)+".noboite";
+ ok=this->ReadFileNOBOITE(tmp);
+ tab=this->restore_key(key); //tab1=this->mestab[key1];
+ if (!tab) return false;
+ }
+ tmp=tmp.sprintf("NB%d SN",idom);
+ //qt3 xx=this->remove_key_mesh_wrap(QRegExp(tmp,true,true));
+ xx=this->remove_key_mesh_wrap(QRegExp(tmp,Qt::CaseSensitive,QRegExp::RegExp));
+ nbnodes=tab->size/3;
+ err=MEDcoordEcr(fid,nomfinal,3,tab->tmflo,MED_FULL_INTERLACE,
+ nbnodes,MED_CART,nomcoo,unicoo);
+ if (err<0) {cerr<<"Problem MEDcoordEcr"<<endl; return false;}
+ if (verbose>4)cout<<"NumberOfNodes="<<nbnodes<<endl;
//writing indices of nodes
- med_int *arrayi=new med_int[nbnodes];
- for (long i=0; i<nbnodes ; i++) arrayi[i]=i+1;
- med_2_2::med_geometrie_element medgeoele0=(med_2_2::med_geometrie_element) 0;
- err=MEDnumEcr(fid,namelocal,arrayi,nbnodes,MED_NOEUD,medgeoele0);
- if (err<0) cerr<<"Problem MEDnumEcr of nodes"<<endl;
+ arrayi=new med_int[nbnodes];
+ for (i=0; i<nbnodes ; i++) arrayi[i]=i+1;
+ err=MEDnumEcr(fid,nomfinal,arrayi,nbnodes,MED_NOEUD,MED_NONE);
delete[] arrayi;
+ if (err<0) {cerr<<"Problem MEDnumEcr of nodes"<<endl; return false;}
- //writing connectivity of faces triangles of wrap by nodes
- key1=key1.sprintf("FC%d",idom); //files.FaCes faces (wrap and triangles only)
+ key1=key1.sprintf("GL%d VE",idom); //global numerotation
tab1=this->restore_key(key1); //tab1=this->mestab[key1];
- med_int nbfaces=tab1->size/7;
- if (this->verbose>4) cout<<"NumberOfTrianglesOfWrap="<<nbfaces<<endl;
- arrayi=new med_int[nbfaces*3];
- long ii=0,i=0 ;
- for (long j=0; j<nbfaces ; j++)
- {
- arrayi[ii]=tab1->tmint[i]; ii++;
- arrayi[ii]=tab1->tmint[i+1]; ii++;
- arrayi[ii]=tab1->tmint[i+2]; ii++;
- i=i+7;
+ if (!tab1) {
+ tmp=pathini+casename+tmp.sprintf(format.toLatin1().constData(),nbfilestot,idom)+".glo";
+ ok=this->ReadFileGLO(tmp);
+ if (!ok) {cerr<<"Problem file "<<tmp.toLatin1().constData()<<endl; return false;}
+ tab1=this->restore_key(key1); //tab1=this->mestab[key1];
+ if (!tab1) return false;
}
- err=MEDconnEcr(fid,namelocal,3,arrayi,MED_FULL_INTERLACE,nbfaces,MED_FACE,MED_TRIA3,MED_NOD);
- if (err<0) cerr<<"Problem MEDconnEcr for triangles connectivity"<<endl;
- delete[] arrayi;
+ if (nbnodes!=tab1->size){cerr<<"Problem size GLi VE!=nbnodes!"<<endl; return false;}
+
+ key2=key2.sprintf("SKIN_VERTICES_FAMILIES",idom); //on global numerotation
+ tab2=this->restore_key(key2); //tab1=this->mestab[key1];
+ med_int nbskin=tab2->size;
+ //for (i=0; i<nbskin; i++) cout<<i<<" "<<tab2->tmint[i]<<endl;
+
+ //set families of nodes existing in GHS3DPRL_skin.med
+ med_int nb=nbnodes;
+ famnodes=new med_int[nb];
+ for (i=0; i<nb ; i++) famnodes[i]=famallnodes;
+ med_int * fammore=new med_int[nb];
+ for (i=0; i<nb ; i++) fammore[i]=famnewnodes;
+
+ //set families of nodes of skin
+ for (i=0; i<nb ; i++){
+ j=tab1->tmint[i]-1; //
+ if (j<nbskin){
+ fammore[i]=tab2->tmint[j];
+ }
+ }
+ ok=set_one_more_family(famnodes,fammore,nb);
+ delete[] fammore;
- //writing indices of faces triangles of wrap
- //caution!
- //generate "overlapping of numbers of elements" in "import med file" in salome
- //if not in "//writing indices of tetraedes" -> arrayi[i]=!NBFACES!+i+1
- arrayi=new med_int[nbfaces];
- for (long i=0; i<nbfaces ; i++) arrayi[i]=i+1;
- err=MEDnumEcr(fid,namelocal,arrayi,nbfaces,MED_FACE,MED_TRIA3);
- if (err<0) cerr<<"Problem MEDnumEcr of triangles"<<endl;
- delete[] arrayi;
+ //cout<<"nodes loc "<<i<<" = gl "<<j<<"\t << "<<tab2->tmint[j]<<
+ // tmp.sprintf("\t%23.15e%23.15e%23.15e",tab3->tmflo[i*3],
+ // tab3->tmflo[i*3+1],tab3->tmflo[i*3+2])<<endl;
- //create global family wrap default
- char nomfam[MED_TAILLE_NOM+1]="PART_OF_GLOBAL_WRAP";
- char attdes[MED_TAILLE_DESC+1]="part of wrap of global volume";
- char gro[MED_TAILLE_LNOM+1]="PART_OF_GLOBAL_WRAP";
- med_int numfam,attide,attval,natt,ngro,numfam_ini_wrap=200;
- //caution numfam_ini_wrap!=numfam_ini_nodes
- numfam=-numfam_ini_wrap; attide=1; attval=numfam; natt=1; ngro=1;
- err=MEDfamCr(fid,namelocal,nomfam,numfam,&attide,&attval,attdes,natt,gro,ngro);
- if (err<0) cerr<<"Problem MEDfamCr of "<<nomfam<<endl;
+ //writing nodes(vertices) global numbering
+ err=MEDglobalNumEcr(fid,nomfinal,tab1->tmint,nbnodes,MED_NOEUD,MED_NONE);
+ if (err<0){cerr<<"Problem MEDglobalNumEcr nodes"<<endl; return false;}
- //for joints
- //init default indices of families of faces triangles of wrap = -numfam_ini_wrap
- //(for faces not in joints=PART_OF_GLOBAL_WRAP, why not!)
- //others -> -numfam_ini_wrap-indice_of_neighbourg ([1;number_of_neighbourg])
- //(for existing joints)
- int sizefamilies=nbfaces;
- med_int *familiesi=new med_int[sizefamilies];
- for (int i=0; i<sizefamilies ; i++) familiesi[i]=-numfam_ini_wrap;
-
- //families known in faces in wrap PART_OF_GLOBAL_WRAP
- //writing indices of families of faces triangles of wrap = nsd why not?
- //not implemented yet because subdomain(s) of family PART_OF_GLOBAL_WRAP
- /*arrayi=new med_int[nbfaces];
- for (int i=0; i<nbfaces ; i++) arrayi[i]=tab1->tmint[(i*7)+3];
- err=MEDfamEcr(fid,namelocal,arrayi,nbfaces,MED_FACE,MED_TRIA3);
- if (err<0) cerr<<"Problem MEDfamEcr faces of wrap"<<endl;
- delete[] arrayi;*/
-
- //writing connectivity of tetraedes by nodes
- key1=key1.sprintf("NB%d EV",idom); //files.NoBoite Elements Vertices (tetra only)
- tab1=this->restore_key(key1); //tab1=this->mestab[key1];
- med_int nbtetras=tab1->size/4;
- if (this->verbose>4) cout<<"NumberOfTetraedes="<<nbtetras<<endl;
- //arrayi=new med_int[tab1->size];
- //for (long i=0; i<tab1->size ; i++) arrayi[i]=tab1->tmint[i];
- err=MEDconnEcr(fid,namelocal,3,tab1->tmint,MED_FULL_INTERLACE,nbtetras,MED_MAILLE,MED_TETRA4,MED_NOD);
- if (err<0) cerr<<"Problem MEDconnEcr for tetra connectivity"<<endl;
- //delete[] arrayi;
- this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key1,TRUE,FALSE));
-
- //writing indices of tetraedes
- arrayi=new med_int[nbtetras];
- for (long i=0; i<nbtetras ; i++) arrayi[i]=nbfaces+i+1;
- err=MEDnumEcr(fid,namelocal,arrayi,nbtetras,MED_MAILLE,MED_TETRA4);
- if (err<0) cerr<<"Problem MEDnumEcr of tetraedes"<<endl;
- delete[] arrayi;
+ return ok;
+}
- //writing indices of families of nodes = nrs why not?
- //before create families of nodes fonction of existing values of nrs of files .points
- arrayi=new med_int[nbnodes];
- key1=key1.sprintf("PO%d NRS",idom); //files.POints Vertex of wrap
- tab1=this->restore_key(key1); //tab1=this->mestab[key1];
- med_int nbwrap=tab1->size;
- //families known in points in wrap
- //more than 30 families is stupid? (too many)?
- int itest,i2,ifam[30],imax=1,imess=0,numfam_ini_nodes=numfam_ini_wrap-100;
- //caution numfam_ini_wrap!=numfam_ini_nodes
- //ifam[:]<-existing values of nrs (in [0,97])
- //ifam[0]<-first family default=99 for new nodes IN volume (out of wrap)
- ifam[0]=99;
- for (int i=0; i<nbwrap ; i++)
- {
- itest=tab1->tmint[i];
- if ((itest<0)||(itest>97))
- {
- if (imess==0)
- {
- cerr<<"Problem for domain "<<idom<<" nrs="<<itest<<
- " shoud be in [0;97] forced 98"<<endl;
- imess=1; //message only once
- }
- itest=98; //0<=nrs<=97 precaution 98=family garbage
+/*
+//************************************
+bool ghs3dprl_mesh_wrap::set_one_more_family_old(med_int *fami, med_int *more, med_int nb)
+//fuse array of med_int families more et fami as kind of groups
+//because there are possibilities of intersections
+{
+ QString tmp;
+ med_int i,newfam,morfam,oldfam;
+ for (i=0; i<nb ; i++) {
+ if (more[i]==0) continue;
+ if (fami[i]==0) {
+ fami[i]=more[i];
+ //cout<<"sur "<<i<<" en plus "<<more[i]<<endl;
+ }
+ else { //intersection
+ if (fami[i]==more[i]) continue; //same families
+ oldfam=fami[i];
+ morfam=more[i];
+ //create new family intersection if needed
+ newfam=families.find_family_on_groups(oldfam,morfam);
+ //cout<<"oldfam "<<oldfam<<" morfam "<<morfam<<" -> newfam "<<newfam<<endl;
+ fami[i]=newfam;
+ }
+ }
+ return true;
+}*/
+
+//************************************
+bool ghs3dprl_mesh_wrap::set_one_more_family(med_int *fami, med_int *more, med_int nb)
+//fuse array of med_int families more et fami as kind of groups
+//because there are possibilities of intersections
+{
+ QString tmp;
+ med_int i,ii,j,newfam,morfam,oldfam,morfami,oldfami,i_zero,nb_fam,nb_max,nb_tot,nb_mess;
+ med_int *newfami;
+
+ nb_fam=families.fam.size(); //on families negative and positive
+ //cout<<"size families "<<nb_fam<<endl;
+ if (nb_fam<=0) nb_fam=5; //precaution
+ i_zero=nb_fam*2; //offset for negative indices of families
+ nb_max=nb_fam*4;
+ if (nb_fam>300) cout<<
+ "***set_one_more_family*** warning many initial families could decrease speed "<<nb_fam<<endl;
+ nb_tot=nb_max*nb_max; //max oversizing *2 on families
+ //newfami is for speed (avoid calls find_family_on_groups)
+ //it is an array[nb_fam*4][nb_fam*4] implemented on vector[nb_max]
+ //to memorize newfam in array[oldfam][morfam]
+ newfami=new med_int[nb_tot];
+ for (i=0; i<nb_tot ; i++) newfami[i]=0; //not yet met!
+
+ nb_mess=0;
+ for (i=0; i<nb ; i++) {
+ if (more[i]==0) continue;
+ if (fami[i]==0) {
+ fami[i]=more[i];
+ //cout<<"sur "<<i<<" en plus "<<more[i]<<endl;
+ }
+ else { //intersection
+ if (fami[i]==more[i]) continue; //same families
+ oldfam=fami[i]; oldfami=oldfam+i_zero;
+ morfam=more[i]; morfami=morfam+i_zero;
+ //not yet met?
+ ii=oldfami+morfami*nb_max; //array 2d on vector
+ if ((ii>=0)&&(ii<nb_tot)) {
+ newfam=newfami[ii];
}
- arrayi[i]=-numfam_ini_nodes-itest;
- i2=0;
- while (1)
- {
- if (i2==imax)
- {
- ifam[imax]=itest ; imax++ ; break;
+ else {
+ if (nb_mess<3) {
+ nb_mess++;
+ cout<<"***set_one_more_family*** warning many new families decrease speed "<<nb_fam<<endl;
}
- if (itest==ifam[i2]) break;
- i2++;
- if (i2>=30) break;
+ ii=-1;
+ newfam=0;
}
- if (imax>=30) {
- cerr<<"Problem more than 30 families of nodes"<<endl;
- break;
+ if (newfam==0) {
+ //create new family intersection if needed
+ newfam=families.find_family_on_groups(oldfam,morfam);
+ //cout<<"new oldfam "<<oldfam<<" morfam "<<morfam<<" -> newfam "<<newfam<<endl;
+ if (ii>=0) newfami[ii]=newfam;
}
+ /*else {
+ cout<<"!!! oldfam "<<oldfam<<" morfam "<<morfam<<" -> newfam "<<newfam<<endl;
+ }*/
+ fami[i]=newfam;
}
- for (int i=0 ; i<imax ; i++)
- {
- //create families of nodes as nrs
- if (i==0)
- tmp=tmp.sprintf("IN_VOLUME");
- else
- tmp=tmp.sprintf("NRS_%d",ifam[i]);
- strcpy(nomfam,tmp);
- if (this->verbose>2) cout<<"CreateFamilyOfNodes_"<<nomfam<<endl;
- strcpy(gro,tmp);
- if(i==0)
- tmp=tmp.sprintf("nodes in local volume");
- else
- tmp=tmp.sprintf("nodes of nrs_%d on local wrap",ifam[i]);
- strcpy(attdes,tmp);
- numfam=-numfam_ini_nodes-ifam[i];
- //attide=1;
- attval=numfam;
- //natt=1;
- ngro=1;
- if (this->verbose>4) cout<<"MEDfamCr (nodes) of "<<nomfam<<" / "<<attdes<<" / FamilyNumber="<<numfam<<endl;
- err=MEDfamCr(fid,namelocal,nomfam,numfam,&attide,&attval,attdes,natt,gro,ngro);
- if (err<0) cerr<<"Problem MEDfamCr of "<<nomfam<<endl;
- }
- //defaults ifam[0] for new points in new volume
- for (int i=nbwrap; i<nbnodes ; i++) arrayi[i]=-numfam_ini_nodes-ifam[0];
+ }
+ delete[] newfami;
+ return true;
+}
- err=MEDfamEcr(fid,namelocal,arrayi,nbnodes,MED_NOEUD,medgeoele0);
- if (err<0) cerr<<"Problem MEDfamEcr nodes"<<endl;
- delete[] arrayi;
+//************************************
+bool ghs3dprl_mesh_wrap::idom_edges()
+{
+ bool ok=true;
+ QString tmp;
+ nbseg2=0;
+ return ok;
+}
-/*Le nom du maillage local est une chaîne de MED_TAILLE_NOM (32) caractères.
- Le tableau des numéros "num" est un tableau à 1 dimension de taille égale à "n".
- Les numéros globaux sont obligatoirement supérieur à 1
- Le type de l'entite "typent" est soit MED_NOEUD,MED_MAILLE, MED_FACE ou MED_ARETE.
- Le type géométrique peut être :
- Pour les noeuds : 0.
- Pour les mailles : MED_POINT1, MED_SEG2, MED_SEG3, MED_TRIA3, MED_TRIA6, MED_QUAD4, MED_QUAD8, MED_POLYGONE.
- Pour les faces : MED_TRIA3, MED_TRIA6, MED_QUAD4, MED_QUAD8, MED_POLYGONE.
- Pour les arêtes : MED_SEG2 et MED_SEG3.*/
+//************************************
+bool ghs3dprl_mesh_wrap::idom_faces()
+{
+ bool ok=true;
+ QString tmp,key,key1,key2,key3;
+ CVWtab *tab,*tab1,*tab2,*tab3;
+ med_int ii,i,j,*arrayi;
+ int xx;
- //writing nodes(vertices) global numbering
- //GLx VE=files.GLo VErtices
- key1=key1.sprintf("GL%d VE",idom);
+ //writing connectivity of faces triangles of wrap by nodes
+ key1=key1.sprintf("FC%d",idom); //files.FaCes faces (wrap and triangles only)
tab1=this->restore_key(key1); //tab1=this->mestab[key1];
- nbnodes=tab1->size;
- if (this->verbose>2)
- cout<<"CreateMEDglobalNumerotation_Nodes "<<key1<<" "<<tab1->size<<endl;
- if (nbnodes<=0) cerr<<"Problem MEDglobalNumEcr not in memory"<<endl;
- //arrayi=new med_int[nbnodes];
- //for (int i=0; i<tab1->size ; i++) arrayi[i]=tab1->tmint[i];
- //med_2_2::med_geometrie_element toto=MED_POINT1;
- //cout<<"MED_POINT1="<<toto<<" medgeoele0="<<medgeoele0<<endl;
- /*MEDglobalNumEcr(med_idt fid, char *maa, med_int *num, med_int n,
- med_entite_maillage type_ent, med_geometrie_element type_geo)*/
- err=MEDglobalNumEcr(fid,namelocal,tab1->tmint,nbnodes,MED_NOEUD,medgeoele0);
- if (err<0) cerr<<"Problem MEDglobalNumEcr nodes"<<endl;
- //cout<<"MEDglobalNumEcr vertices size="<<nbnodes<<endl;
- //delete[] arrayi;
- this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key1,TRUE,FALSE));
+ if (!tab1) {
+ tmp=pathini+casename+tmp.sprintf(format.toLatin1().constData(),nbfilestot,idom)+".faces";
+ ok=this->ReadFileFACES(tmp);
+ tab1=this->restore_key(key1);
+ if (!tab1) return false;
+ }
+ nbtria3=tab1->size/7;
+ if (verbose>4) cout<<"NumberOfTriangles="<<nbtria3<<endl;
+ arrayi=new med_int[nbtria3*3];
+ ii=0,i=0 ;
+ for (j=0; j<nbtria3 ; j++){
+ arrayi[ii]=tab1->tmint[i]; ii++;
+ arrayi[ii]=tab1->tmint[i+1]; ii++;
+ arrayi[ii]=tab1->tmint[i+2]; ii++;
+ i=i+7;
+ }
+ err=MEDconnEcr(fid,nomfinal,3,arrayi,MED_FULL_INTERLACE,nbtria3,MED_MAILLE,MED_TRIA3,MED_NOD);
+ delete[] arrayi; //need immediately more little array
+ if (err<0){cerr<<"Problem MEDconnEcr for triangles connectivity"<<endl; return false;}
+
+ //writing indices of faces triangles of wrap
+ //caution!
+ //generate "overlapping of numbers of elements" in "import med file" in salome
+ //if not in "//writing indices of tetrahedra" -> arrayi[i]=!NBFACES!+i+1
+ arrayi=new med_int[nbtria3];
+ for (i=0; i<nbtria3 ; i++) arrayi[i]=nbseg2+i+1;
+ err=MEDnumEcr(fid,nomfinal,arrayi,nbtria3,MED_MAILLE,MED_TRIA3);
+ delete[] arrayi;
+ if (err<0){cerr<<"Problem MEDnumEcr of triangles"<<endl; return false;}
- //writing faces(triangles) global numbering
//GLx FA=files.GLo FAces
key1=key1.sprintf("GL%d FA",idom);
tab1=this->restore_key(key1); //tab1=this->mestab[key1];
- nbfaces=tab1->size;
- //arrayi=new med_int[nbfaces];
- //for (int i=0; i<tab1->size ; i++) arrayi[i]=tab1->tmint[i];
- if (this->verbose>2)
- cout<<"CreateMEDglobalNumerotation_Faces "<<key1<<" "<<tab1->size<<endl;
- err=MEDglobalNumEcr(fid,namelocal,tab1->tmint,nbfaces,MED_FACE,MED_TRIA3);
- if (err<0) cerr<<"Problem MEDglobalNumEcr faces"<<endl;
- //cout<<"MEDglobalNumEcr faces size="<<nbfaces<<endl;
- //delete[] arrayi;
- this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key1,TRUE,FALSE));
-
- //writing tetraedes global numbering
- //GLx EL=files.GLo ELements
- key1=key1.sprintf("GL%d EL",idom);
- tab1=this->restore_key(key1); //tab1=this->mestab[key1];
- med_int nbtetrasglo=tab1->size;
- if (nbtetrasglo!=nbtetras)
- cerr<<"Problem incorrect size of tetraedes global numbering"<<endl;
- //arrayi=new med_int[nbtetrasglo];
- //for (int i=0; i<tab1->size ; i++) arrayi[i]=tab1->tmint[i];
- if (this->verbose>2)
- cout<<"CreateMEDglobalNumerotation_Tetraedes "<<key1<<" "<<tab1->size<<endl;
- err=MEDglobalNumEcr(fid,namelocal,tab1->tmint,nbtetrasglo,MED_MAILLE,MED_TETRA4);
- if (err<0) cerr<<"Problem MEDglobalNumEcr tetraedes"<<endl;
- //cout<<"MEDglobalNumEcr tetraedes size="<<nbtetrasglo<<endl;
- //delete[] arrayi;
- this->SwapOutOfMemory_key_mesh_wrap(QRegExp(key1,TRUE,FALSE));
+ if (nbtria3!=tab1->size){cerr<<"Problem size GLi FA!=nbtria3!"<<endl; return false;}
+
+ key2=key2.sprintf("SKIN_TRIA3_FAMILIES",idom); //on global numerotation
+ tab2=this->restore_key(key2); //tab1=this->mestab[key1];
+ med_int nbskin=tab2->size;
+
+ //set families of faces existing in GHS3DPRL_skin.med
+ med_int nb=nbtria3;
+ famtria3=new med_int[nb];
+ for (i=0; i<nb ; i++) famtria3[i]=famalltria3;
+ med_int * fammore=new med_int[nb];
+ for (i=0; i<nb ; i++) fammore[i]=famnewtria3;
+
+ //set families of faces of skin
+ for (i=0; i<nb ; i++){
+ j=tab1->tmint[i]-1; //
+ if (j<nbskin){
+ fammore[i]=tab2->tmint[j];
+ }
+ }
+ ok=set_one_more_family(famtria3,fammore,nb);
+ delete[] fammore;
- //writing joints
- for (int ineig=1; ineig <= this->nbfiles; ineig++)
- {
- char namejnt[MED_TAILLE_NOM+1]; //no more 32
- char namedist[MED_TAILLE_NOM+1];
- char descjnt[MED_TAILLE_DESC+1];
+ //writing faces(triangles) global numbering
+ //if (verbose>2)
+ // cout<<"CreateMEDglobalNumerotation_Faces "<<key1<<" "<<tab1->size<<endl;
+ err=MEDglobalNumEcr(fid,nomfinal,tab1->tmint,tab1->size,MED_MAILLE,MED_TRIA3);
+ if (err<0){cerr<<"Problem MEDglobalNumEcr faces"<<endl; return false;}
+
+ //xx=this->remove_key_mesh_wrap(QRegExp("FC*",true,true));
+ tmp=tmp.sprintf("GL%d FA",idom);
+ //qt3 xx=this->remove_key_mesh_wrap(QRegExp(tmp,true,true));
+ xx=this->remove_key_mesh_wrap(QRegExp(tmp,Qt::CaseSensitive,QRegExp::RegExp));
+ tmp=tmp.sprintf("GL%d VE",idom);
+ //qt3 xx=this->remove_key_mesh_wrap(QRegExp(tmp,true,true));
+ xx=this->remove_key_mesh_wrap(QRegExp(tmp,Qt::CaseSensitive,QRegExp::RegExp));
+
+ return ok;
+}
+//************************************
+bool ghs3dprl_mesh_wrap::idom_joints()
+{
+ bool ok=true;
+ QString tmp,namejoint,key,key1,key2;
+ CVWtab *tab,*tab1,*tab2;
+ med_int ineig,ii,jj,i,j,k,*arrayi,nb,famjoint,*fammore,*inodes,*arrayfaces;
+ med_float *arraynodes;
+ char namejnt[MED_TAILLE_NOM+1]; //no more 32
+ char namedist[MED_TAILLE_NOM+1];
+ char descjnt[MED_TAILLE_DESC+1];
+ med_int numfam_ini_wrap=100;
+ joints_node=xmlNewNode(NULL, BAD_CAST "joints"); //masterfile.xml
+ med_int nbjoints=0,nbnodesneig,nbtria3neig;
+ string sjoints=""; //which domains are neighbourg
+ int xx;
+
+ tmp=tmp.sprintf("MS%d *",idom);
+ //read file .msg if not done
+ //qt3 if (this->nb_key_mesh_wrap(QRegExp(tmp,true,true))<=0) {
+ if (this->nb_key_mesh_wrap(QRegExp(tmp,Qt::CaseSensitive,QRegExp::RegExp))<=0) {
+ this->nofile=idom;
+ /*old version with xml parser too slow
+ ghs3dprl_msg_parser handler;
+ handler.mailw=this;
+ QXmlSimpleReader reader;
+ reader.setContentHandler(&handler);
+ tmp=pathini+casename+tmp.sprintf(format,nbfilestot,idom)+".msg";
+ QFile File(tmp);
+ QXmlInputSource source(&File);
+ reader.parse(source);
+ File.close();*/
+ tmp=pathini+casename+tmp.sprintf(format.toLatin1().constData(),nbfilestot,idom)+".msg";
+ ok=this->ReadFileMSGnew(tmp);
+ if (!ok) {
+ cerr<<"Problem in file "<<tmp.toLatin1().constData()<<endl;
+ return false;
+ }
+ }
+
+ //writing joints
+ for (ineig=1; ineig <= nbfilestot; ineig++) {
if (idom==ineig) continue; //impossible
+
+ //!*************nodes
+ //cout<<"\n nodes joints\n";
key1=key1.sprintf("MS%d NE%d VE SE",idom,ineig); //SE or RE?
- tab1=this->restore_key(key1);
+ tab1=restore_key(key1);
if (!tab1) continue; //case (ifile,ineig) are not neighbours=>no joints
key1=key1.sprintf("MS%d NE%d VE RE",idom,ineig); //SE or RE
tab2=tab1; //tab2=this->restore_key(key1); //no need because <send> equals <receive>
if (!tab2) cerr<<"Problem nodes joint <send> with no <receive> in file .msg"<<endl;
- nbnodes=tab1->size;
-
- if (this->verbose>4)
- cout<<"NumberOfNodesOfJoint_"<<ineig<<"="<<nbnodes<<endl;
- strcpy(namejnt,tmp.sprintf("joint_%d",ineig));
- tmp=tmp.sprintf("joint_%d among %d domains of ",ineig,nbdomains)+namelocal;
- strcpy(descjnt,tmp);
- //cout<<descjnt<<endl;
- strcpy(namedist,tmp.sprintf("joint_%d",idom)); //or this->casename+"_%d",ineig));
- err=MEDjointCr(fid,namelocal,namejnt,descjnt,ineig,namedist);
+ nb=tab1->size; nbnodesneig=nb;
+
+ nbjoints++; //one more joint for this domain
+ sjoints=sjoints+" "+i2a(ineig);
+ if (verbose>4)
+ cout<<"NumberOfNodesOfJoint_"<<idom<<"_"<<ineig<<"="<<nb<<endl;
+ namejoint=namejoint.sprintf("JOINT_%d_%d_Nodes",idom,ineig);
+ strcpy(namejnt,namejoint.toLatin1().constData());
+ tmp=tmp.sprintf("JOINT_%d_%d among %d domains of ",idom,ineig,nbfilestot)+nomfinal;
+ strcpy(descjnt,tmp.toLatin1().constData());
+ tmp=medname+tmp.sprintf("_%d",ineig);
+ strcpy(namedist,tmp.toLatin1().constData());
+ err=MEDjointCr(fid,nomfinal,namejnt,descjnt,ineig,namedist);
if (err<0) cerr<<"Problem MEDjointCr"<<endl;
+ ok=families.get_number_of_new_family(1,&famjoint,&tmp);
+ families.add(tmp,namejoint);
+
+ key=key.sprintf("NB%d VC",idom); //files.NoBoite Vertex Coordinates
+ tab=this->restore_key(key); //tab1=this->mestab[key1];
+ //nbnodes=tab->size/3;
+
//writing correspondence nodes-nodes
//two indices for one correspondence
- arrayi=new med_int[nbnodes*2];
- ii=0;
- for (int i=0; i<nbnodes ; i++)
- {
+ arrayi=new med_int[nb*2];
+ arraynodes=new med_float[nbnodesneig*3]; //for file DOMAIN_join.med
+ inodes=new med_int[nbnodes]; //for file DOMAIN_join.med
+ med_int * fammore=new med_int[nbnodes];
+ for (i=0; i<nbnodes ; i++) {fammore[i]=0; inodes[i]=-1;}
+ ii=0; jj=0; k=0;
+ for (i=0; i<nb ; i++){
//no need because <send> equals <receive> tab1->tmint[i]==tab2->tmint[i]
+ j=tab1->tmint[i]-1; //contents of tab1 1 to nb
+ inodes[j]=k; k++; //indices 0->n-1 of nodes of joint from nodes of domain
+ arraynodes[jj]=tab->tmflo[j*3]; jj++;
+ arraynodes[jj]=tab->tmflo[j*3+1]; jj++;
+ arraynodes[jj]=tab->tmflo[j*3+2]; jj++;
+
+ fammore[j]=famjoint;
arrayi[ii]=tab1->tmint[i]; ii++;
arrayi[ii]=tab2->tmint[i]; ii++;
}
- err=MEDjointEcr(fid,namelocal,namejnt,arrayi,nbnodes,
- MED_NOEUD,medgeoele0,MED_NOEUD,medgeoele0);
+ ok=set_one_more_family(famnodes,fammore,nbnodes);
+ delete[] fammore;
+
+ err=MEDjointEcr(fid,nomfinal,namejnt,arrayi,nb,
+ MED_NOEUD,MED_NONE,MED_NOEUD,MED_NONE);
if (err<0) cerr<<"Problem MEDjointEcr nodes"<<endl;
delete[] arrayi;
+ //!*************TRIA3
//writing correspondence triangles-triangles
+ //cout<<"\n faces joints\n";
+ nbtria3neig=0;
key1=key1.sprintf("MS%d NE%d FA SE",idom,ineig); //SE or RE?
tab1=this->restore_key(key1); //tab1=this->mestab[key1];
- if (!tab1)
- {
- if (this->verbose>4)
- cout<<"NumberOfTrianglesOfJoint_"<<ineig<<"="<<0<<endl;
- continue; //case (ifile,ineig) are not neighbours=>no joints
+ if (!tab1){
+ if (verbose>4)
+ cout<<"NumberOfTrianglesOfJoint_"<<idom<<"_"<<ineig<<"=0"<<endl;
+ //continue; //case (ifile,ineig) are not neighbours=>no joints
}
+ else //have to set xml may be no faces but nodes in a joint!
+ {
key1=key1.sprintf("MS%d NE%d FA RE",idom,ineig); //SE or RE?
tab2=tab1; //tab2=this->restore_key(key1); //no need because <send> equals <receive>
if (!tab2) cerr<<"Problem triangles joint send with no receive"<<endl;
- med_int nbtriangles=tab1->size;
-
- if (this->verbose>4)
- cout<<"NumberOfTrianglesOfJoint_"<<ineig<<"="<<nbtriangles<<endl;
- arrayi=new med_int[nbtriangles*2];
- ii=0;
- for (int i=0; i<nbtriangles ; i++)
- {
+ namejoint=namejoint.sprintf("JOINT_%d_%d_Faces",idom,ineig);
+
+ ok=families.get_number_of_new_family(-1,&famjoint,&tmp);
+ families.add(tmp,namejoint);
+
+ key=key.sprintf("FC%d",idom); //files.FaCes faces (wrap and triangles only)
+ tab=this->restore_key(key); //tab1=this->mestab[key1];
+
+ med_int nb=tab1->size; nbtria3neig=nb;
+ if (verbose>4)
+ cout<<"NumberOfTrianglesOfJoint_"<<idom<<"_"<<ineig<<"="<<nb<<endl;
+ arrayi=new med_int[nb*2];
+ arrayfaces=new med_int[nbtria3neig*3]; //for file DOMAIN_join.med
+ fammore=new med_int[nbtria3];
+ for (i=0; i<nbtria3 ; i++) fammore[i]=0;
+ ii=0; jj=0;
+ for (i=0; i<nb ; i++){
//no need because <send> equals <receive> tab1->tmint[i]==tab2->tmint[i]
arrayi[ii]=tab1->tmint[i]; ii++;
- familiesi[tab1->tmint[i]-1]=-numfam_ini_wrap-ineig;
+ fammore[tab1->tmint[i]-1]=famjoint;
+ //famtria3[tab1->tmint[i]-1]=famjoint;
arrayi[ii]=tab2->tmint[i]; ii++;
//cout<<arrayi[ii-1]<<"="<<arrayi[ii-2]<<endl;
+ k=(tab1->tmint[i]-1)*7; //indice of node connectivity
+ arrayfaces[jj]=inodes[tab->tmint[k]-1]+1; jj++;
+ arrayfaces[jj]=inodes[tab->tmint[k+1]-1]+1; jj++;
+ arrayfaces[jj]=inodes[tab->tmint[k+2]-1]+1; jj++;
}
- err=MEDjointEcr(fid,namelocal,namejnt,arrayi,nbtriangles,MED_FACE,MED_TRIA3,MED_FACE,MED_TRIA3);
+ ok=set_one_more_family(famtria3,fammore,nbtria3);
+ delete[] fammore;
+
+ err=MEDjointEcr(fid,nomfinal,namejnt,arrayi,nb,MED_MAILLE,MED_TRIA3,MED_MAILLE,MED_TRIA3);
if (err<0) cerr<<"Problem MEDjointEcr triangles"<<endl;
delete[] arrayi;
+ }
- tmp=tmp.sprintf("JOINT_%d",ineig);
- strcpy(nomfam,tmp);
-
- //err=MEDnumEcr(fid,nomfam,arrayi,nbtriangles,MED_FACE,MED_TRIA3);
- //if (err<0) cerr<<"Problem MEDnumEcr of triangles of "<<nomfam<<endl;
-
- //char gro[MED_TAILLE_LNOM+1]="PART_OF_GLOBAL_WRAP_PLUS_JOINTS";
- strcpy(gro,tmp);
- /*char gro[MED_TAILLE_LNOM*2+1];
- strcpy(gro,"PART_OF_GLOBAL_WRAP_PLUS_JOINTS ");
- for (int i=32;i<MED_TAILLE_LNOM;i++) gro[i]=' ';
- gro[MED_TAILLE_LNOM]='\0';
- strcat(gro,tmp);
- //for (i=7;i<MED_TAILLE_LNOM;i++) gro[MED_TAILLE_LNOM+i]=' ';
- //gro[2*MED_TAILLE_LNOM]='\0';*/
-
- tmp=tmp.sprintf("joint of neighbourg_%d on local wrap",ineig);
- strcpy(attdes,tmp);
- numfam=-numfam_ini_wrap-ineig;
- //attide=1;
- attval=numfam;
- //natt=1;
- ngro=1;
- if (this->verbose>2)
- cout<<"CreateFamilyOfFaces_"<<nomfam<<endl;
- if (this->verbose>4) cout<<"MEDfamCr (faces) of "<<nomfam<<" / "<<attdes<<" / FamilyNumber="<<numfam<<endl;
-
- err=MEDfamCr(fid,namelocal,nomfam,numfam,&attide,&attval,attdes,natt,gro,ngro);
- if (err<0) cerr<<"Problem MEDfamCr of "<<nomfam<<endl;
+ //!write in file resume DOMAIN.joints.med of all joints for quick display (...may be...)
+ if (idom<=ineig) { //no duplicate joint_1_2 and joint_2_1
+ //create mesh
+ namejoint=namejoint.sprintf("JOINT_%d_%d",idom,ineig);
+ charendnull(namejnt,namejoint,MED_TAILLE_NOM);
+ tmp=tmp.sprintf("joint between %d and %d",idom,ineig);
+ charendnull(descjnt,tmp,MED_TAILLE_DESC);
+ err=MEDmaaCr(fidjoint,namejnt,3,MED_NON_STRUCTURE,descjnt);
+ if (err<0) cerr<<"Problem MEDmaaCr "<<namejnt<<endl;
+ //write nodes
+ err=MEDcoordEcr(fidjoint,namejnt,3,arraynodes,MED_FULL_INTERLACE,
+ nbnodesneig,MED_CART,nomcoo,unicoo);
+ if (err<0) cerr<<"Problem MEDcoordEcr "<<namejnt<<endl;
+ arrayi=new med_int[nbnodesneig];
+ for (i=0; i<nbnodesneig ; i++) arrayi[i]=i+1;
+ err=MEDnumEcr(fidjoint,namejnt,arrayi,nbnodesneig,MED_NOEUD,MED_NONE);
+ delete[] arrayi;
+ if (err<0) cerr<<"Problem MEDnumEcr of nodes "<<namejnt<<endl;
+
+ //write tria3
+ if (nbtria3neig>0) {
+ //for (i=0; i<nbtria3neig ; i++) cout<<i+1<<" "<<
+ // arrayfaces[i*3]<<" "<<arrayfaces[i*3+1]<<" "<<arrayfaces[i*3+2]<<endl;
+ err=MEDconnEcr(fidjoint,namejnt,3,arrayfaces,MED_FULL_INTERLACE,
+ nbtria3neig,MED_MAILLE,MED_TRIA3,MED_NOD);
+ if (err<0) cerr<<"Problem MEDconnEcr for triangles connectivity "<<namejnt<<endl;
+ //writing indices of faces triangles of joint
+ arrayi=new med_int[nbtria3neig];
+ for (i=0; i<nbtria3neig ; i++) arrayi[i]=i+1;
+ err=MEDnumEcr(fidjoint,namejnt,arrayi,nbtria3neig,MED_MAILLE,MED_TRIA3);
+ delete[] arrayi;
+ if (err<0) cerr<<"Problem MEDnumEcr of triangles "<<namejnt<<endl;
+ }
+ }
+ delete[] arraynodes;
+ if (nbtria3neig>0) delete[] arrayfaces;
+ delete[] inodes;
+
+ //!masterfile.xml
+ node=xmlNewChild(joints_node, 0, BAD_CAST "joint", 0);
+ xmlNewProp(node, BAD_CAST "id", BAD_CAST i2a(ineig).c_str());
+ xmlNewProp(node, BAD_CAST "nodes_number", BAD_CAST i2a(nbnodesneig).c_str());
+ xmlNewProp(node, BAD_CAST "faces_number", BAD_CAST i2a(nbtria3neig).c_str());
+ //node2 = xmlNewChild(node, 0, BAD_CAST "nodes", 0);
+ //xmlNewProp(node2, BAD_CAST "number", BAD_CAST i2a(nbnodesneig).c_str());
+ //node2 = xmlNewChild(node, 0, BAD_CAST "faces", 0);
+ //xmlNewProp(node2, BAD_CAST "number", BAD_CAST i2a(nbtria3neig).c_str());
}
- //writing indices of families of faces triangles of wrap = joint<-100 or not=100?
- //arrayi=new med_int[nbtriangles];
- //families known in faces in wrap
- //for (int i=0; i<nbtriangles ; i++) arrayi[i]=-100-ineig; //tab1->tlong[(i*7)+3];
- err=MEDfamEcr(fid,namelocal,familiesi,sizefamilies,MED_FACE,MED_TRIA3);
- if (err<0) cerr<<"Problem MEDfamEcr faces of all joints"<<endl;
- delete[] familiesi;
- MEDfermer(fid);
+ //masterfile.xml
+ xmlNewProp(joints_node, BAD_CAST "number", BAD_CAST i2a(nbjoints).c_str());
+ xmlNewChild(joints_node, 0, BAD_CAST "id_neighbours", BAD_CAST sjoints.substr(1).c_str());
+
+ tmp=tmp.sprintf("NB%d VC",idom);
+ //qt3 xx=this->remove_key_mesh_wrap(QRegExp(tmp,true,true));
+ xx=this->remove_key_mesh_wrap(QRegExp(tmp,Qt::CaseSensitive,QRegExp::RegExp));
+ tmp=tmp.sprintf("MS%d NE*",idom);
+ //qt3 xx=this->remove_key_mesh_wrap(QRegExp(tmp,true,true));
+ xx=this->remove_key_mesh_wrap(QRegExp(tmp,Qt::CaseSensitive,QRegExp::RegExp));
+ tmp=tmp.sprintf("FC%d",idom);
+ //qt3 xx=this->remove_key_mesh_wrap(QRegExp(tmp,true,true));
+ xx=this->remove_key_mesh_wrap(QRegExp(tmp,Qt::CaseSensitive,QRegExp::RegExp));
+ tmp=tmp.sprintf("GL%d *",idom);
+ //qt3 xx=this->remove_key_mesh_wrap(QRegExp(tmp,true,true));
+ xx=this->remove_key_mesh_wrap(QRegExp(tmp,Qt::CaseSensitive,QRegExp::RegExp));
+ return ok;
+}
- //examples of test of med files ( ... for me!)
- //../Salome_321/med_231_install/bin/medconforme exemple11.med
- //../Salome_321/hdf5-1.6.3/bin/h5dump exemple11.med
- //../Salome_321/med_231_install/bin/mdump exemple11.med
- }
+//************************************
+bool ghs3dprl_mesh_wrap::idom_tetras()
+{
+ bool ok=true;
+ QString tmp,key1;
+ CVWtab *tab1;
+ med_int i,*arrayi;
+ int xx;
+
+ //writing connectivity of tetrahedra by nodes
+ key1=key1.sprintf("NB%d EV",idom); //files.NoBoite Elements Vertices (tetra only)
+ tab1=this->restore_key(key1); //tab1=this->mestab[key1];
+ nbtetra4=tab1->size/4;
+ nbtetrastotal=nbtetrastotal + nbtetra4;
+ if (verbose>5)cout<<"NumberOftetrahedra="<<nbtetra4<<endl;
+ err=MEDconnEcr(fid,nomfinal,3,tab1->tmint,MED_FULL_INTERLACE,nbtetra4,MED_MAILLE,MED_TETRA4,MED_NOD);
+ if (err<0){cerr<<"Problem MEDconnEcr for tetra connectivity"<<endl; return false;}
+
+ //writing indices of tetrahedra
+ arrayi=new med_int[nbtetra4];
+ for (i=0; i<nbtetra4 ; i++) arrayi[i]=nbseg2+nbtria3+i+1;
+ //for (i=0; i<nbtria3 ; i++) cout<<i<<" "<<arrayi[i]<<endl;
+ err=MEDnumEcr(fid,nomfinal,arrayi,nbtetra4,MED_MAILLE,MED_TETRA4);
+ delete[] arrayi;
+ if (err<0){cerr<<"Problem MEDnumEcr of tetrahedra"<<endl; return false;}
+
+ famtetra4=new med_int[nbtetra4];
+ for (i=0; i<nbtetra4 ; i++) famtetra4[i]=famnewtetra4;
+
+ //writing tetrahedra global numbering
+ //GLx EL=files.GLo ELements
+ key1=key1.sprintf("GL%d EL",idom);
+ tab1=this->restore_key(key1); //tab1=this->mestab[key1];
+ if (!tab1) {
+ tmp=pathini+casename+tmp.sprintf(format.toLatin1().constData(),nbfilestot,idom)+".glo";
+ ok=this->ReadFileGLO(tmp);
+ tab1=this->restore_key(key1);
+ if (!tab1) return false;
+ }
+
+ if (tab1->size!=nbtetra4){
+ cerr<<"Problem incorrect size of tetrahedra global numbering"<<endl; return false;}
+ if (verbose>2)
+ cout<<"CreateMEDglobalNumerotation_tetrahedra "<<key1.toLatin1().constData()<<" "<<tab1->size<<endl;
+ err=MEDglobalNumEcr(fid,nomfinal,tab1->tmint,tab1->size,MED_MAILLE,MED_TETRA4);
+ if (err<0){cerr<<"Problem MEDglobalNumEcr tetrahedra"<<endl; return false;}
+
+ tmp=tmp.sprintf("NB%d EV",idom);
+ //qt3 xx=this->remove_key_mesh_wrap(QRegExp(tmp,true,true));
+ xx=this->remove_key_mesh_wrap(QRegExp(tmp,Qt::CaseSensitive,QRegExp::RegExp));
return ok;
}
+//************************************
+med_int ghs3dprl_mesh_wrap::create_families(med_idt fid, int sign)
+//if sign < 0 families faces or tria3 etc...
+//if sign >= 0 family zero and family nodes
+{
+ med_int pas,ires;
+ char nomfam[MED_TAILLE_NOM+1]; //it.current()->name;
+ char attdes[MED_TAILLE_DESC+1]="_NO_DESCRIPTION";
+ char *gro;
+ med_int i,attide=1,attval=1,natt=1,num,ngro;
+
+ if (sign>=0) pas=1; else pas=-1;
+ ires=0;
+ fend gb;
+ fagr::iterator it1;
+ fend::iterator it2;
+ for (it1=families.fam.begin(); it1!=families.fam.end(); ++it1){
+ num=(*it1).first.toLong();
+ if ((pas==-1) && (num>=0)) continue; //not good families
+ if ((pas== 1) && (num< 0)) continue; //not good families
+ charendnull(nomfam,(*it1).first,MED_TAILLE_NOM);
+ ires++;
+ //med_int natt=0;
+ ngro=(*it1).second.size();
+ if (verbose>5)
+ cout<<"CreateFamilyInMEDFile <"<<nomfam<<">\tNbGroups="<<ngro;
+ gro=new char[MED_TAILLE_LNOM*ngro+2];
+ gb=(*it1).second;
+ i=0;
+ for (it2=gb.begin(); it2!=gb.end(); ++it2){
+ charendnull(&gro[i*MED_TAILLE_LNOM],(*it2).first,MED_TAILLE_LNOM);
+ if (verbose>5)cout<<" <"<<&gro[i*MED_TAILLE_LNOM]<<"> ";
+ i++;
+ }
+ if (verbose>5)cout<<endl;
+ err=MEDfamCr(fid,nomfinal,nomfam,num,NULL,NULL,NULL,0,gro,ngro);
+ //&attide,&attval,attdes,natt,gro,ngro);
+ if (err<0) cerr<<"Problem MEDfamCr"<<endl;
+ delete[] gro;
+ if (err<0) cerr<<"Problem MEDfamCr of "<<nomfam<<endl;
+ }
+ return ires;
+}
+
+
