summaryrefslogtreecommitdiff
path: root/editeng/source/misc
diff options
context:
space:
mode:
authorStephan Bergmann <sbergman@redhat.com>2017-03-07 19:50:17 +0100
committerStephan Bergmann <sbergman@redhat.com>2017-03-07 19:50:51 +0100
commite46c717b0b8cd9be060b31debb54ba82ac7e5b9d (patch)
tree3ee452dc303809fa8e1b1ea91c8a090e6d3ebcdf /editeng/source/misc
parent43b13117c0adf303cd3578bf268b4ac8feb04f6b (diff)
loplugin:loopvartoosmall
Change-Id: I7c962d91f5c54fa188594174c14ab1d0b1bc6963
Diffstat (limited to 'editeng/source/misc')
-rw-r--r--editeng/source/misc/svxacorr.cxx4
-rw-r--r--editeng/source/misc/txtrange.cxx12
2 files changed, 8 insertions, 8 deletions
diff --git a/editeng/source/misc/svxacorr.cxx b/editeng/source/misc/svxacorr.cxx
index dbf222d004a3..893f812baccd 100644
--- a/editeng/source/misc/svxacorr.cxx
+++ b/editeng/source/misc/svxacorr.cxx
@@ -1822,12 +1822,12 @@ static bool lcl_FindAbbreviation(const SvStringsISortDtor* pList, const OUString
{
OUString sAbk('~');
SvStringsISortDtor::const_iterator it = pList->find( sAbk );
- sal_uInt16 nPos = it - pList->begin();
+ SvStringsISortDtor::size_type nPos = it - pList->begin();
if( nPos < pList->size() )
{
OUString sLowerWord(sWord.toAsciiLowerCase());
OUString sAbr;
- for( sal_uInt16 n = nPos;
+ for( SvStringsISortDtor::size_type n = nPos;
n < pList->size() &&
'~' == ( sAbr = (*pList)[ n ])[ 0 ];
++n )
diff --git a/editeng/source/misc/txtrange.cxx b/editeng/source/misc/txtrange.cxx
index 10bcbe5e63b7..afa88b53cbe9 100644
--- a/editeng/source/misc/txtrange.cxx
+++ b/editeng/source/misc/txtrange.cxx
@@ -495,13 +495,13 @@ void SvxBoundArgs::Concat( const tools::PolyPolygon* pPoly )
aBoolArr.clear();
bInner = false;
Calc( *pPoly ); // Note that this updates pLongArr, which is why we swapped it out earlier.
- sal_uInt16 nCount = pLongArr->size();
- sal_uInt16 nIdx = 0;
- sal_uInt16 i = 0;
+ std::deque<long>::size_type nCount = pLongArr->size();
+ std::deque<long>::size_type nIdx = 0;
+ std::deque<long>::size_type i = 0;
bool bSubtract = pTextRanger->IsInner();
while( i < nCount )
{
- sal_uLong nOldCount = pOld->size();
+ std::deque<long>::size_type nOldCount = pOld->size();
if( nIdx == nOldCount )
{ // Reached the end of the old Array...
if( !bSubtract )
@@ -510,7 +510,7 @@ void SvxBoundArgs::Concat( const tools::PolyPolygon* pPoly )
}
long nLeft = (*pLongArr)[ i++ ];
long nRight = (*pLongArr)[ i++ ];
- sal_uInt16 nLeftPos = nIdx + 1;
+ std::deque<long>::size_type nLeftPos = nIdx + 1;
while( nLeftPos < nOldCount && nLeft > (*pOld)[ nLeftPos ] )
nLeftPos += 2;
if( nLeftPos >= nOldCount )
@@ -519,7 +519,7 @@ void SvxBoundArgs::Concat( const tools::PolyPolygon* pPoly )
pOld->insert( pOld->begin() + nOldCount, pLongArr->begin() + i - 2, pLongArr->end() );
break;
}
- sal_uInt16 nRightPos = nLeftPos - 1;
+ std::deque<long>::size_type nRightPos = nLeftPos - 1;
while( nRightPos < nOldCount && nRight >= (*pOld)[ nRightPos ] )
nRightPos += 2;
if( nRightPos < nLeftPos )