Previous CloneSet | Next CloneSet | Back to Main Report |
Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
---|---|---|---|---|
7 | 3 | 0 | 1.000 | statement_seq[5] |
Clone Abstraction | Parameter Bindings |
Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
---|---|---|---|
1 | 7 | 657 | InclusionConstraintGraph/Graph.h |
2 | 7 | 710 | InclusionConstraintGraph/Graph.h |
3 | 7 | 776 | InclusionConstraintGraph/Graph.h |
| ||||
// lookup set of pointed to nodes SetOfNodes &pointed_to_nodes = cached_information.GetSetOfNodes(); std::size_t last_number_of_pointed_to_nodes = pointed_to_nodes.Size(); // create next path SetOfNodes collapse_nodes; Path next_path(node, previous_path, NULL, &collapse_nodes); // remember node being on current path node->SetOnPath(Node::IsOnPath); |
| ||||
// lookup set of pointed to nodes SetOfNodes &pointed_to_nodes = cached_information.GetSetOfNodes(); std::size_t last_number_of_pointed_to_nodes = pointed_to_nodes.Size(); // create next path SetOfNodes collapse_nodes; Path next_path(node, previous_path, NULL, &collapse_nodes); // remember node being on current path node->SetOnPath(Node::IsOnPath); |
| ||||
// lookup set of pointed to nodes SetOfNodes &pointed_to_nodes = cached_information.GetSetOfNodes(); std::size_t last_number_of_pointed_to_nodes = pointed_to_nodes.Size(); // create next path SetOfNodes collapse_nodes; Path next_path(node, previous_path, NULL, &collapse_nodes); // remember node being on current path node->SetOnPath(Node::IsOnPath); |
| |||
// lookup set of pointed to nodes SetOfNodes & pointed_to_nodes = cached_information.GetSetOfNodes(); std::size_t last_number_of_pointed_to_nodes = pointed_to_nodes.Size(); // create next path SetOfNodes collapse_nodes; Path next_path(node, previous_path, NULL, &collapse_nodes); // remember node being on current path node->SetOnPath(Node::IsOnPath); |
CloneAbstraction |
Parameter Index | Clone Instance | Parameter Name | Value |
---|---|---|---|
None |