//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
+ /**
+ * A set of quadratic or linear edges, described mainly by their connectivity
+ * The set is assumed to be connected, but not necessarily closed (i.e. not necessarily forming a closed polygon).
+ * Some methods however requires a closed form.
+ */
INTERPKERNEL_EXPORT bool presenceOfOn() const;
INTERPKERNEL_EXPORT bool presenceOfQuadraticEdge() const;
INTERPKERNEL_EXPORT void initLocations() const;
INTERPKERNEL_EXPORT bool presenceOfOn() const;
INTERPKERNEL_EXPORT bool presenceOfQuadraticEdge() const;
INTERPKERNEL_EXPORT void initLocations() const;
INTERPKERNEL_EXPORT ComposedEdge *clone() const;
INTERPKERNEL_EXPORT bool isNodeIn(Node *n) const;
INTERPKERNEL_EXPORT double getArea() const;
INTERPKERNEL_EXPORT ComposedEdge *clone() const;
INTERPKERNEL_EXPORT bool isNodeIn(Node *n) const;
INTERPKERNEL_EXPORT double getArea() const;
INTERPKERNEL_EXPORT bool changeEndNodeWith(Node *node) const;
INTERPKERNEL_EXPORT bool changeStartNodeWith(Node *node) const;
INTERPKERNEL_EXPORT void dumpInXfigFile(std::ostream& stream, int resolution, const Bounds& box) const;
INTERPKERNEL_EXPORT bool changeEndNodeWith(Node *node) const;
INTERPKERNEL_EXPORT bool changeStartNodeWith(Node *node) const;
INTERPKERNEL_EXPORT void dumpInXfigFile(std::ostream& stream, int resolution, const Bounds& box) const;
INTERPKERNEL_EXPORT bool isInOrOut(Node *nodeToTest) const;
INTERPKERNEL_EXPORT bool isInOrOut2(Node *nodeToTest) const;
INTERPKERNEL_EXPORT bool getDirection() const;
INTERPKERNEL_EXPORT bool intresincEqCoarse(const Edge *other) const;
private:
std::list<ElementaryEdge *>* getListBehind() { return &_sub_edges; }
INTERPKERNEL_EXPORT bool isInOrOut(Node *nodeToTest) const;
INTERPKERNEL_EXPORT bool isInOrOut2(Node *nodeToTest) const;
INTERPKERNEL_EXPORT bool getDirection() const;
INTERPKERNEL_EXPORT bool intresincEqCoarse(const Edge *other) const;
private:
std::list<ElementaryEdge *>* getListBehind() { return &_sub_edges; }