From f66b17d70933db24069d725b682b3ea9fc7f76a2 Mon Sep 17 00:00:00 2001
From: Octave Perrin <operrin@lrtechnologies.fr>
Date: Thu, 14 Nov 2024 14:04:47 +0100
Subject: [PATCH] moar
---
include/aidge/graph/GraphView.hpp | 2 +-
src/graph/GraphView.cpp | 2 +-
2 files changed, 2 insertions(+), 2 deletions(-)
diff --git a/include/aidge/graph/GraphView.hpp b/include/aidge/graph/GraphView.hpp
index edd91ef06..c18d91c2e 100644
--- a/include/aidge/graph/GraphView.hpp
+++ b/include/aidge/graph/GraphView.hpp
@@ -394,7 +394,7 @@ public:
std::pair<std::vector<NodePtr>, size_t> getRankedNodes() const;
/**
- // todo see comment in code
+ // todo comment is in code
* Get the nodes name according to the GraphView nodes ranking.
* @param format The formatting string to be used with fmt::format().
* @details The usable positional arguments are the following:
diff --git a/src/graph/GraphView.cpp b/src/graph/GraphView.cpp
index a6d30931b..8440f22e8 100644
--- a/src/graph/GraphView.cpp
+++ b/src/graph/GraphView.cpp
@@ -762,7 +762,7 @@ std::map<Aidge::NodePtr, std::string> Aidge::GraphView::getRankedNodesName(const
std::map<std::string, size_t>::iterator it;
std::tie(it, std::ignore) = typeRank.insert(std::make_pair(rankedNode->type(), 0));
- const auto name = (markNonUnicity && rank < rankedNodes.second) //if todo logic doesn't match description, to be checked
+ const auto name = (markNonUnicity && rank < rankedNodes.second) //if todo logic doesn't match description, to be checked, i'd say > and swap ? and :
? fmt::format(format, rankedNode->name(), rankedNode->type(), rank, it->second) //then
: fmt::format(format, rankedNode->name(), rankedNode->type(), fmt::format("?{}", rank), fmt::format("?{}", it->second)); //else
rankedNodesName.insert(std::make_pair(rankedNode, name));
--
GitLab