Skip to content
Snippets Groups Projects
Commit e49fa8e4 authored by Christophe Geuzaine's avatar Christophe Geuzaine
Browse files

missing headers

parent e5401ddc
Branches
Tags
No related merge requests found
Showing
with 312 additions and 203 deletions
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
// compute the largest inscribed ellipsoid... // compute the largest inscribed ellipsoid...
#include "STensor3.h" #include "STensor3.h"
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#include "GModel.h" #include "GModel.h"
#include "GFace.h" #include "GFace.h"
#include "MVertex.h" #include "MVertex.h"
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#ifndef _MESHGFACE_BNDRYLR_ #ifndef _MESHGFACE_BNDRYLR_
#define _MESHGFACE_BNDRYLR_ #define _MESHGFACE_BNDRYLR_
...@@ -6,8 +11,10 @@ ...@@ -6,8 +11,10 @@
#include "MEdge.h" #include "MEdge.h"
#include <map> #include <map>
#include <set> #include <set>
class Field; class Field;
class GFace; class GFace;
struct BoundaryLayerData struct BoundaryLayerData
{ {
BoundaryLayerData (const SVector3 & dir, BoundaryLayerData (const SVector3 & dir,
...@@ -163,9 +170,7 @@ public: ...@@ -163,9 +170,7 @@ public:
void filterPoints(); void filterPoints();
}; };
BoundaryLayerColumns * buidAdditionalPoints2D (GFace *gf) ; BoundaryLayerColumns * buidAdditionalPoints2D (GFace *gf) ;
void buildMeshMetric(GFace *gf, double *uv, SMetric3 &m, double metric[3]); void buildMeshMetric(GFace *gf, double *uv, SMetric3 &m, double metric[3]);
#endif #endif
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#include "meshMetric.h" #include "meshMetric.h"
#include "meshGFaceOptimize.h" #include "meshGFaceOptimize.h"
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#ifndef _MESH_METRIC_H_ #ifndef _MESH_METRIC_H_
#define _MESH_METRIC_H_ #define _MESH_METRIC_H_
#include <map> #include <map>
#include <algorithm> #include <algorithm>
#include "STensor3.h" #include "STensor3.h"
#include "Field.h" #include "Field.h"
#include "meshGFaceOptimize.h" #include "meshGFaceOptimize.h"
template <class scalar> class simpleFunction; template <class scalar> class simpleFunction;
class MVertex; class MVertex;
class gLevelset; class gLevelset;
...@@ -93,4 +100,5 @@ class meshMetric: public Field { ...@@ -93,4 +100,5 @@ class meshMetric: public Field {
// export pos files of fct, fct gradients (fct is the lattest fct passed to meshMetric !!) and resulting metric (intersection of all computed metrics) // export pos files of fct, fct gradients (fct is the lattest fct passed to meshMetric !!) and resulting metric (intersection of all computed metrics)
void exportInfo(const char *fileendname); void exportInfo(const char *fileendname);
}; };
#endif #endif
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#include "BergotBasis.h" #include "BergotBasis.h"
BergotBasis::BergotBasis(int p): order(p) { BergotBasis::BergotBasis(int p): order(p)
{
// allocate function information and fill // allocate function information and fill
iOrder = new int[size()]; iOrder = new int[size()];
...@@ -27,8 +33,8 @@ BergotBasis::BergotBasis(int p): order(p) { ...@@ -27,8 +33,8 @@ BergotBasis::BergotBasis(int p): order(p) {
} }
} }
BergotBasis::~BergotBasis() { BergotBasis::~BergotBasis()
{
delete [] iOrder; delete [] iOrder;
delete [] jOrder; delete [] jOrder;
delete [] kOrder; delete [] kOrder;
...@@ -38,14 +44,13 @@ BergotBasis::~BergotBasis() { ...@@ -38,14 +44,13 @@ BergotBasis::~BergotBasis() {
for (;jIter!=jacobi.end();++jIter) delete jIter->second; for (;jIter!=jacobi.end();++jIter) delete jIter->second;
} }
int BergotBasis::size() const
int BergotBasis::size() const { {
return (2*order*order*order + 9*order*order + 13*order + 6)/6; return (2*order*order*order + 9*order*order + 13*order + 6)/6;
} }
void BergotBasis::f(double u, double v, double w, double* val) const
void BergotBasis::f(double u, double v, double w, double* val) const { {
double uhat = (w == 1.) ? 1 : u/(1.-w); double uhat = (w == 1.) ? 1 : u/(1.-w);
std::vector<double> uFcts(order+1); std::vector<double> uFcts(order+1);
...@@ -88,7 +93,8 @@ void BergotBasis::f(double u, double v, double w, double* val) const { ...@@ -88,7 +93,8 @@ void BergotBasis::f(double u, double v, double w, double* val) const {
} }
} }
void BergotBasis::df(double u, double v, double w, double grads[][3]) const { void BergotBasis::df(double u, double v, double w, double grads[][3]) const
{
std::vector<double> uFcts(order+1); std::vector<double> uFcts(order+1);
legendre->f(u,&(uFcts[0])); legendre->f(u,&(uFcts[0]));
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#ifndef BERGOTBASIS_H #ifndef BERGOTBASIS_H
#define BERGOTBASIS_H #define BERGOTBASIS_H
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#include "GaussIntegration.h" #include "GaussIntegration.h"
#include "GmshDefines.h" #include "GmshDefines.h"
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
// code to generate this file (using alglib) : // code to generate this file (using alglib) :
#if 0 #if 0
//alglib //alglib
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#ifndef _GAUSS_JACOBI_1D_H_ #ifndef _GAUSS_JACOBI_1D_H_
#define _GAUSS_JACOBI_1D_H_ #define _GAUSS_JACOBI_1D_H_
void getGaussJacobiQuadrature(int a, int b, int n, double **pt, double **wt)
void getGaussJacobiQuadrature(int a, int b, int n, double **pt, double **wt);
#endif #endif
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#include "jacobiPolynomials.h" #include "jacobiPolynomials.h"
inline double Pochhammer(double x,int n) { inline double Pochhammer(double x,int n)
{
double result(1.); double result(1.);
for (int i=0;i<n;i++) result *= (x+i); for (int i=0;i<n;i++) result *= (x+i);
return result; return result;
} }
JacobiPolynomials::JacobiPolynomials(double a, double b, int o): JacobiPolynomials::JacobiPolynomials(double a, double b, int o):
alpha(a),beta(b),n(o),alphaPlusBeta(a+b),a2MinusB2(a*a-b*b) {} alpha(a),beta(b),n(o),alphaPlusBeta(a+b),a2MinusB2(a*a-b*b) {}
JacobiPolynomials::~JacobiPolynomials() {;}
void JacobiPolynomials::f(double u, double *val) const { JacobiPolynomials::~JacobiPolynomials() {;}
void JacobiPolynomials::f(double u, double *val) const
{
val[0] = 1.; val[0] = 1.;
if (n>=1) val[1] = 0.5*(2.*(alpha+1.) + (alphaPlusBeta + 2.)*(u-1.)); if (n>=1) val[1] = 0.5*(2.*(alpha+1.) + (alphaPlusBeta + 2.)*(u-1.));
...@@ -29,12 +35,10 @@ void JacobiPolynomials::f(double u, double *val) const { ...@@ -29,12 +35,10 @@ void JacobiPolynomials::f(double u, double *val) const {
val[i+1] = ((a2i + a3i * u)* val[i] - a4i * val[i-1])/a1i; val[i+1] = ((a2i + a3i * u)* val[i] - a4i * val[i-1])/a1i;
} }
} }
void JacobiPolynomials::df(double u, double *val) const
void JacobiPolynomials::df(double u, double *val) const { {
std::vector<double> tmp(n+1); std::vector<double> tmp(n+1);
f(u,&(tmp[0])); f(u,&(tmp[0]));
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#ifndef JACOBIPOLYNOMIALS_H #ifndef JACOBIPOLYNOMIALS_H
#define JACOBIPOLYNOMIALS_H #define JACOBIPOLYNOMIALS_H
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#include "legendrePolynomials.h" #include "legendrePolynomials.h"
LegendrePolynomials::LegendrePolynomials(int o): n(o) {} LegendrePolynomials::LegendrePolynomials(int o): n(o) {}
LegendrePolynomials::~LegendrePolynomials() {;} LegendrePolynomials::~LegendrePolynomials() {;}
void LegendrePolynomials::f(double u, double *val) const { void LegendrePolynomials::f(double u, double *val) const
{
val[0] = 1; val[0] = 1;
for (int i=0;i<n;i++) { for (int i=0;i<n;i++) {
...@@ -18,7 +24,8 @@ void LegendrePolynomials::f(double u, double *val) const { ...@@ -18,7 +24,8 @@ void LegendrePolynomials::f(double u, double *val) const {
} }
} }
void LegendrePolynomials::df(double u, double *val) const { void LegendrePolynomials::df(double u, double *val) const
{
std::vector<double> tmp(n+1); std::vector<double> tmp(n+1);
f(u,&(tmp[0])); f(u,&(tmp[0]));
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#ifndef LEGENDREPOLYNOMIALS_H #ifndef LEGENDREPOLYNOMIALS_H
#define LEGENDREPOLYNOMIALS_H #define LEGENDREPOLYNOMIALS_H
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#include <QtGui> #include <QtGui>
#include <QtOpenGL> #include <QtOpenGL>
#include <math.h> #include <math.h>
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#ifndef _GLWIDGET_H_ #ifndef _GLWIDGET_H_
#define _GLWIDGET_H_ #define _GLWIDGET_H_
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#include <QtGui> #include <QtGui>
#include "GLWidget.h" #include "GLWidget.h"
#include "graphicWindow.h" #include "graphicWindow.h"
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#ifndef _GRAPHIC_WINDOW_H_ #ifndef _GRAPHIC_WINDOW_H_
#define _GRAPHIC_WINDOW_H_ #define _GRAPHIC_WINDOW_H_
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
#include "SElement.h" #include "SElement.h"
// FIXME: this will change in the future (the base SElement should no // FIXME: this will change in the future (the base SElement should no
... ...
......
// Gmsh - Copyright (C) 1997-2012 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to <gmsh@geuz.org>.
//
// Contributor(s):
// Eric Bechet
//
#include "STensor33.h" #include "STensor33.h"
void STensor33::print (const char *s) const void STensor33::print (const char *s) const
{ {
char format[512]; char format[512];
const char l[256]="%12.5E %12.5E %12.5E \n"; const char l[256]="%12.5E %12.5E %12.5E \n";
sprintf (format, " tensor3 %s : \n %s %s %s \n %s %s %s \n %s %s %s \n",s, l,l,l, l,l,l, l,l,l); sprintf (format, " tensor3 %s : \n %s %s %s \n %s %s %s \n %s %s %s \n",
s, l,l,l, l,l,l, l,l,l);
printf(format,s,_val[ 0],_val[ 1],_val[ 2], printf(format,s,_val[ 0],_val[ 1],_val[ 2],
_val[ 3],_val[ 4],_val[ 5], _val[ 3],_val[ 4],_val[ 5],
_val[ 6],_val[ 7],_val[ 8], _val[ 6],_val[ 7],_val[ 8],
...@@ -17,4 +27,3 @@ void STensor33::print (const char *s) const ...@@ -17,4 +27,3 @@ void STensor33::print (const char *s) const
_val[21],_val[22],_val[23], _val[21],_val[22],_val[23],
_val[24],_val[25],_val[26]); _val[24],_val[25],_val[26]);
} }
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment