Index: sc/source/ui/unoobj/chart2uno.cxx =================================================================== --- sc/source/ui/unoobj/chart2uno.cxx (revision 1515688) +++ sc/source/ui/unoobj/chart2uno.cxx (working copy) @@ -2534,6 +2534,17 @@ SCCOL nLastCol = -1; SCROW nLastRow = -1; + + SCTAB nTabNum = aRange.aEnd.Tab() >= aRange.aStart.Tab() ? + aRange.aEnd.Tab() - aRange.aStart.Tab() + 1 : aRange.aStart.Tab() > aRange.aEnd.Tab() + 1; + SCCOL nColNum = aRange.aEnd.Col() >= aRange.aStart.Col() ? + aRange.aEnd.Col() - aRange.aStart.Col() + 1 : aRange.aStart.Col() > aRange.aEnd.Col() + 1; + SCROW nRowNum = aRange.aEnd.Row() >= aRange.aStart.Row() ? + aRange.aEnd.Row() - aRange.aStart.Row() + 1 : aRange.aStart.Row() > aRange.aEnd.Row() + 1; + sal_uInt32 nCellNum = nRowNum * nColNum * nTabNum; + sal_uInt32 nStep = nCellNum >= 20000 ? 5 : 1; + sal_uInt32 nCount = 0; + for (SCTAB nTab = aRange.aStart.Tab(); nTab <= aRange.aEnd.Tab(); ++nTab) { for (SCCOL nCol = aRange.aStart.Col(); nCol <= aRange.aEnd.Col(); ++nCol) @@ -2553,7 +2564,16 @@ continue; } + if (nCount == nStep) + nCount = 0; + else if (nCount != 0) + { + nCount++; + continue; + } + m_aDataArray.push_back(Item()); + nCount++; Item& rItem = m_aDataArray.back(); ++nDataCount; @@ -2563,6 +2583,7 @@ continue; if (pCell->HasStringData()) + rItem.maString = pCell->GetStringData(); else { @@ -3018,51 +3039,12 @@ ::rtl::math::setNan(&fNAN); sal_Int32 nCount = m_aDataArray.size(); - // i121058: if there's too many points need to be painted, it doens't need to get all points for performance consideration - // and so many points are not useful for users to understand the chart. So only picked some points to paint - sal_Int32 nStep = nCount >= 10000 ? 50 : 1; - nCount = nCount >= 10000 ? ((nCount - nCount % nStep) / nStep) : nCount; - sal_Int32 nRealCount = nStep == 1 ? nCount : nCount * 2; - uno::Sequence aSeq(nRealCount); - double* pArr = aSeq.getArray(); - ::std::list::const_iterator itr = m_aDataArray.begin(), itrEnd = m_aDataArray.end(); - for (sal_Int32 i = 0; i < nCount; i++) - { - if (nStep == 1) - { - *pArr++ = itr->mbIsValue ? itr->mfValue : fNAN; - itr++; - } - else - { - sal_Int32 nMax = 0, nMin = 0, nMaxStep = 0, nMinStep = 0; - for (sal_Int32 j = 0; j < nStep; j++) - { - sal_Int32 nValue = itr->mbIsValue ? itr->mfValue : fNAN; - if (nValue > nMax) - { - nMax = nValue; - nMaxStep = j; - } - if (nValue < nMin) - { - nMin = nValue; - nMinStep = j; - } - itr++; - } - if (nMaxStep > nMinStep) - { - *pArr++ = nMin; - *pArr++ = nMax; - } - else - { - *pArr++ = nMax; - *pArr++ = nMin; - } - } - } + uno::Sequence aSeq(nCount); + double* pArr = aSeq.getArray(); + ::std::list::const_iterator itr = m_aDataArray.begin(), itrEnd = m_aDataArray.end(); + for (; itr != itrEnd; ++itr, ++pArr) + *pArr = itr->mbIsValue ? itr->mfValue : fNAN; + return aSeq; }