Previous CloneSet | Next CloneSet | Back to Main Report |
Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
---|---|---|---|---|
19 | 2 | 1 | 0.985 | stmt_list[5] |
Clone Abstraction | Parameter Bindings |
Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
---|---|---|---|
1 | 19 | 116 | Bio/Pathway/Rep/Graph.py |
2 | 19 | 111 | Bio/Pathway/Rep/MultiGraph.py |
| ||||
"Removes node and all edges connected to it." if node not in self.__adjacency_list: raise ValueError("Unknown node: "+str(node)) # remove node (and all out-edges) from adjacency list del self.__adjacency_list[node] # remove all in-edges from adjacency list for n in self.__adjacency_list.keys( ): self.__adjacency_list[n] = HashSet(filter( lambda x,node = node:x is not node,self.__adjacency_list[n].list( ))) # remove all refering pairs in label map for label in self.__label_map.keys( ): lm = HashSet(filter( lambda x,node = node:(x[0] is not node) and (x[1] is not node),self.__label_map[label].list( ))) # remove the entry completely if the label is now unused if lm.empty( ): del self.__label_map[label] else: self.__label_map[label] = lm # remove all refering entries in edge map |
| ||||
"Removes node and all edges connected to it." if node not in self.__adjacency_list: raise ValueError("Unknown node: "+str(node)) # remove node (and all out-edges) from adjacency list del self.__adjacency_list[node] # remove all in-edges from adjacency list for n in self.__adjacency_list.keys( ): self.__adjacency_list[n] = HashSet(filter( lambda x,node = node:x[0] is not node,self.__adjacency_list[n].list( ))) # remove all refering pairs in label map for label in self.__label_map.keys( ): lm = HashSet(filter( lambda x,node = node:(x[0] is not node) and (x[1] is not node),self.__label_map[label].list( ))) # remove the entry completely if the label is now unused if lm.empty( ): del self.__label_map[label] else: self.__label_map[label] = lm |
| |||
"Removes node and all edges connected to it." if node not in self.__adjacency_list: raise ValueError("Unknown node: "+str(node)) # remove node (and all out-edges) from adjacency list del self.__adjacency_list[node] # remove all in-edges from adjacency list for n in self.__adjacency_list.keys( ): self.__adjacency_list[n] = HashSet(filter( lambda x,node = node: [[#variable6aef8200]]is not node,self.__adjacency_list[n].list( ))) # remove all refering pairs in label map for label in self.__label_map.keys( ): lm = HashSet(filter( lambda x,node = node:(x[0] is not node) and (x[1] is not node),self.__label_map[label].list( ))) # remove the entry completely if the label is now unused if lm.empty( ): del self.__label_map[label] else: self.__label_map[label] = lm # remove all refering entries in edge map |
CloneAbstraction |
Parameter Index | Clone Instance | Parameter Name | Value |
---|---|---|---|
1 | 1 | [[#6aef8200]] | x |
1 | 2 | [[#6aef8200]] | x[0] |