Lines Matching refs:That
3 // license that can be found in the LICENSE.md file.
11 // This package prioritizes performance over accuracy. That is, the run time
19 // Identity indicates that a symbol pair is identical in both list X and Y.
21 // UniqueX indicates that a symbol only exists in X and not Y.
23 // UniqueY indicates that a symbol only exists in Y and not X.
25 // Modified indicates that a symbol pair is a modification of each other.
88 // NSame is the number of sub-elements that are equal.
89 // NDiff is the number of sub-elements that are not equal.
98 // (i.e., those that return Result{1, 0} or Result{0, 1}) to be similar.
102 // Use NSame+1 to offset NSame so that binary comparisons are similar.
116 // This algorithm is not guaranteed to be an optimal solution (i.e., one that
134 // effectively O(N^2). Unlike the algorithm from that paper, we are not
177 // The longest sequence of non-matching symbols that can be tolerated is
186 // a search that starts at the beginning (the top-left corner), and
187 // a search that starts at the end (the bottom-right corner). The goal of
201 // that two lists commonly differ because elements were added to the front
