Public Member Functions | |
| ElementaryEdge (Edge *ptr, bool direction) | |
| ElementaryEdge (const ElementaryEdge &other) | |
| ~ElementaryEdge () | |
| bool | isThereStartPoint () const |
| IteratorOnComposedEdge & | getIterator () |
| bool | completed () const |
| void | declareOn () const |
| void | declareIn () const |
| void | declareOut () const |
| TypeOfEdgeLocInPolygon | getLoc () const |
| Edge * | getPtr () 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 |
| ElementaryEdge * | clone () const |
| void | initLocations () const |
| int | size () const |
| TypeOfEdgeLocInPolygon | locateFullyMySelfAbsolute (const ComposedEdge &pol) const |
| TypeOfEdgeLocInPolygon | locateFullyMySelf (const ComposedEdge &pol, TypeOfEdgeLocInPolygon precEdgeLoc) const |
| Node * | getEndNode () const |
| Node * | getStartNode () 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 |
Static Public Member Functions | |
| static ElementaryEdge * | BuildEdgeFromCrudeDataArray (bool direction, INTERP_KERNEL::Node *start, INTERP_KERNEL::Node *end) |
| INTERP_KERNEL::ElementaryEdge::ElementaryEdge | ( | Edge * | ptr, |
| bool | direction | ||
| ) |
Referenced by BuildEdgeFromCrudeDataArray(), and clone().
| ElementaryEdge::ElementaryEdge | ( | const ElementaryEdge & | other | ) |
References INTERP_KERNEL::Edge::incrRef().
| ElementaryEdge::~ElementaryEdge | ( | ) |
References INTERP_KERNEL::Edge::decrRef().
| bool INTERP_KERNEL::ElementaryEdge::isThereStartPoint | ( | ) | const |
| IteratorOnComposedEdge& INTERP_KERNEL::ElementaryEdge::getIterator | ( | ) |
| bool INTERP_KERNEL::ElementaryEdge::completed | ( | ) | const |
| void INTERP_KERNEL::ElementaryEdge::declareOn | ( | ) | const |
| void INTERP_KERNEL::ElementaryEdge::declareIn | ( | ) | const |
Referenced by locateFullyMySelf(), and locateFullyMySelfAbsolute().
| void INTERP_KERNEL::ElementaryEdge::declareOut | ( | ) | const |
Referenced by locateFullyMySelf(), and locateFullyMySelfAbsolute().
| TypeOfEdgeLocInPolygon INTERP_KERNEL::ElementaryEdge::getLoc | ( | ) | const |
| Edge* INTERP_KERNEL::ElementaryEdge::getPtr | ( | ) | const |
Referenced by INTERP_KERNEL::QuadraticPolygon::amIAChanceToBeCompletedBy(), INTERP_KERNEL::QuadraticPolygon::buildFromCrudeDataArray2(), INTERP_KERNEL::ComposedEdge::isInOrOut(), AbsEdgeCmp::operator()(), INTERP_KERNEL::QuadraticPolygon::splitAbs(), and INTERP_KERNEL::QuadraticPolygon::SplitPolygonsEachOther().
| void INTERP_KERNEL::ElementaryEdge::reverse | ( | ) |
Referenced by INTERP_KERNEL::QuadraticPolygon::fillAsMuchAsPossibleWith().
| bool ElementaryEdge::isNodeIn | ( | Node * | n | ) | const |
References INTERP_KERNEL::Edge::getEndNode(), and INTERP_KERNEL::Edge::getStartNode().
| double INTERP_KERNEL::ElementaryEdge::getAreaOfZone | ( | ) | const |
| void ElementaryEdge::getBarycenterOfZone | ( | double * | bary | ) | const |
WARNING contrary to INTERP_KERNEL::Edge::getBarycenterOfZone method called, this one is cumulative.
References INTERP_KERNEL::Edge::getBarycenterOfZone().
| void ElementaryEdge::fillBounds | ( | Bounds & | output | ) | const |
References INTERP_KERNEL::Edge::getBounds().
| void INTERP_KERNEL::ElementaryEdge::applySimilarity | ( | double | xBary, |
| double | yBary, | ||
| double | dimChar | ||
| ) |
| void INTERP_KERNEL::ElementaryEdge::unApplySimilarity | ( | double | xBary, |
| double | yBary, | ||
| double | dimChar | ||
| ) |
| void ElementaryEdge::getAllNodes | ( | std::set< Node * > & | output | ) | const |
References INTERP_KERNEL::Edge::getEndNode(), and INTERP_KERNEL::Edge::getStartNode().
| void ElementaryEdge::getBarycenter | ( | double * | bary, |
| double & | weigh | ||
| ) | const |
| ElementaryEdge * ElementaryEdge::clone | ( | ) | const |
| void ElementaryEdge::initLocations | ( | ) | const |
References INTERP_KERNEL::Edge::initLocs().
| int INTERP_KERNEL::ElementaryEdge::size | ( | ) | const |
| TypeOfEdgeLocInPolygon ElementaryEdge::locateFullyMySelfAbsolute | ( | const ComposedEdge & | pol | ) | const |
| TypeOfEdgeLocInPolygon ElementaryEdge::locateFullyMySelf | ( | const ComposedEdge & | pol, |
| TypeOfEdgeLocInPolygon | precEdgeLoc | ||
| ) | const |
WARNING use this method if and only if this is so that it is completely in/out/on of
| pol. |
References declareIn(), declareOut(), INTERP_KERNEL::FULL_IN_1, INTERP_KERNEL::FULL_OUT_1, INTERP_KERNEL::FULL_UNKNOWN, getEndNode(), getLoc(), getStartNode(), INTERP_KERNEL::IN_1, locateFullyMySelfAbsolute(), INTERP_KERNEL::ON_1, INTERP_KERNEL::ON_TANG_1, and INTERP_KERNEL::OUT_1.
Referenced by INTERP_KERNEL::QuadraticPolygon::buildIntersectionPolygons(), and INTERP_KERNEL::QuadraticPolygon::performLocatingOperation().
| Node * ElementaryEdge::getEndNode | ( | ) | const |
References INTERP_KERNEL::Edge::getEndNode(), and INTERP_KERNEL::Edge::getStartNode().
Referenced by INTERP_KERNEL::QuadraticPolygon::fillAsMuchAsPossibleWith(), and locateFullyMySelf().
| Node * ElementaryEdge::getStartNode | ( | ) | const |
| double INTERP_KERNEL::ElementaryEdge::getCurveLength | ( | ) | const |
Referenced by INTERP_KERNEL::ComposedEdge::getCommonLengthWith().
| bool ElementaryEdge::changeEndNodeWith | ( | Node * | node | ) | const |
References INTERP_KERNEL::Edge::changeEndNodeWith(), and INTERP_KERNEL::Edge::changeStartNodeWith().
Referenced by INTERP_KERNEL::QuadraticPolygon::UpdateNeighbours().
| bool ElementaryEdge::changeStartNodeWith | ( | Node * | node | ) | const |
| bool ElementaryEdge::intresicEqual | ( | const ElementaryEdge * | other | ) | const |
| bool ElementaryEdge::intresicEqualDirSensitive | ( | const ElementaryEdge * | other | ) | const |
| void ElementaryEdge::dumpInXfigFile | ( | std::ostream & | stream, |
| int | resolution, | ||
| const Bounds & | box | ||
| ) | const |
References INTERP_KERNEL::Edge::dumpInXfigFile().
| bool INTERP_KERNEL::ElementaryEdge::getDirection | ( | ) | const |
| bool ElementaryEdge::intresincEqCoarse | ( | const Edge * | other | ) | const |
| bool ElementaryEdge::isEqual | ( | const ElementaryEdge & | other | ) | const |
References INTERP_KERNEL::Edge::isEqual().
| void ElementaryEdge::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 |
Called by QuadraticPolygon::splitAbs method.
References INTERP_KERNEL::Edge::fillGlobalInfoAbs().
| void ElementaryEdge::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 |
Called by QuadraticPolygon::splitAbs method. Close to ElementaryEdge::fillGlobalInfoAbs method expect that here edgesOther (that replace edgesThis) is here an in/out parameter that only contains nodes unsorted because the "other" mesh is not subdivided yet.
References INTERP_KERNEL::Edge::fillGlobalInfoAbs2().
|
static |
This method builds from descending conn of a quadratic polygon stored in crude mode (MEDCoupling). Descending conn is in FORTRAN relative mode in order to give the orientation of edge. Called by QuadraticPolygon::buildFromCrudeDataArray.
References INTERP_KERNEL::Edge::BuildEdgeFrom(), and ElementaryEdge().
Referenced by INTERP_KERNEL::QuadraticPolygon::appendSubEdgeFromCrudeDataArray(), and INTERP_KERNEL::QuadraticPolygon::buildFromCrudeDataArray2().