Lines Matching refs:pData
38 , pData( new DataEntry[1]) in ScCompressedArray()
41 pData[0].aValue = rValue; in ScCompressedArray()
42 pData[0].nEnd = nMaxAccess; in ScCompressedArray()
52 , pData( new DataEntry[nDataCount]) in ScCompressedArray()
60 pData[nCount].aValue = aValue; in ScCompressedArray()
61 pData[nCount].nEnd = j-1; in ScCompressedArray()
66 pData[nCount].aValue = aValue; in ScCompressedArray()
67 pData[nCount].nEnd = nMaxAccess; in ScCompressedArray()
76 delete[] pData; in ~ScCompressedArray()
87 memcpy( pNewData, pData, nCount*sizeof(DataEntry)); in Resize()
88 delete[] pData; in Resize()
89 pData = pNewData; in Resize()
110 nStart = (long) pData[i - 1].nEnd; in Search()
113 nEnd = (long) pData[i].nEnd; in Search()
146 memcpy( pNewData, pData, nCount*sizeof(DataEntry)); in SetValue()
147 delete[] pData; in SetValue()
148 pData = pNewData; in SetValue()
161 if (!(pData[ni].aValue == aNewVal)) in SetValue()
163 if (ni == 0 || (pData[ni-1].nEnd < nStart - 1)) in SetValue()
166 if (pData[ni].nEnd > nEnd) in SetValue()
171 else if (ni > 0 && pData[ni-1].nEnd == nStart - 1) in SetValue()
174 if (ni > 0 && pData[ni-1].aValue == aNewVal) in SetValue()
176 pData[ni-1].nEnd = nEnd; in SetValue()
188 while (nj < nCount && pData[nj].nEnd <= nEnd) in SetValue()
192 if (nj < nCount && pData[nj].aValue == aNewVal) in SetValue()
196 if (pData[ni-1].aValue == aNewVal) in SetValue()
198 pData[ni-1].nEnd = pData[nj].nEnd; in SetValue()
202 pData[ni-1].nEnd = nStart - 1; // shrink in SetValue()
208 pData[ni-1].nEnd = nStart - 1; // shrink in SetValue()
214 pData[ni].nEnd = nEnd; in SetValue()
215 pData[ni].aValue = aNewVal; in SetValue()
221 memmove( pData + ni, pData + nj, in SetValue()
232 memmove( pData + nInsert + 1, pData + nInsert, in SetValue()
236 memmove( pData + nInsert + 2, pData + nInsert, in SetValue()
238 pData[nInsert+1] = pData[nInsert-1]; in SetValue()
243 pData[nInsert-1].nEnd = nStart - 1; in SetValue()
244 pData[nInsert].nEnd = nEnd; in SetValue()
245 pData[nInsert].aValue = aNewVal; in SetValue()
280 if (nIndex > 0 && pData[nIndex-1].nEnd+1 == nStart) in Insert()
282 const D& rValue = pData[nIndex].aValue; // the value "copied" in Insert()
285 pData[nIndex].nEnd += nAccessCount; in Insert()
286 if (pData[nIndex].nEnd >= nMaxAccess) in Insert()
288 pData[nIndex].nEnd = nMaxAccess; in Insert()
302 if (nEnd > pData[nIndex].nEnd) in Remove()
303 SetValue( nStart, nEnd, pData[nIndex].aValue); in Remove()
305 if ((nStart == 0 || (nIndex > 0 && nStart == pData[nIndex-1].nEnd+1)) && in Remove()
306 pData[nIndex].nEnd == nEnd && nIndex < nCount-1) in Remove()
313 if (nIndex > 0 && pData[nIndex-1].aValue == pData[nIndex+1].aValue) in Remove()
320 memmove( pData + nIndex, pData + nIndex + nRemove, (nCount - (nIndex + in Remove()
327 pData[nIndex].nEnd -= nAccessCount; in Remove()
329 pData[nCount-1].nEnd = nMaxAccess; in Remove()
340 if (pData[nIndex].aValue != rCompare) in GetLastUnequalAccess()
342 nEnd = pData[nIndex].nEnd; in GetLastUnequalAccess()
350 if (pData[nIndex].nEnd < nStart) in GetLastUnequalAccess()
369 nSum += this->pData[this->nCount-1].aValue * (nEnd - this->nMaxAccess); in SumValues()
382 A nE = ::std::min( this->pData[nIndex].nEnd, nEnd); in SumValuesContinuation()
384 unsigned long nNew = (unsigned long) this->pData[nIndex].aValue * (nE - nS + 1); in SumValuesContinuation()
404 A nE = ::std::min( this->pData[nIndex].nEnd, nEnd); in SumScaledValuesContinuation()
405 unsigned long nScaledVal = (unsigned long) (this->pData[nIndex].aValue * fScale); in SumScaledValuesContinuation()
431 if ((this->pData[nIndex].aValue & rValueToAnd) != this->pData[nIndex].aValue) in AndValue()
433 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in AndValue()
434 A nE = ::std::min( this->pData[nIndex].nEnd, nEnd); in AndValue()
435 this->SetValue( nS, nE, this->pData[nIndex].aValue & rValueToAnd); in AndValue()
440 else if (this->pData[nIndex].nEnd >= nEnd) in AndValue()
458 if ((this->pData[nIndex].aValue | rValueToOr) != this->pData[nIndex].aValue) in OrValue()
460 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in OrValue()
461 A nE = ::std::min( this->pData[nIndex].nEnd, nEnd); in OrValue()
462 this->SetValue( nS, nE, this->pData[nIndex].aValue | rValueToOr); in OrValue()
467 else if (this->pData[nIndex].nEnd >= nEnd) in OrValue()
523 while ((this->pData[nIndex].aValue & rBitMask) == rMaskedCompare) in GetBitStateStart()
528 nStart = this->pData[nIndex].nEnd + 1; in GetBitStateStart()
546 while (nIndex < this->nCount && (this->pData[nIndex].aValue & rBitMask) == in GetBitStateEnd()
549 nEnd = this->pData[nIndex].nEnd; in GetBitStateEnd()
563 if ((this->pData[nIndex].aValue & rBitMask) == rMaskedCompare) in GetFirstForCondition()
565 A nFound = nIndex > 0 ? this->pData[nIndex-1].nEnd + 1 : 0; in GetFirstForCondition()
568 if (this->pData[nIndex].nEnd >= nEnd) in GetFirstForCondition()
583 if ((this->pData[nIndex].aValue & rBitMask) == rMaskedCompare) in GetLastForCondition()
584 return ::std::min( this->pData[nIndex].nEnd, nEnd); in GetLastForCondition()
589 if (this->pData[nIndex].nEnd < nStart) in GetLastForCondition()
607 if ((this->pData[nIndex].aValue & rBitMask) == rMaskedCompare) in CountForCondition()
609 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in CountForCondition()
610 A nE = ::std::min( this->pData[nIndex].nEnd, nEnd); in CountForCondition()
613 if (this->pData[nIndex].nEnd >= nEnd) in CountForCondition()
630 if ((this->pData[nIndex].aValue & rBitMask) == rMaskedCompare) in FillArrayForCondition()
632 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in FillArrayForCondition()
633 A nE = ::std::min( this->pData[nIndex].nEnd, nEnd); in FillArrayForCondition()
637 if (this->pData[nIndex].nEnd >= nEnd) in FillArrayForCondition()
652 if ((this->pData[nIndex].aValue & rBitMask) == rMaskedCompare) in HasCondition()
654 if (this->pData[nIndex].nEnd >= nEnd) in HasCondition()
670 if ((this->pData[nIndex].aValue & rBitMask) != 0) in CountForAnyBitCondition()
672 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in CountForAnyBitCondition()
673 A nE = ::std::min( this->pData[nIndex].nEnd, nEnd); in CountForAnyBitCondition()
676 if (this->pData[nIndex].nEnd >= nEnd) in CountForAnyBitCondition()
692 if ((this->pData[nIndex].aValue & rBitMask) != 0) in GetLastAnyBitAccess()
694 nEnd = this->pData[nIndex].nEnd; in GetLastAnyBitAccess()
702 if (this->pData[nIndex].nEnd < nStart) in GetLastAnyBitAccess()
725 if ((this->pData[nIndex1].aValue & rBitMask) == rMaskedCompare) in SumCoupledArrayForCondition()
731 ::std::min( this->pData[nIndex1].nEnd, nEnd), nIndex2); in SumCoupledArrayForCondition()
736 nS = this->pData[nIndex1].nEnd + 1; in SumCoupledArrayForCondition()
740 (this->pData[this->GetEntryCount()-1].aValue & rBitMask) == rMaskedCompare) in SumCoupledArrayForCondition()
759 if ((this->pData[nIndex1].aValue & rBitMask) == rMaskedCompare) in SumScaledCoupledArrayForCondition()
765 ::std::min( this->pData[nIndex1].nEnd, nEnd), nIndex2, fScale); in SumScaledCoupledArrayForCondition()
770 nS = this->pData[nIndex1].nEnd + 1; in SumScaledCoupledArrayForCondition()
774 (this->pData[this->GetEntryCount()-1].aValue & rBitMask) == rMaskedCompare) in SumScaledCoupledArrayForCondition()