diff --git a/include/aidge/graphRegex/GraphParser.hpp b/include/aidge/graphRegex/GraphParser.hpp index d0234afbf72b7b8b2a5bb0582289bd36e92c1299..06d098e995933e223146c37567f8d6895340e47d 100644 --- a/include/aidge/graphRegex/GraphParser.hpp +++ b/include/aidge/graphRegex/GraphParser.hpp @@ -21,6 +21,8 @@ class GraphParser{ */ GraphParser(const std::string gRegexExpressions); + virtual ~GraphParser(); + /** * @brief AST graph creation function * @return The AST tree @@ -82,6 +84,7 @@ class GraphParser{ * @brief The actual token in the parce */ std::shared_ptr<ParsingToken<gRegexTokenTypes>> mCurrentToken; + /** * @brief The lexem use */ diff --git a/include/aidge/graphRegex/matchFsm/FsmEdge.hpp b/include/aidge/graphRegex/matchFsm/FsmEdge.hpp index bb13e0d2a69b39286963a9d4942d0b7c8a71c2ef..0c9318de062faa8e840a28be6ec8373bbd470ff8 100644 --- a/include/aidge/graphRegex/matchFsm/FsmEdge.hpp +++ b/include/aidge/graphRegex/matchFsm/FsmEdge.hpp @@ -47,7 +47,9 @@ namespace Aidge{ public: FsmEdge(std::shared_ptr<FsmNode>& source,std::shared_ptr<FsmNode>& dest, const std::shared_ptr<ConditionalInterpreter> toTest); - virtual ~FsmEdge() =default; + + virtual ~FsmEdge(){}; + FsmEdge() : weakPtr(shared_from_this()) {} @@ -123,7 +125,7 @@ namespace Aidge{ public: FsmEdgeUnique(std::shared_ptr<FsmNode>& source,std::shared_ptr<FsmNode>& dest, const std::shared_ptr<ConditionalInterpreter> toTest); - const EdgeTestResult test(const std::shared_ptr<FsmRunTimeContext> stmContext) override; + const EdgeTestResult test(const std::shared_ptr<FsmRunTimeContext> stmContext) override; }; /** diff --git a/include/aidge/graphRegex/matchFsm/FsmGraph.hpp b/include/aidge/graphRegex/matchFsm/FsmGraph.hpp index d2eb5484763a82d6d855aa9de44ff5f670251ad9..d6ef8742d0a5a59947ad713d5dde0aebdd592796 100644 --- a/include/aidge/graphRegex/matchFsm/FsmGraph.hpp +++ b/include/aidge/graphRegex/matchFsm/FsmGraph.hpp @@ -24,7 +24,7 @@ private: std::set<std::shared_ptr<FsmEdge>> mEdges; public: FsmGraph(/* args */); - virtual ~FsmGraph() = default; + virtual ~FsmGraph();// = default; std::shared_ptr<MatchResult> test(std::vector<NodePtr>& StartNodes); diff --git a/include/aidge/graphRegex/matchFsm/FsmNode.hpp b/include/aidge/graphRegex/matchFsm/FsmNode.hpp index 18b78fe89cbcc480132c9b42859c5578123eda2f..6a31c20fbbb98a51536dde4e217def22953372d2 100644 --- a/include/aidge/graphRegex/matchFsm/FsmNode.hpp +++ b/include/aidge/graphRegex/matchFsm/FsmNode.hpp @@ -57,7 +57,7 @@ namespace Aidge{ public: FsmNode(bool isAValid,bool isAStart ); - virtual ~FsmNode() = default; + virtual ~FsmNode();// = default; /** * @brief use to MAG the actual context , and return all the posible new context * @details one input context can generate a multitude of contexts because a graph node diff --git a/include/aidge/graphRegex/matchFsm/FsmRunTimeContext.hpp b/include/aidge/graphRegex/matchFsm/FsmRunTimeContext.hpp index f1fb4b02684901fb0576c864401e134ae1616a73..5c73f83be9c1f2ec09ed16153f41b49e02537464 100644 --- a/include/aidge/graphRegex/matchFsm/FsmRunTimeContext.hpp +++ b/include/aidge/graphRegex/matchFsm/FsmRunTimeContext.hpp @@ -61,7 +61,7 @@ namespace Aidge{ FsmRunTimeContext(std::shared_ptr<FsmRunTimeContext> fsmRunTime); FsmRunTimeContext(std::shared_ptr<FsmRunTimeContext> fsmRunTime,std::shared_ptr<FsmNode> actState ,NodePtr actOpNode ); - virtual ~FsmRunTimeContext()=default; + virtual ~FsmRunTimeContext();//=default; /** * @defgroup FsmRunTimeContextRejected Function for managing rejected nodes diff --git a/include/aidge/nodeTester/ConditionalParser.hpp b/include/aidge/nodeTester/ConditionalParser.hpp index a1d1ccad27f2a6eb6de39d1b22c32a859a3c3c1f..59041a19f88e2895cf4e6e1f4d1266edd8bcb9fc 100644 --- a/include/aidge/nodeTester/ConditionalParser.hpp +++ b/include/aidge/nodeTester/ConditionalParser.hpp @@ -36,6 +36,7 @@ class ConditionalParser{ */ ConditionalParser(const std::string ConditionalExpressions); + virtual ~ConditionalParser() ;// = default; /** * @brief AST graph creation function * @return The AST tree