Lines Matching refs:nCount
35 : nCount(1) in ScCompressedArray()
49 : nCount(0) in ScCompressedArray()
60 pData[nCount].aValue = aValue; in ScCompressedArray()
61 pData[nCount].nEnd = j-1; in ScCompressedArray()
62 ++nCount; in ScCompressedArray()
66 pData[nCount].aValue = aValue; in ScCompressedArray()
67 pData[nCount].nEnd = nMaxAccess; in ScCompressedArray()
68 ++nCount; in ScCompressedArray()
69 Resize( nCount); in ScCompressedArray()
83 if ((nCount <= nNewLimit && nNewLimit < nLimit) || nLimit < nNewLimit) in Resize()
87 memcpy( pNewData, pData, nCount*sizeof(DataEntry)); in Resize()
101 long nHi = static_cast<long>(nCount) - 1; in Search()
105 bool bFound = (nCount == 1); in Search()
122 return (bFound ? static_cast<size_t>(i) : (nAccess < 0 ? 0 : nCount-1)); in Search()
139 size_t nNeeded = nCount + 2; in SetValue()
146 memcpy( pNewData, pData, nCount*sizeof(DataEntry)); in SetValue()
188 while (nj < nCount && pData[nj].nEnd <= nEnd) in SetValue()
192 if (nj < nCount && pData[nj].aValue == aNewVal) in SetValue()
222 (nCount - nj) * sizeof(DataEntry)); in SetValue()
223 nCount -= nj - ni; in SetValue()
229 if (nInsert <= nCount) in SetValue()
233 (nCount - nInsert) * sizeof(DataEntry)); in SetValue()
237 (nCount - nInsert) * sizeof(DataEntry)); in SetValue()
239 nCount++; in SetValue()
246 nCount++; in SetValue()
289 nCount = nIndex + 1; // discard trailing entries in Insert()
291 } while (++nIndex < nCount); in Insert()
306 pData[nIndex].nEnd == nEnd && nIndex < nCount-1) in Remove()
320 memmove( pData + nIndex, pData + nIndex + nRemove, (nCount - (nIndex + in Remove()
322 nCount -= nRemove; in Remove()
328 } while (++nIndex < nCount); in Remove()
329 pData[nCount-1].nEnd = nMaxAccess; in Remove()
337 size_t nIndex = nCount-1; in GetLastUnequalAccess()
369 nSum += this->pData[this->nCount-1].aValue * (nEnd - this->nMaxAccess); in SumValues()
380 while (nIndex < this->nCount && nS <= nEnd) in SumValuesContinuation()
402 while (nIndex < this->nCount && nS <= nEnd) in SumScaledValuesContinuation()
444 } while (nIndex < this->nCount); in AndValue()
471 } while (nIndex < this->nCount); in OrValue()
546 while (nIndex < this->nCount && (this->pData[nIndex].aValue & rBitMask) == in GetBitStateEnd()
571 } while (nIndex < this->nCount); in GetFirstForCondition()
616 } while (nIndex < this->nCount); in CountForCondition()
628 while (nIndex < this->nCount && nUsed < nArraySize) in FillArrayForCondition()
657 } while (nIndex < this->nCount); in HasCondition()
679 } while (nIndex < this->nCount); in CountForAnyBitCondition()
689 size_t nIndex = this->nCount-1; in GetLastAnyBitAccess()
738 } while (nIndex1 < this->nCount && nS <= nEnd); in SumCoupledArrayForCondition()
772 } while (nIndex1 < this->nCount && nS <= nEnd); in SumScaledCoupledArrayForCondition()