| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 23 | 2 | 3 | 0.972 | labeled_statement |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 23 | 2389 | InclusionConstraintGraph/Graph.h |
| 2 | 23 | 2413 | InclusionConstraintGraph/Graph.h |
| ||||
case L'I': {
// get from node
std::size_t from;
GetNumber(from);
// skip separator
SkipCharacter(L':');
// get to node
std::size_t to;
GetNumber(to);
// skip newline
SkipNewline();
// collect statistics
map_node_number_to_node[from].statistics.inclusion_constraints++;
// establish inclusion constraint
if (map_node_number_to_node[from].node->EstablishIncludes(map_node_number_to_node[to].node)) {
if ( (map_node_number_to_node[from].node->GetOnPath() != Node::IsMarked) // node is existing node?
&& (map_node_number_to_node[from].node->GetAuxiliaryBorder() != Node::IsAuxiliaryBorder) &&
(!map_node_number_to_node[from].statistics.is_auxiliary_border))
{
changed_on_read = true;
}
}
break;
}
|
| ||||
case L'L': {
// get from node
std::size_t from;
GetNumber(from);
// skip separator
SkipCharacter(L':');
// get to node
std::size_t to;
GetNumber(to);
// skip newline
SkipNewline();
// collect statistics
map_node_number_to_node[from].statistics.pointed_to_locations++;
// establish pointed-to location
if (map_node_number_to_node[from].node->EstablishPointsTo(map_node_number_to_node[to].node)) {
if ( (map_node_number_to_node[from].node->GetOnPath() != Node::IsMarked) // node is existing node?
&& (map_node_number_to_node[from].node->GetAuxiliaryBorder() != Node::IsAuxiliaryBorder) &&
(!map_node_number_to_node[from].statistics.is_auxiliary_border))
{
changed_on_read = true;
}
}
break;
}
|
| |||
case [[#variablea930920]]:
{
// get from node
std::size_t from;
GetNumber(from);
// skip separator
SkipCharacter(L':');
// get to node
std::size_t to;
GetNumber(to);
// skip newline
SkipNewline();
// collect statistics
map_node_number_to_node[from].statistics.[[#variablea930760]]++;
// establish pointed-to location
// establish inclusion constraint
if (map_node_number_to_node[from].node->[[#variablea930880]](map_node_number_to_node[to].node))
{
if ((map_node_number_to_node[from].node->GetOnPath() != Node::IsMarked) // node is existing node?
&& (map_node_number_to_node[from].node->GetAuxiliaryBorder() != Node::IsAuxiliaryBorder) && (!map_node_number_to_node[from].statistics.is_auxiliary_border))
{
changed_on_read = true;
}
}
break;
}
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a930920]] | L'L' |
| 1 | 2 | [[#a930920]] | L'I' |
| 2 | 1 | [[#a930760]] | pointed_to_locations |
| 2 | 2 | [[#a930760]] | inclusion_constraints |
| 3 | 1 | [[#a930880]] | EstablishPointsTo |
| 3 | 2 | [[#a930880]] | EstablishIncludes |