public List <DiffResultSpan> DiffReport()
{
List <DiffResultSpan> retval = new List <DiffResultSpan>();
int dcount = this._dest.Count();
int scount = this._source.Count();
//Deal with the special case of empty files
if (dcount == 0)
{
if (scount > 0)
{
retval.Add(DiffResultSpan.CreateDeleteSource(0, scount));
}
return(retval);
}
else
{
if (scount == 0)
{
retval.Add(DiffResultSpan.CreateAddDestination(0, dcount));
return(retval);
}
}
this._matchList.Sort();
int curDest = 0;
int curSource = 0;
DiffResultSpan last = null;
//Process each match record
foreach (DiffResultSpan drs in this._matchList)
{
if ((!this.AddChanges(retval, curDest, drs.DestIndex, curSource, drs.SourceIndex)) && (last != null))
{
last.AddLength(drs.Length);
}
else
{
retval.Add(drs);
}
curDest = drs.DestIndex + drs.Length;
curSource = drs.SourceIndex + drs.Length;
last = drs;
}
//Process any tail end data
this.AddChanges(retval, curDest, dcount, curSource, scount);
return(retval);
}
private bool AddChanges(List <DiffResultSpan> report, int curDest, int nextDest, int curSource, int nextSource)
{
bool retval = false;
int diffDest = nextDest - curDest;
int diffSource = nextSource - curSource;
int minDiff = 0;
if (diffDest > 0)
{
if (diffSource > 0)
{
minDiff = Math.Min(diffDest, diffSource);
report.Add(DiffResultSpan.CreateReplace(curDest, curSource, minDiff));
if (diffDest > diffSource)
{
curDest += minDiff;
report.Add(DiffResultSpan.CreateAddDestination(curDest, diffDest - diffSource));
}
else
{
if (diffSource > diffDest)
{
curSource += minDiff;
report.Add(DiffResultSpan.CreateDeleteSource(curSource, diffSource - diffDest));
}
}
}
else
{
report.Add(DiffResultSpan.CreateAddDestination(curDest, diffDest));
}
retval = true;
}
else
{
if (diffSource > 0)
{
report.Add(DiffResultSpan.CreateDeleteSource(curSource, diffSource));
retval = true;
}
}
return(retval);
}
private void ProcessRange(int destStart, int destEnd, int sourceStart, int sourceEnd)
{
int curBestIndex = -1;
int curBestLength = -1;
int maxPossibleDestLength = 0;
DiffState curItem = null;
DiffState bestItem = null;
for (int destIndex = destStart; destIndex <= destEnd; destIndex++)
{
maxPossibleDestLength = (destEnd - destIndex) + 1;
if (maxPossibleDestLength <= curBestLength)
{
//we won't find a longer one even if we looked
break;
}
curItem = this._stateList.GetByIndex(destIndex);
if (!curItem.HasValidLength(sourceStart, sourceEnd, maxPossibleDestLength))
{
//recalc new best length since it isn't valid or has never been done.
this.GetLongestSourceMatch(curItem, destIndex, destEnd, sourceStart, sourceEnd);
}
if (curItem.Status == DiffStatus.Matched)
{
switch (this._level)
{
case DiffEngineLevel.FastImperfect:
if (curItem.Length > curBestLength)
{
//this is longest match so far
curBestIndex = destIndex;
curBestLength = curItem.Length;
bestItem = curItem;
}
//Jump over the match
destIndex += curItem.Length - 1;
break;
case DiffEngineLevel.Medium:
if (curItem.Length > curBestLength)
{
//this is longest match so far
curBestIndex = destIndex;
curBestLength = curItem.Length;
bestItem = curItem;
//Jump over the match
destIndex += curItem.Length - 1;
}
break;
default:
if (curItem.Length > curBestLength)
{
//this is longest match so far
curBestIndex = destIndex;
curBestLength = curItem.Length;
bestItem = curItem;
}
break;
}
}
}
if (curBestIndex < 0)
{
//we are done - there are no matches in this span
}
else
{
int sourceIndex = bestItem.StartIndex;
this._matchList.Add(DiffResultSpan.CreateNoChange(curBestIndex, sourceIndex, curBestLength));
if (destStart < curBestIndex)
{
//Still have more lower destination data
if (sourceStart < sourceIndex)
{
//Still have more lower source data
// Recursive call to process lower indexes
this.ProcessRange(destStart, curBestIndex - 1, sourceStart, sourceIndex - 1);
}
}
int upperDestStart = curBestIndex + curBestLength;
int upperSourceStart = sourceIndex + curBestLength;
if (destEnd >= upperDestStart)
{
//we still have more upper dest data
if (sourceEnd > upperSourceStart - 1)
{
//set still have more upper source data
// Recursive call to process upper indexes
this.ProcessRange(upperDestStart, destEnd, upperSourceStart, sourceEnd);
}
}
}
}