Lines Matching refs:D2
665 for (SNodeId D2 = LMD2 + 1; D2 <= Id2; ++D2) { in computeForestDist() local
666 ForestDist[LMD1][D2] = ForestDist[LMD1][D2 - 1] + InsertionCost; in computeForestDist()
668 SNodeId DLMD2 = S2.getLeftMostDescendant(D2); in computeForestDist()
670 double UpdateCost = getUpdateCost(D1, D2); in computeForestDist()
671 ForestDist[D1][D2] = in computeForestDist()
672 std::min({ForestDist[D1 - 1][D2] + DeletionCost, in computeForestDist()
673 ForestDist[D1][D2 - 1] + InsertionCost, in computeForestDist()
674 ForestDist[D1 - 1][D2 - 1] + UpdateCost}); in computeForestDist()
675 TreeDist[D1][D2] = ForestDist[D1][D2]; in computeForestDist()
677 ForestDist[D1][D2] = in computeForestDist()
678 std::min({ForestDist[D1 - 1][D2] + DeletionCost, in computeForestDist()
679 ForestDist[D1][D2 - 1] + InsertionCost, in computeForestDist()
680 ForestDist[DLMD1][DLMD2] + TreeDist[D1][D2]}); in computeForestDist()