diff options
author | Alfonso Eusebio <alfonso_eusebio@yahoo.co.uk> | 2011-02-06 17:58:59 +0000 |
---|---|---|
committer | Kohei Yoshida <kyoshida@novell.com> | 2011-02-08 21:02:19 -0500 |
commit | 4a928babb5dbcff831be05503e5793ebed4217bb (patch) | |
tree | 5a51d232c4d502d962a3d5d7f05bc6447646734c /sc/source/core/data/compressedarray.cxx | |
parent | 223d92f2add27f7d8d658b51b0bfa9417d6c9418 (diff) |
Removed unused functions and classes form calc 3last
Removed unused function and some entire classes from calc.
The functions removed are some of those identified by call-catcher.
Diffstat (limited to 'sc/source/core/data/compressedarray.cxx')
-rw-r--r-- | sc/source/core/data/compressedarray.cxx | 58 |
1 files changed, 0 insertions, 58 deletions
diff --git a/sc/source/core/data/compressedarray.cxx b/sc/source/core/data/compressedarray.cxx index 622eae148aa8..f48d17c924ca 100644 --- a/sc/source/core/data/compressedarray.cxx +++ b/sc/source/core/data/compressedarray.cxx @@ -334,63 +334,6 @@ void ScCompressedArray<A,D>::Remove( A nStart, size_t nAccessCount ) pData[nCount-1].nEnd = nMaxAccess; } -// === ScSummableCompressedArray ============================================= - -template< typename A, typename D > -unsigned long ScSummableCompressedArray<A,D>::SumValues( A nStart, A nEnd ) const -{ - size_t nIndex = Search( nStart); - unsigned long nSum = SumValuesContinuation( nStart, nEnd, nIndex); - if (nEnd > this->nMaxAccess) - nSum += this->pData[this->nCount-1].aValue * (nEnd - this->nMaxAccess); - return nSum; -} - - -template< typename A, typename D > -unsigned long ScSummableCompressedArray<A,D>::SumValuesContinuation( - A nStart, A nEnd, size_t& nIndex ) const -{ - unsigned long nSum = 0; - A nS = nStart; - while (nIndex < this->nCount && nS <= nEnd) - { - A nE = ::std::min( this->pData[nIndex].nEnd, nEnd); - // FIXME: test for overflow in a single region? - unsigned long nNew = (unsigned long) this->pData[nIndex].aValue * (nE - nS + 1); - nSum += nNew; - if (nSum < nNew) - return ::std::numeric_limits<unsigned long>::max(); - nS = nE + 1; - if (nS <= nEnd) - ++nIndex; - } - return nSum; -} - - -template< typename A, typename D > -unsigned long ScSummableCompressedArray<A,D>::SumScaledValuesContinuation( - A nStart, A nEnd, size_t& nIndex, double fScale ) const -{ - unsigned long nSum = 0; - A nS = nStart; - while (nIndex < this->nCount && nS <= nEnd) - { - A nE = ::std::min( this->pData[nIndex].nEnd, nEnd); - unsigned long nScaledVal = (unsigned long) (this->pData[nIndex].aValue * fScale); - // FIXME: test for overflow in a single region? - unsigned long nNew = nScaledVal * (nE - nS + 1); - nSum += nNew; - if (nSum < nNew) - return ::std::numeric_limits<unsigned long>::max(); - nS = nE + 1; - if (nS <= nEnd) - ++nIndex; - } - return nSum; -} - // === ScBitMaskCompressedArray ============================================== @@ -544,7 +487,6 @@ void ScCompressedArrayIterator<A,D>::Follow( // === Force instantiation of specializations ================================ template class ScCompressedArray< SCROW, USHORT>; // heights, base class -template class ScSummableCompressedArray< SCROW, USHORT>; // heights template class ScCompressedArray< SCROW, BYTE>; // flags, base class template class ScBitMaskCompressedArray< SCROW, BYTE>; // flags template void ScCompressedArrayIterator< SCROW, USHORT>::Follow( |