def identical_names()

in uberpoet/dotreader.py [0:0]

• 8 lines of code
• 4 McCabe index (conditional complexity)

    def identical_names(self, edges):
        # type: (List[List[str]]) -> Dict[str,int]
        """Returns how many times a buck target name occurs in a edge list, filtering out unique (count == 1) names"""
        dep_map = self.make_dep_map_from_edges(edges)
        name_count = {}
        for k in dep_map.keys():
            name = self.extract_buck_target(k)
            name_count[name] = name_count.get(name, 0) + 1

        name_count = {key: value for key, value in name_count.iteritems() if value > 1}
        return name_count