// ------------------------------------------------------------------
// Retrieve list of dtrs from range.
//
// dcpNew - Distance from the beginning of TextContainer after all
// tree changes.
// cchOld - Number of characters in the range, but before any
// tree changes.
//
// Returns: List of DRTs for specified range.
// ------------------------------------------------------------------
internal DtrList DtrsFromRange(int dcpNew, int cchOld)
{
DtrList dtrs = null;
int i = 0;
int first, last;
int positionsAdded = 0;
// Find the first dtr intersecting with the specified range.
// Since DTRs store dcp before any changes, during iteration
// accumulate positionsAdded (number of characters added to the tree
// up to the current point).
while (i < _count)
{
if (dcpNew <= _dtrs[i].StartIndex + positionsAdded + _dtrs[i].PositionsAdded)
{
break;
}
positionsAdded += _dtrs[i].PositionsAdded - _dtrs[i].PositionsRemoved;
++i;
}
first = i;
// Find the last dtr intersecting with the specified range.
// dcpNew-positionsAdded points to position before any tree changes, from
// where we start counting cchOld.
// Do not add characters (positionsAdded), since start position has been already found.
while (i < _count)
{
if (dcpNew - positionsAdded + cchOld <= _dtrs[i].StartIndex + _dtrs[i].PositionsRemoved)
{
// If there is no intersection with the current DTR, go to the previous one.
if (dcpNew - positionsAdded + cchOld < _dtrs[i].StartIndex)
{
--i;
}
break;
}
++i;
}
last = (i < _count) ? i : _count - 1;
// If there are DTRs in the specified range, create new DtrList object
if (last >= first)
{
dtrs = new DtrList();
while (last >= first)
{
// Since dcpNew is after tree changes, add positionsAdded to all dtrs
// to build dtr list relative to dcpNew position.
DirtyTextRange dtr = _dtrs[first];
dtr.StartIndex += positionsAdded;
dtrs.Append(dtr);
++first;
}
}
return(dtrs);
}
// Token: 0x060067B4 RID: 26548 RVA: 0x001D1260 File Offset: 0x001CF460
internal DtrList DtrsFromRange(int dcpNew, int cchOld)
{
DtrList dtrList = null;
int i = 0;
int num = 0;
while (i < this._count && dcpNew > this._dtrs[i].StartIndex + num + this._dtrs[i].PositionsAdded)
{
num += this._dtrs[i].PositionsAdded - this._dtrs[i].PositionsRemoved;
i++;
}
int num2 = i;
while (i < this._count)
{
if (dcpNew - num + cchOld <= this._dtrs[i].StartIndex + this._dtrs[i].PositionsRemoved)
{
if (dcpNew - num + cchOld < this._dtrs[i].StartIndex)
{
i--;
break;
}
break;
}
else
{
i++;
}
}
int j = (i < this._count) ? i : (this._count - 1);
if (j >= num2)
{
dtrList = new DtrList();
while (j >= num2)
{
DirtyTextRange dtr = this._dtrs[num2];
dtr.StartIndex += num;
dtrList.Append(dtr);
num2++;
}
}
return(dtrList);
}
// ------------------------------------------------------------------
// Retrieve list of dtrs from range.
//
// dcpNew - Distance from the beginning of TextContainer after all
// tree changes.
// cchOld - Number of characters in the range, but before any
// tree changes.
//
// Returns: List of DRTs for specified range.
// ------------------------------------------------------------------
internal DtrList DtrsFromRange(int dcpNew, int cchOld)
{
DtrList dtrs = null;
int i = 0;
int first, last;
int positionsAdded = 0;
// Find the first dtr intersecting with the specified range.
// Since DTRs store dcp before any changes, during iteration
// accumulate positionsAdded (number of characters added to the tree
// up to the current point).
while (i < _count)
{
if (dcpNew <= _dtrs[i].StartIndex + positionsAdded + _dtrs[i].PositionsAdded)
{
break;
}
positionsAdded += _dtrs[i].PositionsAdded - _dtrs[i].PositionsRemoved;
++i;
}
first = i;
// Find the last dtr intersecting with the specified range.
// dcpNew-positionsAdded points to position before any tree changes, from
// where we start counting cchOld.
// Do not add characters (positionsAdded), since start position has been already found.
while (i < _count)
{
if (dcpNew - positionsAdded + cchOld <= _dtrs[i].StartIndex + _dtrs[i].PositionsRemoved)
{
// If there is no intersection with the current DTR, go to the previous one.
if (dcpNew - positionsAdded + cchOld < _dtrs[i].StartIndex)
{
--i;
}
break;
}
++i;
}
last = (i < _count) ? i : _count-1;
// If there are DTRs in the specified range, create new DtrList object
if (last >= first)
{
dtrs = new DtrList();
while (last >= first)
{
// Since dcpNew is after tree changes, add positionsAdded to all dtrs
// to build dtr list relative to dcpNew position.
DirtyTextRange dtr = _dtrs[first];
dtr.StartIndex += positionsAdded;
dtrs.Append(dtr);
++first;
}
}
return dtrs;
}