Previous CloneSet | Next CloneSet | Back to Main Report |
Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
---|---|---|---|---|
7 | 3 | 1 | 0.976 | iteration_statement |
Clone Abstraction | Parameter Bindings |
Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
---|---|---|---|
1 | 7 | 433 | InclusionConstraintGraph/Graph.h |
2 | 7 | 444 | InclusionConstraintGraph/Graph.h |
3 | 7 | 455 | InclusionConstraintGraph/Graph.h |
| ||||
for (std::size_t n=0; n <m_assignments_to_targets_from_dereferenced_sources.Size();n++) { Node *source = m_assignments_to_targets_from_dereferenced_sources[n].Source(); if (source->GetKind() != Node::FunctionNode) { if (source->DoesCollapse()) { const CachedIndirectCycle *cached_information = source->TransitivelyCollapse()->LookupCachedIndirectCycle(); if (cached_information != NULL) { source->AddCachedIndirectCycle().equivalent_direct_node = cached_information->equivalent_direct_node; } } } } |
| ||||
for (std::size_t n=0; n <m_assignments_to_targets_from_fields_of_dereferenced_sources.Size();n++) { Node *source = m_assignments_to_targets_from_fields_of_dereferenced_sources[n].Source(); if (source->GetKind() != Node::FunctionNode) { if (source->DoesCollapse()) { const CachedIndirectCycle *cached_information = source->TransitivelyCollapse()->LookupCachedIndirectCycle(); if (cached_information != NULL) { source->AddCachedIndirectCycle().equivalent_direct_node = cached_information->equivalent_direct_node; } } } } |
| ||||
for (std::size_t n=0; n <m_assignments_to_targets_from_addresses_of_fields_of_dereferenced_sources.Size();n++) { Node *source = m_assignments_to_targets_from_addresses_of_fields_of_dereferenced_sources[n].Source(); if (source->GetKind() != Node::FunctionNode) { if (source->DoesCollapse()) { const CachedIndirectCycle *cached_information = source->TransitivelyCollapse()->LookupCachedIndirectCycle(); if (cached_information != NULL) { source->AddCachedIndirectCycle().equivalent_direct_node = cached_information->equivalent_direct_node; } } } } |
| |||
for (std::size_t n = 0; n < [[#variablea92bf40]].Size(); n++) { Node * source = [[#variablea92bf40]][n].Source(); if (source->GetKind() != Node::FunctionNode) { if (source->DoesCollapse()) { const CachedIndirectCycle *cached_information = source->TransitivelyCollapse()->LookupCachedIndirectCycle(); if (cached_information != NULL) { source->AddCachedIndirectCycle().equivalent_direct_node = cached_information->equivalent_direct_node; } } } } |
CloneAbstraction |
Parameter Index | Clone Instance | Parameter Name | Value |
---|---|---|---|
1 | 1 | [[#a92bf40]] | m_assignments_to_targets_from_addresses_of_fields_of_dereferenced_sources |
1 | 2 | [[#a92bf40]] | m_assignments_to_targets_from_fields_of_dereferenced_sources |
1 | 3 | [[#a92bf40]] | m_assignments_to_targets_from_dereferenced_sources |