39     , nMaxAccess( nMaxAccessP)  in ScCompressedArray()
42     pData[0].nEnd = nMaxAccess;  in ScCompressedArray()
53     , nMaxAccess( nMaxAccessP)  in ScCompressedArray()
67     pData[nCount].nEnd = nMaxAccess;  in ScCompressedArray()
129     if (0 <= nStart && nStart <= nMaxAccess && 0 <= nEnd && nEnd <= nMaxAccess  in SetValue()
132         if ((nStart == 0) && (nEnd == nMaxAccess))  in SetValue()
160                 nInsert = nMaxAccess+1;  in SetValue()
177                     nInsert = nMaxAccess+1;  in SetValue()
204                     nInsert = nMaxAccess+1;  in SetValue()
217                     nInsert = nMaxAccess+1;  in SetValue()
227             if (nInsert < static_cast<size_t>(nMaxAccess+1))  in SetValue()
286         if (pData[nIndex].nEnd >= nMaxAccess)  in Insert()
288             pData[nIndex].nEnd = nMaxAccess;  in Insert()
329     pData[nCount-1].nEnd = nMaxAccess;  in Remove()
368     if (nEnd > this->nMaxAccess)  in SumValues()
369         nSum += this->pData[this->nCount-1].aValue * (nEnd - this->nMaxAccess);  in SumValues()
739     if (nEnd > this->nMaxAccess &&  in SumCoupledArrayForCondition()
742                 this->nMaxAccess);  in SumCoupledArrayForCondition()
773     if (nEnd > this->nMaxAccess &&  in SumScaledCoupledArrayForCondition()
777             (nEnd - this->nMaxAccess);  in SumScaledCoupledArrayForCondition()