| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 7 | 4 | 0 | 1.000 | statement_seq[3] |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 7 | 3109 | InclusionConstraintGraph/Graph.h |
| 2 | 7 | 3121 | InclusionConstraintGraph/Graph.h |
| 3 | 7 | 3140 | InclusionConstraintGraph/Graph.h |
| 4 | 7 | 3163 | InclusionConstraintGraph/Graph.h |
| ||||
// follow collapse-to relationship
if (node->DoesCollapse()) {
MarkTransitiveClosureOfNodes(node->Collapse(), number_of_nodes);
}
// follow inclusion constraints
const SetOfNodes &inclusion_constraints = node->GetInclusionConstraints();
for (std::size_t ic=0; ic <inclusion_constraints.Size();ic++) {
MarkTransitiveClosureOfNodes(inclusion_constraints[ic], number_of_nodes);
}
|
| ||||
// follow collapse-to relationship
if (node->DoesCollapse()) {
MarkTransitiveClosureOfNodes(node->Collapse(), number_of_nodes);
}
// follow inclusion constraints
const SetOfNodes &inclusion_constraints = node->GetInclusionConstraints();
for (std::size_t ic=0; ic <inclusion_constraints.Size();ic++) {
MarkTransitiveClosureOfNodes(inclusion_constraints[ic], number_of_nodes);
}
|
| ||||
// follow collapse-to relationship
if (node->DoesCollapse()) {
MarkTransitiveClosureOfNodes(node->Collapse(), number_of_nodes);
}
// follow inclusion constraints
const SetOfNodes &inclusion_constraints = node->GetInclusionConstraints();
for (std::size_t ic=0; ic <inclusion_constraints.Size();ic++) {
MarkTransitiveClosureOfNodes(inclusion_constraints[ic], number_of_nodes);
}
|
| ||||
// follow collapse-to relationship
if (node->DoesCollapse()) {
MarkTransitiveClosureOfNodes(node->Collapse(), number_of_nodes);
}
// follow inclusion constraints
const SetOfNodes &inclusion_constraints = node->GetInclusionConstraints();
for (std::size_t ic=0; ic <inclusion_constraints.Size();ic++) {
MarkTransitiveClosureOfNodes(inclusion_constraints[ic], number_of_nodes);
}
|
| |||
// follow collapse-to relationship
if (node->DoesCollapse())
{
MarkTransitiveClosureOfNodes(node->Collapse(), number_of_nodes);
}
// follow inclusion constraints
const SetOfNodes &inclusion_constraints = node->GetInclusionConstraints();
for (std::size_t ic = 0; ic < inclusion_constraints.Size(); ic++)
{
MarkTransitiveClosureOfNodes(inclusion_constraints[ic], number_of_nodes);
}
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| None | |||