| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 11 | 2 | 0 | 1.000 | statement_seq[2] |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 11 | 322 | InclusionConstraintGraph/Graph.h |
| 2 | 11 | 368 | InclusionConstraintGraph/Graph.h |
| ||||
if ( (path->node == std::pair<SingletonNode, MapOptionalIndirectNodesToVisitInformation::Indirection>(node, indirection)) ||
( (path->collapse_into == path) &&
((indirection == MapOptionalIndirectNodesToVisitInformation::Direct) ? path->direct_collapse_nodes->IsIn(node) :
(indirection == MapOptionalIndirectNodesToVisitInformation::Indirect) ? path->indirect_collapse_nodes->IsIn(node) :
(assert(0), false))))
{
break;
}
path = path->previous_path;
|
| ||||
if ( (path->node == std::pair<SingletonNode, MapOptionalIndirectNodesToVisitInformation::Indirection>(node, indirection)) ||
( (path->collapse_into == path) &&
((indirection == MapOptionalIndirectNodesToVisitInformation::Direct) ? path->direct_collapse_nodes->IsIn(node) :
(indirection == MapOptionalIndirectNodesToVisitInformation::Indirect) ? path->indirect_collapse_nodes->IsIn(node) :
(assert(0), false))))
{
break;
}
path = path->previous_path;
|
| |||
if ((path->node == std::pair<SingletonNode, MapOptionalIndirectNodesToVisitInformation::Indirection>(node, indirection)) || ((path->collapse_into == path) && ((indirection == MapOptionalIndirectNodesToVisitInformation::Direct) ? path->direct_collapse_nodes->IsIn(node) : (indirection == MapOptionalIndirectNodesToVisitInformation::Indirect) ? path->indirect_collapse_nodes->IsIn(node) : (assert(0), false))))
{
break;
}
path = path->previous_path;
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| None | |||