Algorithm of level of parallelism has been extended to more complex cases.

[modules/yacs.git] / src / engine / BlocPoint.hxx

diff --git a/src/engine/BlocPoint.hxx b/src/engine/BlocPoint.hxx
index c3034572ecd306c995f89569d664c7a5c9635944..c270f66fbc42f1b2316210d977ee45ff16c51fb2 100644 (file)
--- a/src/engine/BlocPoint.hxx
+++ b/src/engine/BlocPoint.hxx
@@ -34,14 +34,22 @@ namespace YACS
     protected:
       std::list<AbstractPoint *> _nodes;
     public:
+      BlocPoint() = default;
       BlocPoint(const std::list<AbstractPoint *>& nodes, AbstractPoint *father);
+      void deepCopyFrom(const BlocPoint& other);
       AbstractPoint *findPointWithNode(Node *node);
       AbstractPoint *getNodeAfter(Node *node);
       AbstractPoint *getNodeB4(Node *node);
-      bool contains(Node *node);
+      bool contains(Node *node) const override;
+      bool anyOf(const std::set<Node *>& nodes) const override;
       int getNumberOfNodes() const;
       const std::list<AbstractPoint *>& getListOfPoints() const { return _nodes; }
       virtual ~BlocPoint();
+      bool internalContinueForSimplify() const;
+      bool presenceOfNonSimpleCase() const;
+      AbstractPoint *getUnique();
+      const AbstractPoint *getUnique() const;
+      AbstractPoint *getUniqueAndReleaseIt();
     protected:
       void getOutPoint(AbstractPoint *node);
     };