| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 7 | 4 | 1 | 0.968 | statement_seq[2] |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 7 | 255 | InclusionConstraintGraph/SetOfNodes.h |
| 2 | 8 | 304 | InclusionConstraintGraph/SetOfNodes.h |
| 3 | 7 | 375 | InclusionConstraintGraph/SetOfNodes.h |
| 4 | 7 | 618 | InclusionConstraintGraph/SetOfNodes.h |
| ||||
// check whether sequence is ordered
#if PERFORM_EXTENDED_SANITY_CHECKS
{ for (std::size_t i=m_connections->size() -1;i >0;i--) {
assert((*m_connections)[i -1] <(*m_connections)[i]);
}
}
#endif
return false;
|
| ||||
// check whether sequence is ordered
#if PERFORM_EXTENDED_SANITY_CHECKS
{ for (std::size_t i=m_connections->size() -1;i >0;i--) {
assert((*m_connections)[i -1] <(*m_connections)[i]);
}
}
#endif
// node was not in set
return false;
|
| ||||
// check whether sequence is ordered
#if PERFORM_EXTENDED_SANITY_CHECKS
{ for (std::size_t i=m_connections->size() -1;i >0;i--) {
assert((*m_connections)[i -1] <(*m_connections)[i]);
}
}
#endif
return;
|
| ||||
// check whether sequence is ordered
#if PERFORM_EXTENDED_SANITY_CHECKS
{ for (std::size_t i=m_connections->size() -1;i >0;i--) {
assert((*m_connections)[i -1] <(*m_connections)[i]);
}
}
#endif
return;
|
| |||
// check whether sequence is ordered
#if PERFORM_EXTENDED_SANITY_CHECKS
{
for (std::size_t i = m_connections->size() - 1; i > 0; i--)
{
assert((*m_connections)[i - 1] < (*m_connections)[i]);
}
}
#endif
[[#variablea939f20]]
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a939f20]] | return false; |
| 1 | 2 | [[#a939f20]] | return; |
| 1 | 3 | [[#a939f20]] | // node was not in set return false; |
| 1 | 4 | [[#a939f20]] | return; |