664       for (SNodeId D2 = LMD2 + 1; D2 <= Id2; ++D2) {  in computeForestDist()  local
665         ForestDist[LMD1][D2] = ForestDist[LMD1][D2 - 1] + InsertionCost;  in computeForestDist()
667         SNodeId DLMD2 = S2.getLeftMostDescendant(D2);  in computeForestDist()
669           double UpdateCost = getUpdateCost(D1, D2);  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()