Lines Matching refs:nStart
102 long nStart = 0; in Search() local
110 nStart = (long) pData[i - 1].nEnd; in Search()
112 nStart = -1; in Search()
117 if (nStart >= (long) nAccess) in Search()
127 void ScCompressedArray<A,D>::SetValue( A nStart, A nEnd, const D& rValue ) in SetValue() argument
129 if (0 <= nStart && nStart <= nMaxAccess && 0 <= nEnd && nEnd <= nMaxAccess in SetValue()
130 && nStart <= nEnd) in SetValue()
132 if ((nStart == 0) && (nEnd == nMaxAccess)) in SetValue()
155 if (nStart > 0) in SetValue()
158 ni = Search( nStart); in SetValue()
163 if (ni == 0 || (pData[ni-1].nEnd < nStart - 1)) in SetValue()
171 else if (ni > 0 && pData[ni-1].nEnd == nStart - 1) in SetValue()
202 pData[ni-1].nEnd = nStart - 1; // shrink in SetValue()
208 pData[ni-1].nEnd = nStart - 1; // shrink in SetValue()
243 pData[nInsert-1].nEnd = nStart - 1; in SetValue()
254 void ScCompressedArray<A,D>::CopyFrom( const ScCompressedArray<A,D>& rArray, A nStart, in CopyFrom() argument
259 for (A j=nStart; j<=nEnd; ++j) in CopyFrom()
261 const D& rValue = (j==nStart ? in CopyFrom()
274 const D& ScCompressedArray<A,D>::Insert( A nStart, size_t nAccessCount ) in Insert() argument
276 size_t nIndex = Search( nStart); in Insert()
280 if (nIndex > 0 && pData[nIndex-1].nEnd+1 == nStart) in Insert()
297 void ScCompressedArray<A,D>::Remove( A nStart, size_t nAccessCount ) in Remove() argument
299 A nEnd = nStart + nAccessCount - 1; in Remove()
300 size_t nIndex = Search( nStart); 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()
334 A ScCompressedArray<A,D>::GetLastUnequalAccess( A nStart, const D& rCompare ) in GetLastUnequalAccess() argument
350 if (pData[nIndex].nEnd < nStart) in GetLastUnequalAccess()
364 unsigned long ScSummableCompressedArray<A,D>::SumValues( A nStart, A nEnd ) const in SumValues() argument
366 size_t nIndex = this->Search( nStart); in SumValues()
367 unsigned long nSum = SumValuesContinuation( nStart, nEnd, nIndex); in SumValues()
376 A nStart, A nEnd, size_t& nIndex ) const in SumValuesContinuation() argument
379 A nS = nStart; in SumValuesContinuation()
398 A nStart, A nEnd, size_t& nIndex, double fScale ) const in SumScaledValuesContinuation() argument
401 A nS = nStart; in SumScaledValuesContinuation()
422 void ScBitMaskCompressedArray<A,D>::AndValue( A nStart, A nEnd, in AndValue() argument
425 if (nStart > nEnd) in AndValue()
428 size_t nIndex = this->Search( nStart); in AndValue()
433 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in AndValue()
449 void ScBitMaskCompressedArray<A,D>::OrValue( A nStart, A nEnd, in OrValue() argument
452 if (nStart > nEnd) in OrValue()
455 size_t nIndex = this->Search( nStart); in OrValue()
460 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in OrValue()
477 const ScBitMaskCompressedArray<A,D>& rArray, A nStart, A nEnd, in CopyFromAnded() argument
482 for (A j=nStart; j<=nEnd; ++j) in CopyFromAnded()
484 const D& rValue = (j==nStart ? in CopyFromAnded()
498 const ScBitMaskCompressedArray<A,D>& rArray, A nStart, A nEnd, in CopyFromOred() argument
503 for (A j=nStart; j<=nEnd; ++j) in CopyFromOred()
505 const D& rValue = (j==nStart ? in CopyFromOred()
521 A nStart = ::std::numeric_limits<A>::max(); in GetBitStateStart() local
528 nStart = this->pData[nIndex].nEnd + 1; in GetBitStateStart()
532 nStart = 0; in GetBitStateStart()
536 return nStart; in GetBitStateStart()
541 A ScBitMaskCompressedArray<A,D>::GetBitStateEnd( A nStart, in GetBitStateEnd() argument
545 size_t nIndex = this->Search( nStart); in GetBitStateEnd()
557 A ScBitMaskCompressedArray<A,D>::GetFirstForCondition( A nStart, A nEnd, in GetFirstForCondition() argument
560 size_t nIndex = this->Search( nStart); in GetFirstForCondition()
566 return ::std::max( nFound, nStart); in GetFirstForCondition()
577 A ScBitMaskCompressedArray<A,D>::GetLastForCondition( A nStart, A nEnd, in GetLastForCondition() argument
589 if (this->pData[nIndex].nEnd < nStart) in GetLastForCondition()
600 A ScBitMaskCompressedArray<A,D>::CountForCondition( A nStart, A nEnd, in CountForCondition() argument
604 size_t nIndex = this->Search( nStart); in CountForCondition()
609 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in CountForCondition()
622 size_t ScBitMaskCompressedArray<A,D>::FillArrayForCondition( A nStart, A nEnd, in FillArrayForCondition() argument
627 size_t nIndex = this->Search( nStart); in FillArrayForCondition()
632 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in FillArrayForCondition()
646 bool ScBitMaskCompressedArray<A,D>::HasCondition( A nStart, A nEnd, in HasCondition() argument
649 size_t nIndex = this->Search( nStart); in HasCondition()
663 A ScBitMaskCompressedArray<A,D>::CountForAnyBitCondition( A nStart, A nEnd, in CountForAnyBitCondition() argument
667 size_t nIndex = this->Search( nStart); in CountForAnyBitCondition()
672 A nS = ::std::max( (nIndex>0 ? this->pData[nIndex-1].nEnd+1 : 0), nStart); in CountForAnyBitCondition()
685 A ScBitMaskCompressedArray<A,D>::GetLastAnyBitAccess( A nStart, in GetLastAnyBitAccess() argument
702 if (this->pData[nIndex].nEnd < nStart) in GetLastAnyBitAccess()
716 A nStart, A nEnd, const D& rBitMask, const D& rMaskedCompare, in SumCoupledArrayForCondition() argument
720 A nS = nStart; in SumCoupledArrayForCondition()
721 size_t nIndex1 = this->Search( nStart); in SumCoupledArrayForCondition()
722 size_t nIndex2 = rArray.Search( nStart); in SumCoupledArrayForCondition()
750 A nStart, A nEnd, const D& rBitMask, const D& rMaskedCompare, in SumScaledCoupledArrayForCondition() argument
754 A nS = nStart; in SumScaledCoupledArrayForCondition()
755 size_t nIndex1 = this->Search( nStart); in SumScaledCoupledArrayForCondition()
756 size_t nIndex2 = rArray.Search( nStart); in SumScaledCoupledArrayForCondition()
811 const ScBitMaskCompressedArray<A,D> & rArray1, A nStart, A nEnd, in ScCoupledCompressedArrayIterator() argument
814 : aIter1( rArray1, nStart, nEnd ) in ScCoupledCompressedArrayIterator()
815 , aIter2( rArray2, nStart, nEnd ) in ScCoupledCompressedArrayIterator()
839 void ScCoupledCompressedArrayIterator<A,D,S>::NewLimits( A nStart, A nEnd ) in NewLimits() argument
841 aIter1.NewLimits( nStart, nEnd); in NewLimits()
842 aIter2.NewLimits( nStart, nEnd); in NewLimits()