From 0df69aa16a31c8aebad9ddc38072a8ec13b01dd1 Mon Sep 17 00:00:00 2001 From: Miklos Vajna Date: Thu, 8 Oct 2015 21:47:54 +0200 Subject: sot: prefix members of StgAvlIterator Change-Id: I39254b14b5f167cfb180f989c56d7db88b73b8f0 --- sot/source/sdstor/stgavl.cxx | 14 +++++++------- sot/source/sdstor/stgavl.hxx | 6 +++--- 2 files changed, 10 insertions(+), 10 deletions(-) (limited to 'sot') diff --git a/sot/source/sdstor/stgavl.cxx b/sot/source/sdstor/stgavl.cxx index be26ac00f909..8baa8cf2bb7a 100644 --- a/sot/source/sdstor/stgavl.cxx +++ b/sot/source/sdstor/stgavl.cxx @@ -373,16 +373,16 @@ bool StgAvlNode::Remove( StgAvlNode** pRoot, StgAvlNode* pDel, bool bDel ) StgAvlIterator::StgAvlIterator( StgAvlNode* p ) { - pRoot = p; - nCount = 0; - nCur = 0; + m_pRoot = p; + m_nCount = 0; + m_nCur = 0; if( p ) - p->StgEnum( nCount ); + p->StgEnum( m_nCount ); } StgAvlNode* StgAvlIterator::Find( short n ) { - StgAvlNode* p = pRoot; + StgAvlNode* p = m_pRoot; while( p ) { if( n == p->nId ) @@ -394,13 +394,13 @@ StgAvlNode* StgAvlIterator::Find( short n ) StgAvlNode* StgAvlIterator::First() { - nCur = -1; + m_nCur = -1; return Next(); } StgAvlNode* StgAvlIterator::Next() { - return Find( ++nCur ); + return Find( ++m_nCur ); } /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ diff --git a/sot/source/sdstor/stgavl.hxx b/sot/source/sdstor/stgavl.hxx index 81109619ac42..5b29d0f7d2c7 100644 --- a/sot/source/sdstor/stgavl.hxx +++ b/sot/source/sdstor/stgavl.hxx @@ -51,9 +51,9 @@ public: // The iterator class provides single stepping through an AVL tree. class StgAvlIterator { - StgAvlNode* pRoot; // root entry (parent) - short nCount; // tree size - short nCur; // current element + StgAvlNode* m_pRoot; // root entry (parent) + short m_nCount; // tree size + short m_nCur; // current element StgAvlNode* Find( short ); public: explicit StgAvlIterator( StgAvlNode* ); -- cgit v1.2.3