| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 11 | 2 | 1 | 0.984 | declaration_seq |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 11 | 50 | InclusionConstraintGraph/Configuration.h |
| 2 | 11 | 64 | InclusionConstraintGraph/Configuration.h |
| ||||
static const unsigned long size_of_node = 128; // power of two upper bound for size of inclusion constraint graph node in chars
typedef Node *NodeRepresentationType;
__forceinline Node *representation_to_pnode(NodeRepresentationType ul) {
assert(ul != 0);
return ul;
}
__forceinline NodeRepresentationType pnode_to_representation(Node *pn) {
assert(pn != NULL);
return pn;
}
|
| ||||
static const unsigned long size_of_node = 64; // power of two upper bound for size of inclusion constraint graph node in chars
typedef Node *NodeRepresentationType;
__forceinline Node *representation_to_pnode(NodeRepresentationType ul) {
assert(ul != 0);
return ul;
}
__forceinline NodeRepresentationType pnode_to_representation(Node *pn) {
assert(pn != NULL);
return pn;
}
|
| |||
static const unsigned long size_of_node = [[#variablea936d00]]; // power of two upper bound for size of inclusion constraint graph node in chars
typedef Node *NodeRepresentationType;
__forceinline Node *representation_to_pnode(NodeRepresentationType ul)
{
assert(ul != 0);
return ul;
}
__forceinline NodeRepresentationType pnode_to_representation(Node *pn)
{
assert(pn != NULL);
return pn;
}
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a936d00]] | 128 |
| 1 | 2 | [[#a936d00]] | 64 |