#include <InterpKernelGeo2DEdge.hxx>
Public Member Functions | |
| 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. | |
| IntersectElement & | operator= (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 |
| Node * | getNodeOnly () const |
| Node * | getNodeAndReleaseIt () |
| ~IntersectElement () | |
Static Public Attributes | |
| static const unsigned | LIMIT_ALONE = 22 |
| static const unsigned | LIMIT_ON = 73 |
| static const unsigned | NO_LIMIT = 19 |
Private Attributes | |
| 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 |
This class is in charge to store an intersection point as result of non oververlapping edge intersection. This class manages the cases when intersect element is one of the extrimities of edge1 and/or edge2.
| IntersectElement::IntersectElement | ( | double | val1, |
| double | val2, | ||
| bool | start1, | ||
| bool | end1, | ||
| bool | start2, | ||
| bool | end2, | ||
| Node * | node, | ||
| const Edge & | e1, | ||
| const Edge & | e2, | ||
| bool | keepOrder | ||
| ) |
| IntersectElement::IntersectElement | ( | const IntersectElement & | other | ) |
References INTERP_KERNEL.IntersectElement._node, and INTERP_KERNEL.Node.incrRef().
| IntersectElement::~IntersectElement | ( | ) |
References INTERP_KERNEL.IntersectElement._node, and INTERP_KERNEL.Node.decrRef().
| bool IntersectElement::operator< | ( | const IntersectElement & | other | ) | const |
The sort operator is done on the edge 1 not edge 2.
References INTERP_KERNEL.IntersectElement._chararct_val_for_e1, INTERP_KERNEL.IntersectElement._e1, and INTERP_KERNEL.Edge.isLower().
| IntersectElement & IntersectElement::operator= | ( | const IntersectElement & | other | ) |
References INTERP_KERNEL.IntersectElement._1E, INTERP_KERNEL.IntersectElement._1S, INTERP_KERNEL.IntersectElement._2E, INTERP_KERNEL.IntersectElement._2S, INTERP_KERNEL.IntersectElement._chararct_val_for_e1, INTERP_KERNEL.IntersectElement._chararct_val_for_e2, INTERP_KERNEL.IntersectElement._node, and INTERP_KERNEL.IntersectElement.setNode().
| double INTERP_KERNEL.IntersectElement.getVal1 | ( | ) | const |
| double INTERP_KERNEL.IntersectElement.getVal2 | ( | ) | const |
| bool IntersectElement::isLowerOnOther | ( | const IntersectElement & | other | ) | const |
idem operator< method except that the orientation is done on edge 2 not edge 1.
References INTERP_KERNEL.IntersectElement._chararct_val_for_e2, INTERP_KERNEL.IntersectElement._e2, and INTERP_KERNEL.Edge.isLower().
| unsigned IntersectElement::isOnExtrForAnEdgeAndInForOtherEdge | ( | ) | const |
References INTERP_KERNEL.IntersectElement._1E, INTERP_KERNEL.IntersectElement._1S, INTERP_KERNEL.IntersectElement._2E, INTERP_KERNEL.IntersectElement._2S, INTERP_KERNEL.IntersectElement._chararct_val_for_e1, INTERP_KERNEL.IntersectElement._chararct_val_for_e2, INTERP_KERNEL.IntersectElement._e1, INTERP_KERNEL.IntersectElement._e2, INTERP_KERNEL.Edge.getEndNode(), INTERP_KERNEL.Edge.getStartNode(), INTERP_KERNEL.Edge.isIn(), INTERP_KERNEL.IntersectElement.LIMIT_ALONE, INTERP_KERNEL.IntersectElement.LIMIT_ON, INTERP_KERNEL.IntersectElement.NO_LIMIT, and INTERP_KERNEL.IntersectElement.setNode().
| void INTERP_KERNEL.IntersectElement.attachLoc | ( | ) |
| bool IntersectElement::isOnMergedExtremity | ( | ) | const |
Returns 0 or 1.
References INTERP_KERNEL.IntersectElement._1E, INTERP_KERNEL.IntersectElement._1S, INTERP_KERNEL.IntersectElement._2E, and INTERP_KERNEL.IntersectElement._2S.
| bool IntersectElement::isIncludedByBoth | ( | ) | const |
| void IntersectElement::setNode | ( | Node * | node | ) | const |
This methode is const because 'node' is supposed to be equal geomitrically to _node.
References INTERP_KERNEL.IntersectElement._node, and INTERP_KERNEL.Node.incrRef().
| void IntersectElement::performMerging | ( | MergePoints & | commonNode | ) | const |
To call if isOnMergedExtremity returned true.
References INTERP_KERNEL.IntersectElement._1E, INTERP_KERNEL.IntersectElement._1S, INTERP_KERNEL.IntersectElement._2E, INTERP_KERNEL.IntersectElement._2S, INTERP_KERNEL.IntersectElement._e1, INTERP_KERNEL.IntersectElement._e2, INTERP_KERNEL.Edge.changeEndNodeWith(), INTERP_KERNEL.Edge.changeStartNodeWith(), INTERP_KERNEL.Node.declareOnLim(), INTERP_KERNEL.MergePoints.end1OnEnd2(), INTERP_KERNEL.MergePoints.end1OnStart2(), INTERP_KERNEL.Edge.getEndNode(), INTERP_KERNEL.Edge.getStartNode(), INTERP_KERNEL.MergePoints.start1OnEnd2(), and INTERP_KERNEL.MergePoints.start1OnStart2().
| Node* INTERP_KERNEL.IntersectElement.getNodeOnly | ( | ) | const |
| Node* INTERP_KERNEL.IntersectElement.getNodeAndReleaseIt | ( | ) |
bool INTERP_KERNEL.IntersectElement._1S [private] |
bool INTERP_KERNEL.IntersectElement._1E [private] |
bool INTERP_KERNEL.IntersectElement._2S [private] |
bool INTERP_KERNEL.IntersectElement._2E [private] |
Node* INTERP_KERNEL.IntersectElement._node [private] |
const Edge& INTERP_KERNEL.IntersectElement._e1 [private] |
const Edge& INTERP_KERNEL.IntersectElement._e2 [private] |
const unsigned INTERP_KERNEL.IntersectElement.LIMIT_ALONE = 22 [static] |
const unsigned INTERP_KERNEL.IntersectElement.LIMIT_ON = 73 [static] |
const unsigned INTERP_KERNEL.IntersectElement.NO_LIMIT = 19 [static] |