mir/libreoffice
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Some cppcheck cleaning

Browse Source
This commit is contained in:
Julien Nabet
2011-08-30 23:11:44 +02:00
parent 8bf6023025
commit 01a87c102f
5 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
l10ntools/source/help/HelpLinker.cxx
View File

@@ -735,7 +735,7 @@ void HelpLinker::main( std::vector<std::string> &args,
bExtensionMode = false; bExtensionMode = false;
helpFiles.clear(); helpFiles.clear();
if (args.size() > 0 && args[0][0] == '@') if ((!args.empty()) && args[0][0] == '@')
{ {
std::vector<std::string> stringList; std::vector<std::string> stringList;
std::string strBuf; std::string strBuf;

2
oox/source/drawingml/fillproperties.cxx
View File

@@ -270,7 +270,7 @@ void FillProperties::pushToPropMap( ShapePropertyMap& rPropMap,
GradientFillProperties::GradientStopMap::const_iterator aIt = maGradientProps.maGradientStops.begin(); GradientFillProperties::GradientStopMap::const_iterator aIt = maGradientProps.maGradientStops.begin();
// Try to find the axial median // Try to find the axial median
for(size_t i=0;i<nColorCount;i+=3) for(size_t i=0;i<nColorCount;i+=3)
aIt++; ++aIt;
// API StartColor is inner color in axial gradient // API StartColor is inner color in axial gradient
// aIt->second.hasColor() kind would be better than Color != API_RGB_WHITE // aIt->second.hasColor() kind would be better than Color != API_RGB_WHITE
if( aGradient.StartColor == aGradient.EndColor && if( aGradient.StartColor == aGradient.EndColor &&

2
package/source/zippackage/ZipPackage.cxx
View File

@@ -1058,7 +1058,7 @@ void ZipPackage::WriteManifest( ZipOutputStream& aZipOut, const vector< uno::Seq
sal_Int32 nInd = 0; sal_Int32 nInd = 0;
for ( vector < uno::Sequence < PropertyValue > >::const_iterator aIter = aManList.begin(), aEnd = aManList.end(); for ( vector < uno::Sequence < PropertyValue > >::const_iterator aIter = aManList.begin(), aEnd = aManList.end();
aIter != aEnd; aIter != aEnd;
aIter++, nInd++ ) ++aIter, ++nInd )
{ {
aManifestSequence[nInd] = ( *aIter ); aManifestSequence[nInd] = ( *aIter );
} }

2
svx/source/svdraw/svdpage.cxx
View File

@@ -1351,7 +1351,7 @@ SdrPage::~SdrPage()
// of page users. Therefore we have to use a copy of the list for the // of page users. Therefore we have to use a copy of the list for the
// iteration. // iteration.
::sdr::PageUserVector aListCopy (maPageUsers.begin(), maPageUsers.end()); ::sdr::PageUserVector aListCopy (maPageUsers.begin(), maPageUsers.end());
for(::sdr::PageUserVector::iterator aIterator = aListCopy.begin(); aIterator != aListCopy.end(); aIterator++) for(::sdr::PageUserVector::iterator aIterator = aListCopy.begin(); aIterator != aListCopy.end(); ++aIterator)
{ {
sdr::PageUser* pPageUser = *aIterator; sdr::PageUser* pPageUser = *aIterator;
DBG_ASSERT(pPageUser, "SdrPage::~SdrPage: corrupt PageUser list (!)"); DBG_ASSERT(pPageUser, "SdrPage::~SdrPage: corrupt PageUser list (!)");

2
sw/source/filter/ww8/ww8scan.cxx
View File

@@ -6617,7 +6617,7 @@ bool WW8PLCF_HdFt::GetTextPos(sal_uInt8 grpfIhdt, sal_uInt8 nWhich, WW8_CP& rSta
aPLCF.SetIdx( nIdx ); // Lookup suitable CP aPLCF.SetIdx( nIdx ); // Lookup suitable CP
aPLCF.Get( rStart, nEnd, pData ); aPLCF.Get( rStart, nEnd, pData );
rLen = nEnd - rStart; rLen = nEnd - rStart;
aPLCF++; ++aPLCF;
return true; return true;
} }