CloneSet18


Previous CloneSetNext CloneSetBack to Main Report
Clone
Mass
Clones in
CloneSet
Parameter
Count
Clone
Similarity
Syntax Category
[Sequence Length]
11210.967iteration_statement
Clone AbstractionParameter Bindings
Clone Instance
(Click to see clone)
Line CountSource Line
Source File
111212
InclusionConstraintGraph/Graph.h
211227
InclusionConstraintGraph/Graph.h
Clone Instance
1
Line Count
11
Source Line
212
Source File
InclusionConstraintGraph/Graph.h

                                                                // cache information about cycles with indirect nodes
                                                                do {
                                                                        for (std::size_t n=0; n <next_path.direct_collapse_nodes->Size();n++) {
                                                                                Node *node = (*next_path.direct_collapse_nodes)[n];
                                                                                cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Direct) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
                                                                                                                                              }
                                                                        for (std::size_t n=0; n <next_path.indirect_collapse_nodes->Size();n++) {
                                                                                Node *node = (*next_path.indirect_collapse_nodes)[n];
                                                                                cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Indirect) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
                                                                                node->AddCachedIndirectCycle().equivalent_direct_node = collapsed_cycle_node;
                                                                                                                                                }
                                                                   }
                                                                while (  0);


Clone Instance
2
Line Count
11
Source Line
227
Source File
InclusionConstraintGraph/Graph.h

                                                                // cache information about cycles with indirect nodes
                                                                do {
                                                                        for (std::size_t n=0; n <next_path.direct_collapse_nodes->Size();n++) {
                                                                                Node *node = (*next_path.direct_collapse_nodes)[n];
                                                                                cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Direct) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
                                                                                                                                              }
                                                                        for (std::size_t n=0; n <next_path.indirect_collapse_nodes->Size();n++) {
                                                                                Node *node = (*next_path.indirect_collapse_nodes)[n];
                                                                                cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Indirect) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
                                                                                node->AddCachedIndirectCycle().equivalent_direct_node = (*next_path.direct_collapse_nodes)[0];
                                                                                                                                                }
                                                                   }
                                                                while (  0);


Clone AbstractionParameter Count: 1Parameter Bindings

// cache information about cycles with indirect nodes
do
  {
    for (std::size_t n = 0; n < next_path.direct_collapse_nodes->Size(); n++)
      {
        Node * node = (*next_path.direct_collapse_nodes)[n];
        cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Direct) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
      }
    for (std::size_t n = 0; n < next_path.indirect_collapse_nodes->Size(); n++)
      {
        Node * node = (*next_path.indirect_collapse_nodes)[n];
        cache.Add(node, MapOptionalIndirectNodesToVisitInformation::Indirect) = MapOptionalIndirectNodesToVisitInformation::IsNotOnPath;
        node->AddCachedIndirectCycle().equivalent_direct_node = [[#variablea927a00]];
      }
  }
while (0);
 

CloneAbstraction
Parameter Bindings
Parameter
Index
Clone
Instance
Parameter
Name
Value
11[[#a927a00]]
collapsed_cycle_node 
12[[#a927a00]]
(*next_path.direct_collapse_nodes)[0]