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

loplugin:loopvartoosmall

Browse Source 
Change-Id: Id5501599969fab5c6944a31b1fb629a3fc5f85b2
This commit is contained in:
Stephan Bergmann
2015-06-02 18:21:39 +02:00
parent 751d697db6
commit d58d9402e8
3 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
connectivity/source/drivers/evoab2/EApi.cxx
View File

@@ -111,7 +111,7 @@ static const ApiMap aClientApiMap38[] =
template<size_t N> static bool
tryLink( oslModule &aModule, const char *pName, const ApiMap (&pMap)[N])
{
for (guint i = 0; i < N; ++i)
for (size_t i = 0; i < N; ++i)
{
SymbolFunc aMethod = reinterpret_cast<SymbolFunc>(osl_getFunctionSymbol
(aModule, OUString::createFromAscii ( pMap[ i ].sym_name ).pData));

2
connectivity/source/drivers/evoab2/NStatement.cxx
View File

@@ -215,7 +215,7 @@ void OCommonStatement::orderByAnalysis( const OSQLParseNode* _pOrderByClause, So
const OSQLParseNode* pOrderList = _pOrderByClause->getByRule( OSQLParseNode::ordering_spec_commalist );
ENSURE_OR_THROW( pOrderList, "unexpected parse tree structure" );
for ( sal_uInt32 i=0; i<pOrderList->count(); ++i )
for ( size_t i=0; i<pOrderList->count(); ++i )
{
const OSQLParseNode* pOrderBy = pOrderList->getChild(i);
if ( !pOrderBy || !SQL_ISRULE( pOrderBy, ordering_spec ) )

4
connectivity/source/drivers/kab/korder.cxx
View File

@@ -56,7 +56,7 @@ KabComplexOrder::KabComplexOrder()
KabComplexOrder::~KabComplexOrder()
{
for (sal_uInt32 i = 0; i < m_aOrders.size(); i++)
for (std::vector<KabOrder *>::size_type i = 0; i < m_aOrders.size(); i++)
delete m_aOrders[i];
}
@@ -67,7 +67,7 @@ void KabComplexOrder::addOrder(KabOrder *pOrder)
sal_Int32 KabComplexOrder::compare(const ::KABC::Addressee &aAddressee1, const ::KABC::Addressee &aAddressee2) const
{
for (sal_uInt32 i = 0; i < m_aOrders.size(); i++)
for (std::vector<KabOrder *>::size_type i = 0; i < m_aOrders.size(); i++)
{
const KabOrder *pOrder = m_aOrders[i];
sal_Int32 result = pOrder->compare(aAddressee1, aAddressee2);