diff --git a/include/aidge/operator/MetaOperator.hpp b/include/aidge/operator/MetaOperator.hpp
index 991c1c60dbd7eab79c132447b78cc429a928426b..652cecd44537963c3ee4743729d2e98c569e7de6 100644
--- a/include/aidge/operator/MetaOperator.hpp
+++ b/include/aidge/operator/MetaOperator.hpp
@@ -40,7 +40,7 @@ public:
/**
* @brief Clone the operator using its copy-constructor.
- * @see Operator::MatMul_Op
+ * @see Operator::MetaOperator_Op
*/
std::shared_ptr<Operator> clone() const override {
return std::make_shared<MetaOperator_Op>(*this);
diff --git a/unit_tests/graph/Test_Connector.cpp b/unit_tests/graph/Test_Connector.cpp
index a3bcc5783bd1de89ebf82d2b6078a26bdd49eaa7..79acce9281039f9f3c67b7235d8999b6c7173685 100644
--- a/unit_tests/graph/Test_Connector.cpp
+++ b/unit_tests/graph/Test_Connector.cpp
@@ -113,7 +113,7 @@ TEST_CASE("GraphGeneration from Connector", "[GraphView]") {
x= (*node09)({x});
x = (*node10)({a, x});
std::shared_ptr<GraphView> gv = generateGraph({x});
- gv->save("GraphGeneration");
+ // gv->save("GraphGeneration");
REQUIRE(nodePtrTo(gv->getOrderedInputs()) == std::vector<std::pair<std::string, IOIndex_t>>({}));
REQUIRE(nodePtrTo(gv->getOrderedOutputs()) == std::vector<std::pair<std::string, IOIndex_t>>({{"g_matmul1", 0}}));
}
@@ -164,7 +164,7 @@ TEST_CASE("Connector connection GraphView", "[Connector]") {
std::shared_ptr<GraphView> gv = generateGraph({x});
REQUIRE(nodePtrTo(gv->getOrderedInputs()) == std::vector<std::pair<std::string, IOIndex_t>>({}));
REQUIRE(nodePtrTo(gv->getOrderedOutputs()) == std::vector<std::pair<std::string, IOIndex_t>>({{"g_conv3", 0}}));
- gv->save("MultiInputSequentialConnector");
+ // gv->save("MultiInputSequentialConnector");
REQUIRE(gv->inputNodes().size() == 0U);
}
}
@@ -181,7 +181,7 @@ TEST_CASE("Connector Mini-graph", "[Connector]") {
std::shared_ptr<GraphView> g = generateGraph({y});
REQUIRE(nodePtrTo(g->getOrderedInputs()) == std::vector<std::pair<std::string, IOIndex_t>>({}));
REQUIRE(nodePtrTo(g->getOrderedOutputs()) == std::vector<std::pair<std::string, IOIndex_t>>({{"ElemWise", 0}}));
- g->save("TestGraph");
+ // g->save("TestGraph");
}
TEST_CASE("Structural descrition - Sequential", "[GraphView]") {
diff --git a/unit_tests/graph/Test_GraphView.cpp b/unit_tests/graph/Test_GraphView.cpp
index bf20473ef5ed49eec1079435a45002c22fb8bb3e..1887cdca1f266e0ea5d3ca5909c145dec5992fd3 100644
--- a/unit_tests/graph/Test_GraphView.cpp
+++ b/unit_tests/graph/Test_GraphView.cpp
@@ -55,8 +55,8 @@ TEST_CASE("genRandomGraph", "[GraphView][randomGen]") {
const auto g2 = std::make_shared<GraphView>("g2");
const bool unicity2 = g2->add(randGraph.gen(seed, 10));
- g1->save("./genRandomGraph1");
- g2->save("./genRandomGraph2");
+ // g1->save("./genRandomGraph1");
+ // g2->save("./genRandomGraph2");
REQUIRE(unicity1 == unicity2);
@@ -100,7 +100,7 @@ TEST_CASE("clone", "[GraphView][clone]") {
RandomGraph randGraph;
const auto g1 = std::make_shared<GraphView>("g1");
g1->add(randGraph.gen(seed, 10));
-
+ // g1 -> save("GraphView_clone");
const auto g2 = g1->clone();
REQUIRE(nodePtrTo(g1->getNodes(), nodePtrToName) == nodePtrTo(g2->getNodes(), nodePtrToName));
@@ -141,8 +141,8 @@ TEST_CASE("clone_with_delete", "[GraphView][cloneDelete]") {
const auto g2 = std::make_shared<GraphView>("g2");
const bool unicity2 = g2->add(randGraph.gen(seed, 10));
- g1->save("./clone_with_delete1");
- g2->save("./clone_with_delete2");
+ // g1->save("./clone_with_delete1");
+ // g2->save("./clone_with_delete2");
try {
const auto gCloned = g1->cloneCallback(&nodeDel);
@@ -178,13 +178,13 @@ TEST_CASE("remove", "[GraphView][remove]") {
const bool unicity1 = g1->add(randGraph.gen(seed, 10));
if (unicity1) {
- g1->save("./remove1_before");
+ // g1->save("./remove1_before");
const auto nodes = g1->getNodes();
int step = 1;
for (auto node : nodes) {
if (node->type() == "DelFictive") {
g1->remove(node, false);
- g1->save("./remove1_after" + std::to_string(step));
+ // g1->save("./remove1_after" + std::to_string(step));
step++;
}
}
@@ -193,8 +193,8 @@ TEST_CASE("remove", "[GraphView][remove]") {
const auto g2 = std::make_shared<GraphView>("g2");
g2->add(randGraph.gen(seed, 10));
- g1->save("./remove1");
- g2->save("./remove2");
+ // g1->save("./remove1");
+ // g2->save("./remove2");
REQUIRE(nodePtrTo(g1->getNodes(), nodePtrToName) == nodePtrTo(g2->getNodes(), nodePtrToName));
// Order not garanteed, because when a node is removed, it can create new GraphView inputs/outputs
@@ -243,7 +243,7 @@ TEST_CASE("[core/graph] GraphView(add)", "[GraphView][add]") {
g->add(GOp5);
std::shared_ptr<Node> GOp6 = GenericOperator("Fictive", 1, 1, 1, "Gop6");
g->add(GOp6);
- g->save("node_alone");
+ // g->save("node_alone");
REQUIRE(nodePtrTo(g->getOrderedInputs(), nodePtrToName) == std::vector<std::pair<std::string, IOIndex_t>>({{"Gop3", 0}, {"Gop4", 0}, {"Gop5", 0}, {"Gop6", 0}, {"Gop6", 1}}));
REQUIRE(nodePtrTo(g->getOrderedOutputs(), nodePtrToName) == std::vector<std::pair<std::string, IOIndex_t>>({{"Gop2", 0}, {"Gop5", 0}, {"Gop6", 0}}));
}
@@ -423,7 +423,7 @@ TEST_CASE("[core/graph] GraphView(resetConnections)") {
}
}
- SECTION("disconnect data iput + learnable parameters") {
+ SECTION("disconnect data input + learnable parameters") {
std::shared_ptr<Node> conv = GenericOperator("Conv", 1, 0, 1, "c");
std::shared_ptr<Node> conv1 = GenericOperator("Conv", 1, 2, 1, "c1");
std::shared_ptr<Node> conv2 = GenericOperator("Conv", 1, 0, 1, "c2");
diff --git a/unit_tests/recipies/Test_FuseMulAdd.cpp b/unit_tests/recipies/Test_FuseMulAdd.cpp
index 0c65db98917e33a11f4b7bac678b271b1a10fb94..968826230dfdf85290ee377aee155e06855c4b28 100644
--- a/unit_tests/recipies/Test_FuseMulAdd.cpp
+++ b/unit_tests/recipies/Test_FuseMulAdd.cpp
@@ -61,7 +61,6 @@ TEST_CASE("[cpu/recipies] FuseMulAdd", "[FuseMulAdd][recipies]") {
// Transform GraphView inplace
fuseMulAdd(g);
- g->save("bonjour");
// Check new GraphView
std::set<std::shared_ptr<Node>> newNodes = g->getNodes();