Previous CloneSet | Next CloneSet | Back to Main Report |
Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
---|---|---|---|---|
9 | 2 | 0 | 1.000 | function_definition |
Clone Abstraction | Parameter Bindings |
Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
---|---|---|---|
1 | 9 | 33 | InclusionConstraintGraph/SequenceOfNodes.h |
2 | 9 | 106 | InclusionConstraintGraph/SetOfNodes.h |
| ||||
__forceinline Node *operator[] (std::size_t n)const { if ((reinterpret_cast<std::size_t>(reinterpret_cast<char *>(m_connections)) & 1) != 0) { // single node in sequence assert(n == 0); return reinterpret_cast<Node*>(reinterpret_cast<char *>(m_connections) -1); } else { // multiple nodes in sequence assert(n < m_connections->size()); return representation_to_pnode((*m_connections)[n]); } } |
| ||||
__forceinline Node *operator[] (std::size_t n)const { if ((reinterpret_cast<std::size_t>(reinterpret_cast<char *>(m_connections)) & 1) != 0) { // single node in set assert(n == 0); return reinterpret_cast<Node *>(reinterpret_cast<char *>(m_connections) -1); } else { // multiple nodes in set assert(n < m_connections->size()); return representation_to_pnode((*m_connections)[n]); } } |
| |||
__forceinline Node *operator[] (std::size_t n) const { if ((reinterpret_cast<std::size_t>(reinterpret_cast<char *>(m_connections)) & 1) != 0) { // single node in set // single node in sequence assert(n == 0); return reinterpret_cast<Node *>(reinterpret_cast<char *>(m_connections) - 1); } else { // multiple nodes in set // multiple nodes in sequence assert(n < m_connections->size()); return representation_to_pnode((*m_connections)[n]); } } |
CloneAbstraction |
Parameter Index | Clone Instance | Parameter Name | Value |
---|---|---|---|
None |