| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 25 | 2 | 5 | 0.960 | labeled_statement |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 25 | 2464 | InclusionConstraintGraph/Graph.h |
| 2 | 25 | 2490 | InclusionConstraintGraph/Graph.h |
| ||||
case L'V': {
// 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.has_function_variadic_parameter = true;
// add variadic parameter
if (!map_node_number_to_node[from].node->HasFunctionVariadicParameter()) {
map_node_number_to_node[from].node->AddFunctionVariadicParameter(map_node_number_to_node[to].node);
if (map_node_number_to_node[from].node->GetOnPath() != Node::IsMarked) { // node is existing node?
changed_on_read = true;
}
}
else {
if (map_node_number_to_node[from].node->GetFunctionVariadicParameter() != map_node_number_to_node[to].node) {
equivalent_nodes.resize(equivalent_nodes.size() +1,std::pair<Node *, Node *>(map_node_number_to_node[from].node->GetFunctionVariadicParameter(), map_node_number_to_node[to].node));
}
}
break;
}
|
| ||||
case L'R': {
// 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.has_function_result = true;
// add result
if (!map_node_number_to_node[from].node->HasFunctionResult()) {
map_node_number_to_node[from].node->AddFunctionResult(map_node_number_to_node[to].node);
if (map_node_number_to_node[from].node->GetOnPath() != Node::IsMarked) { // node is existing node?
changed_on_read = true;
}
}
else {
if (map_node_number_to_node[from].node->GetFunctionResult() != map_node_number_to_node[to].node) {
equivalent_nodes.resize(equivalent_nodes.size() +1,std::pair<Node *, Node *>(map_node_number_to_node[from].node->GetFunctionResult(), map_node_number_to_node[to].node));
}
}
break;
}
|
| |||
case [[#variablea91e940]]:
{
// 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.[[#variablea91e0e0]] = true;
// add result
// add variadic parameter
if (!map_node_number_to_node[from].node->[[#variablea91e5c0]]())
{
map_node_number_to_node[from].node->[[#variablea91e900]](map_node_number_to_node[to].node);
if (map_node_number_to_node[from].node->GetOnPath() != Node::IsMarked)
{ // node is existing node?
changed_on_read = true;
}
}
else
{
if (map_node_number_to_node[from].node->[[#variablea91e840]]() != map_node_number_to_node[to].node)
{
equivalent_nodes.resize(equivalent_nodes.size() + 1, std::pair<Node *, Node *>(map_node_number_to_node[from].node->[[#variablea91e840]](), map_node_number_to_node[to].node));
}
}
break;
}
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a91e940]] | L'R' |
| 1 | 2 | [[#a91e940]] | L'V' |
| 2 | 1 | [[#a91e0e0]] | has_function_result |
| 2 | 2 | [[#a91e0e0]] | has_function_variadic_parameter |
| 3 | 1 | [[#a91e5c0]] | HasFunctionResult |
| 3 | 2 | [[#a91e5c0]] | HasFunctionVariadicParameter |
| 4 | 1 | [[#a91e900]] | AddFunctionResult |
| 4 | 2 | [[#a91e900]] | AddFunctionVariadicParameter |
| 5 | 1 | [[#a91e840]] | GetFunctionResult |
| 5 | 2 | [[#a91e840]] | GetFunctionVariadicParameter |