Back to index

salome-med  6.5.0
Public Types | Public Member Functions | Static Public Member Functions | Static Public Attributes | Protected Member Functions | Static Protected Member Functions | Protected Attributes | Static Protected Attributes | Private Types | Private Member Functions | Static Private Member Functions | Private Attributes | Static Private Attributes | Friends
INTERP_KERNEL::INTERPKERNEL_EXPORT Protocol Reference

Class representing the bounding box of a number of points. More...

#include <InterpKernelException.hxx>

Inheritance diagram for INTERP_KERNEL::INTERPKERNEL_EXPORT:
Inheritance graph
[legend]
Collaboration diagram for INTERP_KERNEL::INTERPKERNEL_EXPORT:
Collaboration graph
[legend]

List of all members.

Public Types

enum  BoxCoord {
  XMIN = 0, YMIN = 1, ZMIN = 2, XMAX = 3,
  YMAX = 4, ZMAX = 5
}
 Enumeration representing the six coordinates that define the bounding box. More...
enum  TetraCorner {
  O = 0, X, Y, Z,
  NO_TET_CORNER
}
 Corners of tetrahedron. More...
enum  TetraEdge {
  OX = 0, OY, OZ, XY,
  YZ, ZX, H01, H10,
  NO_TET_EDGE
}
 Edges of tetrahedron. More...
enum  TetraFacet {
  OYZ = 0, OZX, OXY, XYZ,
  NO_TET_FACET
}
 Facets (faces) of tetrahedron. More...
enum  TriCorner { P = 0, Q, R, NO_TRI_CORNER }
 Corners of triangle. More...
enum  TriSegment { PQ = 0, QR, RP, NO_TRI_SEGMENT }
 Segments (edges) of triangle. More...
enum  IntersectionPolygon { A = 0, B, NO_INTERSECTION_POLYGONS }
 Intersection polygons. More...
enum  DoubleProduct {
  C_YZ = 0, C_ZX, C_XY, C_ZH,
  C_XH, C_YH, C_01, C_10,
  NO_DP
}
 Double products NB : order corresponds to TetraEdges (Grandy, table III) More...
typedef std::map< int,
std::set< int > > 
DuplicateFacesType

Public Member Functions

 Exception (const char *reason)
 Exception (const char *reason, const char *file, int line)
 ~Exception () throw ()
const char * what () const throw ()
 BoundingBox (const double **pts, const unsigned numPts)
 BoundingBox (const BoundingBox &box1, const BoundingBox &box2)
 ~BoundingBox ()
bool isDisjointWith (const BoundingBox &box) const
void setCoordinate (const BoxCoord coord, double value)
double getCoordinate (const BoxCoord coord) const
void updateWithPoint (const double *pt)
void dumpCoords () const
 DirectedBoundingBox ()
 DirectedBoundingBox (const double *pts, const unsigned numPts, const unsigned dim)
 DirectedBoundingBox (const double **pts, const unsigned numPts, const unsigned dim)
void enlarge (const double tol)
bool isDisjointWith (const DirectedBoundingBox &box) const
bool isDisjointWith (const double *box) const
bool isOut (const double *point) const
std::vector< double > getData () const
void setData (const double *data)
virtual ~LeafExpr ()
virtual void fillValue (Value *val) const =0 throw (INTERP_KERNEL::Exception)
virtual void compileX86 (std::vector< std::string > &ass) const =0
virtual void compileX86_64 (std::vector< std::string > &ass) const =0
virtual void replaceValues (const std::vector< double > &valuesInExpr)=0 throw (INTERP_KERNEL::Exception)
 LeafExprVal (double value)
 ~LeafExprVal ()
void compileX86 (std::vector< std::string > &ass) const
void compileX86_64 (std::vector< std::string > &ass) const
void fillValue (Value *val) const throw (INTERP_KERNEL::Exception)
void replaceValues (const std::vector< double > &valuesInExpr) throw (INTERP_KERNEL::Exception)
 LeafExprVar (const std::string &var)
 ~LeafExprVar ()
void compileX86 (std::vector< std::string > &ass) const
void compileX86_64 (std::vector< std::string > &ass) const
void fillValue (Value *val) const throw (INTERP_KERNEL::Exception)
std::string getVar () const
void prepareExprEvaluation (const std::vector< std::string > &vars) const throw (INTERP_KERNEL::Exception)
void prepareExprEvaluationVec () const throw (INTERP_KERNEL::Exception)
void replaceValues (const std::vector< double > &valuesInExpr) throw (INTERP_KERNEL::Exception)
 ExprParser (const char *expr, ExprParser *father=0)
 ExprParser (const char *expr, int lgth, ExprParser *father=0)
 ~ExprParser ()
void parse () throw (INTERP_KERNEL::Exception)
bool isParsingSuccessfull () const
double evaluate () const throw (INTERP_KERNEL::Exception)
DecompositionInUnitBase evaluateUnit () const throw (INTERP_KERNEL::Exception)
void prepareExprEvaluation (const std::vector< std::string > &vars) const throw (INTERP_KERNEL::Exception)
void evaluateExpr (int szOfOutParam, const double *inParam, double *outParam) const throw (INTERP_KERNEL::Exception)
void prepareExprEvaluationVec () const throw (INTERP_KERNEL::Exception)
void getSetOfVars (std::set< std::string > &vars) const
void getTrueSetOfVars (std::set< std::string > &vars) const
char * compileX86 () const
char * compileX86_64 () const
void compileX86LowLev (std::vector< std::string > &ass) const
void compileX86_64LowLev (std::vector< std::string > &ass) const
int getStackSizeToPlayX86 (const ExprParser *asker) const
virtual ~Function ()
virtual int getNbInputParams () const =0
virtual void operate (std::vector< Value * > &stack) const =0 throw (INTERP_KERNEL::Exception)
virtual void operateX86 (std::vector< std::string > &asmb) const =0 throw (INTERP_KERNEL::Exception)
virtual const char * getRepr () const =0
virtual bool isACall () const =0
int getNbInputParams () const
 ~IdentityFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~PositiveFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~NegateFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~CosFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~SinFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~TanFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~SqrtFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~AbsFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~ExpFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~LnFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~LogFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~Log10Function ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
int getNbInputParams () const
 ~MinusFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~MultFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~DivFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~PowFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~MaxFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~MinFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~GreaterThanFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 ~LowerThanFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
int getNbInputParams () const
 ~IfFunction ()
void operate (std::vector< Value * > &stack) const throw (INTERP_KERNEL::Exception)
void operateX86 (std::vector< std::string > &asmb) const throw (INTERP_KERNEL::Exception)
const char * getRepr () const
bool isACall () const
 UnitDataBase ()
const short * getInfoForUnit (const std::string &unit, double &addFact, double &mFact) const throw (INTERP_KERNEL::Exception)
 DecompositionInUnitBase ()
void setInfo (const short *vals, double addFact, double mFact)
short operator[] (int i) const
bool operator== (const DecompositionInUnitBase &other) const
void getTranslationParams (const DecompositionInUnitBase &other, double &mul, double &add) const
bool isEqual (short mass, short lgth, short time, short intensity, short temp, double add, double mult)
bool isUnitary () const
void negate ()
 WARNING no test is done on the fact that unit is adimensionnal.
bool isAdimensional () const
void tryToConvertInUnit (double val) throw (INTERP_KERNEL::Exception)
DecompositionInUnitBaseoperator* (const DecompositionInUnitBase &other)
DecompositionInUnitBaseoperator/ (const DecompositionInUnitBase &other)
DecompositionInUnitBaseoperator^ (const DecompositionInUnitBase &other) throw (INTERP_KERNEL::Exception)
 Unit (const char *reprC, bool tryToInterp=true)
 Unit (const char *reprFortran, int sizeOfRepr, bool tryToInterp=true)
void tryToInterprate () const
bool isInterpretationOK () const
bool isCompatibleWith (const Unit &other) const
double convert (const Unit &target, double sourceVal) const
std::string getCoarseRepr () const
virtual Value * newInstance () const =0
virtual ~Value ()
virtual void setDouble (double val)=0 throw (INTERP_KERNEL::Exception)
virtual void setVarname (int fastPos, const std::string &var)=0 throw (INTERP_KERNEL::Exception)
virtual void positive ()=0 throw (INTERP_KERNEL::Exception)
virtual void negate ()=0 throw (INTERP_KERNEL::Exception)
virtual void sqrt ()=0 throw (INTERP_KERNEL::Exception)
virtual void cos ()=0 throw (INTERP_KERNEL::Exception)
virtual void sin ()=0 throw (INTERP_KERNEL::Exception)
virtual void tan ()=0 throw (INTERP_KERNEL::Exception)
virtual void abs ()=0 throw (INTERP_KERNEL::Exception)
virtual void exp ()=0 throw (INTERP_KERNEL::Exception)
virtual void ln ()=0 throw (INTERP_KERNEL::Exception)
virtual void log10 ()=0 throw (INTERP_KERNEL::Exception)
virtual Value * plus (const Value *other) const =0 throw (INTERP_KERNEL::Exception)
virtual Value * minus (const Value *other) const =0 throw (INTERP_KERNEL::Exception)
virtual Value * mult (const Value *other) const =0 throw (INTERP_KERNEL::Exception)
virtual Value * div (const Value *other) const =0 throw (INTERP_KERNEL::Exception)
virtual Value * pow (const Value *other) const =0 throw (INTERP_KERNEL::Exception)
virtual Value * max (const Value *other) const =0 throw (INTERP_KERNEL::Exception)
virtual Value * min (const Value *other) const =0 throw (INTERP_KERNEL::Exception)
virtual Value * greaterThan (const Value *other) const =0 throw (INTERP_KERNEL::Exception)
virtual Value * lowerThan (const Value *other) const =0 throw (INTERP_KERNEL::Exception)
virtual Value * ifFunc (const Value *the, const Value *els) const =0 throw (INTERP_KERNEL::Exception)
 ValueDouble ()
Value * newInstance () const
void setDouble (double val) throw (INTERP_KERNEL::Exception)
void setVarname (int fastPos, const std::string &var) throw (INTERP_KERNEL::Exception)
double getData () const
void positive () throw (INTERP_KERNEL::Exception)
void negate () throw (INTERP_KERNEL::Exception)
void sqrt () throw (INTERP_KERNEL::Exception)
void cos () throw (INTERP_KERNEL::Exception)
void sin () throw (INTERP_KERNEL::Exception)
void tan () throw (INTERP_KERNEL::Exception)
void abs () throw (INTERP_KERNEL::Exception)
void exp () throw (INTERP_KERNEL::Exception)
void ln () throw (INTERP_KERNEL::Exception)
void log10 () throw (INTERP_KERNEL::Exception)
Value * plus (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * minus (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * mult (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * div (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * pow (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * max (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * min (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * greaterThan (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * lowerThan (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * ifFunc (const Value *the, const Value *els) const throw (INTERP_KERNEL::Exception)
 ValueUnit ()
Value * newInstance () const
void setDouble (double val) throw (INTERP_KERNEL::Exception)
void setVarname (int fastPos, const std::string &var) throw (INTERP_KERNEL::Exception)
DecompositionInUnitBase getData () const
void positive () throw (INTERP_KERNEL::Exception)
void negate () throw (INTERP_KERNEL::Exception)
void sqrt () throw (INTERP_KERNEL::Exception)
void cos () throw (INTERP_KERNEL::Exception)
void sin () throw (INTERP_KERNEL::Exception)
void tan () throw (INTERP_KERNEL::Exception)
void abs () throw (INTERP_KERNEL::Exception)
void exp () throw (INTERP_KERNEL::Exception)
void ln () throw (INTERP_KERNEL::Exception)
void log10 () throw (INTERP_KERNEL::Exception)
Value * plus (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * minus (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * mult (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * div (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * pow (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * max (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * min (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * greaterThan (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * lowerThan (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * ifFunc (const Value *the, const Value *els) const throw (INTERP_KERNEL::Exception)
 ValueDoubleExpr (int szDestData, const double *srcData)
 ~ValueDoubleExpr ()
double * getData () const
Value * newInstance () const
void setDouble (double val) throw (INTERP_KERNEL::Exception)
void setVarname (int fastPos, const std::string &var) throw (INTERP_KERNEL::Exception)
void positive () throw (INTERP_KERNEL::Exception)
void negate () throw (INTERP_KERNEL::Exception)
void sqrt () throw (INTERP_KERNEL::Exception)
void cos () throw (INTERP_KERNEL::Exception)
void sin () throw (INTERP_KERNEL::Exception)
void tan () throw (INTERP_KERNEL::Exception)
void abs () throw (INTERP_KERNEL::Exception)
void exp () throw (INTERP_KERNEL::Exception)
void ln () throw (INTERP_KERNEL::Exception)
void log10 () throw (INTERP_KERNEL::Exception)
Value * plus (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * minus (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * mult (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * div (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * pow (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * max (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * min (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * greaterThan (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * lowerThan (const Value *other) const throw (INTERP_KERNEL::Exception)
Value * ifFunc (const Value *the, const Value *els) const throw (INTERP_KERNEL::Exception)
 GaussInfo (NormalizedCellType theGeometry, const DataVector &theGaussCoord, int theNbGauss, const DataVector &theReferenceCoord, int theNbRef)
 ~GaussInfo ()
NormalizedCellType getCellType () const
int getGaussCoordDim () const
int getReferenceCoordDim () const
int getNbGauss () const
int getNbRef () const
const double * getFunctionValues (const int theGaussId) const
void initLocalInfo () throw (INTERP_KERNEL::Exception)
 GaussCoords ()
 ~GaussCoords ()
void addGaussInfo (NormalizedCellType theGeometry, int coordDim, const double *theGaussCoord, int theNbGauss, const double *theReferenceCoord, int theNbRef) throw (INTERP_KERNEL::Exception)
double * calculateCoords (NormalizedCellType theGeometry, const double *theNodeCoords, const int theSpaceDim, const int *theIndex) throw (INTERP_KERNEL::Exception)
void calculateCoords (NormalizedCellType theGeometry, const double *theNodeCoords, const int theSpaceDim, const int *theIndex, double *result) throw (INTERP_KERNEL::Exception)
 IteratorOnComposedEdge ()
 IteratorOnComposedEdge (ComposedEdge *compEdges)
bool isValid () const
void operator= (const IteratorOnComposedEdge &other)
void first ()
void next ()
void last ()
void nextLoop ()
void previousLoop ()
bool finished () const
bool goToNextInOn (bool direction, int &i, int nbMax)
ElementaryEdgecurrent ()
void assignMySelfToAllElems (ComposedEdge *elems)
void insertElemEdges (ComposedEdge *elems, bool changeMySelf)
 Bounds ()
double & operator[] (int i)
const double & operator[] (int i) const
double getDiagonal () const
void getBarycenter (double &xBary, double &yBary) const
void applySimilarity (double xBary, double yBary, double dimChar)
void unApplySimilarity (double xBary, double yBary, double dimChar)
Boundsoperator= (const Bounds &other)
 Bounds (double xMin, double xMax, double yMin, double yMax)
void setValues (double xMin, double xMax, double yMin, double yMax)
void prepareForAggregation ()
void getInterceptedArc (const double *center, double radius, double &intrcptArcAngle0, double &intrcptArcDelta) const
int fitXForXFig (double val, int res) const
int fitYForXFig (double val, int res) const
double fitXForXFigD (double val, int res) const
double fitYForXFigD (double val, int res) const
BoundsnearlyAmIIntersectingWith (const Bounds &other) const
BoundsamIIntersectingWith (const Bounds &other) const
Position where (double x, double y) const
 No approximations.
Position nearlyWhere (double x, double y) const
 Idem where method but with approximations.
void aggregate (const Bounds &other)
double getCaracteristicDim () const
 ComposedEdge ()
 ComposedEdge (const ComposedEdge &other)
 ComposedEdge (int sz)
void reverse ()
int recursiveSize () const
bool presenceOfOn () const
bool presenceOfQuadraticEdge () const
void initLocations () const
ComposedEdgeclone () const
bool isNodeIn (Node *n) const
double getArea () const
double getPerimeter () const
double getHydraulicDiameter () const
void getBarycenter (double *bary) const
void getBarycenterGeneral (double *bary) const
double normalize (ComposedEdge *other, double &xBary, double &yBary)
double normalizeExt (ComposedEdge *other, double &xBary, double &yBary)
void unApplyGlobalSimilarityExt (ComposedEdge &other, double xBary, double yBary, double fact)
void fillBounds (Bounds &output) const
void applySimilarity (double xBary, double yBary, double dimChar)
void applyGlobalSimilarity (double xBary, double yBary, double dimChar)
void applyGlobalSimilarity2 (ComposedEdge *other, double xBary, double yBary, double dimChar)
void dispatchPerimeter (double &partConsidered) const
void dispatchPerimeterExcl (double &partConsidered, double &commonPart) const
double dispatchPerimeterAdv (const ComposedEdge &father, std::vector< double > &result) const
void getAllNodes (std::set< Node * > &output) const
void getBarycenter (double *bary, double &weigh) const
bool completed () const
void setValueAt (int i, Edge *e, bool direction=true)
double getCommonLengthWith (const ComposedEdge &other) const
void clear ()
bool empty () const
ElementaryEdgefront () const
ElementaryEdgeback () const
void resize (int i)
void pushBack (Edge *edge, bool direction=true)
void pushBack (ElementaryEdge *elem)
void pushBack (ComposedEdge *elem)
int size () const
ElementaryEdgeoperator[] (int i) const
NodegetEndNode () const
NodegetStartNode () const
bool changeEndNodeWith (Node *node) const
bool changeStartNodeWith (Node *node) const
void dumpInXfigFile (std::ostream &stream, int resolution, const Bounds &box) const
bool isInOrOut (Node *nodeToTest) const
bool getDirection () const
bool intresincEqCoarse (const Edge *other) const
 MergePoints ()
void start1Replaced ()
void end1Replaced ()
void start1OnStart2 ()
void start1OnEnd2 ()
void end1OnStart2 ()
void end1OnEnd2 ()
bool isStart1 (unsigned rk) const
bool isEnd1 (unsigned rk) const
bool isStart2 (unsigned rk) const
bool isEnd2 (unsigned rk) const
void clear ()
unsigned getNumberOfAssociations () const
 IntersectElement (double val1, double val2, bool start1, bool end1, bool start2, bool end2, Node *node, const Edge &e1, const Edge &e2, bool keepOrder)
 IntersectElement (const IntersectElement &other)
bool operator< (const IntersectElement &other) const
 The sort operator is done on the edge 1 not edge 2.
IntersectElementoperator= (const IntersectElement &other)
double getVal1 () const
double getVal2 () const
bool isLowerOnOther (const IntersectElement &other) const
 idem operator< method except that the orientation is done on edge 2 not edge 1.
unsigned isOnExtrForAnEdgeAndInForOtherEdge () const
void attachLoc ()
bool isOnMergedExtremity () const
bool isIncludedByBoth () const
void setNode (Node *node) const
void performMerging (MergePoints &commonNode) const
NodegetNodeOnly () const
NodegetNodeAndReleaseIt ()
 ~IntersectElement ()
virtual ~EdgeIntersector ()
virtual bool keepOrder () const =0
virtual bool haveTheySameDirection () const =0
 to call only if 'areOverlapped' have been set to true when areOverlappedOrOnlyColinears was called
virtual void getPlacements (Node *start, Node *end, TypeOfLocInEdge &whereStart, TypeOfLocInEdge &whereEnd, MergePoints &commonNode) const =0
 to call only if 'areOverlapped' have been set to true when areOverlappedOrOnlyColinears was called
bool intersect (const Bounds *whereToFind, std::vector< Node * > &newNodes, bool &order, MergePoints &commonNode)
 When true is returned, newNodes should contains at least 1 element. All merging nodes betw _e1 and _e2 extremities must be done.
virtual void areOverlappedOrOnlyColinears (const Bounds *whereToFind, bool &obviousNoIntersection, bool &areOverlapped)=0
 Should be called only once per association.
virtual std::list
< IntersectElement
getIntersectionsCharacteristicVal () const =0
 The size of returned vector is equal to number of potential intersections point. The values are so that their are interpretable by virtual Edge::isIn method.
 Edge (Node *start, Node *end, bool direction=true)
 Edge (double sX, double sY, double eX, double eY)
TypeOfEdgeLocInPolygon getLoc () const
void incrRef () const
bool decrRef ()
void initLocs () const
void declareOn () const
void declareIn () const
void declareOut () const
const BoundsgetBounds () const
void fillXfigStreamForLoc (std::ostream &stream) const
NodegetNode (TypeOfLocInEdge where) const
NodegetStartNode () const
NodegetEndNode () const
void setEndNodeWithoutChange (Node *newEnd)
void setStartNodeWithoutChange (Node *newStart)
bool changeStartNodeWith (Node *otherStartNode) const
bool changeStartNodeWithAndKeepTrack (Node *otherStartNode, std::vector< Node * > &track) const
bool changeEndNodeWith (Node *otherEndNode) const
bool changeEndNodeWithAndKeepTrack (Node *otherEndNode, std::vector< Node * > &track) const
void addSubEdgeInVector (Node *start, Node *end, ComposedEdge &vec) const
void getNormalVector (double *vectOutput) const
virtual void update (Node *m)=0
virtual double getAreaOfZone () const =0
 returns area between this and axe Ox delimited along Ox by _start and _end.
virtual void applySimilarity (double xBary, double yBary, double dimChar)
 apply a similiraty transformation on 'this'
virtual void unApplySimilarity (double xBary, double yBary, double dimChar)
 apply the inverse similiraty transformation on 'this'
virtual double getCurveLength () const =0
 return the length of arc. Value is always > 0. !
virtual void getBarycenter (double *bary) const =0
virtual void getBarycenterOfZone (double *bary) const =0
virtual NodebuildRepresentantOfMySelf () const =0
 Retrieves a point that is owning to this, well placed for IN/OUT detection of this. Typically midlle of this is returned.
virtual bool isIn (double characterVal) const =0
 Given a magnitude specified by sub-type returns if in or not. See getCharactValue method.
virtual bool isLower (double val1, double val2) const =0
 With the same magnitude as defined in 'isIn' method perform a compararison. Precondition : val1 and val2 are different and exactly INSIDE this.
virtual double getCharactValue (const Node &node) const =0
 node is expected to lay on 'this'. It returns a characteristic magnitude usable by isIn method.
virtual double getCharactValueBtw0And1 (const Node &node) const =0
 node is expected to lay on 'this'. It returns a characteristic magnitude between 0 and 1.
virtual double getDistanceToPoint (const double *pt) const =0
 retrieves the distance to this : The min distance from pt and any point of this.
virtual bool isNodeLyingOn (const double *coordOfNode) const =0
 return if node with coords 'coordOfNode' is on this (with precision).
virtual TypeOfFunction getTypeOfFunc () const =0
virtual void dynCastFunction (const EdgeLin *&seg, const EdgeArcCircle *&arcSeg) const =0
bool intersectWith (const Edge *other, MergePoints &commonNode, ComposedEdge &outVal1, ComposedEdge &outVal2) const
virtual void dumpInXfigFile (std::ostream &stream, bool direction, int resolution, const Bounds &box) const =0
bool isEqual (const Edge &other) const
void sortIdsAbs (const std::vector< INTERP_KERNEL::Node * > &addNodes, const std::map< INTERP_KERNEL::Node *, int > &mapp1, const std::map< INTERP_KERNEL::Node *, int > &mapp2, std::vector< int > &edgesThis)
virtual void fillGlobalInfoAbs (bool direction, const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< int > &edgesThis, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > mapAddCoo) const =0
virtual void fillGlobalInfoAbs2 (const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< int > &edgesOther, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > &mapAddCoo) const =0
virtual EdgebuildEdgeLyingOnMe (Node *start, Node *end, bool direction=true) const =0
 ArcCArcCIntersector (const EdgeArcCircle &e1, const EdgeArcCircle &e2)
bool haveTheySameDirection () const
void getPlacements (Node *start, Node *end, TypeOfLocInEdge &whereStart, TypeOfLocInEdge &whereEnd, MergePoints &commonNode) const
void areOverlappedOrOnlyColinears (const Bounds *whereToFind, bool &obviousNoIntersection, bool &areOverlapped)
std::list< IntersectElementgetIntersectionsCharacteristicVal () const
 ArcCSegIntersector (const EdgeArcCircle &e1, const EdgeLin &e2, bool reverse=true)
void getPlacements (Node *start, Node *end, TypeOfLocInEdge &whereStart, TypeOfLocInEdge &whereEnd, MergePoints &commonNode) const
void areOverlappedOrOnlyColinears (const Bounds *whereToFind, bool &obviousNoIntersection, bool &areOverlapped)
std::list< IntersectElementgetIntersectionsCharacteristicVal () const
 EdgeArcCircle (std::istream &lineInXfig)
 EdgeArcCircle (Node *start, Node *middle, Node *end, bool direction=true)
 EdgeArcCircle (double sX, double sY, double mX, double mY, double eX, double eY)
 EdgeArcCircle (Node *start, Node *end, const double *center, double radius, double angle0, double deltaAngle, bool direction=true)
void changeMiddle (Node *newMiddle)
 for tests
void dumpInXfigFile (std::ostream &stream, bool direction, int resolution, const Bounds &box) const
void update (Node *m)
double getAreaOfZone () const
double getCurveLength () const
void getBarycenter (double *bary) const
void getBarycenterOfZone (double *bary) const
bool isIn (double characterVal) const
NodebuildRepresentantOfMySelf () const
bool isLower (double val1, double val2) const
double getCharactValue (const Node &node) const
double getCharactValueBtw0And1 (const Node &node) const
double getDistanceToPoint (const double *pt) const
bool isNodeLyingOn (const double *coordOfNode) const
TypeOfFunction getTypeOfFunc () const
void dynCastFunction (const EdgeLin *&seg, const EdgeArcCircle *&arcSeg) const
const double * getCenter () const
void getCenter (double *center) const
bool doIHaveSameDirectionAs (const Edge &other) const
void applySimilarity (double xBary, double yBary, double dimChar)
void unApplySimilarity (double xBary, double yBary, double dimChar)
double getAngle0 () const
double getRadius () const
double getAngle () const
void tesselate (const int *conn, int offset, double eps, std::vector< int > &newConn, std::vector< double > &addCoo) const
 SegSegIntersector (const EdgeLin &e1, const EdgeLin &e2)
bool areColinears () const
bool haveTheySameDirection () const
void getPlacements (Node *start, Node *end, TypeOfLocInEdge &whereStart, TypeOfLocInEdge &whereEnd, MergePoints &commonNode) const
void areOverlappedOrOnlyColinears (const Bounds *whereToFind, bool &obviousNoIntersection, bool &areOverlapped)
std::list< IntersectElementgetIntersectionsCharacteristicVal () const
 EdgeLin (std::istream &lineInXfig)
 EdgeLin (Node *start, Node *end, bool direction=true)
 EdgeLin (double sX, double sY, double eX, double eY)
 ~EdgeLin ()
TypeOfFunction getTypeOfFunc () const
void dumpInXfigFile (std::ostream &stream, bool direction, int resolution, const Bounds &box) const
void update (Node *m)
double getNormSq () const
double getAreaOfZone () const
double getCurveLength () const
void getBarycenter (double *bary) const
void getBarycenterOfZone (double *bary) const
bool isIn (double characterVal) const
NodebuildRepresentantOfMySelf () const
double getCharactValue (const Node &node) const
double getCharactValueBtw0And1 (const Node &node) const
double getDistanceToPoint (const double *pt) const
bool isNodeLyingOn (const double *coordOfNode) const
bool isLower (double val1, double val2) const
double getCharactValueEng (const double *node) const
bool doIHaveSameDirectionAs (const Edge &other) const
void dynCastFunction (const EdgeLin *&seg, const EdgeArcCircle *&arcSeg) const
 ElementaryEdge (Edge *ptr, bool direction)
 ElementaryEdge (const ElementaryEdge &other)
 ~ElementaryEdge ()
bool isThereStartPoint () const
IteratorOnComposedEdgegetIterator ()
bool completed () const
void declareOn () const
void declareIn () const
void declareOut () const
TypeOfEdgeLocInPolygon getLoc () const
EdgegetPtr () const
void reverse ()
bool isNodeIn (Node *n) const
double getAreaOfZone () const
void getBarycenterOfZone (double *bary) const
void fillBounds (Bounds &output) const
void applySimilarity (double xBary, double yBary, double dimChar)
void unApplySimilarity (double xBary, double yBary, double dimChar)
void getAllNodes (std::set< Node * > &output) const
void getBarycenter (double *bary, double &weigh) const
ElementaryEdgeclone () const
void initLocations () const
int size () const
TypeOfEdgeLocInPolygon locateFullyMySelfAbsolute (const ComposedEdge &pol) const
TypeOfEdgeLocInPolygon locateFullyMySelf (const ComposedEdge &pol, TypeOfEdgeLocInPolygon precEdgeLoc) const
NodegetEndNode () const
NodegetStartNode () const
double getCurveLength () const
bool changeEndNodeWith (Node *node) const
bool changeStartNodeWith (Node *node) const
bool intresicEqual (const ElementaryEdge *other) const
bool intresicEqualDirSensitive (const ElementaryEdge *other) const
void dumpInXfigFile (std::ostream &stream, int resolution, const Bounds &box) const
bool getDirection () const
bool intresincEqCoarse (const Edge *other) const
bool isEqual (const ElementaryEdge &other) const
void fillGlobalInfoAbs (const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< int > &edgesThis, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > mapAddCoo) const
void fillGlobalInfoAbs2 (const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< int > &edgesOther, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > &mapAddCoo) const
 Node (double x, double y)
 Node (const double *coords)
 Node (std::istream &stream)
void incrRef () const
bool decrRef ()
void initLocs () const
void setLoc (TypeOfLocInPolygon loc) const
TypeOfLocInPolygon getLoc () const
void declareIn () const
void declareOn () const
void declareOnLim () const
void declareOut ()
void declareOnTangent ()
 operator const double * () const
bool isEqual (const Node &other) const
double getSlope (const Node &other) const
bool isEqualAndKeepTrack (const Node &other, std::vector< Node * > &track) const
void dumpInXfigFile (std::ostream &stream, int resolution, const Bounds &box) const
double distanceWithSq (const Node &other) const
double operator[] (int i) const
void setNewCoords (double x, double y)
 use with caution
void applySimilarity (double xBary, double yBary, double dimChar)
void unApplySimilarity (double xBary, double yBary, double dimChar)
void fillGlobalInfoAbs (const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > &mapAddCoo, int *nodeId) const
void fillGlobalInfoAbs2 (const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > &mapAddCoo, std::vector< int > &pointsOther) const
 QuadraticPolygon ()
 QuadraticPolygon (const QuadraticPolygon &other)
 QuadraticPolygon (const char *fileName)
 ~QuadraticPolygon ()
void closeMe () const
void circularPermute ()
bool isButterflyAbs ()
bool isButterfly () const
void dumpInXfigFile (const char *fileName) const
void dumpInXfigFileWithOther (const ComposedEdge &other, const char *fileName) const
double intersectWithAbs (QuadraticPolygon &other)
 Before intersecting as intersectWith a normalization is done.
double intersectWithAbs1D (QuadraticPolygon &other, bool &isColinear)
double intersectWithAbs (QuadraticPolygon &other, double *barycenter)
 Before intersecting as intersectWith a normalization is done.
void splitAbs (QuadraticPolygon &other, const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, const std::vector< int > &otherEdgeIds, std::vector< int > &edgesThis, int cellIdThis, std::vector< std::vector< int > > &edgesInOtherColinearWithThis, std::vector< std::vector< int > > &subDivOther, std::vector< double > &addCoo)
void buildFromCrudeDataArray (const std::map< int, INTERP_KERNEL::Node * > &mapp, bool isQuad, const int *nodalBg, const double *coords, const int *descBg, const int *descEnd, const std::vector< std::vector< int > > &intersectEdges)
void buildFromCrudeDataArray2 (const std::map< int, INTERP_KERNEL::Node * > &mapp, bool isQuad, const int *nodalBg, const double *coords, const int *descBg, const int *descEnd, const std::vector< std::vector< int > > &intersectEdges, const INTERP_KERNEL::QuadraticPolygon &pol1, const int *descBg1, const int *descEnd1, const std::vector< std::vector< int > > &intersectEdges1, const std::vector< std::vector< int > > &colinear1)
void appendEdgeFromCrudeDataArray (std::size_t edgeId, const std::map< int, INTERP_KERNEL::Node * > &mapp, bool isQuad, const int *nodalBg, const double *coords, const int *descBg, const int *descEnd, const std::vector< std::vector< int > > &intersectEdges)
void appendSubEdgeFromCrudeDataArray (Edge *baseEdge, std::size_t j, bool direct, int edgeId, const std::vector< int > &subEdge, const std::map< int, INTERP_KERNEL::Node * > &mapp)
void appendCrudeData (const std::map< INTERP_KERNEL::Node *, int > &mapp, double xBary, double yBary, double fact, int offset, std::vector< double > &addCoordsQuadratic, std::vector< int > &conn, std::vector< int > &connI) const
void buildPartitionsAbs (QuadraticPolygon &other, const std::map< INTERP_KERNEL::Node *, int > &mapp, int idThis, int idOther, int offset, std::vector< double > &addCoordsQuadratic, std::vector< int > &conn, std::vector< int > &connI, std::vector< int > &nb1, std::vector< int > &nb2)
double intersectWith (const QuadraticPolygon &other) const
double intersectWith (const QuadraticPolygon &other, double *barycenter) const
std::vector< QuadraticPolygon * > intersectMySelfWith (const QuadraticPolygon &other) const
void intersectForPerimeter (const QuadraticPolygon &other, double &perimeterThisPart, double &perimeterOtherPart, double &perimeterCommonPart) const
void intersectForPerimeterAdvanced (const QuadraticPolygon &other, std::vector< double > &polThis, std::vector< double > &polOther) const
void intersectForPoint (const QuadraticPolygon &other, std::vector< int > &numberOfCreatedPointsPerEdge) const
void performLocatingOperation (QuadraticPolygon &pol2) const
std::vector< QuadraticPolygon * > buildIntersectionPolygons (const QuadraticPolygon &pol1, const QuadraticPolygon &pol2) const
bool amIAChanceToBeCompletedBy (const QuadraticPolygon &pol1Splitted, const QuadraticPolygon &pol2NotSplitted, bool &direction)
 Interpolation2DCurve ()
 Interpolation2DCurve (const InterpolationOptions &io)
void setOptions (double precision, double tolerance, double medianLine)
 Interpolation3D ()
 Interpolation3D (const InterpolationOptions &io)
template<class MyMeshType , class MatrixType >
int interpolateMeshes (const MyMeshType &srcMesh, const MyMeshType &targetMesh, MatrixType &result, const char *method)
 Interpolation3D2D ()
 Interpolation3D2D (const InterpolationOptions &io)
template<class MyMeshType , class MyMatrixType >
int interpolateMeshes (const MyMeshType &srcMesh, const MyMeshType &targetMesh, MyMatrixType &matrix, const char *method)
DuplicateFacesType retrieveDuplicateFaces () const
 Interpolation3DSurf ()
 Interpolation3DSurf (const InterpolationOptions &io)
void setOptions (double precision, int printLevel, double medianPlane, IntersectionType intersectionType, bool doRotate, int orientation=0)
template<class MyMeshType , class MyMatrixRow >
void performAdjustmentOfBB (PlanarIntersector< MyMeshType, MyMatrixRow > *intersector, std::vector< double > &bbox) const
 InterpolationOptions ()
int getPrintLevel () const
void setPrintLevel (int pl)
IntersectionType getIntersectionType () const
void setIntersectionType (IntersectionType it)
std::string getIntersectionTypeRepr () const
double getPrecision () const
void setPrecision (double p)
double getMedianPlane () const
void setMedianPlane (double mp)
bool getDoRotate () const
void setDoRotate (bool dr)
double getBoundingBoxAdjustment () const
void setBoundingBoxAdjustment (double bba)
double getBoundingBoxAdjustmentAbs () const
void setBoundingBoxAdjustmentAbs (double bba)
double getMaxDistance3DSurfIntersect () const
void setMaxDistance3DSurfIntersect (double bba)
int getOrientation () const
void setOrientation (int o)
bool getMeasureAbsStatus () const
void setMeasureAbsStatus (bool newStatus)
SplittingPolicy getSplittingPolicy () const
void setSplittingPolicy (SplittingPolicy sp)
std::string getSplittingPolicyRepr () const
void setP1P0BaryMethod (bool isP1P0)
bool getP1P0BaryMethod () const
std::string filterInterpolationMethod (const std::string &meth) const
void init ()
bool setInterpolationOptions (long print_level, std::string intersection_type, double precision, double median_plane, bool do_rotate, double bounding_box_adjustment, double bounding_box_adjustment_abs, double max_distance_for_3Dsurf_intersect, long orientation, bool measure_abs, std::string splitting_policy, bool P1P0_bary_method)
void copyOptions (const InterpolationOptions &other)
bool setOptionDouble (const std::string &key, double value)
bool setOptionInt (const std::string &key, int value)
bool setOptionString (const std::string &key, const std::string &value)
std::string printOptions () const
 TetraAffineTransform (const double **pts)
void apply (double *destPt, const double *srcPt) const
void reverseApply (double *destPt, const double *srcPt) const
double determinant () const
void dump () const
 TransformedTriangle (double *p, double *q, double *r)
 ~TransformedTriangle ()
double calculateIntersectionVolume ()
double calculateIntersectionSurface (TetraAffineTransform *tat)
void dumpCoords () const
const double * getCorner (TriCorner corner) const
const std::vector< double * > & getPolygonA () const
double getVolume () const
 TranslationRotationMatrix ()
void multiply (const TranslationRotationMatrix &A)
void rotate_vector (double *P)
void transform_vector (double *P)
void translate (const double *P)
void rotate_x (double *P)
void rotate_z (double *P)
void setOptions (double precision, int printLevel, IntersectionType intersectionType, int orientation=0)
int interpolateMeshes (const MyMeshType &meshS, const MyMeshType &meshT, MatrixType &result)
bool doRotate () const
double medianPlane () const
int fromIntegralUniform (const MyMeshType &meshT, MatrixType &result, const char *method)
int toIntegralUniform (const MyMeshType &meshS, MatrixType &result, const char *method)
int interpolateMeshes (const MyMeshType &meshS, const MyMeshType &meshT, MatrixType &result)
int fromIntegralUniform (const MyMeshType &meshT, MatrixType &result, const char *method)
int toIntegralUniform (const MyMeshType &meshS, MatrixType &result, const char *method)
int interpolateMeshes (const MyMeshType &meshS, const MyMeshType &meshT, MatrixType &result)
int fromIntegralUniform (const MyMeshType &meshT, MatrixType &result, const char *method)
int toIntegralUniform (const MyMeshType &meshS, MatrixType &result, const char *method)
int interpolateMeshes (const MyMeshType &meshS, const MyMeshType &meshT, MatrixType &result)
int fromIntegralUniform (const MyMeshType &meshT, MatrixType &result, const char *method)
int toIntegralUniform (const MyMeshType &meshS, MatrixType &result, const char *method)

Static Public Member Functions

static int dataSize (int dim)
static LeafExpr * buildInstanceFrom (const std::string &expr) throw (INTERP_KERNEL::Exception)
static bool isRecognizedKeyVar (const std::string &var, int &pos)
static std::string buildStringFromFortran (const char *expr, int lgth)
static std::string deleteWhiteSpaces (const std::string &expr)
static Function * buildFuncFromString (const char *type, int nbOfParams) throw (INTERP_KERNEL::Exception)
static Function * buildUnaryFuncFromString (const char *type) throw (INTERP_KERNEL::Exception)
static Function * buildBinaryFuncFromString (const char *type) throw (INTERP_KERNEL::Exception)
static Function * buildBinaryFuncFromString (char type) throw (INTERP_KERNEL::Exception)
static Function * buildTernaryFuncFromString (const char *type) throw (INTERP_KERNEL::Exception)
static void Delete (ComposedEdge *pt)
static void SoftDelete (ComposedEdge *pt)
static EdgeIntersectorBuildIntersectorWith (const Edge *e1, const Edge *e2)
static EdgeBuildFromXfigLine (std::istream &str)
static EdgeBuildEdgeFrom (Node *start, Node *end)
template<TypeOfMod4QuadEdge type>
static EdgeBuildEdgeFrom (Node *start, Node *middle, Node *end)
static bool IntersectOverlapped (const Edge *f1, const Edge *f2, EdgeIntersector *intersector, MergePoints &commonNode, ComposedEdge &outValForF1, ComposedEdge &outValForF2)
static void Interpolate1DLin (const std::vector< double > &distrib1, const std::vector< double > &distrib2, std::map< int, std::map< int, double > > &result)
static EdgeArcCircleBuildFromNodes (Node *start, Node *middle, Node *end)
static double GetAbsoluteAngle (const double *vect, double &normVect)
static double GetAbsoluteAngleOfNormalizedVect (double ux, double uy)
static void GetArcOfCirclePassingThru (const double *start, const double *middle, const double *end, double *center, double &radius, double &angleInRad, double &angleInRad0)
static double SafeSqrt (double val)
 To avoid in aggressive optimizations nan.
static double SafeAcos (double cosAngle)
static double SafeAsin (double sinAngle)
static bool IsIn2Pi (double start, double delta, double angleIn)
static bool IsAngleNotIn (double start, double delta, double angleIn)
 'delta' 'start' in ]-Pi;Pi[
static double NormalizeAngle (double angle)
 for an angle 'angle' in ]-3*Pi;3*Pi[ returns angle in ]-Pi;Pi[
static ElementaryEdgeBuildEdgeFromCrudeDataArray (bool direction, INTERP_KERNEL::Node *start, INTERP_KERNEL::Node *end)
static double computeSlope (const double *pt1, const double *pt2)
static double computeAngle (const double *pt1, const double *pt2)
static double dot (const double *vect1, const double *vect2)
static double sign (double val)
static double norm (const double *vect)
static bool areDoubleEquals (double a, double b)
static bool areDoubleEqualsWP (double a, double b, double k)
 idem areDoubleEquals except that precision of comparison is modified.
static double distanceBtw2Pt (const double *a, const double *b)
static double distanceBtw2PtSq (const double *a, const double *b)
static void setPrecision (double precision)
static void setArcDetectionPrecision (double precision)
static QuadraticPolygonBuildLinearPolygon (std::vector< Node * > &nodes)
static QuadraticPolygonBuildArcCirclePolygon (std::vector< Node * > &nodes)
static void BuildDbgFile (const std::vector< Node * > &nodes, const char *fileName)
static void SplitPolygonsEachOther (QuadraticPolygon &pol1, QuadraticPolygon &pol2, int &nbOfSplits)
static
INTERP_KERNEL::NormalizedCellType 
simplifyDegeneratedCell (INTERP_KERNEL::NormalizedCellType type, const int *conn, int lgth, int *retConn, int &retLgth) throw (INTERP_KERNEL::Exception)
static int * getFullPolyh3DCell (INTERP_KERNEL::NormalizedCellType type, const int *conn, int lgth, int &retNbOfFaces, int &retLgth)
static
INTERP_KERNEL::NormalizedCellType 
tryToUnPoly2D (bool isQuad, const int *conn, int lgth, int *retConn, int &retLgth)
static
INTERP_KERNEL::NormalizedCellType 
tryToUnPoly3D (const int *conn, int nbOfFaces, int lgth, int *retConn, int &retLgth)
static
INTERP_KERNEL::NormalizedCellType 
tryToUnPolyHex8 (const int *conn, int nbOfFaces, int lgth, int *retConn, int &retLgth)
static
INTERP_KERNEL::NormalizedCellType 
tryToUnPolyHexp12 (const int *conn, int nbOfFaces, int lgth, int *retConn, int &retLgth)
static
INTERP_KERNEL::NormalizedCellType 
tryToUnPolyPenta6 (const int *conn, int nbOfFaces, int lgth, int *retConn, int &retLgth)
static
INTERP_KERNEL::NormalizedCellType 
tryToUnPolyPyra5 (const int *conn, int nbOfFaces, int lgth, int *retConn, int &retLgth)
static
INTERP_KERNEL::NormalizedCellType 
tryToUnPolyTetra4 (const int *conn, int nbOfFaces, int lgth, int *retConn, int &retLgth)
static bool tryToArrangeOppositeFace (const int *conn, int lgth, int lgthBaseFace, const int *baseFace, const int *oppFaceId, int nbOfFaces, int *retConnOfOppFace)
static bool isWellOriented (const int *baseFace, int *retConn, const int *sideFace, int lgthBaseFace)
static bool orientOppositeFace (const int *baseFace, int *retConn, const int *sideFace, int lgthBaseFace)
static void checkAndSplitInterpolationMethod (const char *method, std::string &srcMeth, std::string &trgMeth) throw (INTERP_KERNEL::Exception)
static double CalculateCharacteristicSizeOfMeshes (const MyMeshType &myMeshS, const MyMeshType &myMeshT, const int printLevel)
static void checkAndSplitInterpolationMethod (const char *method, std::string &srcMeth, std::string &trgMeth) throw (INTERP_KERNEL::Exception)
static double CalculateCharacteristicSizeOfMeshes (const MyMeshType &myMeshS, const MyMeshType &myMeshT, const int printLevel)
static void checkAndSplitInterpolationMethod (const char *method, std::string &srcMeth, std::string &trgMeth) throw (INTERP_KERNEL::Exception)
static double CalculateCharacteristicSizeOfMeshes (const MyMeshType &myMeshS, const MyMeshType &myMeshT, const int printLevel)
static void checkAndSplitInterpolationMethod (const char *method, std::string &srcMeth, std::string &trgMeth) throw (INTERP_KERNEL::Exception)
static double CalculateCharacteristicSizeOfMeshes (const MyMeshType &myMeshS, const MyMeshType &myMeshT, const int printLevel)

Static Public Attributes

static const char END_OF_RECOGNIZED_VAR []
static const char REPR []
static UnitDataBase _uniqueMapForExpr
static const int SIZE_OF_UNIT_BASE = 5
static const unsigned LIMIT_ALONE = 22
static const unsigned LIMIT_ON = 73
static const unsigned NO_LIMIT = 19
static double _precision
static double _arc_detection_precision
static const char PRECISION_STR []
static const char MEDIANE_PLANE_STR []
static const char BOUNDING_BOX_ADJ_STR []
static const char BOUNDING_BOX_ADJ_ABS_STR []
static const char MAX_DISTANCE_3DSURF_INSECT_STR []
static const char PRINT_LEV_STR []
static const char DO_ROTATE_STR []
static const char ORIENTATION_STR []
static const char MEASURE_ABS_STR []
static const char INTERSEC_TYPE_STR []
static const char SPLITTING_POLICY_STR []
static const char TRIANGULATION_INTERSECT2D_STR []
static const char CONVEX_INTERSECT2D_STR []
static const char GEOMETRIC_INTERSECT2D_STR []
static const char POINTLOCATOR_INTERSECT_STR []
static const char PLANAR_SPLIT_FACE_5_STR []
static const char PLANAR_SPLIT_FACE_6_STR []
static const char GENERAL_SPLIT_24_STR []
static const char GENERAL_SPLIT_48_STR []

Protected Member Functions

bool isSatisfy ()
void seg2Init ()
void seg3Init ()
void tria3aInit ()
void tria3bInit ()
void tria6aInit ()
void tria6bInit ()
void quad4aInit ()
void quad4bInit ()
void quad8aInit ()
void quad8bInit ()
void tetra4aInit ()
void tetra4bInit ()
void tetra10aInit ()
void tetra10bInit ()
void pyra5aInit ()
void pyra5bInit ()
void pyra13aInit ()
void pyra13bInit ()
void penta6aInit ()
void penta6bInit ()
void penta15aInit ()
void penta15bInit ()
void hexa8aInit ()
void hexa8bInit ()
void hexa20aInit ()
void hexa20bInit ()
 ~ComposedEdge ()
 EdgeIntersector (const Edge &e1, const Edge &e2)
 All non symetric methods are relative to 'e1'.
void obviousCaseForCurvAbscisse (Node *node, TypeOfLocInEdge &where, MergePoints &commonNode, bool &obvious) const
 SameTypeEdgeIntersector (const Edge &e1, const Edge &e2)
bool keepOrder () const
 CrossTypeEdgeIntersector (const Edge &e1, const Edge &e2, bool reverse)
bool keepOrder () const
bool haveTheySameDirection () const
const EdgemyE1 ()
const EdgemyE2 ()
 Edge ()
virtual ~Edge ()
void updateBounds ()
EdgebuildEdgeLyingOnMe (Node *start, Node *end, bool direction=true) const
void fillGlobalInfoAbs (bool direction, const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< int > &edgesThis, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > mapAddCoo) const
void fillGlobalInfoAbs2 (const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< int > &edgesOther, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > &mapAddCoo) const
 EdgeLin ()
void updateBounds ()
EdgebuildEdgeLyingOnMe (Node *start, Node *end, bool direction) const
void fillGlobalInfoAbs (bool direction, const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< int > &edgesThis, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > mapAddCoo) const
void fillGlobalInfoAbs2 (const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, double fact, double baryX, double baryY, std::vector< int > &edgesOther, std::vector< double > &addCoo, std::map< INTERP_KERNEL::Node *, int > &mapAddCoo) const
 ~Node ()
std::list< QuadraticPolygon * > zipConsecutiveInSegments () const
void dumpInXfigFile (std::ostream &stream, int resolution, const Bounds &box) const
void closePolygons (std::list< QuadraticPolygon * > &pol2Zip, const QuadraticPolygon &pol1, std::vector< QuadraticPolygon * > &results) const
std::list< QuadraticPolygon * >
::iterator 
fillAsMuchAsPossibleWith (const QuadraticPolygon &pol1Splitted, std::list< QuadraticPolygon * >::iterator iStart, std::list< QuadraticPolygon * >::iterator iEnd, bool direction)
 TransformedTriangle ()
void calculateIntersectionAndProjectionPolygons ()
void calculatePolygonBarycenter (const IntersectionPolygon poly, double *barycenter)
void sortIntersectionPolygon (const IntersectionPolygon poly, const double *barycenter)
double calculateVolumeUnderPolygon (IntersectionPolygon poly, const double *barycenter)
void calculateIntersectionPolygon ()
double calculateSurfacePolygon ()
bool isTriangleInPlaneOfFacet (const TetraFacet facet) const
bool isTriangleParallelToFacet (const TetraFacet facet) const
int isTriangleInclinedToFacet (const TetraFacet facet) const
bool isTriangleBelowTetraeder () const
bool testSurfaceEdgeIntersection (const TetraEdge edge) const
void calcIntersectionPtSurfaceEdge (const TetraEdge edge, double *pt) const
bool testSegmentFacetIntersection (const TriSegment seg, const TetraFacet facet) const
void calcIntersectionPtSegmentFacet (const TriSegment seg, const TetraFacet facet, double *pt) const
bool testSegmentEdgeIntersection (const TriSegment seg, const TetraEdge edge) const
void calcIntersectionPtSegmentEdge (const TriSegment seg, const TetraEdge edge, double *pt) const
bool testSegmentCornerIntersection (const TriSegment seg, const TetraCorner corner) const
bool testSurfaceRayIntersection (const TetraCorner corner) const
bool testSegmentHalfstripIntersection (const TriSegment seg, const TetraEdge edg)
void calcIntersectionPtSegmentHalfstrip (const TriSegment seg, const TetraEdge edge, double *pt) const
bool testSegmentRayIntersection (const TriSegment seg, const TetraCorner corner) const
bool testCornerInTetrahedron (const TriCorner corner) const
bool testCornerOnXYZFacet (const TriCorner corner) const
bool testCornerAboveXYZFacet (const TriCorner corner) const
bool testTriangleSurroundsEdge (const TetraEdge edge) const
bool testEdgeIntersectsTriangle (const TetraEdge edge) const
bool testFacetSurroundsSegment (const TriSegment seg, const TetraFacet facet) const
bool testSegmentIntersectsFacet (const TriSegment seg, const TetraFacet facet) const
bool testSegmentIntersectsHPlane (const TriSegment seg) const
bool testSurfaceAboveCorner (const TetraCorner corner) const
bool testTriangleSurroundsRay (const TetraCorner corner) const
void resetNearZeroCoordinates ()
bool areDoubleProductsConsistent (const TriSegment seg) const
void preCalculateDoubleProducts (void)
void resetDoubleProducts (const TriSegment seg, const TetraCorner corner)
double calculateDistanceCornerSegment (const TetraCorner corner, const TriSegment seg) const
void preCalculateTripleProducts (void)
double calculateAngleEdgeTriangle (const TetraEdge edge) const
double calcStableC (const TriSegment seg, const DoubleProduct dp) const
double calcStableT (const TetraCorner corner) const
double calcUnstableC (const TriSegment seg, const DoubleProduct dp) const
double calcTByDevelopingRow (const TetraCorner corner, const int row=1, const bool project=false) const
void preCalculateTriangleSurroundsEdge ()
 Calls TransformedTriangle::testTriangleSurroundsEdge for edges OX to ZX and stores the result in member variable array_triangleSurroundsEdgeCache.
Interpolation3DSurfasLeafInterpPlanar ()
const Interpolation3DSurfasLeafInterpPlanar () const
int fromToIntegralUniform (bool fromTo, const MyMeshType &mesh, MatrixType &result, const char *method)
InterpolationPlanar
< Interpolation3DSurf > & 
asLeaf ()
int fromToIntegralUniform (bool fromTo, const MyMeshType &mesh, MatrixType &result, const char *method)
Interpolation3D2DasLeaf ()
int fromToIntegralUniform (bool fromTo, const MyMeshType &mesh, MatrixType &result, const char *method)
Interpolation3DasLeaf ()
int fromToIntegralUniform (bool fromTo, const MyMeshType &mesh, MatrixType &result, const char *method)
InterpolationCurve
< Interpolation2DCurve > & 
asLeaf ()

Static Protected Member Functions

static int CombineCodes (TypeOfLocInEdge code1, TypeOfLocInEdge code2)
static bool Intersect (const Edge *f1, const Edge *f2, EdgeIntersector *intersector, const Bounds *whereToFind, MergePoints &commonNode, ComposedEdge &outValForF1, ComposedEdge &outValForF2)
static bool SplitOverlappedEdges (const Edge *e1, const Edge *e2, Node *nS, Node *nE, bool direction, int code, ComposedEdge &outVal1, ComposedEdge &outVal2)
 The code 'code' is built by method combineCodes.
template<class EDGES >
static void UpdateNeighbours (const MergePoints &merger, IteratorOnComposedEdge it1, IteratorOnComposedEdge it2, const EDGES *e1, const EDGES *e2)
static std::list
< QuadraticPolygon * >
::iterator 
CheckInList (Node *n, std::list< QuadraticPolygon * >::iterator iStart, std::list< QuadraticPolygon * >::iterator iEnd)

Protected Attributes

std::string _reason
double _x_min
double _x_max
double _y_min
double _y_max
std::list< ElementaryEdge * > _sub_edges
bool _reverse
 boolean to inform intersector that unsymetrics treatments reverse of e1 and e2 should be done.
unsigned char _cnt
TypeOfEdgeLocInPolygon _loc
Bounds _bounds
Node_start
Node_end
double _angle
 Value between -2Pi and 2Pi.
double _angle0
 Value between -Pi and Pi.
double _radius
double _center [2]
TypeOfLocInPolygon _loc
double _coords [2]
 Array holding the coordinates of the triangle's three corners order : [ p_x, p_y, p_z, p_h, p_H, q_x, q_y, q_z, q_h, q_H, r_x, r_y, r_z, r_h, r_H ].
bool _is_double_products_calculated
 Flag showing whether the double products have been calculated yet.
bool _is_triple_products_calculated
 Flag showing whether the triple products have been calculated yet.
double _doubleProducts [24]
 Array containing the 24 double products. order : c^PQ_YZ, ... ,cPQ_10, ... c^QR_YZ, ... c^RP_YZ following order in enumeration DoubleProduct.
double _tripleProducts [4]
 Array containing the 4 triple products. order : t_O, t_X, t_Y, t_Z.
std::vector< double * > _polygonA
 Vector holding the points of the intersection polygon A. these points are allocated in calculateIntersectionPolygons() and liberated in the destructor.
std::vector< double * > _polygonB
 Vector holding the points of the intersection polygon B. These points are allocated in calculateIntersectionPolygons() and liberated in the destructor.
double _barycenterA [3]
 Array holding the coordinates of the barycenter of the polygon A This point is calculated in calculatePolygonBarycenter.
bool _validTP [4]
 Array holding the coordinates of the barycenter of the polygon B This point is calculated in calculatePolygonBarycenter.
double _volume
 calculated volume for use of UnitTetraIntersectionBary
bool _triangleSurroundsEdgeCache [NO_TET_EDGE]
 Array holding results of the test testTriangleSurroundsEdge() for all the edges. These are calculated in preCalculateTriangleSurroundsEdge().

Static Protected Attributes

static const int OFFSET_FOR_TYPEOFLOCINEDGE = 8
static const int DP_OFFSET_1 [8]
static const int DP_OFFSET_2 [8]
static const int COORDINATE_FOR_DETERMINANT_EXPANSION [12]
static const DoubleProduct DP_FOR_DETERMINANT_EXPANSION [12]
static const long double MACH_EPS
static const long double MULT_PREC_F
static const long double THRESHOLD_F
static const double TRIPLE_PRODUCT_ANGLE_THRESHOLD
static const DoubleProduct DP_FOR_SEG_FACET_INTERSECTION [12]
static const double SIGN_FOR_SEG_FACET_INTERSECTION [12]
static const double COORDS_TET_CORNER [12]
static const int DP_INDEX [12]
static const TetraCorner CORNERS_FOR_EDGE [12]
static const TetraFacet FACET_FOR_EDGE [12]
static const TetraEdge EDGES_FOR_CORNER [12]
static const DoubleProduct DP_FOR_HALFSTRIP_INTERSECTION [12]
static const DoubleProduct DP_SEGMENT_RAY_INTERSECTION [21]

Private Types

typedef std::vector< GaussInfo * > GaussInfoVector

Private Member Functions

bool isValid () const
 BoundingBox (const BoundingBox &box)
 disallow copying
BoundingBoxoperator= (const BoundingBox &box)
 disallow assignment
void addPointToBox (const double *coord)
void toLocalCS (const double *p, double *pLoc) const
void fromLocalCS (const double *p, double *pGlob) const
bool isLocalOut (const double *pLoc) const
void getCorners (std::vector< double > &corners, const double *minmax) const
Value * evaluateLowLev (Value *valGen) const throw (INTERP_KERNEL::Exception)
void prepareExprEvaluationVecLowLev () const throw (INTERP_KERNEL::Exception)
bool tryToInterpALeaf () throw (INTERP_KERNEL::Exception)
void parseUnaryFunc () throw (INTERP_KERNEL::Exception)
void parseForCmp () throw (INTERP_KERNEL::Exception)
void parseForAddMin () throw (INTERP_KERNEL::Exception)
void parseForMulDiv () throw (INTERP_KERNEL::Exception)
void parseForPow () throw (INTERP_KERNEL::Exception)
void parseDeeper () throw (INTERP_KERNEL::Exception)
bool simplify () throw (INTERP_KERNEL::Exception)
void releaseFunctions ()
void checkBracketsParity () const throw (INTERP_KERNEL::Exception)
void fillValuesInExpr (std::vector< double > &valuesInExpr) throw (INTERP_KERNEL::Exception)
void replaceValues (const std::vector< double > &valuesInExpr) throw (INTERP_KERNEL::Exception)
void dealWithAddFactor (const DecompositionInUnitBase &other)
 ValueDouble (double val)
 ValueUnit (const DecompositionInUnitBase &unit)
const GaussInfogetInfoGivenCellType (NormalizedCellType cellType)
void calculateCoordsAlg (const GaussInfo *info, const double *theNodeCoords, const int theSpaceDim, const int *theIndex, double *result)
std::list< ElementaryEdge * > * getListBehind ()
void clearAll (std::list< ElementaryEdge * >::iterator startToDel)
double getAngle (Node *node) const
 return angle in ]-Pi;Pi[ - 'node' must be on curve of '_e1'
const EdgeArcCirclegetE1 () const
const EdgeArcCirclegetE2 () const
const EdgeArcCirclegetE1 () const
const EdgeLingetE2 () const
void getCurveAbscisse (Node *node, TypeOfLocInEdge &where, MergePoints &commonNode) const
void invertLinearTransform ()
void calculateDeterminant ()
void factorizeLU (double *lu, int *idx) const
void forwardSubstitution (double *x, const double *lu, const double *b, const int *idx) const
void backwardSubstitution (double *x, const double *lu, const double *b, const int *idx) const

Static Private Member Functions

static double ReplaceAndTraduce (std::string &expr, int id, std::size_t bg, std::size_t end, int &delta) throw (INTERP_KERNEL::Exception)
static std::size_t FindCorrespondingOpenBracket (const std::string &expr, std::size_t posOfCloseBracket)
static void LocateError (std::ostream &stringToDisp, const std::string &srcOfErr, int posOfErr)
static int couldItBeConsideredAsInt (double val) throw (INTERP_KERNEL::Exception)
static bool areDoubleEquals (double a, double b)
static double powInt (double val, int exp)
static const ValueDoublecheckSameType (const Value *val) throw (INTERP_KERNEL::Exception)
static void unsupportedOp (const char *type) throw (INTERP_KERNEL::Exception)
static const ValueUnitcheckSameType (const Value *val) throw (INTERP_KERNEL::Exception)
static bool areArcsOverlapped (const EdgeArcCircle &a1, const EdgeArcCircle &a2)

Private Attributes

double * _coords
 Vector containing the coordinates of the box interlaced in the order XMIN, YMIN, ZMIN, XMAX, YMAX, ZMAX.
unsigned _dim
std::vector< double > _axes
 principal axes of inertia in full interlace
std::vector< double > _minmax
 pairs of min an max coordinates along the axes
double _value
int _fast_pos
std::string _var_name
ExprParser_father
bool _is_parsed
LeafExpr * _leaf
bool _is_parsing_ok
std::string _expr
std::list< ExprParser_sub_expr
std::list< Function * > _func_btw_sub_expr
std::map< std::string, double > _prefix_pow_10
std::map< std::string, const
short * > 
_units_semantic
std::map< std::string, double > _units_mul
std::map< std::string, double > _units_add
short _value [UnitDataBase::SIZE_OF_UNIT_BASE]
double _add_to_base
double _mult_fact_to_base
std::string _coarse_repr
bool _is_interpreted
bool _is_interpretation_ok
DecompositionInUnitBase _decomp_in_base
double _data
DecompositionInUnitBase _data
int _sz_dest_data
double * _dest_data
const double * _src_data
NormalizedCellType _my_geometry
int _my_nb_gauss
DataVector _my_gauss_coord
int _my_nb_ref
DataVector _my_reference_coord
DataVector _my_local_reference_coord
int _my_local_ref_dim
int _my_local_nb_ref
DataVector _my_function_value
GaussInfoVector _my_gauss_info
std::list< ElementaryEdge * >
::iterator 
_deep_it
std::list< ElementaryEdge * > * _list_handle
unsigned _ass1Start1: 1
unsigned _ass1End1: 1
unsigned _ass1Start2: 1
unsigned _ass1End2: 1
unsigned _ass2Start1: 1
unsigned _ass2End1: 1
unsigned _ass2Start2: 1
unsigned _ass2End2: 1
bool _1S
bool _1E
bool _2S
bool _2E
double _chararct_val_for_e1
double _chararct_val_for_e2
Node_node
TypeOfLocInPolygon _loc_of_node
const Edge_e1
const Edge_e2
double _dist
double _dx
double _dy
double _drSq
double _cross
double _determinant
 The determinant of the matrix A is calculated at the construction of the object and cached.
int _ind
 index on which all single index op will be performed. Filled in case colinearity is equal to true.
double _col [2]
double _matrix [4]
bool _direction
Edge_ptr
IteratorOnComposedEdge _iterator
SplittingPolicy _splitting_policy
DuplicateFacesType _duplicate_faces
int _print_level
IntersectionType _intersection_type
double _precision
double _median_plane
bool _do_rotate
double _bounding_box_adjustment
 this measure is relative to the caracteristic dimension
double _bounding_box_adjustment_abs
 this measure is absolute not relative to the cell size
double _max_distance_for_3Dsurf_intersect
int _orientation
bool _measure_abs
bool _P1P0_bary_method
double _linear_transform [9]
 3x3 matrix A in affine transform x -> Ax + b
double _translation [3]
 3x1 vector b in affine transform x -> Ax + b
double _back_linear_transform [9]
 3x3 matrix AT is transposed A matrix used for y -> ATy - c transformation
double _back_translation [3]
 3x1 vector c in affine transform y -> ATy - c
double _rotation_coeffs [ROT_SIZE]
double _translation_coeffs [TRANSL_SIZE]

Static Private Attributes

static const int MAX_X86_FP_ST = 8
static const char WHITE_SPACES []
static const char EXPR_PARSE_ERR_MSG []
static const int NB_OF_PREF_POW10 = 22
static const char * PREF_POW10 [NB_OF_PREF_POW10]
static const double POW10 [NB_OF_PREF_POW10]
static const int NB_OF_UNITS_RECOGN = 29
static const char * UNITS_RECOGN [NB_OF_UNITS_RECOGN]
static const short PROJ_IN_BASE [NB_OF_UNITS_RECOGN][SIZE_OF_UNIT_BASE]
static const double MUL_COEFF [NB_OF_UNITS_RECOGN]
static const double ADD_COEFF [NB_OF_UNITS_RECOGN]
static const double DFT_MEDIAN_PLANE
static const double DFT_SURF3D_ADJ_EPS
static const double DFT_MAX_DIST_3DSURF_INTERSECT
static const double EPS
static const unsigned ROT_SIZE = 9
static const unsigned TRANSL_SIZE = 3

Friends

class ComposedEdge
class ElementaryEdge
class QuadraticPolygon
class IteratorOnComposedEdge
class Edge
class SegSegIntersector
class INTERP_TEST::TransformedTriangleTest
class INTERP_TEST::TransformedTriangleIntersectTest

Detailed Description

Class representing the bounding box of a number of points.

Class representing an affine transformation x -> Ax + b that transforms a given tetrahedron into the unit tetrahedron.

Contrary to its name this class deals with 2D mesh in source and 3D mesh in target.

As nodes can be shared between edges it is dealed with ref counting.

Deal with an oriented edge of a polygon.

This abstract interface specifies all the methods to be overloaded of all possibilities edge-intersection.

This class is in charge to store an intersection point as result of non oververlapping edge intersection.

Asumption is done with this iterator that we iterate on a container containing more than one edge.

This class deals with units.

Class representing the bounding box of a number of points with box axes parallel to principal axes of inertia of points.

This class has two main responsabilities :

All the possible units are represented with a unique tuple with 5 elements representing the unique decomposition of a unit in the following base.

dimension 0 stands for mass in g (NOT kg to simplify parsing). dimension 1 stands for length in m. dimension 2 stands for time in s. dimension 3 stands for elec intensity A. dimension 4 stands for temperature in K.

This class manages the cases when intersect element is one of the extrimities of edge1 and/or edge2.

An Edge is definied with a start node a end node and an equation of 1D curve. All other attributes are mutable because they don't impact these 3 invariant attributes. To be exact start and end node can change (adress) but their location remain the same (at precision).

The meshdim of 'MyMeshType' in input is ignored that's why 'meshS' and 'meshT' have the same type. '_duplicate_faces' attribute stores duplicated faces in the following format. The key of '_duplicate_faces' represents the 2D cellId that is shared by more than one 3D target cell, and the value of '_duplicate_faces' the 3D target cells. The size of the value of '_duplicate_faces' is more than or equal to 2.

Definition at line 30 of file InterpKernelException.hxx.


Member Typedef Documentation

typedef std::map<int,std::set<int> > INTERP_KERNEL::INTERPKERNEL_EXPORT::DuplicateFacesType

Definition at line 45 of file Interpolation3D2D.hxx.

Definition at line 156 of file InterpKernelGaussCoords.hxx.


Member Enumeration Documentation

Enumeration representing the six coordinates that define the bounding box.

Enumerator:
XMIN 
YMIN 
ZMIN 
XMAX 
YMAX 
ZMAX 

Definition at line 38 of file BoundingBox.hxx.

{ XMIN = 0, YMIN = 1, ZMIN = 2, XMAX = 3, YMAX = 4, ZMAX = 5 };

Double products NB : order corresponds to TetraEdges (Grandy, table III)

Enumerator:
C_YZ 
C_ZX 
C_XY 
C_ZH 
C_XH 
C_YH 
C_01 
C_10 
NO_DP 

Definition at line 135 of file TransformedTriangle.hxx.

{ C_YZ = 0, C_ZX, C_XY, C_ZH, C_XH, C_YH, C_01, C_10, NO_DP };

Intersection polygons.

Enumerator:
A 
B 
NO_INTERSECTION_POLYGONS 

Definition at line 131 of file TransformedTriangle.hxx.

Corners of tetrahedron.

Enumerator:
O 
X 
Y 
Z 
NO_TET_CORNER 

Definition at line 116 of file TransformedTriangle.hxx.

{ O = 0, X, Y, Z, NO_TET_CORNER };

Edges of tetrahedron.

Enumerator:
OX 
OY 
OZ 
XY 
YZ 
ZX 
H01 
H10 
NO_TET_EDGE 

Definition at line 119 of file TransformedTriangle.hxx.

{ OX = 0, OY, OZ, XY, YZ, ZX, H01, H10, NO_TET_EDGE };

Facets (faces) of tetrahedron.

Enumerator:
OYZ 
OZX 
OXY 
XYZ 
NO_TET_FACET 

Definition at line 122 of file TransformedTriangle.hxx.

{ OYZ = 0, OZX, OXY, XYZ, NO_TET_FACET };

Corners of triangle.

Enumerator:
P 
Q 
R 
NO_TRI_CORNER 

Definition at line 125 of file TransformedTriangle.hxx.

{ P = 0, Q, R, NO_TRI_CORNER };

Segments (edges) of triangle.

Enumerator:
PQ 
QR 
RP 
NO_TRI_SEGMENT 

Definition at line 128 of file TransformedTriangle.hxx.

{ PQ = 0, QR, RP, NO_TRI_SEGMENT };

Constructor & Destructor Documentation

virtual INTERP_KERNEL::INTERPKERNEL_EXPORT::~Value ( ) [inline, virtual]

Definition at line 33 of file InterpKernelValue.hxx.

{ }

Definition at line 147 of file InterpKernelGeo2DEdge.hxx.

{ }
virtual INTERP_KERNEL::INTERPKERNEL_EXPORT::~Edge ( ) [protected, virtual]

Member Function Documentation

virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::abs ( ) throw (INTERP_KERNEL::Exception) [pure virtual]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::abs ( ) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::abs ( ) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::abs ( ) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::addGaussInfo ( NormalizedCellType  theGeometry,
int  coordDim,
const double *  theGaussCoord,
int  theNbGauss,
const double *  theReferenceCoord,
int  theNbRef 
) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::addPointToBox ( const double *  coord) [inline, private]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::addSubEdgeInVector ( Node start,
Node end,
ComposedEdge vec 
) const
bool INTERP_KERNEL::INTERPKERNEL_EXPORT::amIAChanceToBeCompletedBy ( const QuadraticPolygon pol1Splitted,
const QuadraticPolygon pol2NotSplitted,
bool &  direction 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::appendCrudeData ( const std::map< INTERP_KERNEL::Node *, int > &  mapp,
double  xBary,
double  yBary,
double  fact,
int  offset,
std::vector< double > &  addCoordsQuadratic,
std::vector< int > &  conn,
std::vector< int > &  connI 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::appendEdgeFromCrudeDataArray ( std::size_t  edgeId,
const std::map< int, INTERP_KERNEL::Node * > &  mapp,
bool  isQuad,
const int *  nodalBg,
const double *  coords,
const int *  descBg,
const int *  descEnd,
const std::vector< std::vector< int > > &  intersectEdges 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::appendSubEdgeFromCrudeDataArray ( Edge baseEdge,
std::size_t  j,
bool  direct,
int  edgeId,
const std::vector< int > &  subEdge,
const std::map< int, INTERP_KERNEL::Node * > &  mapp 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::apply ( double *  destPt,
const double *  srcPt 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::applyGlobalSimilarity ( double  xBary,
double  yBary,
double  dimChar 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::applyGlobalSimilarity2 ( ComposedEdge other,
double  xBary,
double  yBary,
double  dimChar 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::applySimilarity ( double  xBary,
double  yBary,
double  dimChar 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::applySimilarity ( double  xBary,
double  yBary,
double  dimChar 
) [inline]

Definition at line 49 of file InterpKernelGeo2DElementaryEdge.hxx.

{ _ptr->applySimilarity(xBary,yBary,dimChar); }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::applySimilarity ( double  xBary,
double  yBary,
double  dimChar 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::applySimilarity ( double  xBary,
double  yBary,
double  dimChar 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::applySimilarity ( double  xBary,
double  yBary,
double  dimChar 
)
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::applySimilarity ( double  xBary,
double  yBary,
double  dimChar 
) [virtual]

apply a similiraty transformation on 'this'

INTERP_KERNEL::INTERPKERNEL_EXPORT::ArcCSegIntersector ( const EdgeArcCircle e1,
const EdgeLin e2,
bool  reverse = true 
)
static bool INTERP_KERNEL::INTERPKERNEL_EXPORT::areArcsOverlapped ( const EdgeArcCircle a1,
const EdgeArcCircle a2 
) [static, private]
static bool INTERP_KERNEL::INTERPKERNEL_EXPORT::areDoubleEquals ( double  a,
double  b 
) [static, private]
static bool INTERP_KERNEL::INTERPKERNEL_EXPORT::areDoubleEquals ( double  a,
double  b 
) [inline, static]

Definition at line 83 of file InterpKernelGeo2DNode.hxx.

{ return fabs(a-b) < QUADRATIC_PLANAR::_precision; }
static bool INTERP_KERNEL::INTERPKERNEL_EXPORT::areDoubleEqualsWP ( double  a,
double  b,
double  k 
) [inline, static]

idem areDoubleEquals except that precision of comparison is modified.

Definition at line 85 of file InterpKernelGeo2DNode.hxx.

{ return fabs(a-b) < k*QUADRATIC_PLANAR::_precision; }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::areOverlappedOrOnlyColinears ( const Bounds whereToFind,
bool &  obviousNoIntersection,
bool &  areOverlapped 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::areOverlappedOrOnlyColinears ( const Bounds whereToFind,
bool &  obviousNoIntersection,
bool &  areOverlapped 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::areOverlappedOrOnlyColinears ( const Bounds whereToFind,
bool &  obviousNoIntersection,
bool &  areOverlapped 
)
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::areOverlappedOrOnlyColinears ( const Bounds whereToFind,
bool &  obviousNoIntersection,
bool &  areOverlapped 
) [pure virtual]

Should be called only once per association.

Definition at line 52 of file Interpolation.hxx.

{ return static_cast<TrueMainInterpolator&>(*this); }
Interpolation3D2D & INTERP_KERNEL::Interpolation< Interpolation3D2D >::asLeaf ( ) [inline, protected, inherited]

Definition at line 52 of file Interpolation.hxx.

{ return static_cast<TrueMainInterpolator&>(*this); }
Interpolation3D & INTERP_KERNEL::Interpolation< Interpolation3D >::asLeaf ( ) [inline, protected, inherited]

Definition at line 52 of file Interpolation.hxx.

{ return static_cast<TrueMainInterpolator&>(*this); }

Definition at line 52 of file Interpolation.hxx.

{ return static_cast<TrueMainInterpolator&>(*this); }

Definition at line 53 of file InterpolationPlanar.hxx.

{ return static_cast<RealPlanar&>(*this); }

Definition at line 54 of file InterpolationPlanar.hxx.

{ return static_cast< const RealPlanar& >(*this); }

Definition at line 113 of file InterpKernelGeo2DEdge.hxx.

{ _node->setLoc(_loc_of_node); }

Definition at line 77 of file InterpKernelGeo2DComposedEdge.hxx.

{ return _sub_edges.back(); }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::backwardSubstitution ( double *  x,
const double *  lu,
const double *  b,
const int *  idx 
) const [private]
INTERP_KERNEL::INTERPKERNEL_EXPORT::BoundingBox ( const double **  pts,
const unsigned  numPts 
)

disallow copying

Definition at line 43 of file InterpKernelGeo2DBounds.hxx.

:_x_min(0.),_x_max(0.),_y_min(0.),_y_max(0.) { }
INTERP_KERNEL::INTERPKERNEL_EXPORT::Bounds ( double  xMin,
double  xMax,
double  yMin,
double  yMax 
) [inline]

Definition at line 51 of file InterpKernelGeo2DBounds.hxx.

:_x_min(xMin),_x_max(xMax),_y_min(yMin),_y_max(yMax) { }
static Function* INTERP_KERNEL::INTERPKERNEL_EXPORT::buildBinaryFuncFromString ( const char *  type) throw (INTERP_KERNEL::Exception) [static]
static Function* INTERP_KERNEL::INTERPKERNEL_EXPORT::buildBinaryFuncFromString ( char  type) throw (INTERP_KERNEL::Exception) [static]
static void INTERP_KERNEL::INTERPKERNEL_EXPORT::BuildDbgFile ( const std::vector< Node * > &  nodes,
const char *  fileName 
) [static]
static Edge* INTERP_KERNEL::INTERPKERNEL_EXPORT::BuildEdgeFrom ( Node start,
Node end 
) [static]
template<TypeOfMod4QuadEdge type>
static Edge* INTERP_KERNEL::INTERPKERNEL_EXPORT::BuildEdgeFrom ( Node start,
Node middle,
Node end 
) [static]
static ElementaryEdge* INTERP_KERNEL::INTERPKERNEL_EXPORT::BuildEdgeFromCrudeDataArray ( bool  direction,
INTERP_KERNEL::Node *  start,
INTERP_KERNEL::Node *  end 
) [static]
Edge* INTERP_KERNEL::INTERPKERNEL_EXPORT::buildEdgeLyingOnMe ( Node start,
Node end,
bool  direction 
) const [protected]
Edge* INTERP_KERNEL::INTERPKERNEL_EXPORT::buildEdgeLyingOnMe ( Node start,
Node end,
bool  direction = true 
) const [protected]
virtual Edge* INTERP_KERNEL::INTERPKERNEL_EXPORT::buildEdgeLyingOnMe ( Node start,
Node end,
bool  direction = true 
) const [pure virtual]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::buildFromCrudeDataArray ( const std::map< int, INTERP_KERNEL::Node * > &  mapp,
bool  isQuad,
const int *  nodalBg,
const double *  coords,
const int *  descBg,
const int *  descEnd,
const std::vector< std::vector< int > > &  intersectEdges 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::buildFromCrudeDataArray2 ( const std::map< int, INTERP_KERNEL::Node * > &  mapp,
bool  isQuad,
const int *  nodalBg,
const double *  coords,
const int *  descBg,
const int *  descEnd,
const std::vector< std::vector< int > > &  intersectEdges,
const INTERP_KERNEL::QuadraticPolygon &  pol1,
const int *  descBg1,
const int *  descEnd1,
const std::vector< std::vector< int > > &  intersectEdges1,
const std::vector< std::vector< int > > &  colinear1 
)
static EdgeArcCircle* INTERP_KERNEL::INTERPKERNEL_EXPORT::BuildFromNodes ( Node start,
Node middle,
Node end 
) [static]
static Edge* INTERP_KERNEL::INTERPKERNEL_EXPORT::BuildFromXfigLine ( std::istream &  str) [static]
static Function* INTERP_KERNEL::INTERPKERNEL_EXPORT::buildFuncFromString ( const char *  type,
int  nbOfParams 
) throw (INTERP_KERNEL::Exception) [static]
static LeafExpr* INTERP_KERNEL::INTERPKERNEL_EXPORT::buildInstanceFrom ( const std::string &  expr) throw (INTERP_KERNEL::Exception) [static]
static EdgeIntersector* INTERP_KERNEL::INTERPKERNEL_EXPORT::BuildIntersectorWith ( const Edge e1,
const Edge e2 
) [static]
static QuadraticPolygon* INTERP_KERNEL::INTERPKERNEL_EXPORT::BuildLinearPolygon ( std::vector< Node * > &  nodes) [static]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::buildPartitionsAbs ( QuadraticPolygon other,
const std::map< INTERP_KERNEL::Node *, int > &  mapp,
int  idThis,
int  idOther,
int  offset,
std::vector< double > &  addCoordsQuadratic,
std::vector< int > &  conn,
std::vector< int > &  connI,
std::vector< int > &  nb1,
std::vector< int > &  nb2 
)

Retrieves a point that is owning to this, well placed for IN/OUT detection of this. Typically midlle of this is returned.

static std::string INTERP_KERNEL::INTERPKERNEL_EXPORT::buildStringFromFortran ( const char *  expr,
int  lgth 
) [static]
static Function* INTERP_KERNEL::INTERPKERNEL_EXPORT::buildTernaryFuncFromString ( const char *  type) throw (INTERP_KERNEL::Exception) [static]
static Function* INTERP_KERNEL::INTERPKERNEL_EXPORT::buildUnaryFuncFromString ( const char *  type) throw (INTERP_KERNEL::Exception) [static]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::calcIntersectionPtSegmentEdge ( const TriSegment  seg,
const TetraEdge  edge,
double *  pt 
) const [protected]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::calcIntersectionPtSegmentFacet ( const TriSegment  seg,
const TetraFacet  facet,
double *  pt 
) const [protected]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::calcIntersectionPtSegmentHalfstrip ( const TriSegment  seg,
const TetraEdge  edge,
double *  pt 
) const [protected]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::calcIntersectionPtSurfaceEdge ( const TetraEdge  edge,
double *  pt 
) const [protected]
double INTERP_KERNEL::INTERPKERNEL_EXPORT::calcStableC ( const TriSegment  seg,
const DoubleProduct  dp 
) const [inline, protected]
double INTERP_KERNEL::INTERPKERNEL_EXPORT::calcStableT ( const TetraCorner  corner) const [inline, protected]
double INTERP_KERNEL::INTERPKERNEL_EXPORT::calcTByDevelopingRow ( const TetraCorner  corner,
const int  row = 1,
const bool  project = false 
) const [protected]
static double INTERP_KERNEL::Interpolation< InterpolationPlanar< Interpolation3DSurf > >::CalculateCharacteristicSizeOfMeshes ( const MyMeshType &  myMeshS,
const MyMeshType &  myMeshT,
const int  printLevel 
) [static, inherited]
static double INTERP_KERNEL::Interpolation< Interpolation3D2D >::CalculateCharacteristicSizeOfMeshes ( const MyMeshType &  myMeshS,
const MyMeshType &  myMeshT,
const int  printLevel 
) [static, inherited]
static double INTERP_KERNEL::Interpolation< Interpolation3D >::CalculateCharacteristicSizeOfMeshes ( const MyMeshType &  myMeshS,
const MyMeshType &  myMeshT,
const int  printLevel 
) [static, inherited]
static double INTERP_KERNEL::Interpolation< InterpolationCurve< Interpolation2DCurve > >::CalculateCharacteristicSizeOfMeshes ( const MyMeshType &  myMeshS,
const MyMeshType &  myMeshT,
const int  printLevel 
) [static, inherited]
double* INTERP_KERNEL::INTERPKERNEL_EXPORT::calculateCoords ( NormalizedCellType  theGeometry,
const double *  theNodeCoords,
const int  theSpaceDim,
const int *  theIndex 
) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::calculateCoords ( NormalizedCellType  theGeometry,
const double *  theNodeCoords,
const int  theSpaceDim,
const int *  theIndex,
double *  result 
) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::calculateCoordsAlg ( const GaussInfo info,
const double *  theNodeCoords,
const int  theSpaceDim,
const int *  theIndex,
double *  result 
) [private]
double INTERP_KERNEL::INTERPKERNEL_EXPORT::calculateDistanceCornerSegment ( const TetraCorner  corner,
const TriSegment  seg 
) const [protected]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::calculatePolygonBarycenter ( const IntersectionPolygon  poly,
double *  barycenter 
) [protected]
double INTERP_KERNEL::INTERPKERNEL_EXPORT::calculateVolumeUnderPolygon ( IntersectionPolygon  poly,
const double *  barycenter 
) [protected]
double INTERP_KERNEL::INTERPKERNEL_EXPORT::calcUnstableC ( const TriSegment  seg,
const DoubleProduct  dp 
) const [inline, protected]
bool INTERP_KERNEL::INTERPKERNEL_EXPORT::changeEndNodeWithAndKeepTrack ( Node otherEndNode,
std::vector< Node * > &  track 
) const

for tests

bool INTERP_KERNEL::INTERPKERNEL_EXPORT::changeStartNodeWithAndKeepTrack ( Node otherStartNode,
std::vector< Node * > &  track 
) const
static void INTERP_KERNEL::Interpolation< InterpolationPlanar< Interpolation3DSurf > >::checkAndSplitInterpolationMethod ( const char *  method,
std::string &  srcMeth,
std::string &  trgMeth 
) throw (INTERP_KERNEL::Exception) [static, inherited]
static void INTERP_KERNEL::Interpolation< Interpolation3D2D >::checkAndSplitInterpolationMethod ( const char *  method,
std::string &  srcMeth,
std::string &  trgMeth 
) throw (INTERP_KERNEL::Exception) [static, inherited]
static void INTERP_KERNEL::Interpolation< Interpolation3D >::checkAndSplitInterpolationMethod ( const char *  method,
std::string &  srcMeth,
std::string &  trgMeth 
) throw (INTERP_KERNEL::Exception) [static, inherited]
static void INTERP_KERNEL::Interpolation< InterpolationCurve< Interpolation2DCurve > >::checkAndSplitInterpolationMethod ( const char *  method,
std::string &  srcMeth,
std::string &  trgMeth 
) throw (INTERP_KERNEL::Exception) [static, inherited]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::checkBracketsParity ( ) const throw (INTERP_KERNEL::Exception) [private]
static std::list<QuadraticPolygon *>::iterator INTERP_KERNEL::INTERPKERNEL_EXPORT::CheckInList ( Node n,
std::list< QuadraticPolygon * >::iterator  iStart,
std::list< QuadraticPolygon * >::iterator  iEnd 
) [static, protected]
static const ValueDouble* INTERP_KERNEL::INTERPKERNEL_EXPORT::checkSameType ( const Value *  val) throw (INTERP_KERNEL::Exception) [static, private]
static const ValueUnit* INTERP_KERNEL::INTERPKERNEL_EXPORT::checkSameType ( const Value *  val) throw (INTERP_KERNEL::Exception) [static, private]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::clearAll ( std::list< ElementaryEdge * >::iterator  startToDel) [private]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::closePolygons ( std::list< QuadraticPolygon * > &  pol2Zip,
const QuadraticPolygon pol1,
std::vector< QuadraticPolygon * > &  results 
) const [protected]
static int INTERP_KERNEL::INTERPKERNEL_EXPORT::CombineCodes ( TypeOfLocInEdge  code1,
TypeOfLocInEdge  code2 
) [static, protected]
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::compileX86 ( std::vector< std::string > &  ass) const [pure virtual]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::compileX86 ( std::vector< std::string > &  ass) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::compileX86 ( std::vector< std::string > &  ass) const
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::compileX86_64 ( std::vector< std::string > &  ass) const [pure virtual]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::compileX86_64 ( std::vector< std::string > &  ass) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::compileX86_64 ( std::vector< std::string > &  ass) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::compileX86_64LowLev ( std::vector< std::string > &  ass) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::compileX86LowLev ( std::vector< std::string > &  ass) const

Definition at line 38 of file InterpKernelGeo2DElementaryEdge.hxx.

{ return false; }

Definition at line 71 of file InterpKernelGeo2DComposedEdge.hxx.

{ return getEndNode()==getStartNode(); }

Here is the call graph for this function:

Definition at line 42 of file InterpKernelGeo2DComposedEdge.hxx.

{ }

Definition at line 44 of file InterpKernelGeo2DComposedEdge.hxx.

:_sub_edges(sz) { }
static double INTERP_KERNEL::INTERPKERNEL_EXPORT::computeAngle ( const double *  pt1,
const double *  pt2 
) [static]
static double INTERP_KERNEL::INTERPKERNEL_EXPORT::computeSlope ( const double *  pt1,
const double *  pt2 
) [static]
double INTERP_KERNEL::INTERPKERNEL_EXPORT::convert ( const Unit target,
double  sourceVal 
) const

Definition at line 130 of file InterpolationOptions.hxx.

{ *this = other; }
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::cos ( ) throw (INTERP_KERNEL::Exception) [pure virtual]

Here is the caller graph for this function:

void INTERP_KERNEL::INTERPKERNEL_EXPORT::cos ( ) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::cos ( ) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::cos ( ) throw (INTERP_KERNEL::Exception)
static int INTERP_KERNEL::INTERPKERNEL_EXPORT::couldItBeConsideredAsInt ( double  val) throw (INTERP_KERNEL::Exception) [static, private]
INTERP_KERNEL::INTERPKERNEL_EXPORT::CrossTypeEdgeIntersector ( const Edge e1,
const Edge e2,
bool  reverse 
) [inline, protected]

Definition at line 176 of file InterpKernelGeo2DEdge.hxx.

Definition at line 58 of file InterpKernelGeo2DAbstractEdge.hxx.

{ return *_deep_it; }
static int INTERP_KERNEL::INTERPKERNEL_EXPORT::dataSize ( int  dim) [static]

Definition at line 40 of file InterpKernelGeo2DElementaryEdge.hxx.

{ _ptr->declareIn(); }

Definition at line 59 of file InterpKernelGeo2DNode.hxx.

{ if(_loc==UNKNOWN) _loc=IN_1; }

Definition at line 39 of file InterpKernelGeo2DElementaryEdge.hxx.

{ _ptr->declareOn(); }

Definition at line 60 of file InterpKernelGeo2DNode.hxx.

{ if(_loc==UNKNOWN) _loc=ON_1; }

Definition at line 61 of file InterpKernelGeo2DNode.hxx.

Definition at line 63 of file InterpKernelGeo2DNode.hxx.

Definition at line 41 of file InterpKernelGeo2DElementaryEdge.hxx.

{ _ptr->declareOut(); }

Definition at line 62 of file InterpKernelGeo2DNode.hxx.

{ if(_loc==UNKNOWN) _loc=OUT_1; }
static void INTERP_KERNEL::INTERPKERNEL_EXPORT::Delete ( ComposedEdge pt) [inline, static]

Definition at line 45 of file InterpKernelGeo2DComposedEdge.hxx.

{ delete pt; }
static std::string INTERP_KERNEL::INTERPKERNEL_EXPORT::deleteWhiteSpaces ( const std::string &  expr) [static]
INTERP_KERNEL::INTERPKERNEL_EXPORT::DirectedBoundingBox ( const double *  pts,
const unsigned  numPts,
const unsigned  dim 
)
INTERP_KERNEL::INTERPKERNEL_EXPORT::DirectedBoundingBox ( const double **  pts,
const unsigned  numPts,
const unsigned  dim 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dispatchPerimeter ( double &  partConsidered) const
double INTERP_KERNEL::INTERPKERNEL_EXPORT::dispatchPerimeterAdv ( const ComposedEdge father,
std::vector< double > &  result 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dispatchPerimeterExcl ( double &  partConsidered,
double &  commonPart 
) const
static double INTERP_KERNEL::INTERPKERNEL_EXPORT::distanceBtw2Pt ( const double *  a,
const double *  b 
) [inline, static]

Definition at line 86 of file InterpKernelGeo2DNode.hxx.

{ return sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1])); }

Here is the call graph for this function:

static double INTERP_KERNEL::INTERPKERNEL_EXPORT::distanceBtw2PtSq ( const double *  a,
const double *  b 
) [inline, static]

Definition at line 87 of file InterpKernelGeo2DNode.hxx.

{ return (a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]); }
virtual Value* INTERP_KERNEL::INTERPKERNEL_EXPORT::div ( const Value *  other) const throw (INTERP_KERNEL::Exception) [pure virtual]
Value* INTERP_KERNEL::INTERPKERNEL_EXPORT::div ( const Value *  other) const throw (INTERP_KERNEL::Exception)
Value* INTERP_KERNEL::INTERPKERNEL_EXPORT::div ( const Value *  other) const throw (INTERP_KERNEL::Exception)
Value* INTERP_KERNEL::INTERPKERNEL_EXPORT::div ( const Value *  other) const throw (INTERP_KERNEL::Exception)
bool INTERP_KERNEL::INTERPKERNEL_EXPORT::doIHaveSameDirectionAs ( const Edge other) const [inline]

Definition at line 93 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return false; }
bool INTERP_KERNEL::InterpolationPlanar< Interpolation3DSurf >::doRotate ( ) const [inline, inherited]

Definition at line 47 of file InterpolationPlanar.hxx.

{ return asLeafInterpPlanar().doRotate(); }
static double INTERP_KERNEL::INTERPKERNEL_EXPORT::dot ( const double *  vect1,
const double *  vect2 
) [inline, static]

Definition at line 80 of file InterpKernelGeo2DNode.hxx.

{ return vect1[0]*vect2[0]+vect1[1]*vect2[1]; }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dumpInXfigFile ( const char *  fileName) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dumpInXfigFile ( std::ostream &  stream,
bool  direction,
int  resolution,
const Bounds box 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dumpInXfigFile ( std::ostream &  stream,
int  resolution,
const Bounds box 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dumpInXfigFile ( std::ostream &  stream,
int  resolution,
const Bounds box 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dumpInXfigFile ( std::ostream &  stream,
bool  direction,
int  resolution,
const Bounds box 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dumpInXfigFile ( std::ostream &  stream,
int  resolution,
const Bounds box 
) const [protected]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dumpInXfigFile ( std::ostream &  stream,
int  resolution,
const Bounds box 
) const
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::dumpInXfigFile ( std::ostream &  stream,
bool  direction,
int  resolution,
const Bounds box 
) const [pure virtual]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dumpInXfigFileWithOther ( const ComposedEdge other,
const char *  fileName 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dynCastFunction ( const EdgeLin *&  seg,
const EdgeArcCircle *&  arcSeg 
) const [inline]

Definition at line 72 of file InterpKernelGeo2DEdgeLin.hxx.

                                                              { seg=this; }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::dynCastFunction ( const EdgeLin *&  seg,
const EdgeArcCircle *&  arcSeg 
) const [inline]

Definition at line 89 of file InterpKernelGeo2DEdgeArcCircle.hxx.

                                                              { arcSeg=this; }
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::dynCastFunction ( const EdgeLin *&  seg,
const EdgeArcCircle *&  arcSeg 
) const [pure virtual]
INTERP_KERNEL::INTERPKERNEL_EXPORT::Edge ( Node start,
Node end,
bool  direction = true 
) [inline]

Definition at line 200 of file InterpKernelGeo2DEdge.hxx.

:_cnt(1),_loc(FULL_UNKNOWN) { if(direction) { _start=start; _end=end; } else { _start=end; _end=start; } _start->incrRef(); _end->incrRef(); }
INTERP_KERNEL::INTERPKERNEL_EXPORT::Edge ( double  sX,
double  sY,
double  eX,
double  eY 
)

Definition at line 271 of file InterpKernelGeo2DEdge.hxx.

:_cnt(1),_loc(FULL_UNKNOWN),_start(0),_end(0) { }
INTERP_KERNEL::INTERPKERNEL_EXPORT::EdgeArcCircle ( std::istream &  lineInXfig)

Here is the caller graph for this function:

INTERP_KERNEL::INTERPKERNEL_EXPORT::EdgeArcCircle ( Node start,
Node middle,
Node end,
bool  direction = true 
)
INTERP_KERNEL::INTERPKERNEL_EXPORT::EdgeArcCircle ( double  sX,
double  sY,
double  mX,
double  mY,
double  eX,
double  eY 
)
INTERP_KERNEL::INTERPKERNEL_EXPORT::EdgeArcCircle ( Node start,
Node end,
const double *  center,
double  radius,
double  angle0,
double  deltaAngle,
bool  direction = true 
)
INTERP_KERNEL::INTERPKERNEL_EXPORT::EdgeIntersector ( const Edge e1,
const Edge e2 
) [inline, protected]

All non symetric methods are relative to 'e1'.

Definition at line 145 of file InterpKernelGeo2DEdge.hxx.

:_e1(e1),_e2(e2) { }
INTERP_KERNEL::INTERPKERNEL_EXPORT::EdgeLin ( std::istream &  lineInXfig)
INTERP_KERNEL::INTERPKERNEL_EXPORT::EdgeLin ( Node start,
Node end,
bool  direction = true 
)
INTERP_KERNEL::INTERPKERNEL_EXPORT::EdgeLin ( double  sX,
double  sY,
double  eX,
double  eY 
)

Definition at line 75 of file InterpKernelGeo2DEdgeLin.hxx.

{ }

Here is the caller graph for this function:

INTERP_KERNEL::INTERPKERNEL_EXPORT::ElementaryEdge ( Edge ptr,
bool  direction 
) [inline]

Definition at line 33 of file InterpKernelGeo2DElementaryEdge.hxx.

:_direction(direction),_ptr(ptr) { }

Definition at line 75 of file InterpKernelGeo2DComposedEdge.hxx.

{ return _sub_edges.empty(); }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::enlarge ( const double  tol)
double INTERP_KERNEL::INTERPKERNEL_EXPORT::evaluate ( ) const throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::evaluateExpr ( int  szOfOutParam,
const double *  inParam,
double *  outParam 
) const throw (INTERP_KERNEL::Exception)
Value* INTERP_KERNEL::INTERPKERNEL_EXPORT::evaluateLowLev ( Value *  valGen) const throw (INTERP_KERNEL::Exception) [private]

Here is the caller graph for this function:

INTERP_KERNEL::INTERPKERNEL_EXPORT::Exception ( const char *  reason,
const char *  file,
int  line 
)
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::exp ( ) throw (INTERP_KERNEL::Exception) [pure virtual]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::exp ( ) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::exp ( ) throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::exp ( ) throw (INTERP_KERNEL::Exception)
INTERP_KERNEL::INTERPKERNEL_EXPORT::ExprParser ( const char *  expr,
ExprParser father = 0 
)
INTERP_KERNEL::INTERPKERNEL_EXPORT::ExprParser ( const char *  expr,
int  lgth,
ExprParser father = 0 
)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::factorizeLU ( double *  lu,
int *  idx 
) const [private]
std::list<QuadraticPolygon *>::iterator INTERP_KERNEL::INTERPKERNEL_EXPORT::fillAsMuchAsPossibleWith ( const QuadraticPolygon pol1Splitted,
std::list< QuadraticPolygon * >::iterator  iStart,
std::list< QuadraticPolygon * >::iterator  iEnd,
bool  direction 
) [protected]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs ( const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< int > &  edgesThis,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int >  mapAddCoo 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs ( bool  direction,
const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< int > &  edgesThis,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int >  mapAddCoo 
) const [protected]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs ( const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int > &  mapAddCoo,
int *  nodeId 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs ( bool  direction,
const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< int > &  edgesThis,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int >  mapAddCoo 
) const [protected]
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs ( bool  direction,
const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< int > &  edgesThis,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int >  mapAddCoo 
) const [pure virtual]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs2 ( const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< int > &  edgesOther,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int > &  mapAddCoo 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs2 ( const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< int > &  edgesOther,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int > &  mapAddCoo 
) const [protected]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs2 ( const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int > &  mapAddCoo,
std::vector< int > &  pointsOther 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs2 ( const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< int > &  edgesOther,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int > &  mapAddCoo 
) const [protected]
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillGlobalInfoAbs2 ( const std::map< INTERP_KERNEL::Node *, int > &  mapThis,
const std::map< INTERP_KERNEL::Node *, int > &  mapOther,
int  offset1,
int  offset2,
double  fact,
double  baryX,
double  baryY,
std::vector< int > &  edgesOther,
std::vector< double > &  addCoo,
std::map< INTERP_KERNEL::Node *, int > &  mapAddCoo 
) const [pure virtual]
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillValue ( Value *  val) const throw (INTERP_KERNEL::Exception) [pure virtual]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillValue ( Value *  val) const throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillValue ( Value *  val) const throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillValuesInExpr ( std::vector< double > &  valuesInExpr) throw (INTERP_KERNEL::Exception) [private]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fillXfigStreamForLoc ( std::ostream &  stream) const
std::string INTERP_KERNEL::INTERPKERNEL_EXPORT::filterInterpolationMethod ( const std::string &  meth) const
static std::size_t INTERP_KERNEL::INTERPKERNEL_EXPORT::FindCorrespondingOpenBracket ( const std::string &  expr,
std::size_t  posOfCloseBracket 
) [static, private]

Definition at line 56 of file InterpKernelGeo2DAbstractEdge.hxx.

{ return _deep_it==_list_handle->end(); }

Definition at line 51 of file InterpKernelGeo2DAbstractEdge.hxx.

{ _deep_it=_list_handle->begin(); }
int INTERP_KERNEL::INTERPKERNEL_EXPORT::fitXForXFig ( double  val,
int  res 
) const [inline]

Definition at line 55 of file InterpKernelGeo2DBounds.hxx.

{ return (int)fitXForXFigD(val,res); }

Here is the call graph for this function:

double INTERP_KERNEL::INTERPKERNEL_EXPORT::fitXForXFigD ( double  val,
int  res 
) const

Here is the caller graph for this function:

int INTERP_KERNEL::INTERPKERNEL_EXPORT::fitYForXFig ( double  val,
int  res 
) const [inline]

Definition at line 56 of file InterpKernelGeo2DBounds.hxx.

{ return (int)fitYForXFigD(val,res); }

Here is the call graph for this function:

double INTERP_KERNEL::INTERPKERNEL_EXPORT::fitYForXFigD ( double  val,
int  res 
) const

Here is the caller graph for this function:

void INTERP_KERNEL::INTERPKERNEL_EXPORT::forwardSubstitution ( double *  x,
const double *  lu,
const double *  b,
const int *  idx 
) const [private]
int INTERP_KERNEL::Interpolation< Interpolation3D >::fromIntegralUniform ( const MyMeshType &  meshT,
MatrixType &  result,
const char *  method 
) [inline, inherited]

Definition at line 42 of file Interpolation.hxx.

{ return fromToIntegralUniform(false,meshT,result,method); }
int INTERP_KERNEL::Interpolation< InterpolationPlanar< Interpolation3DSurf > >::fromIntegralUniform ( const MyMeshType &  meshT,
MatrixType &  result,
const char *  method 
) [inline, inherited]

Definition at line 42 of file Interpolation.hxx.

{ return fromToIntegralUniform(false,meshT,result,method); }
int INTERP_KERNEL::Interpolation< Interpolation3D2D >::fromIntegralUniform ( const MyMeshType &  meshT,
MatrixType &  result,
const char *  method 
) [inline, inherited]

Definition at line 42 of file Interpolation.hxx.

{ return fromToIntegralUniform(false,meshT,result,method); }
int INTERP_KERNEL::Interpolation< InterpolationCurve< Interpolation2DCurve > >::fromIntegralUniform ( const MyMeshType &  meshT,
MatrixType &  result,
const char *  method 
) [inline, inherited]

Definition at line 42 of file Interpolation.hxx.

{ return fromToIntegralUniform(false,meshT,result,method); }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::fromLocalCS ( const double *  p,
double *  pGlob 
) const [private]
int INTERP_KERNEL::Interpolation< InterpolationPlanar< Interpolation3DSurf > >::fromToIntegralUniform ( bool  fromTo,
const MyMeshType &  mesh,
MatrixType &  result,
const char *  method 
) [protected, inherited]
int INTERP_KERNEL::Interpolation< Interpolation3D2D >::fromToIntegralUniform ( bool  fromTo,
const MyMeshType &  mesh,
MatrixType &  result,
const char *  method 
) [protected, inherited]
int INTERP_KERNEL::Interpolation< Interpolation3D >::fromToIntegralUniform ( bool  fromTo,
const MyMeshType &  mesh,
MatrixType &  result,
const char *  method 
) [protected, inherited]
int INTERP_KERNEL::Interpolation< InterpolationCurve< Interpolation2DCurve > >::fromToIntegralUniform ( bool  fromTo,
const MyMeshType &  mesh,
MatrixType &  result,
const char *  method 
) [protected, inherited]

Definition at line 76 of file InterpKernelGeo2DComposedEdge.hxx.

{ return _sub_edges.front(); }
INTERP_KERNEL::INTERPKERNEL_EXPORT::GaussInfo ( NormalizedCellType  theGeometry,
const DataVector theGaussCoord,
int  theNbGauss,
const DataVector theReferenceCoord,
int  theNbRef 
)
static double INTERP_KERNEL::INTERPKERNEL_EXPORT::GetAbsoluteAngle ( const double *  vect,
double &  normVect 
) [static]
static double INTERP_KERNEL::INTERPKERNEL_EXPORT::GetAbsoluteAngleOfNormalizedVect ( double  ux,
double  uy 
) [static]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getAllNodes ( std::set< Node * > &  output) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getAllNodes ( std::set< Node * > &  output) const
double INTERP_KERNEL::INTERPKERNEL_EXPORT::getAngle ( Node node) const [private]

return angle in ]-Pi;Pi[ - 'node' must be on curve of '_e1'

Definition at line 98 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return _angle; }

Definition at line 96 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return _angle0; }
static void INTERP_KERNEL::INTERPKERNEL_EXPORT::GetArcOfCirclePassingThru ( const double *  start,
const double *  middle,
const double *  end,
double *  center,
double &  radius,
double &  angleInRad,
double &  angleInRad0 
) [static]

Definition at line 46 of file InterpKernelGeo2DElementaryEdge.hxx.

{ double ret=_ptr->getAreaOfZone(); return _direction?ret:-ret; }
virtual double INTERP_KERNEL::INTERPKERNEL_EXPORT::getAreaOfZone ( ) const [pure virtual]

returns area between this and axe Ox delimited along Ox by _start and _end.

void INTERP_KERNEL::INTERPKERNEL_EXPORT::getBarycenter ( double &  xBary,
double &  yBary 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getBarycenter ( double *  bary,
double &  weigh 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getBarycenter ( double *  bary,
double &  weigh 
) const
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::getBarycenter ( double *  bary) const [pure virtual]
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::getBarycenterOfZone ( double *  bary) const [pure virtual]

Definition at line 79 of file InterpolationOptions.hxx.

Definition at line 82 of file InterpolationOptions.hxx.

Definition at line 209 of file InterpKernelGeo2DEdge.hxx.

{ return _bounds; }

Definition at line 66 of file InterpKernelGeo2DBounds.hxx.

Here is the call graph for this function:

const double* INTERP_KERNEL::INTERPKERNEL_EXPORT::getCenter ( ) const [inline]

Definition at line 91 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return _center; }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getCenter ( double *  center) const [inline]

Definition at line 92 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ center[0]=_center[0]; center[1]=_center[1]; }
virtual double INTERP_KERNEL::INTERPKERNEL_EXPORT::getCharactValue ( const Node node) const [pure virtual]

node is expected to lay on 'this'. It returns a characteristic magnitude usable by isIn method.

virtual double INTERP_KERNEL::INTERPKERNEL_EXPORT::getCharactValueBtw0And1 ( const Node node) const [pure virtual]

node is expected to lay on 'this'. It returns a characteristic magnitude between 0 and 1.

double INTERP_KERNEL::INTERPKERNEL_EXPORT::getCharactValueEng ( const double *  node) const
double INTERP_KERNEL::INTERPKERNEL_EXPORT::getCoordinate ( const BoxCoord  coord) const [inline]
const double* INTERP_KERNEL::INTERPKERNEL_EXPORT::getCorner ( TriCorner  corner) const [inline]

Definition at line 147 of file TransformedTriangle.hxx.

{ return _coords + 5*corner; }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getCorners ( std::vector< double > &  corners,
const double *  minmax 
) const [private]
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getCurveAbscisse ( Node node,
TypeOfLocInEdge where,
MergePoints commonNode 
) const [private]

Definition at line 60 of file InterpKernelGeo2DElementaryEdge.hxx.

{ return _ptr->getCurveLength(); }
virtual double INTERP_KERNEL::INTERPKERNEL_EXPORT::getCurveLength ( ) const [pure virtual]

return the length of arc. Value is always > 0. !

std::vector<double> INTERP_KERNEL::INTERPKERNEL_EXPORT::getData ( ) const

Definition at line 69 of file InterpKernelValue.hxx.

{ return _data; }

Definition at line 107 of file InterpKernelValue.hxx.

{ return _data; }
double* INTERP_KERNEL::INTERPKERNEL_EXPORT::getData ( ) const [inline]

Definition at line 143 of file InterpKernelValue.hxx.

{ return _dest_data; }

Definition at line 66 of file InterpKernelGeo2DElementaryEdge.hxx.

{ return _direction; }
double INTERP_KERNEL::INTERPKERNEL_EXPORT::getDistanceToPoint ( const double *  pt) const
double INTERP_KERNEL::INTERPKERNEL_EXPORT::getDistanceToPoint ( const double *  pt) const
virtual double INTERP_KERNEL::INTERPKERNEL_EXPORT::getDistanceToPoint ( const double *  pt) const [pure virtual]

retrieves the distance to this : The min distance from pt and any point of this.

Definition at line 76 of file InterpolationOptions.hxx.

{ return _do_rotate; }
const EdgeArcCircle& INTERP_KERNEL::INTERPKERNEL_EXPORT::getE1 ( ) const [inline, private]

Definition at line 41 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return (const EdgeArcCircle&)_e1; }

Here is the call graph for this function:

const EdgeArcCircle& INTERP_KERNEL::INTERPKERNEL_EXPORT::getE1 ( ) const [inline, private]

Definition at line 56 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return (const EdgeArcCircle&)_e1; }

Here is the call graph for this function:

const EdgeArcCircle& INTERP_KERNEL::INTERPKERNEL_EXPORT::getE2 ( ) const [inline, private]

Definition at line 42 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return (const EdgeArcCircle&)_e2; }

Here is the call graph for this function:

const EdgeLin& INTERP_KERNEL::INTERPKERNEL_EXPORT::getE2 ( ) const [inline, private]

Definition at line 57 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return (const EdgeLin&)_e2; }

Here is the call graph for this function:

Here is the caller graph for this function:

Definition at line 213 of file InterpKernelGeo2DEdge.hxx.

{ return _end; }
static int* INTERP_KERNEL::INTERPKERNEL_EXPORT::getFullPolyh3DCell ( INTERP_KERNEL::NormalizedCellType  type,
const int *  conn,
int  lgth,
int &  retNbOfFaces,
int &  retLgth 
) [static]
const double* INTERP_KERNEL::INTERPKERNEL_EXPORT::getFunctionValues ( const int  theGaussId) const
const short* INTERP_KERNEL::INTERPKERNEL_EXPORT::getInfoForUnit ( const std::string &  unit,
double &  addFact,
double &  mFact 
) const throw (INTERP_KERNEL::Exception)
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getInterceptedArc ( const double *  center,
double  radius,
double &  intrcptArcAngle0,
double &  intrcptArcDelta 
) const

The size of returned vector is equal to number of potential intersections point. The values are so that their are interpretable by virtual Edge::isIn method.

Definition at line 66 of file InterpolationOptions.hxx.

{ return _intersection_type; }

Definition at line 37 of file InterpKernelGeo2DElementaryEdge.hxx.

{ return _iterator; }

Definition at line 93 of file InterpKernelGeo2DComposedEdge.hxx.

{ return &_sub_edges; }

Definition at line 42 of file InterpKernelGeo2DElementaryEdge.hxx.

{ return _ptr->getLoc(); }

Definition at line 58 of file InterpKernelGeo2DNode.hxx.

{ return _loc; }

Definition at line 202 of file InterpKernelGeo2DEdge.hxx.

{ return _loc; }

Definition at line 85 of file InterpolationOptions.hxx.

Definition at line 91 of file InterpolationOptions.hxx.

{ return _measure_abs; }

Definition at line 73 of file InterpolationOptions.hxx.

{ return _median_plane; }
virtual int INTERP_KERNEL::INTERPKERNEL_EXPORT::getNbInputParams ( ) const [pure virtual]

Definition at line 211 of file InterpKernelGeo2DEdge.hxx.

{ if(where==START) return _start; else if(where==END) return _end; else return 0; }

Definition at line 119 of file InterpKernelGeo2DEdge.hxx.

{ Node *tmp=_node; _node=0; return tmp; }

Here is the call graph for this function:

Definition at line 118 of file InterpKernelGeo2DEdge.hxx.

{ return _node; }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getNormalVector ( double *  vectOutput) const

Definition at line 88 of file InterpolationOptions.hxx.

{ return _orientation; }

Definition at line 99 of file InterpolationOptions.hxx.

{ return _P1P0_bary_method; }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getPlacements ( Node start,
Node end,
TypeOfLocInEdge whereStart,
TypeOfLocInEdge whereEnd,
MergePoints commonNode 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getPlacements ( Node start,
Node end,
TypeOfLocInEdge whereStart,
TypeOfLocInEdge whereEnd,
MergePoints commonNode 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getPlacements ( Node start,
Node end,
TypeOfLocInEdge whereStart,
TypeOfLocInEdge whereEnd,
MergePoints commonNode 
) const
virtual void INTERP_KERNEL::INTERPKERNEL_EXPORT::getPlacements ( Node start,
Node end,
TypeOfLocInEdge whereStart,
TypeOfLocInEdge whereEnd,
MergePoints commonNode 
) const [pure virtual]

to call only if 'areOverlapped' have been set to true when areOverlappedOrOnlyColinears was called

const std::vector<double*>& INTERP_KERNEL::INTERPKERNEL_EXPORT::getPolygonA ( ) const [inline]

Definition at line 149 of file TransformedTriangle.hxx.

{ return _polygonA; }

Definition at line 70 of file InterpolationOptions.hxx.

{ return _precision; }

Definition at line 63 of file InterpolationOptions.hxx.

{ return _print_level; }

Definition at line 43 of file InterpKernelGeo2DElementaryEdge.hxx.

{ return _ptr; }

Definition at line 97 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return _radius; }
virtual const char* INTERP_KERNEL::INTERPKERNEL_EXPORT::getRepr ( ) const [pure virtual]

Here is the caller graph for this function:

void INTERP_KERNEL::INTERPKERNEL_EXPORT::getSetOfVars ( std::set< std::string > &  vars) const
double INTERP_KERNEL::INTERPKERNEL_EXPORT::getSlope ( const Node other) const

Definition at line 94 of file InterpolationOptions.hxx.

{ return _splitting_policy; }

Here is the caller graph for this function:

Definition at line 212 of file InterpKernelGeo2DEdge.hxx.

{ return _start; }
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getTranslationParams ( const DecompositionInUnitBase other,
double &  mul,
double &  add 
) const
void INTERP_KERNEL::INTERPKERNEL_EXPORT::getTrueSetOfVars ( std::set< std::string > &  vars) const

Definition at line 55 of file InterpKernelGeo2DEdgeLin.hxx.

{ return SEG; }

Definition at line 88 of file InterpKernelGeo2DEdgeArcCircle.hxx.

{ return ARC_CIRCLE; }

Definition at line 108 of file InterpKernelGeo2DEdge.hxx.

Definition at line 109 of file InterpKernelGeo2DEdge.hxx.

std::string INTERP_KERNEL::INTERPKERNEL_EXPORT::getVar ( ) const [inline]

Definition at line 69 of file InterpKernelExprParser.hxx.

{ return _var_name; }

Definition at line 151 of file TransformedTriangle.hxx.

{ return _volume; }
bool INTERP_KERNEL::INTERPKERNEL_EXPORT::goToNextInOn ( bool  direction,
int &  i,
int  nbMax 
)
virtual Value* INTERP_KERNEL::INTERPKERNEL_EXPORT::greaterThan ( const Value *  other) const throw (INTERP_KERNEL::Exception) [pure virtual]
Value* INTERP_KERNEL::INTERPKERNEL_EXPORT::greaterThan ( const Value *  other) const throw (INTERP_KERNEL::Exception)
Value* INTERP_KERNEL::INTERPKERNEL_EXPORT::greaterThan ( const Value *  other) const throw (INTERP_KERNEL::Exception)
Value* INTERP_KERNEL::INTERPKERNEL_EXPORT::greaterThan ( const Value *  other) const throw (INTERP_KERNEL::Exception)
bool