diff --git a/include/aidge/graph/GraphView.hpp b/include/aidge/graph/GraphView.hpp index c786ee1f38935187b725e3253bf9c22e7a597ab3..3b3f9fb6d05426d6438f06924ea21e19e287ce5d 100644 --- a/include/aidge/graph/GraphView.hpp +++ b/include/aidge/graph/GraphView.hpp @@ -454,7 +454,7 @@ protected: * This function DOES NOT preserve inputs/outputs order and should NOT BE USED. * It is here only to leave time to adapt the replace() function. */ - [[deprecated]] void updateInputsOutputsNodes(); + void updateInputsOutputsNodes_DEPRECATED(); private: /////////////////////////////////////////////////////// diff --git a/src/graph/GraphView.cpp b/src/graph/GraphView.cpp index 9e5c1ef8648e011e1a54158167696efc48a9236f..3b1a366f50c2a5866008ad4850bdbf34ddf13ec4 100644 --- a/src/graph/GraphView.cpp +++ b/src/graph/GraphView.cpp @@ -807,7 +807,7 @@ bool Aidge::GraphView::replace(const std::set<Aidge::NodePtr>& oldNodes, const s graphPtr->add(newNodes, false); if (newNodes.empty()) { // TODO: FIXME: this function should not be called anymore! - graphPtr->updateInputsOutputsNodes(); + graphPtr->updateInputsOutputsNodes_DEPRECATED(); } } @@ -1028,7 +1028,7 @@ void Aidge::GraphView::updateInputsOutputsDelete(std::shared_ptr<Node> deletedNo } } -void Aidge::GraphView::updateInputsOutputsNodes() { +void Aidge::GraphView::updateInputsOutputsNodes_DEPRECATED() { mInputNodes.clear(); for (const std::shared_ptr<Node>& go_ptr : mNodes) { IOIndex_t inputIdx = 0; diff --git a/unit_tests/graph/Test_GraphView.cpp b/unit_tests/graph/Test_GraphView.cpp index 487c2dfef10063f7e0a0c10dcdd1acc904740c68..392c2478012eaabe5fb8d508aa014a4592537cc5 100644 --- a/unit_tests/graph/Test_GraphView.cpp +++ b/unit_tests/graph/Test_GraphView.cpp @@ -35,8 +35,8 @@ public: // ctor } - void updateInputsOutputsNodes_Test() { - GraphView::updateInputsOutputsNodes(); + void updateInputsOutputsNodes_DEPRECATED_Test() { + GraphView::updateInputsOutputsNodes_DEPRECATED(); } }; @@ -68,7 +68,7 @@ TEST_CASE("genRandomDAG") { ++nbUnicity; // Test deprecated function - g1->updateInputsOutputsNodes_Test(); + g1->updateInputsOutputsNodes_DEPRECATED_Test(); // Check that inputs/outputs are the same regardless of the order auto orderedInputs1 = nodePtrTo(g1->getOrderedInputs(), nodePtrToName); auto orderedInputs2 = nodePtrTo(g2->getOrderedInputs(), nodePtrToName);