Skip to content
Snippets Groups Projects
Commit 0bc0ed73 authored by Maxence Naud's avatar Maxence Naud
Browse files

[Doc] fix some mistakes

parent de3026b0
No related branches found
No related tags found
1 merge request!1Solve memory leaks and add CI
...@@ -22,10 +22,10 @@ std::shared_ptr<Aidge::GraphView> Aidge::Sequential(std::initializer_list<OpArgs ...@@ -22,10 +22,10 @@ std::shared_ptr<Aidge::GraphView> Aidge::Sequential(std::initializer_list<OpArgs
assert(static_cast<std::size_t>(elt.node()->getNbFreeDataInputs()) >= gv->outputNodes().size()); assert(static_cast<std::size_t>(elt.node()->getNbFreeDataInputs()) >= gv->outputNodes().size());
/* /*
* /!\ mn.view()->outputNodes() is a set, order of Nodes cannot be guaranted. * /!\ mn.view()->outputNodes() is a set, order of Nodes cannot be guaranted.
* Prefer a functional descrition for detailed inputs * Prefer a functional description for detailed inputs
*/ */
for (const std::shared_ptr<Node>& node_ptr : gv->outputNodes()) { for (const std::shared_ptr<Node>& node_ptr : gv->outputNodes()) {
node_ptr -> addChild(elt.node()); // already check that node_ptr->nbOutput == 1 node_ptr -> addChild(elt.node()); // already checks that node_ptr->nbOutput() == 1
} }
gv->add(elt.node()); gv->add(elt.node());
} }
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment