| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 24 | 2 | 2 | 0.953 | statement_seq[3] |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 24 | 2935 | InclusionConstraintGraph/Graph.h |
| 2 | 24 | 2959 | InclusionConstraintGraph/Graph.h |
| ||||
while (file[position] != L'-') {
// get target node
std::size_t target;
GetNumber(target);
// skip separator
SkipCharacter(L':');
// get source node
std::size_t source;
GetNumber(source);
// skip newline
SkipNewline();
// remember constraint
if (!read_assignments.m_assignments_to_dereferenced_targets_from_sources.IsInOrElseAdd(map_node_number_to_node[target].node,map_node_number_to_node[source].node)) {
m_assignments_to_dereferenced_targets_from_sources.Append(file_translation_unit, map_node_number_to_node[target].node, map_node_number_to_node[source].node);
}
else {
#if 1 // needed to write back constraints
m_assignments_to_dereferenced_targets_from_sources.Append(file_translation_unit, map_node_number_to_node[target].node, map_node_number_to_node[source].node);
m_assignments_to_dereferenced_targets_from_sources[m_assignments_to_dereferenced_targets_from_sources.Size() -1].SetIsDuplicate();
#endif
}
}
// read constraints target=*source
SkipText(L"-- target=*source"); SkipNewline();
|
| ||||
while (file[position] != L'-') {
// get target node
std::size_t target;
GetNumber(target);
// skip separator
SkipCharacter(L':');
// get source node
std::size_t source;
GetNumber(source);
// skip newline
SkipNewline();
// remember constraint
if (!read_assignments.m_assignments_to_targets_from_dereferenced_sources.IsInOrElseAdd(map_node_number_to_node[target].node,map_node_number_to_node[source].node)) {
m_assignments_to_targets_from_dereferenced_sources.Append(file_translation_unit, map_node_number_to_node[target].node, map_node_number_to_node[source].node);
}
else {
#if 1 // needed to write back constraints
m_assignments_to_targets_from_dereferenced_sources.Append(file_translation_unit, map_node_number_to_node[target].node, map_node_number_to_node[source].node);
m_assignments_to_targets_from_dereferenced_sources[m_assignments_to_targets_from_dereferenced_sources.Size() -1].SetIsDuplicate();
#endif
}
}
// read constraints target=(*source).field
SkipText(L"-- target=(*source).field"); SkipNewline();
|
| |||
while (file[position] != L'-')
{
// get target node
std::size_t target;
GetNumber(target);
// skip separator
SkipCharacter(L':');
// get source node
std::size_t source;
GetNumber(source);
// skip newline
SkipNewline();
// remember constraint
if (!read_assignments.[[#variablea8970a0]].IsInOrElseAdd(map_node_number_to_node[target].node, map_node_number_to_node[source].node))
{
[[#variablea8970a0]].Append(file_translation_unit, map_node_number_to_node[target].node, map_node_number_to_node[source].node);
}
else
{
#if 1 // needed to write back constraints
[[#variablea8970a0]].Append(file_translation_unit, map_node_number_to_node[target].node, map_node_number_to_node[source].node);
[[#variablea8970a0]][[[#variablea8970a0]].Size() - 1].SetIsDuplicate();
#endif
}
}
// read constraints target=(*source).field
// read constraints target=*source
SkipText([[#variablea892760]]);
SkipNewline();
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a8970a0]] | m_assignments_to_targets_from_dereferenced_sources |
| 1 | 2 | [[#a8970a0]] | m_assignments_to_dereferenced_targets_from_sources |
| 2 | 1 | [[#a892760]] | L"-- target=(*source).field" |
| 2 | 2 | [[#a892760]] | L"-- target=*source" |