| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 5 | 3 | 0 | 1.000 | statement_seq[3] |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 5 | 681 | InclusionConstraintGraph/Graph.h |
| 2 | 5 | 746 | InclusionConstraintGraph/Graph.h |
| 3 | 5 | 826 | InclusionConstraintGraph/Graph.h |
| ||||
// update status of cached information
cached_information.last_updated_on_iteration = current_iteration;
if (pointed_to_nodes.Size() != last_number_of_pointed_to_nodes) {
cached_information.last_changed_on_iteration = current_iteration;
}
cached_information.visited_inclusion_constraints = node->GetInclusionConstraints().Size();
|
| ||||
// update status of cached information
cached_information.last_updated_on_iteration = current_iteration;
if (pointed_to_nodes.Size() != last_number_of_pointed_to_nodes) {
cached_information.last_changed_on_iteration = current_iteration;
}
cached_information.visited_inclusion_constraints = node->GetInclusionConstraints().Size();
|
| ||||
// update status of cached information
cached_information.last_updated_on_iteration = current_iteration;
if (pointed_to_nodes.Size() != last_number_of_pointed_to_nodes) {
cached_information.last_changed_on_iteration = current_iteration;
}
cached_information.visited_inclusion_constraints = node->GetInclusionConstraints().Size();
|
| |||
// update status of cached information
cached_information.last_updated_on_iteration = current_iteration;
if (pointed_to_nodes.Size() != last_number_of_pointed_to_nodes)
{
cached_information.last_changed_on_iteration = current_iteration;
}
cached_information.visited_inclusion_constraints = node->GetInclusionConstraints().Size();
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| None | |||