public void Recompare(MatchedLineNode node, string ourLine, string otherLine) { if (ourLine == otherLine) { node.SetEqual(); return; } var charRep = new CharRepresenter(); var wmLeft = charRep.WordsToChars(side ? otherLine : ourLine); var wmRight = charRep.WordsToChars(side ? ourLine : otherLine); var match = new PatienceMatch().Match(wmLeft, wmRight, charRep.MaxWordChar); node.Compare(match, wmLeft, wmRight, charRep); }
public int CombinedIndexOf(MatchedLineNode node) => CountAccessor.IndexOf(tree, node, n => n.lineCount);
public int OppositeIndexOf(MatchedLineNode node) => CountAccessor.IndexOf(tree, node, n => n.LineCount(!side));