Previous CloneSet | Next CloneSet | Back to Main Report |
Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
---|---|---|---|---|
12 | 2 | 0 | 1.000 | selection_statement |
Clone Abstraction | Parameter Bindings |
Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
---|---|---|---|
1 | 12 | 878 | InclusionConstraintGraph/Graph.h |
2 | 12 | 931 | InclusionConstraintGraph/Graph.h |
| ||||
if (path->collapse_into == NULL) { header_of_cycle->collapse_nodes->Add(path->node); path->collapse_into = header_of_cycle; } else if (path->collapse_into == header_of_cycle) { } else if (path->collapse_into == path) { if (path != header_of_cycle) { header_of_cycle->collapse_nodes->Union(*path->collapse_nodes); path->collapse_nodes->Empty(); path->collapse_into = header_of_cycle; } } else { path->collapse_into = header_of_cycle; } |
| ||||
if (path->collapse_into == NULL) { header_of_cycle->collapse_nodes->Add(path->node); path->collapse_into = header_of_cycle; } else if (path->collapse_into == header_of_cycle) { } else if (path->collapse_into == path) { if (path != header_of_cycle) { header_of_cycle->collapse_nodes->Union(*path->collapse_nodes); path->collapse_nodes->Empty(); path->collapse_into = header_of_cycle; } } else { path->collapse_into = header_of_cycle; } |
| |||
if (path->collapse_into == NULL) { header_of_cycle->collapse_nodes->Add(path->node); path->collapse_into = header_of_cycle; } else if (path->collapse_into == header_of_cycle) { } else if (path->collapse_into == path) { if (path != header_of_cycle) { header_of_cycle->collapse_nodes->Union(*path->collapse_nodes); path->collapse_nodes->Empty(); path->collapse_into = header_of_cycle; } } else { path->collapse_into = header_of_cycle; } |
CloneAbstraction |
Parameter Index | Clone Instance | Parameter Name | Value |
---|---|---|---|
None |