| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 6 | 2 | 0 | 1.000 | statement_seq[2] |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 7 | 286 | InclusionConstraintGraph/SetOfNodes.h |
| 2 | 6 | 413 | InclusionConstraintGraph/SetOfNodes.h |
| ||||
// create non-shared copy of set if necessary
if (m_connections->IsShared()) {
Sequence *new_m_connections = m_connections->Copy();
m_connections->Destroy();
m_connections = new_m_connections;
}
// insert node into ordered sequence
assert(!m_connections->IsShared());
|
| ||||
// create non-shared copy of set if necessary
if (m_connections->IsShared()) {
Sequence *new_m_connections = m_connections->Copy();
m_connections->Destroy();
m_connections = new_m_connections;
}
assert(!m_connections->IsShared());
|
| |||
// create non-shared copy of set if necessary
if (m_connections->IsShared())
{
Sequence * new_m_connections = m_connections->Copy();
m_connections->Destroy();
m_connections = new_m_connections;
}
// insert node into ordered sequence
assert(!m_connections->IsShared());
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| None | |||