| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 26 | 5 | 1 | 0.952 | selection_statement |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 26 | 1113 | InclusionConstraintGraph/Graph.h |
| 2 | 26 | 1194 | InclusionConstraintGraph/Graph.h |
| 3 | 26 | 1385 | InclusionConstraintGraph/Graph.h |
| 4 | 26 | 1415 | InclusionConstraintGraph/Graph.h |
| 5 | 26 | 1450 | InclusionConstraintGraph/Graph.h |
| ||||
if (including_node != included_node) {
#if PERFORM_EXTENDED_ALREADY_INCLUDED_CHECKS
if (!including_node->GetInclusionConstraints().IsIn(included_node)) {
bool already_included=false;
const SetOfNodes &inclusion_constraints = including_node->GetInclusionConstraints();
for (std::size_t ic=0; ic <inclusion_constraints.Size();ic++) {
if (inclusion_constraints[ic] != included_node) {
if (inclusion_constraints[ic]->TransitivelyCollapse() == included_node) {
already_included = true;
}
}
else {
already_included = true;
}
}
if (!already_included) {
including_node->EstablishIncludes(included_node);
changed_on_current_iteration = true;
number_of_changes++;
}
}
#else
if (including_node->EstablishIncludes(included_node)) {
changed_on_current_iteration = true;
number_of_changes++;
}
#endif
}
|
| ||||
if (including_node != included_node) {
#if PERFORM_EXTENDED_ALREADY_INCLUDED_CHECKS
if (!including_node->GetInclusionConstraints().IsIn(included_node)) {
bool already_included=false;
const SetOfNodes &inclusion_constraints = including_node->GetInclusionConstraints();
for (std::size_t ic=0; ic <inclusion_constraints.Size();ic++) {
if (inclusion_constraints[ic] != included_node) {
if (inclusion_constraints[ic]->TransitivelyCollapse() == included_node) {
already_included = true;
}
}
else {
already_included = true;
}
}
if (!already_included) {
including_node->EstablishIncludes(included_node);
changed_on_current_iteration = true;
number_of_changes++;
}
}
#else
if (including_node->EstablishIncludes(included_node)) {
changed_on_current_iteration = true;
number_of_changes++;
}
#endif
}
|
| ||||
if (including_node != argument) {
#if PERFORM_EXTENDED_ALREADY_INCLUDED_CHECKS
if (!including_node->GetInclusionConstraints().IsIn(argument)) {
bool already_included=false;
const SetOfNodes &inclusion_constraints = including_node->GetInclusionConstraints();
for (std::size_t ic=0; ic <inclusion_constraints.Size();ic++) {
if (inclusion_constraints[ic] != argument) {
if (inclusion_constraints[ic]->TransitivelyCollapse() == argument) {
already_included = true;
}
}
else {
already_included = true;
}
}
if (!already_included) {
including_node->EstablishIncludes(argument);
changed_on_current_iteration = true;
number_of_changes++;
}
}
#else
if (including_node->EstablishIncludes(argument)) {
changed_on_current_iteration = true;
number_of_changes++;
}
#endif
}
|
| ||||
if (including_node != argument) {
#if PERFORM_EXTENDED_ALREADY_INCLUDED_CHECKS
if (!including_node->GetInclusionConstraints().IsIn(argument)) {
bool already_included=false;
const SetOfNodes &inclusion_constraints = including_node->GetInclusionConstraints();
for (std::size_t ic=0; ic <inclusion_constraints.Size();ic++) {
if (inclusion_constraints[ic] != argument) {
if (inclusion_constraints[ic]->TransitivelyCollapse() == argument) {
already_included = true;
}
}
else {
already_included = true;
}
}
if (!already_included) {
including_node->EstablishIncludes(argument);
changed_on_current_iteration = true;
number_of_changes++;
}
}
#else
if (including_node->EstablishIncludes(argument)) {
changed_on_current_iteration = true;
number_of_changes++;
}
#endif
}
|
| ||||
if (including_node != argument) {
#if PERFORM_EXTENDED_ALREADY_INCLUDED_CHECKS
if (!including_node->GetInclusionConstraints().IsIn(argument)) {
bool already_included=false;
const SetOfNodes &inclusion_constraints = including_node->GetInclusionConstraints();
for (std::size_t ic=0; ic <inclusion_constraints.Size();ic++) {
if (inclusion_constraints[ic] != argument) {
if (inclusion_constraints[ic]->TransitivelyCollapse() == argument) {
already_included = true;
}
}
else {
already_included = true;
}
}
if (!already_included) {
including_node->EstablishIncludes(argument);
changed_on_current_iteration = true;
number_of_changes++;
}
}
#else
if (including_node->EstablishIncludes(argument)) {
changed_on_current_iteration = true;
number_of_changes++;
}
#endif
}
|
| |||
if (including_node != [[#variable4f86f60]])
{
#if PERFORM_EXTENDED_ALREADY_INCLUDED_CHECKS
if (!including_node->GetInclusionConstraints().IsIn([[#variable4f86f60]]))
{
bool already_included = false;
const SetOfNodes &inclusion_constraints = including_node->GetInclusionConstraints();
for (std::size_t ic = 0; ic < inclusion_constraints.Size(); ic++)
{
if (inclusion_constraints[ic] != [[#variable4f86f60]])
{
if (inclusion_constraints[ic]->TransitivelyCollapse() == [[#variable4f86f60]])
{
already_included = true;
}
}
else
{
already_included = true;
}
}
if (!already_included)
{
including_node->EstablishIncludes([[#variable4f86f60]]);
changed_on_current_iteration = true;
number_of_changes++;
}
}
#else
if (including_node->EstablishIncludes([[#variable4f86f60]]))
{
changed_on_current_iteration = true;
number_of_changes++;
}
#endif
}
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#4f86f60]] | argument |
| 1 | 2 | [[#4f86f60]] | included_node |
| 1 | 3 | [[#4f86f60]] | argument |
| 1 | 4 | [[#4f86f60]] | argument |
| 1 | 5 | [[#4f86f60]] | included_node |