src/libengrid/vertexmeshdensity.cpp

   1 //
   2 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
   3 // +                                                                      +
   4 // + This file is part of enGrid.                                         +
   5 // +                                                                      +
   6 // + Copyright 2008-2012 enGits GmbH                                     +
   7 // +                                                                      +
   8 // + enGrid is free software: you can redistribute it and/or modify       +
   9 // + it under the terms of the GNU General Public License as published by +
  10 // + the Free Software Foundation, either version 3 of the License, or    +
  11 // + (at your option) any later version.                                  +
  12 // +                                                                      +
  13 // + enGrid is distributed in the hope that it will be useful,            +
  14 // + but WITHOUT ANY WARRANTY; without even the implied warranty of       +
  15 // + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the        +
  16 // + GNU General Public License for more details.                         +
  17 // +                                                                      +
  18 // + You should have received a copy of the GNU General Public License    +
  19 // + along with enGrid. If not, see <http://www.gnu.org/licenses/>.       +
  20 // +                                                                      +
  21 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
  22 //
  23 #include "vertexmeshdensity.h"
  24 #include "egvtkobject.h"
  25 #include <iostream>
  26 using namespace std;
  27
  28 VertexMeshDensity::VertexMeshDensity()
  29 {
  30   type = EG_SIMPLE_VERTEX;
  31   CurrentNode = 0;
  32 }
  33
  34 //this=user defined
  35 //VMD=VMD of current node
  36 //This operator is NOT SYMMETRICAL. But it can be used with indexOf.
  37 bool VertexMeshDensity::operator==(const VertexMeshDensity & VMD) const
  38 {
  39   if(this->nodeset.size()>0) //node ID mode
  40   {
  41     if(this->nodeset.contains(VMD.CurrentNode) ) return(true);//node ID given, we're done
  42     else return(false);
  43   }
  44   else //node properties mode
  45   {
  46     if(this->type!=VMD.type && this->type!=-1) return(false);
  47
  48     QMapIterator<int, int> i(this->BCmap);
  49     while (i.hasNext()) {
  50       i.next();
  51       int index=i.key();
  52       if((this->BCmap)[index]!=VMD.BCmap[index] && (this->BCmap)[index]!=1) return(false);
  53     }
  54
  55     return(true);
  56   }
  57 }
  58
  59 int VertexMeshDensity::findSmallestVMD( QVector <VertexMeshDensity> vector)
  60 {
  61   int ret = -1;
  62   double Lmin = 0;
  63   bool first = true;
  64   for(int i=0;i<vector.size();i++){
  65     if(vector[i]==*this) {
  66       if(first) {
  67         ret = i;
  68         Lmin = vector[i].density;
  69         first = false;
  70       }
  71       else if(vector[i].density < Lmin) {
  72         ret = i;
  73         Lmin = vector[i].density;
  74       }
  75     }
  76   }
  77   return(ret);
  78 }
  79
  80 //converts string to nodeset
  81 void VertexMeshDensity::setNodes(QString str)
  82 {
  83   nodeset.clear();//empty by default
  84 //   cout<<"str.size="<<str.size()<<endl;
  85   if(str.size()>0)
  86   {
  87     QStringList L = str.split(",");
  88     foreach(QString elt,L) nodeset.insert(elt.toInt());
  89   }
  90 }
  91
  92 ostream& operator<<(ostream &out, VertexMeshDensity A)
  93 {
  94   out<<" BCmap="<<A.BCmap;
  95   out<<" type="<<(int)A.type;
  96   out<<" nodeset="<<A.nodeset;
  97   out<<" density="<<A.density;
  98   return(out);
  99 }
 100
 101 ostream& operator<<(ostream &out, QVector<VertexMeshDensity> VMDvector)
 102 {
 103   int N=VMDvector.size();
 104   out<<"Size="<<N;
 105   if(N>0) out<<endl;
 106   for(int i=0;i<N;i++)
 107   {
 108     out<<VMDvector[i];
 109     if(i!=N-1) out<<endl;
 110   }
 111   return(out);
 112 }