summaryrefslogtreecommitdiff
path: root/sw/inc/bparr.hxx
diff options
context:
space:
mode:
authorAbdulmajeed Al-Abaulrazzaq <aalabdulrazzaq@kacst.edu.sa>2012-07-22 11:29:48 +0300
committerJan Holesovsky <kendy@suse.cz>2012-07-25 11:21:51 +0200
commitad760dad210204b89be5735a0773dba8df32f44c (patch)
tree054ba0f197584e053131edd63c86494feaeb154b /sw/inc/bparr.hxx
parent44e8b1c8ad917d3c4ed7efe9169e5197801198f2 (diff)
This is modifying comments to meet doxygen standards
Change-Id: I73cd4c901aa003abec43f55948c184672d2e14ff Reviewed-on: https://gerrit.libreoffice.org/338 Reviewed-by: Eike Rathke <erack@redhat.com> Tested-by: Jan Holesovsky <kendy@suse.cz> Reviewed-by: Jan Holesovsky <kendy@suse.cz>
Diffstat (limited to 'sw/inc/bparr.hxx')
-rw-r--r--sw/inc/bparr.hxx26
1 files changed, 13 insertions, 13 deletions
diff --git a/sw/inc/bparr.hxx b/sw/inc/bparr.hxx
index a2834d3bb06a..e5035a805547 100644
--- a/sw/inc/bparr.hxx
+++ b/sw/inc/bparr.hxx
@@ -67,24 +67,24 @@ typedef sal_Bool (*FnForEach)( const ElementPtr&, void* pArgs );
#define COMPRESSLVL 80
struct BlockInfo { // block info:
- BigPtrArray* pBigArr; // in this array the block is located
- ElementPtr* pData; // data block
- sal_uLong nStart, nEnd; // start- and end index
- sal_uInt16 nElem; // number of elements
+ BigPtrArray* pBigArr; ///< in this array the block is located
+ ElementPtr* pData; ///< data block
+ sal_uLong nStart, nEnd; ///< start- and end index
+ sal_uInt16 nElem; ///< number of elements
};
class SW_DLLPUBLIC BigPtrArray
{
BlockInfo** ppInf; // block info
- sal_uLong nSize; // number of elements
- sal_uInt16 nMaxBlock; // current max. number of blocks
- sal_uInt16 nBlock; // number of blocks
- sal_uInt16 nCur; // last block
-
- sal_uInt16 Index2Block( sal_uLong ) const; // block search
- BlockInfo* InsBlock( sal_uInt16 ); // insert block
- void BlockDel( sal_uInt16 ); // some blocks were deleted
- void UpdIndex( sal_uInt16 ); // recalculate indices
+ sal_uLong nSize; ///< number of elements
+ sal_uInt16 nMaxBlock; ///< current max. number of blocks
+ sal_uInt16 nBlock; ///< number of blocks
+ sal_uInt16 nCur; ///< last block
+
+ sal_uInt16 Index2Block( sal_uLong ) const; ///< block search
+ BlockInfo* InsBlock( sal_uInt16 ); ///< insert block
+ void BlockDel( sal_uInt16 ); ///< some blocks were deleted
+ void UpdIndex( sal_uInt16 ); ///< recalculate indices
protected:
// fill all blocks