Exemplo n.º 1
0
            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);
            }
Exemplo n.º 2
0
 public int CombinedIndexOf(MatchedLineNode node) =>
 CountAccessor.IndexOf(tree, node, n => n.lineCount);
Exemplo n.º 3
0
 public int OppositeIndexOf(MatchedLineNode node) =>
 CountAccessor.IndexOf(tree, node, n => n.LineCount(!side));