@@ -352,17 +352,17 @@ ov::NodeVector find_common_args(std::shared_ptr<Node> node1, std::shared_ptr<Nod
352
352
node1_args.insert (node);
353
353
};
354
354
355
- traverse_nodes ({std::move (node1)}, compute_node1_args, NodeVector{});
355
+ traverse_nodes ({std::move (node1)}, compute_node1_args, ov:: NodeVector{});
356
356
357
357
std::unordered_set<std::shared_ptr<Node>> node2_args;
358
358
359
359
auto compute_node2_args = [&node2_args](const std::shared_ptr<Node>& node) {
360
360
node2_args.insert (node);
361
361
};
362
362
363
- traverse_nodes ({std::move (node2)}, compute_node2_args, NodeVector{});
363
+ traverse_nodes ({std::move (node2)}, compute_node2_args, ov:: NodeVector{});
364
364
365
- NodeVector common_args;
365
+ ov:: NodeVector common_args;
366
366
for (const auto & e : node1_args) {
367
367
if (node2_args.count (e) > 0 ) {
368
368
common_args.push_back (e);
@@ -403,7 +403,7 @@ std::vector<std::shared_ptr<ov::Node>> clone_nodes(const std::vector<std::shared
403
403
for (const auto & node : sorted_nodes) {
404
404
if (node_map.count (node.get ()) == 0 ) {
405
405
// get (already) cloned arguments and clone the node
406
- OutputVector cloned_args;
406
+ ov:: OutputVector cloned_args;
407
407
for (auto input : node->inputs ()) {
408
408
ov::Output<Node> output = input.get_source_output ();
409
409
cloned_args.push_back (output.for_node (node_map.at (output.get_node ())));
@@ -458,11 +458,11 @@ std::list<std::shared_ptr<ov::Node>> clone_nodes(const std::vector<std::shared_p
458
458
if (output_map.count (value) == 0 ) {
459
459
// We need this node cloned
460
460
// get (already) cloned arguments and clone the node
461
- OutputVector cloned_args;
461
+ ov:: OutputVector cloned_args;
462
462
for (const auto & value : node->input_values ()) {
463
463
cloned_args.push_back (output_map.at (value));
464
464
}
465
- NodeVector cloned_dependencies;
465
+ ov:: NodeVector cloned_dependencies;
466
466
for (auto & dependency : node->get_control_dependencies ()) {
467
467
for (const auto & dependency_value : dependency->outputs ()) {
468
468
std::shared_ptr<Node> dependent = output_map.at (dependency_value).get_node_shared_ptr ();
@@ -636,14 +636,14 @@ bool is_one(const ov::Output<Node>& reduce_constant) {
636
636
return result_bool;
637
637
}
638
638
639
- ov::NodeVector get_subgraph_outputs (const NodeVector& nodes,
640
- const NodeVector& exclusions,
639
+ ov::NodeVector get_subgraph_outputs (const ov:: NodeVector& nodes,
640
+ const ov:: NodeVector& exclusions,
641
641
bool ignore_unused,
642
642
bool ignore_output_duplicates) {
643
643
std::set<std::shared_ptr<Node>> exclusions_set (exclusions.begin (), exclusions.end ());
644
644
std::set<std::shared_ptr<Node>> nodes_set (nodes.begin (), nodes.end ());
645
645
646
- NodeVector outputs;
646
+ ov:: NodeVector outputs;
647
647
648
648
for (const auto & n : nodes) {
649
649
if (exclusions_set.count (n) != 0 ) {
@@ -662,8 +662,8 @@ ov::NodeVector get_subgraph_outputs(const NodeVector& nodes,
662
662
return outputs;
663
663
}
664
664
665
- ov::NodeVector extract_subgraph (const NodeVector& results, const NodeVector& args) {
666
- NodeVector subgraph;
665
+ ov::NodeVector extract_subgraph (const ov:: NodeVector& results, const ov:: NodeVector& args) {
666
+ ov:: NodeVector subgraph;
667
667
traverse_nodes (
668
668
results,
669
669
[&](const std::shared_ptr<Node>& n) {
0 commit comments