4 writes to

Microsoft.CodeAnalysis.Razor.Workspaces (4)

TextDifferencing\TextDiffer.cs (4)

133vf[forwardOffset + forwardK + 1] = lowA; 134vr[reverseOffset + reverseK - 1] = highA; 165vf[forwardOffset + k] = x; 208vr[reverseOffset + k] = x;

14 references to

Microsoft.CodeAnalysis.Razor.Workspaces (14)

TextDifferencing\TextDiffer.cs (14)

145(k != forwardK + d && vf[forwardOffset + k - 1] < vf[forwardOffset + k + 1])) 148x = vf[forwardOffset + k + 1]; 153x = vf[forwardOffset + k - 1] + 1; 172if (vr[reverseOffset + k] <= vf[forwardOffset + k]) // If the path overlaps the furthest reaching reverse (D − 1)-path in diagonal k Then 175x = vf[forwardOffset + k]; 188(k != reverseK - d && vr[reverseOffset + k - 1] < vr[reverseOffset + k + 1] - 1)) 191x = vr[reverseOffset + k - 1]; 196x = vr[reverseOffset + k + 1] - 1; 215if (vr[reverseOffset + k] <= vf[forwardOffset + k]) // If the path overlaps the furthest reaching forward D-path in diagonal k+∆ Then 218x = vf[forwardOffset + k];