diff options
| author | Michael Stahl <mstahl@redhat.com> | 2012-09-20 23:59:14 +0200 |
|---|---|---|
| committer | Michael Stahl <mstahl@redhat.com> | 2012-09-21 18:05:02 +0200 |
| commit | 5f91f8a368343d8921a01edb7359cd300892f09d (patch) | |
| tree | 09ad6c21fa35d743ef1a596400011ca2a88e19a2 /sw/source/core/docnode/ndsect.cxx | |
| parent | 9cf615b68f815eb93b61cfd77232462496cdcf2a (diff) | |
fdo#48692: fix problems with large number of table cells:
The SwTableSortBoxes is now a STL container which can have more than
2^16 elements but unfortunately there are a lot of 16 bit integers used
to index it all over the place, causing infinite loops and possibly
worse problems; fix that to use size_t.
Change-Id: I868ec9dd0629be4fbe4d6b8f294fb765e3d662ec
Diffstat (limited to 'sw/source/core/docnode/ndsect.cxx')
| -rw-r--r-- | sw/source/core/docnode/ndsect.cxx | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/sw/source/core/docnode/ndsect.cxx b/sw/source/core/docnode/ndsect.cxx index 81d495a2e2ff..2197ca6d5931 100644 --- a/sw/source/core/docnode/ndsect.cxx +++ b/sw/source/core/docnode/ndsect.cxx @@ -121,7 +121,7 @@ bool lcl_IsInSameTblBox( SwNodes& _rNds, // dann suche den StartNode der Box const SwTableSortBoxes& rSortBoxes = pTblNd->GetTable().GetTabSortBoxes(); sal_uLong nIdx = _rNd.GetIndex(); - for( sal_uInt16 n = 0; n < rSortBoxes.size(); ++n ) + for (size_t n = 0; n < rSortBoxes.size(); ++n) { const SwStartNode* pNd = rSortBoxes[ n ]->GetSttNd(); if ( pNd->GetIndex() < nIdx && nIdx < pNd->EndOfSectionIndex() ) |