From 7fad6f9b29d1ff5ed2ceb34176c5a3963f3221aa Mon Sep 17 00:00:00 2001 From: Mateusz Tabaka Date: Wed, 11 Jan 2023 11:35:56 +0100 Subject: [PATCH] Fix node names sorting in graph comparator (#14813) Since Results are sorted by node name it may happen that, e.g Result with name node_10 is before Result with name node_9, while we want the opposite. --- .../ie_test_utils/common_test_utils/graph_comparator.cpp | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-) diff --git a/src/tests/ie_test_utils/common_test_utils/graph_comparator.cpp b/src/tests/ie_test_utils/common_test_utils/graph_comparator.cpp index bbdb9d72923..aa2c8854d7f 100644 --- a/src/tests/ie_test_utils/common_test_utils/graph_comparator.cpp +++ b/src/tests/ie_test_utils/common_test_utils/graph_comparator.cpp @@ -76,12 +76,16 @@ bool compare_rt_keys(const T& node1, const T& node2, std::ostream& err_log) { } bool less_by_name(const std::shared_ptr& l, const std::shared_ptr& r) { - return l->get_friendly_name() < r->get_friendly_name(); + const auto& l_name = l->get_friendly_name(); + const auto& r_name = r->get_friendly_name(); + return l_name.size() < r_name.size() || (l_name.size() == r_name.size() && l_name < r_name); } bool less_by_parent_name(const std::shared_ptr& l, const std::shared_ptr& r) { - return l->get_input_node_shared_ptr(0)->get_friendly_name() < r->get_input_node_shared_ptr(0)->get_friendly_name(); + const auto& l_name = l->get_input_node_shared_ptr(0)->get_friendly_name(); + const auto& r_name = r->get_input_node_shared_ptr(0)->get_friendly_name(); + return l_name.size() < r_name.size() || (l_name.size() == r_name.size() && l_name < r_name); } std::string typeInfoToStr(const ngraph::Node::type_info_t& typeInfo) {