From d21d7e9a1a17656dca980b443aa066a82764cb33 Mon Sep 17 00:00:00 2001
From: gaocongli <gaocongli@huawei.com>
Date: Thu, 22 Oct 2020 17:01:08 +0800
Subject: [PATCH] aggregate the name into scope

---
 .../sub_graph_searcher/__init__.py            |  15 ++
 .../sub_graph_searcher/common.py              | 129 ++++++++++++++++++
 2 files changed, 144 insertions(+)
 create mode 100644 mindinsight/mindconverter/graph_based_converter/sub_graph_searcher/__init__.py
 create mode 100644 mindinsight/mindconverter/graph_based_converter/sub_graph_searcher/common.py

diff --git a/mindinsight/mindconverter/graph_based_converter/sub_graph_searcher/__init__.py b/mindinsight/mindconverter/graph_based_converter/sub_graph_searcher/__init__.py
new file mode 100644
index 00000000..6f34a1ba
--- /dev/null
+++ b/mindinsight/mindconverter/graph_based_converter/sub_graph_searcher/__init__.py
@@ -0,0 +1,15 @@
+# Copyright 2020 Huawei Technologies Co., Ltd.All Rights Reserved.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+# ==============================================================================
+"""Searcher of scope name."""
diff --git a/mindinsight/mindconverter/graph_based_converter/sub_graph_searcher/common.py b/mindinsight/mindconverter/graph_based_converter/sub_graph_searcher/common.py
new file mode 100644
index 00000000..13636b11
--- /dev/null
+++ b/mindinsight/mindconverter/graph_based_converter/sub_graph_searcher/common.py
@@ -0,0 +1,129 @@
+# Copyright 2020 Huawei Technologies Co., Ltd.All Rights Reserved.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+# ==============================================================================
+"""Declare generic variable and functions."""
+import copy
+import functools
+from collections import OrderedDict
+from typing import List
+
+from mindinsight.mindconverter.graph_based_converter.third_party_graph.onnx_utils import BaseNode
+
+
+class CmpRelation:
+    """Define cmp relation between `x` and `y`."""
+    # When x is equal to y in logic.
+    EQUAL = 0
+    # When x is less than y in logic.
+    LESS = -1
+    # When x is greater than y in logic.
+    GREATER = 1
+
+
+def gen_hash_key(sequence: List[BaseNode], separator="->"):
+    """Generate hash key."""
+    seq = [item.op_type for item in sequence]
+    return separator.join(seq)
+
+
+class DagGraph:
+    """Define dag graph."""
+
+    def __init__(self, nodes, precursor: dict, successor: dict):
+        self.node_collection = nodes
+        self.precursor_table = precursor
+        self.successor_table = successor
+
+    def __copy__(self):
+        """
+        Override `copy` function.
+
+        Notes:
+            Be careful about `copy` method. It's safe to use deepcopy,
+            but struck in its poor performance.
+
+        Returns:
+            DagGraph, new instance.
+        """
+        cls = self.__class__
+        new_obj = cls(copy.copy(self.node_collection),
+                      copy.deepcopy(self.precursor_table),
+                      copy.deepcopy(self.successor_table))
+        return new_obj
+
+
+class AlgorithmContext:
+    """Define context of sub-graph search algorithm."""
+    found_pattern = {}
+    visited = set()
+    beam_width = 5
+    total_len = 0
+    node_collection = None
+    precursor_table = {}
+    successor_table = {}
+
+    def set_init_node_collection(self, nd_col):
+        """Init node_collection."""
+        self.node_collection = nd_col
+
+    def set_sequence_length(self, n):
+        """Init sequence length."""
+        self.total_len = float(n)
+
+    def get_sequence_length(self):
+        """Get sequence length."""
+        return self.total_len
+
+    def set_beam_width(self, bw):
+        """Set beam width."""
+        self.beam_width = bw
+
+    def sort_with_beam(self, pattern_arr):
+        """
+        Sort patterns according to its frequency and prune by beam width.
+
+        When frequency equals, choose shorter pattern.
+
+        Args:
+            pattern_arr (dict): Pattern dict.
+
+        Returns:
+            OrderedDict, sorted pattern.
+        """
+
+        def _cmp(x, y):
+            """Cmp function to sort pattern."""
+            if x[1].count > y[1].count:
+                return CmpRelation.GREATER
+            if x[1].count < y[1].count:
+                return CmpRelation.LESS
+            if x[1].ptn_length < y[1].ptn_length:
+                return CmpRelation.GREATER
+            if x[1].ptn_length > y[1].ptn_length:
+                return CmpRelation.LESS
+            return CmpRelation.EQUAL
+
+        pattern_arr = sorted(pattern_arr.items(), key=functools.cmp_to_key(_cmp),
+                             reverse=True)
+        if len(pattern_arr) > self.beam_width:
+            pattern_arr = pattern_arr[:self.beam_width]
+        return OrderedDict(pattern_arr)
+
+
+context = AlgorithmContext()
+
+
+__all__ = ["context",
+           "gen_hash_key",
+           "DagGraph"]