| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 11 | 2 | 1 | 0.967 | iteration_statement |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 11 | 212 | InclusionConstraintGraph/Graph.h |
| 2 | 11 | 227 | InclusionConstraintGraph/Graph.h |
| ||||
// cache information about cycles with indirect nodes
do {
for (std::size_t n=0; n <next_path.direct_collapse_nodes->Size();n++) {
Node *node = (*next_path.direct_collapse_nodes)[n];
cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Direct) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
}
for (std::size_t n=0; n <next_path.indirect_collapse_nodes->Size();n++) {
Node *node = (*next_path.indirect_collapse_nodes)[n];
cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Indirect) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
node->AddCachedIndirectCycle().equivalent_direct_node = collapsed_cycle_node;
}
}
while ( 0);
|
| ||||
// cache information about cycles with indirect nodes
do {
for (std::size_t n=0; n <next_path.direct_collapse_nodes->Size();n++) {
Node *node = (*next_path.direct_collapse_nodes)[n];
cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Direct) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
}
for (std::size_t n=0; n <next_path.indirect_collapse_nodes->Size();n++) {
Node *node = (*next_path.indirect_collapse_nodes)[n];
cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Indirect) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
node->AddCachedIndirectCycle().equivalent_direct_node = (*next_path.direct_collapse_nodes)[0];
}
}
while ( 0);
|
| |||
// cache information about cycles with indirect nodes
do
{
for (std::size_t n = 0; n < next_path.direct_collapse_nodes->Size(); n++)
{
Node * node = (*next_path.direct_collapse_nodes)[n];
cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Direct) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
}
for (std::size_t n = 0; n < next_path.indirect_collapse_nodes->Size(); n++)
{
Node * node = (*next_path.indirect_collapse_nodes)[n];
cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Indirect) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
node->AddCachedIndirectCycle().equivalent_direct_node = [[#variablea927a00]];
}
}
while (0);
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a927a00]] | collapsed_cycle_node |
| 1 | 2 | [[#a927a00]] | (*next_path.direct_collapse_nodes)[0] |