562   std::unique_ptr<std::unique_ptr<double[]>[]> TreeDist, ForestDist;  member in clang::diff::ZhangShashaMatcher
570     ForestDist = std::make_unique<std::unique_ptr<double[]>[]>(  in ZhangShashaMatcher()
574       ForestDist[I] = std::make_unique<double[]>(size_t(S2.getSize()) + 1);  in ZhangShashaMatcher()
607             ForestDist[Row - 1][Col] + 1 == ForestDist[Row][Col]) {  in getMatchingNodes()
610                    ForestDist[Row][Col - 1] + 1 == ForestDist[Row][Col]) {  in getMatchingNodes()
661     ForestDist[LMD1][LMD2] = 0;  in computeForestDist()
663       ForestDist[D1][LMD2] = ForestDist[D1 - 1][LMD2] + DeletionCost;  in computeForestDist()
665         ForestDist[LMD1][D2] = ForestDist[LMD1][D2 - 1] + InsertionCost;  in computeForestDist()
670           ForestDist[D1][D2] =  in computeForestDist()
671               std::min({ForestDist[D1 - 1][D2] + DeletionCost,  in computeForestDist()
672                         ForestDist[D1][D2 - 1] + InsertionCost,  in computeForestDist()
673                         ForestDist[D1 - 1][D2 - 1] + UpdateCost});  in computeForestDist()
674           TreeDist[D1][D2] = ForestDist[D1][D2];  in computeForestDist()
676           ForestDist[D1][D2] =  in computeForestDist()
677               std::min({ForestDist[D1 - 1][D2] + DeletionCost,  in computeForestDist()
678                         ForestDist[D1][D2 - 1] + InsertionCost,  in computeForestDist()
679                         ForestDist[DLMD1][DLMD2] + TreeDist[D1][D2]});  in computeForestDist()